Lines Matching defs:last
583 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous
585 int n, m, p, last;
592 // compute the position of the last interesting coefficient
593 last = first - 1;
598 last = n;
603 // to last + 1 (inclusive) without losing much.
604 if (last < 15) ++last;
619 for (n = first; n <= last; ++n) {
653 // Compute extra rate cost if last coeff's position is < 15
772 // b) finding 'last' non-zero coeffs in SetResidualCoeffs() is simplified.
