2556   SmallVector<SDValue, 4> NodeStack;  member
2602       for (auto &J : I.NodeStack)  in NodeDeleted()
2653   SmallVector<SDValue, 8> NodeStack;  in SelectCodeCommon()  local
2655   NodeStack.push_back(N);  in SelectCodeCommon()
2780       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());  in SelectCodeCommon()
2793       if (NodeStack.size() > 1)  in SelectCodeCommon()
2794         Parent = NodeStack[NodeStack.size()-2].getNode();  in SelectCodeCommon()
2827       NodeStack.push_back(N);  in SelectCodeCommon()
2833       NodeStack.pop_back();  in SelectCodeCommon()
2834       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
2835       N = NodeStack.back();  in SelectCodeCommon()
2978       assert(NodeStack.size() != 1 && "No parent node");  in SelectCodeCommon()
2982       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)  in SelectCodeCommon()
2983         if (!NodeStack[i].hasOneUse()) {  in SelectCodeCommon()
2991       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
2993           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3382       NodeStack.clear();  in SelectCodeCommon()
3383       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());  in SelectCodeCommon()
3384       N = NodeStack.back();  in SelectCodeCommon()