Lines Matching refs:limbs
36 /* Pad ptr,oldsize with zero limbs (at the most significant end) to make it
54 #define TMP_ALLOC_LIMBS_ALIGNED(limbs, align) \
55 ((mp_ptr) TMP_ALLOC_ALIGNED ((limbs)*sizeof(mp_limb_t), align))
73 /* Set ptr to a TMP_ALLOC block of the given limbs, with the given limb
75 #define SPEED_TMP_ALLOC_LIMBS(ptr, limbs, align) \
81 __ptr = TMP_ALLOC_LIMBS ((limbs) + SPEED_TMP_ALLOC_ADJUST_MASK); \
95 #define SPEED_BLOCK_SIZE 512 /* limbs */
719 /* s->size is still in limbs, and it's limbs which are copied, but
720 "function" takes a size in bytes not limbs. */
1016 /* s->size limbs worth of fraction part */
1707 /* A division of 2*s->size by s->size limbs */
1754 /* A remainder 2*s->size by s->size limbs */
2634 /* Calculate b^e mod m for random b and m of s->size limbs and random e of 6
2635 limbs. m is forced to odd so that redc can be used. e is limited in
2849 /* Multiply limbs by (B+1). Then we get a gcd exceeding one limb, so
3003 /* Run some GCDs of s->size limbs each. The number of different data values
3034 /* Requirements: x >= y, y must be odd, high limbs != 0. \
3119 high limbs must be non-zero */ \
3169 /* Calculate nextprime(n) for random n of s->size bits (not limbs). */
3238 /* high limbs non-zero */ \
3530 /* s->size controls the number of limbs in the input, s->r is the base, or