Lines Matching defs:paths
560 TrellisPath paths[TRELLIS_STAGES][TRELLIS_STATES];
607 paths[0][i].cost = 0.0f;
608 paths[0][i].prev = -1;
612 paths[j][i].cost = INFINITY;
613 paths[j][i].prev = -2;
666 cost = paths[idx - 1][i].cost + dist
668 if (cost < paths[idx][q].cost) {
669 paths[idx][q].cost = cost;
670 paths[idx][q].prev = i;
676 paths[idx][q].cost = paths[idx - 1][q].cost + 1;
677 paths[idx][q].prev = q;
686 mincost = paths[idx][0].cost;
689 if (paths[idx][i].cost < mincost) {
690 mincost = paths[idx][i].cost;
696 minq = paths[idx][minq].prev;