Lines Matching defs:cost0
391 int cost, cost0;
419 cost0 = cost;
422 cost0 = reach[id].costs[0][TRE_M_COST];
424 cost0 += reach[id].params.cost_ins;
426 cost0 += default_params.cost_ins;
432 && (cost0 >= reach_next[id].costs[0][TRE_M_COST]))
456 reach_next[id].costs[0][TRE_M_COST] = cost0;
489 int cost, cost0;
519 cost0 = cost;
522 cost0 = reach_p->costs[0][TRE_M_COST];
524 cost0 += reach_p->params.cost_del;
526 cost0 += default_params.cost_del;
533 id, dest_id, cost0, reach_p->params.max_cost));
552 && (cost0 > reach_next[dest_id].costs[0][TRE_M_COST]
553 || (cost0 == reach_next[dest_id].costs[0][TRE_M_COST]
560 DPRINT(("lose, cost0 %d, have %d\n",
561 cost0, reach_next[dest_id].costs[0][TRE_M_COST]));
587 reach_next[dest_id].costs[0][TRE_M_COST] = cost0;
594 || match_costs[TRE_M_COST] > cost0
595 || (match_costs[TRE_M_COST] == cost0
600 pos, cost0));
665 int cost, cost0, err;
679 cost0 = reach[id].costs[0][TRE_M_COST];
708 cost0 = cost;
711 cost0 = reach[id].costs[0][TRE_M_COST];
713 cost0 += reach[id].params.cost_subst;
715 cost0 += default_params.cost_subst;
718 id, dest_id, cost0));
722 id, dest_id, cost0));
735 && (cost0 > reach_next[dest_id].costs[0][TRE_M_COST]
736 || (cost0 == reach_next[dest_id].costs[0][TRE_M_COST]
771 reach_next[dest_id].costs[0][TRE_M_COST] = cost0;
778 || cost0 < match_costs[TRE_M_COST]
779 || (cost0 == match_costs[TRE_M_COST]
783 pos, cost0));
Indexes created Wed Mar 25 00:23:37 UTC 2026