Home
last modified time | relevance | path

Searched refs:BN_ULLONG (Results 1 - 10 of 10) sorted by relevance

/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_div.c99 # undef BN_ULLONG macro
100 # define BN_ULLONG uint128_t macro
117 BN_ULLONG R = ((BN_ULLONG)m[0] << BN_BITS2) | m[-1]; in bn_div_3_words()
118 BN_ULLONG D = ((BN_ULLONG)d0 << BN_BITS2) | d1; in bn_div_3_words()
168 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
357 BN_ULLONG t2; in bn_div_fixed_top()
360 q = (BN_ULONG)(((((BN_ULLONG) n0) << BN_BITS2) | n1) / d0); in bn_div_fixed_top()
367 * rem doesn't have to be BN_ULLONG in bn_div_fixed_top()
[all...]
H A Dbn_local.h92 # define BN_ULLONG unsigned long long macro
109 # undef BN_ULLONG macro
124 # define BN_ULLONG unsigned __int64 macro
126 # define BN_ULLONG unsigned long long macro
481 BN_ULLONG t; \
482 t=(BN_ULLONG)w * (a) + (r) + (c); \
488 BN_ULLONG t; \
489 t=(BN_ULLONG)w * (a) + (c); \
495 BN_ULLONG t; \
496 t=(BN_ULLONG)(
[all...]
H A Dbn_word.c18 BN_ULLONG ret = 0; in BN_mod_word()
27 * If |w| is too long and we don't have BN_ULLONG then we need to fall in BN_mod_word()
54 ret = (BN_ULLONG) (((ret << (BN_ULLONG) BN_BITS2) | a->d[i]) % in BN_mod_word()
55 (BN_ULLONG) w); in BN_mod_word()
H A Dbn_asm.c200 return ((BN_ULONG)(((((BN_ULLONG) h) << BN_BITS2) | l) / (BN_ULLONG) d)); in bn_div_words()
275 BN_ULLONG ll = 0; in bn_add_words()
283 ll += (BN_ULLONG) a[0] + b[0]; in bn_add_words()
286 ll += (BN_ULLONG) a[1] + b[1]; in bn_add_words()
289 ll += (BN_ULLONG) a[2] + b[2]; in bn_add_words()
292 ll += (BN_ULLONG) a[3] + b[3]; in bn_add_words()
302 ll += (BN_ULLONG) a[0] + b[0]; in bn_add_words()
455 BN_ULLONG t = (BN_ULLONG)(
[all...]
H A Dbn_print.c65 sizeof(BN_ULLONG) * 8, sizeof(BN_ULONG) * 8); in BN_options()
/third_party/openssl/crypto/bn/
H A Dbn_div.c99 # undef BN_ULLONG macro
100 # define BN_ULLONG uint128_t macro
117 BN_ULLONG R = ((BN_ULLONG)m[0] << BN_BITS2) | m[-1]; in bn_div_3_words()
118 BN_ULLONG D = ((BN_ULLONG)d0 << BN_BITS2) | d1; in bn_div_3_words()
168 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
357 BN_ULLONG t2; in bn_div_fixed_top()
360 q = (BN_ULONG)(((((BN_ULLONG) n0) << BN_BITS2) | n1) / d0); in bn_div_fixed_top()
367 * rem doesn't have to be BN_ULLONG in bn_div_fixed_top()
[all...]
H A Dbn_local.h92 # define BN_ULLONG unsigned long long macro
109 # undef BN_ULLONG macro
124 # define BN_ULLONG unsigned __int64 macro
126 # define BN_ULLONG unsigned long long macro
481 BN_ULLONG t; \
482 t=(BN_ULLONG)w * (a) + (r) + (c); \
488 BN_ULLONG t; \
489 t=(BN_ULLONG)w * (a) + (c); \
495 BN_ULLONG t; \
496 t=(BN_ULLONG)(
[all...]
H A Dbn_word.c18 BN_ULLONG ret = 0; in BN_mod_word()
27 * If |w| is too long and we don't have BN_ULLONG then we need to fall in BN_mod_word()
54 ret = (BN_ULLONG) (((ret << (BN_ULLONG) BN_BITS2) | a->d[i]) % in BN_mod_word()
55 (BN_ULLONG) w); in BN_mod_word()
H A Dbn_asm.c200 return ((BN_ULONG)(((((BN_ULLONG) h) << BN_BITS2) | l) / (BN_ULLONG) d)); in bn_div_words()
275 BN_ULLONG ll = 0; in bn_add_words()
283 ll += (BN_ULLONG) a[0] + b[0]; in bn_add_words()
286 ll += (BN_ULLONG) a[1] + b[1]; in bn_add_words()
289 ll += (BN_ULLONG) a[2] + b[2]; in bn_add_words()
292 ll += (BN_ULLONG) a[3] + b[3]; in bn_add_words()
302 ll += (BN_ULLONG) a[0] + b[0]; in bn_add_words()
455 BN_ULLONG t = (BN_ULLONG)(
[all...]
H A Dbn_print.c65 sizeof(BN_ULLONG) * 8, sizeof(BN_ULONG) * 8); in BN_options()

Completed in 7 milliseconds