Lines Matching refs:stack
89 ZoneStack<DFSStackEntry> stack(zone_);
90 DFSPush(stack, exit, nullptr, kInputDirection);
93 while (!stack.empty()) { // Undirected depth-first backwards traversal.
94 DFSStackEntry& entry = stack.top();
107 // Found backedge if input is on stack.
112 // Push input onto stack.
113 DFSPush(stack, input, node, kInputDirection);
137 // Found backedge if use is on stack.
142 // Push use onto stack.
143 DFSPush(stack, use, node, kUseDirection);
157 // Pop node from stack when done with all inputs and uses.
160 DFSPop(stack, node);
188 void ControlEquivalence::DFSPush(DFSStack& stack, Node* node, Node* from,
195 stack.push({dir, input, use, from, node});
199 void ControlEquivalence::DFSPop(DFSStack& stack, Node* node) {
200 DCHECK_EQ(stack.top().node, node);
203 stack.pop();