summaryrefslogtreecommitdiff
path: root/gcc/cgraphunit.c
diff options
context:
space:
mode:
authorKazu Hirata <kazu@cs.umass.edu>2003-07-01 12:18:01 +0000
committerKazu Hirata <kazu@gcc.gnu.org>2003-07-01 12:18:01 +0000
commite0bb17a83f613106571d3b516168d12cf83b10be (patch)
tree2e247fb1aad8f72881cfd082e69ebe412ba7989f /gcc/cgraphunit.c
parent0d0a1710d97a7eff97667caa55f83cc7bbe948de (diff)
downloadgcc-e0bb17a83f613106571d3b516168d12cf83b10be.tar.gz
basic-block.h: Fix comment typos.
* basic-block.h: Fix comment typos. * bb-reorder.c: Likewise. * c-format.c: Likewise. * cfgcleanup.c: Likewise. * cfghooks.h: Likewise. * cfgloop.c: Likewise. * cfgloopmanip.c: Likewise. * cfgrtl.c: Likewise. * cgraph.h: Likewise. * cgraphunit.c: Likewise. * combine.c: Likewise. * convert.c: Likewise. * dbxout.c: Likewise. * df.c: Likewise. * df.h: Likewise. * diagnostic.c: Likewise. * dwarf2out.c: Likewise. * et-forest.h: Likewise. * flow.c: Likewise. * fold-const.c: Likewise. * function.h: Likewise. * gcov-io.h: Likewise. * gcov.c: Likewise. * gcse.c: Likewise. * genautomata.c: Likewise. * ggc-common.c: Likewise. * ggc-page.c: Likewise. * loop-unroll.c: Likewise. * loop-unswitch.c: Likewise. * loop.c: Likewise. * mips-tfile.c: Likewise. * optabs.c: Likewise. * ra-build.c: Likewise. * ra-colorize.c: Likewise. * ra-rewrite.c: Likewise. * ra.h: Likewise. * regmove.c: Likewise. * reload.c: Likewise. * rtlanal.c: Likewise. * sched-ebb.c: Likewise. * sched-int.h: Likewise. * sched-vis.c: Likewise. * sreal.c: Likewise. * ssa-ccp.c: Likewise. * ssa.c: Likewise. * toplev.c: Likewise. * tree-inline.c: Likewise. * value-prof.c: Likewise. * value-prof.h: Likewise. From-SVN: r68770
Diffstat (limited to 'gcc/cgraphunit.c')
-rw-r--r--gcc/cgraphunit.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index 47390b970c4..e7023a4014b 100644
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -44,7 +44,7 @@ static void cgraph_mark_functions_to_inline_once PARAMS ((void));
static void cgraph_optimize_function PARAMS ((struct cgraph_node *));
/* Analyze function once it is parsed. Set up the local information
- available - create cgraph edges for function calles via BODY. */
+ available - create cgraph edges for function calls via BODY. */
void
cgraph_finalize_function (decl, body)
@@ -57,7 +57,7 @@ cgraph_finalize_function (decl, body)
if (/* Externally visible functions must be output. The exception are
COMDAT functions that must be output only when they are needed.
- Similarly are handled defered functions and
+ Similarly are handled deferred functions and
external functions (GCC extension "extern inline") */
(TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_EXTERNAL (decl))
/* ??? Constructors and destructors not called otherwise can be inlined
@@ -294,7 +294,7 @@ cgraph_expand_function (node)
Attempt to topologically sort the nodes so function is output when
all called functions are already assembled to allow data to be
- propagated accross the callgraph. Use a stack to get smaller distance
+ propagated across the callgraph. Use a stack to get smaller distance
between a function and it's callees (later we may choose to use a more
sophisticated algorithm for function reordering; we will likely want
to use subsections to make the output functions appear in top-down