Lines Matching defs:nextNode
1823 pANTLR3_INT_TRIE_NODE nextNode;
1841 nextNode = thisNode->leftN; /* Examine the left node from the root */
1845 while (thisNode->bitNum > nextNode->bitNum)
1849 thisNode = nextNode;
1855 if (key & bitMask[nextNode->bitNum])
1857 nextNode = nextNode->rightN; /* 1 is right */
1861 nextNode = nextNode->leftN; /* 0 is left */
1876 if (nextNode->key == key)
1880 return nextNode->buckets;
1915 pANTLR3_INT_TRIE_NODE nextNode;
1928 nextNode = trie->root->leftN; /* And assume we start to the left */
1933 while (thisNode->bitNum > nextNode->bitNum)
1937 thisNode = nextNode;
1939 if (key & bitMask[nextNode->bitNum])
1943 nextNode = nextNode->rightN;
1949 nextNode = nextNode->leftN;
1956 if (nextNode->key == key)
1991 nextEnt = nextNode->buckets;
2016 xorKey = (key ^ nextNode->key); /* Gives 1 bits only where they differ then we find the left most 1 bit*/
2112 nextNode = (pANTLR3_INT_TRIE_NODE)ANTLR3_CALLOC(1, sizeof(ANTLR3_INT_TRIE_NODE));
2113 if (nextNode == NULL)
2145 nextNode->buckets = newEnt;
2146 nextNode->key = key;
2147 nextNode->bitNum = depth;
2155 nextNode->leftN = entNode; /* Terminates at previous position */
2156 nextNode->rightN = nextNode; /* Terminates with itself */
2160 nextNode->rightN = entNode; /* Terminates at previous position */
2161 nextNode->leftN = nextNode; /* Terminates with itself */
2171 thisNode->rightN = nextNode;
2175 thisNode->leftN = nextNode;