HomeSort by: relevance | last modified time | path
    Searched defs:limb (Results 1 - 25 of 38) sorted by relevancy

1 2

  /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);
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;
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...]
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...]
export.c 115 mp_limb_t limb, wbitsmask; local
143 *dp = limb MASK; \
144 limb >>= (N); \
151 *dp = (limb | (newlimb << lbits)) MASK; \
152 limb = newlimb >> ((N)-lbits); \
159 limb = 0;
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;
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...]
  /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...]
set_z_2exp.c 46 zn = ABSIZ(z); /* limb size of z */
114 mp_limb_t limb = fp[0]; local
115 rb = limb & mask;
116 sb = limb & (mask-1);
118 fp[0] = limb & ~(ulp-1);
add1sp.c 779 compute one more limb of the (infinite) addition
805 /* most significant limb is special */
838 /* most significant limb of c is special */
865 mp_limb_t limb, rb, sb; local
922 limb = mpn_add_n (ap, MPFR_MANT(b), MPFR_MANT(c), n);
924 MPFR_ASSERTD(limb != 0); /* There must be a carry */
1011 limb = mpfr_addrsh (ap, MPFR_MANT(b), MPFR_MANT(c), n, d, &sb);
1033 if (MPFR_UNLIKELY (limb != 0))
1035 limb = ap[0] & (MPFR_LIMB_ONE << sh); /* Get LSB (will be new rb) */
1041 rb = limb; /* New rb *
    [all...]
sub1sp.c 777 2-limb arrays) and by mpfr_sub1sp1n (for the different cases to handle) */
1433 mp_limb_t limb; local
1546 limb = ap[n-1];
1547 if (MPFR_LIKELY (limb != 0))
1549 /* First limb is not zero. */
1550 count_leading_zeros (cnt, limb);
1558 /* Last limb should be OK */
1564 /* First limb is zero: this can only occur for n >= 2 */
1566 /* Find the first limb not equal to zero. It necessarily exists
1571 limb = ap[k]
    [all...]
sum.c 108 * wp: pointer to the accumulator (least significant limb first).
353 /* We can't truncate the most significant limb of the input
771 mp_limb_t limb, mask; local
794 limb = wp[--wi];
800 limb = wi >= 1 ? wp[--wi] : MPFR_LIMB_ZERO;
807 limb = wp[wi];
818 limb >>= nbits - d;
828 limb &= mask;
830 limb == MPFR_LIMB_ZERO ?
832 limb == mask
    [all...]
  /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/crypto/external/apache2/openssl/dist/crypto/ec/curve448/
field.h 36 word_t limb[NLIMBS]; member in struct:gf_s
138 x[0].limb[i] = constant_time_select_32(is_z, z[0].limb[i],
139 y[0].limb[i]);
142 x[0].limb[i] = constant_time_select_64(is_z, z[0].limb[i],
143 y[0].limb[i]);
164 constant_time_cond_swap_32(swap, &(x[0].limb[i]), &(y->limb[i]));
167 constant_time_cond_swap_64(swap, &(x[0].limb[i]), &(y->limb[i]))
    [all...]
point_448.h 68 c448_word_t limb[C448_SCALAR_LIMBS]; member in struct:curve448_scalar_s
  /src/crypto/external/bsd/openssl/dist/crypto/ec/curve448/
field.h 36 word_t limb[NLIMBS]; member in struct:gf_s
139 x[0].limb[i] = constant_time_select_32(is_z, z[0].limb[i],
140 y[0].limb[i]);
143 x[0].limb[i] = constant_time_select_64(is_z, z[0].limb[i],
144 y[0].limb[i]);
165 constant_time_cond_swap_32(swap, &(x[0].limb[i]), &(y->limb[i]));
168 constant_time_cond_swap_64(swap, &(x[0].limb[i]), &(y->limb[i]))
    [all...]
point_448.h 68 c448_word_t limb[C448_SCALAR_LIMBS]; member in struct:curve448_scalar_s
  /src/crypto/external/bsd/openssl.old/dist/crypto/ec/curve448/
field.h 36 word_t limb[NLIMBS]; member in struct:gf_s
134 x[0].limb[i] = constant_time_select_32(is_z, z[0].limb[i],
135 y[0].limb[i]);
138 x[0].limb[i] = constant_time_select_64(is_z, z[0].limb[i],
139 y[0].limb[i]);
160 constant_time_cond_swap_32(swap, &(x[0].limb[i]), &(y->limb[i]));
163 constant_time_cond_swap_64(swap, &(x[0].limb[i]), &(y->limb[i]))
    [all...]
point_448.h 68 c448_word_t limb[C448_SCALAR_LIMBS]; member in struct:curve448_scalar_s
  /src/external/lgpl3/mpfr/dist/tests/
tset_sj.c 52 mp_limb_t limb; local
63 limb = (unsigned long) randlimb ();
64 inex1 = mpfr_set_uj (x, limb, MPFR_RNDN);
65 inex2 = mpfr_set_ui (y, limb, MPFR_RNDN);
69 (unsigned long) limb, (unsigned long) p);
78 (unsigned long) limb, (unsigned long) p, inex1, inex2);
tfprintf.c 181 mp_limb_t limb[3]; local
196 limb[0] = limb[1] = limb[2] = MPFR_LIMB_MAX;
245 check_vfprintf (fout, "a. %Mx b. %Re%Mn", limb[0], mpfr, &limb[0]);
246 if (limb[0] != 29 + GMP_NUMB_BITS / 4 ||
247 limb[1] != MPFR_LIMB_MAX ||
248 limb[2] != MPFR_LIMB_MAX)
255 limb[0] = MPFR_LIMB_MAX
    [all...]
tests.c 496 /* generate a random limb */
500 mp_limb_t limb; local
502 mpfr_rand_raw (&limb, RANDS, GMP_NUMB_BITS);
503 return limb;
  /src/external/lgpl3/gmp/dist/tests/misc/
t-printf.c 706 mp_limb_t limb; local
714 limb = 1;
719 check_one (s, "%Mu", limb);
723 check_one (s, "%Mx", limb);
727 check_one (s, "%MX", limb);
730 limb = 2*limb + 1;
  /src/external/lgpl3/gmp/dist/tests/mpz/
t-bit.c 219 int limb, offset, initial; local
224 for (limb = 0; limb < 4; limb++)
226 for (offset = (limb==0 ? 0 : -2); offset <= 2; offset++)
232 bit = (unsigned long) limb*GMP_LIMB_BITS + offset;

Completed in 46 milliseconds

1 2