Searched refs:thisNode (Results 1 – 6 of 6) sorted by relevance
76 NodeType* thisNode = static_cast<NodeType*>(this); in deref() local77 if (--m_refCount <= 0 && !thisNode->hasTreeSharedParent()) { in deref()81 thisNode->removedLastRef(); in deref()
112 var thisNode = con.iterateNext();113 while (thisNode) {114 if (node == thisNode) {117 thisNode = con.iterateNext();
40 Data thisNode = arg.getReference().getSymlink(); in execute() local41 return literalConstant(thisNode.getChildCount(), arg); in execute()
40 Data thisNode = arg.getReference().getSymlink(); in execute() local41 return literalConstant(thisNode.isFirstSibling(), arg); in execute()
40 Data thisNode = arg.getReference().getSymlink(); in execute() local41 return literalConstant(thisNode.isLastSibling(), arg); in execute()
1823 pANTLR3_INT_TRIE_NODE thisNode; in intTrieGet() local1841 thisNode = trie->root; /* Start at the root node */ in intTrieGet()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()1915 pANTLR3_INT_TRIE_NODE thisNode; in intTrieAdd() local1928 thisNode = trie->root; /* Start with the root node */ in intTrieAdd()1934 while (thisNode->bitNum > nextNode->bitNum) in intTrieAdd()1938 thisNode = nextNode; in intTrieAdd()2085 thisNode = trie->root; in intTrieAdd()[all …]