Lines Matching refs:leftN
1806 trie->root->leftN = trie->root; in antlr3IntTrieNew()
1842 nextNode = thisNode->leftN; /* Examine the left node from the root */ in intTrieGet()
1862 nextNode = nextNode->leftN; /* 0 is left */ in intTrieGet()
1929 nextNode = trie->root->leftN; /* And assume we start to the left */ in intTrieAdd()
1950 nextNode = nextNode->leftN; in intTrieAdd()
2086 entNode = trie->root->leftN; in intTrieAdd()
2106 entNode = entNode->leftN; in intTrieAdd()
2156 nextNode->leftN = entNode; /* Terminates at previous position */ in intTrieAdd()
2162 nextNode->leftN = nextNode; /* Terminates with itself */ in intTrieAdd()
2176 thisNode->leftN = nextNode; in intTrieAdd()
2198 if (node->bitNum > node->leftN->bitNum) in freeIntNode()
2202 freeIntNode(node->leftN); in freeIntNode()