diff options
Diffstat (limited to 'gcc/cgraph.c')
-rw-r--r-- | gcc/cgraph.c | 56 |
1 files changed, 28 insertions, 28 deletions
diff --git a/gcc/cgraph.c b/gcc/cgraph.c index b5564b6..37ad9f1 100644 --- a/gcc/cgraph.c +++ b/gcc/cgraph.c @@ -1159,25 +1159,25 @@ cgraph_clone_edge (struct cgraph_edge *e, struct cgraph_node *n, gimple call_stmt, gcov_type count_scale, int freq_scale, int loop_nest, bool update_original) { - struct cgraph_edge *new; + struct cgraph_edge *new_edge; gcov_type count = e->count * count_scale / REG_BR_PROB_BASE; gcov_type freq = e->frequency * (gcov_type) freq_scale / CGRAPH_FREQ_BASE; if (freq > CGRAPH_FREQ_MAX) freq = CGRAPH_FREQ_MAX; - new = cgraph_create_edge (n, e->callee, call_stmt, count, freq, + new_edge = cgraph_create_edge (n, e->callee, call_stmt, count, freq, e->loop_nest + loop_nest); - new->inline_failed = e->inline_failed; - new->indirect_call = e->indirect_call; + new_edge->inline_failed = e->inline_failed; + new_edge->indirect_call = e->indirect_call; if (update_original) { - e->count -= new->count; + e->count -= new_edge->count; if (e->count < 0) e->count = 0; } - cgraph_call_edge_duplication_hooks (e, new); - return new; + cgraph_call_edge_duplication_hooks (e, new_edge); + return new_edge; } /* Create node representing clone of N executed COUNT times. Decrease @@ -1190,25 +1190,25 @@ struct cgraph_node * cgraph_clone_node (struct cgraph_node *n, gcov_type count, int freq, int loop_nest, bool update_original) { - struct cgraph_node *new = cgraph_create_node (); + struct cgraph_node *new_node = cgraph_create_node (); struct cgraph_edge *e; gcov_type count_scale; - new->decl = n->decl; - new->origin = n->origin; - if (new->origin) + new_node->decl = n->decl; + new_node->origin = n->origin; + if (new_node->origin) { - new->next_nested = new->origin->nested; - new->origin->nested = new; + new_node->next_nested = new_node->origin->nested; + new_node->origin->nested = new_node; } - new->analyzed = n->analyzed; - new->local = n->local; - new->global = n->global; - new->rtl = n->rtl; - new->master_clone = n->master_clone; - new->count = count; + new_node->analyzed = n->analyzed; + new_node->local = n->local; + new_node->global = n->global; + new_node->rtl = n->rtl; + new_node->master_clone = n->master_clone; + new_node->count = count; if (n->count) - count_scale = new->count * REG_BR_PROB_BASE / n->count; + count_scale = new_node->count * REG_BR_PROB_BASE / n->count; else count_scale = 0; if (update_original) @@ -1219,17 +1219,17 @@ cgraph_clone_node (struct cgraph_node *n, gcov_type count, int freq, } for (e = n->callees;e; e=e->next_callee) - cgraph_clone_edge (e, new, e->call_stmt, count_scale, freq, loop_nest, + cgraph_clone_edge (e, new_node, e->call_stmt, count_scale, freq, loop_nest, update_original); - new->next_clone = n->next_clone; - new->prev_clone = n; - n->next_clone = new; - if (new->next_clone) - new->next_clone->prev_clone = new; + new_node->next_clone = n->next_clone; + new_node->prev_clone = n; + n->next_clone = new_node; + if (new_node->next_clone) + new_node->next_clone->prev_clone = new_node; - cgraph_call_node_duplication_hooks (n, new); - return new; + cgraph_call_node_duplication_hooks (n, new_node); + return new_node; } /* Return true if N is an master_clone, (see cgraph_master_clone). */ |