diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2004-04-30 16:27:30 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2004-04-30 16:27:30 +0000 |
| commit | 1ae58c30e27a46925523033fe3f5aa20f7b6b4d0 (patch) | |
| tree | 5061220e8209778aa37f21016395d5b6b6291a31 /gcc/cgraphunit.c | |
| parent | a692ad2ece994e2e1cd8dbe06fb7efda4098cbec (diff) | |
| download | gcc-1ae58c30e27a46925523033fe3f5aa20f7b6b4d0.zip gcc-1ae58c30e27a46925523033fe3f5aa20f7b6b4d0.tar.gz gcc-1ae58c30e27a46925523033fe3f5aa20f7b6b4d0.tar.bz2 | |
bb-reorder.c, [...]: Fix comment typos.
* bb-reorder.c, c-opts.c, cfglayout.c, cgraph.c, cgraphunit.c,
cppfiles.c, fold-const.c, ggc-zone.c, loop-doloop.c, optabs.c,
reg-stack.c, varasm.c, config/alpha/ev4.md,
config/alpha/ev5.md, config/alpha/ev6.md, config/arm/arm.c,
config/c4x/c4x.c, config/c4x/c4x.md, config/cris/cris.c,
config/cris/cris.h, config/fr30/fr30.h, config/frv/frv.c,
config/frv/frv.h, config/frv/frv.md, config/h8300/h8300.c,
config/i386/i386.c, config/i386/i386.md, config/i386/winnt.c,
config/ia64/itanium2.md, config/ip2k/ip2k.c,
config/mips/mips.c, config/mips/mips.h, config/mips/sr71k.md,
config/pa/pa.c, config/s390/s390.c, config/sh/sh.c: Fix
comment typos.
From-SVN: r81345
Diffstat (limited to 'gcc/cgraphunit.c')
| -rw-r--r-- | gcc/cgraphunit.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c index cbe468e..156c924 100644 --- a/gcc/cgraphunit.c +++ b/gcc/cgraphunit.c @@ -36,7 +36,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA - cgraph_varpool_finalize_variable - This function has same behaviour as the above but is used for static + This function has same behavior as the above but is used for static variables. - cgraph_finalize_compilation_unit @@ -324,7 +324,7 @@ cgraph_finalize_function (tree decl, bool nested) if (node->output) abort (); - /* Reset our datastructures so we can analyze the function again. */ + /* Reset our data structures so we can analyze the function again. */ memset (&node->local, 0, sizeof (node->local)); memset (&node->global, 0, sizeof (node->global)); memset (&node->rtl, 0, sizeof (node->rtl)); @@ -1022,7 +1022,7 @@ cgraph_clone_inlined_nodes (struct cgraph_edge *e, bool duplicate) { struct cgraph_node *n; - /* We may elliminate the need for out-of-line copy to be output. In that + /* We may eliminate the need for out-of-line copy to be output. In that case just go ahead and re-use it. */ if (!e->callee->callers->next_caller && (!e->callee->needed || DECL_EXTERNAL (e->callee->decl)) @@ -1348,7 +1348,7 @@ cgraph_decide_inlining_of_small_functions (void) } /* Decide on the inlining. We do so in the topological order to avoid - expenses on updating datastructures. */ + expenses on updating data structures. */ static void cgraph_decide_inlining (void) @@ -1491,7 +1491,7 @@ cgraph_decide_inlining (void) } /* Decide on the inlining. We do so in the topological order to avoid - expenses on updating datastructures. */ + expenses on updating data structures. */ static void cgraph_decide_inlining_incrementally (struct cgraph_node *node) @@ -1561,7 +1561,7 @@ cgraph_expand_all_functions (void) if (order_pos != cgraph_n_nodes) abort (); - /* Garbage collector may remove inline clones we elliminate during + /* Garbage collector may remove inline clones we eliminate during optimization. So we must be sure to not reference them. */ for (i = 0; i < order_pos; i++) if (order[i]->output) |