summaryrefslogtreecommitdiffhomepage
path: root/libtommath/bn_mp_clamp.c
diff options
context:
space:
mode:
authorMatt Johnston <matt@ucc.asn.au>2006-06-10 16:39:40 +0000
committerMatt Johnston <matt@ucc.asn.au>2006-06-10 16:39:40 +0000
commitc9d3c0bc90f21886e0b78595c53e748256e299bf (patch)
tree0bb2d3bf2f98dae918f07727f55a36d0a637b9f5 /libtommath/bn_mp_clamp.c
parent94d86427ff20ed544e299d3a2de5ecc2cc04c191 (diff)
parent3b0e6a29698c8580b9556332e678e5301e697959 (diff)
merge of 332f709a4cb39cde4cedab7c3be89e05f3023067
and ca4ca78b82c5d430c69ce01bf794e8886ce81431 --HG-- extra : convert_revision : 74020525425a1de06739c6c3bed9ef35e4ad867e
Diffstat (limited to 'libtommath/bn_mp_clamp.c')
-rw-r--r--libtommath/bn_mp_clamp.c40
1 files changed, 40 insertions, 0 deletions
diff --git a/libtommath/bn_mp_clamp.c b/libtommath/bn_mp_clamp.c
new file mode 100644
index 0000000..c172611
--- /dev/null
+++ b/libtommath/bn_mp_clamp.c
@@ -0,0 +1,40 @@
+#include <tommath.h>
+#ifdef BN_MP_CLAMP_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
+ */
+
+/* trim unused digits
+ *
+ * This is used to ensure that leading zero digits are
+ * trimed and the leading "used" digit will be non-zero
+ * Typically very fast. Also fixes the sign if there
+ * are no more leading digits
+ */
+void
+mp_clamp (mp_int * a)
+{
+ /* decrease used while the most significant digit is
+ * zero.
+ */
+ while (a->used > 0 && a->dp[a->used - 1] == 0) {
+ --(a->used);
+ }
+
+ /* reset the sign flag if used == 0 */
+ if (a->used == 0) {
+ a->sign = MP_ZPOS;
+ }
+}
+#endif