Home
last modified time | relevance | path

Searched refs:bitNum (Results 1 – 13 of 13) sorted by relevance

/external/ms-tpm-20-ref/TPMCmd/tpm/src/support/
DBits.c58 unsigned int bitNum, // IN: number of the bit in 'bArray' in TestBit() argument
63 pAssert(bytesInArray > (bitNum >> 3)); in TestBit()
64 return((bArray[bitNum >> 3] & (1 << (bitNum & 7))) != 0); in TestBit()
71 unsigned int bitNum, // IN: number of the bit in 'bArray' in SetBit() argument
76 pAssert(bytesInArray > (bitNum >> 3)); in SetBit()
77 bArray[bitNum >> 3] |= (1 << (bitNum & 7)); in SetBit()
84 unsigned int bitNum, // IN: number of the bit in 'bArray'. in ClearBit() argument
89 pAssert(bytesInArray > (bitNum >> 3)); in ClearBit()
90 bArray[bitNum >> 3] &= ~(1 << (bitNum & 7)); in ClearBit()
/external/gptfdisk/
Dattributes.cc94 uint32_t bitNum; in ShowAttributes() local
97 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() local
137 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 …]
Dattributes.h35 static const string& GetAttributeName(const uint32_t bitNum) {return atNames [bitNum];} in GetAttributeName() argument
/external/ms-tpm-20-ref/TPMCmd/tpm/include/prototypes/
DBits_fp.h50 unsigned int bitNum, // IN: number of the bit in 'bArray'
59 unsigned int bitNum, // IN: number of the bit in 'bArray'
68 unsigned int bitNum, // IN: number of the bit in 'bArray'.
DBnMath_fp.h162 unsigned int bitNum // IN: Bit number to SET
174 unsigned int bitNum // IN: bit to test
/external/ms-tpm-20-ref/TPMCmd/tpm/src/crypt/
DBnMath.c426 unsigned int bitNum // IN: Bit number to SET in BnSetBit() argument
429 crypt_uword_t offset = bitNum / RADIX_BITS; in BnSetBit()
430 pAssert(bn->allocated * RADIX_BITS >= bitNum); in BnSetBit()
434 bn->d[offset] |= ((crypt_uword_t)1 << RADIX_MOD(bitNum)); in BnSetBit()
447 unsigned int bitNum // IN: bit to test in BnTestBit() argument
450 crypt_uword_t offset = RADIX_DIV(bitNum); in BnTestBit()
453 return ((bn->d[offset] & (((crypt_uword_t)1) << RADIX_MOD(bitNum))) != 0); in BnTestBit()
/external/antlr/runtime/C/src/
Dantlr3collections.c1842 trie->root->bitNum = depth; in antlr3IntTrieNew()
1887 while (thisNode->bitNum > nextNode->bitNum) in intTrieGet()
1897 if (key & bitMask[nextNode->bitNum]) in intTrieGet()
1966 depth = trie->root->bitNum; in intTrieAdd()
1974 while (thisNode->bitNum > nextNode->bitNum) in intTrieAdd()
1980 if (key & bitMask[nextNode->bitNum]) in intTrieAdd()
2130 while (thisNode->bitNum > entNode->bitNum && entNode->bitNum > depth) in intTrieAdd()
2136 if (key & bitMask[entNode->bitNum]) in intTrieAdd()
2188 nextNode->bitNum = depth; in intTrieAdd()
2210 if (key & bitMask[thisNode->bitNum] ) in intTrieAdd()
[all …]
/external/mesa3d/src/amd/addrlib/src/core/
Daddrlib.cpp472 UINT_32 bitNum, ///< [in] how many bits in Bits2Number() argument
479 va_start(bits_ptr, bitNum); in Bits2Number()
481 for(i = 0; i < bitNum; i++) in Bits2Number()
Daddrlib.h340 static UINT_32 Bits2Number(UINT_32 bitNum, ...);
/external/icu/icu4c/source/test/intltest/
Ditspoof.cpp324 for (int bitNum=28; bitNum>=0; bitNum-=4) { in appendHexUChar() local
325 if (bitNum <= 12) { in appendHexUChar()
328 int hexDigit = (c>>bitNum) & 0x0f; in appendHexUChar()
/external/antlr/runtime/Cpp/include/
Dantlr3collections.hpp83 void set_bitNum( ANTLR_UINT32 bitNum );
Dantlr3collections.inl57 ANTLR_INLINE void IntTrieNode<ImplTraits, DataType>::set_bitNum( ANTLR_UINT32 bitNum ) argument
59 m_bitNum = bitNum;
/external/antlr/runtime/C/include/
Dantlr3collections.h351 …ANTLR3_UINT32 bitNum; /**< This is the left/right bit index for traversal along the nodes … member