procyberian/gcc
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

c-typeck.c, [...]: Fix comment formatting.

Browse source 
* c-typeck.c, defaults.h, dwarf.h, dwarf2out.c, fold-const.c,
	gthr-dce.h, gthr-posix.h, gthr-solaris.h, gthr-win32.h,
	lambda-code.c, lambda-mat.c, libgcc2.c, stmt.c,
	tree-ssa-pre.c, tree-vn.c, tree.h: Fix comment formatting.

From-SVN: r88102
This commit is contained in:
Kazu Hirata 2004-09-25 14:36:40 +00:00 • committed by Kazu Hirata
parent e75220c8ce
commit ea4b78487c
17 changed files with 36 additions and 29 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

7
gcc/ChangeLog
View file

@ -1,3 +1,10 @@
2004-09-25 Kazu Hirata <kazu@cs.umass.edu>
* c-typeck.c, defaults.h, dwarf.h, dwarf2out.c, fold-const.c,
gthr-dce.h, gthr-posix.h, gthr-solaris.h, gthr-win32.h,
lambda-code.c, lambda-mat.c, libgcc2.c, stmt.c,
tree-ssa-pre.c, tree-vn.c, tree.h: Fix comment formatting.
2004-09-25 Kazu Hirata <kazu@cs.umass.edu>
* tree-ssa-loop-unswitch.c: Fix a comment typo.

2
gcc/c-typeck.c
View file

@ -3321,7 +3321,7 @@ build_modify_expr (tree lhs, enum tree_code modifycode, tree rhs)
if (TREE_CODE (newrhs) == ERROR_MARK)
return error_mark_node;
/* Scan operands */
/* Scan operands. */
result = build2 (MODIFY_EXPR, lhstype, lhs, newrhs);
TREE_SIDE_EFFECTS (result) = 1;

2
gcc/defaults.h
View file

@ -248,7 +248,7 @@ do { fputs (integer_asm_op (POINTER_SIZE / BITS_PER_UNIT, TRUE), FILE); \
#define TARGET_WEAK_NOT_IN_ARCHIVE_TOC 0
#endif
/* This determines whether or not we need linkonce unwind information */
/* This determines whether or not we need linkonce unwind information. */
#ifndef TARGET_USES_WEAK_UNWIND_INFO
#define TARGET_USES_WEAK_UNWIND_INFO 0
#endif

2
gcc/dwarf.h
View file

@ -219,7 +219,7 @@ enum dwarf_fundamental_type {
/* GNU extensions
The low order byte must indicate the size (in bytes) for the type.
All of these types will probably break "classic" svr4 SDB */
All of these types will probably break "classic" svr4 SDB. */
FT_long_long = 0x8008,
FT_signed_long_long = 0x8108,

6
gcc/dwarf2out.c
View file

@ -12926,7 +12926,7 @@ lookup_filename (const char *file_name)
return file_table_last_lookup_index;
}
/* Didn't match the previous lookup, search the table */
/* Didn't match the previous lookup, search the table. */
n = VARRAY_ACTIVE_SIZE (file_table);
for (i = 1; i < n; i++)
if (strcmp (file_name, VARRAY_CHAR_PTR (file_table, i)) == 0)
@ -13219,7 +13219,7 @@ dwarf2out_init (const char *filename ATTRIBUTE_UNUSED)
abbrev_die_table = ggc_alloc_cleared (ABBREV_DIE_TABLE_INCREMENT
* sizeof (dw_die_ref));
abbrev_die_table_allocated = ABBREV_DIE_TABLE_INCREMENT;
/* Zero-th entry is allocated, but unused */
/* Zero-th entry is allocated, but unused. */
abbrev_die_table_in_use = 1;
/* Allocate the initial hunk of the line_info_table. */
@ -13227,7 +13227,7 @@ dwarf2out_init (const char *filename ATTRIBUTE_UNUSED)
* sizeof (dw_line_info_entry));
line_info_table_allocated = LINE_INFO_TABLE_INCREMENT;
/* Zero-th entry is allocated, but unused */
/* Zero-th entry is allocated, but unused. */
line_info_table_in_use = 1;
/* Generate the initial DIE for the .debug section. Note that the (string)

6
gcc/fold-const.c
View file

@ -6686,7 +6686,7 @@ fold (tree expr)
TREE_OPERAND (arg0, 0),
build_real (type, c1)));
}
/* Convert a + (b*c + d*e) into (a + b*c) + d*e */
/* Convert a + (b*c + d*e) into (a + b*c) + d*e. */
if (flag_unsafe_math_optimizations
&& TREE_CODE (arg1) == PLUS_EXPR
&& TREE_CODE (arg0) != MULT_EXPR)
@ -6701,7 +6701,7 @@ fold (tree expr)
return fold (build2 (PLUS_EXPR, type, tree0, tree11));
}
}
/* Convert (b*c + d*e) + a into b*c + (d*e +a) */
/* Convert (b*c + d*e) + a into b*c + (d*e +a). */
if (flag_unsafe_math_optimizations
&& TREE_CODE (arg0) == PLUS_EXPR
&& TREE_CODE (arg1) != MULT_EXPR)
@ -9569,7 +9569,7 @@ tree_expr_nonnegative_p (tree t)
/* Return true when T is an address and is known to be nonzero.
For floating point we further ensure that T is not denormal.
Similar logic is present in nonzero_address in rtlanal.h */
Similar logic is present in nonzero_address in rtlanal.h. */
static bool
tree_expr_nonzero_p (tree t)

