ipa-inline.c (cgraph_flatten_node): Replace leafify with flatten.

2006-12-13  Richard Guenther  <rguenther@suse.de>

	* ipa-inline.c (cgraph_flatten_node): Replace leafify with
	flatten.
	(cgraph_decide_inlining): Likewise.

From-SVN: r119827

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 1f4301dfd394861c014508516d82a6acb8368e30..3a1046bf972b55d2473918fa3398f14ac5df97ff 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,9 @@
+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

diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c
index 8e47f36509bc89d3f90b548b75210cf319aa540d..feb104fe63517a9598de2ddff1ca847e1fa5bbb4 100644 (file)
--- 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);