diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2006-03-04 23:05:24 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2006-03-04 23:05:24 +0000 |
| commit | 334ec2d868e3e9826b43a221aed0ce9316dce19d (patch) | |
| tree | 4350c209f16fe5635562cd7e6a9850c631419372 /gcc/df-core.c | |
| parent | 3b94331f5f97e6c371e4f1506691a849440836d8 (diff) | |
| download | gcc-334ec2d868e3e9826b43a221aed0ce9316dce19d.tar.gz | |
* builtins.c, c-pragma.h, c-typeck.c, cgraph.c, cgraphunit.c,
combine.c, common.opt, config/dfp-bit.c, config/i386/i386.c,
config/m68k/m68k.c, config/m68k/m68k.md, config/mt/mt.c,
config/mt/mt.h, config/s390/s390.md, df-core.c, df-problems.c,
df-scan.c, df.h, diagnostic.c, expr.c, function.h, gimplify.c,
loop-invariant.c, omp-low.c, opts.c, passes.c,
rtl-factoring.c, rtlanal.c, struct-equiv.c, tree-cfgcleanup.c,
tree-ssa-loop-niter.c, tree-ssa-loop-prefetch.c,
tree-ssa-structalias.c, tree-ssa-threadedge.c,
tree-ssa-threadupdate.c, tree-vect-patterns.c,
tree-vect-transform.c, tree-vectorizer.h, tree-vrp.c,
unwind-dw2.c: Fix comment typos. Follow spelling conventions.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@111721 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/df-core.c')
| -rw-r--r-- | gcc/df-core.c | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/gcc/df-core.c b/gcc/df-core.c index e9da8b626fa..06b108549e8 100644 --- a/gcc/df-core.c +++ b/gcc/df-core.c @@ -80,12 +80,12 @@ calls to add a problem for a given instance of df must occur before the first call to DF_RESCAN_BLOCKS or DF_ANALYZE. For all of the problems defined in df-problems.c, there are -convienence functions named DF_*_ADD_PROBLEM. +convenience functions named DF_*_ADD_PROBLEM. Problems can be dependent on other problems. For instance, solving def-use or use-def chains is dependant on solving reaching -definitions. As long as these dependancies are listed in the problem +definitions. As long as these dependencies are listed in the problem definition, the order of adding the problems is not material. Otherwise, the problems will be solved in the order of calls to df_add_problem. Note that it is not necessary to have a problem. In @@ -100,7 +100,7 @@ to analyze the entire function and no call to df_set_blocks is made. When a subset is given, the analysis behaves as if the function only contains those blocks and any edges that occur directly between the blocks in the set. Care should be taken to call df_set_blocks right -before the call to analyze in order to eliminate the possiblity that +before the call to analyze in order to eliminate the possibility that optimizations that reorder blocks invalidate the bitvector. @@ -220,7 +220,7 @@ There are 4 ways to obtain access to refs: register and are put there to keep the code from forgetting about them. - Artifical defs occur at the end of the entry block. These arise + Artificial defs occur at the end of the entry block. These arise from registers that are live at entry to the function. 2) All of the uses and defs associated with each pseudo or hard |