Lines Matching defs:top
97 r->set_req(j, phase->C->top());
109 region->set_req(i, phase->C->top());
369 // cmpP with 1 top input
381 // the Region stays in the graph. The top input from the cmpP is
525 Node *top = phase->C->top();
536 // Eagerly replace phis with top to avoid phis copies generation.
537 igvn->replace_node(n, top);
566 // Also set other user's input to top.
567 parent_ctrl = phase->C->top();
584 in = parent_ctrl; // replaced by top
589 in = phase->C->top(); // replaced by top
819 i = 0; // will get incremented at top of loop
850 // ignore top inputs
1056 // top, and return -1 (not an edge number) on success.
1149 // Find the unique value, discounting top, self-loops, and casts.
1150 // Return top if there are no inputs, and self if there are multiple.
1178 continue; // ignore if top, or in(i) and "this" are in a data cycle
1194 return phase->C->top(); // no inputs
1602 Node *top = phase->C->top();
1611 // Two: region is loop - replace phi with top since this data path is dead
1619 if (n != top) { // Not already top?
1624 set_req(j, top); // Nuke it down
1632 // only by itself on the dead (top) control path.
1633 return top;
1637 if (uin == top) { // Simplest case: no alive inputs.
1639 return top;
1659 return top;
1661 // We can't return top if we are in Parse phase - cut inputs only
1663 replace_edge(uin, top);
1713 return top;
1714 // We can't return top if we are in Parse phase - cut inputs only
1717 set_req(1, top);
1718 set_req(2, top);
1831 return top;
1859 return top; // all inputs reference back to this phi - dead loop
2209 return phase->C->top();