2 * This file is part of FFmpeg.
4 * FFmpeg is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * FFmpeg is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with FFmpeg; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
22 #include "libavutil/attributes.h"
23 #include "libavutil/avassert.h"
24 #include "libavutil/mem.h"
28 void ff_rl_free(RLTable *rl)
32 for (i = 0; i < 2; i++) {
33 av_freep(&rl->max_run[i]);
34 av_freep(&rl->max_level[i]);
35 av_freep(&rl->index_run[i]);
39 av_cold int ff_rl_init(RLTable *rl,
40 uint8_t static_store[2][2 * MAX_RUN + MAX_LEVEL + 3])
42 int8_t max_level[MAX_RUN + 1], max_run[MAX_LEVEL + 1];
43 uint8_t index_run[MAX_RUN + 1];
44 int last, run, level, start, end, i;
46 /* If table is static, we can quit if rl->max_level[0] is not NULL */
47 if (static_store && rl->max_level[0])
50 /* compute max_level[], max_run[] and index_run[] */
51 for (last = 0; last < 2; last++) {
60 memset(max_level, 0, MAX_RUN + 1);
61 memset(max_run, 0, MAX_LEVEL + 1);
62 memset(index_run, rl->n, MAX_RUN + 1);
63 for (i = start; i < end; i++) {
64 run = rl->table_run[i];
65 level = rl->table_level[i];
66 if (index_run[run] == rl->n)
68 if (level > max_level[run])
69 max_level[run] = level;
70 if (run > max_run[level])
74 rl->max_level[last] = static_store[last];
76 rl->max_level[last] = av_malloc(MAX_RUN + 1);
77 if (!rl->max_level[last])
80 memcpy(rl->max_level[last], max_level, MAX_RUN + 1);
82 rl->max_run[last] = static_store[last] + MAX_RUN + 1;
84 rl->max_run[last] = av_malloc(MAX_LEVEL + 1);
85 if (!rl->max_run[last])
88 memcpy(rl->max_run[last], max_run, MAX_LEVEL + 1);
90 rl->index_run[last] = static_store[last] + MAX_RUN + MAX_LEVEL + 2;
92 rl->index_run[last] = av_malloc(MAX_RUN + 1);
93 if (!rl->index_run[last])
96 memcpy(rl->index_run[last], index_run, MAX_RUN + 1);
102 return AVERROR(ENOMEM);
105 av_cold void ff_rl_init_vlc(RLTable *rl, unsigned static_size)
108 VLC_TYPE table[1500][2] = {{0}};
109 VLC vlc = { .table = table, .table_allocated = static_size };
110 av_assert0(static_size <= FF_ARRAY_ELEMS(table));
111 init_vlc(&vlc, 9, rl->n + 1, &rl->table_vlc[0][1], 4, 2, &rl->table_vlc[0][0], 4, 2, INIT_VLC_USE_NEW_STATIC);
113 for (q = 0; q < 32; q++) {
115 int qadd = (q - 1) | 1;
121 for (i = 0; i < vlc.table_size; i++) {
122 int code = vlc.table[i][0];
123 int len = vlc.table[i][1];
126 if (len == 0) { // illegal code
129 } else if (len < 0) { // more bits needed
133 if (code == rl->n) { // esc
137 run = rl->table_run[code] + 1;
138 level = rl->table_level[code] * qmul + qadd;
139 if (code >= rl->last) run += 192;
142 rl->rl_vlc[q][i].len = len;
143 rl->rl_vlc[q][i].level = level;
144 rl->rl_vlc[q][i].run = run;