Lines Matching defs:paths
242 TrellisPath paths[TRELLIS_STAGES][TRELLIS_STATES];
292 paths[0][i].cost = 0.0f;
293 paths[0][i].prev = -1;
297 paths[j][i].cost = INFINITY;
298 paths[j][i].prev = -2;
355 cost = paths[idx - 1][i].cost + dist
357 if (cost < paths[idx][q].cost) {
358 paths[idx][q].cost = cost;
359 paths[idx][q].prev = i;
365 paths[idx][q].cost = paths[idx - 1][q].cost + 1;
366 paths[idx][q].prev = q;
375 mincost = paths[idx][0].cost;
378 if (paths[idx][i].cost < mincost) {
379 mincost = paths[idx][i].cost;
385 minq = FFMAX(paths[idx][minq].prev, 0);