Home
last modified time | relevance | path

Searched refs:AllNodes (Results 1 – 17 of 17) sorted by relevance

/external/v8/src/compiler/
Dall-nodes.cc13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph, bool only_inputs) in AllNodes() function in v8::internal::compiler::AllNodes
20 AllNodes::AllNodes(Zone* local_zone, Node* end, const Graph* graph, in AllNodes() function in v8::internal::compiler::AllNodes
28 void AllNodes::Mark(Zone* local_zone, Node* end, const Graph* graph) { in Mark()
Dall-nodes.h17 class AllNodes {
22 AllNodes(Zone* local_zone, Node* end, const Graph* graph,
26 AllNodes(Zone* local_zone, const Graph* graph, bool only_inputs = true);
Dgraph-visualizer.cc335 AllNodes all_;
336 AllNodes live_;
389 AllNodes all_;
Dstore-store-elimination.cc211 AllNodes all(temp_zone(), jsgraph()->graph()); in Find()
Descape-analysis-reducer.cc216 AllNodes all(zone(), jsgraph()->graph()); in VerifyReplacement()
Dverifier.cc41 void Check(Node* node, const AllNodes& all);
95 void Verifier::Visitor::Check(Node* node, const AllNodes& all) { in Check()
1779 AllNodes all(&zone, graph); in Run()
Djs-inlining.cc506 AllNodes inlined_nodes(local_zone_, end, graph()); in ReduceJSCall()
/external/swiftshader/third_party/subzero/src/
DIceLoopAnalyzer.cpp106 LoopNodeList AllNodes; member in Ice::LoopAnalyzer
149 AllNodes.reserve(Nodes.size()); in LoopAnalyzer()
155 AllNodes.emplace_back(Node); in LoopAnalyzer()
160 assert(AllNodes.size() == Func->getNodes().size()); in computeLoopNestDepth()
164 while (NumDeletedNodes < AllNodes.size()) { in computeLoopNestDepth()
166 for (LoopNode &Node : AllNodes) in computeLoopNestDepth()
172 for (LoopNode &Node : AllNodes) { in computeLoopNestDepth()
199 LoopNode &Succ = AllNodes[(*Node.currentSuccessor())->getIndex()]; in processNode()
209 LoopNode &Succ = AllNodes[(*Node.currentSuccessor())->getIndex()]; in processNode()
/external/chromium-trace/catapult/devil/devil/utils/
Dfind_usb_devices.py120 def AllNodes(self): member in USBNode
128 for descendant_node in child_node.AllNodes():
143 for node in self.AllNodes():
325 for device in bus.AllNodes():
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DSelectionDAG.cpp580 assert(N != AllNodes.begin() && "Cannot delete the entry node!"); in DeleteNodeNotInCSEMaps()
597 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()
841 AllNodes.push_back(&EntryNode); in SelectionDAG()
858 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()
859 AllNodes.remove(AllNodes.begin()); in allnodes_clear()
860 while (!AllNodes.empty()) in allnodes_clear()
861 DeallocateNode(AllNodes.begin()); in allnodes_clear()
878 AllNodes.push_back(&EntryNode); in clear()
967 AllNodes.push_back(N); in getConstant()
1009 AllNodes.push_back(N); in getConstantFP()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
DSelectionDAG.h149 ilist<SDNode> AllNodes;
238 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }
239 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }
241 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
242 allnodes_iterator allnodes_end() { return AllNodes.end(); }
244 return AllNodes.size();
884 AllNodes.insert(Position, AllNodes.remove(N));
/external/llvm/include/llvm/CodeGen/
DSelectionDAG.h195 ilist<SDNode> AllNodes;
359 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }
360 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }
362 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
363 allnodes_iterator allnodes_end() { return AllNodes.end(); }
365 return AllNodes.size();
1159 AllNodes.insert(Position, AllNodes.remove(N));
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
DSelectionDAG.h246 ilist<SDNode> AllNodes;
434 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }
435 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }
439 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
440 allnodes_iterator allnodes_end() { return AllNodes.end(); }
443 return AllNodes.size();
1324 AllNodes.insert(Position, AllNodes.remove(N));
/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAG.cpp638 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()
665 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()
717 AllNodes.push_back(N); in InsertNode()
908 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()
909 AllNodes.remove(AllNodes.begin()); in allnodes_clear()
910 while (!AllNodes.empty()) in allnodes_clear()
911 DeallocateNode(&AllNodes.front()); in allnodes_clear()
6582 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()
6583 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()
6608 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P)); in AssignTopologicalOrder()
[all …]
DSelectionDAGDumper.cpp595 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAG.cpp732 assert(N->getIterator() != AllNodes.begin() && in DeleteNodeNotInCSEMaps()
755 NodeAllocator.Deallocate(AllNodes.remove(N)); in DeallocateNode()
814 AllNodes.push_back(N); in InsertNode()
1006 assert(&*AllNodes.begin() == &EntryNode); in allnodes_clear()
1007 AllNodes.remove(AllNodes.begin()); in allnodes_clear()
1008 while (!AllNodes.empty()) in allnodes_clear()
1009 DeallocateNode(&AllNodes.front()); in allnodes_clear()
7827 Order.reserve(AllNodes.size()); in CreateTopologicalOrder()
7960 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q)); in AssignTopologicalOrder()
7961 assert(SortedPos != AllNodes.end() && "Overran node list"); in AssignTopologicalOrder()
[all …]
DSelectionDAGDumper.cpp709 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n"; in dump()