Searched refs:bitNum (Results 1 – 9 of 9) sorted by relevance
24 unsigned int bitNum, // IN: number of the bit in 'bArray' in BitIsSet() argument29 pAssert(arraySize > (bitNum >> 3)); in BitIsSet()30 return((bArray[bitNum >> 3] & (1 << (bitNum & 7))) != 0); in BitIsSet()40 unsigned int bitNum, // IN: number of the bit in 'bArray' in BitSet() argument45 pAssert(arraySize > bitNum/8); in BitSet()46 bArray[bitNum >> 3] |= (1 << (bitNum & 7)); in BitSet()56 unsigned int bitNum, // IN: number of the bit in 'bArray'. in BitClear() argument61 pAssert(arraySize > bitNum/8); in BitClear()62 bArray[bitNum >> 3] &= ~(1 << (bitNum & 7)); in BitClear()
10 BOOL BitIsSet(unsigned int bitNum, // IN: number of the bit in 'bArray'20 void BitSet(unsigned int bitNum, // IN: number of the bit in 'bArray'31 void BitClear(unsigned int bitNum, // IN: number of the bit in 'bArray'.
94 uint32_t bitNum; in ShowAttributes() local97 for (bitNum = 0; bitNum < 64; bitNum++) { in ShowAttributes()98 bitset = (UINT64_C(1) << bitNum) & attributes; in ShowAttributes()100 cout << partNum+1 << ":" << bitNum << ":" << bitset in ShowAttributes()101 << " (" << GetAttributeName(bitNum) << ")" << endl; in ShowAttributes()134 uint32_t bitNum; in ListAttributes() local137 for (bitNum = 0; bitNum < NUM_ATR; bitNum++) { in ListAttributes()138 tempAttr = GetAttributeName(bitNum); in ListAttributes()140 cout << bitNum << ": " << Attributes::GetAttributeName(bitNum) << "\n"; in ListAttributes()180 int bitNum; { if (attributeOpcode > ao_unknown) { in OperateOnAttributes() local[all …]
35 static const string& GetAttributeName(const uint32_t bitNum) {return atNames [bitNum];} in GetAttributeName() argument
1801 trie->root->bitNum = depth; in antlr3IntTrieNew()1846 while (thisNode->bitNum > nextNode->bitNum) in intTrieGet()1856 if (key & bitMask[nextNode->bitNum]) in intTrieGet()1926 depth = trie->root->bitNum; in intTrieAdd()1934 while (thisNode->bitNum > nextNode->bitNum) in intTrieAdd()1940 if (key & bitMask[nextNode->bitNum]) in intTrieAdd()2090 while (thisNode->bitNum > entNode->bitNum && entNode->bitNum > depth) in intTrieAdd()2096 if (key & bitMask[entNode->bitNum]) in intTrieAdd()2148 nextNode->bitNum = depth; in intTrieAdd()2170 if (key & bitMask[thisNode->bitNum] ) in intTrieAdd()[all …]
306 for (int bitNum=28; bitNum>=0; bitNum-=4) { in appendHexUChar() local307 if (bitNum <= 12) { in appendHexUChar()310 int hexDigit = (c>>bitNum) & 0x0f; in appendHexUChar()
351 …ANTLR3_UINT32 bitNum; /**< This is the left/right bit index for traversal along the nodes … member
566 static UINT_32 Bits2Number(UINT_32 bitNum,...);
3439 UINT_32 bitNum, ///< [in] how many bits in Bits2Number() argument3446 va_start(bits_ptr, bitNum); in Bits2Number()3448 for(i = 0; i < bitNum; i++) in Bits2Number()