Searched refs:parp (Results 1 - 6 of 6) sorted by relevance

/external/srec/srec/crec/
H A Dastar_pphash.c76 unsigned int hashfunc(partial_path* parp) argument
79 if (parp->first_prev_arc != PARP_TERMINAL)
80 hashval = parp->token_index;
83 hashval = (hashval << 10) + parp->word;
84 while ((parp = parp->next) != NULL)
86 if (parp->word != MAXwordID)
87 hashval = hashval * 64 + parp->word + hashval % 65536;
94 int hash_get(FixedSizeHash* hash, partial_path* parp, void** hval) argument
96 unsigned int hkey_index = hashfunc(parp);
116 hash_set(FixedSizeHash* hash, partial_path* parp) argument
151 hash_del(FixedSizeHash* hash, partial_path* parp) argument
[all...]
H A Dastar_pphash.h48 int hash_del(FixedSizeHash* hash, partial_path* parp);
49 unsigned int hashfunc(partial_path* parp);
51 int hash_get(FixedSizeHash* hash, partial_path* parp, void** hval);
52 int hash_set(FixedSizeHash* hash, partial_path* parp);
H A Dastar.c249 /*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
289 extend_path(AstarStack* stack, partial_path* parp, wtokenID extend_token_index, arc_token* arc_for_extend_token_index, bigcostdata max_cost, word_token* word_token_array, int* pwhether_complete) argument
464 free_partial_path(AstarStack* stack, partial_path* parp) argument
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
1001 astar_draw_arc_as_dotty(FILE* fp, partial_path* parp, int src_node, int *nodes_used, srec* rec) argument
1041 partial_path* parp; local
1147 partial_path* parp; local
1247 partial_path* parp; local
1321 partial_path* parp; local
[all...]
H A Dsrec_results.c185 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
287 partial_path* parp; local
365 partial_path* parp = stack->complete_paths[ibest]; local
462 partial_path* parp; local
[all...]
H A Dsrec_stats.c144 partial_path *parp; local
153 for (parp = stack->free_parp_list; parp; parp = parp->next)
/external/srec/srec/include/
H A Dastar.h122 void free_partial_path(AstarStack* stack, partial_path* parp);
123 void print_path(partial_path* parp, psrec rec, char* msg);

Completed in 73 milliseconds