Lines Matching refs:period
93 a-priori period, like
95 are described by a constraint that ends in a length 1 period of
453 /* Step 2: Reduce the loop period. */
463 /* Proceed as if the loop period were n, with
468 /* m is a divisor of n. Try to reduce the loop period to n. */
2073 number of copies of L, each time shifted by period:
2076 L and (*^period L)
2077 L and (*^period L) and (*^{2 period} L)
2078 L and (*^period L) and (*^{2 period} L) and (*^{3 period} L)
2083 make_repeated_list (struct format_arg_list *sublist, unsigned int period)
2093 ASSERT (period > 0);
2099 if (sublist->initial.length < period)
2100 /* L and (*^period L) is a contradition, so we need to consider
2105 p = period;
2110 /* p := lcm (period, period of L) */
2112 unsigned int m = period / gcd (period, Lp); /* = lcm(period,Lp) / Lp */
2141 Thus the result has an initial segment of length n - p and a period
2247 /* Add optional exit points at 0, period, 2*period etc.
2249 for (i = 0; i < list->initial.length; i += period)