This is the mail archive of the binutils@sources.redhat.com mailing list for the binutils project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]

[patch] 3 files under gas: Fix formatting.


Hi,

Attached is a patch to fix formatting under gas.

Thanks,

Kazu

===File ~/gnu/binutils/ChangeLog-gas========================
2000-07-08  Kazu Hirata  <kazu@hxi.com>

	* depend.c: Fix formatting.
	* flonum-konst.c: Likewise.
	* flonum-mult.c: Likewise.

============================================================

===File ~/gnu/binutils/gas.patch============================
Index: depend.c
===================================================================
RCS file: /cvs/src/src/gas/depend.c,v
retrieving revision 1.1.1.1
diff -u -r1.1.1.1 depend.c
--- depend.c	1999/05/03 07:28:40	1.1.1.1
+++ depend.c	2000/07/08 19:35:36
@@ -40,9 +40,7 @@
 
 /* Number of columns allowable.  */
 #define MAX_COLUMNS 72
-
 
-
 /* Start saving dependencies, to be written to FILENAME.  If this is
    never called, then dependency tracking is simply skipped.  */
 
@@ -66,7 +64,7 @@
 
   for (dep = dep_chain; dep != NULL; dep = dep->next)
     {
-      if (! strcmp (filename, dep->file))
+      if (!strcmp (filename, dep->file))
 	return;
     }
 
@@ -105,7 +103,7 @@
 	       the end of a file name; and backslashes in other
 	       contexts should not be doubled.  */
 	    char *q;
