Searched refs:NodeStack (Results 1 – 4 of 4) sorted by relevance
429 std::vector<NodeId> NodeStack; in reduce() local437 NodeStack.push_back(NId); in reduce()459 NodeStack.push_back(NId); in reduce()468 NodeStack.push_back(NId); in reduce()474 return NodeStack; in reduce()
2714 SmallVector<SDValue, 4> NodeStack; member2765 for (auto &J : I.NodeStack) in NodeDeleted()2829 SmallVector<SDValue, 8> NodeStack; in SelectCodeCommon() local2831 NodeStack.push_back(N); in SelectCodeCommon()2954 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); in SelectCodeCommon()2966 if (NodeStack.size() > 1) in SelectCodeCommon()2967 Parent = NodeStack[NodeStack.size()-2].getNode(); in SelectCodeCommon()3006 NodeStack.push_back(N); in SelectCodeCommon()3018 NodeStack.push_back(N); in SelectCodeCommon()3024 NodeStack.pop_back(); in SelectCodeCommon()[all …]
683 auto NodeStack = this->getNodes(); in shortCircuitJumps() local685 while (!NodeStack.empty()) { in shortCircuitJumps()686 auto *Node = NodeStack.back(); in shortCircuitJumps()687 NodeStack.pop_back(); in shortCircuitJumps()690 NodeStack.push_back(NewNode); in shortCircuitJumps()691 NodeStack.push_back(Node); in shortCircuitJumps()
39 using NodeStack = CordRepBtree * [CordRepBtree::kMaxDepth]; typedef323 NodeStack stack;