Lines Matching defs:induction
111 // Detects sequence variables (generalized induction variables) during an outer to inner
186 // Type of induction.
285 // Singleton is wrap-around induction if all internal links have the same meaning.
350 InductionInfo* induction = SolvePhi(phi, /*input_index*/ 1, /*adjust_input_size*/ 0);
351 if (induction != nullptr) {
352 switch (induction->induction_class) {
354 // Construct combined stride of the linear induction.
355 induction = CreateInduction(kLinear, kNop, induction, initial, /*fetch*/ nullptr, type_);
362 AssignInfo(loop, phi, induction);
368 // Classify all elements in the cycle with the found periodic induction while
372 AssignInfo(loop, scc_[i], induction);
373 induction = RotatePeriodicInduction(induction->op_b, induction->op_a);
375 AssignInfo(loop, phi, induction);
384 InductionInfo* induction,
386 // Rotates a periodic induction of the form
391 if (induction->induction_class == kInvariant) {
394 induction,
401 induction->op_a,
402 RotatePeriodicInduction(induction->op_b, last),
472 // wrap-around, or periodic input yields a similar but negated induction as result.
526 // Allow narrowing conversion on linear induction in certain cases:
527 // induction is already at narrow type, or can be made narrower.
598 // keeps adding to the stride of the linear induction.
611 // induction for a polynomial induction k = k + i (represented as sum over linear terms).
671 // Restrict base of geometric induction to direct fetch.
682 // Idiomatic MOD wrap-around induction.
690 // Idiomatic XOR periodic induction.
728 // A narrowing conversion is allowed as *last* operation of the cycle of a linear induction
730 // recorded with the induction to account for the precision loss. The narrower induction does
784 // Swap condition if induction is at right-hand-side (e.g. U > i is same as i < U).
794 // Analyze condition with induction at left-hand-side (e.g. i < U).
810 // Only accept integral condition. A mismatch between the type of condition and the induction
811 // is only allowed if the, necessarily narrower, induction range fits the narrower control.
1027 // This often safes memory and yields a more concise representation of the induction.
1028 // More exhaustive simplifications are done by later phases once induction nodes are
