2540   SmallVector<SDValue, 4> NodeStack;  member
2586       for (auto &J : I.NodeStack)  in NodeDeleted()
2638   SmallVector<SDValue, 8> NodeStack;  in SelectCodeCommon()  local
2640   NodeStack.push_back(N);  in SelectCodeCommon()
2765       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());  in SelectCodeCommon()
2778       if (NodeStack.size() > 1)  in SelectCodeCommon()
2779         Parent = NodeStack[NodeStack.size()-2].getNode();  in SelectCodeCommon()
2812       NodeStack.push_back(N);  in SelectCodeCommon()
2818       NodeStack.pop_back();  in SelectCodeCommon()
2819       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
2820       N = NodeStack.back();  in SelectCodeCommon()
2966       assert(NodeStack.size() != 1 && "No parent node");  in SelectCodeCommon()
2970       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)  in SelectCodeCommon()
2971         if (!NodeStack[i].hasOneUse()) {  in SelectCodeCommon()
2979       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
2981           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3373       NodeStack.clear();  in SelectCodeCommon()
3374       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());  in SelectCodeCommon()
3375       N = NodeStack.back();  in SelectCodeCommon()