Lines Matching refs:a
14 int BN_lshift1(BIGNUM *r, const BIGNUM *a) in BN_lshift1() argument
20 bn_check_top(a); in BN_lshift1()
22 if (r != a) { in BN_lshift1()
23 r->neg = a->neg; in BN_lshift1()
24 if (bn_wexpand(r, a->top + 1) == NULL) in BN_lshift1()
26 r->top = a->top; in BN_lshift1()
28 if (bn_wexpand(r, a->top + 1) == NULL) in BN_lshift1()
31 ap = a->d; in BN_lshift1()
34 for (i = 0; i < a->top; i++) { in BN_lshift1()
45 int BN_rshift1(BIGNUM *r, const BIGNUM *a) in BN_rshift1() argument
51 bn_check_top(a); in BN_rshift1()
53 if (BN_is_zero(a)) { in BN_rshift1()
57 i = a->top; in BN_rshift1()
58 ap = a->d; in BN_rshift1()
59 if (a != r) { in BN_rshift1()
62 r->neg = a->neg; in BN_rshift1()
81 int BN_lshift(BIGNUM *r, const BIGNUM *a, int n) in BN_lshift() argument
90 ret = bn_lshift_fixed_top(r, a, n); in BN_lshift()
104 int bn_lshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n) in bn_lshift_fixed_top() argument
114 bn_check_top(a); in bn_lshift_fixed_top()
117 if (bn_wexpand(r, a->top + nw + 1) == NULL) in bn_lshift_fixed_top()
120 if (a->top != 0) { in bn_lshift_fixed_top()
126 f = &(a->d[0]); in bn_lshift_fixed_top()
128 l = f[a->top - 1]; in bn_lshift_fixed_top()
129 t[a->top] = (l >> rb) & rmask; in bn_lshift_fixed_top()
130 for (i = a->top - 1; i > 0; i--) { in bn_lshift_fixed_top()
143 r->neg = a->neg; in bn_lshift_fixed_top()
144 r->top = a->top + nw + 1; in bn_lshift_fixed_top()
150 int BN_rshift(BIGNUM *r, const BIGNUM *a, int n) in BN_rshift() argument
159 ret = bn_rshift_fixed_top(r, a, n); in BN_rshift()
173 int bn_rshift_fixed_top(BIGNUM *r, const BIGNUM *a, int n) in bn_rshift_fixed_top() argument
181 bn_check_top(a); in bn_rshift_fixed_top()
186 if (nw >= a->top) { in bn_rshift_fixed_top()
197 top = a->top - nw; in bn_rshift_fixed_top()
198 if (r != a && bn_wexpand(r, top) == NULL) in bn_rshift_fixed_top()
202 f = &(a->d[nw]); in bn_rshift_fixed_top()
211 r->neg = a->neg; in bn_rshift_fixed_top()
