Searched refs:rec1 (Results 1 – 3 of 3) sorted by relevance
2013 srec* rec1 = &recm->rec[0]; in multi_srec_viterbi() local2017 if (rec1->current_search_frame >= (rec1->word_lattice->max_frames - 1)) in multi_srec_viterbi()2020 reset_best_cost_to_zero(rec1, rec1->current_best_cost); in multi_srec_viterbi()2021 reset_cost_offsets(recm, rec1->current_search_frame, rec1->current_best_cost); in multi_srec_viterbi()2022 rec1->current_prune_delta = rec1->prune_delta; in multi_srec_viterbi()2023 rec1->current_best_cost = 0; in multi_srec_viterbi()2036 srec* rec1 = &recm->rec[0]; in multi_srec_viterbi() local2043 ASSERT(rec1->prune_delta == rec2->prune_delta); in multi_srec_viterbi()2046 if ((rec1->current_best_cost > MAXcostdata / 2 && !rec1->srec_ended) || in multi_srec_viterbi()2049 printf("hey %d %d\n", rec1->current_best_cost, rec2->current_best_cost); in multi_srec_viterbi()[all …]
59 const sdp_record_t *rec1 = (const sdp_record_t *) r1; in record_sort() local62 if (!rec1 || !rec2) { in record_sort()67 return rec1->handle - rec2->handle; in record_sort()72 const sdp_access_t *rec1 = (const sdp_access_t *) r1; in access_sort() local75 if (!rec1 || !rec2) { in access_sort()80 return rec1->handle - rec2->handle; in access_sort()
57 int activate_grammar_for_recognition(multi_srec* rec1, srec_context* context, const char* rule);58 int clear_grammars_for_recognition(multi_srec* rec1);82 int compare_model_indices(multi_srec *rec1, srec *rec2);