Home
last modified time | relevance | path

Searched refs:loop_father (Results 1 – 24 of 24) sorted by relevance

/openbsd/src/gnu/gcc/gcc/
Dcfgloopmanip.c111 act = e->dest->loop_father; in fix_bb_placement()
119 if (loop == bb->loop_father) in fix_bb_placement()
156 base_loop = from->loop_father; in fix_bb_placements()
181 if (from->loop_father->header == from) in fix_bb_placements()
184 if (!fix_loop_placement (from->loop_father)) in fix_bb_placements()
215 nca = find_common_loop (pred->loop_father, base_loop); in fix_bb_placements()
216 if (pred->loop_father != base_loop in fix_bb_placements()
218 || nca != pred->loop_father)) in fix_bb_placements()
219 pred = pred->loop_father->header; in fix_bb_placements()
220 else if (!flow_loop_nested_p (from->loop_father, pred->loop_father)) in fix_bb_placements()
[all …]
Dcfgloopanal.c43 if (bb->loop_father != loop) in just_once_each_iteration_p()
220 if (flow_bb_inside_loop_p (real->src->loop_father, real->dest)) in check_irred()
300 if (e->dest->loop_father->header == e->dest in mark_irreducible_loops()
301 && e->dest->loop_father->latch == act) in mark_irreducible_loops()
315 if (e->dest->loop_father->header == e->dest) in mark_irreducible_loops()
316 dest = LOOP_REPR (e->dest->loop_father); in mark_irreducible_loops()
318 if (!flow_bb_inside_loop_p (act->loop_father, e->dest)) in mark_irreducible_loops()
320 depth = find_common_loop (act->loop_father, in mark_irreducible_loops()
321 e->dest->loop_father)->depth + 1; in mark_irreducible_loops()
322 if (depth == act->loop_father->depth) in mark_irreducible_loops()
[all …]
Dcfgloop.c230 header->loop_father = loop; in flow_loop_nodes_find()
233 if (loop->latch->loop_father != loop) in flow_loop_nodes_find()
239 loop->latch->loop_father = loop; in flow_loop_nodes_find()
255 && ancestor->loop_father != loop) in flow_loop_nodes_find()
257 ancestor->loop_father = loop; in flow_loop_nodes_find()
290 if (bb->loop_father == loops->tree_root) in mark_single_exit_loops()
297 if (flow_bb_inside_loop_p (bb->loop_father, e->dest)) in mark_single_exit_loops()
300 for (loop = bb->loop_father; in mark_single_exit_loops()
301 loop != e->dest->loop_father; in mark_single_exit_loops()
681 ENTRY_BLOCK_PTR->loop_father = loops->parray[0]; in flow_loops_find()
[all …]
Dtree-ssa-loop-im.c315 max_loop = find_common_loop (loop, def_bb->loop_father); in outermost_invariant_loop()
401 && def_bb->loop_father == loop) in add_dependency()
483 struct loop *loop = bb->loop_father; in determine_max_movement()
516 struct loop *stmt_loop = bb_for_stmt (stmt)->loop_father; in set_level()
542 set_level (stmt, bb_for_stmt (stmt)->loop_father, LIM_DATA (stmt)->max_loop); in set_profitable_level()
587 if (!bb->loop_father->outer) in determine_invariantness_stmt()
592 bb->index, bb->loop_father->num, bb->loop_father->depth); in determine_invariantness_stmt()
707 find_common_loop (single_pred (bb)->loop_father, in loop_commit_inserts()
708 single_succ (bb)->loop_father)); in loop_commit_inserts()
725 if (!bb->loop_father->outer) in move_computations_stmt()
[all …]
Dtree-ssa-loop-manip.c139 def_loop = find_common_loop (def_bb->loop_father, e->src->loop_father); in add_exit_phis_edge()
210 && !flow_bb_inside_loop_p (e->src->loop_father, bb)) in get_loops_exits()
243 def_loop = def_bb->loop_father; in find_uses_to_rename_use()
401 || flow_bb_inside_loop_p (def_bb->loop_father, bb)); in check_loop_closed_ssa_use()
487 loop_c = find_common_loop (src->loop_father, dest->loop_father); in bsi_insert_on_edge_immediate_loop()
495 if (dest->loop_father->latch == src) in bsi_insert_on_edge_immediate_loop()
496 dest->loop_father->latch = new_bb; in bsi_insert_on_edge_immediate_loop()
Dtree-ssa-sink.c387 || sinkbb->loop_father != frombb->loop_father) in statement_sink_location()
413 || sinkbb->loop_father != frombb->loop_father) in statement_sink_location()
Dcfglayout.c1234 add_bb_to_loop (new_bb, bb->loop_father->copy); in copy_bbs()
1236 if (bb->loop_father->header == bb && bb->loop_father != base) in copy_bbs()
1237 new_bb->loop_father->header = new_bb; in copy_bbs()
1239 if (bb->loop_father->latch == bb && bb->loop_father != base) in copy_bbs()
1240 new_bb->loop_father->latch = new_bb; in copy_bbs()
Dloop-invariant.c541 if (body[i]->loop_father == loop) in find_exits()
562 e->dest->loop_father); in find_exits()
570 if (body[i]->loop_father->header != body[i]) in find_exits()
573 if (LOOP_DATA (body[i]->loop_father)->has_call) in find_exits()
578 aexit = LOOP_DATA (body[i]->loop_father)->outermost_exit; in find_exits()
Dtree-scalar-evolution.c1504 struct loop *loop = bb_for_stmt (loop_phi_node)->loop_father; in analyze_initial_condition()
1920 def_loop = bb ? bb->loop_father : NULL; in analyze_scalar_evolution_1()
1932 if (loop != bb->loop_father) in analyze_scalar_evolution_1()
1934 (find_common_loop (loop, bb->loop_father), bb->loop_father, res); in analyze_scalar_evolution_1()
2194 def_loop = find_common_loop (loop, def_bb->loop_father); in instantiate_parameters_1()
2808 ev = analyze_scalar_evolution_in_loop (loop, bb->loop_father, op, in simple_iv()
2900 loop = bb->loop_father; in scev_const_prop()
2980 ex_loop = superloop_at_depth (loop, exit->dest->loop_father->depth + 1); in scev_const_prop()
Dtree-cfgcleanup.c308 if (bb->loop_father->header == bb) in tree_forwarder_block_p()
312 if (dest->loop_father->header == dest) in tree_forwarder_block_p()
Dlambda-code.c2085 if (bbs[i]->loop_father == loop) in perfect_nest_p()
2296 if (bbs[i]->loop_father == loop) in can_convert_to_perfect_nest()
2337 if (bb_for_stmt (USE_STMT (use_a))->loop_father in can_convert_to_perfect_nest()
2347 if (bb_for_stmt (USE_STMT (use_b))->loop_father in can_convert_to_perfect_nest()
2363 if (bb_for_stmt (arg_stmt)->loop_father in can_convert_to_perfect_nest()
2517 newloop = duplicate_loop (loops, loop, olddest->loop_father); in perfect_nestify()
2570 if (bbs[i]->loop_father == loop) in perfect_nestify()
Dtree-cfg.c1238 && b->loop_father->latch == b) in tree_can_merge_blocks_p()
1331 && a->loop_father != b->loop_father) in tree_merge_blocks()
2014 struct loop *loop = bb->loop_father; in remove_bb()
4429 struct loop *loop = entry->dest->loop_father; in tree_duplicate_sese_region()
4447 if (region[i]->loop_father != loop) in tree_duplicate_sese_region()
5190 if (bb->loop_father == loop) in print_loop()
5220 if (bb && bb->loop_father) in print_loop_ir()
5221 print_loop (file, bb->loop_father, 0); in print_loop_ir()
Dtree-ssa-loop-prefetch.c469 if (bb->loop_father != loop) in gather_memory_references()
Dbasic-block.h227 struct loop * GTY ((skip (""))) loop_father;
Dtree-flow-inline.h742 return bb->loop_father; in loop_containing_stmt()
Dtree-vectorizer.c228 struct loop *loop = bb->loop_father; in rename_variables_in_bb()
Dtree-ssa-pre.c2497 firstinsideloop = flow_bb_inside_loop_p (block->loop_father, in insert_into_preds_of_block()
2499 secondinsideloop = flow_bb_inside_loop_p (block->loop_father, in insert_into_preds_of_block()
Dtree-ssa-loop-ivopts.c947 struct loop *loop = bb_for_stmt (phi)->loop_father; in determine_biv_step()
1019 if (incr_bb->loop_father != data->current_loop in mark_bivs()
Dloop-iv.c2551 if (exit_bb->loop_father != loop) in check_simple_exit()
/openbsd/src/gnu/usr.bin/gcc/gcc/
Dcfgloop.c336 header->loop_father = loop;
340 if (loop->latch->loop_father != loop)
346 loop->latch->loop_father = loop;
361 && ancestor->loop_father != loop)
363 ancestor->loop_father = loop;
852 ENTRY_BLOCK_PTR->loop_father = loops->parray[0];
853 EXIT_BLOCK_PTR->loop_father = loops->parray[0];
861 bb->loop_father = loops->tree_root;
908 flow_loop_tree_node_add (header->loop_father, loop);
964 source_loop = bb->loop_father;
[all …]
Dbasic-block.h220 struct loop *loop_father; member
DChangeLog.74326 * basic-block.h (struct basic_block_def): New field loop_father.
4336 * cfg.c (entry_exit_blocks): Initialize loop_father field.
/openbsd/src/gnu/gcc/gcc/doc/
Dloop.texi74 to (@code{loop_father}). For this reason, it is only possible to have
130 the structures. @code{loop_father} field of each basic block contains
Dgccint.info7952 belongs to (`loop_father'). For this reason, it is only possible to
8013 structures. `loop_father' field of each basic block contains the