Lines Matching defs:NodeStack

3125   /// NodeStack - The node stack when the scope was formed.
3126   SmallVector<SDValue, 4> NodeStack;
3177       for (auto &J : I.NodeStack)
3269   SmallVector<SDValue, 8> NodeStack;
3271   NodeStack.push_back(N);
3395       NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
3407       if (NodeStack.size() > 1)
3408         Parent = NodeStack[NodeStack.size()-2].getNode();
3447       NodeStack.push_back(N);
3459       NodeStack.push_back(N);
3472       // Pop the current node off the NodeStack.
3473       NodeStack.pop_back();
3474       assert(!NodeStack.empty() && "Node stack imbalance!");
3475       N = NodeStack.back();
3483       NodeStack.push_back(N);
3487       // Pop the current node off the NodeStack.
3488       NodeStack.pop_back();
3489       assert(!NodeStack.empty() && "Node stack imbalance!");
3490       N = NodeStack.back();
3744       assert(NodeStack.size() != 1 && "No parent node");
3748       for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) {
3750         SDNode *NS = NodeStack[i].getNode();
3763       if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
3765           !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
4295       NodeStack.clear();
4296       NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
4297       N = NodeStack.back();