2733   SmallVector<SDValue, 4> NodeStack;  member
2784       for (auto &J : I.NodeStack)  in NodeDeleted()
2861   SmallVector<SDValue, 8> NodeStack;  in SelectCodeCommon()  local
2863   NodeStack.push_back(N);  in SelectCodeCommon()
2986       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());  in SelectCodeCommon()
2998       if (NodeStack.size() > 1)  in SelectCodeCommon()
2999         Parent = NodeStack[NodeStack.size()-2].getNode();  in SelectCodeCommon()
3038       NodeStack.push_back(N);  in SelectCodeCommon()
3050       NodeStack.push_back(N);  in SelectCodeCommon()
3056       NodeStack.pop_back();  in SelectCodeCommon()
3057       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
3058       N = NodeStack.back();  in SelectCodeCommon()
3236       assert(NodeStack.size() != 1 && "No parent node");  in SelectCodeCommon()
3240       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) {  in SelectCodeCommon()
3242         SDNode *NS = NodeStack[i].getNode();  in SelectCodeCommon()
3255       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3257           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3675       NodeStack.clear();  in SelectCodeCommon()
3676       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());  in SelectCodeCommon()
3677       N = NodeStack.back();  in SelectCodeCommon()