2992   SmallVector<SDValue, 4> NodeStack;  member
3043       for (auto &J : I.NodeStack)  in NodeDeleted()
3126   SmallVector<SDValue, 8> NodeStack;  in SelectCodeCommon()  local
3128   NodeStack.push_back(N);  in SelectCodeCommon()
3252       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());  in SelectCodeCommon()
3264       if (NodeStack.size() > 1)  in SelectCodeCommon()
3265         Parent = NodeStack[NodeStack.size()-2].getNode();  in SelectCodeCommon()
3304       NodeStack.push_back(N);  in SelectCodeCommon()
3316       NodeStack.push_back(N);  in SelectCodeCommon()
3330       NodeStack.pop_back();  in SelectCodeCommon()
3331       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
3332       N = NodeStack.back();  in SelectCodeCommon()
3340       NodeStack.push_back(N);  in SelectCodeCommon()
3345       NodeStack.pop_back();  in SelectCodeCommon()
3346       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
3347       N = NodeStack.back();  in SelectCodeCommon()
3601       assert(NodeStack.size() != 1 && "No parent node");  in SelectCodeCommon()
3605       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) {  in SelectCodeCommon()
3607         SDNode *NS = NodeStack[i].getNode();  in SelectCodeCommon()
3620       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3622           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
4152       NodeStack.clear();  in SelectCodeCommon()
4153       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());  in SelectCodeCommon()
4154       N = NodeStack.back();  in SelectCodeCommon()