3126   SmallVector<SDValue, 4> NodeStack;  member
3177       for (auto &J : I.NodeStack)  in NodeDeleted()
3269   SmallVector<SDValue, 8> NodeStack;  in SelectCodeCommon()  local
3271   NodeStack.push_back(N);  in SelectCodeCommon()
3395       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());  in SelectCodeCommon()
3407       if (NodeStack.size() > 1)  in SelectCodeCommon()
3408         Parent = NodeStack[NodeStack.size()-2].getNode();  in SelectCodeCommon()
3447       NodeStack.push_back(N);  in SelectCodeCommon()
3459       NodeStack.push_back(N);  in SelectCodeCommon()
3473       NodeStack.pop_back();  in SelectCodeCommon()
3474       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
3475       N = NodeStack.back();  in SelectCodeCommon()
3483       NodeStack.push_back(N);  in SelectCodeCommon()
3488       NodeStack.pop_back();  in SelectCodeCommon()
3489       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
3490       N = NodeStack.back();  in SelectCodeCommon()
3744       assert(NodeStack.size() != 1 && "No parent node");  in SelectCodeCommon()
3748       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) {  in SelectCodeCommon()
3750         SDNode *NS = NodeStack[i].getNode();  in SelectCodeCommon()
3763       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3765           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
4295       NodeStack.clear();  in SelectCodeCommon()
4296       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());  in SelectCodeCommon()
4297       N = NodeStack.back();  in SelectCodeCommon()