diff options
| author | Nathan Froyd <froydnj@codesourcery.com> | 2011-02-11 15:16:46 +0000 |
|---|---|---|
| committer | Nathan Froyd <froydnj@gcc.gnu.org> | 2011-02-11 15:16:46 +0000 |
| commit | 61502ca83754695ad954c8872379ae566f8e21e9 (patch) | |
| tree | fb74d6c5685edc7c6aad61bcc6ec5436740ac374 /gcc/ipa-inline.c | |
| parent | d50c5e0c692b85447c059144c5ccff0f67c07854 (diff) | |
| download | gcc-61502ca83754695ad954c8872379ae566f8e21e9.tar.gz | |
cgraph.c: Fix comment typos.
* cgraph.c: Fix comment typos.
* cgraph.h: Likewise.
* cgraphunit.c: Likewise.
* ipa-cp.c: Likewise.
* ipa-inline.c: Likewise.
* ipa-prop.c: Likewise.
* ipa-pure-const.c: Likewise.
* ipa-ref.c: Likewise.
* ipa-reference.c: Likewise.
From-SVN: r170052
Diffstat (limited to 'gcc/ipa-inline.c')
| -rw-r--r-- | gcc/ipa-inline.c | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/gcc/ipa-inline.c b/gcc/ipa-inline.c index 1d5b001233a..d611d11fe20 100644 --- a/gcc/ipa-inline.c +++ b/gcc/ipa-inline.c @@ -333,7 +333,7 @@ cgraph_mark_inline_edge (struct cgraph_edge *e, bool update_original, ncalls_inlined++; /* FIXME: We should remove the optimize check after we ensure we never run - IPA passes when not optimizng. */ + IPA passes when not optimizing. */ if (flag_indirect_inlining && optimize) return ipa_propagate_indirect_call_infos (curr, new_edges); else @@ -528,7 +528,7 @@ cgraph_edge_badness (struct cgraph_edge *edge, bool dump) if (dump) { - fprintf (dump_file, " Badness calculcation for %s -> %s\n", + fprintf (dump_file, " Badness calculation for %s -> %s\n", cgraph_node_name (edge->caller), cgraph_node_name (edge->callee)); fprintf (dump_file, " growth %i, time %i-%i, size %i-%i\n", @@ -653,7 +653,7 @@ update_edge_key (fibheap_t heap, struct cgraph_edge *edge) /* fibheap_replace_key only decrease the keys. When we increase the key we do not update heap and instead re-insert the element once it becomes - a minium of heap. */ + a minimum of heap. */ if (badness < n->key) { fibheap_replace_key (heap, n, badness); @@ -1006,7 +1006,7 @@ add_new_edges_to_heap (fibheap_t heap, VEC (cgraph_edge_p, heap) *new_edges) All inline candidates are put into prioritized heap based on estimated growth of the overall number of instructions and then update the estimates. - INLINED and INLINED_CALEES are just pointers to arrays large enough + INLINED and INLINED_CALLEES are just pointers to arrays large enough to be passed to cgraph_inlined_into and cgraph_inlined_callees. */ static void @@ -1118,7 +1118,7 @@ cgraph_decide_inlining_of_small_functions (void) ??? When the frequencies are taken into account we might not need this restriction. - We need to be cureful here, in some testcases, e.g. directivec.c in + We need to be careful here, in some testcases, e.g. directives.c in libcpp, we can estimate self recursive function to have negative growth for inlining completely. */ @@ -1815,7 +1815,7 @@ struct gimple_opt_pass pass_early_inline = 0 - means not eliminated 1 - half of statements goes away 2 - for sure it is eliminated. - We are not terribly sophisficated, basically looking for simple abstraction + We are not terribly sophisticated, basically looking for simple abstraction penalty wrappers. */ static int @@ -1999,7 +1999,7 @@ compute_inline_parameters (struct cgraph_node *node) { struct cgraph_edge *e; - /* Functions calling builtlin_apply can not change signature. */ + /* Functions calling builtin_apply can not change signature. */ for (e = node->callees; e; e = e->next_callee) if (DECL_BUILT_IN (e->callee->decl) && DECL_BUILT_IN_CLASS (e->callee->decl) == BUILT_IN_NORMAL @@ -2046,7 +2046,7 @@ struct gimple_opt_pass pass_inline_parameters = } }; -/* This function performs intraprocedural analyzis in NODE that is required to +/* This function performs intraprocedural analysis in NODE that is required to inline indirect calls. */ static void inline_indirect_intraprocedural_analysis (struct cgraph_node *node) @@ -2068,7 +2068,7 @@ analyze_function (struct cgraph_node *node) compute_inline_parameters (node); /* FIXME: We should remove the optimize check after we ensure we never run - IPA passes when not optimizng. */ + IPA passes when not optimizing. */ if (flag_indirect_inlining && optimize) inline_indirect_intraprocedural_analysis (node); @@ -2114,7 +2114,7 @@ inline_transform (struct cgraph_node *node) struct cgraph_edge *e; bool inline_p = false; - /* FIXME: Currently the passmanager is adding inline transform more than once to some + /* FIXME: Currently the pass manager is adding inline transform more than once to some clones. This needs revisiting after WPA cleanups. */ if (cfun->after_inlining) return 0; |