summaryrefslogtreecommitdiff
path: root/gcc/cgraphunit.c
diff options
context:
space:
mode:
authoraldyh <aldyh@138bc75d-0d04-0410-961f-82ee72b054a4>2004-02-04 17:38:22 +0000
committeraldyh <aldyh@138bc75d-0d04-0410-961f-82ee72b054a4>2004-02-04 17:38:22 +0000
commiteefb1eb2ac532d5acc8465d9fc1de0427e43f1c0 (patch)
tree51baf842b8cdc5285e8b3297214aaf183dbb6926 /gcc/cgraphunit.c
parentd787442983690c927a57d4ee3ebe04fd0926c43d (diff)
downloadgcc-eefb1eb2ac532d5acc8465d9fc1de0427e43f1c0.tar.gz
* 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
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 f68bd2a34df..ea9cae664b2 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)