Searched refs:to_node (Results 1 - 9 of 9) sorted by relevance

/external/srec/srec/include/
H A Dsearch_network.h51 #define TO_NODE(ARC) (ARC)->to_node
75 #define TO_NODE(ARC) fst->FSMarc_list[(ARC)].to_node
125 FSMnode_ptr to_node; member in struct:FSMarc_t
/external/chromium_org/cc/trees/
H A Dlayer_sorter.h65 GraphEdge(GraphNode* from_node, GraphNode* to_node, float weight) argument
67 to(to_node),
/external/srec/srec/crec/
H A Dsrec_context.c123 void append_arc_arriving_node(srec_context* fst, FSMnode* to_node, FSMarc_ptr atok);
916 FSMnode *fr_node, *to_node; local
1051 to_node = &fst->FSMnode_list[into_node];
1078 append_arc_arriving_node(fst, to_node, atok);
1080 atoken->to_node = NODE_ItoX(into_node);
1160 into_node = NODE_XtoI(atoken->to_node);
1628 ni2 = arc->to_node;
1636 ni3 = arc2->to_node;
1645 ni3a = arc3->to_node;
1650 ni4 = arc3->to_node;
2214 remove_arc_arriving(srec_context* fst, FSMnode* to_node, FSMarc* arc) argument
2669 append_arc_arriving_node(srec_context* fst, FSMnode* to_node, FSMarc_ptr arc) argument
2696 FSMnode* to_node = NODE_XtoP(arc->to_node); local
3279 FSMnode *fr_node, *to_node; local
[all...]
H A Dsrec_debug.c106 stoken->FSMarc_index, arc->ilabel, arc->to_node);
H A Dsrec.c898 ASSERT(fsm_arc->to_node != current_ftoken->FSMnode_index);
917 new_ftoken_index = rec->best_token_for_node[ fsm_arc->to_node];
993 new_ftoken->FSMnode_index = fsm_arc->to_node;
997 rec->best_token_for_node[fsm_arc->to_node] = new_ftoken_index;
1005 // unchanged token->FSMnode_index = fsm_arc->to_node;
1016 rec->best_token_for_node[ fsm_arc->to_node] = new_ftoken_index;
1039 new_ftoken->FSMnode_index = fsm_arc->to_node;
1043 rec->best_token_for_node[fsm_arc->to_node] = new_ftoken_index;
1060 // unchanged token->FSMnode_index = fsm_arc->to_node;
1071 rec->best_token_for_node[ fsm_arc->to_node]
[all...]
/external/srec/tools/test_g2g/
H A Dtest_g2g.c270 fr_node = arc->to_node;
271 for( ; fr_node!=fst->end_node; fr_node=arc->to_node) {
276 if(arc->to_node != fr_node) break;
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector.h260 bool findEdge(uptr from_node, uptr to_node, u32 *stk_from, u32 *stk_to, argument
263 uptr to_idx = nodeToIndex(to_node);
/external/srec/srec/Grammar/src/
H A DSR_GrammarImpl.c736 node = fst->FSMarc_list[i].to_node;
/external/chromium_org/v8/test/cctest/
H A Dtest-heap-profiler.cc859 "var edge_to_node_offset = meta.edge_fields.indexOf('to_node');\n"
2198 const v8::HeapGraphNode* to_node = edge->GetToNode(); local
2200 v8::String::Utf8Value node_name(to_node->GetName());
2204 node = to_node;

Completed in 560 milliseconds