Lines Matching refs:best
288 int best;
361 /* And pick the best. */
362 best = rd_cost1 < rd_cost0;
366 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
367 tokens[i][0].error = d2 + (best ? error1 : error0);
371 best_mask[0] |= best << i;
427 /* And pick the best. */
428 best = rd_cost1 < rd_cost0;
436 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
437 tokens[i][1].error = d2 + (best ? error1 : error0);
439 tokens[i][1].token =best?t1:t0;
441 best_mask[1] |= best << i;
468 /* Now pick the best path through the whole trellis. */
486 best = rd_cost1 < rd_cost0;
490 x = tokens[i][best].qc;
496 next = tokens[i][best].next;
497 best = (best_mask[best] >> i) & 1;