Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/gcc/
H A Dtree-loop-linear.c254 struct loop *loop_nest = loops->parray[i]; in linear_transform_loops() local
273 if (!loop_nest || !loop_nest->inner || !loop_nest->single_exit) in linear_transform_loops()
278 for (temp = loop_nest->inner; temp; temp = temp->inner) in linear_transform_loops()
295 compute_data_dependences_for_loop (loop_nest, true, &datarefs, in linear_transform_loops()
305 datarefs, loop_nest); in linear_transform_loops()
322 before = gcc_loopnest_to_lambda_loopnest (loops, loop_nest, &oldivs, in linear_transform_loops()
342 lambda_loopnest_to_gcc_loopnest (loop_nest, oldivs, invariants, in linear_transform_loops()
H A Dtree-data-ref.h233 VEC (loop_p, heap) *loop_nest;
254 #define DDR_LOOP_NEST(DDR) DDR->loop_nest
301 index_in_loop_nest (int var, VEC (loop_p, heap) *loop_nest) in index_in_loop_nest() argument
306 for (var_index = 0; VEC_iterate (loop_p, loop_nest, var_index, loopi); in index_in_loop_nest()
H A Dcgraph.c416 edge->loop_nest = nest; in cgraph_create_edge()
766 if (edge->loop_nest) in dump_cgraph_node()
767 fprintf (f, "(nested in %i loops) ", edge->loop_nest); in dump_cgraph_node()
1038 tree call_stmt, gcov_type count_scale, int loop_nest, in cgraph_clone_edge() argument
1045 e->loop_nest + loop_nest); in cgraph_clone_edge()
1064 cgraph_clone_node (struct cgraph_node *n, gcov_type count, int loop_nest, in cgraph_clone_node() argument
1096 cgraph_clone_edge (e, new, e->call_stmt, count_scale, loop_nest, in cgraph_clone_node()
H A Dtree-data-ref.c2190 VEC (loop_p, heap) *loop_nest) in initialize_data_dependence_relation()
2238 DDR_LOOP_NEST (res) = loop_nest; in initialize_data_dependence_relation()
4067 VEC (loop_p, heap) *loop_nest, in compute_all_dependences()
4285 struct loop *loop_nest = loop; in compute_data_dependences_for_loop() local
4293 if (!loop_nest in compute_data_dependences_for_loop()
4464 VEC (loop_p, heap) *loop_nest = NULL; in free_dependence_relations()
4470 if (loop_nest == NULL) in free_dependence_relations()
4471 loop_nest = DDR_LOOP_NEST (ddr); in free_dependence_relations()
4474 || DDR_LOOP_NEST (ddr) == loop_nest); in free_dependence_relations()
4478 if (loop_nest) in free_dependence_relations()
[all …]
H A Dcgraph.h191 int loop_nest; member
H A Dlambda-code.c1461 struct loop *loop_nest, in gcc_loopnest_to_lambda_loopnest() argument
1466 struct loop *temp = loop_nest; in gcc_loopnest_to_lambda_loopnest()
1467 int depth = depth_of_nest (loop_nest); in gcc_loopnest_to_lambda_loopnest()
1475 bool perfect_nest = perfect_nest_p (loop_nest); in gcc_loopnest_to_lambda_loopnest()
1477 if (!perfect_nest && !can_convert_to_perfect_nest (loop_nest)) in gcc_loopnest_to_lambda_loopnest()
1496 if (!perfect_nestify (currloops, loop_nest, in gcc_loopnest_to_lambda_loopnest()
H A Dipa-inline.c134 n = cgraph_clone_node (e->callee, e->count, e->loop_nest, in cgraph_clone_inlined_nodes()
399 int nest = MIN (edge->loop_nest, 8); in cgraph_edge_badness()
H A Dcgraphunit.c1811 new_e = cgraph_clone_edge (e, new_version, e->call_stmt, 0, e->loop_nest, true); in cgraph_copy_node_for_versioning()
H A DChangeLog-20061187 * tree-loop-linear.c (linear_transform_loops): Bail if loop_nest has
8447 Add a parameter for the loop_nest.
8453 loop_nest, a vec of loops.
H A DChangeLog-200517830 * cgraph.c (cgraph_create_edge): Initialize loop_nest and count.
17836 (cgraph_edge): Add count and loop_nest.
/freebsd-12.1/contrib/gcc/doc/
H A Dloop.texi562 @item an array of loops @code{loop_nest} that contains the loops to