Searched refs:bitNum (Results 1 – 4 of 4) sorted by relevance
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 …]
353 for (int bitNum=28; bitNum>=0; bitNum-=4) { in appendHexUChar() local354 if (bitNum <= 12) { in appendHexUChar()357 int hexDigit = (c>>bitNum) & 0x0f; in appendHexUChar()
351 …ANTLR3_UINT32 bitNum; /**< This is the left/right bit index for traversal along the nodes … member