+2004-02-27 Kazu Hirata <kazu@cs.umass.edu>
+
+ * c-decl.c, c-ppoutput.c, combine.c, cppfiles.c, dwarf2out.c,
+ expr.c, fold-const.c, gcc.c, haifa-sched.c, loop-iv.c,
+ params.def, read-rtl.c, rtl.c, rtlanal.c, toplev.c: Fix
+ comment typos and formatting. Follow spelling conventions.
+
2004-02-26 Aldy Hernandez <aldyh@redhat.com>
* config/rs6000/rs6000.md: Add fixuns_truncsfsi2 and
&& DECL_NAME (p)
&& !DECL_ARTIFICIAL (p))
warning ("%Junused variable `%D'", p, p);
- /* fall through */
+ /* Fall through. */
default:
normal:
if (TREE_CODE (newdecl) == TYPE_DECL)
{
if (DECL_IN_SYSTEM_HEADER (newdecl) || DECL_IN_SYSTEM_HEADER (olddecl))
- return true; /* allow OLDDECL to continue in use */
+ return true; /* Allow OLDDECL to continue in use. */
error ("%Jredefinition of typedef '%D'", newdecl, newdecl);
locate_old_decl (olddecl, error);
const cpp_token *source; /* Source token for spacing. */
int src_line; /* Line number currently being written. */
unsigned char printed; /* Nonzero if something output at line. */
- bool first_time; /* pp_file_change hasn't been called yet. */
+ bool first_time; /* pp_file_change hasn't been called yet. */
} print;
/* General output routines. */
int added_sets_1, added_sets_2;
/* Total number of SETs to put into I3. */
int total_sets;
- /* Nonzero is I2's body now appears in I3. */
+ /* Nonzero if I2's body now appears in I3. */
int i2_is_used;
/* INSN_CODEs for new I3, new I2, and user of condition code. */
int insn_code_number, i2_code_number = 0, other_code_number = 0;
/* If BUFFER above contains the true contents of the file. */
bool buffer_valid;
- /* File is a PCH (on return from find_include_file). */
+ /* File is a PCH (on return from find_include_file). */
bool pch;
};
|| (bound_attr == DW_AT_lower_bound
&& (((is_c_family () || is_java ()) && integer_zerop (bound))
|| (is_fortran () && integer_onep (bound)))))
- /* use the default */
+ /* Use the default. */
;
else
add_AT_unsigned (subrange_die, bound_attr, tree_low_cst (bound, 0));
(*targetm.asm_out.internal_label) (asm_out_file, SEPARATE_LINE_CODE_LABEL,
separate_line_info_table_in_use);
- /* expand the line info table if necessary */
+ /* Expand the line info table if necessary. */
if (separate_line_info_table_in_use
== separate_line_info_table_allocated)
{
if (to_mode == full_mode)
return;
- /* else proceed to integer conversions below */
+ /* else proceed to integer conversions below. */
from_mode = full_mode;
}
if (quo_neg)
neg_double (*lquo, *hquo, lquo, hquo);
- /* compute trial remainder: rem = num - (quo * den) */
+ /* Compute trial remainder: rem = num - (quo * den) */
mul_double (*lquo, *hquo, lden_orig, hden_orig, lrem, hrem);
neg_double (*lrem, *hrem, lrem, hrem);
add_double (lnum_orig, hnum_orig, *lrem, *hrem, lrem, hrem);
}
#if defined (OS2) ||defined (HAVE_DOS_BASED_FILE_SYSTEM)
- /* look again, but case-insensitively this time. */
+ /* Look again, but case-insensitively this time. */
if (cp < compilers)
for (cp = compilers + n_compilers - 1; cp >= compilers; cp--)
{
insns_removed++;
if (insns_removed == flag_sched_stalled_insns)
- /* remove only one insn from Q at a time */
+ /* Remove only one insn from Q at a time. */
return insns_removed;
}
}
interesting reg, it is now easy to find a reaching definition (there may be
only one).
- Induction variable is then simply analysed by walking the use-def
+ Induction variable is then simply analyzed by walking the use-def
chains.
Usage:
enum machine_mode mode;
rtx arg;
- /* Extend the constant to extend_mode of the other operand if neccesary. */
+ /* Extend the constant to extend_mode of the other operand if necessary. */
if (iv0->extend == NIL
&& iv0->mode == iv0->extend_mode
&& iv0->step == const0_rtx
return iv->base != NULL_RTX;
}
-/* Analyses operand OP of INSN and stores the result to *IV. */
+/* Analyzes operand OP of INSN and stores the result to *IV. */
static bool
iv_analyze_op (rtx insn, rtx op, struct rtx_iv *iv)
return iv_analyze (def_insn, op, iv);
}
-/* Analyses iv DEF defined in INSN and stores the result to *IV. */
+/* Analyzes iv DEF defined in INSN and stores the result to *IV. */
bool
iv_analyze (rtx insn, rtx def, struct rtx_iv *iv)
}
/* Transforms IV0 and IV1 compared by COND so that they are both compared as
- subregs of the same mode if possible (sometimes it is neccesary to add
+ subregs of the same mode if possible (sometimes it is necessary to add
some assumptions to DESC). */
static bool
obviously if the test for overflow during that transformation
passed, we cannot overflow here. Most importantly any
loop with sharp end condition and step 1 falls into this
- cathegory, so handling this case specially is definitely
+ category, so handling this case specially is definitely
worth the troubles. */
may_xform = const_true_rtx;
}
This limit should be at most half of the peeling limits: loop unroller
decides to not unroll loops that iterate fewer than 2*number of allowed
- unrollings and thus we would have loops that are neither peeled or unrooled
+ unrollings and thus we would have loops that are neither peeled or unrolled
otherwise. */
DEFPARAM(PARAM_MAX_UNROLLED_INSNS,
"max-unrolled-insns",
if (c != '[')
fatal_expected_char (infile, '[', c);
- /* add expressions to a list, while keeping a count */
+ /* Add expressions to a list, while keeping a count. */
obstack_init (&vector_stack);
while ((c = read_skip_spaces (infile)) && c != ']')
{
rtvec rt;
rt = ggc_alloc_rtvec (n);
- /* clear out the vector */
+ /* Clear out the vector. */
memset (&rt->elem[0], 0, n * sizeof (rtx));
PUT_NUM_ELEM (rt, n);
nregs_xmode = hard_regno_nregs[xregno][xmode];
nregs_ymode = hard_regno_nregs[xregno][ymode];
- /* paradoxical subregs are always valid. */
+ /* Paradoxical subregs are always valid. */
if (offset == 0
&& nregs_ymode > nregs_xmode
&& (GET_MODE_SIZE (ymode) > UNITS_PER_WORD
int flag_gcse_sm = 1;
-/* Nonzero if we want to perfrom redundant load after store elimination
+/* Nonzero if we want to perform redundant load after store elimination
in gcse. */
int flag_gcse_las = 1;