Searched refs:new_edge (Results 1 - 10 of 10) sorted by relevance
| /haiku-buildtools/gcc/gcc/ |
| H A D | cgraphclones.c | 130 cgraph_edge *new_edge; local
152 new_edge = n->create_edge (callee, call_stmt, gcov_count, freq);
156 new_edge = n->create_indirect_edge (call_stmt,
159 *new_edge->indirect_info = *indirect_info;
164 new_edge = n->create_edge (callee, call_stmt, gcov_count, freq);
167 new_edge->indirect_info
169 *new_edge->indirect_info = *indirect_info;
173 new_edge->inline_failed = inline_failed;
174 new_edge->indirect_inlining_edge = indirect_inlining_edge;
175 new_edge
[all...] |
| H A D | cfgrtl.c | 1519 edge new_edge;
1683 new_edge = make_edge (e->src, jump_block, EDGE_FALLTHRU);
1684 new_edge->probability = probability;
1685 new_edge->count = count;
1693 fixup_partition_crossing (new_edge);
1699 new_edge->probability /= 2;
1700 new_edge->count /= 2;
1703 new_edge = make_edge (new_edge->src, target,
1705 new_edge
1511 edge new_edge; local
[all...] |
| H A D | auto-profile.c | 1023 struct cgraph_edge *new_edge local
1025 new_edge->redirect_call_stmt_to_callee ();
1027 inline_call (new_edge, true, NULL, NULL, false);
|
| H A D | bb-reorder.c | 2042 edge new_edge;
2152 new_edge = make_edge (new_bb, dest, 0);
2154 new_edge = EDGE_SUCC (new_bb, 0);
2157 new_edge->flags |= EDGE_CROSSING;
2041 edge new_edge; local
|
| H A D | tree-inline.c | 2218 edge new_edge; local
2227 new_edge = make_edge (new_bb, (basic_block) old_edge->dest->aux, flags);
2228 new_edge->count = apply_scale (old_edge->count, count_scale);
2229 new_edge->probability = old_edge->probability;
2333 edge new_edge; local
2348 FOR_EACH_EDGE (new_edge, ei, new_bb->preds)
2350 edge old_edge = find_edge ((basic_block) new_edge->src->aux, bb);
2376 gsi_insert_seq_on_edge (new_edge, stmts);
2393 add_phi_arg (new_phi, new_arg, new_edge, locus);
2400 FOR_EACH_EDGE (new_edge, e
[all...] |
| H A D | cfgloop.c | 1020 rescan_loop_exit (edge e, bool new_edge, bool removed)
1051 if (!exits && new_edge)
1019 rescan_loop_exit(edge e, bool new_edge, bool removed) argument
|
| H A D | tree-cfg.c | 2659 reinstall_phi_args (edge new_edge, edge old_edge) argument
2669 for (i = 0, phis = gsi_start_phis (new_edge->dest);
2679 add_phi_arg (phi, arg, new_edge, redirect_edge_var_map_location (vm));
2712 edge new_edge, e; local
2724 new_edge = make_edge (new_bb, dest, EDGE_FALLTHRU);
2725 new_edge->probability = REG_BR_PROB_BASE;
2726 new_edge->count = edge_in->count;
2730 reinstall_phi_args (new_edge, e);
|
| H A D | cfgexpand.c | 2150 edge new_edge; local
2265 new_edge = make_edge (new_bb, dest, 0);
2266 new_edge->probability = REG_BR_PROB_BASE;
2267 new_edge->count = new_bb->count;
|
| H A D | tree-chkp.c | 4052 struct cgraph_edge *new_edge; local
4058 new_edge = edge->caller->create_edge (callee,
4062 new_edge->frequency = compute_call_stmt_bb_frequency
|
| /haiku-buildtools/legacy/gcc/gcc/ |
| H A D | haifa-sched.c | 506 static void new_edge PROTO ((int, int));
1187 new_edge (i, INT_LIST_VAL (succ));
1204 new_edge (source, target)
1201 new_edge (source, target) function
|
Completed in 192 milliseconds