Comments

Author: jorgsowa

ext/bcmath/libbcmath/src/recmul.c

@@ -190,11 +190,6 @@ static void bc_standard_square(bc_num n1, size_t n1len, bc_num *prod)
 	size_t n1_arr_size = (n1len + BC_VECTOR_SIZE - 1) / BC_VECTOR_SIZE;
 	size_t prod_arr_size = (prodlen + BC_VECTOR_SIZE - 1) / BC_VECTOR_SIZE;
 
-	/*
-	 * let's say that N is the max of n1len and n2len (and a multiple of BC_VECTOR_SIZE for simplicity),
-	 * then this sum is <= N/BC_VECTOR_SIZE + N/BC_VECTOR_SIZE + N/BC_VECTOR_SIZE + N/BC_VECTOR_SIZE - 1
-	 * which is equal to N - 1 if BC_VECTOR_SIZE is 4, and N/2 - 1 if BC_VECTOR_SIZE is 8.
-	 */
 	BC_VECTOR *buf = safe_emalloc(n1_arr_size + n1_arr_size + prod_arr_size, sizeof(BC_VECTOR), 0);
 
 	BC_VECTOR *n1_vector = buf;
@@ -301,7 +296,7 @@ bc_num bc_square(bc_num n1, size_t scale)
 	size_t full_scale = n1->n_scale + n1->n_scale;
 	size_t prod_scale = MIN(full_scale, MAX(scale, n1->n_scale));
 
-	/* Do the multiply */
+	/* Do the square */
 	if (len1 <= BC_VECTOR_SIZE) {
 		bc_fast_square(n1, len1, &prod);
 	} else {