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

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

diff --git a/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k_setup.c b/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k_setup.c
index 7308c32..585e1b7 100755 (executable)
--- a/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k_setup.c
+++ b/userapps/opensource/sshd/libtommath/bn_mp_reduce_2k_setup.c
@@ -1,42 +1,43 @@
-/* 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
-/* determines the setup value */\r
-int \r
-mp_reduce_2k_setup(mp_int *a, mp_digit *d)\r
-{\r
-   int res, p;\r
-   mp_int tmp;\r
-   \r
-   if ((res = mp_init(&tmp)) != MP_OKAY) {\r
-      return res;\r
-   }\r
-   \r
-   p = mp_count_bits(a);\r
-   if ((res = mp_2expt(&tmp, p)) != MP_OKAY) {\r
-      mp_clear(&tmp);\r
-      return res;\r
-   }\r
-   \r
-   if ((res = s_mp_sub(&tmp, a, &tmp)) != MP_OKAY) {\r
-      mp_clear(&tmp);\r
-      return res;\r
-   }\r
-   \r
-   *d = tmp.dp[0];\r
-   mp_clear(&tmp);\r
-   return MP_OKAY;\r
-}\r
+#include <tommath.h>
+#ifdef BN_MP_REDUCE_2K_SETUP_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
+ */
+
+/* determines the setup value */
+int mp_reduce_2k_setup(mp_int *a, mp_digit *d)
+{
+   int res, p;
+   mp_int tmp;
+   
+   if ((res = mp_init(&tmp)) != MP_OKAY) {
+      return res;
+   }
+   
+   p = mp_count_bits(a);
+   if ((res = mp_2expt(&tmp, p)) != MP_OKAY) {
+      mp_clear(&tmp);
+      return res;
+   }
+   
+   if ((res = s_mp_sub(&tmp, a, &tmp)) != MP_OKAY) {
+      mp_clear(&tmp);
+      return res;
+   }
+   
+   *d = tmp.dp[0];
+   mp_clear(&tmp);
+   return MP_OKAY;
+}
+#endif