From: Mark Wooding <mdw@distorted.org.uk>
Date: Sat, 10 Aug 2013 20:19:58 +0000 (+0100)
Subject: Some more whitespace cleanups.
X-Git-Tag: 2.1.6~7
X-Git-Url: https://git.distorted.org.uk/~mdw/catacomb/commitdiff_plain/b14f3203c806fb8452d3f3ac7f03016dcdb1a511

Some more whitespace cleanups.
---

diff --git a/m4/mdw-probe-constant.m4 b/m4/mdw-probe-constant.m4
index 39165820..bd5a17e7 100644
--- a/m4/mdw-probe-constant.m4
+++ b/m4/mdw-probe-constant.m4
@@ -21,11 +21,11 @@ dnl -*-autoconf-*-
 ###   The idea for this macro came from the AC_C_COMPILE_VALUE macro by
 ###   Ilguiz Latypov; this implementation has a number of advantages:
 ###
-###     * it has an immense range of representable values, notably including
-###       negative numbers; and
+###	* it has an immense range of representable values, notably including
+###	  negative numbers; and
 ###
-###     * it returns the value directly in a shell variable rather than
-###       inventing an AC_DEFINE for it.
+###	* it returns the value directly in a shell variable rather than
+###	  inventing an AC_DEFINE for it.
 ###
 ### LICENSE
 ###
@@ -126,12 +126,12 @@ AC_DEFUN([mdw__PROBE_CONSTANT_SETUP],
   MDW__DIGIT(1000000000, d), \\
   MDW__DIGIT( 100000000, d), \\
   MDW__DIGIT(  10000000, d), \\
-  MDW__DIGIT(   1000000, d), \\
-  MDW__DIGIT(    100000, d), \\
-  MDW__DIGIT(     10000, d), \\
-  MDW__DIGIT(      1000, d), \\
-  MDW__DIGIT(       100, d), \\
-  MDW__DIGIT(        10, d)
+  MDW__DIGIT(	1000000, d), \\
+  MDW__DIGIT(	 100000, d), \\
+  MDW__DIGIT(	  10000, d), \\
+  MDW__DIGIT(	   1000, d), \\
+  MDW__DIGIT(	    100, d), \\
+  MDW__DIGIT(	     10, d)
 
 /* Increasingly huge divisions.  PN divides by 10^(9*2^N). */
 #define MDW__P0 /MDW__G
diff --git a/math/ec-info.c b/math/ec-info.c
index 21d21fda..017c4982 100644
--- a/math/ec-info.c
+++ b/math/ec-info.c
@@ -90,7 +90,7 @@
  *
  *   2. For each divisor %$d$% of %$r - 1$% less than %$B$% (which we can
  *	construct using this factorization), make sure that
- *      %$p^d \not\equiv 1 \pmod{r}$%.
+ *	%$p^d \not\equiv 1 \pmod{r}$%.
  *
  * This takes a little while but not ever-so long.
  *
@@ -112,13 +112,13 @@
  * References:
  *
  * [Hitt]  L. Hitt, On an improved definition of embedding degree;
- *         http://eprint.iacr.org/2006/415
+ *	   http://eprint.iacr.org/2006/415
  *
  * [P1363] IEEE 1363-2000: Standard Specifications for Public Key
- *         Cryptography; http://grouper.ieee.org/groups/1363/P1363/index.html
+ *	   Cryptography; http://grouper.ieee.org/groups/1363/P1363/index.html
  *
  * [SEC1]  SEC 1: Elliptic Curve Cryptography;
- *         http://www.secg.org/download/aid-385/sec1_final.pdf
+ *	   http://www.secg.org/download/aid-385/sec1_final.pdf
  */
 
 /* --- @movcheck@ --- *
diff --git a/math/ectab.in b/math/ectab.in
index 0e7c8cb7..b7a17ed9 100644
--- a/math/ectab.in
+++ b/math/ectab.in
@@ -354,7 +354,7 @@ curve ansi-c2onb191v2 binnorm
   r 0x0fffffffffffffffffffffffeeb354b7270b2992b7818627
   h 8
   gx 0x2a16910e8f6c4b199be24213857abc9c992edfb2471f3c68
-  gy 0x1592dbfebeb81a7c071b744d5e2f9e242ea65b81138a3468  
+  gy 0x1592dbfebeb81a7c071b744d5e2f9e242ea65b81138a3468
 
 curve ansi-c2tnb239v1 binpoly
   p 0x800000000000000000000000000000000000000000000000001000000001