summaryrefslogtreecommitdiffstats
path: root/libtommath/bn_mp_lshd.c
diff options
context:
space:
mode:
authorjan.nijtmans <nijtmans@users.sourceforge.net>2017-09-15 14:44:00 (GMT)
committerjan.nijtmans <nijtmans@users.sourceforge.net>2017-09-15 14:44:00 (GMT)
commit30f7e69b182d1267056ee2628a860891f6555aa3 (patch)
tree4598f9d64ea232476fcf18bbef6bd413444c0c07 /libtommath/bn_mp_lshd.c
parentb167e2845e3a2d5b2ffe3a877cb19c3f430aeacf (diff)
downloadtcl-30f7e69b182d1267056ee2628a860891f6555aa3.zip
tcl-30f7e69b182d1267056ee2628a860891f6555aa3.tar.gz
tcl-30f7e69b182d1267056ee2628a860891f6555aa3.tar.bz2
re-format everything through astyle. Taken from libtom/libtommath (pull request [https://github.com/libtom/libtommath/pull/85|85])
Diffstat (limited to 'libtommath/bn_mp_lshd.c')
-rw-r--r--libtommath/bn_mp_lshd.c68
1 files changed, 34 insertions, 34 deletions
diff --git a/libtommath/bn_mp_lshd.c b/libtommath/bn_mp_lshd.c
index 0143e94..888989a 100644
--- a/libtommath/bn_mp_lshd.c
+++ b/libtommath/bn_mp_lshd.c
@@ -16,49 +16,49 @@
*/
/* shift left a certain amount of digits */
-int mp_lshd (mp_int * a, int b)
+int mp_lshd(mp_int *a, int b)
{
- int x, res;
+ int x, res;
- /* if its less than zero return */
- if (b <= 0) {
- return MP_OKAY;
- }
+ /* if its less than zero return */
+ if (b <= 0) {
+ return MP_OKAY;
+ }
- /* grow to fit the new digits */
- if (a->alloc < (a->used + b)) {
- if ((res = mp_grow (a, a->used + b)) != MP_OKAY) {
- return res;
- }
- }
+ /* grow to fit the new digits */
+ if (a->alloc < (a->used + b)) {
+ if ((res = mp_grow(a, a->used + b)) != MP_OKAY) {
+ return res;
+ }
+ }
- {
- mp_digit *top, *bottom;
+ {
+ mp_digit *top, *bottom;
- /* increment the used by the shift amount then copy upwards */
- a->used += b;
+ /* increment the used by the shift amount then copy upwards */
+ a->used += b;
- /* top */
- top = a->dp + a->used - 1;
+ /* top */
+ top = a->dp + a->used - 1;
- /* base */
- bottom = (a->dp + a->used - 1) - b;
+ /* base */
+ bottom = (a->dp + a->used - 1) - b;
- /* much like mp_rshd this is implemented using a sliding window
- * except the window goes the otherway around. Copying from
- * the bottom to the top. see bn_mp_rshd.c for more info.
- */
- for (x = a->used - 1; x >= b; x--) {
- *top-- = *bottom--;
- }
+ /* much like mp_rshd this is implemented using a sliding window
+ * except the window goes the otherway around. Copying from
+ * the bottom to the top. see bn_mp_rshd.c for more info.
+ */
+ for (x = a->used - 1; x >= b; x--) {
+ *top-- = *bottom--;
+ }
- /* zero the lower digits */
- top = a->dp;
- for (x = 0; x < b; x++) {
- *top++ = 0;
- }
- }
- return MP_OKAY;
+ /* zero the lower digits */
+ top = a->dp;
+ for (x = 0; x < b; x++) {
+ *top++ = 0;
+ }
+ }
+ return MP_OKAY;
}
#endif