| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| wpd_tree.cc | 33 // Size is 1 more, so we can use the array as 1-based. nodes_[0] is never
35 nodes_.reset(new rtc::scoped_ptr<WPDNode>[num_nodes_ + 1]);
39 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1));
56 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2,
59 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2,
73 return nodes_[(1 << level) + index].get();
82 int update_result = nodes_[1]->set_data(data, data_length);
102 update_result = nodes_[index_left_child]->Update
[all...] |
| wpd_tree.h | 86 rtc::scoped_ptr<rtc::scoped_ptr<WPDNode>[]> nodes_; member in class:webrtc::WPDTree
|
| /external/v8/src/compiler/ |
| instruction-scheduler.cc | 18 auto it = nodes_.begin();
19 while ((it != nodes_.end()) &&
23 nodes_.insert(it, node);
30 auto candidate = nodes_.end();
31 for (auto iterator = nodes_.begin(); iterator != nodes_.end(); ++iterator) {
39 if (candidate != nodes_.end()) {
41 nodes_.erase(candidate);
53 auto candidate = nodes_.begin();
55 static_cast<int>(nodes_.size())))
[all...] |
| schedule.h | 82 bool empty() const { return nodes_.empty(); }
83 size_t size() const { return nodes_.size(); }
84 Node* NodeAt(size_t index) { return nodes_[index]; }
85 size_t NodeCount() const { return nodes_.size(); }
87 value_type& front() { return nodes_.front(); }
88 value_type const& front() const { return nodes_.front(); }
91 iterator begin() { return nodes_.begin(); }
92 iterator end() { return nodes_.end(); }
95 const_iterator begin() const { return nodes_.begin(); }
96 const_iterator end() const { return nodes_.end();
166 NodeVector nodes_; \/\/ nodes of this block in forward order. member in class:v8::internal::compiler::final
[all...] |
| instruction-scheduler.h | 104 nodes_(scheduler->zone()) {
110 return nodes_.empty();
115 ZoneLinkedList<ScheduleGraphNode*> nodes_; member in class:v8::internal::compiler::final::SchedulingQueueBase
|
| load-elimination.h | 40 for (size_t i = 0; i < arraysize(nodes_); ++i) {
41 nodes_[i] = nullptr;
45 nodes_[next_index_++] = node;
50 that->nodes_[that->next_index_] = node;
51 that->next_index_ = (that->next_index_ + 1) % arraysize(nodes_);
61 Node* nodes_[kMaxTrackedChecks]; member in class:v8::internal::compiler::final::final
|
| load-elimination.cc | 140 for (Node* const check : nodes_) {
150 for (size_t i = 0; i < arraysize(nodes_); ++i) {
151 if (Node* this_node = this->nodes_[i]) {
153 if (j == arraysize(nodes_)) return false;
154 if (that->nodes_[j] == this_node) break;
158 for (size_t i = 0; i < arraysize(nodes_); ++i) {
159 if (Node* that_node = that->nodes_[i]) {
161 if (j == arraysize(nodes_)) return false;
162 if (this->nodes_[j] == that_node) break;
173 for (Node* const this_node : this->nodes_) {
[all...] |
| schedule.cc | 27 nodes_(zone),
53 void BasicBlock::AddNode(Node* node) { nodes_.push_back(node); }
|
| simplified-lowering.cc | 270 nodes_(zone),
557 // Process nodes from the collected {nodes_} vector.
558 for (NodeVector::iterator i = nodes_.begin(); i != nodes_.end(); ++i) {
586 nodes_.push_back(node);
591 // for that input node. Add the input to {nodes_} if this is the first time
606 nodes_.push_back(node);
2669 NodeVector nodes_; \/\/ collected nodes member in class:v8::internal::compiler::RepresentationSelector
[all...] |
| /external/v8/src/profiler/ |
| sampling-heap-profiler.h | 28 AllocationProfile() : nodes_() {}
31 return nodes_.size() == 0 ? nullptr : &nodes_.front();
34 std::deque<v8::AllocationProfile::Node>& nodes() { return nodes_; }
37 std::deque<v8::AllocationProfile::Node> nodes_; member in class:v8::internal::AllocationProfile
|
| /external/v8/src/ |
| fast-accessor-assembler.cc | 258 nodes_.push_back(node);
259 ValueId value = {nodes_.size() - 1};
271 CHECK_LT(value.value_id, nodes_.size());
272 CHECK_NOT_NULL(nodes_.at(value.value_id));
273 return nodes_.at(value.value_id);
286 nodes_.clear();
|
| fast-accessor-assembler.h | 106 std::vector<compiler::Node*> nodes_; member in class:v8::internal::FastAccessorAssembler
|
| global-handles.cc | 400 nodes_[i].Initialize(i, first_free);
406 return &nodes_[index];
442 Node nodes_[kSize];
[all...] |
| /build/kati/ |
| ninja.cc | 199 for (NinjaNode* nn : nodes_)
250 nodes_.push_back(nn);
609 int num_nodes_per_task = nodes_.size() / (g_flags.num_jobs * 10) + 1;
610 int num_tasks = nodes_.size() / num_nodes_per_task + 1;
615 static_cast<int>(nodes_.size()));
617 EmitNode(nodes_[j], &bufs[i]);
793 vector<NinjaNode*> nodes_; member in class:NinjaGenerator
|
| /external/jsoncpp/src/lib_json/ |
| json_reader.cpp | 126 while (!nodes_.empty())
127 nodes_.pop();
128 nodes_.push(&root);
438 nodes_.push(&value);
440 nodes_.pop();
474 nodes_.push(&value);
476 nodes_.pop();
752 Value& Reader::currentValue() { return *(nodes_.top()); }
|
| /external/jsoncpp/include/json/ |
| reader.h | 231 Nodes nodes_; member in class:Json::Reader
|
| /external/protobuf/conformance/third_party/jsoncpp/ |
| jsoncpp.cpp | 321 while (!nodes_.empty())
322 nodes_.pop();
323 nodes_.push(&root);
679 nodes_.push(&value);
681 nodes_.pop();
716 nodes_.push(&value);
718 nodes_.pop();
965 Value& Reader::currentValue() { return *(nodes_.top()); }
[all...] |
| json.h | 1480 Nodes nodes_; member in class:Json::Reader
[all...] |
| /external/v8/src/regexp/ |
| regexp-ast.h | 254 ZoneList<RegExpTree*>* nodes() { return nodes_; }
257 ZoneList<RegExpTree*>* nodes_; member in class:v8::internal::final
|
| regexp-ast.cc | 322 : nodes_(nodes) {
|
| /prebuilts/tools/common/m2/repository/net/sourceforge/htmlunit/htmlunit/2.14/ |
| htmlunit-2.14.jar | |
