Searched refs:num_n (Results 1 – 3 of 3) sorted by relevance
291 size_t num_n = mont->N.width; in bn_from_montgomery_in_place() local292 if (num_r != num_n || num_a != 2 * num_n) { in bn_from_montgomery_in_place()302 for (size_t i = 0; i < num_n; i++) { in bn_from_montgomery_in_place()303 BN_ULONG v = bn_mul_add_words(a + i, n, num_n, a[i] * n0); in bn_from_montgomery_in_place()304 v += carry + a[i + num_n]; in bn_from_montgomery_in_place()305 carry |= (v != a[i + num_n]); in bn_from_montgomery_in_place()306 carry &= (v <= a[i + num_n]); in bn_from_montgomery_in_place()307 a[i + num_n] = v; in bn_from_montgomery_in_place()312 a += num_n; in bn_from_montgomery_in_place()315 bn_reduce_once(r, a, carry, n, num_n); in bn_from_montgomery_in_place()
201 int num_n, div_n; in BN_div() local270 num_n = snum->width; in BN_div()271 loop = num_n - div_n; in BN_div()287 wnump = &(snum->d[num_n - 1]); in BN_div()
2031 #define M_CP_STRARRAYOPT(n, num_n) do {\ in copy_set_server_options() argument2032 if (src->num_n != 0) { \ in copy_set_server_options()2033 for (dst->num_n = 0; dst->num_n < src->num_n; dst->num_n++) \ in copy_set_server_options()2034 dst->n[dst->num_n] = xstrdup(src->n[dst->num_n]); \ in copy_set_server_options()