diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2002-12-25 15:15:10 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2002-12-25 15:15:10 +0000 |
| commit | d55d8fc700fd75c7efb3f1e11d1d303cde2dd4d9 (patch) | |
| tree | c9d2c0b2dd77109ef11a66cdf42b6e1a0fc4430e /gcc/predict.c | |
| parent | 7a770d8b104d6ce00bf9d56b22dc6428b969f1ba (diff) | |
| download | gcc-d55d8fc700fd75c7efb3f1e11d1d303cde2dd4d9.zip gcc-d55d8fc700fd75c7efb3f1e11d1d303cde2dd4d9.tar.gz gcc-d55d8fc700fd75c7efb3f1e11d1d303cde2dd4d9.tar.bz2 | |
output.h: Fix comment typos.
* output.h: Fix comment typos.
* predict.c: Likewise.
* print-tree.c: Likewise.
* profile.c: Likewise.
* ra-build.c: Likewise.
* ra-colorize.c: Likewise.
* ra-debug.c: Likewise.
* ra-rewrite.c: Likewise.
* ra.c: Likewise.
* ra.h: Likewise.
* real.c: Likewise.
* recog.c: Likewise.
* reg-stack.c: Likewise.
* regclass.c: Likewise.
From-SVN: r60502
Diffstat (limited to 'gcc/predict.c')
| -rw-r--r-- | gcc/predict.c | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/gcc/predict.c b/gcc/predict.c index feeaeac..3f3e2fc 100644 --- a/gcc/predict.c +++ b/gcc/predict.c @@ -113,7 +113,7 @@ static const struct predictor_info predictor_info[]= { #undef DEF_PREDICTOR /* Return true in case BB can be CPU intensive and should be optimized - for maximal perofmrance. */ + for maximal performance. */ bool maybe_hot_bb_p (bb) @@ -470,7 +470,7 @@ estimate_probability (loops_info) } /* Loop exit heuristics - predict an edge exiting the loop if the - conditinal has no loop header successors as not taken. */ + conditional has no loop header successors as not taken. */ if (!header_found) for (e = bb->succ; e; e = e->succ_next) if (e->dest->index < 0 @@ -565,7 +565,7 @@ estimate_probability (loops_info) case EQ: case UNEQ: /* Floating point comparisons appears to behave in a very - inpredictable way because of special role of = tests in + unpredictable way because of special role of = tests in FP code. */ if (FLOAT_MODE_P (GET_MODE (XEXP (cond, 0)))) ; @@ -581,7 +581,7 @@ estimate_probability (loops_info) case NE: case LTGT: /* Floating point comparisons appears to behave in a very - inpredictable way because of special role of = tests in + unpredictable way because of special role of = tests in FP code. */ if (FLOAT_MODE_P (GET_MODE (XEXP (cond, 0)))) ; @@ -801,7 +801,7 @@ process_note_predictions (bb, heads, dominators, post_dominators) rtx insn; edge e; - /* Additionaly, we check here for blocks with no successors. */ + /* Additionally, we check here for blocks with no successors. */ int contained_noreturn_call = 0; int was_bb_head = 0; int noreturn_block = 1; @@ -1091,7 +1091,7 @@ counts_to_freqs () /* Return true if function is likely to be expensive, so there is no point to optimize performance of prologue, epilogue or do inlining at the expense - of code size growth. THRESHOLD is the limit of number of isntructions + of code size growth. THRESHOLD is the limit of number of instructions function can execute at average to be still considered not expensive. */ bool |