Searched refs:end_node (Results 1 - 10 of 10) sorted by relevance

/external/srec/srec/crec/
H A Dpriority_q.c75 void remove_non_end_word_from_q(srec *rec, priority_q *pq, word_token *word_token_array, nodeID end_node) argument
88 if (token->end_node != end_node)
117 due to context-dependency. When "history_for_token" ignores the end_node,
127 if (token1->end_node != token2->end_node)
132 history_for_token1 += token1->end_node * 1000000;
139 history_for_token2 += token2->end_node * 1000000;
H A Dsrec_eosd.c78 nodeID end_node; local
93 end_node = rec->context->end_node;
94 eftoken_index = rec->best_token_for_node[ end_node];
H A Dsrec_context.c109 int fst_add_arcs(srec_context* fst, nodeID start_node, nodeID end_node,
1039 fst->end_node = from_node;
1109 /* fst->end_node = 0; this is set up above */
1197 nodeID start_node = MAXnodeID, end_node = MAXnodeID; local
1256 end_node = fst->fsm_exit_points[i].wbto_node_index;
1259 node = &fst->FSMnode_list[ end_node];
1268 if (i < 0 || start_node>=fst->num_nodes || end_node>=fst->num_nodes)
1271 start_node, end_node);
1278 end_node = fst->fsm_exit_points[i].wbto_node_index;
1280 /* now start_node and end_node ar
2276 fst_add_arcs(srec_context* fst, nodeID start_node, nodeID end_node, wordID add_tree_olabel, costdata add_tree_cost, modelID* add_tree_start, int add_tree_len) argument
[all...]
H A Dword_lattice.c50 WT.end_node = MAXnodeID; \
141 PLogMessage (" (%d W%d %s cost=%d/%d/%d time=%d%s node=%d)", wtoken_index, wtoken->word, p, wtoken->cost, cost, cost_for_word, wtoken->end_time, iwttime, wtoken->end_node);
329 wtoken->word, p, wtoken->cost, cost, cost_for_word, wtoken->end_time, WORD_TOKEN_GET_WD_ETIME(wtoken), wtoken->end_node);
H A Dsrec.c717 nodeID end_node,
755 wtoken->end_node = end_node;
1553 if (fsmnode_token->FSMnode_index == rec->context->end_node)
1806 wtoken->end_node = rec->context->end_node;
1826 nodeID end_node; local
1846 end_node = rec->context->end_node;
1847 /*remove all word paths from the priority_q which do not end at end_node
716 srec_process_word_boundary_nbest(srec* rec, nodeID end_node, wordID word, wtokenID word_backtrace, costdata cost, costdata* pcurrent_word_threshold, int *any_nodes_blocked) argument
[all...]
/external/srec/srec/include/
H A Dsrec.h106 nodeID end_node; /* for backtrace with word graph */ member in struct:word_token_t
328 void remove_non_end_word_from_q(srec *rec, priority_q *pq, word_token *word_token_array, nodeID end_node);
H A Dsrec_context.h120 nodeID end_node; member in struct:srec_context
/external/chromium_org/cc/trees/
H A Dlayer_sorter.cc321 GraphNode* end_node = NULL; local
324 end_node = &node_b;
327 end_node = &node_a;
331 DVLOG(2) << start_node->layer->id() << " -> " << end_node->layer->id();
332 edges_.push_back(GraphEdge(start_node, end_node, weight));
/external/srec/tools/test_g2g/
H A Dtest_g2g.c271 for( ; fr_node!=fst->end_node; fr_node=arc->to_node) {
/external/srec/srec/Grammar/src/
H A DSR_GrammarImpl.c737 if (node == fst->end_node) continue;

Completed in 196 milliseconds