Elliptic curves on binary fields work.

[u/mdw/catacomb] / mp-gcd.c

diff --git a/mp-gcd.c b/mp-gcd.c
index a17a502..f55d0aa 100644 (file)
--- a/mp-gcd.c
+++ b/mp-gcd.c
@@ -1,6 +1,6 @@
 /* -*-c-*-
  *
- * $Id: mp-gcd.c,v 1.5 2000/10/08 12:02:41 mdw Exp $
+ * $Id: mp-gcd.c,v 1.5.4.1 2004/03/21 22:39:46 mdw Exp $
  *
  * Extended GCD calculation
  *
@@ -30,6 +30,9 @@
 /*----- Revision history --------------------------------------------------* 
  *
  * $Log: mp-gcd.c,v $
+ * Revision 1.5.4.1  2004/03/21 22:39:46  mdw
+ * Elliptic curves on binary fields work.
+ *
  * Revision 1.5  2000/10/08 12:02:41  mdw
  * Use Euclid's algorithm rather than the binary one.
  *
@@ -74,12 +77,10 @@ void mp_gcd(mp **gcd, mp **xx, mp **yy, mp *a, mp *b)
   mp *q = MP_NEW;
   unsigned f = 0;
 
-  enum {
-    f_swap = 1u,
-    f_aneg = 2u,
-    f_bneg = 4u,
-    f_ext = 8u
-  };
+#define f_swap 1u
+#define f_aneg 2u
+#define f_bneg 4u
+#define f_ext 8u
 
   /* --- Sort out some initial flags --- */