| /openbsd-src/gnu/gcc/gcc/ |
| H A D | tree-loop-linear.c | 254 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 D | tree-data-ref.h | 233 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 D | cgraph.c | 416 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 D | tree-data-ref.c | 2190 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()
4078 ddr = initialize_data_dependence_relation (a, b, loop_nest); in compute_all_dependences()
4086 ddr = initialize_data_dependence_relation (a, a, loop_nest); in compute_all_dependences()
4234 find_loop_nest_1 (struct loop *loop, VEC (loop_p, heap) **loop_nest) in find_loop_nest_1() argument
4253 VEC_safe_push (loop_p, heap, *loop_nest, loop); in find_loop_nest_1()
4255 return find_loop_nest_1 (loop->inner, loop_nest); in find_loop_nest_1()
4265 find_loop_nest (struct loop *loop, VEC (loop_p, heap) **loop_nest) in find_loop_nest() argument
4267 VEC_safe_push (loop_p, heap, *loop_nest, loop); in find_loop_nest()
[all …]
|
| H A D | cgraph.h | 191 int loop_nest; member
|
| H A D | lambda-code.c | 1461 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 D | ipa-inline.c | 134 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 D | cgraphunit.c | 1797 new_e = cgraph_clone_edge (e, new_version, e->call_stmt, 0, e->loop_nest, true); in cgraph_copy_node_for_versioning()
|
| /openbsd-src/gnu/gcc/gcc/doc/ |
| H A D | loop.texi | 562 @item an array of loops @code{loop_nest} that contains the loops to
|
| H A D | gccint.info | 8457 * an array of loops `loop_nest' that contains the loops to which the
|