HomeSort by: relevance | last modified time | path
    Searched defs:SHIFT_WORD (Results 1 - 2 of 2) sorted by relevancy

  /src/usr.bin/moduli/qsieve/
qsieve.c 80 #define SHIFT_WORD (SHIFT_BIT+SHIFT_BYTE)
100 /* real TEST_MINIMUM (1UL << (SHIFT_WORD - TEST_POWER)) */
101 #define TEST_POWER (3) /* 2**n, n < SHIFT_WORD */
106 #define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1U << ((n) & 31)))
107 #define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1U << ((n) & 31)))
108 #define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1U << ((n) & 31)))
259 (power * power) >> (SHIFT_WORD - TEST_POWER));
286 tinybits = tinywords << SHIFT_WORD;
292 smallbits = smallwords << SHIFT_WORD;
302 largebits = largewords << SHIFT_WORD;
    [all...]
  /src/crypto/external/bsd/openssh/dist/
moduli.c 84 #define SHIFT_WORD (SHIFT_BIT+SHIFT_BYTE)
106 /* real TEST_MINIMUM (1UL << (SHIFT_WORD - TEST_POWER)) */
107 #define TEST_POWER (3) /* 2**n, n < SHIFT_WORD */
110 #define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1L << ((n) & 31)))
111 #define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1L << ((n) & 31)))
112 #define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1L << ((n) & 31)))
264 tinybits = tinywords << SHIFT_WORD;
267 smallbits = smallwords << SHIFT_WORD;
270 largebits = largewords << SHIFT_WORD;

Completed in 13 milliseconds