Searched refs:next_node (Results 1 – 8 of 8) sorted by relevance
60 heap_offset next_node; // offset into heap75 freelist->next_node = offset_from_node ( list_end );96 p && p != list_end; prev = p, p = node_from_offset ( p->next_node)) {103 q->next_node = 0;110 freelist = node_from_offset(p->next_node);112 prev->next_node = p->next_node;113 p->next_node = 0;134 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) {156 cp->next_node = p->next_node;159 prev->next_node = offset_from_node(cp);[all …]
62 Node* const next_node = head_->next.Value();63 if (next_node == nullptr) return false;64 *record = next_node->value;65 head_ = next_node;82 Node* const next_node = head_->next.Value();83 if (next_node == nullptr) return false;84 *record = next_node->value;
237 @adaptor.add_child( root_<treeLevel>, stream_<label>.next_node )<\n>241 @adaptor.add_child( root_<treeLevel>, stream_<label>.next_node )<\n>245 root_<treeLevel> = @adaptor.become_root( stream_<label>.next_node, root_<treeLevel> )<\n>273 root_<treeLevel> = @adaptor.become_root( stream_<rule>.next_node, root_<treeLevel> )<\n>293 root_<treeLevel> = @adaptor.become_root( stream_<label>.next_node, root_<treeLevel> )<\n>297 root_<treeLevel> = @adaptor.become_root( stream_<label>.next_node, root_<treeLevel> )<\n>324 stream_<token>.next_node
228 <terminalOptions.node; format="constantPath">.new( stream_<token>.next_node )230 stream_<token>.next_node
1331 def next_node method in CommonTreeNodeStream.RewriteRuleTokenStream1351 def next_node method in CommonTreeNodeStream.RewriteRuleSubtreeStream1371 alias next_node __next__ alias in CommonTreeNodeStream.RewriteRuleNodeStream
1962 next_node: in xmlTextReaderReadTree()2015 goto next_node; in xmlTextReaderReadTree()
14370 next_node: in xmlXPathRunStreamEval()14405 goto next_node; in xmlXPathRunStreamEval()14436 goto next_node; in xmlXPathRunStreamEval()
8261 goto next_node; in xmlDOMWrapRemoveNode()8298 next_node: in xmlDOMWrapRemoveNode()