955   tree_loop_interchange (vec<class loop *> loop_nest)  in tree_loop_interchange()  argument
956     : m_loop_nest (loop_nest), m_niters_iv_var (NULL_TREE),  in tree_loop_interchange()
1086   class loop *loop_nest = m_loop_nest[0];  in interchange_loops()  local
1087   edge instantiate_below = loop_preheader_edge (loop_nest);  in interchange_loops()
1088   gsi = gsi_last_bb (loop_preheader_edge (loop_nest)->src);  in interchange_loops()
1096   if (oloop.m_loop != loop_nest)  in interchange_loops()
1286 compute_access_stride (class loop *loop_nest, class loop *loop,  in compute_access_stride()  argument
1326   scev = instantiate_scev (loop_preheader_edge (loop_nest), loop, scev);  in compute_access_stride()
1344 	while (expected != loop_outer (loop_nest))  in compute_access_stride()
1362 compute_access_strides (class loop *loop_nest, class loop *loop,  in compute_access_strides()  argument
1371       compute_access_stride (loop_nest, loop, dr);  in compute_access_strides()
1392   gcc_assert (loop_nest == loop || flow_loop_nested_p (loop_nest, loop));  in compute_access_strides()
1400 prune_access_strides_not_in_loop (class loop *loop_nest,  in prune_access_strides_not_in_loop()  argument
1405   unsigned num_loops = loop_depth (innermost) - loop_depth (loop_nest) + 1;  in prune_access_strides_not_in_loop()
1821 should_interchange_loop_nest (class loop *loop_nest, class loop *innermost,  in should_interchange_loop_nest()  argument
1824   unsigned idx = loop_depth (innermost) - loop_depth (loop_nest);  in should_interchange_loop_nest()
1829        loop != loop_nest; loop = loop_outer (loop), idx--)  in should_interchange_loop_nest()
1843 tree_loop_interchange_compute_ddrs (vec<loop_p> loop_nest,  in tree_loop_interchange_compute_ddrs()  argument
1848   class loop *innermost = loop_nest.last ();  in tree_loop_interchange_compute_ddrs()
1861 	    ddr_p ddr = initialize_data_dependence_relation (a, b, loop_nest);  in tree_loop_interchange_compute_ddrs()
1863 	    compute_affine_dependence (ddr, loop_nest[0]);  in tree_loop_interchange_compute_ddrs()
1920   class loop *loop_nest = loop;  in prepare_data_references()  local
1929   for (unsigned i = 0; loop_nest && i < loop->num_nodes; ++i)  in prepare_data_references()
1932       if (!flow_bb_inside_loop_p (loop_nest, bb))  in prepare_data_references()
1938 	  loop_nest = bb->loop_father->inner;  in prepare_data_references()
1939 	  if (loop_nest && !loop_nest->inner)  in prepare_data_references()
1940 	    loop_nest = NULL;  in prepare_data_references()
1959       if (loop_nest && flow_bb_inside_loop_p (loop_nest, bb))  in prepare_data_references()
1969   return loop_nest;  in prepare_data_references()
1984 prepare_perfect_loop_nest (class loop *loop, vec<loop_p> *loop_nest,  in prepare_perfect_loop_nest()  argument
2033     loop_nest->truncate (0);  in prepare_perfect_loop_nest()
2038     if (find_loop_nest (start_loop, loop_nest)  in prepare_perfect_loop_nest()
2039 	&& tree_loop_interchange_compute_ddrs (*loop_nest, *datarefs, ddrs))  in prepare_perfect_loop_nest()
2077       vec<loop_p> loop_nest = vNULL;  in execute()  local
2080       if (prepare_perfect_loop_nest (loop, &loop_nest, &datarefs, &ddrs))  in execute()
2082 	  tree_loop_interchange loop_interchange (loop_nest);  in execute()
2087       loop_nest.release ();  in execute()