Home
last modified time | relevance | path

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

/external/gptfdisk/
Dattributes.cc92 uint32_t bitNum; in ShowAttributes() local
95 for (bitNum = 0; bitNum < 64; bitNum++) { in ShowAttributes()
96 bitset = (UINT64_C(1) << bitNum) & attributes; in ShowAttributes()
98 cout << partNum+1 << ":" << bitNum << ":" << bitset in ShowAttributes()
99 << " (" << GetAttributeName(bitNum) << ")" << endl; in ShowAttributes()
132 uint32_t bitNum; in ListAttributes() local
135 for (bitNum = 0; bitNum < NUM_ATR; bitNum++) { in ListAttributes()
136 tempAttr = GetAttributeName(bitNum); in ListAttributes()
138 cout << bitNum << ": " << Attributes::GetAttributeName(bitNum) << "\n"; in ListAttributes()
178 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/antlr/antlr-3.4/runtime/C/src/
Dantlr3collections.c1801 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 …]
/external/icu/icu4c/source/test/intltest/
Ditspoof.cpp348 for (int bitNum=28; bitNum>=0; bitNum-=4) { in appendHexUChar() local
349 if (bitNum <= 12) { in appendHexUChar()
352 int hexDigit = (c>>bitNum) & 0x0f; in appendHexUChar()
/external/antlr/antlr-3.4/runtime/C/include/
Dantlr3collections.h351 …ANTLR3_UINT32 bitNum; /**< This is the left/right bit index for traversal along the nodes … member