HomeSort by: relevance | last modified time | path
    Searched refs:AllNodes (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
SelectionDAG.h 243 ilist<SDNode> AllNodes;
493 allnodes_const_iterator allnodes_begin() const { return AllNodes.begin(); }
494 allnodes_const_iterator allnodes_end() const { return AllNodes.end(); }
498 allnodes_iterator allnodes_begin() { return AllNodes.begin(); }
499 allnodes_iterator allnodes_end() { return AllNodes.end(); }
502 return AllNodes.size();
505 iterator_range<allnodes_iterator> allnodes() { function in class:llvm::SelectionDAG
508 iterator_range<allnodes_const_iterator> allnodes() const { function in class:llvm::SelectionDAG
1569 /// Topological-sort the AllNodes list and a
1574 /// Move node N in the AllNodes list to be immediatel
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAG.cpp 802 // Create a dummy node (which is not added to allnodes), that adds a reference
809 for (SDNode &Node : allnodes())
871 // AllNodes list, and delete the node.
876 assert(N->getIterator() != AllNodes.begin() &&
910 NodeAllocator.Deallocate(AllNodes.remove(N));
969 AllNodes.push_back(N);
1171 assert(&*AllNodes.begin() == &EntryNode);
1172 AllNodes.remove(AllNodes.begin());
1173 while (!AllNodes.empty()
    [all...]
SelectionDAGDumper.cpp 912 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:\n";
914 for (const SDNode &N : allnodes()) {

Completed in 29 milliseconds