diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2005-04-01 03:42:55 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-04-01 03:42:55 +0000 |
| commit | aabcd30904d8ae69db59eedd1120e26ee89b9c61 (patch) | |
| tree | 782893b0afb24d21b87a6216e40df5e5f887e02f /gcc/cgraphunit.c | |
| parent | 59cffcf69a5026fc54a38479c93f8ea961db8ecd (diff) | |
| download | gcc-aabcd30904d8ae69db59eedd1120e26ee89b9c61.zip gcc-aabcd30904d8ae69db59eedd1120e26ee89b9c61.tar.gz gcc-aabcd30904d8ae69db59eedd1120e26ee89b9c61.tar.bz2 | |
cgraphunit.c, [...]: Fix comment typos.
* cgraphunit.c, dbxout.c, flow.c, gcse.c, gimplify.c,
lambda-code.c, loop.c, machmode.def, mips-tfile.c,
modulo-sched.c, passes.c, postreload-gcse.c, tree-eh.c,
tree-ssa-ccp.c, varasm.c, config/frv/frv.c, config/frv/frv.h,
config/frv/frv.md, config/i386/i386.c, config/i386/i386.h,
config/i386/i386.md, config/rs6000/predicates.md,
config/rs6000/rs6000.c, config/s390/fixdfdi.h,
config/s390/s390.c, config/stormy16/stormy16.c,
config/stormy16/stormy16.md, config/vax/vax.md: Fix comment
typos.
From-SVN: r97362
Diffstat (limited to 'gcc/cgraphunit.c')
| -rw-r--r-- | gcc/cgraphunit.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c index 3bb143f..528b7da 100644 --- a/gcc/cgraphunit.c +++ b/gcc/cgraphunit.c @@ -282,8 +282,8 @@ decide_is_function_needed (struct cgraph_node *node, tree decl) return false; } -/* Walk the decls we marked as neccesary and see if they reference new variables - or functions and add them into the worklists. */ +/* Walk the decls we marked as necessary and see if they reference new + variables or functions and add them into the worklists. */ static bool cgraph_varpool_analyze_pending_decls (void) { @@ -307,10 +307,10 @@ cgraph_varpool_analyze_pending_decls (void) } /* Optimization of function bodies might've rendered some variables as - unnecesary so we want to avoid these from being compiled. + unnecessary so we want to avoid these from being compiled. This is done by prunning the queue and keeping only the variables that - really appear needed (ie thery are either externally visible or referenced + really appear needed (ie they are either externally visible or referenced by compiled function). Re-doing the reachability analysis on variables brings back the remaining variables referenced by these. */ static void @@ -772,7 +772,7 @@ cgraph_finalize_compilation_unit (void) { struct cgraph_node *node; /* Keep track of already processed nodes when called multiple times for - intermodule optmization. */ + intermodule optimization. */ static struct cgraph_node *first_analyzed; finish_aliases_1 (); |