Lines Matching refs:push
1250 igvn._worklist.push(old_phi);
1551 stack.push(_tail);
1561 _required_safept->push(n); // save the one closest to the tail
1571 stack.push(in);
1684 _required_safept->push(nonlocal_ncsfpt);
1958 useful_predicates.push(entry->in(0)->in(1)->in(1)); // good one
1963 useful_predicates.push(entry->in(0)->in(1)->in(1)); // good one
2047 _igvn._worklist.push(n1);
2048 _igvn._worklist.push(n2);
2068 _igvn._worklist.push(n1);
2075 _igvn._worklist.push(n2);
2227 worklist.push( C->top() );
2240 worklist.push( C->root() );
2242 worklist.push( C->top() );
2250 assert(_igvn._worklist.size() == orig_worklist_size, "shouldn't push anything");
2685 _dom_stk->push(j);
2769 bltstack.push(n);
2796 bltstack.push(m);
2812 bltstack.push(u);
2997 innermost->_safepts->push(n);
3054 worklist.push(in); // Visit this guy later, using worklist
3077 nstack.push(n, i); // Save parent node and next input's index.
3088 worklist.push(in); // Visit this guy later, using worklist
3245 worklist.push(s);
3254 worklist.push(s1);
3398 worklist.push(use);
3400 nstack.push(n, i); // Save parent and next use's index.
3407 // push dead code onto a worklist
3408 _deadlist.push(use);
3434 _igvn._worklist.push(n); // Maybe we'll normalize it, if no more loops.
3477 chosen_loop->_body.push(n); // Collect inner loops
3501 _deadlist.push(n);
3559 chosen_loop->_body.push(n);// Collect inner loops
3719 stk.push(start, 0);
3729 stk.push(n, 0);
3732 rpo_list.push(m);