1 /* 2 * Copyright (c) 2014 The WebM project authors. All Rights Reserved. 3 * 4 * Use of this source code is governed by a BSD-style license 5 * that can be found in the LICENSE file in the root of the source 6 * tree. An additional intellectual property rights grant can be found 7 * in the file PATENTS. All contributing project authors may 8 * be found in the AUTHORS file in the root of the source tree. 9 */ 10 11 #include "vp9/encoder/vp9_cost.h" 12 13 const unsigned int vp9_prob_cost[256] = { 14 2047, 2047, 1791, 1641, 1535, 1452, 1385, 1328, 1279, 1235, 1196, 1161, 15 1129, 1099, 1072, 1046, 1023, 1000, 979, 959, 940, 922, 905, 889, 16 873, 858, 843, 829, 816, 803, 790, 778, 767, 755, 744, 733, 17 723, 713, 703, 693, 684, 675, 666, 657, 649, 641, 633, 625, 18 617, 609, 602, 594, 587, 580, 573, 567, 560, 553, 547, 541, 19 534, 528, 522, 516, 511, 505, 499, 494, 488, 483, 477, 472, 20 467, 462, 457, 452, 447, 442, 437, 433, 428, 424, 419, 415, 21 410, 406, 401, 397, 393, 389, 385, 381, 377, 373, 369, 365, 22 361, 357, 353, 349, 346, 342, 338, 335, 331, 328, 324, 321, 23 317, 314, 311, 307, 304, 301, 297, 294, 291, 288, 285, 281, 24 278, 275, 272, 269, 266, 263, 260, 257, 255, 252, 249, 246, 25 243, 240, 238, 235, 232, 229, 227, 224, 221, 219, 216, 214, 26 211, 208, 206, 203, 201, 198, 196, 194, 191, 189, 186, 184, 27 181, 179, 177, 174, 172, 170, 168, 165, 163, 161, 159, 156, 28 154, 152, 150, 148, 145, 143, 141, 139, 137, 135, 133, 131, 29 129, 127, 125, 123, 121, 119, 117, 115, 113, 111, 109, 107, 30 105, 103, 101, 99, 97, 95, 93, 92, 90, 88, 86, 84, 31 82, 81, 79, 77, 75, 73, 72, 70, 68, 66, 65, 63, 32 61, 60, 58, 56, 55, 53, 51, 50, 48, 46, 45, 43, 33 41, 40, 38, 37, 35, 33, 32, 30, 29, 27, 25, 24, 34 22, 21, 19, 18, 16, 15, 13, 12, 10, 9, 7, 6, 35 4, 3, 1, 1}; 36 37 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, 38 int i, int c) { 39 const vp9_prob prob = probs[i / 2]; 40 int b; 41 42 for (b = 0; b <= 1; ++b) { 43 const int cc = c + vp9_cost_bit(prob, b); 44 const vp9_tree_index ii = tree[i + b]; 45 46 if (ii <= 0) 47 costs[-ii] = cc; 48 else 49 cost(costs, tree, probs, ii, cc); 50 } 51 } 52 53 void vp9_cost_tokens(int *costs, const vp9_prob *probs, vp9_tree tree) { 54 cost(costs, tree, probs, 0, 0); 55 } 56 57 void vp9_cost_tokens_skip(int *costs, const vp9_prob *probs, vp9_tree tree) { 58 assert(tree[0] <= 0 && tree[1] > 0); 59 60 costs[-tree[0]] = vp9_cost_bit(probs[0], 0); 61 cost(costs, tree, probs, 2, 0); 62 } 63
