Searched refs:BITS_PER_WORD (Results 1 – 12 of 12) sorted by relevance
30 #define BITS_PER_WORD (sizeof(entropy[0]) * 8) macro31 #define BITS_IN_POOL (WORDS_IN_POOL * BITS_PER_WORD)32 #define ENTROPY_MIN_WORD (entropy_bit_index / BITS_PER_WORD)34 #define _ENTROPY_FREE_WORD (ENTROPY_FREE_BIT / BITS_PER_WORD)51 entropy_bit_size += BITS_PER_WORD; in trng_fill_entropy()77 const unsigned int rshift = entropy_bit_index % BITS_PER_WORD; in trng_pack_entropy()78 const unsigned int lshift = BITS_PER_WORD - rshift; in trng_pack_entropy()79 const int to_fill = ((nbits + BITS_PER_WORD - 1) / BITS_PER_WORD); in trng_pack_entropy()124 if (lshift != BITS_PER_WORD) { in trng_pack_entropy()129 const uint64_t mask = ~0ULL >> (BITS_PER_WORD - (nbits % BITS_PER_WORD)); in trng_pack_entropy()
60 size_t num_words = (m_maxSet + BITS_OFFSET) / BITS_PER_WORD; in clear()67 static const size_t BITS_PER_WORD = sizeof(size_t) * 8;68 static const size_t BITS_OFFSET = BITS_PER_WORD - 1;74 INLINE size_t& _get_word(size_t idx) { return m_bits[idx / BITS_PER_WORD]; } in _get_word()84 size_t num_words = new_size / BITS_PER_WORD; in _grow()90 copy_words = (m_size + BITS_OFFSET) / BITS_PER_WORD; in _grow()
250 static const size_t BITS_PER_WORD = sizeof(size_t) * 8;251 static const size_t ELEMENTS_PER_WORD = BITS_PER_WORD / BitsPerElementT;255 static_assert(ELEMENTS_PER_WORD * BitsPerElementT == BITS_PER_WORD,
27 #define BITS_PER_WORD (sizeof(crypto_word_t) * 8) macro28 #define WORDS_PER_POLY ((N + BITS_PER_WORD - 1) / BITS_PER_WORD)29 #define BITS_IN_LAST_WORD (N % BITS_PER_WORD)
367 static const size_t shift = BITS_PER_WORD - ((N-1) % BITS_PER_WORD); in poly2_reverse_700()370 out->v[i] |= t.v[WORDS_PER_POLY-2-i] << (BITS_PER_WORD - shift); in poly2_reverse_700()397 const crypto_word_t next_carry = p->v[i] >> (BITS_PER_WORD - 1); in poly2_lshift1()410 p->v[i] |= carry << (BITS_PER_WORD - 1); in poly2_rshift1()630 for (size_t i = 0; i < BITS_PER_WORD; i++) { in poly3_mul_aux()647 const crypto_word_t m_s_high = m_s >> (BITS_PER_WORD - i); in poly3_mul_aux()649 const crypto_word_t m_a_high = m_a >> (BITS_PER_WORD - i); in poly3_mul_aux()730 v_s |= prod_s[WORDS_PER_POLY + i] << (BITS_PER_WORD - BITS_IN_LAST_WORD); in HRSS_poly3_mul()732 v_a |= prod_a[WORDS_PER_POLY + i] << (BITS_PER_WORD - BITS_IN_LAST_WORD); in HRSS_poly3_mul()863 f.a.v[WORDS_PER_POLY - 1] >>= BITS_PER_WORD - BITS_IN_LAST_WORD; in HRSS_poly3_invert()[all …]
57 r.a.v[i / BITS_PER_WORD] = (UINT64_C(1) << (i % BITS_PER_WORD)); in TEST()
1108 BITS_PER_WORD = 8 variable1111 return ((x - 1) // BITS_PER_WORD) + 11114 return (x % BITS_PER_WORD)1120 return (x // BITS_PER_WORD)
274 #define BITS_PER_WORD (8*sizeof(bpf_u_int32)) macro279 ((p)[(unsigned)(a) / BITS_PER_WORD] & ((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD)))285 (p)[(unsigned)(a) / BITS_PER_WORD] |= ((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD))291 (p)[(unsigned)(a) / BITS_PER_WORD] &= ~((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD))1759 k += i * BITS_PER_WORD; in opt_j()2562 opt_state->edgewords = opt_state->n_edges / BITS_PER_WORD + 1; in opt_init()2563 opt_state->nodewords = opt_state->n_blocks / BITS_PER_WORD + 1; in opt_init()
186 assert(Bits <= BITS_PER_WORD && "bitwidth too big"); in BitcodeInt()191 return static_cast<int64_t>(Val << (BITS_PER_WORD - BitWidth)) >> in getSExtValue()192 (BITS_PER_WORD - BitWidth); in getSExtValue()206 static const Ice::SizeT BITS_PER_WORD = sizeof(uint64_t) * CHAR_BIT; member in __anon127203fd0111::BitcodeInt214 if (BitWidth == BITS_PER_WORD) in clearUnusedBits()218 Val &= ~static_cast<uint64_t>(0) >> (BITS_PER_WORD - BitWidth); in clearUnusedBits()