2
gcc/gthr-dce.h
View file

@ -124,7 +124,7 @@ static inline int
__gthread_objc_init_thread_system (void)
{
if (__gthread_active_p ())
/* Initialize the thread storage key */
/* Initialize the thread storage key. */
return pthread_keycreate (&_objc_thread_storage, NULL);
else
return -1;

2
gcc/gthr-posix.h
View file

@ -143,7 +143,7 @@ __gthread_objc_init_thread_system (void)
{
if (__gthread_active_p ())
{
/* Initialize the thread storage key */
/* Initialize the thread storage key. */
if (pthread_key_create (&_objc_thread_storage, NULL) == 0)
{
/* The normal default detach state for threads is

2
gcc/gthr-solaris.h
View file

@ -113,7 +113,7 @@ static void *thread_local_storage = NULL;
static inline int
__gthread_objc_init_thread_system (void)
{
/* Initialize the thread storage key */
/* Initialize the thread storage key. */
if (__gthread_active_p ()
&& thr_keycreate (&_objc_thread_storage, NULL) == 0)
return 0;

2
gcc/gthr-win32.h
View file

@ -88,7 +88,7 @@ static DWORD __gthread_objc_data_tls = (DWORD) -1;
int
__gthread_objc_init_thread_system (void)
{
/* Initialize the thread storage key */
/* Initialize the thread storage key. */
if ((__gthread_objc_data_tls = TlsAlloc ()) != (DWORD) -1)
return 0;
else

8
gcc/lambda-code.c
View file

@ -644,7 +644,7 @@ lambda_compute_auxillary_space (lambda_loopnest nest,
Remember the constant are in our vector a, our coefficient matrix is A,
and our invariant coefficient matrix is B */
/* Swap B and B1, and a1 and a */
/* Swap B and B1, and a1 and a. */
temp0 = B1;
B1 = B;
B = temp0;
@ -806,10 +806,10 @@ lambda_compute_target_space (lambda_loopnest auxillary_nest,
/* Computes the gcd of the coefficients of the linear part. */
gcd1 = gcd_vector (target[i], i);
/* Include the denominator in the GCD */
/* Include the denominator in the GCD. */
gcd1 = gcd (gcd1, determinant);
/* Now divide through by the gcd */
/* Now divide through by the gcd. */
for (j = 0; j < i; j++)
target[i][j] = target[i][j] / gcd1;
@ -822,7 +822,7 @@ lambda_compute_target_space (lambda_loopnest auxillary_nest,
LL_LINEAR_OFFSET (target_loop) = expression;
}
/* For each loop, compute the new bounds from H */
/* For each loop, compute the new bounds from H. */
for (i = 0; i < depth; i++)
{
auxillary_loop = LN_LOOPS (auxillary_nest)[i];

4
gcc/lambda-mat.c
View file

@ -602,9 +602,9 @@ lambda_matrix_project_to_null (lambda_matrix B, int rowsize,
lambda_matrix M1, M2, M3, I;
int determinant;
/* compute c(I-B^T inv(B B^T) B) e sub k */
/* Compute c(I-B^T inv(B B^T) B) e sub k. */
/* M1 is the transpose of B */
/* M1 is the transpose of B. */
M1 = lambda_matrix_new (colsize, colsize);
lambda_matrix_transpose (B, M1, rowsize, colsize);

8
gcc/libgcc2.c
View file

@ -489,16 +489,16 @@ __udiv_w_sdiv (UWtype *rp, UWtype a1, UWtype a0, UWtype d)
{
if (a1 < d - a1 - (a0 >> (W_TYPE_SIZE - 1)))
{
/* dividend, divisor, and quotient are nonnegative */
/* Dividend, divisor, and quotient are nonnegative. */
sdiv_qrnnd (q, r, a1, a0, d);
}
else
{
/* Compute c1*2^32 + c0 = a1*2^32 + a0 - 2^31*d */
/* Compute c1*2^32 + c0 = a1*2^32 + a0 - 2^31*d. */
sub_ddmmss (c1, c0, a1, a0, d >> 1, d << (W_TYPE_SIZE - 1));
/* Divide (c1*2^32 + c0) by d */
/* Divide (c1*2^32 + c0) by d. */
sdiv_qrnnd (q, r, c1, c0, d);
/* Add 2^31 to quotient */
/* Add 2^31 to quotient. */
q += (UWtype) 1 << (W_TYPE_SIZE - 1);
}
}

2
gcc/stmt.c
View file

@ -701,7 +701,7 @@ expand_asm_operands (tree string, tree outputs, tree inputs,
/* Mark clobbered registers. */
if (i >= 0)
{
/* Clobbering the PIC register is an error */
/* Clobbering the PIC register is an error. */
if (i == (int) PIC_OFFSET_TABLE_REGNUM)
{
error ("PIC register %qs clobbered in %<asm%>", regname);

4
gcc/tree-ssa-pre.c
View file

@ -856,7 +856,7 @@ phi_translate (tree expr, value_set_t set, basic_block pred,
if (is_gimple_min_invariant (expr))
return expr;
/* Phi translations of a given expression don't change, */
/* Phi translations of a given expression don't change. */
phitrans = phi_trans_lookup (expr, pred);
if (phitrans)
return phitrans;
@ -1199,7 +1199,7 @@ compute_antic_aux (basic_block block)
VEC_free (basic_block, worklist);
}
/* Generate ANTIC_OUT - TMP_GEN */
/* Generate ANTIC_OUT - TMP_GEN. */
S = bitmap_set_subtract_from_value_set (ANTIC_OUT, TMP_GEN (block), false);
/* Start ANTIC_IN with EXP_GEN - TMP_GEN */

2
gcc/tree-vn.c
View file

@ -165,7 +165,7 @@ val_expr_pair_expr_eq (const void *p1, const void *p2)
}
/* Set the value handle for expression E to value V */
/* Set the value handle for expression E to value V. */
static void
set_value_handle (tree e, tree v)

4
gcc/tree.h
View file

@ -3251,11 +3251,11 @@ extern int mostly_zeros_p (tree);
extern void add_var_to_bind_expr (tree, tree);
/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0 */
/* integer_zerop (tree x) is nonzero if X is an integer constant of value 0. */
extern int integer_zerop (tree);
/* integer_onep (tree x) is nonzero if X is an integer constant of value 1 */
/* integer_onep (tree x) is nonzero if X is an integer constant of value 1. */
extern int integer_onep (tree);