gcc/gcc/graphite-interchange.c

1 /* Interchange heuristics and transform for loop interchange on
73 #include "tree-ssa-loop.h"
144    the loop at DEPTH.  */
198      to the point loop inside stripmined dimension.  */
285 memory_strides_in_loop_1 (lst_p loop, graphite_dim_t depth, mpz_t strides)
295   FOR_EACH_VEC_ELT (LST_SEQ (loop), j, l)
315 memory_strides_in_loop (lst_p loop, graphite_dim_t depth, mpz_t strides)
317   if (mpz_cmp_si (loop->memory_strides, -1) == 0)
320       memory_strides_in_loop_1 (loop, depth, strides);
323     mpz_set (strides, loop->memory_strides);
365    Next, to measure the impact of iterating once in loop "i", we build
399    Similarly, to determine the impact of one iteration on loop "j", we
403    Finally, the profitability test is D1 < D2: if in the outer loop
404    the strides are smaller than in the inner loop, then it is
493 /* Transform the loop nest between LOOP1 and LOOP2 into a perfect
495    after perfect_nestify.  NEST is set to the perfectly nested loop
497    before/after the loop NEST.  */
598 /* Selects the inner loop in LST_SEQ (INNER_FATHER) to be interchanged
599    with the loop OUTER in LST_SEQ (OUTER_FATHER).  */
628    points to the next outer loop to be considered for interchange.  */
631 lst_interchange_select_outer (scop_p scop, lst_p loop, int outer)
638   if (!loop || !LST_LOOP_P (loop))
641   father = LST_LOOP_FATHER (loop);
644       while (lst_interchange_select_inner (scop, father, outer, loop))
647 	  loop = LST_SEQ (father)[outer];
651   if (LST_LOOP_P (loop))
652     FOR_EACH_VEC_ELT (LST_SEQ (loop), i, l)
659 /* Interchanges all the loop depths that are considered profitable for