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/cgraph.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/cgraph.c')
| -rw-r--r-- | gcc/cgraph.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/gcc/cgraph.c b/gcc/cgraph.c index 0766a5d..c1e66f93 100644 --- a/gcc/cgraph.c +++ b/gcc/cgraph.c @@ -50,9 +50,9 @@ The callgraph: Intraprocedural information: Callgraph is place to store data needed for intraprocedural optimization. - All datastructures are divided into three components: local_info that + All data structures are divided into three components: local_info that is produced while analyzing the function, global_info that is result - of global walkking of the callgraph on the end of compilation and + of global walking of the callgraph on the end of compilation and rtl_info used by RTL backend to propagate data from already compiled functions to their callers. @@ -60,11 +60,11 @@ The callgraph: The function inlining information is decided in advance and maintained in the callgraph as so called inline plan. - For each inlined call, the calle's node is clonned to represent the + For each inlined call, the callee's node is cloned to represent the new function copy produced by inlininer. - Each inlined call gets unque corresponding clone node of the callee - and the datastructure is updated while inlining is performed, so - the clones are elliminated and their callee edges redirected to the + Each inlined call gets a unique corresponding clone node of the callee + and the data structure is updated while inlining is performed, so + the clones are eliminated and their callee edges redirected to the caller. Each edge has "inline_failed" field. When the field is set to NULL, @@ -100,7 +100,7 @@ The varpool data structure: static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash; /* We destructively update callgraph during inlining and thus we need to - keep information on whether inlining happend separately. */ + keep information on whether inlining happened separately. */ htab_t cgraph_inline_hash; /* The linked list of cgraph nodes. */ @@ -152,7 +152,7 @@ eq_node (const void *p1, const void *p2) (tree) p2); } -/* Allocate new callgraph node and insert it into basic datastructures. */ +/* Allocate new callgraph node and insert it into basic data structures. */ static struct cgraph_node * cgraph_create_node (void) { |