Searched refs:dmax (Results 1 – 10 of 10) sorted by relevance
161 for (j = 0, past_i = 0, ret = 0; j < a->dmax; j++) { in bn_num_bits_consttime()208 OPENSSL_clear_free(a->d, a->dmax * sizeof(a->d[0])); in bn_free_d()301 if (words > b->dmax) { in bn_expand2()308 b->dmax = words; in bn_expand2()376 tmp_dmax = a->dmax; in BN_swap()381 a->dmax = b->dmax; in BN_swap()386 b->dmax = tmp_dmax; in BN_swap()401 OPENSSL_cleanse(a->d, sizeof(*a->d) * a->dmax); in BN_clear()591 atop = a->dmax * BN_BYTES; in bn2binpad()1087 dest->dmax = b->dmax; in BN_with_flags()[all …]
144 return a->dmax; in bn_get_dmax()151 for (i = a->top; i < a->dmax; i++) in bn_set_all_zero()178 a->dmax = a->top = size; in bn_set_static_words()
84 ai += (i - a->dmax) >> (8 * sizeof(i) - 1); in bn_mod_add_fixed_top()85 bi += (i - b->dmax) >> (8 * sizeof(i) - 1); in bn_mod_add_fixed_top()161 ai += (i - a->dmax) >> (8 * sizeof(i) - 1); in bn_mod_sub_fixed_top()162 bi += (i - b->dmax) >> (8 * sizeof(i) - 1); in bn_mod_sub_fixed_top()
185 if (_bnum1->top < _bnum1->dmax) { \194 sizeof(*_not_const) * (_bnum1->dmax - _bnum1->top)); \218 assert((words) <= (_bnum2)->dmax && \253 int dmax; /* Size of the d array. */ member467 int ind = (a)->dmax - (a)->top; \674 if (((bits+BN_BITS2-1)/BN_BITS2) <= (a)->dmax) in bn_expand()
92 item->vals[bnidx++ % BN_CTX_POOL_SIZE].dmax); in ctxdbg()168 BIO_printf(trc_out, "%02x ", pool->vals[loop++].dmax); in BN_CTX_free()
80 int dmax; /* Size of the d array. */91 B<dmax> is the size of the B<d> array that has been allocated. B<top>216 E<lt>= (a)-E<gt>dmax)>. A violation will cause the program to abort.221 bn_set_max() makes B<a> a static number with a B<dmax> of its current size.
618 for (i = 0; i < r->dmax && i < g->dmax; i++) { in BN_gcd()
179 if (n->dmax >= r->top) { in BN_BLINDING_invert_ex()
286 tmod.dmax = 2; in BN_MONT_CTX_set()
761 tmp.dmax = am.dmax = top; in BN_mod_exp_mont_consttime()
Completed in 41 milliseconds
