Lines Matching refs:top
281 (dest)->top=(b)->top, \
303 int top; /* Index of last used d +1. */
387 #define BN_abs_is_word(a,w) ((((a)->top == 1) && ((a)->d[0] == (BN_ULONG)(w))) || \
388 (((w) == 0) && ((a)->top == 0)))
389 #define BN_is_zero(a) ((a)->top == 0)
392 #define BN_is_odd(a) (((a)->top > 0) && ((a)->d[0] & 1))
398 _tmp_bn->top = 0; \
417 int BN_rand(BIGNUM *rnd, int bits, int top,int bottom);
418 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top,int bottom);
684 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is
714 if(_bnum1->top < _bnum1->dmax) { \
718 * wouldn't be constructed with top!=dmax. */ \
722 memset((unsigned char *)(_not_const + _bnum1->top), _tmp_char, \
723 (_bnum1->dmax - _bnum1->top) * sizeof(BN_ULONG)); \
736 assert((_bnum2->top == 0) || \
737 (_bnum2->d[_bnum2->top - 1] != 0)); \
755 int tmp_top = (a)->top; \
760 (a)->top = tmp_top; \
784 int BN_bntest_rand(BIGNUM *rnd, int bits, int top,int bottom);
