diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2004-04-29 15:39:12 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@cs.umass.edu> | 2004-04-29 15:39:12 +0000 |
| commit | 15638bc8f28d5df96767e53f59397500a9614b62 (patch) | |
| tree | 6c0fb333200e6a04c7e72f1b30ce293bef0d3d4c /gcc/cgraph.c | |
| parent | 7739a2288375e8bca862e745602a352441b49462 (diff) | |
* builtins.c, cgraph.c, cgraphunit.c, final.c, fold-const.c:
Fix comment typos.
git-svn-id: https://gcc.gnu.org/svn/gcc/trunk@81291 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/cgraph.c')
| -rw-r--r-- | gcc/cgraph.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/cgraph.c b/gcc/cgraph.c index 04049df6bf5..0766a5dcb6b 100644 --- a/gcc/cgraph.c +++ b/gcc/cgraph.c @@ -68,8 +68,8 @@ The callgraph: caller. Each edge has "inline_failed" field. When the field is set to NULL, - the call will be inlined. When it is non-NULL it contains an reason - why inlining wasn't performaned. + the call will be inlined. When it is non-NULL it contains a reason + why inlining wasn't performed. The varpool data structure: @@ -99,8 +99,8 @@ The varpool data structure: /* Hash table used to convert declarations into nodes. */ static GTY((param_is (struct cgraph_node))) htab_t cgraph_hash; -/* We destructivly update callgraph during inlining and thus we need to - keep information on whether inlining happent separately. */ +/* We destructively update callgraph during inlining and thus we need to + keep information on whether inlining happend separately. */ htab_t cgraph_inline_hash; /* The linked list of cgraph nodes. */ @@ -209,7 +209,7 @@ cgraph_edge (struct cgraph_node *node, tree call_expr) /* This loop may turn out to be performance problem. In such case adding hashtables into call nodes with very many edges is probably best - sollution. It is not good idea to add pointer into CALL_EXPR itself + solution. It is not good idea to add pointer into CALL_EXPR itself because we want to make possible having multiple cgraph nodes representing different clones of the same body before the body is actually cloned. */ for (e = node->callees; e; e= e->next_callee) |