Lines Matching refs:get_ctrl
94 early = get_ctrl(early); // So treat input as a straight data input
97 early = get_ctrl(n->in(1));
103 Node *cin = get_ctrl(n->in(i));
319 if (!is_member(loop, get_ctrl(incr))) { // Swapped trip counter and limit?
325 if (is_member(loop, get_ctrl(limit))) // Limit must be loop-invariant
327 if (!is_member(loop, get_ctrl(incr))) // Trip counter must be loop-variant
337 if (!is_member(loop, get_ctrl(incr))) // Trip counter must be loop-variant
702 set_ctrl(nphi, get_ctrl(phi));
737 // Lazy update of 'get_ctrl' mechanism.
754 lazy_replace( iff, le ); // fix 'get_ctrl'
767 // Uses the lazy-update mechanism of 'get_ctrl'.
1117 Node* val_ctrl = get_ctrl(val);
3211 Node *use = has_ctrl(c) ? get_ctrl(c) : c->in(0);
3257 Node *sctrl = has_ctrl(s) ? get_ctrl(s) : s->in(0);
3475 IdealLoopTree *chosen_loop = get_loop(n->is_CFG() ? n : get_ctrl(n));
3489 Node *early = get_ctrl(n);// Early location already computed
3575 Node* in1_early = get_ctrl(in1);
3585 Node* in2_early = get_ctrl(in2);
3610 Node* u1_later = get_ctrl(u1);
3622 Node* u2_later = get_ctrl(u2);
3698 // (k < C->unique() && get_ctrl(find(k)) == n)