* 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.


git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@64402 138bc75d-0d04-0410-961f-82ee72b054a4

20 files changed, 53 insertions, 28 deletions

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 6f259302fb5..732055712cc 100644
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -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.
diff --git a/gcc/c-cppbuiltin.c b/gcc/c-cppbuiltin.c
index 060a7b17a30..0a9f7d11751 100644
--- a/gcc/c-cppbuiltin.c
+++ b/gcc/c-cppbuiltin.c
@@ -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';
 
diff --git a/gcc/c-typeck.c b/gcc/c-typeck.c
index 52105ac84ec..0d52a7c9d94 100644
--- a/gcc/c-typeck.c
+++ b/gcc/c-typeck.c
@@ -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);
diff --git a/gcc/cfgbuild.c b/gcc/cfgbuild.c
index d5d1b2009db..d698f3b057a 100644
--- a/gcc/cfgbuild.c
+++ b/gcc/cfgbuild.c
@@ -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);
diff --git a/gcc/cgraphunit.c b/gcc/cgraphunit.c
index c01bba6b815..a1c20ee387b 100644
--- a/gcc/cgraphunit.c
+++ b/gcc/cgraphunit.c
@@ -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)
diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog
index 1fec2a5d690..3caae567932 100644
--- a/gcc/cp/ChangeLog
+++ b/gcc/cp/ChangeLog
@@ -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.
diff --git a/gcc/cp/tree.c b/gcc/cp/tree.c
index 94fe9fbd903..a5858bf2b4a 100644
--- a/gcc/cp/tree.c
+++ b/gcc/cp/tree.c
@@ -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;
     }
diff --git a/gcc/dwarf2out.c b/gcc/dwarf2out.c
index 445f325fde6..6a15a3b13f8 100644
--- a/gcc/dwarf2out.c
+++ b/gcc/dwarf2out.c
@@ -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);
diff --git a/gcc/expr.c b/gcc/expr.c
index e5d746234f9..04479da9443 100644
--- a/gcc/expr.c
+++ b/gcc/expr.c
@@ -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
diff --git a/gcc/f/ChangeLog b/gcc/f/ChangeLog
index 151cf81c52b..0166c195b74 100644
--- a/gcc/f/ChangeLog
+++ b/gcc/f/ChangeLog
@@ -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.
diff --git a/gcc/f/ste.c b/gcc/f/ste.c
index a620acd1f15..7b9b86c0068 100644
--- a/gcc/f/ste.c
+++ b/gcc/f/ste.c
@@ -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);
diff --git a/gcc/genextract.c b/gcc/genextract.c
index 912aa78c52d..e80fd202d3f 100644
--- a/gcc/genextract.c
+++ b/gcc/genextract.c
@@ -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 (");
diff --git a/gcc/haifa-sched.c b/gcc/haifa-sched.c
index 5295735fb77..a8b587e8a8e 100644
--- a/gcc/haifa-sched.c
+++ b/gcc/haifa-sched.c
@@ -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)
diff --git a/gcc/lcm.c b/gcc/lcm.c
index c403485a448..8774fbd65db 100644
--- a/gcc/lcm.c
+++ b/gcc/lcm.c
@@ -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;
     }
 
diff --git a/gcc/loop-unroll.c b/gcc/loop-unroll.c
index 2535cf6b24c..038cb60cd52 100644
--- a/gcc/loop-unroll.c
+++ b/gcc/loop-unroll.c
@@ -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");
diff --git a/gcc/ra-colorize.c b/gcc/ra-colorize.c
index 6c514df1c4e..7b9016a1ec1 100644
--- a/gcc/ra-colorize.c
+++ b/gcc/ra-colorize.c
@@ -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;
diff --git a/gcc/ra-debug.c b/gcc/ra-debug.c
index e415df4e69b..5f1a6ae3750 100644
--- a/gcc/ra-debug.c
+++ b/gcc/ra-debug.c
@@ -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))
 	{
diff --git a/gcc/reg-stack.c b/gcc/reg-stack.c
index 8626d636778..525d0669440 100644
--- a/gcc/reg-stack.c
+++ b/gcc/reg-stack.c
@@ -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++;
diff --git a/gcc/rtlanal.c b/gcc/rtlanal.c
index 4e604172f66..85b193e4cbb 100644
--- a/gcc/rtlanal.c
+++ b/gcc/rtlanal.c
@@ -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;
diff --git a/gcc/tracer.c b/gcc/tracer.c
index 5c19b55aafd..0e31b2ae2f6 100644
--- a/gcc/tracer.c
+++ b/gcc/tracer.c
@@ -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)
 	      {