1cabdff1aSopenharmony_ci/* 2cabdff1aSopenharmony_ci * This file is part of FFmpeg. 3cabdff1aSopenharmony_ci * 4cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or 5cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public 6cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either 7cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version. 8cabdff1aSopenharmony_ci * 9cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful, 10cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of 11cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12cabdff1aSopenharmony_ci * Lesser General Public License for more details. 13cabdff1aSopenharmony_ci * 14cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public 15cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software 16cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 17cabdff1aSopenharmony_ci */ 18cabdff1aSopenharmony_ci 19cabdff1aSopenharmony_ci#include <stdint.h> 20cabdff1aSopenharmony_ci#include <string.h> 21cabdff1aSopenharmony_ci 22cabdff1aSopenharmony_ci#include "libavutil/attributes.h" 23cabdff1aSopenharmony_ci#include "libavutil/avassert.h" 24cabdff1aSopenharmony_ci 25cabdff1aSopenharmony_ci#include "rl.h" 26cabdff1aSopenharmony_ci 27cabdff1aSopenharmony_ciav_cold void ff_rl_init(RLTable *rl, 28cabdff1aSopenharmony_ci uint8_t static_store[2][2 * MAX_RUN + MAX_LEVEL + 3]) 29cabdff1aSopenharmony_ci{ 30cabdff1aSopenharmony_ci int last, run, level, start, end, i; 31cabdff1aSopenharmony_ci 32cabdff1aSopenharmony_ci /* compute max_level[], max_run[] and index_run[] */ 33cabdff1aSopenharmony_ci for (last = 0; last < 2; last++) { 34cabdff1aSopenharmony_ci int8_t *max_level = static_store[last]; 35cabdff1aSopenharmony_ci int8_t *max_run = static_store[last] + MAX_RUN + 1; 36cabdff1aSopenharmony_ci uint8_t *index_run = static_store[last] + MAX_RUN + 1 + MAX_LEVEL + 1; 37cabdff1aSopenharmony_ci if (last == 0) { 38cabdff1aSopenharmony_ci start = 0; 39cabdff1aSopenharmony_ci end = rl->last; 40cabdff1aSopenharmony_ci } else { 41cabdff1aSopenharmony_ci start = rl->last; 42cabdff1aSopenharmony_ci end = rl->n; 43cabdff1aSopenharmony_ci } 44cabdff1aSopenharmony_ci 45cabdff1aSopenharmony_ci memset(index_run, rl->n, MAX_RUN + 1); 46cabdff1aSopenharmony_ci for (i = start; i < end; i++) { 47cabdff1aSopenharmony_ci run = rl->table_run[i]; 48cabdff1aSopenharmony_ci level = rl->table_level[i]; 49cabdff1aSopenharmony_ci if (index_run[run] == rl->n) 50cabdff1aSopenharmony_ci index_run[run] = i; 51cabdff1aSopenharmony_ci if (level > max_level[run]) 52cabdff1aSopenharmony_ci max_level[run] = level; 53cabdff1aSopenharmony_ci if (run > max_run[level]) 54cabdff1aSopenharmony_ci max_run[level] = run; 55cabdff1aSopenharmony_ci } 56cabdff1aSopenharmony_ci rl->max_level[last] = max_level; 57cabdff1aSopenharmony_ci rl->max_run[last] = max_run; 58cabdff1aSopenharmony_ci rl->index_run[last] = index_run; 59cabdff1aSopenharmony_ci } 60cabdff1aSopenharmony_ci} 61cabdff1aSopenharmony_ci 62cabdff1aSopenharmony_ciav_cold void ff_rl_init_vlc(RLTable *rl, unsigned static_size) 63cabdff1aSopenharmony_ci{ 64cabdff1aSopenharmony_ci int i, q; 65cabdff1aSopenharmony_ci VLCElem table[1500] = { 0 }; 66cabdff1aSopenharmony_ci VLC vlc = { .table = table, .table_allocated = static_size }; 67cabdff1aSopenharmony_ci av_assert0(static_size <= FF_ARRAY_ELEMS(table)); 68cabdff1aSopenharmony_ci 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); 69cabdff1aSopenharmony_ci 70cabdff1aSopenharmony_ci for (q = 0; q < 32; q++) { 71cabdff1aSopenharmony_ci int qmul = q * 2; 72cabdff1aSopenharmony_ci int qadd = (q - 1) | 1; 73cabdff1aSopenharmony_ci 74cabdff1aSopenharmony_ci if (!rl->rl_vlc[q]) 75cabdff1aSopenharmony_ci return; 76cabdff1aSopenharmony_ci 77cabdff1aSopenharmony_ci if (q == 0) { 78cabdff1aSopenharmony_ci qmul = 1; 79cabdff1aSopenharmony_ci qadd = 0; 80cabdff1aSopenharmony_ci } 81cabdff1aSopenharmony_ci for (i = 0; i < vlc.table_size; i++) { 82cabdff1aSopenharmony_ci int code = vlc.table[i].sym; 83cabdff1aSopenharmony_ci int len = vlc.table[i].len; 84cabdff1aSopenharmony_ci int level, run; 85cabdff1aSopenharmony_ci 86cabdff1aSopenharmony_ci if (len == 0) { // illegal code 87cabdff1aSopenharmony_ci run = 66; 88cabdff1aSopenharmony_ci level = MAX_LEVEL; 89cabdff1aSopenharmony_ci } else if (len < 0) { // more bits needed 90cabdff1aSopenharmony_ci run = 0; 91cabdff1aSopenharmony_ci level = code; 92cabdff1aSopenharmony_ci } else { 93cabdff1aSopenharmony_ci if (code == rl->n) { // esc 94cabdff1aSopenharmony_ci run = 66; 95cabdff1aSopenharmony_ci level = 0; 96cabdff1aSopenharmony_ci } else { 97cabdff1aSopenharmony_ci run = rl->table_run[code] + 1; 98cabdff1aSopenharmony_ci level = rl->table_level[code] * qmul + qadd; 99cabdff1aSopenharmony_ci if (code >= rl->last) run += 192; 100cabdff1aSopenharmony_ci } 101cabdff1aSopenharmony_ci } 102cabdff1aSopenharmony_ci rl->rl_vlc[q][i].len = len; 103cabdff1aSopenharmony_ci rl->rl_vlc[q][i].level = level; 104cabdff1aSopenharmony_ci rl->rl_vlc[q][i].run = run; 105cabdff1aSopenharmony_ci } 106cabdff1aSopenharmony_ci } 107cabdff1aSopenharmony_ci} 108