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/rtl-factoring.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/rtl-factoring.c')
| -rw-r--r-- | gcc/rtl-factoring.c | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/gcc/rtl-factoring.c b/gcc/rtl-factoring.c index 0cd1aaa4dbb..021a802a4d7 100644 --- a/gcc/rtl-factoring.c +++ b/gcc/rtl-factoring.c @@ -125,7 +125,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA TODO: - Use REG_ALLOC_ORDER when choosing link register. - Handle JUMP_INSNs. Also handle volatile function calls (handle them - simmilar to unconditional jumps.) + similar to unconditional jumps.) - Test command line option -fpic. */ @@ -227,7 +227,7 @@ typedef struct seq_block_def struct seq_block_def *next_seq_block; } *seq_block; -/* Contains same sequence candidates for futher searching. */ +/* Contains same sequence candidates for further searching. */ typedef struct hash_bucket_def { /* The hash value of the group. */ @@ -888,7 +888,7 @@ determine_seq_blocks (void) } /* Ensure that SB contains a seq_block with the appropriate length. - Insert a new seq_block if neccessary. */ + Insert a new seq_block if necessary. */ if (!seq_blocks || ((*mseq)->abstracted_length < seq_blocks->length)) { sb = (seq_block) xmalloc (sizeof (struct seq_block_def)); @@ -979,7 +979,7 @@ split_blocks_after_seqs (void) } } -/* Splits the best pattern sequence accoring to SEQ_BLOCKS. Emits pseudo-call +/* Splits the best pattern sequence according to SEQ_BLOCKS. Emits pseudo-call and -return insns before and after the sequence. */ static void @@ -1373,7 +1373,7 @@ rtl_seqabstr (void) /* Iterate until there are no sequences to abstract. */ for (iter = 1;; iter++) { - /* Recompute gain for sequences if neccessary and select sequence with + /* Recompute gain for sequences if necessary and select sequence with biggest gain. */ recompute_gain (); if (!pattern_seqs) |