2876   SmallVector<SDValue, 4> NodeStack;  member
2927       for (auto &J : I.NodeStack)  in NodeDeleted()
2989   SmallVector<SDValue, 8> NodeStack;  in SelectCodeCommon()  local
2991   NodeStack.push_back(N);  in SelectCodeCommon()
3114       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());  in SelectCodeCommon()
3126       if (NodeStack.size() > 1)  in SelectCodeCommon()
3127         Parent = NodeStack[NodeStack.size()-2].getNode();  in SelectCodeCommon()
3166       NodeStack.push_back(N);  in SelectCodeCommon()
3178       NodeStack.push_back(N);  in SelectCodeCommon()
3184       NodeStack.pop_back();  in SelectCodeCommon()
3185       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
3186       N = NodeStack.back();  in SelectCodeCommon()
3353       assert(NodeStack.size() != 1 && "No parent node");  in SelectCodeCommon()
3357       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)  in SelectCodeCommon()
3358         if (!NodeStack[i].getNode()->hasOneUse()) {  in SelectCodeCommon()
3366       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3368           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3759       NodeStack.clear();  in SelectCodeCommon()
3760       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());  in SelectCodeCommon()
3761       N = NodeStack.back();  in SelectCodeCommon()