| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-loop-jam.cc | 380 isn't invariant with respect to loop LOOP_NEST. */
383 const class loop *loop_nest)
388 if (!evolution_function_is_invariant_p (t, loop_nest->num))
528 auto_vec<loop_p, 3> loop_nest; local
529 if (!compute_data_dependences_for_loop (outer, true, &loop_nest,
630 loop_nest.release ();
|
| tree-data-ref.h | 443 vec<loop_p> loop_nest; member in struct:data_dependence_relation
502 #define DDR_LOOP_NEST(DDR) (DDR)->loop_nest
674 /* Return the index of the variable VAR in the LOOP_NEST array. */
677 index_in_loop_nest (int var, const vec<loop_p> &loop_nest)
682 for (var_index = 0; loop_nest.iterate (var_index, &loopi); var_index++)
|
| tree-vect-data-refs.cc | 673 class loop *loop_nest = loop_outer (loop); local
776 if (dr_may_alias_p (dr_ref, dr_read, loop_nest))
|
| gimple-loop-interchange.cc | 957 tree_loop_interchange (vec<class loop *> loop_nest)
958 : m_loop_nest (loop_nest), m_niters_iv_var (NULL_TREE),
1088 class loop *loop_nest = m_loop_nest[0]; local
1089 edge instantiate_below = loop_preheader_edge (loop_nest);
1090 gsi = gsi_last_bb (loop_preheader_edge (loop_nest)->src);
1098 if (oloop.m_loop != loop_nest)
1276 /* Given data reference DR in LOOP_NEST, the function computes DR's access
1288 compute_access_stride (class loop *&loop_nest, class loop *loop,
1295 if (!flow_bb_inside_loop_p (loop_nest, bb))
1334 scev = instantiate_scev (loop_preheader_edge (loop_nest),
1934 class loop *loop_nest = loop; local
2096 vec<loop_p> loop_nest = vNULL; local
[all...] |
| tree-loop-distribution.cc | 515 vec<loop_p> loop_nest; member in class:loop_distribution
1426 ddr = initialize_data_dependence_relation (a, b, loop_nest);
1427 compute_affine_dependence (ddr, loop_nest[0]);
1661 /* Given data reference DR in LOOP_NEST, this function checks the enclosing
1679 compute_access_range (loop_p loop_nest, data_reference_p dr, tree *base,
1741 } while (loop != loop_nest && (loop = loop_outer (loop)) != NULL);
3059 loop_nest.create (0);
3060 if (!find_loop_nest (loop, &loop_nest))
3062 loop_nest.release ();
3077 loop_nest.release ()
[all...] |
| tree-parloops.cc | 1137 auto_vec<loop_p, 3> loop_nest; local
1140 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs,
|
| tree-predcom.cc | 3395 auto_vec<loop_p, 3> loop_nest; local
3396 if (!compute_data_dependences_for_loop (m_loop, true, &loop_nest, &m_datarefs,
3409 loop_nest.release ();
|
| tree-vectorizer.h | 440 auto_vec<loop_p> loop_nest; member in class:vec_info_shared
999 #define LOOP_VINFO_LOOP_NEST(L) (L)->shared->loop_nest
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-loop-jam.cc | 380 isn't invariant with respect to loop LOOP_NEST. */
383 const class loop *loop_nest)
388 if (!evolution_function_is_invariant_p (t, loop_nest->num))
528 auto_vec<loop_p, 3> loop_nest; local
529 if (!compute_data_dependences_for_loop (outer, true, &loop_nest,
616 loop_nest.release ();
|
| tree-data-ref.h | 443 vec<loop_p> loop_nest; member in struct:data_dependence_relation
502 #define DDR_LOOP_NEST(DDR) (DDR)->loop_nest
674 /* Return the index of the variable VAR in the LOOP_NEST array. */
677 index_in_loop_nest (int var, const vec<loop_p> &loop_nest)
682 for (var_index = 0; loop_nest.iterate (var_index, &loopi); var_index++)
|
| gimple-loop-interchange.cc | 955 tree_loop_interchange (vec<class loop *> loop_nest)
956 : m_loop_nest (loop_nest), m_niters_iv_var (NULL_TREE),
1086 class loop *loop_nest = m_loop_nest[0]; local
1087 edge instantiate_below = loop_preheader_edge (loop_nest);
1088 gsi = gsi_last_bb (loop_preheader_edge (loop_nest)->src);
1096 if (oloop.m_loop != loop_nest)
1274 /* Given data reference DR in LOOP_NEST, the function computes DR's access
1286 compute_access_stride (class loop *&loop_nest, class loop *loop,
1293 if (!flow_bb_inside_loop_p (loop_nest, bb))
1332 scev = instantiate_scev (loop_preheader_edge (loop_nest),
1932 class loop *loop_nest = loop; local
2094 vec<loop_p> loop_nest = vNULL; local
[all...] |
| tree-loop-distribution.cc | 514 vec<loop_p> loop_nest; member in class:loop_distribution
1386 ddr = initialize_data_dependence_relation (a, b, loop_nest);
1387 compute_affine_dependence (ddr, loop_nest[0]);
1606 /* Given data reference DR in LOOP_NEST, this function checks the enclosing
1624 compute_access_range (loop_p loop_nest, data_reference_p dr, tree *base,
1686 } while (loop != loop_nest && (loop = loop_outer (loop)) != NULL);
3003 loop_nest.create (0);
3004 if (!find_loop_nest (loop, &loop_nest))
3006 loop_nest.release ();
3021 loop_nest.release ()
[all...] |
| tree-parloops.cc | 1137 auto_vec<loop_p, 3> loop_nest; local
1140 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs,
|
| tree-predcom.cc | 3364 auto_vec<loop_p, 3> loop_nest; local
3365 if (!compute_data_dependences_for_loop (m_loop, true, &loop_nest, &m_datarefs,
3378 loop_nest.release ();
|
| tree-vectorizer.h | 408 auto_vec<loop_p> loop_nest; member in class:vec_info_shared
889 #define LOOP_VINFO_LOOP_NEST(L) (L)->shared->loop_nest
|
