Lines Matching refs:one
112 // If same depth but not equal, one _must_ dominate the other
567 Node* one = (stride_con > 0) ? gvn->intcon( 1) : gvn->intcon(-1);
568 limit = gvn->transform(new (C) AddINode(limit, one));
1299 // Use the new loop head instead of the old shared one
1359 // Feed that region as the one backedge to this loop.
1515 // the one true backedge.
1523 // If I have one hot backedge, peel off myself loop.
1561 _required_safept->push(n); // save the one closest to the tail
1620 // 1) The first, and cheaper one, scans the loop body from
1654 nonlocal_ncsfpt = n; // save the one closest to the tail
1830 break; // Found one
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
2345 // range checks or one-shot null checks.
2878 // points to 'n', one (of possibly many) fall-in paths. There may be
3035 // Normally I would use a set_loop here. But in this one special
3040 // Remove safepoints ONLY if I've already seen I don't need one.
3042 // first one, even though the 1st did not dominate in the loop body