| 1 |
|
| /* |
| 2 |
|
| * Common bit i/o utils |
| 3 |
|
| * Copyright (c) 2000, 2001 Fabrice Bellard. |
| 4 |
|
| * |
| 5 |
|
| * This library is free software; you can redistribute it and/or |
| 6 |
|
| * modify it under the terms of the GNU Lesser General Public |
| 7 |
|
| * License as published by the Free Software Foundation; either |
| 8 |
|
| * version 2 of the License, or (at your option) any later version. |
| 9 |
|
| * |
| 10 |
|
| * This library is distributed in the hope that it will be useful, |
| 11 |
|
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 12 |
|
| * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 13 |
|
| * Lesser General Public License for more details. |
| 14 |
|
| * |
| 15 |
|
| * You should have received a copy of the GNU Lesser General Public |
| 16 |
|
| * License along with this library; if not, write to the Free Software |
| 17 |
|
| * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| 18 |
|
| * |
| 19 |
|
| * alternative bitstream reader & writer by Michael Niedermayer <michaelni@gmx.at> |
| 20 |
|
| */ |
| 21 |
|
| |
| 22 |
|
| /** |
| 23 |
|
| * @file common.c |
| 24 |
|
| * common internal api. |
| 25 |
|
| */ |
| 26 |
|
| |
| 27 |
|
| #include "avcodec.h" |
| 28 |
|
| |
| 29 |
|
| const uint8_t ff_sqrt_tab[128]={ |
| 30 |
|
| 0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, |
| 31 |
|
| 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, |
| 32 |
|
| 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, |
| 33 |
|
| 9, 9, 9, 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11 |
| 34 |
|
| }; |
| 35 |
|
| |
| 36 |
|
| const uint8_t ff_log2_tab[256]={ |
| 37 |
|
| 0,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, |
| 38 |
|
| 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, |
| 39 |
|
| 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, |
| 40 |
|
| 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, |
| 41 |
|
| 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, |
| 42 |
|
| 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, |
| 43 |
|
| 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7, |
| 44 |
|
| 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7 |
| 45 |
|
| }; |
| 46 |
|
| |
| 47 |
0 |
| void init_put_bits(PutBitContext *s, |
| 48 |
|
| uint8_t *buffer, int buffer_size, |
| 49 |
|
| void *opaque, |
| 50 |
|
| void (*write_data)(void *, uint8_t *, int)) |
| 51 |
|
| { |
| 52 |
0 |
| s->buf = buffer; |
| 53 |
0 |
| s->buf_end = s->buf + buffer_size; |
| 54 |
0 |
| s->data_out_size = 0; |
| 55 |
0 |
▶ | if(write_data!=NULL) |
Branch: 1 branch
| Branch | True | False | Total |
| if(write_data!=NULL) |
0 |
0 |
0 |
|
| 56 |
|
| { |
| 57 |
0 |
| fprintf(stderr, "write Data callback is not supported\n"); |
| 58 |
|
| } |
| 59 |
|
| #ifdef ALT_BITSTREAM_WRITER |
| 60 |
|
| s->index=0; |
| 61 |
|
| ((uint32_t*)(s->buf))[0]=0; |
| 62 |
|
| // memset(buffer, 0, buffer_size); |
| 63 |
|
| #else |
| 64 |
0 |
| s->buf_ptr = s->buf; |
| 65 |
0 |
| s->bit_left=32; |
| 66 |
0 |
| s->bit_buf=0; |
| 67 |
|
| #endif |
| 68 |
0 |
| } |
| 69 |
|
| |
| 70 |
|
| //#ifdef CONFIG_ENCODERS |
| 71 |
|
| |
| 72 |
|
| /* return the number of bits output */ |
| 73 |
0 |
| int64_t get_bit_count(PutBitContext *s) |
| 74 |
|
| { |
| 75 |
|
| #ifdef ALT_BITSTREAM_WRITER |
| 76 |
|
| return s->data_out_size * 8 + s->index; |
| 77 |
|
| #else |
| 78 |
0 |
| return (s->buf_ptr - s->buf + s->data_out_size) * 8 + 32 - (int64_t)s->bit_left; |
| 79 |
|
| #endif |
| 80 |
|
| } |
| 81 |
|
| |
| 82 |
0 |
| void align_put_bits(PutBitContext *s) |
| 83 |
|
| { |
| 84 |
|
| #ifdef ALT_BITSTREAM_WRITER |
| 85 |
|
| put_bits(s,( - s->index) & 7,0); |
| 86 |
|
| #else |
| 87 |
0 |
| put_bits(s,s->bit_left & 7,0); |
| 88 |
|
| #endif |
| 89 |
0 |
| } |
| 90 |
|
| |
| 91 |
|
| //#endif //CONFIG_ENCODERS |
| 92 |
|
| |
| 93 |
|
| /* pad the end of the output stream with zeros */ |
| 94 |
0 |
| void flush_put_bits(PutBitContext *s) |
| 95 |
|
| { |
| 96 |
|
| #ifdef ALT_BITSTREAM_WRITER |
| 97 |
|
| align_put_bits(s); |
| 98 |
|
| #else |
| 99 |
0 |
| s->bit_buf<<= s->bit_left; |
| 100 |
0 |
▶ | while (s->bit_left < 32) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (s->bit_left < 32) { |
0 |
0 |
0 |
|
| 101 |
|
| /* XXX: should test end of buffer */ |
| 102 |
0 |
| *s->buf_ptr++=s->bit_buf >> 24; |
| 103 |
0 |
| s->bit_buf<<=8; |
| 104 |
0 |
| s->bit_left+=8; |
| 105 |
|
| } |
| 106 |
0 |
| s->bit_left=32; |
| 107 |
0 |
| s->bit_buf=0; |
| 108 |
|
| #endif |
| 109 |
0 |
| } |
| 110 |
|
| |
| 111 |
|
| #ifdef CONFIG_ENCODERS |
| 112 |
|
| |
| 113 |
|
| void put_string(PutBitContext * pbc, char *s) |
| 114 |
|
| { |
| 115 |
|
| while(*s){ |
| 116 |
|
| put_bits(pbc, 8, *s); |
| 117 |
|
| s++; |
| 118 |
|
| } |
| 119 |
|
| put_bits(pbc, 8, 0); |
| 120 |
|
| } |
| 121 |
|
| |
| 122 |
|
| /* bit input functions */ |
| 123 |
|
| |
| 124 |
|
| #endif //CONFIG_ENCODERS |
| 125 |
|
| |
| 126 |
|
| /** |
| 127 |
|
| * init GetBitContext. |
| 128 |
|
| * @param buffer bitstream buffer, must be FF_INPUT_BUFFER_PADDING_SIZE bytes larger then the actual read bits |
| 129 |
|
| * because some optimized bitstream readers read 32 or 64 bit at once and could read over the end |
| 130 |
|
| * @param bit_size the size of the buffer in bits |
| 131 |
|
| */ |
| 132 |
0 |
| void init_get_bits(GetBitContext *s, |
| 133 |
|
| const uint8_t *buffer, int bit_size) |
| 134 |
|
| { |
| 135 |
0 |
| const int buffer_size= (bit_size+7)>>3; |
| 136 |
|
| |
| 137 |
0 |
| s->buffer= buffer; |
| 138 |
0 |
| s->size_in_bits= bit_size; |
| 139 |
0 |
| s->buffer_end= buffer + buffer_size; |
| 140 |
|
| #ifdef ALT_BITSTREAM_READER |
| 141 |
0 |
| s->index=0; |
| 142 |
|
| #elif defined LIBMPEG2_BITSTREAM_READER |
| 143 |
|
| #ifdef LIBMPEG2_BITSTREAM_READER_HACK |
| 144 |
|
| if ((int)buffer&1) { |
| 145 |
|
| /* word alignment */ |
| 146 |
|
| s->cache = (*buffer++)<<24; |
| 147 |
|
| s->buffer_ptr = buffer; |
| 148 |
|
| s->bit_count = 16-8; |
| 149 |
|
| } else |
| 150 |
|
| #endif |
| 151 |
|
| { |
| 152 |
|
| s->buffer_ptr = buffer; |
| 153 |
|
| s->bit_count = 16; |
| 154 |
|
| s->cache = 0; |
| 155 |
|
| } |
| 156 |
|
| #elif defined A32_BITSTREAM_READER |
| 157 |
|
| s->buffer_ptr = (uint32_t*)buffer; |
| 158 |
|
| s->bit_count = 32; |
| 159 |
|
| s->cache0 = 0; |
| 160 |
|
| s->cache1 = 0; |
| 161 |
|
| #endif |
| 162 |
|
| { |
| 163 |
0 |
| OPEN_READER(re, s) |
| 164 |
0 |
| UPDATE_CACHE(re, s) |
| 165 |
0 |
| UPDATE_CACHE(re, s) |
| 166 |
0 |
| CLOSE_READER(re, s) |
| 167 |
|
| } |
| 168 |
|
| #ifdef A32_BITSTREAM_READER |
| 169 |
|
| s->cache1 = 0; |
| 170 |
|
| #endif |
| 171 |
0 |
| } |
| 172 |
|
| |
| 173 |
|
| /** |
| 174 |
|
| * reads 0-32 bits. |
| 175 |
|
| */ |
| 176 |
0 |
| unsigned int get_bits_long(GetBitContext *s, int n){ |
| 177 |
0 |
▶ | if(n<=17) return get_bits(s, n); |
Branch: 1 branch
| Branch | True | False | Total |
| if(n<=17) return get_bits(s, n); |
0 |
0 |
0 |
|
| 178 |
|
| else{ |
| 179 |
0 |
| int ret= get_bits(s, 16) << (n-16); |
| 180 |
0 |
| return ret | get_bits(s, n-16); |
| 181 |
|
| } |
| 182 |
|
| } |
| 183 |
|
| |
| 184 |
|
| /** |
| 185 |
|
| * shows 0-32 bits. |
| 186 |
|
| */ |
| 187 |
0 |
| unsigned int show_bits_long(GetBitContext *s, int n){ |
| 188 |
0 |
▶ | if(n<=17) return show_bits(s, n); |
Branch: 1 branch
| Branch | True | False | Total |
| if(n<=17) return show_bits(s, n); |
0 |
0 |
0 |
|
| 189 |
|
| else{ |
| 190 |
0 |
| GetBitContext gb= *s; |
| 191 |
0 |
| int ret= get_bits_long(s, n); |
| 192 |
0 |
| *s= gb; |
| 193 |
0 |
| return ret; |
| 194 |
|
| } |
| 195 |
|
| } |
| 196 |
|
| |
| 197 |
0 |
| void align_get_bits(GetBitContext *s) |
| 198 |
|
| { |
| 199 |
0 |
| int n= (-get_bits_count(s)) & 7; |
| 200 |
0 |
▶ | if(n) skip_bits(s, n); |
Branch: 1 branch
| Branch | True | False | Total |
| if(n) skip_bits(s, n); |
0 |
0 |
0 |
|
| 201 |
0 |
| } |
| 202 |
|
| |
| 203 |
0 |
| int check_marker(GetBitContext *s, const char *msg) |
| 204 |
|
| { |
| 205 |
0 |
| int bit= get_bits1(s); |
| 206 |
0 |
▶ | if(!bit) printf("Marker bit missing %s\n", msg); |
Branch: 1 branch
| Branch | True | False | Total |
| if(!bit) printf("Marker bit missing %s\n", msg); |
0 |
0 |
0 |
|
| 207 |
|
| |
| 208 |
0 |
| return bit; |
| 209 |
|
| } |
| 210 |
|
| |
| 211 |
|
| /* VLC decoding */ |
| 212 |
|
| |
| 213 |
|
| //#define DEBUG_VLC |
| 214 |
|
| |
| 215 |
|
| #define GET_DATA(v, table, i, wrap, size) \ |
| 216 |
|
| {\ |
| 217 |
|
| const uint8_t *ptr = (const uint8_t *)table + i * wrap;\ |
| 218 |
|
| switch(size) {\ |
| 219 |
|
| case 1:\ |
| 220 |
|
| v = *(const uint8_t *)ptr;\ |
| 221 |
|
| break;\ |
| 222 |
|
| case 2:\ |
| 223 |
|
| v = *(const uint16_t *)ptr;\ |
| 224 |
|
| break;\ |
| 225 |
|
| default:\ |
| 226 |
|
| v = *(const uint32_t *)ptr;\ |
| 227 |
|
| break;\ |
| 228 |
|
| }\ |
| 229 |
|
| } |
| 230 |
|
| |
| 231 |
|
| |
| 232 |
0 |
| static int alloc_table(VLC *vlc, int size) |
| 233 |
|
| { |
| 234 |
|
| int index; |
| 235 |
0 |
| index = vlc->table_size; |
| 236 |
0 |
| vlc->table_size += size; |
| 237 |
0 |
▶ | if (vlc->table_size > vlc->table_allocated) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (vlc->table_size > vlc->table_allocated) { |
0 |
0 |
0 |
|
| 238 |
0 |
| vlc->table_allocated += (1 << vlc->bits); |
| 239 |
0 |
| vlc->table = av_realloc(vlc->table, |
| 240 |
0 |
| sizeof(VLC_TYPE) * 2 * vlc->table_allocated); |
| 241 |
0 |
▶ | if (!vlc->table) |
Branch: 1 branch
| Branch | True | False | Total |
| if (!vlc->table) |
0 |
0 |
0 |
|
| 242 |
0 |
| return -1; |
| 243 |
|
| } |
| 244 |
0 |
| return index; |
| 245 |
|
| } |
| 246 |
|
| |
| 247 |
0 |
| static int build_table(VLC *vlc, int table_nb_bits, |
| 248 |
|
| int nb_codes, |
| 249 |
|
| const void *bits, int bits_wrap, int bits_size, |
| 250 |
|
| const void *codes, int codes_wrap, int codes_size, |
| 251 |
|
| uint32_t code_prefix, int n_prefix) |
| 252 |
|
| { |
| 253 |
|
| int i, j, k, n, table_size, table_index, nb, n1, index; |
| 254 |
|
| uint32_t code; |
| 255 |
|
| VLC_TYPE (*table)[2]; |
| 256 |
|
| |
| 257 |
0 |
| table_size = 1 << table_nb_bits; |
| 258 |
0 |
| table_index = alloc_table(vlc, table_size); |
| 259 |
|
| #ifdef DEBUG_VLC |
| 260 |
|
| printf("new table index=%d size=%d code_prefix=%x n=%d\n", |
| 261 |
|
| table_index, table_size, code_prefix, n_prefix); |
| 262 |
|
| #endif |
| 263 |
0 |
▶ | if (table_index < 0) |
Branch: 1 branch
| Branch | True | False | Total |
| if (table_index < 0) |
0 |
0 |
0 |
|
| 264 |
0 |
| return -1; |
| 265 |
0 |
| table = &vlc->table[table_index]; |
| 266 |
|
| |
| 267 |
0 |
▶ | for(i=0;i<table_size;i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for(i=0;i<table_size;i++) { |
0 |
0 |
0 |
|
| 268 |
0 |
| table[i][1] = 0; //bits |
| 269 |
0 |
| table[i][0] = -1; //codes |
| 270 |
|
| } |
| 271 |
|
| |
| 272 |
|
| /* first pass: map codes and compute auxillary table sizes */ |
| 273 |
0 |
▶ | for(i=0;i<nb_codes;i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for(i=0;i<nb_codes;i++) { |
0 |
0 |
0 |
|
| 274 |
0 |
| GET_DATA(n, bits, i, bits_wrap, bits_size); |
| 275 |
0 |
| GET_DATA(code, codes, i, codes_wrap, codes_size); |
| 276 |
|
| /* we accept tables with holes */ |
| 277 |
0 |
▶ | if (n <= 0) |
Branch: 1 branch
| Branch | True | False | Total |
| if (n <= 0) |
0 |
0 |
0 |
|
| 278 |
0 |
| continue; |
| 279 |
|
| #if defined(DEBUG_VLC) && 0 |
| 280 |
|
| printf("i=%d n=%d code=0x%x\n", i, n, code); |
| 281 |
|
| #endif |
| 282 |
|
| /* if code matches the prefix, it is in the table */ |
| 283 |
0 |
| n -= n_prefix; |
| 284 |
0 |
▶ | if (n > 0 && (code >> n) == code_prefix) { |
Branch: 2 branches
| Branch | True | False | Total |
| if (n > 0 && (code >> n) == code_prefix) { |
0 |
0 |
0 |
| if (n > 0 && (code >> n) == code_prefix) { |
0 |
0 |
0 |
|
| 285 |
0 |
▶ | if (n <= table_nb_bits) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (n <= table_nb_bits) { |
0 |
0 |
0 |
|
| 286 |
|
| /* no need to add another table */ |
| 287 |
0 |
| j = (code << (table_nb_bits - n)) & (table_size - 1); |
| 288 |
0 |
| nb = 1 << (table_nb_bits - n); |
| 289 |
0 |
▶ | for(k=0;k<nb;k++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for(k=0;k<nb;k++) { |
0 |
0 |
0 |
|
| 290 |
|
| #ifdef DEBUG_VLC |
| 291 |
|
| printf("%4x: code=%d n=%d\n", |
| 292 |
|
| j, i, n); |
| 293 |
|
| #endif |
| 294 |
0 |
▶ | if (table[j][1] /*bits*/ != 0) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (table[j][1] /*bits*/ != 0) { |
0 |
0 |
0 |
|
| 295 |
0 |
| fprintf(stderr, "incorrect codes\n"); |
| 296 |
0 |
| av_abort(); |
| 297 |
|
| } |
| 298 |
0 |
| table[j][1] = n; //bits |
| 299 |
0 |
| table[j][0] = i; //code |
| 300 |
0 |
| j++; |
| 301 |
|
| } |
| 302 |
|
| } else { |
| 303 |
0 |
| n -= table_nb_bits; |
| 304 |
0 |
| j = (code >> n) & ((1 << table_nb_bits) - 1); |
| 305 |
|
| #ifdef DEBUG_VLC |
| 306 |
|
| printf("%4x: n=%d (subtable)\n", |
| 307 |
|
| j, n); |
| 308 |
|
| #endif |
| 309 |
|
| /* compute table size */ |
| 310 |
0 |
| n1 = -table[j][1]; //bits |
| 311 |
0 |
▶ | if (n > n1) |
Branch: 1 branch
| Branch | True | False | Total |
| if (n > n1) |
0 |
0 |
0 |
|
| 312 |
0 |
| n1 = n; |
| 313 |
0 |
| table[j][1] = -n1; //bits |
| 314 |
|
| } |
| 315 |
|
| } |
| 316 |
|
| } |
| 317 |
|
| |
| 318 |
|
| /* second pass : fill auxillary tables recursively */ |
| 319 |
0 |
▶ | for(i=0;i<table_size;i++) { |
Branch: 1 branch
| Branch | True | False | Total |
| for(i=0;i<table_size;i++) { |
0 |
0 |
0 |
|
| 320 |
0 |
| n = table[i][1]; //bits |
| 321 |
0 |
▶ | if (n < 0) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (n < 0) { |
0 |
0 |
0 |
|
| 322 |
0 |
| n = -n; |
| 323 |
0 |
▶ | if (n > table_nb_bits) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (n > table_nb_bits) { |
0 |
0 |
0 |
|
| 324 |
0 |
| n = table_nb_bits; |
| 325 |
0 |
| table[i][1] = -n; //bits |
| 326 |
|
| } |
| 327 |
0 |
| index = build_table(vlc, n, nb_codes, |
| 328 |
|
| bits, bits_wrap, bits_size, |
| 329 |
|
| codes, codes_wrap, codes_size, |
| 330 |
0 |
| (code_prefix << table_nb_bits) | i, |
| 331 |
|
| n_prefix + table_nb_bits); |
| 332 |
0 |
▶ | if (index < 0) |
Branch: 1 branch
| Branch | True | False | Total |
| if (index < 0) |
0 |
0 |
0 |
|
| 333 |
0 |
| return -1; |
| 334 |
|
| /* note: realloc has been done, so reload tables */ |
| 335 |
0 |
| table = &vlc->table[table_index]; |
| 336 |
0 |
| table[i][0] = index; //code |
| 337 |
|
| } |
| 338 |
|
| } |
| 339 |
0 |
| return table_index; |
| 340 |
|
| } |
| 341 |
|
| |
| 342 |
|
| |
| 343 |
|
| /* Build VLC decoding tables suitable for use with get_vlc(). |
| 344 |
|
| |
| 345 |
|
| 'nb_bits' set thee decoding table size (2^nb_bits) entries. The |
| 346 |
|
| bigger it is, the faster is the decoding. But it should not be too |
| 347 |
|
| big to save memory and L1 cache. '9' is a good compromise. |
| 348 |
|
| |
| 349 |
|
| 'nb_codes' : number of vlcs codes |
| 350 |
|
| |
| 351 |
|
| 'bits' : table which gives the size (in bits) of each vlc code. |
| 352 |
|
| |
| 353 |
|
| 'codes' : table which gives the bit pattern of of each vlc code. |
| 354 |
|
| |
| 355 |
|
| 'xxx_wrap' : give the number of bytes between each entry of the |
| 356 |
|
| 'bits' or 'codes' tables. |
| 357 |
|
| |
| 358 |
|
| 'xxx_size' : gives the number of bytes of each entry of the 'bits' |
| 359 |
|
| or 'codes' tables. |
| 360 |
|
| |
| 361 |
|
| 'wrap' and 'size' allows to use any memory configuration and types |
| 362 |
|
| (byte/word/long) to store the 'bits' and 'codes' tables. |
| 363 |
|
| */ |
| 364 |
0 |
| int init_vlc(VLC *vlc, int nb_bits, int nb_codes, |
| 365 |
|
| const void *bits, int bits_wrap, int bits_size, |
| 366 |
|
| const void *codes, int codes_wrap, int codes_size) |
| 367 |
|
| { |
| 368 |
0 |
| vlc->bits = nb_bits; |
| 369 |
0 |
| vlc->table = NULL; |
| 370 |
0 |
| vlc->table_allocated = 0; |
| 371 |
0 |
| vlc->table_size = 0; |
| 372 |
|
| #ifdef DEBUG_VLC |
| 373 |
|
| printf("build table nb_codes=%d\n", nb_codes); |
| 374 |
|
| #endif |
| 375 |
|
| |
| 376 |
0 |
▶ | if (build_table(vlc, nb_bits, nb_codes, |
Branch: 1 branch
| Branch | True | False | Total |
| if (build_table(vlc, nb_bits, nb_codes, |
0 |
0 |
0 |
|
| 377 |
|
| bits, bits_wrap, bits_size, |
| 378 |
|
| codes, codes_wrap, codes_size, |
| 379 |
|
| 0, 0) < 0) { |
| 380 |
0 |
| av_free(vlc->table); |
| 381 |
0 |
| return -1; |
| 382 |
|
| } |
| 383 |
0 |
| return 0; |
| 384 |
|
| } |
| 385 |
|
| |
| 386 |
|
| |
| 387 |
0 |
| void free_vlc(VLC *vlc) |
| 388 |
|
| { |
| 389 |
0 |
| av_free(vlc->table); |
| 390 |
0 |
| } |
| 391 |
|
| |
| 392 |
0 |
| int64_t ff_gcd(int64_t a, int64_t b){ |
| 393 |
0 |
▶ | if(b) return ff_gcd(b, a%b); |
Branch: 1 branch
| Branch | True | False | Total |
| if(b) return ff_gcd(b, a%b); |
0 |
0 |
0 |
|
| 394 |
0 |
| else return a; |
| 395 |
|
| } |
| 396 |
|
| |
| 397 |
0 |
| void ff_float2fraction(int *nom_arg, int *denom_arg, double f, int max){ |
| 398 |
0 |
| double best_diff=1E10, diff; |
| 399 |
0 |
| int best_denom=1, best_nom=1; |
| 400 |
|
| int nom, denom, gcd; |
| 401 |
|
| |
| 402 |
|
| //brute force here, perhaps we should try continued fractions if we need large max ... |
| 403 |
0 |
▶ | for(denom=1; denom<=max; denom++){ |
Branch: 1 branch
| Branch | True | False | Total |
| for(denom=1; denom<=max; denom++){ |
0 |
0 |
0 |
|
| 404 |
0 |
| nom= (int)(f*denom + 0.5); |
| 405 |
0 |
▶ | if(nom<=0 || nom>max) continue; |
Branch: 2 branches
| Branch | True | False | Total |
| if(nom<=0 || nom>max) continue; |
0 |
0 |
0 |
| if(nom<=0 || nom>max) continue; |
0 |
0 |
0 |
|
| 406 |
|
| |
| 407 |
0 |
▶ | diff= ABS( f - (double)nom / (double)denom ); |
Branch: 1 branch
| Branch | True | False | Total |
| diff= ABS( f - (double)nom / (double)denom ); |
0 |
0 |
0 |
|
| 408 |
0 |
▶ | if(diff < best_diff){ |
Branch: 1 branch
| Branch | True | False | Total |
| if(diff < best_diff){ |
0 |
0 |
0 |
|
| 409 |
0 |
| best_diff= diff; |
| 410 |
0 |
| best_nom= nom; |
| 411 |
0 |
| best_denom= denom; |
| 412 |
|
| } |
| 413 |
|
| } |
| 414 |
|
| |
| 415 |
0 |
| gcd= ff_gcd(best_nom, best_denom); |
| 416 |
0 |
| best_nom /= gcd; |
| 417 |
0 |
| best_denom /= gcd; |
| 418 |
|
| |
| 419 |
0 |
| *nom_arg= best_nom; |
| 420 |
0 |
| *denom_arg= best_denom; |
| 421 |
0 |
| } |