Searched refs:WORD_BITS (Results 1 – 6 of 6) sorted by relevance
43 #define WORD_BITS 16 /* sizeof(uword) * CHAR_BIT on the macro72 WORD_BITS - sp->varsize);78 WORD_BITS - n_in);84 printf("*c++ = sr >> %d;\n", WORD_BITS - n_in);
21 #define WORD_BITS 16 /* sizeof(uword) * CHAR_BIT on the macro
198 WORD_BITS = 8*WORD_BYTES, enumerator199 NUM_WORDS = 128 / WORD_BITS202 DE_STATIC_ASSERT(128 % WORD_BITS == 0);218 return (m_words[ndx / WORD_BITS] >> (ndx % WORD_BITS)) & 1; in getBit()230 const int word0Ndx = low / WORD_BITS; in getBits()231 const int word1Ndx = high / WORD_BITS; in getBits()236 … (deUint32)((m_words[word0Ndx] & ((((Word)1 << high%WORD_BITS << 1) - 1))) >> ((Word)low % WORD_BI… in getBits()241 return (deUint32)(m_words[word0Ndx] >> (low%WORD_BITS)) | in getBits()242 …(deUint32)((m_words[word1Ndx] & (((Word)1 << high%WORD_BITS << 1) - 1)) << (high-low - high%WORD_B… in getBits()1621 WORD_BITS = 8*WORD_BYTES, enumerator[all …]
278 #define WORD_BITS (8U * sizeof (unsigned int)) in process_file() macro281 sections[ndx / WORD_BITS] |= (1U << (ndx % WORD_BITS)); in process_file()286 return (sections[ndx / WORD_BITS] & (1U << (ndx % WORD_BITS))) != 0; in process_file()293 for (size_t i = 0; i < shnum / WORD_BITS + 1; i++) in process_file()
112 #define WORD_BITS (WORD_SIZE * BITS_PER_BYTE) macro159 #define SWEEP_ID_BITS (WORD_BITS - (THREAD_ID_BITS + WORD_OFFSET_BITS))
172 #define WORD_BITS 32 macro