1824 	pANTLR3_INT_TRIE_NODE    nextNode;   in intTrieGet()  local
1842 	nextNode	= thisNode->leftN;	/* Examine the left node from the root	*/  in intTrieGet()
1846 	while (thisNode->bitNum > nextNode->bitNum)  in intTrieGet()
1850 		thisNode    = nextNode;  in intTrieGet()
1856 		if (key & bitMask[nextNode->bitNum])  in intTrieGet()
1858 			nextNode = nextNode->rightN;	/* 1 is right	*/  in intTrieGet()
1862 			nextNode = nextNode->leftN;		/* 0 is left	*/  in intTrieGet()
1877 	if (nextNode->key == key)  in intTrieGet()
1881 		return	nextNode->buckets;  in intTrieGet()
1916 	pANTLR3_INT_TRIE_NODE   nextNode;  in intTrieAdd()  local
1929 	nextNode	= trie->root->leftN;	/* And assume we start to the left  */  in intTrieAdd()
1934 	while (thisNode->bitNum  > nextNode->bitNum)  in intTrieAdd()
1938 		thisNode = nextNode;  in intTrieAdd()
1940 		if (key & bitMask[nextNode->bitNum])  in intTrieAdd()
1944 			nextNode = nextNode->rightN;  in intTrieAdd()
1950 			nextNode = nextNode->leftN;  in intTrieAdd()
1957 	if (nextNode->key == key)  in intTrieAdd()
1992 			nextEnt = nextNode->buckets;  in intTrieAdd()
2017 …xorKey = (key ^ nextNode->key);   /* Gives 1 bits only where they differ then we find the left mos…  in intTrieAdd()
2113     nextNode	= (pANTLR3_INT_TRIE_NODE)ANTLR3_CALLOC(1, sizeof(ANTLR3_INT_TRIE_NODE));  in intTrieAdd()
2114     if (nextNode == NULL)  in intTrieAdd()
2146     nextNode->buckets	= newEnt;  in intTrieAdd()
2147     nextNode->key	= key;  in intTrieAdd()
2148     nextNode->bitNum	= depth;  in intTrieAdd()
2156 	nextNode->leftN	    = entNode;	    /* Terminates at previous position	*/  in intTrieAdd()
2157 	nextNode->rightN    = nextNode;	    /* Terminates with itself		*/  in intTrieAdd()
2161 	nextNode->rightN   = entNode;	    /* Terminates at previous position	*/  in intTrieAdd()
2162 	nextNode->leftN    = nextNode;	    /* Terminates with itself		*/		  in intTrieAdd()
2172 	thisNode->rightN    = nextNode;  in intTrieAdd()
2176 	thisNode->leftN	    = nextNode;  in intTrieAdd()