c-decl.c: Fix comment formatting.

* c-decl.c: Fix comment formatting.
	* cfgrtl.c: Likewise.
	* combine.c: Likewise.
	* convert.c: Likewise.
	* dominance.c: Likewise.
	* dwarf2out.c: Likewise.
	* dwarfout.c: Likewise.
	* expmed.c: Likewise.
	* fold-const.c: Likewise.
	* gcov.c: Likewise.
	* genattrtab.c: Likewise.
	* ggc-common.c: Likewise.
	* mips-tfile.c: Likewise.
	* regmove.c: Likewise.

From-SVN: r70677
This commit is contained in:
Kazu Hirata 2003-08-22 06:45:14 +00:00 committed by Kazu Hirata
parent 2b72593e40
commit beb235f896
15 changed files with 36 additions and 19 deletions

View File

@ -1,3 +1,20 @@
2003-08-22 Kazu Hirata <kazu@cs.umass.edu>
* c-decl.c: Fix comment formatting.
* cfgrtl.c: Likewise.
* combine.c: Likewise.
* convert.c: Likewise.
* dominance.c: Likewise.
* dwarf2out.c: Likewise.
* dwarfout.c: Likewise.
* expmed.c: Likewise.
* fold-const.c: Likewise.
* gcov.c: Likewise.
* genattrtab.c: Likewise.
* ggc-common.c: Likewise.
* mips-tfile.c: Likewise.
* regmove.c: Likewise.
2003-08-22 Kazu Hirata <kazu@cs.umass.edu>
* builtin-attrs.def: Fix comment formatting.

View File

@ -572,7 +572,7 @@ poplevel (int keep, int dummy ATTRIBUTE_UNUSED, int functionbody)
goto normal;
case VAR_DECL:
/* keep this in sync with stmt.c:warn_about_unused_variables.
/* Keep this in sync with stmt.c:warn_about_unused_variables.
No warnings when the global scope is popped because the
global scope isn't popped for the last translation unit,
so the warnings are done in c_write_global_declaration. */

View File

