Commit 75c40d56 by Kazu Hirata Committed by Kazu Hirata

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

	* cfgcleanup.c, config/dfp-bit.c, expr.c, fold-const.c,
	jump.c, mips-tfile.c, omp-low.c, sched-int.h,
	tree-ssa-loop-prefetch.c, tree-vrp.c: Fix comment typos.

From-SVN: r112971
parent 8370f6fa
2006-04-15 Kazu Hirata <kazu@codesourcery.com>
* cfgcleanup.c, config/dfp-bit.c, expr.c, fold-const.c,
jump.c, mips-tfile.c, omp-low.c, sched-int.h,
tree-ssa-loop-prefetch.c, tree-vrp.c: Fix comment typos.
2006-04-15 John David Anglin <dave.anglin@nrc-cnrc.gc.ca> 2006-04-15 John David Anglin <dave.anglin@nrc-cnrc.gc.ca>
* pa.md (output_bb patterns): Shorten long branch alternatives by 4. * pa.md (output_bb patterns): Shorten long branch alternatives by 4.
......
...@@ -1667,7 +1667,7 @@ try_crossjump_to_edge (int mode, edge e1, edge e2) ...@@ -1667,7 +1667,7 @@ try_crossjump_to_edge (int mode, edge e1, edge e2)
&& (newpos1 != BB_HEAD (src1))) && (newpos1 != BB_HEAD (src1)))
return false; return false;
/* Avoid deleting preserve label when redirecting ABNORMAL edeges. */ /* Avoid deleting preserve label when redirecting ABNORMAL edges. */
if (block_has_preserve_label (e1->dest) if (block_has_preserve_label (e1->dest)
&& (e1->flags & EDGE_ABNORMAL)) && (e1->flags & EDGE_ABNORMAL))
return false; return false;
......
...@@ -411,7 +411,7 @@ DFP_TO_INT (DFP_C_TYPE x) ...@@ -411,7 +411,7 @@ DFP_TO_INT (DFP_C_TYPE x)
TO_INTERNAL (&s, &n1); TO_INTERNAL (&s, &n1);
/* Rescale if the exponent is less than zero. */ /* Rescale if the exponent is less than zero. */
decNumberToIntegralValue (&n2, &n1, &context); decNumberToIntegralValue (&n2, &n1, &context);
/* Get a value to use for the quanitize call. */ /* Get a value to use for the quantize call. */
decNumberFromString (&qval, (char *) "1.0", &context); decNumberFromString (&qval, (char *) "1.0", &context);
/* Force the exponent to zero. */ /* Force the exponent to zero. */
decNumberQuantize (&n1, &n2, &qval, &context); decNumberQuantize (&n1, &n2, &qval, &context);
......
...@@ -7717,7 +7717,7 @@ expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode, ...@@ -7717,7 +7717,7 @@ expand_expr_real_1 (tree exp, rtx target, enum machine_mode tmode,
else if (!MEM_P (op0)) else if (!MEM_P (op0))
{ {
/* If the operand is not a MEM, force it into memory. Since we /* If the operand is not a MEM, force it into memory. Since we
are going to be be changing the mode of the MEM, don't call are going to be changing the mode of the MEM, don't call
force_const_mem for constants because we don't allow pool force_const_mem for constants because we don't allow pool
constants to change mode. */ constants to change mode. */
tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0)); tree inner_type = TREE_TYPE (TREE_OPERAND (exp, 0));
......
...@@ -7097,7 +7097,7 @@ native_interpret_vector (tree type, unsigned char *ptr, int len) ...@@ -7097,7 +7097,7 @@ native_interpret_vector (tree type, unsigned char *ptr, int len)
} }
/* Subroutine of fold_view_convert_expr. Interpet the contents of /* Subroutine of fold_view_convert_expr. Interpret the contents of
the buffer PTR of length LEN as a constant of type TYPE. For the buffer PTR of length LEN as a constant of type TYPE. For
INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P INTEGRAL_TYPE_P we return an INTEGER_CST, for SCALAR_FLOAT_TYPE_P
we return a REAL_CST, etc... If the buffer cannot be interpreted, we return a REAL_CST, etc... If the buffer cannot be interpreted,
......
...@@ -21,7 +21,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA ...@@ -21,7 +21,7 @@ Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA. */ 02110-1301, USA. */
/* This is the pathetic reminder of old fame of the jump-optimization pass /* This is the pathetic reminder of old fame of the jump-optimization pass
of the compiler. Now it contains basically set of utility function to of the compiler. Now it contains basically a set of utility functions to
operate with jumps. operate with jumps.
Each CODE_LABEL has a count of the times it is used Each CODE_LABEL has a count of the times it is used
......
...@@ -4363,7 +4363,7 @@ copy_object (void) ...@@ -4363,7 +4363,7 @@ copy_object (void)
/* Read in each of the sections if they exist in the object file. /* Read in each of the sections if they exist in the object file.
We read things in in the order the mips assembler creates the We read things in the order the mips assembler creates the
sections, so in theory no extra seeks are done. sections, so in theory no extra seeks are done.
For simplicity sake, round each read up to a page boundary, For simplicity sake, round each read up to a page boundary,
......
...@@ -2233,10 +2233,10 @@ remove_exit_barrier (struct omp_region *region) ...@@ -2233,10 +2233,10 @@ remove_exit_barrier (struct omp_region *region)
exit_bb = region->exit; exit_bb = region->exit;
/* The last insn in the block will be the parallel's OMP_RETURN. The /* The last insn in the block will be the parallel's OMP_RETURN. The
workshare's OMP_RETURN will be in a preceeding block. The kinds of workshare's OMP_RETURN will be in a preceding block. The kinds of
statements that can appear in between are extremely limited -- no statements that can appear in between are extremely limited -- no
memory operations at all. Here, we allow nothing at all, so the memory operations at all. Here, we allow nothing at all, so the
only thing we allow to preceed this OMP_RETURN is a label. */ only thing we allow to precede this OMP_RETURN is a label. */
si = bsi_last (exit_bb); si = bsi_last (exit_bb);
gcc_assert (TREE_CODE (bsi_stmt (si)) == OMP_RETURN); gcc_assert (TREE_CODE (bsi_stmt (si)) == OMP_RETURN);
bsi_prev (&si); bsi_prev (&si);
......
...@@ -437,7 +437,7 @@ enum SPEC_TYPES_OFFSETS { ...@@ -437,7 +437,7 @@ enum SPEC_TYPES_OFFSETS {
/* This dependence is to the instruction in the recovery block, that was /* This dependence is to the instruction in the recovery block, that was
formed to recover after control-speculation failure. formed to recover after control-speculation failure.
Thus, this dependence can be be overcome with generating of the copy of Thus, this dependence can be overcome with generating of the copy of
this instruction in the recovery block. */ this instruction in the recovery block. */
#define BE_IN_CONTROL (((ds_t) DEP_WEAK_MASK) << BE_IN_CONTROL_BITS_OFFSET) #define BE_IN_CONTROL (((ds_t) DEP_WEAK_MASK) << BE_IN_CONTROL_BITS_OFFSET)
......
...@@ -204,7 +204,7 @@ struct mem_ref ...@@ -204,7 +204,7 @@ struct mem_ref
struct mem_ref *next; /* The next reference in the group. */ struct mem_ref *next; /* The next reference in the group. */
}; };
/* Dumps information obout reference REF to FILE. */ /* Dumps information about reference REF to FILE. */
static void static void
dump_mem_ref (FILE *file, struct mem_ref *ref) dump_mem_ref (FILE *file, struct mem_ref *ref)
......
...@@ -1703,7 +1703,7 @@ extract_range_from_unary_expr (value_range_t *vr, tree expr) ...@@ -1703,7 +1703,7 @@ extract_range_from_unary_expr (value_range_t *vr, tree expr)
new_max = fold_convert (outer_type, orig_max); new_max = fold_convert (outer_type, orig_max);
/* Verify the new min/max values are gimple values and /* Verify the new min/max values are gimple values and
that they compare equal to the orignal input's that they compare equal to the original input's
min/max values. */ min/max values. */
if (is_gimple_val (new_min) if (is_gimple_val (new_min)
&& is_gimple_val (new_max) && is_gimple_val (new_max)
......
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