diff options
| -rw-r--r-- | gcc/ChangeLog | 6 | ||||
| -rw-r--r-- | gcc/ipa-inline.c | 4 |
2 files changed, 8 insertions, 2 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 1f4301d..3a1046b 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,5 +1,11 @@ 2006-12-13 Richard Guenther <rguenther@suse.de> + * ipa-inline.c (cgraph_flatten_node): Replace leafify with + flatten. + (cgraph_decide_inlining): Likewise. + +2006-12-13 Richard Guenther <rguenther@suse.de> + PR tree-optimization/17687 * builtins.def (BUILT_IN_CEXPI, BUILT_IN_CEXPIF, BUILT_IN_CEXPIL): New builtins for imaginary argument cexp. diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c index 8e47f36..feb104f 100644 --- a/gcc/ipa-inline.c +++ b/gcc/ipa-inline.c @@ -558,7 +558,7 @@ cgraph_find_cycles (struct cgraph_node *node, htab_t cycles) node->aux = 0; } -/* Leafify the cgraph node. We have to be careful in recursing +/* Flatten the cgraph node. We have to be careful in recursing as to not run endlessly in circles of the callgraph. We do so by using a hashtab of cycle entering nodes as generated by cgraph_find_cycles. */ @@ -983,7 +983,7 @@ cgraph_decide_inlining (void) htab_t cycles; if (dump_file) fprintf (dump_file, - "Leafifying %s\n", cgraph_node_name (node)); + "Flattening %s\n", cgraph_node_name (node)); cycles = htab_create (7, htab_hash_pointer, htab_eq_pointer, NULL); cgraph_find_cycles (node, cycles); cgraph_flatten_node (node, cycles); |