contrib/gcc/tree-ssa-loop-prefetch.c

179   HOST_WIDE_INT step;		/* Step of the reference.  */
216   fprintf (file, ", step ");
217   fprintf (file, HOST_WIDE_INT_PRINT_DEC, ref->group->step);
234 		      HOST_WIDE_INT step)
240       if ((*groups)->step == step
244       /* Keep the list of groups sorted by decreasing step.  */
245       if ((*groups)->step < step)
251   group->step = step;
327   HOST_WIDE_INT *step;			/* Step of the memory reference.  */
338   tree ibase, step, stepsize;
349   step = iv.step;
351   if (zero_p (step))
355       if (!cst_and_fits_in_hwi (step))
357       istep = int_cst_value (step);
383   *ar_data->step += istep;
397 	     HOST_WIDE_INT *step, HOST_WIDE_INT *delta,
405   *step = 0;
427   ar_data.step = step;
440   HOST_WIDE_INT step, delta;
443   if (!analyze_ref (loop, &ref, &base, &step, &delta, stmt))
448   agrp = find_or_create_group (refs, base, step);
497   HOST_WIDE_INT step = ref->group->step;
498   bool backward = step < 0;
500   if (step == 0)
508     step = -step;
510   if (step > PREFETCH_BLOCK)
520   ref->prefetch_mod = PREFETCH_BLOCK / step;
543   HOST_WIDE_INT step = ref->group->step;
544   bool backward = step < 0;
560   if (!step)
584       step = -step;
598   if (step <= PREFETCH_BLOCK)
602       prefetch_before = (hit_from - delta_r + step - 1) / step;
611      and step are coprime (here we assume that PREFETCH_BLOCK is a power
614   while ((step & 1) == 0
617       step >>= 1;
622   /* Now step > prefetch_block, and step and prefetch_block are coprime.
625   prefetch_before = delta / step;
626   delta %= step;
638   delta = step - delta;
774      starting with the largest step, since the references with
775      large step are more likely to cause many cache misses.  */
840       delta = (ahead + ap * ref->prefetch_mod) * ref->group->step;