Lines Matching defs:innermost

61      1) Find perfect loop nest for each innermost loop and compute data
64 2) From innermost to outermost loop, this pass tries to interchange
68 <loop_i, loop_j, loop_k>. The overall effect is to move innermost
89 innermost two loops. */
595 Note the innermost two loops are the loop nest to be interchanged.
972 innermost two loops, new IV created in the middle level loop does
1275 stride at each level of loop from innermost LOOP to outer. On success,
1354 /* Given loop nest LOOP_NEST with innermost LOOP, the function computes
1401 class loop *innermost,
1405 unsigned num_loops = loop_depth (innermost) - loop_depth (loop_nest) + 1;
1449 innermost loops in loop nest. This function also dumps information if
1566 /* We use different stride comparison ratio for interchanging innermost
1568 the innermost loops. */
1718 3) Record the innermost outer loop that doesn't form rectangle loop
1801 /* Record the innermost outer loop that doesn't form rectangle loop nest. */
1821 should_interchange_loop_nest (class loop *loop_nest, class loop *innermost,
1824 unsigned idx = loop_depth (innermost) - loop_depth (loop_nest);
1828 for (class loop *loop = innermost;
1831 loop == innermost, false))
1848 class loop *innermost = loop_nest.last ();
1852 bool a_outer_p = gimple_bb (DR_STMT (a))->loop_father != innermost;
1856 bool b_outer_p = gimple_bb (DR_STMT (b))->loop_father != innermost;
1972 /* Given innermost LOOP, return true if perfect loop nest can be found and
1979 of the innermost loop. For such outer loop reference, we require that
1987 class loop *start_loop = NULL, *innermost = loop;
1990 /* Find loop nest from the innermost loop. The outermost is the innermost
2021 start_loop = compute_access_strides (start_loop, innermost, *datarefs);
2026 if (!should_interchange_loop_nest (start_loop, innermost, *datarefs))
2044 start_loop->num, innermost->num);
2047 prune_access_strides_not_in_loop (start_loop, innermost, *datarefs);