Lines Matching defs:stack
7 #include <stack>
76 // This function uses a stack-based DFS search to traverse the var graph. Each
77 // iteration, the top node on the stack examined. If the node has not been
82 // Otherwise, if they haven't been visited yet we add them to the stack, If the
83 // node at the top of the stack has already been visited, then we pop it off the
84 // stack and erase it from |parent_ids|.
93 std::stack<StackEntry> stack;
94 stack.push(StackEntry(var, GetOrCreateRawVarData(var, &visited_map,
97 while (!stack.empty()) {
98 PP_Var current_var = stack.top().var;
99 RawVarData* current_var_data = graph->data_[stack.top().data_index];
102 stack.pop();
115 // Add child nodes to the stack.
135 stack.push(StackEntry(child, child_id));
155 stack.push(StackEntry(child, child_id));