Home
last modified time | relevance | path

Searched refs:next_node (Results 1 – 9 of 9) sorted by relevance

/external/srec/srec/include/
Dsearch_network.h52 #define NEXT_NODE(NOD) (NOD)->next_node
76 #define NEXT_NODE(NOD) fst->FSMnode_list[(NOD)].un_ptr.next_node
110 FSMnode_ptr next_node; member
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/
DAST.stg237 @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
DASTTreeParser.stg228 <terminalOptions.node; format="constantPath">.new( stream_<token>.next_node )
230 stream_<token>.next_node
/external/kernel-headers/original/linux/
Dnodemask.h232 #define next_node(n, src) __next_node((n), &(src)) macro
333 (node) = next_node((node), (mask)))
354 #define next_online_node(nid) next_node((nid), node_online_map)
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
Dtree.rb1331 def next_node method in CommonTreeNodeStream.RewriteRuleTokenStream
1351 def next_node method in CommonTreeNodeStream.RewriteRuleSubtreeStream
1371 alias next_node __next__ alias in CommonTreeNodeStream.RewriteRuleNodeStream
/external/srec/srec/crec/
Dsrec_context.c1092 fst->FSMnode_list[i].un_ptr.next_node = NODE_ItoX(i + 1); in FST_LoadGraph()
1096 fst->FSMnode_list[i].un_ptr.next_node = FSMNODE_NULL; in FST_LoadGraph()
1679 for( ; *last_free_node!=MAXnodeID; last_free_node = &ntoken->un_ptr.next_node) in FST_ResetGrammar()
1989 fst->FSMnode_freelist = NODE_XtoI(ntoken->un_ptr.next_node); in fst_get_free_node()
2001 node->un_ptr.next_node = fst->FSMnode_freelist; in fst_free_node()
2381 tmp_FSMnode_list[atokid_node].un_ptr.next_node = NODE_ItoX(atokid_node + 1); in fst_add_arcs()
2384 tmp_FSMnode_list[atokid_node].un_ptr.next_node = FSMNODE_NULL; in fst_add_arcs()
2391 for( ; *last_free_node!=MAXnodeID; last_free_node = &ntoken->un_ptr.next_node) in fst_add_arcs()
3428 fst->FSMnode_list[i].un_ptr.next_node = NODE_ItoX(i + 1); in FST_LoadContextFromImageV2()
3431 fst->FSMnode_list[i].un_ptr.next_node = FSMNODE_NULL; in FST_LoadContextFromImageV2()
/external/libxml2/
Dxmlreader.c1933 next_node: in xmlTextReaderReadTree()
1986 goto next_node; in xmlTextReaderReadTree()
Dxpath.c14267 next_node: in xmlXPathRunStreamEval()
14298 goto next_node; in xmlXPathRunStreamEval()
14328 goto next_node; in xmlXPathRunStreamEval()
Dtree.c8071 goto next_node; in xmlDOMWrapRemoveNode()
8108 next_node: in xmlDOMWrapRemoveNode()