Lines Matching refs:best
275 int best;
344 /* And pick the best. */
345 best = rd_cost1 < rd_cost0;
349 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
350 tokens[i][0].error = d2 + (best ? error1 : error0);
354 best_mask[0] |= best << i;
410 /* And pick the best. */
411 best = rd_cost1 < rd_cost0;
419 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
420 tokens[i][1].error = d2 + (best ? error1 : error0);
422 tokens[i][1].token =best?t1:t0;
424 best_mask[1] |= best << i;
451 /* Now pick the best path through the whole trellis. */
469 best = rd_cost1 < rd_cost0;
473 x = tokens[i][best].qc;
479 next = tokens[i][best].next;
480 best = (best_mask[best] >> i) & 1;
