Optimized standard path calculation

Author: SakiTakamachi

ext/bcmath/libbcmath/src/div.c

@@ -429,3 +429,19 @@ bool bc_divide(bc_num numerator, bc_num divisor, bc_num *quot, size_t scale)
 	*quot = bc_copy_num(BCG(_zero_));
 	return true;
 }
+
+void bc_divide_vector(
+	BC_VECTOR *numerator_vectors, size_t numerator_arr_size,
+	const BC_VECTOR *divisor_vectors, size_t divisor_arr_size, size_t divisor_size,
+	BC_VECTOR *quot_vectors, size_t quot_arr_size
+) {
+	ZEND_ASSERT(divisor_vectors[divisor_arr_size - 1] != 0);
+	ZEND_ASSERT(quot_arr_size == numerator_arr_size - divisor_arr_size + 1);
+
+	/* Do the division */
+	if (divisor_arr_size == 1) {
+		bc_fast_div(numerator_vectors, numerator_arr_size, divisor_vectors[0], quot_vectors, quot_arr_size);
+	} else {
+		bc_standard_div(numerator_vectors, numerator_arr_size, divisor_vectors, divisor_arr_size, divisor_size, quot_vectors, quot_arr_size);
+	}
+}

ext/bcmath/libbcmath/src/private.h

@@ -87,6 +87,10 @@ bc_num _bc_do_sub (bc_num n1, bc_num n2);
 void bc_multiply_vector(
 	const BC_VECTOR *n1_vector, size_t n1_arr_size, const BC_VECTOR *n2_vector, size_t n2_arr_size,
 	BC_VECTOR *prod_vector, size_t prod_arr_size);
+void bc_divide_vector(
+	BC_VECTOR *numerator_vectors, size_t numerator_arr_size,
+	const BC_VECTOR *divisor_vectors, size_t divisor_arr_size, size_t divisor_size,
+	BC_VECTOR *quot_vectors, size_t quot_arr_size);
 void _bc_rm_leading_zeros (bc_num num);
 
 #endif

ext/bcmath/libbcmath/src/sqrt.c

@@ -30,6 +30,7 @@
 *************************************************************************/
 
 #include "bcmath.h"
+#include "convert.h"
 #include <stdbool.h>
 #include <stddef.h>
 #include "private.h"
@@ -102,57 +103,131 @@ static inline void bc_fast_sqrt(bc_num *num, size_t rscale)
 	*num = ret;
 }
 
