1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
|
/*
* Copyright (C) 2017 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#define DEBUG false // STOPSHIP if true
#include "Log.h"
#include "CombinationConditionTracker.h"
namespace android {
namespace os {
namespace statsd {
using std::unordered_map;
using std::vector;
CombinationConditionTracker::CombinationConditionTracker(const int64_t& id, const int index,
const uint64_t protoHash)
: ConditionTracker(id, index, protoHash) {
VLOG("creating CombinationConditionTracker %lld", (long long)mConditionId);
}
CombinationConditionTracker::~CombinationConditionTracker() {
VLOG("~CombinationConditionTracker() %lld", (long long)mConditionId);
}
bool CombinationConditionTracker::init(const vector<Predicate>& allConditionConfig,
const vector<sp<ConditionTracker>>& allConditionTrackers,
const unordered_map<int64_t, int>& conditionIdIndexMap,
vector<bool>& stack,
vector<ConditionState>& conditionCache) {
VLOG("Combination predicate init() %lld", (long long)mConditionId);
if (mInitialized) {
// All the children are guaranteed to be initialized, but the recursion is needed to
// fill the conditionCache properly, since another combination condition or metric
// might rely on this. The recursion is needed to compute the current condition.
// Init is called instead of isConditionMet so that the ConditionKey can be filled with the
// default key for sliced conditions, since we do not know all indirect descendants here.
for (const int childIndex : mChildren) {
if (conditionCache[childIndex] == ConditionState::kNotEvaluated) {
allConditionTrackers[childIndex]->init(allConditionConfig, allConditionTrackers,
conditionIdIndexMap, stack, conditionCache);
}
}
conditionCache[mIndex] =
evaluateCombinationCondition(mChildren, mLogicalOperation, conditionCache);
return true;
}
// mark this node as visited in the recursion stack.
stack[mIndex] = true;
Predicate_Combination combinationCondition = allConditionConfig[mIndex].combination();
if (!combinationCondition.has_operation()) {
return false;
}
mLogicalOperation = combinationCondition.operation();
if (mLogicalOperation == LogicalOperation::NOT && combinationCondition.predicate_size() != 1) {
return false;
}
for (auto child : combinationCondition.predicate()) {
auto it = conditionIdIndexMap.find(child);
if (it == conditionIdIndexMap.end()) {
ALOGW("Predicate %lld not found in the config", (long long)child);
return false;
}
int childIndex = it->second;
const auto& childTracker = allConditionTrackers[childIndex];
// if the child is a visited node in the recursion -> circle detected.
if (stack[childIndex]) {
ALOGW("Circle detected!!!");
return false;
}
bool initChildSucceeded = childTracker->init(allConditionConfig, allConditionTrackers,
conditionIdIndexMap, stack, conditionCache);
if (!initChildSucceeded) {
ALOGW("Child initialization failed %lld ", (long long)child);
return false;
} else {
VLOG("Child initialization success %lld ", (long long)child);
}
if (allConditionTrackers[childIndex]->isSliced()) {
setSliced(true);
mSlicedChildren.push_back(childIndex);
} else {
mUnSlicedChildren.push_back(childIndex);
}
mChildren.push_back(childIndex);
mTrackerIndex.insert(childTracker->getAtomMatchingTrackerIndex().begin(),
childTracker->getAtomMatchingTrackerIndex().end());
}
mUnSlicedPartCondition =
evaluateCombinationCondition(mUnSlicedChildren, mLogicalOperation, conditionCache);
conditionCache[mIndex] =
evaluateCombinationCondition(mChildren, mLogicalOperation, conditionCache);
// unmark this node in the recursion stack.
stack[mIndex] = false;
mInitialized = true;
return true;
}
bool CombinationConditionTracker::onConfigUpdated(
const vector<Predicate>& allConditionProtos, const int index,
const vector<sp<ConditionTracker>>& allConditionTrackers,
const unordered_map<int64_t, int>& atomMatchingTrackerMap,
const unordered_map<int64_t, int>& conditionTrackerMap) {
ConditionTracker::onConfigUpdated(allConditionProtos, index, allConditionTrackers,
atomMatchingTrackerMap, conditionTrackerMap);
mTrackerIndex.clear();
mChildren.clear();
mUnSlicedChildren.clear();
mSlicedChildren.clear();
Predicate_Combination combinationCondition = allConditionProtos[mIndex].combination();
for (const int64_t child : combinationCondition.predicate()) {
const auto& it = conditionTrackerMap.find(child);
if (it == conditionTrackerMap.end()) {
ALOGW("Predicate %lld not found in the config", (long long)child);
return false;
}
int childIndex = it->second;
const sp<ConditionTracker>& childTracker = allConditionTrackers[childIndex];
// Ensures that the child's tracker indices are updated.
if (!childTracker->onConfigUpdated(allConditionProtos, childIndex, allConditionTrackers,
atomMatchingTrackerMap, conditionTrackerMap)) {
ALOGW("Child update failed %lld ", (long long)child);
return false;
}
if (allConditionTrackers[childIndex]->isSliced()) {
mSlicedChildren.push_back(childIndex);
} else {
mUnSlicedChildren.push_back(childIndex);
}
mChildren.push_back(childIndex);
mTrackerIndex.insert(childTracker->getAtomMatchingTrackerIndex().begin(),
childTracker->getAtomMatchingTrackerIndex().end());
}
return true;
}
void CombinationConditionTracker::isConditionMet(
const ConditionKey& conditionParameters, const vector<sp<ConditionTracker>>& allConditions,
const bool isPartialLink,
vector<ConditionState>& conditionCache) const {
// So far, this is fine as there is at most one child having sliced output.
for (const int childIndex : mChildren) {
if (conditionCache[childIndex] == ConditionState::kNotEvaluated) {
allConditions[childIndex]->isConditionMet(conditionParameters, allConditions,
isPartialLink,
conditionCache);
}
}
conditionCache[mIndex] =
evaluateCombinationCondition(mChildren, mLogicalOperation, conditionCache);
}
void CombinationConditionTracker::evaluateCondition(
const LogEvent& event, const std::vector<MatchingState>& eventMatcherValues,
const std::vector<sp<ConditionTracker>>& mAllConditions,
std::vector<ConditionState>& nonSlicedConditionCache,
std::vector<bool>& conditionChangedCache) {
// value is up to date.
if (nonSlicedConditionCache[mIndex] != ConditionState::kNotEvaluated) {
return;
}
for (const int childIndex : mChildren) {
// So far, this is fine as there is at most one child having sliced output.
if (nonSlicedConditionCache[childIndex] == ConditionState::kNotEvaluated) {
const sp<ConditionTracker>& child = mAllConditions[childIndex];
child->evaluateCondition(event, eventMatcherValues, mAllConditions,
nonSlicedConditionCache, conditionChangedCache);
}
}
ConditionState newCondition =
evaluateCombinationCondition(mChildren, mLogicalOperation, nonSlicedConditionCache);
if (!mSliced) {
bool nonSlicedChanged = (mUnSlicedPartCondition != newCondition);
mUnSlicedPartCondition = newCondition;
nonSlicedConditionCache[mIndex] = mUnSlicedPartCondition;
conditionChangedCache[mIndex] = nonSlicedChanged;
} else {
mUnSlicedPartCondition = evaluateCombinationCondition(mUnSlicedChildren, mLogicalOperation,
nonSlicedConditionCache);
for (const int childIndex : mChildren) {
// If any of the sliced condition in children condition changes, the combination
// condition may be changed too.
if (conditionChangedCache[childIndex]) {
conditionChangedCache[mIndex] = true;
break;
}
}
nonSlicedConditionCache[mIndex] = newCondition;
VLOG("CombinationPredicate %lld sliced may changed? %d", (long long)mConditionId,
conditionChangedCache[mIndex] == true);
}
}
bool CombinationConditionTracker::equalOutputDimensions(
const std::vector<sp<ConditionTracker>>& allConditions,
const vector<Matcher>& dimensions) const {
if (mSlicedChildren.size() != 1 ||
mSlicedChildren.front() >= (int)allConditions.size() ||
mLogicalOperation != LogicalOperation::AND) {
return false;
}
const sp<ConditionTracker>& slicedChild = allConditions.at(mSlicedChildren.front());
return slicedChild->equalOutputDimensions(allConditions, dimensions);
}
} // namespace statsd
} // namespace os
} // namespace android
|
