Lines Matching refs:depth
1762 /* INT TRIE Implementation of depth 64 bits, being the number of bits
1767 antlr3IntTrieNew(ANTLR3_UINT32 depth)
1797 * keys in the trie. This is the trie 'depth'. The limit for
1800 trie->root->bitNum = depth;
1917 ANTLR3_UINT32 depth;
1922 /* Cache the bit depth of this trie, which is always the highest index,
1925 depth = trie->root->bitNum;
2027 depth = 56 + bitIndex[((xorKey & 0xFF00000000000000)>>56)];
2031 depth = 48 + bitIndex[((xorKey & 0x00FF000000000000)>>48)];
2038 depth = 40 + bitIndex[((xorKey & 0x0000FF0000000000)>>40)];
2042 depth = 32 + bitIndex[((xorKey & 0x000000FF00000000)>>32)];
2053 depth = 24 + bitIndex[((xorKey & 0x00000000FF000000)>>24)];
2057 depth = 16 + bitIndex[((xorKey & 0x0000000000FF0000)>>16)];
2064 depth = 8 + bitIndex[((xorKey & 0x0000000000000FF00)>>8)];
2068 depth = bitIndex[xorKey & 0x00000000000000FF];
2073 /* We have located the leftmost differing bit, indicated by the depth variable. So, we know what
2089 while (thisNode->bitNum > entNode->bitNum && entNode->bitNum > depth)
2147 nextNode->bitNum = depth;
2153 if (key & bitMask[depth])
2185 * Basic algorithm is that we do a depth first left descent and free
2410 * discovered the bottom of a depth first search, which we can then ascend, adding
2542 // dropping through the nodes in depth first order and when we get to a node that