-static inline void bc_standard_sqrt(bc_num *num, size_t rscale, bcmath_compare_result num_cmp_one)
+static inline void bc_standard_sqrt(bc_num *num, size_t rscale, size_t num_calc_full_len)
 {
-	bc_num guess;
-	size_t cscale;
-	/* Calculate the initial guess. */
-	if (num_cmp_one == BCMATH_RIGHT_GREATER) {
-		/* The number is between 0 and 1.  Guess should start at 1. */
-		guess = bc_copy_num(BCG(_one_));
-		cscale = (*num)->n_scale;
+	/* allocate memory */
+	size_t n_arr_size = BC_ARR_SIZE_FROM_LEN(num_calc_full_len);
+
+	size_t guess_len = ((*num)->n_len + 1) / 2;
+	size_t guess_scale = rscale + 1;
+	size_t guess_full_len = guess_len + guess_scale;
+	/* Since add the old guess and the new guess together during the calculation,
+	 * there is a chance of overflow, so allocate an extra size. */
+	size_t guess_arr_size = BC_ARR_SIZE_FROM_LEN(guess_full_len) + 1;
+
+	size_t allocate_size = n_arr_size * 2 + guess_arr_size * 3;
+	BC_VECTOR *buf = safe_emalloc(allocate_size, sizeof(BC_VECTOR), 0);
+
+	BC_VECTOR *n_vector = buf;
+	/* In division by successive approximation, the numerator is modified during the computation,
+	 * so it must be copied each time. */
+	BC_VECTOR *n_vector_copy = n_vector + n_arr_size;
+	BC_VECTOR *guess_vector = n_vector_copy + n_arr_size;
+	BC_VECTOR *guess1_vector = guess_vector + guess_arr_size;
+	BC_VECTOR *tmp_div_ret_vector = guess1_vector + guess_arr_size;
+
+	/* convert num to n_vector */
+	size_t n_full_len = (*num)->n_len + (*num)->n_scale;
+	const char *nend = (*num)->n_value + n_full_len - 1;
+	size_t n_extend_zeros = num_calc_full_len - n_full_len;
+
+	bc_convert_to_vector_with_zero_pad(n_vector, nend, n_full_len, n_extend_zeros);
+
+	/* Prepare guess_vector (Temporary implementation) */
+	size_t guess_top_len = 0;
+	for (size_t i = 0; i < guess_arr_size - 2; i++) {
+		guess_vector[i] = BC_VECTOR_BOUNDARY_NUM - 1;
+	}
+	if (guess_full_len % BC_VECTOR_SIZE == 0) {
+		guess_vector[guess_arr_size - 2] = BC_VECTOR_BOUNDARY_NUM - 1;
 	} else {
-		/* The number is greater than 1.  Guess should start at 10^(exp/2). */
-		bc_init_num(&guess);
-		bc_int2num(&guess, 10);
-
-		bc_int2num(&guess1, (*num)->n_len);
-		bc_multiply_ex(guess1, point5, &guess1, 0);
-		guess1->n_scale = 0;
-		bc_raise_bc_exponent(guess, guess1, &guess, 0);
-		bc_free_num (&guess1);
-		cscale = 3;
+		guess_vector[guess_arr_size - 2] = 0;
+		for (size_t i = 0; i < guess_full_len % BC_VECTOR_SIZE; i++) {
+			guess_vector[guess_arr_size - 2] *= BASE;
+			guess_vector[guess_arr_size - 2] += 9;
+		}
 	}
+	guess_vector[guess_arr_size - 1] = 0;
 
-	bc_num guess1 = NULL;
-	bc_num point5 = bc_new_num (1, 1);
-	point5->n_value[1] = 5;
-	bc_num diff = NULL;
+	size_t quot_size = n_arr_size - (guess_arr_size - 1) + 1;
 
+	BC_VECTOR two[1] = { 2 };
+
+	/**
+	 * Newton's algorithm. Iterative expression is `x_{n+1} = (x_n + a / x_n) / 2`
+	 * If break down the calculation into detailed steps, it looks like this:
+	 * 1. quot = a / x_n
+	 * 2. add = x_n + quot1
+	 * 3. x_{n+1} = add / 2
+	 * 4. repeat until the difference between the `x_n` and `x_{n+1}` is less than or equal to 1.
+	 */
 	bool done = false;
-	while (!done) {
-		bc_free_num (&guess1);
-		guess1 = bc_copy_num(guess);
-		bc_divide(*num, guess, &guess, cscale);
-		bc_add_ex(guess, guess1, &guess, 0);
-		bc_multiply_ex(guess, point5, &guess, cscale);
-		bc_sub_ex(guess, guess1, &diff, cscale + 1);
-		if (bc_is_near_zero(diff, cscale)) {
-			if (cscale < rscale + 1) {
-				cscale = MIN (cscale * 3, rscale + 1);
+	do {
+		/* Since the value changes during division by successive approximation, use a copied version of it. */
+		for (size_t i = 0; i < n_arr_size; i++) {
+			n_vector_copy[i] = n_vector[i];
+		}
+
+		/* 1. quot = a / x_n */
+		bc_divide_vector(
+			n_vector_copy, n_arr_size,
+			guess_vector, guess_arr_size - 1, guess_full_len,
+			tmp_div_ret_vector, quot_size
+		);
+
+		BC_VECTOR *tmp_vptr = guess1_vector;
+		guess1_vector = guess_vector;
+		guess_vector = tmp_vptr;
+
+		/* 2. add = x_n + quot1 */
+		int carry = 0;
+		for (size_t i = 0; i < guess_arr_size - 1; i++) {
+			guess_vector[i] = guess1_vector[i] + tmp_div_ret_vector[i] + carry;
+			if (guess_vector[i] >= BC_VECTOR_BOUNDARY_NUM) {
+				guess_vector[i] -= BC_VECTOR_BOUNDARY_NUM;
+				carry = 1;
 			} else {
-				done = true;
+				carry = 0;
 			}
 		}
-	}
+		guess_vector[guess_arr_size - 1] = carry;
+
+		/* 3. x_{n+1} = add / 2 */
+		bc_divide_vector(
+			guess_vector, guess_arr_size,
+			two, 1, 1,
+			tmp_div_ret_vector, guess_arr_size
+		);
+
+		for (size_t i = 0; i < guess_arr_size; i++) {
+			guess_vector[i] = tmp_div_ret_vector[i];
+		}
+
+		/* 4. repeat until the difference between the `x_n` and `x_{n+1}` is less than or equal to 1. */
+		size_t diff = guess_vector[0] > guess1_vector[0] ? guess_vector[0] - guess1_vector[0] : guess1_vector[0] - guess_vector[0];
+		if (diff <= 1) {
+			bool is_same = true;
+			for (size_t i = 1; i < guess_arr_size - 1; i++) {
+				if (guess_vector[i] != guess1_vector[i]) {
+					is_same = false;
+					break;
+				}
+			}
+			done = is_same;
+		}
+	} while (!done);
 
-	/* Assign the number and clean up. */
-	bc_free_num (num);
-	bc_divide(guess, BCG(_one_), num, rscale);
-	bc_free_num (&guess);
-	bc_free_num (&guess1);
-	bc_free_num (&point5);
-	bc_free_num (&diff);
+	bc_num ret = bc_new_num_nonzeroed(guess_len, guess_scale);
+	char *rptr = ret->n_value;
+	char *rend = rptr + guess_full_len - 1;
+
+	bc_convert_vector_to_char(guess_vector, rptr, rend, guess_arr_size - 1);
+	ret->n_scale = rscale;
+
+	bc_free_num(num);
+	*num = ret;
+
+	efree(buf);
 }
 
 bool bc_sqrt(bc_num *num, size_t scale)
@@ -185,8 +260,7 @@ bool bc_sqrt(bc_num *num, size_t scale)
 	if (num_calc_full_len < MAX_LENGTH_OF_LONG) {
 		bc_fast_sqrt(num, rscale);
 	} else {
-		bc_standard_sqrt(num, rscale, num_cmp_one);
+		bc_standard_sqrt(num, rscale, num_calc_full_len);
 	}
-
 	return true;
 }