Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:parp (Results 1 - 3 of 3) sorted by null

/external/srec/srec/crec/
srec_stats.c	144 partial_path *parp; local 153 for (parp = stack->free_parp_list; parp; parp = parp->next)
srec_results.c	185 partial_path* parp = stack->complete_paths[i]; local 186 for (; parp; parp = parp->next) { 187 word_token* wtoken = &rec->word_token_array[ parp->token_index]; 235 partial_path* parp; local 247 parp = stack->complete_paths[index]; 251 if (parp && parp->word == rec->context->beg_silence_word) 252 parp = parp->next 287 partial_path* parp; local 365 partial_path* parp = stack->complete_paths[ibest]; local 462 partial_path* parp; local     [all...]
astar.c	249 /*void free_partial_path(AstarStack* stack, partial_path* parp); put the proto in astar.h */ 290 partial_path* parp, 307 if (wtoken->end_time > word_token_array[parp->token_index].end_time) 319 best_extend_token = word_token_array[ parp->token_index].backtrace; 326 if (netcost + parp->costsofar > max_cost) 329 printf("netcost %d (%d+%d) + parp->costsofar > max_cost %d\n", 330 netcost, wtoken->cost, best_cost_for_node, parp->costsofar, max_cost); 337 for (alt_extension = parp->first_prev_arc; alt_extension; 391 extended_parp->costsofar = parp->costsofar + netcost; 409 parp->refcount++ 489 partial_path* parp; local 573 partial_path* parp; local 659 partial_path *parp, *extended_parp, *tparp; local 892 partial_path* parp = parps[j]; local 1041 partial_path* parp; local 1147 partial_path* parp; local 1247 partial_path* parp; local 1321 partial_path* parp; local     [all...]

Completed in 31 milliseconds