Home
last modified time | relevance | path

Searched refs:NodeStack (Results 1 – 4 of 4) sorted by relevance

/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAGISel.cpp2540 SmallVector<SDValue, 4> NodeStack; member
2586 for (auto &J : I.NodeStack) in NodeDeleted()
2638 SmallVector<SDValue, 8> NodeStack; in SelectCodeCommon() local
2640 NodeStack.push_back(N); in SelectCodeCommon()
2765 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); in SelectCodeCommon()
2778 if (NodeStack.size() > 1) in SelectCodeCommon()
2779 Parent = NodeStack[NodeStack.size()-2].getNode(); in SelectCodeCommon()
2812 NodeStack.push_back(N); in SelectCodeCommon()
2818 NodeStack.pop_back(); in SelectCodeCommon()
2819 assert(!NodeStack.empty() && "Node stack imbalance!"); in SelectCodeCommon()
[all …]
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h494 std::vector<NodeId> NodeStack; in reduce() local
502 NodeStack.push_back(NId); in reduce()
524 NodeStack.push_back(NId); in reduce()
534 NodeStack.push_back(NId); in reduce()
540 return NodeStack; in reduce()
/external/llvm/lib/Analysis/
DLazyCallGraph.cpp581 SmallVectorImpl<Node *> &NodeStack) { in formSCC() argument
586 while (!NodeStack.empty() && NodeStack.back()->DFSNumber > RootN->DFSNumber) { in formSCC()
587 assert(NodeStack.back()->LowLink >= RootN->LowLink && in formSCC()
590 NewSCC->insert(*NodeStack.pop_back_val()); in formSCC()
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h513 SCC *formSCC(Node *RootN, SmallVectorImpl<Node *> &NodeStack);