CombinationConditionTracker.cpp revision caf339d004fad667748b68912c254df4e75cdc5a 
1/*
2 * Copyright (C) 2017 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 *      http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16#define LOG_TAG "CombinationConditionTracker"
17#define DEBUG true  // STOPSHIP if true
18#define VLOG(...) \
19    if (DEBUG) ALOGD(__VA_ARGS__);
20
21#include "CombinationConditionTracker.h"
22#include <cutils/log.h>
23#include <log/logprint.h>
24using std::string;
25using std::unique_ptr;
26using std::unordered_map;
27using std::vector;
28
29namespace android {
30namespace os {
31namespace statsd {
32
33CombinationConditionTracker::CombinationConditionTracker(const string& name, const int index)
34    : ConditionTracker(name, index) {
35    VLOG("creating CombinationConditionTracker %s", mName.c_str());
36}
37
38CombinationConditionTracker::~CombinationConditionTracker() {
39    VLOG("~CombinationConditionTracker() %s", mName.c_str());
40}
41
42bool CombinationConditionTracker::init(const vector<Condition>& allConditionConfig,
43                                       const vector<sp<ConditionTracker>>& allConditionTrackers,
44                                       const unordered_map<string, int>& conditionNameIndexMap,
45                                       vector<bool>& stack) {
46    VLOG("Combiniation condition init() %s", mName.c_str());
47    if (mInitialized) {
48        return true;
49    }
50
51    // mark this node as visited in the recursion stack.
52    stack[mIndex] = true;
53
54    Condition_Combination combinationCondition = allConditionConfig[mIndex].combination();
55
56    if (!combinationCondition.has_operation()) {
57        return false;
58    }
59    mLogicalOperation = combinationCondition.operation();
60
61    if (mLogicalOperation == LogicalOperation::NOT && combinationCondition.condition_size() != 1) {
62        return false;
63    }
64
65    for (string child : combinationCondition.condition()) {
66        auto it = conditionNameIndexMap.find(child);
67
68        if (it == conditionNameIndexMap.end()) {
69            ALOGW("Condition %s not found in the config", child.c_str());
70            return false;
71        }
72
73        int childIndex = it->second;
74        const auto& childTracker = allConditionTrackers[childIndex];
75        // if the child is a visited node in the recursion -> circle detected.
76        if (stack[childIndex]) {
77            ALOGW("Circle detected!!!");
78            return false;
79        }
80
81        bool initChildSucceeded = childTracker->init(allConditionConfig, allConditionTrackers,
82                                                     conditionNameIndexMap, stack);
83
84        if (!initChildSucceeded) {
85            ALOGW("Child initialization failed %s ", child.c_str());
86            return false;
87        } else {
88            ALOGW("Child initialization success %s ", child.c_str());
89        }
90
91        mChildren.push_back(childIndex);
92
93        mTrackerIndex.insert(childTracker->getLogTrackerIndex().begin(),
94                             childTracker->getLogTrackerIndex().end());
95    }
96
97    // unmark this node in the recursion stack.
98    stack[mIndex] = false;
99
100    mInitialized = true;
101
102    return true;
103}
104
105bool CombinationConditionTracker::evaluateCondition(
106        const LogEventWrapper& event, const std::vector<MatchingState>& eventMatcherValues,
107        const std::vector<sp<ConditionTracker>>& mAllConditions,
108        std::vector<ConditionState>& conditionCache, std::vector<bool>& changedCache) {
109    // value is up to date.
110    if (conditionCache[mIndex] != ConditionState::kNotEvaluated) {
111        return false;
112    }
113
114    for (const int childIndex : mChildren) {
115        if (conditionCache[childIndex] == ConditionState::kNotEvaluated) {
116            const sp<ConditionTracker>& child = mAllConditions[childIndex];
117            child->evaluateCondition(event, eventMatcherValues, mAllConditions, conditionCache,
118                                     changedCache);
119        }
120    }
121
122    ConditionState newCondition =
123            evaluateCombinationCondition(mChildren, mLogicalOperation, conditionCache);
124
125    bool changed = (mConditionState != newCondition);
126    mConditionState = newCondition;
127
128    conditionCache[mIndex] = mConditionState;
129
130    changedCache[mIndex] = changed;
131    return changed;
132}
133
134}  // namespace statsd
135}  // namespace os
136}  // namespace android
137