-	    for (q = p - 1; src < q && q[-1] == '\\';  q--)
+	    for (q = p - 1; src < q && q[-1] == '\\'; q--)
 	      {
 		if (file)
 		  putc ('\\', file);
@@ -118,7 +116,7 @@
 	    putc ('\\', file);
 	  i++;
 	  goto ordinary_char;
-	  
+
 	case '$':
 	  if (file)
 	    putc (c, file);
@@ -154,7 +152,11 @@
   if (len == 0)
     return;
 
-  if (column && MAX_COLUMNS - 1 /*spacer*/ - 2 /*` \'*/ < column + len)
+  if (column
+      && (MAX_COLUMNS
+	  - 1 /* spacer */
+	  - 2 /* ` \'   */
+	  < column + len))
     {
       fprintf (f, " \\\n ");
       column = 0;
Index: flonum-konst.c
===================================================================
RCS file: /cvs/src/src/gas/flonum-konst.c,v
retrieving revision 1.1.1.1
diff -u -r1.1.1.1 flonum-konst.c
--- flonum-konst.c	1999/05/03 07:28:40	1.1.1.1
+++ flonum-konst.c	2000/07/08 19:35:36
@@ -25,7 +25,6 @@
    sure if its right or not.  Could go either way.  I wish
    I really understood this stuff. */
 
-
 const int table_size_of_flonum_powers_of_ten = 13;
 
 static const LITTLENUM_TYPE zero[] =
@@ -204,6 +203,8 @@
 };
 
 #ifdef VMS
-void dummy1 () { }
+void
+dummy1 ()
+{
+}
 #endif
-/* end of flonum_const.c */
Index: flonum-mult.c
===================================================================
RCS file: /cvs/src/src/gas/flonum-mult.c,v
retrieving revision 1.1.1.1
diff -u -r1.1.1.1 flonum-mult.c
--- flonum-mult.c	1999/05/03 07:28:40	1.1.1.1
+++ flonum-mult.c	2000/07/08 19:35:36
@@ -22,25 +22,22 @@
 #include "flonum.h"
 
 /*	plan for a . b => p(roduct)
-	
-	
+
 	+-------+-------+-/   /-+-------+-------+
 	| a	| a	|  ...	| a	| a	|
 	|  A	|  A-1	|	|  1	|  0	|
 	+-------+-------+-/   /-+-------+-------+
-	
-	
+
 	+-------+-------+-/   /-+-------+-------+
 	| b	| b	|  ...	| b	| b	|
 	|  B	|  B-1	|	|  1	|  0	|
 	+-------+-------+-/   /-+-------+-------+
-	
-	
+
 	+-------+-------+-/   /-+-------+-/   /-+-------+-------+
 	| p	| p	|  ...	| p	|  ...	| p	| p	|
 	|  A+B+1|  A+B	|	|  N	|	|  1	|  0	|
 	+-------+-------+-/   /-+-------+-/   /-+-------+-------+
-	
+
 	/^\
 	(carry) a .b	   ...	    |	   ...	 a .b	 a .b
 	A  B 		    |		  0  1	  0  0
@@ -56,49 +53,48 @@
 	|		  \
 	+-----  P  =   >  a .b
 	N	  /__  i  j
-	
+
 	N = 0 ... A+B
-	
+
 	for all i,j where i+j=N
 	[i,j integers > 0]
-	
+
 	a[], b[], p[] may not intersect.
 	Zero length factors signify 0 significant bits: treat as 0.0.
 	0.0 factors do the right thing.
 	Zero length product OK.
-	
+
 	I chose the ForTran accent "foo[bar]" instead of the C accent "*garply"
 	because I felt the ForTran way was more intuitive. The C way would
 	probably yield better code on most C compilers. Dean Elsner.
-	(C style also gives deeper insight [to me] ... oh well ...)
-	*/
+	(C style also gives deeper insight [to me] ... oh well ...)  */
 
-void 
+void
 flonum_multip (a, b, product)
      const FLONUM_TYPE *a;
      const FLONUM_TYPE *b;
      FLONUM_TYPE *product;
 {
-  int size_of_a;		/* 0 origin */
-  int size_of_b;		/* 0 origin */
-  int size_of_product;		/* 0 origin */
-  int size_of_sum;		/* 0 origin */
-  int extra_product_positions;	/* 1 origin */
+  int size_of_a;		/* 0 origin  */
+  int size_of_b;		/* 0 origin  */
+  int size_of_product;		/* 0 origin  */
+  int size_of_sum;		/* 0 origin  */
+  int extra_product_positions;	/* 1 origin  */
   unsigned long work;
   unsigned long carry;
   long exponent;
   LITTLENUM_TYPE *q;
   long significant;		/* TRUE when we emit a non-0 littlenum  */
-  /* ForTran accent follows. */
-  int P;			/* Scan product low-order -> high. */
+  /* ForTran accent follows.  */
+  int P;			/* Scan product low-order -> high.  */
   int N;			/* As in sum above.  */
-  int A;			/* Which [] of a? */
-  int B;			/* Which [] of b? */
+  int A;			/* Which [] of a?  */
+  int B;			/* Which [] of b?  */
 
-  if ((a->sign != '-' && a->sign != '+') || (b->sign != '-' && b->sign != '+'))
+  if ((a->sign != '-' && a->sign != '+')
+      || (b->sign != '-' && b->sign != '+'))
     {
-      /* ...
-		   Got to fail somehow.  Any suggestions? */
+      /* Got to fail somehow.  Any suggestions?  */
       product->sign = 0;
       return;
     }
@@ -111,8 +107,8 @@
   extra_product_positions = size_of_product - size_of_sum;
   if (extra_product_positions < 0)
     {
-      P = extra_product_positions;	/* P < 0 */
-      exponent -= extra_product_positions;	/* Increases exponent. */
+      P = extra_product_positions;	/* P < 0  */
+      exponent -= extra_product_positions;	/* Increases exponent.  */
     }
   else
     {
@@ -130,7 +126,8 @@
 	  if (A <= size_of_a && B <= size_of_b && B >= 0)
 	    {
 #ifdef TRACE
-	      printf ("a:low[%d.]=%04x b:low[%d.]=%04x work_before=%08x\n", A, a->low[A], B, b->low[B], work);
+	      printf ("a:low[%d.]=%04x b:low[%d.]=%04x work_before=%08x\n",
+		      A, a->low[A], B, b->low[B], work);
 #endif
 	      /* Watch out for sign extension!  Without the casts, on
 		 the DEC Alpha, the multiplication result is *signed*
@@ -162,23 +159,19 @@
 	  exponent++;
 	}
     }
-  /*
-   * [P]-> position # size_of_sum + 1.
-   * This is where 'carry' should go.
-   */
+  /* [P]-> position # size_of_sum + 1.
+     This is where 'carry' should go. */
 #ifdef TRACE
   printf ("final carry =%04x\n", carry);
 #endif
   if (carry)
     {
       if (extra_product_positions > 0)
-	{
-	  product->low[P] = carry;
-	}
+	product->low[P] = carry;
       else
 	{
-	  /* No room at high order for carry littlenum. */
-	  /* Shift right 1 to make room for most significant littlenum. */
+	  /* No room at high order for carry littlenum.  */
+	  /* Shift right 1 to make room for most significant littlenum.  */
 	  exponent++;
 	  P--;
 	  for (q = product->low + P; q >= product->low; q--)
@@ -190,11 +183,7 @@
 	}
     }
   else
-    {
-      P--;
-    }
+    P--;
   product->leader = product->low + P;
   product->exponent = exponent;
 }
-
-/* end of flonum_mult.c */
============================================================


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]