Lines Matching full:cost
18 #include "./cost.h"
464 score_t cost; // bit cost
503 score_t cost;
521 cost = VP8BitCost(0, last_proba);
522 best_score = RDScoreTrellis(lambda, cost, max_error);
527 NODE(n, m).cost = 0;
559 cur->cost = MAX_COST;
576 score_t cost, base_cost, score;
578 if (prev->cost >= MAX_COST) { // dead node?
582 // Base cost of both terminal/non-terminal
583 base_cost = prev->cost + VP8LevelCost(tcost, level);
586 cost = base_cost;
588 cost += VP8BitCost(1, last_proba);
590 score = RDScoreTrellis(lambda, cost, total_error);
593 cur->cost = cost;
600 cost = base_cost;
601 if (n < 15) cost += VP8BitCost(0, last_proba);
602 score = RDScoreTrellis(lambda, cost, total_error);
757 // RD-opt decision. Reconstruct each modes, evalue distortion and bit-cost.
758 // Pick the mode is lower RD-cost = Rate + lamba * Distortion.
811 // return the cost array corresponding to the surrounding prediction modes.
