File: bitstream.c

package info (click to toggle)
gmerlin-avdecoder 2.0.0~svn6298~dfsg0-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 6,112 kB
  • sloc: ansic: 94,580; sh: 705; makefile: 705; awk: 43; sed: 16
file content (212 lines) | stat: -rw-r--r-- 4,442 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
/*****************************************************************
 * gmerlin-avdecoder - a general purpose multimedia decoding library
 *
 * Copyright (c) 2001 - 2012 Members of the Gmerlin project
 * gmerlin-general@lists.sourceforge.net
 * http://gmerlin.sourceforge.net
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 * *****************************************************************/

#include <avdec_private.h>
#include <bitstream.h>

//#define OLD_BITSTREAM

static inline void fill_cache(bgav_bitstream_t * b)
  {
  int i;
  int bytes = sizeof(b->c);
  
  if(b->end - b->pos < bytes)
    bytes = b->end - b->pos;

  b->c = 0;
  
  for(i = 0; i < bytes; i++)
    {
    b->c <<= 8;
    b->c |= *b->pos;
    b->pos++;
    }
  b->bit_cache = bytes * 8;
  }

void bgav_bitstream_init(bgav_bitstream_t * b, const uint8_t * pos, 
                         int len)
  {
  b->pos = pos;
  b->end = pos + len;
#ifdef OLD_BITSTREAM
  b->c = *pos;
  b->pos++;
  b->bit_cache = 8;
#else
  fill_cache(b);
#endif
  }

int bgav_bitstream_get_long(bgav_bitstream_t * b, int64_t * ret1,  int bits)
  {
  int bits_read = 0;
  int bits_to_copy;
  int64_t ret = 0;

  while(bits_read < bits)
    {
    if(!b->bit_cache)
      {
      if(b->pos >= b->end)
        return 0;
#ifdef OLD_BITSTREAM
      b->c = *b->pos;
      b->pos++;
      b->bit_cache = 8;
#else
      fill_cache(b);
#endif
      }
    bits_to_copy = bits - bits_read;
    if(bits_to_copy > b->bit_cache)
      bits_to_copy = b->bit_cache;
    
    ret <<= bits_to_copy;
    ret |= (b->c >> (b->bit_cache-bits_to_copy)) & (((1<<bits_to_copy)-1));
    bits_read += bits_to_copy;
    b->bit_cache -= bits_to_copy;
    }
  *ret1 = ret;
  return 1;
  }

int bgav_bitstream_get(bgav_bitstream_t * b, int * ret,  int bits)
  {
  int64_t tmp;
  if(!bgav_bitstream_get_long(b, &tmp, bits))
    return 0;
  *ret = tmp;
  return 1;
  }

int bgav_bitstream_get_bits(bgav_bitstream_t * b)
  {
  return b->bit_cache + 8 * (b->end - b->pos);
  }

int bgav_bitstream_peek(bgav_bitstream_t * b, int * ret, int bits)
  {
  int64_t tmp = 0;
  int result;
  
  /* State is saved here */
  const uint8_t * pos;
  int bit_cache;
  uint32_t c;

  /* Save state */
  pos       = b->pos;
  bit_cache = b->bit_cache;
  c         = b->c;
  
  result = bgav_bitstream_get_long(b, &tmp, bits);

  /* Restore state */
  b->pos       = pos;
  b->bit_cache = bit_cache;
  b->c         = c;

  *ret = tmp;
  
  return result;
  }

int bgav_bitstream_skip(bgav_bitstream_t * b, int bits)
  {
  int64_t tmp;
  return bgav_bitstream_get_long(b, &tmp, bits);
  }

/* golomb parsing */

int bgav_bitstream_get_golomb_ue(bgav_bitstream_t * b, int * ret)
  {
  int bits, num = 0;
  while(1)
    {
    if(!bgav_bitstream_get(b, &bits, 1))
      return 0;
    if(bits)
      break;
    else
      num++;
    }
  /* The variable codeNum is then assigned as follows:
     codeNum = 2^leadingZeroBits - 1 + read_bits( leadingZeroBits ) */
  
  if(!bgav_bitstream_get(b, &bits, num))
    return 0;
  
  *ret = (1 << num) - 1 + bits;
  return 1;
  }

int bgav_bitstream_get_golomb_se(bgav_bitstream_t * b, int * ret)
  {
  int ret1;
  if(!bgav_bitstream_get_golomb_ue(b, &ret1))
    return 0;

  if(ret1 & 1)
    *ret = ret1>>1;
  else
    *ret = -(ret1>>1);
  return 1;
  }

int bgav_bitstream_decode012(bgav_bitstream_t * b, int * ret)
  {
  int n;

  if(!bgav_bitstream_get(b, &n, 1))
    return 0;

  if(!n)
    {
    *ret = 0;
    return 1;
    }

  if(!bgav_bitstream_get(b, &n, 1))
    return 0;
  *ret = n + 1;
  return 1;
  }

int bgav_bitstream_get_unary(bgav_bitstream_t * b, int stop,
                             int len, int * ret)
  {
  int i = 0;
  int tmp;
  
  while(i < len)
    {
    if(!bgav_bitstream_get(b, &tmp, 1))
      return 0;
    if(tmp == stop)
      break;
    i++;
    }
  *ret = i;
  return 1;
  }