diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-04-29 15:39:12 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2004-04-29 15:39:12 +0000 |
| commit | 9c9bad970601f22c1e83f9333b912bbb2d9f7763 (patch) | |
| tree | 6c0fb333200e6a04c7e72f1b30ce293bef0d3d4c /gcc/cgraphunit.c | |
| parent | 767efd18dd81f73b1b69029182b1bc5b2b0b3c1d (diff) | |
| download | gcc-9c9bad970601f22c1e83f9333b912bbb2d9f7763.tar.gz | |
* builtins.c, cgraph.c, cgraphunit.c, final.c, fold-const.c:
Fix comment typos.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@81291 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/cgraphunit.c')
| -rw-r--r-- | gcc/cgraphunit.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c index 4bdd41a5aa9..cbe468e2a9e 100644 --- a/gcc/cgraphunit.c +++ b/gcc/cgraphunit.c @@ -923,7 +923,7 @@ cgraph_remove_unreachable_nodes (void) eliminated Reachable extern inline functions we sometimes inlined will be turned into unanalyzed nodes so they look like for true extern functions to the rest - of code. Body of such functions is relased via remove_node once the + of code. Body of such functions is released via remove_node once the inline clones are eliminated. */ for (node = cgraph_nodes; node; node = node->next) { @@ -1047,7 +1047,7 @@ cgraph_clone_inlined_nodes (struct cgraph_edge *e, bool duplicate) else e->callee->global.inlined_to = e->caller; - /* Recursivly clone all bodies. */ + /* Recursively clone all bodies. */ for (e = e->callee->callees; e; e = e->next_callee) if (!e->inline_failed) cgraph_clone_inlined_nodes (e, duplicate); @@ -1110,7 +1110,7 @@ cgraph_mark_inline (struct cgraph_edge *edge) struct cgraph_edge *e, *next; int times = 0; - /* Look for all calls, mark them inline and clone recursivly + /* Look for all calls, mark them inline and clone recursively all inlined functions. */ for (e = what->callers; e; e = next) { @@ -1182,7 +1182,7 @@ cgraph_default_inline_p (struct cgraph_node *n) /* Return true when inlining WHAT would create recursive inlining. We call recursive inlining all cases where same function appears more than - once in the single recusion nest path in the inline graph. */ + once in the single recursion nest path in the inline graph. */ static bool cgraph_recursive_inlining_p (struct cgraph_node *to, |