Commit f6fe65dc by Kazu Hirata Committed by Kazu Hirata

ifcvt.c, [...]: Fix comment typos.

	* ifcvt.c, modulo-sched.c, tree-alias-common.c, tree-sra.c,
	tree-ssa-copy.c, tree-ssa-dom.c, tree-ssa-pre.c: Fix comment
	typos.

From-SVN: r84008
parent f16ee2a0
2004-07-02 Kazu Hirata <kazu@cs.umass.edu>
* ifcvt.c, modulo-sched.c, tree-alias-common.c, tree-sra.c,
tree-ssa-copy.c, tree-ssa-dom.c, tree-ssa-pre.c: Fix comment
typos.
2004-07-02 Aaron W. LaFramboise <aaronraolete36@aaronwl.com> 2004-07-02 Aaron W. LaFramboise <aaronraolete36@aaronwl.com>
* gcc.c (STANDARD_STARTFILE_PREFIX_1): Define. * gcc.c (STANDARD_STARTFILE_PREFIX_1): Define.
......
...@@ -699,7 +699,7 @@ end_ifcvt_sequence (struct noce_if_info *if_info) ...@@ -699,7 +699,7 @@ end_ifcvt_sequence (struct noce_if_info *if_info)
/* Make sure that all of the instructions emitted are recognizable, /* Make sure that all of the instructions emitted are recognizable,
and that we haven't introduced a new jump instruction. and that we haven't introduced a new jump instruction.
As an excersise for the reader, build a general mechanism that As an exercise for the reader, build a general mechanism that
allows proper placement of required clobbers. */ allows proper placement of required clobbers. */
for (insn = seq; insn; insn = NEXT_INSN (insn)) for (insn = seq; insn; insn = NEXT_INSN (insn))
if (GET_CODE (insn) == JUMP_INSN if (GET_CODE (insn) == JUMP_INSN
......
...@@ -77,7 +77,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA ...@@ -77,7 +77,7 @@ Software Foundation, 59 Temple Place - Suite 330, Boston, MA
here the insns are not scheduled monotonically top-down (nor bottom- here the insns are not scheduled monotonically top-down (nor bottom-
up). up).
3. If failed in scheduling all insns - bump II++ and try again, unless 3. If failed in scheduling all insns - bump II++ and try again, unless
II reaches an upper bound MaxII, inwhich case report failure. II reaches an upper bound MaxII, in which case report failure.
5. If we succeeded in scheduling the loop within II cycles, we now 5. If we succeeded in scheduling the loop within II cycles, we now
generate prolog and epilog, decrease the counter of the loop, and generate prolog and epilog, decrease the counter of the loop, and
perform modulo variable expansion for live ranges that span more than perform modulo variable expansion for live ranges that span more than
...@@ -443,7 +443,7 @@ calculate_maxii (ddg_ptr g) ...@@ -443,7 +443,7 @@ calculate_maxii (ddg_ptr g)
} }
/* Given the partial schdule, generate register moves when the length /* Given the partial schedule, generate register moves when the length
of the register live range is more than ii; the number of moves is of the register live range is more than ii; the number of moves is
determined according to the following equation: determined according to the following equation:
SCHED_TIME (use) - SCHED_TIME (def) { 1 broken loop-carried SCHED_TIME (use) - SCHED_TIME (def) { 1 broken loop-carried
......
...@@ -533,7 +533,7 @@ find_func_aliases (tree stp) ...@@ -533,7 +533,7 @@ find_func_aliases (tree stp)
else if (TREE_CODE (op1) == CALL_EXPR) else if (TREE_CODE (op1) == CALL_EXPR)
{ {
/* Heap assignment. These are __attribute__ malloc or /* Heap assignment. These are __attribute__ malloc or
something, i'll deal with it later. */ something, I'll deal with it later. */
if (0) if (0)
{} {}
else else
......
...@@ -1630,7 +1630,7 @@ sra_replace (block_stmt_iterator *bsi, tree list) ...@@ -1630,7 +1630,7 @@ sra_replace (block_stmt_iterator *bsi, tree list)
} }
/* Scalarize a USE. To recap, this is either a simple reference to ELT, /* Scalarize a USE. To recap, this is either a simple reference to ELT,
if elt is scalar, or some ocurrence of ELT that requires a complete if elt is scalar, or some occurrence of ELT that requires a complete
aggregate. IS_OUTPUT is true if ELT is being modified. */ aggregate. IS_OUTPUT is true if ELT is being modified. */
static void static void
......
...@@ -56,7 +56,7 @@ Boston, MA 02111-1307, USA. */ ...@@ -56,7 +56,7 @@ Boston, MA 02111-1307, USA. */
/* Given two SSA_NAMEs, replace the annotations for the one referred to by OP /* Given two SSA_NAMEs, replace the annotations for the one referred to by OP
with VAR's annmoptations. with VAR's annotations.
If OP is a pointer, copy the memory tag used originally by OP into If OP is a pointer, copy the memory tag used originally by OP into
VAR. This is needed in cases where VAR had never been dereferenced in the VAR. This is needed in cases where VAR had never been dereferenced in the
......
...@@ -96,7 +96,7 @@ static bitmap nonzero_vars; ...@@ -96,7 +96,7 @@ static bitmap nonzero_vars;
static bool cfg_altered; static bool cfg_altered;
/* Bitmap of blocks that have had EH statements cleaned. We should /* Bitmap of blocks that have had EH statements cleaned. We should
remove thier dead edges eventually. */ remove their dead edges eventually. */
static bitmap need_eh_cleanup; static bitmap need_eh_cleanup;
/* Statistics for dominator optimizations. */ /* Statistics for dominator optimizations. */
......
...@@ -234,7 +234,7 @@ typedef struct bb_value_sets ...@@ -234,7 +234,7 @@ typedef struct bb_value_sets
basic block. */ basic block. */
value_set_t phi_gen; value_set_t phi_gen;
/* The TMP_GEN set, which represents results/temporaries genererated /* The TMP_GEN set, which represents results/temporaries generated
in a basic block. IE the LHS of an expression. */ in a basic block. IE the LHS of an expression. */
value_set_t tmp_gen; value_set_t tmp_gen;
...@@ -1499,7 +1499,7 @@ add_to_sets (tree var, tree expr, vuse_optype vuses, value_set_t s1, ...@@ -1499,7 +1499,7 @@ add_to_sets (tree var, tree expr, vuse_optype vuses, value_set_t s1,
/* Given a unary or binary expression EXPR, create and return a new /* Given a unary or binary expression EXPR, create and return a new
expresion with the same structure as EXPR but with its operands expression with the same structure as EXPR but with its operands
replaced with the value handles of each of the operands of EXPR. replaced with the value handles of each of the operands of EXPR.
Insert EXPR's operands into the EXP_GEN set for BLOCK. Insert EXPR's operands into the EXP_GEN set for BLOCK.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment