| /dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | loop-unswitch.c | 126 if (!bb->succ || !bb->succ->succ_next || bb->succ->succ_next->succ_next) in may_unswitch_on_p()
133 || !flow_bb_inside_loop_p (loop, bb->succ->succ_next->dest)) in may_unswitch_on_p()
274 for (e = bbs[i]->succ; !(e->flags & EDGE_FALLTHRU); e = e->succ_next); in unswitch_single_loop()
282 for (e = bbs[i]->succ; e->flags & EDGE_FALLTHRU; e = e->succ_next); in unswitch_single_loop()
334 if (!unswitch_on->succ || !unswitch_on->succ->succ_next || in unswitch_loop()
335 unswitch_on->succ->succ_next->succ_next) in unswitch_loop()
343 if (!flow_bb_inside_loop_p (loop, unswitch_on->succ->succ_next->dest)) in unswitch_loop()
376 switch_bb->succ->succ_next->flags |= EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
382 switch_bb->succ->succ_next->flags &= ~EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
390 latch_edge = latch_edge->succ_next); in unswitch_loop()
|
| H A D | cfganal.c | 89 || !bb->succ || bb->succ->succ_next) in forwarder_block_p()
196 if (e->succ_next) in mark_dfs_back_edges()
197 stack[sp - 1] = e->succ_next; in mark_dfs_back_edges()
233 if (!bb->succ || !bb->succ->succ_next || bb->succ->succ_next->succ_next) in set_edge_can_fallthru_flag()
669 e = e->succ_next; in remove_fake_successors()
791 if (e->succ_next) in flow_reverse_top_sort_order_compute()
792 stack[sp - 1] = e->succ_next; in flow_reverse_top_sort_order_compute()
870 if (e->succ_next) in flow_depth_first_order_compute()
871 stack[sp - 1] = e->succ_next; in flow_depth_first_order_compute()
980 else if (e->succ_next) in flow_preorder_transversal_compute()
[all …]
|
| H A D | cfg.c | 200 edge next = e->succ_next; in clear_edges()
213 edge next = e->succ_next; in clear_edges()
299 e->succ_next = src->succ; in unchecked_make_edge()
396 last_succ->succ_next = e->succ_next; in remove_edge()
398 src->succ = e->succ_next; in remove_edge()
439 for (s = e->src->succ; s; s = s->succ_next) in redirect_edge_succ_nodup()
470 *pe = (*pe)->succ_next; in redirect_edge_pred()
473 e->succ_next = new_pred->succ; in redirect_edge_pred()
565 for (e = bb->succ; e; e = e->succ_next) in dump_flow_info()
778 for (e = bb->succ; e; e = e->succ_next) in alloc_aux_for_edges()
[all …]
|
| H A D | cfgcleanup.c | 128 || cbranch_block->succ->succ_next->succ_next) in try_simplify_condjump()
295 if (!e->src->succ->succ_next || e->src->succ->succ_next->succ_next) in thread_jump()
297 if (!b->succ || !b->succ->succ_next || b->succ->succ_next->succ_next) in thread_jump()
435 next = e->succ_next; in try_forward_edges()
1190 && bb1->succ->succ_next in outgoing_edges_match()
1191 && !bb1->succ->succ_next->succ_next in outgoing_edges_match()
1201 || !bb2->succ->succ_next in outgoing_edges_match()
1202 || bb2->succ->succ_next->succ_next in outgoing_edges_match()
1389 e1 = e1->succ_next, e2 = e2->succ_next) in outgoing_edges_match()
1832 && s->succ_next == NULL in try_optimize_cfg()
[all …]
|
| H A D | predict.c | 222 && BLOCK_FOR_INSN (insn)->succ->succ_next); in can_predict_insn_p()
267 e = e->succ_next; in dump_prediction()
376 if (bb->succ->succ_next) in combine_predictions_for_insn()
450 for (e = bb->succ; e; e = e->succ_next) in estimate_probability()
461 for (e = bb->succ; e; e = e->succ_next) in estimate_probability()
485 for (e = bb->succ; e; e = e->succ_next) in estimate_probability()
617 && bb->succ->succ_next != NULL) in estimate_probability()
709 && bb->succ && !bb->succ->succ_next in last_basic_block_p()
813 for (e = bb->succ; e; e = e->succ_next) in process_note_predictions()
1156 for (e = bb->succ; e; e = e->succ_next) in estimate_bb_frequencies()
[all …]
|
| H A D | gcov.c | 109 struct arc_info *succ_next; member
603 arc_n = arc->succ_next; in release_structures()
822 arc->succ_next = fn->blocks[src].succ; in read_graph_file()
944 arc_n = arc->succ_next; in read_graph_file()
945 arc->succ_next = arc_p; in read_graph_file()
1172 arc_p->succ_next = arc_n; in solve_flow_graph()
1175 arc->succ_next = arc_n->succ_next; in solve_flow_graph()
1176 arc_n->succ_next = arc; in solve_flow_graph()
1668 arc = arc->succ_next; in accumulate_line_counts()
1705 arc = arc->succ_next; in accumulate_line_counts()
[all …]
|
| H A D | profile.c | 144 for (e = bb->succ; e; e = e->succ_next) in instrument_edges()
249 for (e = bb->succ; e; e = e->succ_next) in get_exec_counts()
392 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
419 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
423 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
534 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
538 && bb->succ->succ_next) in compute_branch_probabilities()
547 e = e->succ_next) in compute_branch_probabilities()
578 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
598 && bb->succ->succ_next) in compute_branch_probabilities()
[all …]
|
| /dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
| H A D | loop-unswitch.c | 126 if (!bb->succ || !bb->succ->succ_next || bb->succ->succ_next->succ_next) in may_unswitch_on_p()
133 || !flow_bb_inside_loop_p (loop, bb->succ->succ_next->dest)) in may_unswitch_on_p()
274 for (e = bbs[i]->succ; !(e->flags & EDGE_FALLTHRU); e = e->succ_next); in unswitch_single_loop()
282 for (e = bbs[i]->succ; e->flags & EDGE_FALLTHRU; e = e->succ_next); in unswitch_single_loop()
334 if (!unswitch_on->succ || !unswitch_on->succ->succ_next || in unswitch_loop()
335 unswitch_on->succ->succ_next->succ_next) in unswitch_loop()
343 if (!flow_bb_inside_loop_p (loop, unswitch_on->succ->succ_next->dest)) in unswitch_loop()
376 switch_bb->succ->succ_next->flags |= EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
382 switch_bb->succ->succ_next->flags &= ~EDGE_IRREDUCIBLE_LOOP; in unswitch_loop()
390 latch_edge = latch_edge->succ_next); in unswitch_loop()
|
| H A D | cfganal.c | 89 || !bb->succ || bb->succ->succ_next) in forwarder_block_p()
196 if (e->succ_next) in mark_dfs_back_edges()
197 stack[sp - 1] = e->succ_next; in mark_dfs_back_edges()
233 if (!bb->succ || !bb->succ->succ_next || bb->succ->succ_next->succ_next) in set_edge_can_fallthru_flag()
669 e = e->succ_next; in remove_fake_successors()
791 if (e->succ_next) in flow_reverse_top_sort_order_compute()
792 stack[sp - 1] = e->succ_next; in flow_reverse_top_sort_order_compute()
870 if (e->succ_next) in flow_depth_first_order_compute()
871 stack[sp - 1] = e->succ_next; in flow_depth_first_order_compute()
980 else if (e->succ_next) in flow_preorder_transversal_compute()
[all …]
|
| H A D | cfg.c | 200 edge next = e->succ_next;
213 edge next = e->succ_next;
299 e->succ_next = src->succ;
396 last_succ->succ_next = e->succ_next;
398 src->succ = e->succ_next;
439 for (s = e->src->succ; s; s = s->succ_next)
470 *pe = (*pe)->succ_next;
473 e->succ_next = new_pred->succ;
565 for (e = bb->succ; e; e = e->succ_next)
778 for (e = bb->succ; e; e = e->succ_next)
[all …]
|
| H A D | cfgcleanup.c | 128 || cbranch_block->succ->succ_next->succ_next)
295 if (!e->src->succ->succ_next || e->src->succ->succ_next->succ_next)
297 if (!b->succ || !b->succ->succ_next || b->succ->succ_next->succ_next)
435 next = e->succ_next;
1190 && bb1->succ->succ_next
1191 && !bb1->succ->succ_next->succ_next
1201 || !bb2->succ->succ_next
1202 || bb2->succ->succ_next->succ_next
1389 e1 = e1->succ_next, e2 = e2->succ_next)
1832 && s->succ_next == NULL
[all …]
|
| H A D | predict.c | 222 && BLOCK_FOR_INSN (insn)->succ->succ_next); in can_predict_insn_p()
267 e = e->succ_next; in dump_prediction()
376 if (bb->succ->succ_next) in combine_predictions_for_insn()
450 for (e = bb->succ; e; e = e->succ_next) in estimate_probability()
461 for (e = bb->succ; e; e = e->succ_next) in estimate_probability()
485 for (e = bb->succ; e; e = e->succ_next) in estimate_probability()
617 && bb->succ->succ_next != NULL) in estimate_probability()
709 && bb->succ && !bb->succ->succ_next in last_basic_block_p()
813 for (e = bb->succ; e; e = e->succ_next) in process_note_predictions()
1156 for (e = bb->succ; e; e = e->succ_next) in estimate_bb_frequencies()
[all …]
|
| H A D | gcov.c | 109 struct arc_info *succ_next; member
603 arc_n = arc->succ_next; in release_structures()
822 arc->succ_next = fn->blocks[src].succ; in read_graph_file()
944 arc_n = arc->succ_next; in read_graph_file()
945 arc->succ_next = arc_p; in read_graph_file()
1172 arc_p->succ_next = arc_n; in solve_flow_graph()
1175 arc->succ_next = arc_n->succ_next; in solve_flow_graph()
1176 arc_n->succ_next = arc; in solve_flow_graph()
1668 arc = arc->succ_next; in accumulate_line_counts()
1705 arc = arc->succ_next; in accumulate_line_counts()
[all …]
|
| H A D | profile.c | 144 for (e = bb->succ; e; e = e->succ_next) in instrument_edges()
249 for (e = bb->succ; e; e = e->succ_next) in get_exec_counts()
392 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
419 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
423 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
534 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
538 && bb->succ->succ_next) in compute_branch_probabilities()
547 e = e->succ_next) in compute_branch_probabilities()
578 for (e = bb->succ; e; e = e->succ_next) in compute_branch_probabilities()
598 && bb->succ->succ_next) in compute_branch_probabilities()
[all …]
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | graphds.c | 48 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
82 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
153 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
177 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
318 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
336 n = e->succ_next; in free_graph()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | graphds.c | 48 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
82 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
153 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
177 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
318 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
336 n = e->succ_next; in free_graph()
|
| /dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
| H A D | gcov.c | 108 struct arc_info *succ_next; member
594 arc_n = arc->succ_next; in release_structures()
813 arc->succ_next = fn->blocks[src].succ; in read_graph_file()
933 arc_n = arc->succ_next; in read_graph_file()
934 arc->succ_next = arc_p; in read_graph_file()
1158 arc_p->succ_next = arc_n; in solve_flow_graph()
1161 arc->succ_next = arc_n->succ_next; in solve_flow_graph()
1162 arc_n->succ_next = arc; in solve_flow_graph()
1654 arc = arc->succ_next; in accumulate_line_counts()
1691 arc = arc->succ_next; in accumulate_line_counts()
[all …]
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | graphds.c | 46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
161 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
191 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | graphds.c | 46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
161 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
191 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | graphds.c | 46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
161 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
191 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | graphds.c | 48 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
83 e->succ_next = vf->succ; in add_edge()
100 next = e->succ_next; in identify_vertices()
103 e->succ_next = vv->succ; in identify_vertices()
154 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
178 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
319 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | graphds.c | 46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
161 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
191 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | graphds.c | 46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
161 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
191 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
| H A D | graphds.c | 46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
161 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
191 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | graphds.c | 46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
99 next = e->succ_next; in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
161 e = forward ? e->succ_next : e->pred_next; in foll_in_subgraph()
191 return foll_in_subgraph (forward ? e->succ_next : e->pred_next, in dfs_next_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
|