| /freebsd-10-stable/contrib/gcc/ |
| H A D | tree-loop-linear.c | 254 struct loop *loop_nest = loops->parray[i]; local
273 if (!loop_nest || !loop_nest->inner || !loop_nest->single_exit)
278 for (temp = loop_nest->inner; temp; temp = temp->inner)
295 compute_data_dependences_for_loop (loop_nest, true, &datarefs,
305 datarefs, loop_nest);
322 before = gcc_loopnest_to_lambda_loopnest (loops, loop_nest, &oldivs,
342 lambda_loopnest_to_gcc_loopnest (loop_nest, oldivs, invariants,
|
| H A D | tree-data-ref.h | 233 VEC (loop_p, heap) *loop_nest; member in struct:data_dependence_relation
254 #define DDR_LOOP_NEST(DDR) DDR->loop_nest
302 index_in_loop_nest (int var, VEC (loop_p, heap) *loop_nest)
307 for (var_index = 0; VEC_iterate (loop_p, loop_nest, var_index, loopi);
301 index_in_loop_nest(int var, VEC (loop_p, heap) *loop_nest) argument
|
| H A D | cgraph.c | 416 edge->loop_nest = nest;
766 if (edge->loop_nest)
767 fprintf (f, "(nested in %i loops) ", edge->loop_nest);
1038 tree call_stmt, gcov_type count_scale, int loop_nest,
1045 e->loop_nest + loop_nest);
1064 cgraph_clone_node (struct cgraph_node *n, gcov_type count, int loop_nest, argument
1096 cgraph_clone_edge (e, new, e->call_stmt, count_scale, loop_nest,
1037 cgraph_clone_edge(struct cgraph_edge *e, struct cgraph_node *n, tree call_stmt, gcov_type count_scale, int loop_nest, bool update_original) argument
|
| H A D | cgraph.h | 191 int loop_nest; local
|
| H A D | tree-data-ref.c | 2193 VEC (loop_p, heap) *loop_nest)
2241 DDR_LOOP_NEST (res) = loop_nest;
4071 VEC (loop_p, heap) *loop_nest,
4082 ddr = initialize_data_dependence_relation (a, b, loop_nest);
4090 ddr = initialize_data_dependence_relation (a, a, loop_nest);
4238 find_loop_nest_1 (struct loop *loop, VEC (loop_p, heap) **loop_nest)
4257 VEC_safe_push (loop_p, heap, *loop_nest, loop);
4259 return find_loop_nest_1 (loop->inner, loop_nest);
4269 find_loop_nest (struct loop *loop, VEC (loop_p, heap) **loop_nest)
4271 VEC_safe_push (loop_p, heap, *loop_nest, loo
2188 initialize_data_dependence_relation(struct data_reference *a, struct data_reference *b, VEC (loop_p, heap) *loop_nest) argument
4234 find_loop_nest_1(struct loop *loop, VEC (loop_p, heap) **loop_nest) argument
4265 find_loop_nest(struct loop *loop, VEC (loop_p, heap) **loop_nest) argument
4285 struct loop *loop_nest = loop; local
[all...] |
| H A D | lambda-code.c | 1461 struct loop *loop_nest,
1466 struct loop *temp = loop_nest;
1467 int depth = depth_of_nest (loop_nest);
1475 bool perfect_nest = perfect_nest_p (loop_nest);
1477 if (!perfect_nest && !can_convert_to_perfect_nest (loop_nest))
1496 if (!perfect_nestify (currloops, loop_nest,
1460 gcc_loopnest_to_lambda_loopnest(struct loops *currloops, struct loop *loop_nest, VEC(tree,heap) **inductionvars, VEC(tree,heap) **invariants) argument
|
| H A D | ipa-inline.c | 134 n = cgraph_clone_node (e->callee, e->count, e->loop_nest,
399 int nest = MIN (edge->loop_nest, 8);
|
| H A D | cgraphunit.c | 1811 new_e = cgraph_clone_edge (e, new_version, e->call_stmt, 0, e->loop_nest, true);
|