| /external/v8/test/cctest/compiler/ |
| D | test-node-algorithm.cc | 28 nodes_.push_back(node); in Pre()
31 std::vector<Node*> nodes_; member in PreNodeVisitor
39 nodes_.push_back(node); in Post()
42 std::vector<Node*> nodes_; member in PostNodeVisitor
52 CHECK_EQ(1, static_cast<int>(node_visitor.nodes_.size())); in TEST()
67 CHECK_EQ(5, static_cast<int>(node_visitor.nodes_.size())); in TEST()
68 CHECK(graph.start()->id() == node_visitor.nodes_[0]->id()); in TEST()
69 CHECK(n2->id() == node_visitor.nodes_[1]->id()); in TEST()
70 CHECK(n3->id() == node_visitor.nodes_[2]->id()); in TEST()
71 CHECK(n4->id() == node_visitor.nodes_[3]->id()); in TEST()
[all …]
|
| D | test-graph-reducer.cc | 631 nodes_(NodeSet::key_compare(), NodeSet::allocator_type(zone)) {} in OneTimeReducer()
633 CHECK_EQ(0, static_cast<int>(nodes_.count(node))); in Reduce()
634 nodes_.insert(node); in Reduce()
638 NodeSet nodes_; member in OneTimeReducer
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| D | pdt.h | 75 nodes_.push_back(StackNode(-1, -1)); // Tree root. in PdtStack()
98 child_id = nodes_.size(); in Find()
99 nodes_.push_back(StackNode(stack_id, paren_id)); in Find()
104 const StackNode &node = nodes_[stack_id]; in Find()
114 return nodes_[stack_id].parent_id; in Pop()
119 return nodes_[stack_id].paren_id; in Top()
140 vector<StackNode> nodes_; variable
|
| /external/v8/src/compiler/ |
| D | schedule.h | 53 NodeVector nodes_; // nodes of this block in forward order. variable
66 nodes_(zone) {} in BasicBlockData()
130 iterator begin() { return nodes_.begin(); } in begin()
131 iterator end() { return nodes_.end(); } in end()
134 const_iterator begin() const { return nodes_.begin(); } in begin()
135 const_iterator end() const { return nodes_.end(); } in end()
138 reverse_iterator rbegin() { return nodes_.rbegin(); } in rbegin()
139 reverse_iterator rend() { return nodes_.rend(); } in rend()
224 block->nodes_.push_back(node); in AddNode()
|
| D | verifier.cc | 262 if (block->nodes_[use_pos] == node) return true; in HasDominatingDef()
267 use_pos = static_cast<int>(block->nodes_.size()) - 1; in HasDominatingDef()
281 use_pos = static_cast<int>(use_block->nodes_.size()) - 1; in CheckInputsDominate()
444 static_cast<int>(block->nodes_.size()) - 1); in Run()
447 for (size_t i = 0; i < block->nodes_.size(); i++) { in Run()
448 Node* node = block->nodes_[i]; in Run()
|
| D | simplified-lowering.cc | 67 nodes_(zone), in RepresentationSelector()
98 for (NodeVector::iterator i = nodes_.begin(); i != nodes_.end(); ++i) { in Run()
123 nodes_.push_back(node); in Enqueue()
771 NodeVector nodes_; // collected nodes member in v8::internal::compiler::RepresentationSelector
|
| D | scheduler.cc | 645 for (int j = static_cast<int>(block->nodes_.size()) - 1; j >= 0; j--) { in ConnectFloatingControl()
646 Node* node = block->nodes_[j]; in ConnectFloatingControl()
663 Node* block_start = block->nodes_[0]; in ConnectFloatingControlSubgraph()
|
| /external/jsoncpp/src/lib_json/ |
| D | json_reader.cpp | 158 while ( !nodes_.empty() ) in parse()
159 nodes_.pop(); in parse()
160 nodes_.push( &root ); in parse()
499 nodes_.push( &value ); in readObject()
501 nodes_.pop(); in readObject()
543 nodes_.push( &value ); in readArray()
545 nodes_.pop(); in readArray()
822 return *(nodes_.top()); in currentValue()
|
| /external/jsoncpp/include/json/ |
| D | reader.h | 172 Nodes nodes_; variable
|
| /external/v8/src/ |
| D | global-handles.cc | 314 nodes_[i].Initialize(i, first_free); in PutNodesOnFreeList()
320 return &nodes_[index]; in node_at()
356 Node nodes_[kSize]; member in v8::internal::GlobalHandles::NodeBlock
|
| D | ast.cc | 980 : nodes_(nodes) { in RegExpAlternative()
|
| D | ast.h | 2657 ZoneList<RegExpTree*>* nodes() { return nodes_; } in nodes()
2659 ZoneList<RegExpTree*>* nodes_;
|
| /external/chromium-trace/trace-viewer/tracing/third_party/components/webcomponentsjs/ |
| D | webcomponents-lite.min.js | 11 …nodes_.forEach(function(t){var n=v.get(t);n&&n.forEach(function(t){t.observer===e&&t.removeTransie… property
|
| D | webcomponents-lite.js | 109 observer.nodes_.forEach(function(node) {
134 this.nodes_ = []; property in anonymousFunctione2a978dc0400.JsMutationObserver
158 this.nodes_.push(target);
163 this.nodes_.forEach(function(node) {
|
| D | ShadowDOM.js | 573 for (var i = 0; i < observer.nodes_.length; i++) {
574 var node = observer.nodes_[i];
650 this.nodes_ = []; property in anonymousFunction1ed01b431200.MutationObserver
673 this.nodes_.push(target);
677 this.nodes_.forEach(function(node) {
|
| D | ShadowDOM.min.js | 11 …nodes_.length;t++){var n=e.nodes_[t],r=f.get(n);if(!r)return;for(var o=0;o<r.length;o++){var i=r[o… property
|
| D | webcomponents.min.js | 11 …nodes_.length;t++){var n=e.nodes_[t],r=f.get(n);if(!r)return;for(var o=0;o<r.length;o++){var i=r[o… property
|
| D | webcomponents.js | 612 for (var i = 0; i < observer.nodes_.length; i++) {
613 var node = observer.nodes_[i];
689 this.nodes_ = []; property in anonymousFunctionc14c57611500.MutationObserver
712 this.nodes_.push(target);
716 this.nodes_.forEach(function(node) {
|