summaryrefslogtreecommitdiff
path: root/ext/bcmath/libbcmath/src/recmul.c
diff options
context:
space:
mode:
Diffstat (limited to 'ext/bcmath/libbcmath/src/recmul.c')
-rw-r--r--ext/bcmath/libbcmath/src/recmul.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/ext/bcmath/libbcmath/src/recmul.c b/ext/bcmath/libbcmath/src/recmul.c
index 65e3a623c5..bc1682edcd 100644
--- a/ext/bcmath/libbcmath/src/recmul.c
+++ b/ext/bcmath/libbcmath/src/recmul.c
@@ -26,7 +26,7 @@
Computer Science Department, 9062
Western Washington University
Bellingham, WA 98226-9062
-
+
*************************************************************************/
#include <config.h>
@@ -122,7 +122,7 @@ _bc_shift_addsub (bc_num accum, bc_num val, int shift, int sub)
if (val->n_value[0] == 0)
count--;
assert (accum->n_len+accum->n_scale >= shift+count);
-
+
/* Set up pointers and others */
accp = (signed char *)(accum->n_value +
accum->n_len + accum->n_scale - shift - 1);
@@ -170,8 +170,8 @@ _bc_shift_addsub (bc_num accum, bc_num val, int shift, int sub)
}
}
-/* Recursive divide and conquer multiply algorithm.
- Based on
+/* Recursive divide and conquer multiply algorithm.
+ Based on
Let u = u0 + u1*(b^n)
Let v = v0 + v1*(b^n)
Then uv = (B^2n+B^n)*u1*v1 + B^n*(u1-u0)*(v0-v1) + (B^n+1)*u0*v0
@@ -181,7 +181,7 @@ _bc_shift_addsub (bc_num accum, bc_num val, int shift, int sub)
static void
_bc_rec_mul (bc_num u, int ulen, bc_num v, int vlen, bc_num *prod,
int full_scale)
-{
+{
bc_num u0, u1, v0, v1;
bc_num m1, m2, m3, d1, d2;
int n, prodlen, m1zero;
@@ -277,7 +277,7 @@ _bc_rec_mul (bc_num u, int ulen, bc_num v, int vlen, bc_num *prod,
void
bc_multiply (bc_num n1, bc_num n2, bc_num *prod, int scale)
{
- bc_num pval;
+ bc_num pval;
int len1, len2;
int full_scale, prod_scale;