Home
last modified time | relevance | path

Searched refs:loop_nest (Results 1 – 25 of 34) sorted by relevance

12

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dgimple-loop-interchange.cc955 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
1293 if (!flow_bb_inside_loop_p (loop_nest, bb)) in compute_access_stride()
1332 scev = instantiate_scev (loop_preheader_edge (loop_nest), in compute_access_stride()
1338 if (loop_nest == loop) in compute_access_stride()
[all …]
H A Dtree-data-ref.cc2969 class loop *loop_nest) in dr_may_alias_p() argument
2979 if (!loop_nest) in dr_may_alias_p()
2995 && (!loop_nest in dr_may_alias_p()
2997 || MR_DEPENDENCE_CLIQUE (addr_a) == loop_nest->owned_clique) in dr_may_alias_p()
3088 vec<loop_p> loop_nest, in initialize_data_dependence_relation() argument
3303 && (!loop_nest.exists () in initialize_data_dependence_relation()
3305 (loop_nest[0], base_a)))); in initialize_data_dependence_relation()
3362 loop_preheader_edge (loop_nest[0]), in initialize_data_dependence_relation()
3373 loop_preheader_edge (loop_nest[0]), in initialize_data_dependence_relation()
3376 return initialize_data_dependence_relation (res, loop_nest, true); in initialize_data_dependence_relation()
[all …]
H A Dgimple-loop-jam.cc373 const class loop *loop_nest) in any_access_function_variant_p() argument
378 if (!evolution_function_is_invariant_p (t, loop_nest->num)) in any_access_function_variant_p()
518 auto_vec<loop_p, 3> loop_nest; in tree_loop_unroll_and_jam() local
519 if (!compute_data_dependences_for_loop (outer, true, &loop_nest, in tree_loop_unroll_and_jam()
606 loop_nest.release (); in tree_loop_unroll_and_jam()
H A Dtree-data-ref.h443 vec<loop_p> loop_nest; member
502 #define DDR_LOOP_NEST(DDR) (DDR)->loop_nest
676 index_in_loop_nest (int var, const vec<loop_p> &loop_nest) in index_in_loop_nest() argument
681 for (var_index = 0; loop_nest.iterate (var_index, &loopi); var_index++) in index_in_loop_nest()
H A Dtree-loop-distribution.cc514 vec<loop_p> loop_nest; member in loop_distribution
1386 ddr = initialize_data_dependence_relation (a, b, loop_nest); in get_data_dependence()
1387 compute_affine_dependence (ddr, loop_nest[0]); in get_data_dependence()
1624 compute_access_range (loop_p loop_nest, data_reference_p dr, tree *base, in compute_access_range() argument
1686 } while (loop != loop_nest && (loop = loop_outer (loop)) != NULL); in compute_access_range()
2996 loop_nest.create (0); in distribute_loop()
2997 if (!find_loop_nest (loop, &loop_nest)) in distribute_loop()
2999 loop_nest.release (); in distribute_loop()
3014 loop_nest.release (); in distribute_loop()
3028 loop_nest.release (); in distribute_loop()
[all …]
H A Dtree-predcom.cc3364 auto_vec<loop_p, 3> loop_nest; in tree_predictive_commoning_loop() local
3365 if (!compute_data_dependences_for_loop (m_loop, true, &loop_nest, &m_datarefs, in tree_predictive_commoning_loop()
3378 loop_nest.release (); in tree_predictive_commoning_loop()
H A Dtree-vectorizer.h408 auto_vec<loop_p> loop_nest;
889 #define LOOP_VINFO_LOOP_NEST(L) (L)->shared->loop_nest
H A Dtree-parloops.cc1137 auto_vec<loop_p, 3> loop_nest; in loop_parallel_p() local
1140 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs, in loop_parallel_p()
H A Dtree-vect-loop.cc2961 if (!find_loop_nest (loop, &shared->loop_nest)) in vect_analyze_loop()
H A DChangeLog.graphite6206 * graphite.h (struct scop): Move params, old_ivs, loops, loop_nest,
9040 (scop): Add fields static_schedule, params, loop_nest,
H A DChangeLog-2010313 pointer to the loop_nest.
314 (analyze_all_data_dependences): Initialize and free the loop_nest.
315 (free_dependence_relations): Do not free loop_nest.
316 (build_rdg): Pass in the loop_nest, datarefs, and dependence_relations.
320 * tree-if-conv.c (if_convertible_loop_p_1): Pass in the loop_nest.
321 (if_convertible_loop_p): Allocate and free loop_nest.
325 loop_nest, datarefs, and dependence_relations.
327 loop_nest.
337 * tree-vectorizer.h (struct _loop_vec_info): Add a field loop_nest.
H A DChangeLog-20068271 * tree-loop-linear.c (linear_transform_loops): Bail if loop_nest has
15532 Add a parameter for the loop_nest.
15538 loop_nest, a vec of loops.
H A DChangeLog-201713392 to build scop_info->loop_nest.
13394 * sese.h (sese_info_t::loop_nest): Remove.
13395 * sese.c (new_sese_info): Do not allocate loop_nest.
13396 (free_sese_info): Do not free loop_nest.
25126 * tree-loop-distribution.c (loop_nest): New global var.
H A DChangeLog-201128018 (cgraph_clone_edge): Do not take loop_nest argument;
28023 call_stmt_size/call_stmt_time/loop_nest.
28029 loop_nest; handle indirect calls, too.
28033 stream call_stmt_size/call_stmt_time/loop_nest.
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dgimple-loop-interchange.cc955 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
[all …]
H A Dtree-data-ref.c2714 class loop *loop_nest) in dr_may_alias_p() argument
2724 if (!loop_nest) in dr_may_alias_p()
2740 && (!loop_nest in dr_may_alias_p()
2742 || MR_DEPENDENCE_CLIQUE (addr_a) == loop_nest->owned_clique) in dr_may_alias_p()
2834 vec<loop_p> loop_nest) in initialize_data_dependence_relation() argument
2854 if (!dr_may_alias_p (a, b, loop_nest.exists () ? loop_nest[0] : NULL)) in initialize_data_dependence_relation()
3049 && (!loop_nest.exists () in initialize_data_dependence_relation()
3051 (loop_nest[0], base_a)))); in initialize_data_dependence_relation()
3115 if (!loop_nest.exists () in initialize_data_dependence_relation()
3116 || (object_address_invariant_in_loop_p (loop_nest[0], in initialize_data_dependence_relation()
[all …]
H A Dgimple-loop-jam.c366 const class loop *loop_nest) in any_access_function_variant_p() argument
373 if (!evolution_function_is_invariant_p (t, loop_nest->num)) in any_access_function_variant_p()
514 auto_vec<loop_p, 3> loop_nest; in tree_loop_unroll_and_jam() local
517 if (!compute_data_dependences_for_loop (outer, true, &loop_nest, in tree_loop_unroll_and_jam()
601 loop_nest.release (); in tree_loop_unroll_and_jam()
H A Dtree-data-ref.h438 vec<loop_p> loop_nest; member
497 #define DDR_LOOP_NEST(DDR) (DDR)->loop_nest
669 index_in_loop_nest (int var, vec<loop_p> loop_nest) in index_in_loop_nest() argument
674 for (var_index = 0; loop_nest.iterate (var_index, &loopi); var_index++) in index_in_loop_nest()
H A Dtree-loop-distribution.c510 vec<loop_p> loop_nest;
1376 ddr = initialize_data_dependence_relation (a, b, loop_nest); in get_data_dependence()
1377 compute_affine_dependence (ddr, loop_nest[0]); in get_data_dependence()
1611 compute_access_range (loop_p loop_nest, data_reference_p dr, tree *base,
1673 } while (loop != loop_nest && (loop = loop_outer (loop)) != NULL);
2956 loop_nest.create (0); in distribute_loop()
2957 if (!find_loop_nest (loop, &loop_nest)) in distribute_loop()
2959 loop_nest.release (); in distribute_loop()
2974 loop_nest.release (); in distribute_loop()
2988 loop_nest.release (); in distribute_loop()
[all …]
H A Dtree-vectorizer.h293 auto_vec<loop_p> loop_nest;
692 #define LOOP_VINFO_LOOP_NEST(L) (L)->shared->loop_nest
H A Dtree-predcom.c3236 auto_vec<loop_p, 3> loop_nest; in tree_predictive_commoning_loop() local
3239 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs, in tree_predictive_commoning_loop()
3253 loop_nest.release (); in tree_predictive_commoning_loop()
H A Dtree-parloops.c1137 auto_vec<loop_p, 3> loop_nest; in loop_parallel_p() local
1140 if (! compute_data_dependences_for_loop (loop, true, &loop_nest, &datarefs, in loop_parallel_p()
H A Dtree-vect-loop.c2539 if (!find_loop_nest (loop, &shared->loop_nest)) in vect_analyze_loop()
/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Dloop.texi616 @item an array of loops @code{loop_nest} that contains the loops to
/netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/
H A Dloop.texi615 @item an array of loops @code{loop_nest} that contains the loops to

12