www.usr.com/support/gpl/USR9107_release.1.4.tar.gz

[bcm963xx.git] / userapps / opensource / sshd / libtommath / bn_mp_reduce_2k.c

diff --git a/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k.c b/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k.c
index 91d5f6f..28c3a00 100755 (executable)
--- a/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k.c
+++ b/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k.c
@@ -1,56 +1,57 @@
-/* LibTomMath, multiple-precision integer library -- Tom St Denis\r
- *\r
- * LibTomMath is library that provides for multiple-precision\r
- * integer arithmetic as well as number theoretic functionality.\r
- *\r
- * The library is designed directly after the MPI library by\r
- * Michael Fromberger but has been written from scratch with\r
- * additional optimizations in place.\r
- *\r
- * The library is free for all purposes without any express\r
- * guarantee it works.\r
- *\r
- * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org\r
- */\r
-#include <tommath.h>\r
-\r
-/* reduces a modulo n where n is of the form 2**p - k */\r
-int\r
-mp_reduce_2k(mp_int *a, mp_int *n, mp_digit k)\r
-{\r
-   mp_int q;\r
-   int    p, res;\r
-   \r
-   if ((res = mp_init(&q)) != MP_OKAY) {\r
-      return res;\r
-   }\r
-   \r
-   p = mp_count_bits(n);    \r
-top:\r
-   /* q = a/2**p, a = a mod 2**p */\r
-   if ((res = mp_div_2d(a, p, &q, a)) != MP_OKAY) {\r
-      goto ERR;\r
-   }\r
-   \r
-   if (k != 1) {\r
-      /* q = q * k */\r
-      if ((res = mp_mul_d(&q, k, &q)) != MP_OKAY) { \r
-         goto ERR;\r
-      }\r
-   }\r
-   \r
-   /* a = a + q */\r
-   if ((res = s_mp_add(a, &q, a)) != MP_OKAY) {\r
-      goto ERR;\r
-   }\r
-   \r
-   if (mp_cmp_mag(a, n) != MP_LT) {\r
-      s_mp_sub(a, n, a);\r
-      goto top;\r
-   }\r
-   \r
-ERR:\r
-   mp_clear(&q);\r
-   return res;\r
-}\r
-\r
+#include <tommath.h>
+#ifdef BN_MP_REDUCE_2K_C
+/* LibTomMath, multiple-precision integer library -- Tom St Denis
+ *
+ * LibTomMath is a library that provides multiple-precision
+ * integer arithmetic as well as number theoretic functionality.
+ *
+ * The library was designed directly after the MPI library by
+ * Michael Fromberger but has been written from scratch with
+ * additional optimizations in place.
+ *
+ * The library is free for all purposes without any express
+ * guarantee it works.
+ *
+ * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
+ */
+
+/* reduces a modulo n where n is of the form 2**p - d */
+int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d)
+{
+   mp_int q;
+   int    p, res;
+   
+   if ((res = mp_init(&q)) != MP_OKAY) {
+      return res;
+   }
+   
+   p = mp_count_bits(n);    
+top:
+   /* q = a/2**p, a = a mod 2**p */
+   if ((res = mp_div_2d(a, p, &q, a)) != MP_OKAY) {
+      goto ERR;
+   }
+   
+   if (d != 1) {
+      /* q = q * d */
+      if ((res = mp_mul_d(&q, d, &q)) != MP_OKAY) { 
+         goto ERR;
+      }
+   }
+   
+   /* a = a + q */
+   if ((res = s_mp_add(a, &q, a)) != MP_OKAY) {
+      goto ERR;
+   }
+   
+   if (mp_cmp_mag(a, n) != MP_LT) {
+      s_mp_sub(a, n, a);
+      goto top;
+   }
+   
+ERR:
+   mp_clear(&q);
+   return res;
+}
+
+#endif