Lines Matching defs:paths
561 TrellisPath paths[TRELLIS_STAGES][TRELLIS_STATES];
605 paths[0][i].cost = 0.0f;
606 paths[0][i].prev = -1;
610 paths[j][i].cost = INFINITY;
611 paths[j][i].prev = -2;
664 cost = paths[idx - 1][i].cost + dist
666 if (cost < paths[idx][q].cost) {
667 paths[idx][q].cost = cost;
668 paths[idx][q].prev = i;
674 paths[idx][q].cost = paths[idx - 1][q].cost + 1;
675 paths[idx][q].prev = q;
684 mincost = paths[idx][0].cost;
687 if (paths[idx][i].cost < mincost) {
688 mincost = paths[idx][i].cost;
694 minq = paths[idx][minq].prev;