You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

117 lines
4.0KB

  1. /*
  2. * Copyright (C) 2007 Marco Gerards <marco@gnu.org>
  3. * Copyright (C) 2009 David Conrad
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * Arithmetic decoder for Dirac
  24. * @author Marco Gerards <marco@gnu.org>
  25. */
  26. #include "dirac_arith.h"
  27. const uint16_t ff_dirac_prob[256] = {
  28. 0, 2, 5, 8, 11, 15, 20, 24,
  29. 29, 35, 41, 47, 53, 60, 67, 74,
  30. 82, 89, 97, 106, 114, 123, 132, 141,
  31. 150, 160, 170, 180, 190, 201, 211, 222,
  32. 233, 244, 256, 267, 279, 291, 303, 315,
  33. 327, 340, 353, 366, 379, 392, 405, 419,
  34. 433, 447, 461, 475, 489, 504, 518, 533,
  35. 548, 563, 578, 593, 609, 624, 640, 656,
  36. 672, 688, 705, 721, 738, 754, 771, 788,
  37. 805, 822, 840, 857, 875, 892, 910, 928,
  38. 946, 964, 983, 1001, 1020, 1038, 1057, 1076,
  39. 1095, 1114, 1133, 1153, 1172, 1192, 1211, 1231,
  40. 1251, 1271, 1291, 1311, 1332, 1352, 1373, 1393,
  41. 1414, 1435, 1456, 1477, 1498, 1520, 1541, 1562,
  42. 1584, 1606, 1628, 1649, 1671, 1694, 1716, 1738,
  43. 1760, 1783, 1806, 1828, 1851, 1874, 1897, 1920,
  44. 1935, 1942, 1949, 1955, 1961, 1968, 1974, 1980,
  45. 1985, 1991, 1996, 2001, 2006, 2011, 2016, 2021,
  46. 2025, 2029, 2033, 2037, 2040, 2044, 2047, 2050,
  47. 2053, 2056, 2058, 2061, 2063, 2065, 2066, 2068,
  48. 2069, 2070, 2071, 2072, 2072, 2072, 2072, 2072,
  49. 2072, 2071, 2070, 2069, 2068, 2066, 2065, 2063,
  50. 2060, 2058, 2055, 2052, 2049, 2045, 2042, 2038,
  51. 2033, 2029, 2024, 2019, 2013, 2008, 2002, 1996,
  52. 1989, 1982, 1975, 1968, 1960, 1952, 1943, 1934,
  53. 1925, 1916, 1906, 1896, 1885, 1874, 1863, 1851,
  54. 1839, 1827, 1814, 1800, 1786, 1772, 1757, 1742,
  55. 1727, 1710, 1694, 1676, 1659, 1640, 1622, 1602,
  56. 1582, 1561, 1540, 1518, 1495, 1471, 1447, 1422,
  57. 1396, 1369, 1341, 1312, 1282, 1251, 1219, 1186,
  58. 1151, 1114, 1077, 1037, 995, 952, 906, 857,
  59. 805, 750, 690, 625, 553, 471, 376, 255
  60. };
  61. const uint8_t ff_dirac_next_ctx[DIRAC_CTX_COUNT] = {
  62. [CTX_ZPZN_F1] = CTX_ZP_F2,
  63. [CTX_ZPNN_F1] = CTX_ZP_F2,
  64. [CTX_ZP_F2] = CTX_ZP_F3,
  65. [CTX_ZP_F3] = CTX_ZP_F4,
  66. [CTX_ZP_F4] = CTX_ZP_F5,
  67. [CTX_ZP_F5] = CTX_ZP_F6,
  68. [CTX_ZP_F6] = CTX_ZP_F6,
  69. [CTX_NPZN_F1] = CTX_NP_F2,
  70. [CTX_NPNN_F1] = CTX_NP_F2,
  71. [CTX_NP_F2] = CTX_NP_F3,
  72. [CTX_NP_F3] = CTX_NP_F4,
  73. [CTX_NP_F4] = CTX_NP_F5,
  74. [CTX_NP_F5] = CTX_NP_F6,
  75. [CTX_NP_F6] = CTX_NP_F6,
  76. [CTX_DELTA_Q_F] = CTX_DELTA_Q_F,
  77. };
  78. int16_t ff_dirac_prob_branchless[256][2];
  79. void ff_dirac_init_arith_decoder(DiracArith *c, GetBitContext *gb, int length)
  80. {
  81. int i;
  82. align_get_bits(gb);
  83. length = FFMIN(length, get_bits_left(gb)/8);
  84. c->bytestream = gb->buffer + get_bits_count(gb)/8;
  85. c->bytestream_end = c->bytestream + length;
  86. skip_bits_long(gb, length*8);
  87. c->low = 0;
  88. for (i = 0; i < 4; i++) {
  89. c->low <<= 8;
  90. if (c->bytestream < c->bytestream_end)
  91. c->low |= *c->bytestream++;
  92. else
  93. c->low |= 0xff;
  94. }
  95. c->counter = -16;
  96. c->range = 0xffff;
  97. for (i = 0; i < 256; i++) {
  98. ff_dirac_prob_branchless[i][0] = ff_dirac_prob[255-i];
  99. ff_dirac_prob_branchless[i][1] = -ff_dirac_prob[i];
  100. }
  101. for (i = 0; i < DIRAC_CTX_COUNT; i++)
  102. c->contexts[i] = 0x8000;
  103. }