* cgraphunit.c (cgraph_postorder): Fix typo in comment.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@77257 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e1934fa..43d54a1 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,7 @@
+2004-02-04  Aldy Hernandez  <aldyh@redhat.com>
+ 
+        * cgraphunit.c (cgraph_postorder): Fix typo in comment.
+

 2004-02-04  Ulrich Weigand  <uweigand@de.ibm.com>
 
        * config/s390/s390.md ("*la_64" + peepholes, "reload_indi"): Move
 2004-02-04  Ulrich Weigand  <uweigand@de.ibm.com>
 
        * config/s390/s390.md ("*la_64" + peepholes, "reload_indi"): Move

diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index f68bd2a..ea9cae6 100644 (file)
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -555,7 +555,7 @@ cgraph_postorder (struct cgraph_node **order)
   /* We have to deal with cycles nicely, so use a depth first traversal
      output algorithm.  Ignore the fact that some functions won't need
      to be output and put them into order as well, so we get dependencies
   /* We have to deal with cycles nicely, so use a depth first traversal
      output algorithm.  Ignore the fact that some functions won't need
      to be output and put them into order as well, so we get dependencies

-     right through intline functions.  */
+     right throughout inline functions.  */

   for (node = cgraph_nodes; node; node = node->next)
     node->aux = NULL;
   for (node = cgraph_nodes; node; node = node->next)
   for (node = cgraph_nodes; node; node = node->next)
     node->aux = NULL;
   for (node = cgraph_nodes; node; node = node->next)