Lines Matching refs:loop_nest
2969 true otherwise. If LOOP_NEST is false no cross-iteration aliases are
2974 class loop *loop_nest)
2984 if (!loop_nest)
3000 && (!loop_nest
3002 || MR_DEPENDENCE_CLIQUE (addr_a) == loop_nest->owned_clique)
3087 /* Initialize a data dependence relation RES in LOOP_NEST. USE_ALT_INDICES
3093 vec<loop_p> loop_nest,
3308 && (!loop_nest.exists ()
3310 (loop_nest[0], base_a))));
3367 loop_preheader_edge (loop_nest[0]),
3378 loop_preheader_edge (loop_nest[0]),
3381 return initialize_data_dependence_relation (res, loop_nest, true);
3407 if (!loop_nest.exists ()
3408 || (object_address_invariant_in_loop_p (loop_nest[0],
3410 && object_address_invariant_in_loop_p (loop_nest[0],
3421 DDR_LOOP_NEST (res) = loop_nest;
3448 vec<loop_p> loop_nest)
3465 if (!dr_may_alias_p (a, b, loop_nest.exists () ? loop_nest[0] : NULL))
3471 return initialize_data_dependence_relation (res, loop_nest, false);
4841 LOOP_NEST. *OVERLAPS_A and *OVERLAPS_B are initialized to the
4854 class loop *loop_nest)
4879 loop_nest->num)
4893 else if (evolution_function_is_affine_in_loop (chrec_a, loop_nest->num)
4894 && !chrec_contains_symbols (chrec_a, loop_nest)
4895 && evolution_function_is_affine_in_loop (chrec_b, loop_nest->num)
4896 && !chrec_contains_symbols (chrec_b, loop_nest))
4942 with respect to LOOP_NEST. OVERLAP_ITERATIONS_A and
4956 tree *last_conflicts, class loop *loop_nest)
4958 unsigned int lnn = loop_nest->num;
5020 last_conflicts, loop_nest);
5367 class loop *loop_nest)
5382 if (invariant_access_functions (ddr, loop_nest->num))
5425 if (!subscript_dependence_tester_1 (ddr, 1, 0, loop_nest))
5465 if (!subscript_dependence_tester_1 (ddr, 1, 0, loop_nest))
5554 class loop *loop_nest)
5568 &last_conflicts, loop_nest);
5609 /* Computes the conflicting iterations in LOOP_NEST, and initialize DDR. */
5613 class loop *loop_nest)
5615 if (subscript_dependence_tester_1 (ddr, 0, 1, loop_nest))
5619 if (build_classic_dist_vector (ddr, loop_nest))
5624 constant with respect to LOOP_NEST. */
5628 const class loop *loop_nest)
5632 if (!evolution_function_is_invariant_p (t, loop_nest->num)
5633 && !evolution_function_is_affine_multivariate_p (t, loop_nest->num))
5640 respect to LOOP_NEST. CHREC_KNOWN is used for representing the
5650 class loop *loop_nest)
5673 if (access_functions_are_affine_or_constant_p (dra, loop_nest)
5674 && access_functions_are_affine_or_constant_p (drb, loop_nest))
5675 subscript_dependence_tester (ddr, loop_nest);
5708 the data references in DATAREFS, in the LOOP_NEST. When
5716 const vec<loop_p> &loop_nest,
5730 ddr = initialize_data_dependence_relation (NULL, NULL, loop_nest);
5739 ddr = initialize_data_dependence_relation (a, b, loop_nest);
5741 if (loop_nest.exists ())
5742 compute_affine_dependence (ddr, loop_nest[0]);
5748 ddr = initialize_data_dependence_relation (a, a, loop_nest);
5750 if (loop_nest.exists ())
5751 compute_affine_dependence (ddr, loop_nest[0]);
6149 find_loop_nest_1 (class loop *loop, vec<loop_p> *loop_nest)
6168 loop_nest->safe_push (loop);
6170 return find_loop_nest_1 (loop->inner, loop_nest);
6175 true and insert in LOOP_NEST the loops of the nest. LOOP_NEST will
6180 find_loop_nest (class loop *loop, vec<loop_p> *loop_nest)
6182 loop_nest->safe_push (loop);
6184 return find_loop_nest_1 (loop->inner, loop_nest);
6198 vec<loop_p> *loop_nest,
6210 || !find_loop_nest (loop, loop_nest)
6212 || !compute_all_dependences (*datarefs, dependence_relations, *loop_nest,