Merge trunkz_modifier

1 files changed, 38 insertions, 38 deletions

diff --git a/libtommath/bn_mp_rshd.c b/libtommath/bn_mp_rshd.c
index 4b598de..fd06735 100644
--- a/libtommath/bn_mp_rshd.c
+++ b/libtommath/bn_mp_rshd.c
@@ -16,54 +16,54 @@
  */
 
 /* shift right a certain amount of digits */
-void mp_rshd (mp_int * a, int b)
+void mp_rshd(mp_int *a, int b)
 {
-  int     x;
+   int     x;
 
-  /* if b <= 0 then ignore it */
-  if (b <= 0) {
-    return;
-  }
+   /* if b <= 0 then ignore it */
+   if (b <= 0) {
+      return;
+   }
 
-  /* if b > used then simply zero it and return */
-  if (a->used <= b) {
-    mp_zero (a);
-    return;
-  }
+   /* if b > used then simply zero it and return */
+   if (a->used <= b) {
+      mp_zero(a);
+      return;
+   }
 
-  {
-    mp_digit *bottom, *top;
+   {
+      mp_digit *bottom, *top;
 
-    /* shift the digits down */
+      /* shift the digits down */
 
-    /* bottom */
-    bottom = a->dp;
+      /* bottom */
+      bottom = a->dp;
 
-    /* top [offset into digits] */
-    top = a->dp + b;
+      /* top [offset into digits] */
+      top = a->dp + b;
 
-    /* this is implemented as a sliding window where 
-     * the window is b-digits long and digits from 
-     * the top of the window are copied to the bottom
-     *
-     * e.g.
+      /* this is implemented as a sliding window where
+       * the window is b-digits long and digits from
+       * the top of the window are copied to the bottom
+       *
+       * e.g.
 
-     b-2 | b-1 | b0 | b1 | b2 | ... | bb |   ---->
-                 /\                   |      ---->
-                  \-------------------/      ---->
-     */
-    for (x = 0; x < (a->used - b); x++) {
-      *bottom++ = *top++;
-    }
+       b-2 | b-1 | b0 | b1 | b2 | ... | bb |   ---->
+                   /\                   |      ---->
+                    \-------------------/      ---->
+       */
+      for (x = 0; x < (a->used - b); x++) {
+         *bottom++ = *top++;
+      }
 
-    /* zero the top digits */
-    for (; x < a->used; x++) {
-      *bottom++ = 0;
-    }
-  }
-  
-  /* remove excess digits */
-  a->used -= b;
+      /* zero the top digits */
+      for (; x < a->used; x++) {
+         *bottom++ = 0;
+      }
+   }
+
+   /* remove excess digits */
+   a->used -= b;
 }
 #endif