2779   SmallVector<SDValue, 4> NodeStack;  member
2830       for (auto &J : I.NodeStack)  in NodeDeleted()
2901   SmallVector<SDValue, 8> NodeStack;  in SelectCodeCommon()  local
2903   NodeStack.push_back(N);  in SelectCodeCommon()
3026       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());  in SelectCodeCommon()
3038       if (NodeStack.size() > 1)  in SelectCodeCommon()
3039         Parent = NodeStack[NodeStack.size()-2].getNode();  in SelectCodeCommon()
3078       NodeStack.push_back(N);  in SelectCodeCommon()
3090       NodeStack.push_back(N);  in SelectCodeCommon()
3096       NodeStack.pop_back();  in SelectCodeCommon()
3097       assert(!NodeStack.empty() && "Node stack imbalance!");  in SelectCodeCommon()
3098       N = NodeStack.back();  in SelectCodeCommon()
3276       assert(NodeStack.size() != 1 && "No parent node");  in SelectCodeCommon()
3280       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) {  in SelectCodeCommon()
3282         SDNode *NS = NodeStack[i].getNode();  in SelectCodeCommon()
3295       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3297           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),  in SelectCodeCommon()
3713       NodeStack.clear();  in SelectCodeCommon()
3714       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());  in SelectCodeCommon()
3715       N = NodeStack.back();  in SelectCodeCommon()