Searched refs:div_n (Results 1 – 1 of 1) sorted by relevance
271 int num_n, div_n, num_neg; in bn_div_fixed_top() local303 div_n = sdiv->top; in bn_div_fixed_top()306 if (num_n <= div_n) { in bn_div_fixed_top()308 if (bn_wexpand(snum, div_n + 1) == NULL) in bn_div_fixed_top()311 snum->top = num_n = div_n + 1; in bn_div_fixed_top()314 loop = num_n - div_n; in bn_div_fixed_top()323 d0 = sdiv->d[div_n - 1]; in bn_div_fixed_top()324 d1 = (div_n == 1) ? 0 : sdiv->d[div_n - 2]; in bn_div_fixed_top()336 if (!bn_wexpand(tmp, (div_n + 1))) in bn_div_fixed_top()423 tmp->d[div_n] = l0; in bn_div_fixed_top()[all …]
Completed in 4 milliseconds
