aboutsummaryrefslogtreecommitdiff
path: root/gcc/cgraphunit.c
diff options
context:
space:
mode:
authorAldy Hernandez <aldyh@redhat.com>2004-02-04 17:38:22 +0000
committerAldy Hernandez <aldyh@gcc.gnu.org>2004-02-04 17:38:22 +0000
commite0cc7f73ab6d5d6a6bbc11ab2be7b50580c8741d (patch)
tree51baf842b8cdc5285e8b3297214aaf183dbb6926 /gcc/cgraphunit.c
parent56766e0db52fc71287838c62892fec2092a039b7 (diff)
downloadgcc-e0cc7f73ab6d5d6a6bbc11ab2be7b50580c8741d.zip
gcc-e0cc7f73ab6d5d6a6bbc11ab2be7b50580c8741d.tar.gz
gcc-e0cc7f73ab6d5d6a6bbc11ab2be7b50580c8741d.tar.bz2
* cgraphunit.c (cgraph_postorder): Fix typo in comment.
From-SVN: r77257
Diffstat (limited to 'gcc/cgraphunit.c')
-rw-r--r--gcc/cgraphunit.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index f68bd2a..ea9cae6 100644
--- 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
- 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)