| /external/webrtc/webrtc/modules/audio_processing/transient/ |
| D | wpd_tree.cc | 35 nodes_.reset(new rtc::scoped_ptr<WPDNode>[num_nodes_ + 1]); in WPDTree()
39 nodes_[1].reset(new WPDNode(data_length, &kRootCoefficient, 1)); in WPDTree()
56 nodes_[index_left_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
59 nodes_[index_right_child].reset(new WPDNode(nodes_[index]->length() / 2, in WPDTree()
73 return nodes_[(1 << level) + index].get(); in NodeAt()
82 int update_result = nodes_[1]->set_data(data, data_length); in Update()
102 update_result = nodes_[index_left_child]->Update( in Update()
103 nodes_[index]->data(), nodes_[index]->length()); in Update()
108 update_result = nodes_[index_right_child]->Update( in Update()
109 nodes_[index]->data(), nodes_[index]->length()); in Update()
|
| D | wpd_tree.h | 86 rtc::scoped_ptr<rtc::scoped_ptr<WPDNode>[]> nodes_; variable
|
| /external/v8/src/compiler/ |
| D | schedule.h | 82 bool empty() const { return nodes_.empty(); } in NON_EXPORTED_BASE()
83 size_t size() const { return nodes_.size(); } in NON_EXPORTED_BASE()
84 Node* NodeAt(size_t index) { return nodes_[index]; } in NON_EXPORTED_BASE()
85 size_t NodeCount() const { return nodes_.size(); } in NON_EXPORTED_BASE()
87 value_type& front() { return nodes_.front(); } in NON_EXPORTED_BASE()
88 value_type const& front() const { return nodes_.front(); } in NON_EXPORTED_BASE()
91 iterator begin() { return nodes_.begin(); } in NON_EXPORTED_BASE()
92 iterator end() { return nodes_.end(); } in NON_EXPORTED_BASE()
95 const_iterator begin() const { return nodes_.begin(); } in NON_EXPORTED_BASE()
96 const_iterator end() const { return nodes_.end(); } in NON_EXPORTED_BASE()
[all …]
|
| D | instruction-scheduler.cc | 18 auto it = nodes_.begin(); in AddNode()
19 while ((it != nodes_.end()) && in AddNode()
23 nodes_.insert(it, node); in AddNode()
30 auto candidate = nodes_.end(); in PopBestCandidate()
31 for (auto iterator = nodes_.begin(); iterator != nodes_.end(); ++iterator) { in PopBestCandidate()
39 if (candidate != nodes_.end()) { in PopBestCandidate()
41 nodes_.erase(candidate); in PopBestCandidate()
53 auto candidate = nodes_.begin(); in PopBestCandidate()
55 static_cast<int>(nodes_.size()))); in PopBestCandidate()
57 nodes_.erase(candidate); in PopBestCandidate()
|
| D | load-elimination.h | 40 for (size_t i = 0; i < arraysize(nodes_); ++i) { in NON_EXPORTED_BASE()
41 nodes_[i] = nullptr; in NON_EXPORTED_BASE()
45 nodes_[next_index_++] = node; in NON_EXPORTED_BASE()
50 that->nodes_[that->next_index_] = node; in NON_EXPORTED_BASE()
51 that->next_index_ = (that->next_index_ + 1) % arraysize(nodes_); in NON_EXPORTED_BASE()
61 Node* nodes_[kMaxTrackedChecks]; in NON_EXPORTED_BASE()
|
| D | instruction-scheduler.h | 104 nodes_(scheduler->zone()) { in SchedulingQueueBase()
110 return nodes_.empty(); in IsEmpty()
115 ZoneLinkedList<ScheduleGraphNode*> nodes_; variable
|
| D | load-elimination.cc | 140 for (Node* const check : nodes_) { in Lookup()
150 for (size_t i = 0; i < arraysize(nodes_); ++i) { in Equals()
151 if (Node* this_node = this->nodes_[i]) { in Equals()
153 if (j == arraysize(nodes_)) return false; in Equals()
154 if (that->nodes_[j] == this_node) break; in Equals()
158 for (size_t i = 0; i < arraysize(nodes_); ++i) { in Equals()
159 if (Node* that_node = that->nodes_[i]) { in Equals()
161 if (j == arraysize(nodes_)) return false; in Equals()
162 if (this->nodes_[j] == that_node) break; in Equals()
173 for (Node* const this_node : this->nodes_) { in Merge()
[all …]
|
| D | schedule.cc | 27 nodes_(zone), in BasicBlock()
53 void BasicBlock::AddNode(Node* node) { nodes_.push_back(node); } in AddNode()
|
| D | simplified-lowering.cc | 270 nodes_(zone), in RepresentationSelector()
558 for (NodeVector::iterator i = nodes_.begin(); i != nodes_.end(); ++i) { in Run()
586 nodes_.push_back(node); in EnqueueInitial()
606 nodes_.push_back(node); in EnqueueInput()
2669 NodeVector nodes_; // collected nodes member in v8::internal::compiler::RepresentationSelector
|
| /external/v8/src/profiler/ |
| D | sampling-heap-profiler.h | 28 AllocationProfile() : nodes_() {} in AllocationProfile()
31 return nodes_.size() == 0 ? nullptr : &nodes_.front(); in GetRootNode()
34 std::deque<v8::AllocationProfile::Node>& nodes() { return nodes_; } in nodes()
37 std::deque<v8::AllocationProfile::Node> nodes_;
|
| /external/v8/src/ |
| D | fast-accessor-assembler.cc | 258 nodes_.push_back(node); in FromRaw()
259 ValueId value = {nodes_.size() - 1}; in FromRaw()
271 CHECK_LT(value.value_id, nodes_.size()); in FromId()
272 CHECK_NOT_NULL(nodes_.at(value.value_id)); in FromId()
273 return nodes_.at(value.value_id); in FromId()
286 nodes_.clear(); in Clear()
|
| D | fast-accessor-assembler.h | 106 std::vector<compiler::Node*> nodes_; variable
|
| D | global-handles.cc | 400 nodes_[i].Initialize(i, first_free); in PutNodesOnFreeList()
406 return &nodes_[index]; in node_at()
442 Node nodes_[kSize]; member in v8::internal::GlobalHandles::NodeBlock
|
| /external/jsoncpp/src/lib_json/ |
| D | json_reader.cpp | 126 while (!nodes_.empty()) in parse()
127 nodes_.pop(); in parse()
128 nodes_.push(&root); in parse()
438 nodes_.push(&value); in readObject()
440 nodes_.pop(); in readObject()
474 nodes_.push(&value); in readArray()
476 nodes_.pop(); in readArray()
752 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
|
| /external/protobuf/conformance/third_party/jsoncpp/ |
| D | jsoncpp.cpp | 321 while (!nodes_.empty()) in parse()
322 nodes_.pop(); in parse()
323 nodes_.push(&root); in parse()
679 nodes_.push(&value); in readObject()
681 nodes_.pop(); in readObject()
716 nodes_.push(&value); in readArray()
718 nodes_.pop(); in readArray()
965 Value& Reader::currentValue() { return *(nodes_.top()); } in currentValue()
1205 Nodes nodes_; member in Json::OurReader
1245 while (!nodes_.empty()) in parse()
[all …]
|
| D | json.h | 1480 Nodes nodes_; variable
|
| /external/jsoncpp/include/json/ |
| D | reader.h | 231 Nodes nodes_; variable
|
| /external/v8/src/regexp/ |
| D | regexp-ast.h | 254 ZoneList<RegExpTree*>* nodes() { return nodes_; } in nodes()
257 ZoneList<RegExpTree*>* nodes_;
|
| D | regexp-ast.cc | 322 : nodes_(nodes) { in RegExpAlternative()
|