32 0, 2, 5, 8, 11, 15, 20, 24,
33 29, 35, 41, 47, 53, 60, 67, 74,
34 82, 89, 97, 106, 114, 123, 132, 141,
35 150, 160, 170, 180, 190, 201, 211, 222,
36 233, 244, 256, 267, 279, 291, 303, 315,
37 327, 340, 353, 366, 379, 392, 405, 419,
38 433, 447, 461, 475, 489, 504, 518, 533,
39 548, 563, 578, 593, 609, 624, 640, 656,
40 672, 688, 705, 721, 738, 754, 771, 788,
41 805, 822, 840, 857, 875, 892, 910, 928,
42 946, 964, 983, 1001, 1020, 1038, 1057, 1076,
43 1095, 1114, 1133, 1153, 1172, 1192, 1211, 1231,
44 1251, 1271, 1291, 1311, 1332, 1352, 1373, 1393,
45 1414, 1435, 1456, 1477, 1498, 1520, 1541, 1562,
46 1584, 1606, 1628, 1649, 1671, 1694, 1716, 1738,
47 1760, 1783, 1806, 1828, 1851, 1874, 1897, 1920,
48 1935, 1942, 1949, 1955, 1961, 1968, 1974, 1980,
49 1985, 1991, 1996, 2001, 2006, 2011, 2016, 2021,
50 2025, 2029, 2033, 2037, 2040, 2044, 2047, 2050,
51 2053, 2056, 2058, 2061, 2063, 2065, 2066, 2068,
52 2069, 2070, 2071, 2072, 2072, 2072, 2072, 2072,
53 2072, 2071, 2070, 2069, 2068, 2066, 2065, 2063,
54 2060, 2058, 2055, 2052, 2049, 2045, 2042, 2038,
55 2033, 2029, 2024, 2019, 2013, 2008, 2002, 1996,
56 1989, 1982, 1975, 1968, 1960, 1952, 1943, 1934,
57 1925, 1916, 1906, 1896, 1885, 1874, 1863, 1851,
58 1839, 1827, 1814, 1800, 1786, 1772, 1757, 1742,
59 1727, 1710, 1694, 1676, 1659, 1640, 1622, 1602,
60 1582, 1561, 1540, 1518, 1495, 1471, 1447, 1422,
61 1396, 1369, 1341, 1312, 1282, 1251, 1219, 1186,
62 1151, 1114, 1077, 1037, 995, 952, 906, 857,
63 805, 750, 690, 625, 553, 471, 376, 255
90 for (i = 0; i < 256; i++) {
108 for (i = 0; i < 4; i++) {
int16_t ff_dirac_prob_branchless[256][2]
static void skip_bits_long(GetBitContext *s, int n)
Skips the specified number of bits.
const uint8_t ff_dirac_next_ctx[DIRAC_CTX_COUNT]
void ff_dirac_init_arith_decoder(DiracArith *c, GetBitContext *gb, int length)
uint16_t contexts[DIRAC_CTX_COUNT]
static const uint16_t dirac_prob[256]
Undefined Behavior In the C some operations are like signed integer dereferencing freed accessing outside allocated Undefined Behavior must not occur in a C it is not safe even if the output of undefined operations is unused The unsafety may seem nit picking but Optimizing compilers have in fact optimized code on the assumption that no undefined Behavior occurs Optimizing code based on wrong assumptions can and has in some cases lead to effects beyond the output of computations The signed integer overflow problem in speed critical code Code which is highly optimized and works with signed integers sometimes has the problem that often the output of the computation does not c
static int get_bits_count(const GetBitContext *s)
static int get_bits_left(GetBitContext *gb)
const uint8_t * bytestream
const uint8_t * bytestream_end
Arithmetic decoder for Dirac.
static const uint8_t * align_get_bits(GetBitContext *s)
av_cold void ff_dirac_init_arith_tables(void)