Line data    Source code

       1             : /*
       2             :  * Copyright (c) 2016, Alliance for Open Media. All rights reserved
       3             :  *
       4             :  * This source code is subject to the terms of the BSD 2 Clause License and
       5             :  * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
       6             :  * was not distributed with this source code in the LICENSE file, you can
       7             :  * obtain it at www.aomedia.org/license/software. If the Alliance for Open
       8             :  * Media Patent License 1.0 was not distributed with this source code in the
       9             :  * PATENTS file, you can obtain it at www.aomedia.org/license/patent.
      10             :  */
      11             : #include <assert.h>
      12             : 
      13             : #include "av1/encoder/cost.h"
      14             : #include "av1/common/entropy.h"
      15             : 
      16             : /* round(-log2(i/256.) * (1 << AV1_PROB_COST_SHIFT))
      17             :    Begins with a bogus entry for simpler addressing. */
      18             : const uint16_t av1_prob_cost[256] = {
      19             :   4096, 4096, 3584, 3284, 3072, 2907, 2772, 2659, 2560, 2473, 2395, 2325, 2260,
      20             :   2201, 2147, 2096, 2048, 2003, 1961, 1921, 1883, 1847, 1813, 1780, 1748, 1718,
      21             :   1689, 1661, 1635, 1609, 1584, 1559, 1536, 1513, 1491, 1470, 1449, 1429, 1409,
      22             :   1390, 1371, 1353, 1335, 1318, 1301, 1284, 1268, 1252, 1236, 1221, 1206, 1192,
      23             :   1177, 1163, 1149, 1136, 1123, 1110, 1097, 1084, 1072, 1059, 1047, 1036, 1024,
      24             :   1013, 1001, 990,  979,  968,  958,  947,  937,  927,  917,  907,  897,  887,
      25             :   878,  868,  859,  850,  841,  832,  823,  814,  806,  797,  789,  780,  772,
      26             :   764,  756,  748,  740,  732,  724,  717,  709,  702,  694,  687,  680,  673,
      27             :   665,  658,  651,  644,  637,  631,  624,  617,  611,  604,  598,  591,  585,
      28             :   578,  572,  566,  560,  554,  547,  541,  535,  530,  524,  518,  512,  506,
      29             :   501,  495,  489,  484,  478,  473,  467,  462,  456,  451,  446,  441,  435,
      30             :   430,  425,  420,  415,  410,  405,  400,  395,  390,  385,  380,  375,  371,
      31             :   366,  361,  356,  352,  347,  343,  338,  333,  329,  324,  320,  316,  311,
      32             :   307,  302,  298,  294,  289,  285,  281,  277,  273,  268,  264,  260,  256,
      33             :   252,  248,  244,  240,  236,  232,  228,  224,  220,  216,  212,  209,  205,
      34             :   201,  197,  194,  190,  186,  182,  179,  175,  171,  168,  164,  161,  157,
      35             :   153,  150,  146,  143,  139,  136,  132,  129,  125,  122,  119,  115,  112,
      36             :   109,  105,  102,  99,   95,   92,   89,   86,   82,   79,   76,   73,   70,
      37             :   66,   63,   60,   57,   54,   51,   48,   45,   42,   38,   35,   32,   29,
      38             :   26,   23,   20,   18,   15,   12,   9,    6,    3
      39             : };
      40             : 
      41           0 : static void cost(int *costs, aom_tree tree, const aom_prob *probs, int i,
      42             :                  int c) {
      43           0 :   const aom_prob prob = probs[i / 2];
      44             :   int b;
      45             : 
      46           0 :   assert(prob != 0);
      47           0 :   for (b = 0; b <= 1; ++b) {
      48           0 :     const int cc = c + av1_cost_bit(prob, b);
      49           0 :     const aom_tree_index ii = tree[i + b];
      50             : 
      51           0 :     if (ii <= 0)
      52           0 :       costs[-ii] = cc;
      53             :     else
      54           0 :       cost(costs, tree, probs, ii, cc);
      55             :   }
      56           0 : }
      57             : 
      58           0 : void av1_cost_tokens(int *costs, const aom_prob *probs, aom_tree tree) {
      59           0 :   cost(costs, tree, probs, 0, 0);
      60           0 : }
      61             : 
      62           0 : void av1_cost_tokens_skip(int *costs, const aom_prob *probs, aom_tree tree) {
      63           0 :   assert(tree[0] <= 0 && tree[1] > 0);
      64             : 
      65           0 :   costs[-tree[0]] = av1_cost_bit(probs[0], 0);
      66           0 :   cost(costs, tree, probs, 2, 0);
      67           0 : }