@ -2552,7 +2552,7 @@ cfg_layout_delete_block (basic_block bb)
}
}
/* return true when blocks A and B can be safely merged. */
/* Return true when blocks A and B can be safely merged. */
static bool
cfg_layout_can_merge_blocks_p (basic_block a, basic_block b)
{

View File

@ -9686,7 +9686,7 @@ simplify_shift_const (rtx x, enum rtx_code code,
break;
case EQ:
/* convert (lshiftrt (eq FOO 0) C) to (xor FOO 1) if STORE_FLAG_VALUE
/* Convert (lshiftrt (eq FOO 0) C) to (xor FOO 1) if STORE_FLAG_VALUE
says that the sign bit can be tested, FOO has mode MODE, C is
GET_MODE_BITSIZE (MODE) - 1, and FOO has only its low-order bit
that may be nonzero. */

View File

@ -203,7 +203,7 @@ convert_to_real (tree type, tree expr)
if (itype != type && FLOAT_TYPE_P (type))
switch (TREE_CODE (expr))
{
/* convert (float)-x into -(float)x. This is always safe. */
/* Convert (float)-x into -(float)x. This is always safe. */
case ABS_EXPR:
case NEGATE_EXPR:
if (TYPE_PRECISION (type) < TYPE_PRECISION (TREE_TYPE (expr)))
@ -211,7 +211,7 @@ convert_to_real (tree type, tree expr)
fold (convert_to_real (type,
TREE_OPERAND (expr, 0))));
break;
/* convert (outertype)((innertype0)a+(innertype1)b)
/* Convert (outertype)((innertype0)a+(innertype1)b)
into ((newtype)a+(newtype)b) where newtype
is the widest mode from all of these. */
case PLUS_EXPR:

View File

@ -545,7 +545,7 @@ calculate_dominance_info (enum cdi_direction reverse)
dominance_info info;
basic_block b;
/* allocate structure for dominance information. */
/* Allocate structure for dominance information. */
info = xmalloc (sizeof (struct dominance_info));
info->forest = et_forest_create ();
VARRAY_GENERIC_PTR_INIT (info->varray, last_basic_block + 3, "dominance info");

View File

@ -9686,7 +9686,7 @@ add_subscript_info (dw_die_ref type_die, tree type)
lower = TYPE_MIN_VALUE (domain);
upper = TYPE_MAX_VALUE (domain);
/* define the index type. */
/* Define the index type. */
if (TREE_TYPE (domain))
{
/* ??? This is probably an Ada unnamed subrange type. Ignore the
@ -10784,7 +10784,7 @@ gen_subprogram_die (tree decl, dw_die_ref context_die)
fn_arg_types = TYPE_ARG_TYPES (TREE_TYPE (decl));
if (fn_arg_types != NULL)
{
/* this is the prototyped case, check for ... */
/* This is the prototyped case, check for.... */
if (TREE_VALUE (tree_last (fn_arg_types)) != void_type_node)
gen_unspecified_parameters_die (decl, subr_die);
}

View File

@ -4066,7 +4066,7 @@ output_string_type_die (void *arg)
sibling_attribute ();
equate_type_number_to_die_number (type);
member_attribute (TYPE_CONTEXT (type));
/* this is a fixed length string */
/* This is a fixed length string. */
byte_size_attribute (type);
}
@ -5226,13 +5226,13 @@ output_decl (tree decl, tree containing_scope)
if (fn_arg_types)
{
/* this is the prototyped case, check for ... */
/* This is the prototyped case, check for.... */
if (TREE_VALUE (tree_last (fn_arg_types)) != void_type_node)
output_die (output_unspecified_parameters_die, decl);
}
else
{
/* this is unprototyped, check for undefined (just declaration) */
/* This is unprototyped, check for undefined (just declaration). */
if (!DECL_INITIAL (decl))
output_die (output_unspecified_parameters_die, decl);
}

View File

@ -2628,7 +2628,7 @@ choose_multiplier (unsigned HOST_WIDE_INT d, int n, int precision,
abort ();
if (mhigh_hi > 1 || mlow_hi > 1)
abort ();
/* assert that mlow < mhigh. */
/* Assert that mlow < mhigh. */
if (! (mlow_hi < mhigh_hi || (mlow_hi == mhigh_hi && mlow_lo < mhigh_lo)))
abort ();

View File

@ -558,7 +558,7 @@ div_and_round_double (enum tree_code code, int uns,
if (hden == 0 && lden == 0)
overflow = 1, lden = 1;
/* calculate quotient sign and convert operands to unsigned. */
/* Calculate quotient sign and convert operands to unsigned. */
if (!uns)
{
if (hnum < 0)

View File

@ -1487,7 +1487,7 @@ static void
add_line_counts (coverage_t *coverage, function_t *fn)
{
unsigned ix;
line_t *line = NULL; /* this is propagated from one iteration to the
line_t *line = NULL; /* This is propagated from one iteration to the
next. */
/* Scan each basic block. */

View File

@ -183,8 +183,8 @@ struct attr_desc
unsigned unsigned_p : 1; /* Make the output function unsigned int. */
unsigned is_const : 1; /* Attribute value constant for each run. */
unsigned is_special : 1; /* Don't call `write_attr_set'. */
unsigned func_units_p : 1; /* this is the function_units attribute */
unsigned blockage_p : 1; /* this is the blockage range function */
unsigned func_units_p : 1; /* This is the function_units attribute. */
unsigned blockage_p : 1; /* This is the blockage range function. */
unsigned static_p : 1; /* Make the output function static. */
};

View File

@ -739,7 +739,7 @@ ggc_min_heapsize_heuristic (void)
/* Adjust for rlimits. */
min_heap_kbytes = ggc_rlimit_bound (min_heap_kbytes);
min_heap_kbytes /= 1024; /* convert to Kbytes. */
min_heap_kbytes /= 1024; /* Convert to Kbytes. */
/* The heuristic is RAM/8, with a lower bound of 4M and an upper
bound of 128M (when RAM >= 1GB). */

View File

@ -3280,7 +3280,7 @@ parse_def (const char *name_start)
value,
indx);
/* deal with struct, union, and enum tags. */
/* Deal with struct, union, and enum tags. */
if (symbol_type == st_Block)
{
/* Create or update the tag information. */

View File

@ -2032,7 +2032,7 @@ fixup_match_1 (rtx insn, rtx set, rtx src, rtx src_subreg, rtx dst,
}
/* return nonzero if X is stable and mentions no registers but for
/* Return nonzero if X is stable and mentions no registers but for
mentioning SRC or mentioning / changing DST . If in doubt, presume
it is unstable.
The rationale is that we want to check if we can move an insn easily