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
|
// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "extensions/common/features/base_feature_provider.h"
#include <stddef.h>
#include <stack>
#include <utility>
#include "base/strings/string_split.h"
#include "base/strings/string_util.h"
#include "extensions/common/extensions_client.h"
#include "extensions/common/features/complex_feature.h"
#include "extensions/common/features/simple_feature.h"
namespace extensions {
namespace {
bool IsNocompile(const base::Value& value) {
bool nocompile = false;
const base::DictionaryValue* as_dict = nullptr;
if (value.GetAsDictionary(&as_dict)) {
as_dict->GetBoolean("nocompile", &nocompile);
} else {
// "nocompile" is not supported for any other feature type.
}
return nocompile;
}
bool ParseFeature(const base::DictionaryValue* value,
const std::string& name,
SimpleFeature* feature) {
feature->set_name(name);
std::string error = feature->Parse(value);
if (!error.empty())
LOG(ERROR) << error;
return error.empty();
}
} // namespace
BaseFeatureProvider::BaseFeatureProvider(const base::DictionaryValue& root,
FeatureFactory factory)
: factory_(factory) {
for (base::DictionaryValue::Iterator iter(root); !iter.IsAtEnd();
iter.Advance()) {
if (IsNocompile(iter.value())) {
continue;
}
if (iter.value().GetType() == base::Value::TYPE_DICTIONARY) {
linked_ptr<SimpleFeature> feature((*factory_)());
std::vector<std::string> split = base::SplitString(
iter.key(), ".", base::TRIM_WHITESPACE, base::SPLIT_WANT_ALL);
// Push parent features on the stack, starting with the current feature.
// If one of the features has "noparent" set, stop pushing features on
// the stack. The features will then be parsed in order, starting with
// the farthest parent that is either top level or has "noparent" set.
std::stack<std::pair<std::string, const base::DictionaryValue*> >
parse_stack;
while (!split.empty()) {
std::string parent_name = base::JoinString(split, ".");
split.pop_back();
if (root.HasKey(parent_name)) {
const base::DictionaryValue* parent = nullptr;
if (!root.GetDictionaryWithoutPathExpansion(parent_name, &parent)) {
// If the parent is a complex feature, find the parent with the
// 'default_parent' flag.
const base::ListValue* parent_list = nullptr;
CHECK(root.GetListWithoutPathExpansion(parent_name, &parent_list));
for (size_t i = 0; i < parent_list->GetSize(); ++i) {
CHECK(parent_list->GetDictionary(i, &parent));
if (parent->HasKey("default_parent"))
break;
parent = nullptr;
}
CHECK(parent) << parent_name << " must declare one of its features"
<< " the default parent, with {\"default_parent\": true}.";
}
parse_stack.push(std::make_pair(parent_name, parent));
bool no_parent = false;
parent->GetBoolean("noparent", &no_parent);
if (no_parent)
break;
}
}
CHECK(!parse_stack.empty());
// Parse all parent features.
bool parse_error = false;
while (!parse_stack.empty()) {
if (!ParseFeature(parse_stack.top().second,
parse_stack.top().first,
feature.get())) {
parse_error = true;
break;
}
parse_stack.pop();
}
if (parse_error)
continue;
features_[iter.key()] = feature;
} else if (iter.value().GetType() == base::Value::TYPE_LIST) {
// This is a complex feature.
const base::ListValue* list =
static_cast<const base::ListValue*>(&iter.value());
CHECK_GT(list->GetSize(), 0UL);
scoped_ptr<ComplexFeature::FeatureList> features(
new ComplexFeature::FeatureList());
// Parse and add all SimpleFeatures from the list.
for (base::ListValue::const_iterator list_iter = list->begin();
list_iter != list->end(); ++list_iter) {
if ((*list_iter)->GetType() != base::Value::TYPE_DICTIONARY) {
LOG(ERROR) << iter.key() << ": Feature rules must be dictionaries.";
continue;
}
scoped_ptr<SimpleFeature> feature((*factory_)());
if (!ParseFeature(static_cast<const base::DictionaryValue*>(*list_iter),
iter.key(),
feature.get()))
continue;
features->push_back(std::move(feature));
}
linked_ptr<ComplexFeature> feature(
new ComplexFeature(std::move(features)));
feature->set_name(iter.key());
features_[iter.key()] = feature;
} else {
LOG(ERROR) << iter.key() << ": Feature description must be dictionary or"
<< " list of dictionaries.";
}
}
}
BaseFeatureProvider::~BaseFeatureProvider() {
}
const std::vector<std::string>& BaseFeatureProvider::GetAllFeatureNames()
const {
if (feature_names_.empty()) {
for (FeatureMap::const_iterator iter = features_.begin();
iter != features_.end(); ++iter) {
feature_names_.push_back(iter->first);
}
// A std::map is sorted by its keys, so we don't need to sort feature_names_
// now.
}
return feature_names_;
}
Feature* BaseFeatureProvider::GetFeature(const std::string& name) const {
FeatureMap::const_iterator iter = features_.find(name);
if (iter != features_.end())
return iter->second.get();
else
return nullptr;
}
Feature* BaseFeatureProvider::GetParent(Feature* feature) const {
CHECK(feature);
if (feature->no_parent())
return nullptr;
std::vector<std::string> split = base::SplitString(
feature->name(), ".", base::TRIM_WHITESPACE, base::SPLIT_WANT_ALL);
if (split.size() < 2)
return nullptr;
split.pop_back();
return GetFeature(base::JoinString(split, "."));
}
// Children of a given API are named starting with parent.name()+".", which
// means they'll be contiguous in the features_ std::map.
std::vector<Feature*> BaseFeatureProvider::GetChildren(const Feature& parent)
const {
std::string prefix = parent.name() + ".";
const FeatureMap::const_iterator first_child = features_.lower_bound(prefix);
// All children have names before (parent.name() + ('.'+1)).
++prefix[prefix.size() - 1];
const FeatureMap::const_iterator after_children =
features_.lower_bound(prefix);
std::vector<Feature*> result;
result.reserve(std::distance(first_child, after_children));
for (FeatureMap::const_iterator it = first_child; it != after_children;
++it) {
result.push_back(it->second.get());
}
return result;
}
} // namespace extensions
|
