Lines Matching refs:trip
311 // Find the trip-counter increment & limit. Limit must be loop invariant.
319 if (!is_member(loop, get_ctrl(incr))) { // Swapped trip counter and limit?
334 return false; // Not simple trip counter expression
365 return false; // Too much math on the trip counter
470 // to be adjusted to keep trip count the same and the
542 // to be adjusted to keep trip count the same and we
586 // trip-count for +-tive stride should be: (limit - init_trip + stride - 1)/stride.
685 // Build a canonical trip test.
950 Node *trip = phase->transform(new (phase->C) DivINode(0, bias, in(Stride)));
951 Node *span = phase->transform(new (phase->C) MulINode(trip, in(Stride)));
970 // and avoid generating rounding for division. Zero trip guard should
973 // optimization zero trip guard is generated explicitly which leaves
979 Node *trip = phase->transform(new (phase->C) DivLNode(0, bias, stride));
980 span = phase->transform(new (phase->C) MulLNode(trip, stride));
1713 // Replace parallel induction variable (parallel to trip counter)
1743 // Check for parallel induction variable (parallel to trip counter)
1746 // the trip-counter, so we need to convert all these to trip-counter
1767 // Convert to using the trip counter. The parallel induction
1768 // variable differs from the trip counter by a loop-invariant