| /src/external/lgpl3/gmp/dist/tests/cxx/ |
| t-cast.cc | 35 mp_limb_t limb; local
44 limb = GMP_NUMB_MASK;
45 limb = GMP_NUMB_MAX;
46 limb = GMP_NAIL_MASK;
48 mpn_divmod (&limb, &limb, 1, &limb, 1);
49 mpn_divexact_by3 (&limb, &limb, 1);
|
| /src/external/lgpl3/gmp/dist/mpz/ |
| fits_s.h | 39 mp_limb_t limb = p[0]; variable
44 return limb <= MAXIMUM;
46 return limb <= NEG_CAST (mp_limb_t, MINIMUM);
51 limb += p[1] << GMP_NUMB_BITS;
53 return limb <= MAXIMUM;
55 return limb <= NEG_CAST (mp_limb_t, MINIMUM);
|
| scan1.c | 37 (except when in the high limb), but usually the search won't go very far
49 mp_limb_t limb; variable
61 limb = *p;
66 limb &= (MP_LIMB_T_MAX << (starting_bit % GMP_NUMB_BITS));
68 if (limb == 0)
70 /* If it's the high limb which is zero after masking, then there's
75 /* Otherwise search further for a non-zero limb. The high limb is
83 limb = *p;
85 while (limb == 0)
[all...] |
| scan0.c | 49 mp_limb_t limb; variable
57 limb = *p;
62 limb |= (CNST_LIMB(1) << (starting_bit % GMP_NUMB_BITS)) - 1;
64 /* Search for a limb which isn't all ones. If the end is reached then
66 while (limb == GMP_NUMB_MAX)
71 limb = *p;
75 limb = ~limb;
81 /* If there's a non-zero limb before ours then we're in the ones
93 /* Adjust so ~limb implied by searching for 1 bit below becomes -limb
[all...] |
| tstbit.c | 35 limb tested, either with a ones or twos complement. Twos complement
38 is correct even if the limb examined is 0 (and the true beginning of twos
44 non-zero limb is perhaps a touch more likely in the middle of a number
58 mp_limb_t limb; variable
63 limb = *p;
66 limb = -limb; /* twos complement */
73 limb--; /* make it a ones complement instead */
79 return (limb >> (bit_index % GMP_NUMB_BITS)) & 1;
|
| inp_raw.c | 35 /* NTOH_LIMB_FETCH fetches a limb which is in network byte order (ie. big
39 #define NTOH_LIMB_FETCH(limb, src) do { (limb) = *(src); } while (0)
43 #define NTOH_LIMB_FETCH(limb, src) BSWAP_LIMB_FETCH (limb, src)
47 #define NTOH_LIMB_FETCH(limb, src) \
55 (limb) = __limb; \
101 /* Get limb boundaries right in the read, for the benefit of the
128 mp_limb_t byte, limb; local
136 limb = 0
[all...] |
| import.c | 100 mp_limb_t limb, byte, wbitsmask; local
127 ASSERT (limb <= (CNST_LIMB(1) << lbits) - 1); \
129 limb |= (mp_limb_t) byte << lbits; \
133 *zp++ = limb & GMP_NUMB_MASK; \
136 limb = byte >> ((N) - lbits); \
140 limb = 0;
162 ASSERT_LIMB (limb);
163 *zp++ = limb;
|
| /src/external/lgpl3/mpfr/dist/src/ |
| int_ceil_log2.c | 35 mp_limb_t limb; local
38 limb = n - 1;
39 MPFR_ASSERTN (limb == n - 1);
40 count_leading_zeros (b, limb);
|
| set_uj.c | 42 mp_limb_t limb; local
68 limb = j;
69 count_leading_zeros(cnt, limb);
70 /* Normalize the most significant limb */
71 yp[0] = limb << cnt;
82 /* Find the first limb not equal to zero. */
86 limb = yp[--k];
88 while (limb == 0);
91 count_leading_zeros(cnt, limb);
96 mpn_lshift (yp+len, yp, k, cnt); /* Normalize the high limb */
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/ec/curve448/arch_64/ |
| f_impl.h | 31 out->limb[i] = a->limb[i] + b->limb[i];
42 out->limb[i] = a->limb[i] - b->limb[i] + ((i == NLIMBS / 2) ? co2 : co1);
54 uint64_t tmp = a->limb[NLIMBS - 1] >> 56;
57 a->limb[NLIMBS / 2] += tmp;
59 a->limb[i] = (a->limb[i] & mask) + (a->limb[i - 1] >> 56)
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/ec/curve448/arch_64/ |
| f_impl.h | 26 out->limb[i] = a->limb[i] + b->limb[i];
37 out->limb[i] = a->limb[i] - b->limb[i] + ((i == NLIMBS / 2) ? co2 : co1);
49 uint64_t tmp = a->limb[NLIMBS - 1] >> 56;
52 a->limb[NLIMBS / 2] += tmp;
54 a->limb[i] = (a->limb[i] & mask) + (a->limb[i - 1] >> 56)
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/ec/curve448/arch_32/ |
| f_impl.h | 17 #define LIMB(x) ((x) & ((1 << 28) - 1)), ((x) >> 28)
21 LIMB(a), LIMB(b), LIMB(c), LIMB(d), LIMB(e), LIMB(f), LIMB(g), LIMB(h) \
32 out->limb[i] = a->limb[i] + b->limb[i]
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/ec/curve448/arch_32/ |
| f_impl.h | 17 # define LIMB(x) ((x) & ((1 << 28) - 1)), ((x) >> 28)
19 {{LIMB(a), LIMB(b), LIMB(c), LIMB(d), LIMB(e), LIMB(f), LIMB(g), LIMB(h)}}
28 out->limb[i] = a->limb[i] + b->limb[i]
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/ec/curve448/arch_32/ |
| f_impl.h | 17 # define LIMB(x) ((x) & ((1 << 28) - 1)), ((x) >> 28)
19 {{LIMB(a), LIMB(b), LIMB(c), LIMB(d), LIMB(e), LIMB(f), LIMB(g), LIMB(h)}}
28 out->limb[i] = a->limb[i] + b->limb[i]
[all...] |
| /src/crypto/external/bsd/openssl/dist/crypto/ec/curve448/ |
| scalar.c | 58 chain = (chain + accum[i]) - sub->limb[i];
59 out->limb[i] = (c448_word_t)chain;
66 chain = (chain + out->limb[i]) + (p->limb[i] & borrow);
67 out->limb[i] = (c448_word_t)chain;
80 c448_word_t mand = a->limb[i];
81 const c448_word_t *mier = b->limb;
93 mier = sc_p->limb;
120 sc_subx(out, a->limb, b, sc_p, 0);
131 chain = (chain + a->limb[i]) + b->limb[i]
[all...] |
| /src/crypto/external/bsd/openssl.old/dist/crypto/ec/curve448/ |
| scalar.c | 58 chain = (chain + accum[i]) - sub->limb[i];
59 out->limb[i] = (c448_word_t)chain;
66 chain = (chain + out->limb[i]) + (p->limb[i] & borrow);
67 out->limb[i] = (c448_word_t)chain;
80 c448_word_t mand = a->limb[i];
81 const c448_word_t *mier = b->limb;
93 mier = sc_p->limb;
119 sc_subx(out, a->limb, b, sc_p, 0);
129 chain = (chain + a->limb[i]) + b->limb[i]
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/ec/curve448/ |
| scalar.c | 47 chain = (chain + accum[i]) - sub->limb[i];
48 out->limb[i] = (c448_word_t)chain;
55 chain = (chain + out->limb[i]) + (p->limb[i] & borrow);
56 out->limb[i] = (c448_word_t)chain;
69 c448_word_t mand = a->limb[i];
70 const c448_word_t *mier = b->limb;
82 mier = sc_p->limb;
108 sc_subx(out, a->limb, b, sc_p, 0);
118 chain = (chain + a->limb[i]) + b->limb[i]
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/cray/cfp/ |
| mul_1.c | 35 mpn_mul_1 (mp_ptr rp, mp_srcptr up, mp_size_t n, mp_limb_t limb)
40 GMPN_MULWW (p1, p0, up, &n, &limb);
|
| addmul_1.c | 35 mpn_addmul_1 (mp_ptr rp, mp_srcptr up, mp_size_t n, mp_limb_t limb)
40 GMPN_MULWW (p1, p0, up, &n, &limb);
|
| submul_1.c | 35 mpn_submul_1 (mp_ptr rp, mp_srcptr up, mp_size_t n, mp_limb_t limb)
40 GMPN_MULWW (p1, p0, up, &n, &limb);
|
| /src/external/lgpl3/gmp/dist/mpn/powerpc32/ |
| addlsh1_n.asm | 33 C cycles/limb
63 lwz v0, 0(vp) C load v limb
64 lwz u0, 0(up) C load u limb
71 lwz v1, 4(vp) C load v limb
73 srwi s0, v0, 31 C shift down previous v limb
74 stw s1, 4(rp) C store result limb
75 lwzu u0, 8(up) C load u limb and update up
76 rlwimi s0, v1, 1, 0,30 C left shift v limb and merge with prev v limb
80 lwzu v0, 8(vp) C load v limb and update v
[all...] |
| sublsh1_n.asm | 33 C cycles/limb
62 lwz v0, 0(vp) C load v limb
63 lwz u0, 0(up) C load u limb
70 lwz v1, 4(vp) C load v limb
72 srwi s0, v0, 31 C shift down previous v limb
73 stw s1, 4(rp) C store result limb
74 lwzu u0, 8(up) C load u limb and update up
75 rlwimi s0, v1, 1, 0,30 C left shift v limb and merge with prev v limb
79 lwzu v0, 8(vp) C load v limb and update v
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/power/ |
| lshift.asm | 46 mtctr 5 C put limb count in CTR loop register
47 lu 0,-4(4) C read most significant limb
48 sre 3,0,8 C compute carry out limb, and init MQ register
49 bdz Lend2 C if just one limb, skip loop
50 lu 0,-4(4) C read 2:nd most significant limb
51 sreq 7,0,8 C compute most significant limb of result
52 bdz Lend C if just two limb, skip loop
53 Loop: lu 0,-4(4) C load next lower limb
55 sreq 7,0,8 C compute result limb
57 Lend: stu 7,-4(9) C store 2:nd least significant limb
[all...] |
| rshift.asm | 43 mtctr 5 C put limb count in CTR loop register
44 l 0,0(4) C read least significant limb
46 sle 3,0,8 C compute carry limb, and init MQ register
47 bdz Lend2 C if just one limb, skip loop
48 lu 0,4(4) C read 2:nd least significant limb
49 sleq 7,0,8 C compute least significant limb of result
50 bdz Lend C if just two limb, skip loop
51 Loop: lu 0,4(4) C load next higher limb
53 sleq 7,0,8 C compute result limb
55 Lend: stu 7,4(9) C store 2:nd most significant limb
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/mips32/ |
| mul_1.asm | 1 dnl MIPS32 mpn_mul_1 -- Multiply a limb vector with a single limb and store
2 dnl the product in a second limb vector.
56 lw $8,0($5) C load new s1 limb as early as possible
61 addu $10,$10,$2 C add old carry limb to low product limb
63 lw $8,0($5) C load new s1 limb as early as possible
69 addu $2,$9,$2 C add high product limb and carry from addition
79 addu $2,$9,$2 C add high product limb and carry from addition
88 addu $2,$9,$2 C add high product limb and carry from additio
[all...] |
