OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

c-cppbuiltin.c (builtin_define_with_value_n): Fix whitespace. 

* c-cppbuiltin.c (builtin_define_with_value_n): Fix whitespace.
	* c-typeck.c (c_tree_expr_nonnegative_p): Likewise.
	* cfgbuild.c (find_many_sub_basic_blocks): Likewise.
	(find_sub_basic_blocks): Likewise.
	* cgraphunit.c (cgraph_expand_functions): Likewise.
	* dwarf2out.c (prune_unused_types): Likewise.
	* expr.c (store_field): Likewise.
	* genextract.c (print_path): Likewise.
	* haifa-sched.c (schedule_insn): Likewise.
	* lcm.c (compute_antinout_edge): Likewise.
	* loop-unroll.c (decide_peel_once_rolling): Likewise.
	* ra-colorize.c (ra_colorize_free_all): Likewise.
	* ra-debug.c (dump_igraph): Likewise.
	(debug_hard_reg_set): Likewise.
	* reg-stack.c (reg_to_stack): Likewise.
	* rtlanal.c (refers_to_regno_p): Likewise.
	* tracer.c (layout_superblocks): Likewise.

	* cp/tree.c (count_functions): Fix whitespace.

	* f/ste.c (ffeste_R810): Fix whitespace.

From-SVN: r64402
This commit is contained in:
Roger Sayle 2003-03-15 13:43:33 +00:00 committed by Roger Sayle
parent 49c4644467
commit 6a87d63407
20 changed files with 53 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
gcc/ChangeLog
View File

@ -1,3 +1,23 @@
2003-03-15 Roger Sayle <roger@eyesopen.com>
* c-cppbuiltin.c (builtin_define_with_value_n): Fix whitespace.
* c-typeck.c (c_tree_expr_nonnegative_p): Likewise.
* cfgbuild.c (find_many_sub_basic_blocks): Likewise.
(find_sub_basic_blocks): Likewise.
* cgraphunit.c (cgraph_expand_functions): Likewise.
* dwarf2out.c (prune_unused_types): Likewise.
* expr.c (store_field): Likewise.
* genextract.c (print_path): Likewise.
* haifa-sched.c (schedule_insn): Likewise.
* lcm.c (compute_antinout_edge): Likewise.
* loop-unroll.c (decide_peel_once_rolling): Likewise.
* ra-colorize.c (ra_colorize_free_all): Likewise.
* ra-debug.c (dump_igraph): Likewise.
(debug_hard_reg_set): Likewise.
* reg-stack.c (reg_to_stack): Likewise.
* rtlanal.c (refers_to_regno_p): Likewise.
* tracer.c (layout_superblocks): Likewise.
2003-03-15 Neil Booth <neil@daikokuya.co.uk>
* fix-header.c (read_scan_file): Fix thinko.

2
gcc/c-cppbuiltin.c
View File

@ -480,7 +480,7 @@ builtin_define_with_value_n (macro, expansion, elen)
/* Space for an = and a NUL. */
buf = alloca (mlen + elen + 2);
memcpy (buf, macro, mlen);
buf[mlen]= '=';
buf[mlen] = '=';
memcpy (buf + mlen + 1, expansion, elen);
buf[mlen + elen + 1] = '\0';

4
gcc/c-typeck.c
View File

