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