Home
last modified time | relevance | path

Searched refs:xorKey (Results 1 – 2 of 2) sorted by relevance

/external/antlr/runtime/C/src/
Dantlr3collections.c1961 ANTLR3_INTKEY xorKey; in intTrieAdd() local
2057xorKey = (key ^ nextNode->key); /* Gives 1 bits only where they differ then we find the left mos… in intTrieAdd()
2062 if (xorKey & 0xFFFFFFFF00000000) in intTrieAdd()
2064 if (xorKey & 0xFFFF000000000000) in intTrieAdd()
2066 if (xorKey & 0xFF00000000000000) in intTrieAdd()
2068 depth = 56 + bitIndex[((xorKey & 0xFF00000000000000)>>56)]; in intTrieAdd()
2072 depth = 48 + bitIndex[((xorKey & 0x00FF000000000000)>>48)]; in intTrieAdd()
2077 if (xorKey & 0x0000FF0000000000) in intTrieAdd()
2079 depth = 40 + bitIndex[((xorKey & 0x0000FF0000000000)>>40)]; in intTrieAdd()
2083 depth = 32 + bitIndex[((xorKey & 0x000000FF00000000)>>32)]; in intTrieAdd()
[all …]
/external/antlr/runtime/Cpp/include/
Dantlr3collections.inl266 ANTLR_INTKEY xorKey; local
343xorKey = (key ^ nextNode->get_key() ); /* Gives 1 bits only where they differ then we find the l…
349 if (xorKey & 0xFFFFFFFF00000000)
351 if (xorKey & 0xFFFF000000000000)
353 if (xorKey & 0xFF00000000000000)
355 depth = 56 + bitIndex[((xorKey & 0xFF00000000000000)>>56)];
359 depth = 48 + bitIndex[((xorKey & 0x00FF000000000000)>>48)];
364 if (xorKey & 0x0000FF0000000000)
366 depth = 40 + bitIndex[((xorKey & 0x0000FF0000000000)>>40)];
370 depth = 32 + bitIndex[((xorKey & 0x000000FF00000000)>>32)];
[all …]