@ -2599,13 +2599,13 @@ c_tree_expr_nonnegative_p (t)
{
if (TREE_CODE (t) == STMT_EXPR)
{
t=COMPOUND_BODY (STMT_EXPR_STMT (t));
t = COMPOUND_BODY (STMT_EXPR_STMT (t));
/* Find the last statement in the chain, ignoring the final
* scope statement */
while (TREE_CHAIN (t) != NULL_TREE
&& TREE_CODE (TREE_CHAIN (t)) != SCOPE_STMT)
t=TREE_CHAIN (t);
t = TREE_CHAIN (t);
return tree_expr_nonnegative_p (TREE_OPERAND (t, 0));
}
return tree_expr_nonnegative_p (t);

4
gcc/cfgbuild.c
View File

@ -811,7 +811,7 @@ find_many_sub_basic_blocks (blocks)
{
bb->count = 0;
bb->frequency = 0;
for (e = bb->pred; e; e=e->pred_next)
for (e = bb->pred; e; e = e->pred_next)
{
bb->count += e->count;
bb->frequency += EDGE_FREQUENCY (e);
@ -852,7 +852,7 @@ find_sub_basic_blocks (bb)
{
b->count = 0;
b->frequency = 0;
for (e = b->pred; e; e=e->pred_next)
for (e = b->pred; e; e = e->pred_next)
{
b->count += e->count;
b->frequency += EDGE_FREQUENCY (e);

2
gcc/cgraphunit.c
View File

@ -342,7 +342,7 @@ cgraph_expand_functions ()
}
}
}
for (i = order_pos - 1; i >=0; i--)
for (i = order_pos - 1; i >= 0; i--)
{
node = order[i];
if (node->output)

4
gcc/cp/ChangeLog
View File

@ -1,3 +1,7 @@
2003-03-15 Roger Sayle <roger@eyesopen.com>
* tree.c (count_functions): Fix whitespace.
2003-03-15 Neil Booth <neil@daikokuya.co.uk>
* Make-lang.in: Update.

2
gcc/cp/tree.c
View File

@ -1021,7 +1021,7 @@ count_functions (t)
return 1;
else if (TREE_CODE (t) == OVERLOAD)
{
for (i=0; t; t = OVL_CHAIN (t))
for (i = 0; t; t = OVL_CHAIN (t))
i++;
return i;
}

12
gcc/dwarf2out.c
View File

@ -12941,14 +12941,10 @@ prune_unused_types ()
/* Also set the mark on nodes referenced from the
pubname_table or arange_table. */
for (i=0; i < pubname_table_in_use; i++)
{
prune_unused_types_mark (pubname_table[i].die, 1);
}
for (i=0; i < arange_table_in_use; i++)
{
prune_unused_types_mark (arange_table[i], 1);
}
for (i = 0; i < pubname_table_in_use; i++)
prune_unused_types_mark (pubname_table[i].die, 1);
for (i = 0; i < arange_table_in_use; i++)
prune_unused_types_mark (arange_table[i], 1);
/* Get rid of nodes that aren't marked. */
prune_unused_types_prune (comp_unit_die);

2
gcc/expr.c
View File

@ -5503,7 +5503,7 @@ store_field (target, bitsize, bitpos, mode, exp, value_mode, unsignedp, type,
side-effects. */
if (bitsize == 0)
return expand_expr (exp, const0_rtx, VOIDmode, 0);
else if (bitsize >=0 && bitsize < HOST_BITS_PER_WIDE_INT)
else if (bitsize >= 0 && bitsize < HOST_BITS_PER_WIDE_INT)
width_mask = ((HOST_WIDE_INT) 1 << bitsize) - 1;
/* If we are storing into an unaligned field of an aligned union that is

4
gcc/f/ChangeLog
View File

@ -1,3 +1,7 @@
2003-03-15 Roger Sayle <roger@eyesopen.com>
* f/ste.c (ffeste_R810): Fix whitespace.
2003-03-15 Andreas Jaeger <aj@suse.de>
* g77spec.c (DEFAULT_SWITCH_TAKES_ARG): Remove.

4
gcc/f/ste.c
View File

@ -2725,8 +2725,8 @@ ffeste_R810 (ffestw block, unsigned long casenum)
}
else
pushok = pushcase (texprlow, convert, tlabel, &duplicate);
assert((pushok !=2) || (pushok !=0));
if (pushok==2)
assert((pushok != 2) || (pushok != 0));
if (pushok == 2)
{
ffebad_start_msg ("SELECT (at %0) has duplicate cases -- check integer overflow of CASE(s)",
FFEBAD_severityFATAL);

2
gcc/genextract.c
View File

@ -323,7 +323,7 @@ print_path (path)
/* We first write out the operations (XEXP or XVECEXP) in reverse
order, then write "insn", then the indices in forward order. */
for (i = len - 1; i >=0 ; i--)
for (i = len - 1; i >= 0 ; i--)
{
if (ISLOWER(path[i]))
printf ("XVECEXP (");

2
gcc/haifa-sched.c
View File

@ -1298,7 +1298,7 @@ schedule_insn (insn, ready, clock)
char buf[2048];
print_insn (buf, insn, 0);
buf[40]=0;
buf[40] = 0;
fprintf (sched_dump, ";;\t%3i--> %-40s:", clock, buf);
if (recog_memoized (insn) < 0)

2
gcc/lcm.c
View File

@ -129,7 +129,7 @@ compute_antinout_edge (antloc, transp, antin, antout)
optimistic initialization of ANTIN above. */
FOR_EACH_BB_REVERSE (bb)
{
*qin++ =bb;
*qin++ = bb;
bb->aux = bb;
}

2
gcc/loop-unroll.c
View File

@ -296,7 +296,7 @@ decide_peel_once_rolling (loops, loop, flags)
loop->has_desc = 1;
/* Check number of iterations. */
if (!loop->simple || !loop->desc.const_iter || loop->desc.niter !=0)
if (!loop->simple || !loop->desc.const_iter || loop->desc.niter != 0)
{
if (rtl_dump_file)
fprintf (rtl_dump_file, ";; Unable to prove that the loop rolls exactly once\n");

2
gcc/ra-colorize.c
View File

@ -2722,7 +2722,7 @@ ra_colorize_free_all ()
put_web (DLIST_WEB (d), INITIAL);
while ((d = pop_list (&WEBS(INITIAL))) != NULL)
{
struct web *web =DLIST_WEB (d);
struct web *web = DLIST_WEB (d);
struct web *wnext;
web->orig_conflict_list = NULL;
web->conflict_list = NULL;

5
gcc/ra-debug.c
View File

@ -668,7 +668,8 @@ dump_igraph (df)
for (def1 = 0; def1 < num_webs; def1++)
{
int num1 = num;
for (num2=0, def2 = 0; def2 < num_webs; def2++)
num2 = 0;
for (def2 = 0; def2 < num_webs; def2++)
if (def1 != def2 && TEST_BIT (igraph, igraph_index (def1, def2)))
{
if (num1 == num)
@ -1107,7 +1108,7 @@ debug_hard_reg_set (set)
HARD_REG_SET set;
{
int i;
for (i=0; i < FIRST_PSEUDO_REGISTER; ++i)
for (i = 0; i < FIRST_PSEUDO_REGISTER; ++i)
{
if (TEST_HARD_REG_BIT (set, i))
{

2
gcc/reg-stack.c
View File

@ -454,7 +454,7 @@ reg_to_stack (first, file)
FOR_EACH_BB_REVERSE (bb)
{
edge e;
for (e = bb->pred; e; e=e->pred_next)
for (e = bb->pred; e; e = e->pred_next)
if (!(e->flags & EDGE_DFS_BACK)
&& e->src != ENTRY_BLOCK_PTR)
BLOCK_INFO (bb)->predecessors++;

2
gcc/rtlanal.c
View File

@ -1557,7 +1557,7 @@ refers_to_regno_p (regno, endregno, x, loc)
else if (fmt[i] == 'E')
{
int j;
for (j = XVECLEN (x, i) - 1; j >=0; j--)
for (j = XVECLEN (x, i) - 1; j >= 0; j--)
if (loc != &XVECEXP (x, i, j)
&& refers_to_regno_p (regno, endregno, XVECEXP (x, i, j), loc))
return 1;

2
gcc/tracer.c
View File

@ -347,7 +347,7 @@ layout_superblocks ()
RBI (best->dest)->visited = 1;
}
else
for (; bb != EXIT_BLOCK_PTR; bb=bb->next_bb)
for (; bb != EXIT_BLOCK_PTR; bb = bb->next_bb)
{
if (!RBI (bb)->visited)
{