Searched refs:to_node (Results 1 – 9 of 9) sorted by relevance
| /external/srec/srec/include/ |
| D | search_network.h | 51 #define TO_NODE(ARC) (ARC)->to_node
75 #define TO_NODE(ARC) fst->FSMarc_list[(ARC)].to_node
125 FSMnode_ptr to_node; member
|
| /external/srec/srec/crec/ |
| D | srec_context.c | 123 void append_arc_arriving_node(srec_context* fst, FSMnode* to_node, FSMarc_ptr atok);
916 FSMnode *fr_node, *to_node; in FST_LoadGraph() local
1051 to_node = &fst->FSMnode_list[into_node]; in FST_LoadGraph()
1078 append_arc_arriving_node(fst, to_node, atok); in FST_LoadGraph()
1080 atoken->to_node = NODE_ItoX(into_node); in FST_LoadGraph()
1160 into_node = NODE_XtoI(atoken->to_node); in FST_DumpGraph()
1628 ni2 = arc->to_node; in FST_ResetGrammar()
1636 ni3 = arc2->to_node; in FST_ResetGrammar()
1645 ni3a = arc3->to_node; in FST_ResetGrammar()
1650 ni4 = arc3->to_node; in FST_ResetGrammar()
[all …]
|
| D | srec.c | 898 ASSERT(fsm_arc->to_node != current_ftoken->FSMnode_index); in do_epsilon_updates()
917 new_ftoken_index = rec->best_token_for_node[ fsm_arc->to_node]; in do_epsilon_updates()
993 new_ftoken->FSMnode_index = fsm_arc->to_node; in do_epsilon_updates()
997 rec->best_token_for_node[fsm_arc->to_node] = new_ftoken_index; in do_epsilon_updates()
1016 rec->best_token_for_node[ fsm_arc->to_node] = new_ftoken_index; in do_epsilon_updates()
1039 new_ftoken->FSMnode_index = fsm_arc->to_node; in do_epsilon_updates()
1043 rec->best_token_for_node[fsm_arc->to_node] = new_ftoken_index; in do_epsilon_updates()
1071 rec->best_token_for_node[ fsm_arc->to_node] = new_ftoken_index; in do_epsilon_updates()
1313 to_node_index = fsm_arc->to_node; in update_from_hmms_to_fsmnodes()
1347 fsm_node = &rec->context->FSMnode_list[ fsm_arc->to_node]; in update_from_hmms_to_fsmnodes()
[all …]
|
| D | srec_debug.c | 106 stoken->FSMarc_index, arc->ilabel, arc->to_node); in print_fsmarc_token()
|
| /external/chromium_org/cc/trees/ |
| D | layer_sorter.h | 65 GraphEdge(GraphNode* from_node, GraphNode* to_node, float weight)
67 to(to_node),
|
| /external/srec/tools/test_g2g/ |
| D | test_g2g.c | 270 fr_node = arc->to_node; in CheckG2G()
271 for( ; fr_node!=fst->end_node; fr_node=arc->to_node) { in CheckG2G()
276 if(arc->to_node != fr_node) break; in CheckG2G()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_deadlock_detector.h | 260 bool findEdge(uptr from_node, uptr to_node, u32 *stk_from, u32 *stk_to, in findEdge() argument
263 uptr to_idx = nodeToIndex(to_node); in findEdge()
|
| /external/srec/srec/Grammar/src/ |
| D | SR_GrammarImpl.c | 736 node = fst->FSMarc_list[i].to_node; in SR_GrammarAllowOnly()
|
| /external/chromium_org/v8/test/cctest/ |
| D | test-heap-profiler.cc | 2322 const v8::HeapGraphNode* to_node = edge->GetToNode(); in GetNodeByPath() local
2324 v8::String::Utf8Value node_name(to_node->GetName()); in GetNodeByPath()
2328 node = to_node; in GetNodeByPath()
|