/src/libvpx/vp9/encoder/vp9_cost.c
Line | Count | Source |
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 | | #include <assert.h> |
11 | | |
12 | | #include "vp9/encoder/vp9_cost.h" |
13 | | |
14 | | /* round(-log2(i/256.) * (1 << VP9_PROB_COST_SHIFT)) |
15 | | Begins with a bogus entry for simpler addressing. */ |
16 | | const uint16_t vp9_prob_cost[256] = { |
17 | | 4096, 4096, 3584, 3284, 3072, 2907, 2772, 2659, 2560, 2473, 2395, 2325, 2260, |
18 | | 2201, 2147, 2096, 2048, 2003, 1961, 1921, 1883, 1847, 1813, 1780, 1748, 1718, |
19 | | 1689, 1661, 1635, 1609, 1584, 1559, 1536, 1513, 1491, 1470, 1449, 1429, 1409, |
20 | | 1390, 1371, 1353, 1335, 1318, 1301, 1284, 1268, 1252, 1236, 1221, 1206, 1192, |
21 | | 1177, 1163, 1149, 1136, 1123, 1110, 1097, 1084, 1072, 1059, 1047, 1036, 1024, |
22 | | 1013, 1001, 990, 979, 968, 958, 947, 937, 927, 917, 907, 897, 887, |
23 | | 878, 868, 859, 850, 841, 832, 823, 814, 806, 797, 789, 780, 772, |
24 | | 764, 756, 748, 740, 732, 724, 717, 709, 702, 694, 687, 680, 673, |
25 | | 665, 658, 651, 644, 637, 631, 624, 617, 611, 604, 598, 591, 585, |
26 | | 578, 572, 566, 560, 554, 547, 541, 535, 530, 524, 518, 512, 506, |
27 | | 501, 495, 489, 484, 478, 473, 467, 462, 456, 451, 446, 441, 435, |
28 | | 430, 425, 420, 415, 410, 405, 400, 395, 390, 385, 380, 375, 371, |
29 | | 366, 361, 356, 352, 347, 343, 338, 333, 329, 324, 320, 316, 311, |
30 | | 307, 302, 298, 294, 289, 285, 281, 277, 273, 268, 264, 260, 256, |
31 | | 252, 248, 244, 240, 236, 232, 228, 224, 220, 216, 212, 209, 205, |
32 | | 201, 197, 194, 190, 186, 182, 179, 175, 171, 168, 164, 161, 157, |
33 | | 153, 150, 146, 143, 139, 136, 132, 129, 125, 122, 119, 115, 112, |
34 | | 109, 105, 102, 99, 95, 92, 89, 86, 82, 79, 76, 73, 70, |
35 | | 66, 63, 60, 57, 54, 51, 48, 45, 42, 38, 35, 32, 29, |
36 | | 26, 23, 20, 18, 15, 12, 9, 6, 3 |
37 | | }; |
38 | | |
39 | | static void cost(int *costs, vpx_tree tree, const vpx_prob *probs, int i, |
40 | 519M | int c) { |
41 | 519M | const vpx_prob prob = probs[i / 2]; |
42 | 519M | int b; |
43 | | |
44 | 519M | assert(prob != 0); |
45 | 1.55G | for (b = 0; b <= 1; ++b) { |
46 | 1.03G | const int cc = c + vp9_cost_bit(prob, b); |
47 | 1.03G | const vpx_tree_index ii = tree[i + b]; |
48 | | |
49 | 1.03G | if (ii <= 0) |
50 | 570M | costs[-ii] = cc; |
51 | 468M | else |
52 | 468M | cost(costs, tree, probs, ii, cc); |
53 | 1.03G | } |
54 | 519M | } |
55 | | |
56 | 28.9M | void vp9_cost_tokens(int *costs, const vpx_prob *probs, vpx_tree tree) { |
57 | 28.9M | cost(costs, tree, probs, 0, 0); |
58 | 28.9M | } |
59 | | |
60 | 22.3M | void vp9_cost_tokens_skip(int *costs, const vpx_prob *probs, vpx_tree tree) { |
61 | 22.3M | assert(tree[0] <= 0 && tree[1] > 0); |
62 | | |
63 | 22.3M | costs[-tree[0]] = vp9_cost_bit(probs[0], 0); |
64 | 22.3M | cost(costs, tree, probs, 2, 0); |
65 | 22.3M | } |