Lines Matching refs:push
126 spstack.push(_root);
142 spstack.push(n->in(i));
207 // roots.push(_root); _root will be processed among C->top() inputs
208 roots.push(C->top());
251 nstack.push(n, i); // Save parent node and next input's index.
257 roots.push(in); // Visit this guy later, using worklist
348 worklist.push(LCA);
363 worklist.push(LCA);
370 worklist.push(mid_parent);
534 worklist_store.push(initial_mem);
535 worklist_visited.push(initial_mem);
536 worklist_mem.push(NULL);
563 worklist_visited.push(store);
565 worklist_mem.push(mem);
566 worklist_store.push(store);
680 non_early_stores.push(store);
773 stack.push(root);
837 // Visit the unvisited Node. Contains the obvious push to
838 // indicate I'm entering a deeper level of recursion. I push the
840 _stack.push(self);
1163 _raw_oops.push(def);
1282 proj_list.push(_root); // Add real root as another root
1391 worklist.push(pb);
1400 worklist.push(pb);
1429 worklist.push(pb);
1438 worklist.push(pb);
1563 worklist.push(pred);
1760 // Do not push out freq to root block