| /src/crypto/external/apache2/openssl/dist/crypto/bn/ |
| bn_shift.c | 37 c = t >> (BN_BITS2 - 1);
68 c = t << (BN_BITS2 - 1);
73 c = t << (BN_BITS2 - 1);
100 * |n % BN_BITS2|, but not |n / BN_BITS2|. Or in other words pre-condition
101 * for constant-time-ness is |n < BN_BITS2| or |n / BN_BITS2| being
116 nw = n / BN_BITS2;
121 lb = (unsigned int)n % BN_BITS2;
122 rb = BN_BITS2 - lb
[all...] |
| bn_div.c | 98 #if BN_BITS2 == 64 && defined(__SIZEOF_INT128__) && __SIZEOF_INT128__ == 16
117 BN_ULLONG R = ((BN_ULLONG)m[0] << BN_BITS2) | m[-1];
118 BN_ULLONG D = ((BN_ULLONG)d0 << BN_BITS2) | d1;
122 for (i = 0; i < BN_BITS2; i++) {
131 mask = 0 - (Q >> (BN_BITS2 - 1)); /* does it overflow? */
147 lshift = BN_BITS2 - rshift;
148 rshift %= BN_BITS2; /* say no to undefined behaviour */
168 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
362 q = (BN_ULONG)(((((BN_ULLONG)n0) << BN_BITS2) | n1) / d0);
377 if (t2 <= ((((BN_ULLONG)rem) << BN_BITS2) | n2)
[all...] |
| bn_lib.c | 106 #if BN_BITS2 > 32
109 mask = (0 - (mask >> (BN_BITS2 - 1)));
116 mask = (0 - (mask >> (BN_BITS2 - 1)));
122 mask = (0 - (mask >> (BN_BITS2 - 1)));
128 mask = (0 - (mask >> (BN_BITS2 - 1)));
134 mask = (0 - (mask >> (BN_BITS2 - 1)));
140 mask = (0 - (mask >> (BN_BITS2 - 1)));
163 ret += BN_BITS2 & (~mask & ~past_i);
199 return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
268 if (words > (INT_MAX / (4 * BN_BITS2))) {
[all...] |
| bn_nist.c | 13 #define BN_NIST_192_TOP (192 + BN_BITS2 - 1) / BN_BITS2
14 #define BN_NIST_224_TOP (224 + BN_BITS2 - 1) / BN_BITS2
15 #define BN_NIST_256_TOP (256 + BN_BITS2 - 1) / BN_BITS2
16 #define BN_NIST_384_TOP (384 + BN_BITS2 - 1) / BN_BITS2
17 #define BN_NIST_521_TOP (521 + BN_BITS2 - 1) / BN_BITS2
[all...] |
| bn_print.c | 41 for (j = BN_BITS2 - 4; j >= 0; j -= 4) {
|
| bn_local.h | 210 #define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits + BN_BITS2 - 1)) / BN_BITS2)
242 * Pointer to an array of 'BN_BITS2' bit
474 #define Hw(t) (((BN_ULONG)((t) >> BN_BITS2)) & BN_MASK2)
573 #define LHBITS(a) (((a) >> BN_BITS2) & BN_MASKl)
574 #define LL2HBITS(a) ((BN_ULLONG)((a) & BN_MASKl) << BN_BITS2)
681 if (bits > (INT_MAX - BN_BITS2 + 1))
684 if (((bits + BN_BITS2 - 1) / BN_BITS2) <= (a)->dmax)
687 return bn_expand2((a), (bits + BN_BITS2 - 1) / BN_BITS2)
[all...] |
| bn_mont.c | 121 * Add multiples of |n| to |r| until R = 2^(nl * BN_BITS2) divides it. On
292 mont->ri = (BN_num_bits(mod) + (BN_BITS2 - 1)) / BN_BITS2 * BN_BITS2;
294 #if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2 <= 32)
296 * Only certain BN_BITS2<=32 platforms actually make use of n0[1],
303 if (!(BN_set_bit(R, 2 * BN_BITS2)))
316 if (!BN_lshift(Ri, Ri, 2 * BN_BITS2))
340 if (!(BN_set_bit(R, BN_BITS2)))
351 if (!BN_lshift(Ri, Ri, BN_BITS2))
[all...] |
| bn_gf2m.c | 47 * Product of two polynomials a, b each with degree < BN_BITS2 - 1, result is
219 * Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
220 * result is a polynomial r with degree < 4 * BN_BITS2 - 1 The caller MUST
313 dN = p[0] / BN_BITS2;
325 d0 = n % BN_BITS2;
326 d1 = BN_BITS2 - d0;
327 n /= BN_BITS2;
335 d0 = p[0] % BN_BITS2;
336 d1 = BN_BITS2 - d0;
345 d0 = p[0] % BN_BITS2;
[all...] |
| bn_word.c | 54 ret = (BN_ULLONG)(((ret << (BN_ULLONG)BN_BITS2) | a->d[i]) % (BN_ULLONG)w);
75 j = BN_BITS2 - BN_num_bits_word(w);
|
| /src/crypto/external/bsd/openssl/dist/crypto/bn/ |
| bn_shift.c | 37 c = t >> (BN_BITS2 - 1);
68 c = t << (BN_BITS2 - 1);
73 c = t << (BN_BITS2 - 1);
100 * |n % BN_BITS2|, but not |n / BN_BITS2|. Or in other words pre-condition
101 * for constant-time-ness is |n < BN_BITS2| or |n / BN_BITS2| being
116 nw = n / BN_BITS2;
121 lb = (unsigned int)n % BN_BITS2;
122 rb = BN_BITS2 - lb
[all...] |
| bn_div.c | 98 # if BN_BITS2 == 64 && defined(__SIZEOF_INT128__) && __SIZEOF_INT128__==16
117 BN_ULLONG R = ((BN_ULLONG)m[0] << BN_BITS2) | m[-1];
118 BN_ULLONG D = ((BN_ULLONG)d0 << BN_BITS2) | d1;
122 for (i = 0; i < BN_BITS2; i++) {
131 mask = 0 - (Q >> (BN_BITS2 - 1)); /* does it overflow? */
147 lshift = BN_BITS2 - rshift;
148 rshift %= BN_BITS2; /* say no to undefined behaviour */
168 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
360 q = (BN_ULONG)(((((BN_ULLONG) n0) << BN_BITS2) | n1) / d0);
375 if (t2 <= ((((BN_ULLONG) rem) << BN_BITS2) | n2)
[all...] |
| bn_lib.c | 105 #if BN_BITS2 > 32
108 mask = (0 - (mask >> (BN_BITS2 - 1)));
115 mask = (0 - (mask >> (BN_BITS2 - 1)));
121 mask = (0 - (mask >> (BN_BITS2 - 1)));
127 mask = (0 - (mask >> (BN_BITS2 - 1)));
133 mask = (0 - (mask >> (BN_BITS2 - 1)));
139 mask = (0 - (mask >> (BN_BITS2 - 1)));
163 ret += BN_BITS2 & (~mask & ~past_i);
199 return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
270 if (words > (INT_MAX / (4 * BN_BITS2))) {
[all...] |
| bn_mont.c | 121 * Add multiples of |n| to |r| until R = 2^(nl * BN_BITS2) divides it. On
294 mont->ri = (BN_num_bits(mod) + (BN_BITS2 - 1)) / BN_BITS2 * BN_BITS2;
296 # if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)
298 * Only certain BN_BITS2<=32 platforms actually make use of n0[1],
305 if (!(BN_set_bit(R, 2 * BN_BITS2)))
318 if (!BN_lshift(Ri, Ri, 2 * BN_BITS2))
342 if (!(BN_set_bit(R, BN_BITS2)))
353 if (!BN_lshift(Ri, Ri, BN_BITS2))
[all...] |
| bn_nist.c | 13 #define BN_NIST_192_TOP (192+BN_BITS2-1)/BN_BITS2
14 #define BN_NIST_224_TOP (224+BN_BITS2-1)/BN_BITS2
15 #define BN_NIST_256_TOP (256+BN_BITS2-1)/BN_BITS2
16 #define BN_NIST_384_TOP (384+BN_BITS2-1)/BN_BITS2
17 #define BN_NIST_521_TOP (521+BN_BITS2-1)/BN_BITS2
[all...] |
| bn_print.c | 41 for (j = BN_BITS2 - 4; j >= 0; j -= 4) {
|
| bn_local.h | 214 # define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)
246 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit
478 # define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
568 # define LHBITS(a) (((a)>>BN_BITS2)&BN_MASKl)
569 # define LL2HBITS(a) ((BN_ULLONG)((a)&BN_MASKl)<<BN_BITS2)
668 if (bits > (INT_MAX - BN_BITS2 + 1))
671 if (((bits+BN_BITS2-1)/BN_BITS2) <= (a)->dmax)
674 return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2)
[all...] |
| bn_gf2m.c | 56 * Product of two polynomials a, b each with degree < BN_BITS2 - 1, result is
228 * Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
229 * result is a polynomial r with degree < 4 * BN_BITS2 - 1 The caller MUST
322 dN = p[0] / BN_BITS2;
334 d0 = n % BN_BITS2;
335 d1 = BN_BITS2 - d0;
336 n /= BN_BITS2;
344 d0 = p[0] % BN_BITS2;
345 d1 = BN_BITS2 - d0;
354 d0 = p[0] % BN_BITS2;
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/bn/ |
| bn_shift.c | 37 c = t >> (BN_BITS2 - 1);
68 c = t << (BN_BITS2 - 1);
73 c = t << (BN_BITS2 - 1);
100 * |n % BN_BITS2|, but not |n / BN_BITS2|. Or in other words pre-condition
101 * for constant-time-ness is |n < BN_BITS2| or |n / BN_BITS2| being
116 nw = n / BN_BITS2;
121 lb = (unsigned int)n % BN_BITS2;
122 rb = BN_BITS2 - lb
[all...] |
| bn_div.c | 98 # if BN_BITS2 == 64 && defined(__SIZEOF_INT128__) && __SIZEOF_INT128__==16
117 BN_ULLONG R = ((BN_ULLONG)m[0] << BN_BITS2) | m[-1];
118 BN_ULLONG D = ((BN_ULLONG)d0 << BN_BITS2) | d1;
122 for (i = 0; i < BN_BITS2; i++) {
131 mask = 0 - (Q >> (BN_BITS2 - 1)); /* does it overflow? */
147 lshift = BN_BITS2 - rshift;
148 rshift %= BN_BITS2; /* say no to undefined behaviour */
168 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
360 q = (BN_ULONG)(((((BN_ULLONG) n0) << BN_BITS2) | n1) / d0);
375 if (t2 <= ((((BN_ULLONG) rem) << BN_BITS2) | n2)
[all...] |
| bn_lib.c | 104 #if BN_BITS2 > 32
107 mask = (0 - (mask >> (BN_BITS2 - 1)));
114 mask = (0 - (mask >> (BN_BITS2 - 1)));
120 mask = (0 - (mask >> (BN_BITS2 - 1)));
126 mask = (0 - (mask >> (BN_BITS2 - 1)));
132 mask = (0 - (mask >> (BN_BITS2 - 1)));
138 mask = (0 - (mask >> (BN_BITS2 - 1)));
162 ret += BN_BITS2 & (~mask & ~past_i);
198 return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
269 if (words > (INT_MAX / (4 * BN_BITS2))) {
[all...] |
| bn_gf2m.c | 55 * Product of two polynomials a, b each with degree < BN_BITS2 - 1, result is
227 * Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
228 * result is a polynomial r with degree < 4 * BN_BITS2 - 1 The caller MUST
321 dN = p[0] / BN_BITS2;
333 d0 = n % BN_BITS2;
334 d1 = BN_BITS2 - d0;
335 n /= BN_BITS2;
343 d0 = p[0] % BN_BITS2;
344 d1 = BN_BITS2 - d0;
353 d0 = p[0] % BN_BITS2;
[all...] |
| bn_mont.c | 121 * Add multiples of |n| to |r| until R = 2^(nl * BN_BITS2) divides it. On
294 mont->ri = (BN_num_bits(mod) + (BN_BITS2 - 1)) / BN_BITS2 * BN_BITS2;
296 # if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)
298 * Only certain BN_BITS2<=32 platforms actually make use of n0[1],
305 if (!(BN_set_bit(R, 2 * BN_BITS2)))
318 if (!BN_lshift(Ri, Ri, 2 * BN_BITS2))
342 if (!(BN_set_bit(R, BN_BITS2)))
353 if (!BN_lshift(Ri, Ri, BN_BITS2))
[all...] |
| bn_nist.c | 13 #define BN_NIST_192_TOP (192+BN_BITS2-1)/BN_BITS2
14 #define BN_NIST_224_TOP (224+BN_BITS2-1)/BN_BITS2
15 #define BN_NIST_256_TOP (256+BN_BITS2-1)/BN_BITS2
16 #define BN_NIST_384_TOP (384+BN_BITS2-1)/BN_BITS2
17 #define BN_NIST_521_TOP (521+BN_BITS2-1)/BN_BITS2
[all...] |
| bn_local.h | 207 # define bn_check_size(bn, bits) bn_wcheck_size(bn, ((bits+BN_BITS2-1))/BN_BITS2)
239 BN_ULONG *d; /* Pointer to an array of 'BN_BITS2' bit
503 # define Hw(t) (((BN_ULONG)((t)>>BN_BITS2))&BN_MASK2)
593 # define LHBITS(a) (((a)>>BN_BITS2)&BN_MASKl)
594 # define LL2HBITS(a) ((BN_ULLONG)((a)&BN_MASKl)<<BN_BITS2)
693 if (bits > (INT_MAX - BN_BITS2 + 1))
696 if (((bits+BN_BITS2-1)/BN_BITS2) <= (a)->dmax)
699 return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2)
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/test/ |
| exptest.c | 23 #define NUM_BITS (BN_BITS2 * 4)
177 c = (c % BN_BITS) - BN_BITS2;
181 c = (c % BN_BITS) - BN_BITS2;
185 c = (c % BN_BITS) - BN_BITS2;
|
