Lines Matching refs:w
13 BN_ULONG BN_mod_word(const BIGNUM *a, BN_ULONG w) in BN_mod_word() argument
22 if (w == 0) in BN_mod_word()
30 if (w > ((BN_ULONG)1 << BN_BITS4)) { in BN_mod_word()
35 ret = BN_div_word(tmp, w); in BN_mod_word()
43 w &= BN_MASK2; in BN_mod_word()
51 ret = ((ret << BN_BITS4) | ((a->d[i] >> BN_BITS4) & BN_MASK2l)) % w; in BN_mod_word()
52 ret = ((ret << BN_BITS4) | (a->d[i] & BN_MASK2l)) % w; in BN_mod_word()
55 (BN_ULLONG) w); in BN_mod_word()
61 BN_ULONG BN_div_word(BIGNUM *a, BN_ULONG w) in BN_div_word() argument
67 w &= BN_MASK2; in BN_div_word()
69 if (!w) in BN_div_word()
76 j = BN_BITS2 - BN_num_bits_word(w); in BN_div_word()
77 w <<= j; in BN_div_word()
85 d = bn_div_words(ret, l, w); in BN_div_word()
86 ret = (l - ((d * w) & BN_MASK2)) & BN_MASK2; in BN_div_word()
98 int BN_add_word(BIGNUM *a, BN_ULONG w) in BN_add_word() argument
104 w &= BN_MASK2; in BN_add_word()
107 if (!w) in BN_add_word()
111 return BN_set_word(a, w); in BN_add_word()
115 i = BN_sub_word(a, w); in BN_add_word()
120 for (i = 0; w != 0 && i < a->top; i++) { in BN_add_word()
121 a->d[i] = l = (a->d[i] + w) & BN_MASK2; in BN_add_word()
122 w = (w > l) ? 1 : 0; in BN_add_word()
124 if (w && i == a->top) { in BN_add_word()
128 a->d[i] = w; in BN_add_word()
134 int BN_sub_word(BIGNUM *a, BN_ULONG w) in BN_sub_word() argument
139 w &= BN_MASK2; in BN_sub_word()
142 if (!w) in BN_sub_word()
146 i = BN_set_word(a, w); in BN_sub_word()
154 i = BN_add_word(a, w); in BN_sub_word()
159 if ((a->top == 1) && (a->d[0] < w)) { in BN_sub_word()
160 a->d[0] = w - a->d[0]; in BN_sub_word()
166 if (a->d[i] >= w) { in BN_sub_word()
167 a->d[i] -= w; in BN_sub_word()
170 a->d[i] = (a->d[i] - w) & BN_MASK2; in BN_sub_word()
172 w = 1; in BN_sub_word()
181 int BN_mul_word(BIGNUM *a, BN_ULONG w) in BN_mul_word() argument
186 w &= BN_MASK2; in BN_mul_word()
188 if (w == 0) in BN_mul_word()
191 ll = bn_mul_words(a->d, a->d, a->top, w); in BN_mul_word()