Coverage Report

Created: 2026-03-22 06:46

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/pjsip/third_party/speex/libspeex/bits.c
Line
Count
Source
1
/* Copyright (C) 2002 Jean-Marc Valin
2
   File: speex_bits.c
3
4
   Handles bit packing/unpacking
5
6
   Redistribution and use in source and binary forms, with or without
7
   modification, are permitted provided that the following conditions
8
   are met:
9
10
   - Redistributions of source code must retain the above copyright
11
   notice, this list of conditions and the following disclaimer.
12
13
   - Redistributions in binary form must reproduce the above copyright
14
   notice, this list of conditions and the following disclaimer in the
15
   documentation and/or other materials provided with the distribution.
16
17
   - Neither the name of the Xiph.org Foundation nor the names of its
18
   contributors may be used to endorse or promote products derived from
19
   this software without specific prior written permission.
20
21
   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22
   ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23
   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24
   A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR
25
   CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
26
   EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
27
   PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
28
   PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
29
   LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
30
   NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
31
   SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32
33
*/
34
35
#ifdef HAVE_CONFIG_H
36
#include "config.h"
37
#endif
38
39
#include "speex/speex_bits.h"
40
#include "arch.h"
41
#include "os_support.h"
42
43
/* Maximum size of the bit-stream (for fixed-size allocation) */
44
#ifndef MAX_CHARS_PER_FRAME
45
4
#define MAX_CHARS_PER_FRAME (2000/BYTES_PER_CHAR)
46
#endif
47
48
EXPORT void speex_bits_init(SpeexBits *bits)
49
2
{
50
2
   bits->chars = (char*)speex_alloc(MAX_CHARS_PER_FRAME);
51
2
   if (!bits->chars)
52
0
      return;
53
54
2
   bits->buf_size = MAX_CHARS_PER_FRAME;
55
56
2
   bits->owner=1;
57
58
2
   speex_bits_reset(bits);
59
2
}
60
61
EXPORT void speex_bits_init_buffer(SpeexBits *bits, void *buff, int buf_size)
62
0
{
63
0
   bits->chars = (char*)buff;
64
0
   bits->buf_size = buf_size;
65
66
0
   bits->owner=0;
67
68
0
   speex_bits_reset(bits);
69
0
}
70
71
EXPORT void speex_bits_set_bit_buffer(SpeexBits *bits, void *buff, int buf_size)
72
0
{
73
0
   bits->chars = (char*)buff;
74
0
   bits->buf_size = buf_size;
75
76
0
   bits->owner=0;
77
78
0
   bits->nbBits=buf_size<<LOG2_BITS_PER_CHAR;
79
0
   bits->charPtr=0;
80
0
   bits->bitPtr=0;
81
0
   bits->overflow=0;
82
83
0
}
84
85
EXPORT void speex_bits_destroy(SpeexBits *bits)
86
0
{
87
0
   if (bits->owner)
88
0
      speex_free(bits->chars);
89
   /* Will do something once the allocation is dynamic */
90
0
}
91
92
EXPORT void speex_bits_reset(SpeexBits *bits)
93
1.50k
{
94
   /* We only need to clear the first byte now */
95
1.50k
   bits->chars[0]=0;
96
1.50k
   bits->nbBits=0;
97
1.50k
   bits->charPtr=0;
98
1.50k
   bits->bitPtr=0;
99
1.50k
   bits->overflow=0;
100
1.50k
}
101
102
EXPORT void speex_bits_rewind(SpeexBits *bits)
103
0
{
104
0
   bits->charPtr=0;
105
0
   bits->bitPtr=0;
106
0
   bits->overflow=0;
107
0
}
108
109
EXPORT void speex_bits_read_from(SpeexBits *bits, const char *chars, int len)
110
2.34k
{
111
2.34k
   int i;
112
2.34k
   int nchars = len / BYTES_PER_CHAR;
113
2.34k
   if (nchars > bits->buf_size)
114
0
   {
115
0
      speex_notify("Packet is larger than allocated buffer");
116
0
      if (bits->owner)
117
0
      {
118
0
         char *tmp = (char*)speex_realloc(bits->chars, nchars);
119
0
         if (tmp)
120
0
         {
121
0
            bits->buf_size=nchars;
122
0
            bits->chars=tmp;
123
0
         } else {
124
0
            nchars=bits->buf_size;
125
0
            speex_warning("Could not resize input buffer: truncating input");
126
0
         }
127
0
      } else {
128
0
         speex_warning("Do not own input buffer: truncating oversize input");
129
0
         nchars=bits->buf_size;
130
0
      }
131
0
   }
132
#if (BYTES_PER_CHAR==2)
133
/* Swap bytes to proper endian order (could be done externally) */
134
#define HTOLS(A) ((((A) >> 8)&0xff)|(((A) & 0xff)<<8))
135
#else
136
250k
#define HTOLS(A) (A)
137
2.34k
#endif
138
208k
   for (i=0;i<nchars;i++)
139
206k
      bits->chars[i]=HTOLS(chars[i]);
140
141
2.34k
   bits->nbBits=nchars<<LOG2_BITS_PER_CHAR;
142
2.34k
   bits->charPtr=0;
143
2.34k
   bits->bitPtr=0;
144
2.34k
   bits->overflow=0;
145
2.34k
}
146
147
static void speex_bits_flush(SpeexBits *bits)
148
0
{
149
0
   int nchars = ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR);
150
0
   if (bits->charPtr>0)
151
0
      SPEEX_MOVE(bits->chars, &bits->chars[bits->charPtr], nchars-bits->charPtr);
152
0
   bits->nbBits -= bits->charPtr<<LOG2_BITS_PER_CHAR;
153
0
   bits->charPtr=0;
154
0
}
155
156
EXPORT void speex_bits_read_whole_bytes(SpeexBits *bits, const char *chars, int nbytes)
157
0
{
158
0
   int i,pos;
159
0
   int nchars = nbytes/BYTES_PER_CHAR;
160
161
0
   if (((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR)+nchars > bits->buf_size)
162
0
   {
163
      /* Packet is larger than allocated buffer */
164
0
      if (bits->owner)
165
0
      {
166
0
         char *tmp = (char*)speex_realloc(bits->chars, (bits->nbBits>>LOG2_BITS_PER_CHAR)+nchars+1);
167
0
         if (tmp)
168
0
         {
169
0
            bits->buf_size=(bits->nbBits>>LOG2_BITS_PER_CHAR)+nchars+1;
170
0
            bits->chars=tmp;
171
0
         } else {
172
0
            nchars=bits->buf_size-(bits->nbBits>>LOG2_BITS_PER_CHAR)-1;
173
0
            speex_warning("Could not resize input buffer: truncating oversize input");
174
0
         }
175
0
      } else {
176
0
         speex_warning("Do not own input buffer: truncating oversize input");
177
0
         nchars=bits->buf_size;
178
0
      }
179
0
   }
180
181
0
   speex_bits_flush(bits);
182
0
   pos=bits->nbBits>>LOG2_BITS_PER_CHAR;
183
0
   for (i=0;i<nchars;i++)
184
0
      bits->chars[pos+i]=HTOLS(chars[i]);
185
0
   bits->nbBits+=nchars<<LOG2_BITS_PER_CHAR;
186
0
}
187
188
EXPORT int speex_bits_write(SpeexBits *bits, char *chars, int max_nbytes)
189
1.27k
{
190
1.27k
   int i;
191
1.27k
   int max_nchars = max_nbytes/BYTES_PER_CHAR;
192
1.27k
   int charPtr, bitPtr, nbBits;
193
194
   /* Insert terminator, but save the data so we can put it back after */
195
1.27k
   bitPtr=bits->bitPtr;
196
1.27k
   charPtr=bits->charPtr;
197
1.27k
   nbBits=bits->nbBits;
198
1.27k
   speex_bits_insert_terminator(bits);
199
1.27k
   bits->bitPtr=bitPtr;
200
1.27k
   bits->charPtr=charPtr;
201
1.27k
   bits->nbBits=nbBits;
202
203
1.27k
   if (max_nchars > ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR))
204
1.27k
      max_nchars = ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR);
205
206
45.3k
   for (i=0;i<max_nchars;i++)
207
44.0k
      chars[i]=HTOLS(bits->chars[i]);
208
1.27k
   return max_nchars*BYTES_PER_CHAR;
209
1.27k
}
210
211
EXPORT int speex_bits_write_whole_bytes(SpeexBits *bits, char *chars, int max_nbytes)
212
0
{
213
0
   int max_nchars = max_nbytes/BYTES_PER_CHAR;
214
0
   int i;
215
0
   if (max_nchars > ((bits->nbBits)>>LOG2_BITS_PER_CHAR))
216
0
      max_nchars = ((bits->nbBits)>>LOG2_BITS_PER_CHAR);
217
0
   for (i=0;i<max_nchars;i++)
218
0
      chars[i]=HTOLS(bits->chars[i]);
219
220
0
   if (bits->bitPtr>0)
221
0
      bits->chars[0]=bits->chars[max_nchars];
222
0
   else
223
0
      bits->chars[0]=0;
224
0
   bits->charPtr=0;
225
0
   bits->nbBits &= (BITS_PER_CHAR-1);
226
0
   return max_nchars*BYTES_PER_CHAR;
227
0
}
228
229
EXPORT void speex_bits_pack(SpeexBits *bits, int data, int nbBits)
230
66.1k
{
231
66.1k
   unsigned int d=data;
232
233
66.1k
   if (bits->charPtr+((nbBits+bits->bitPtr)>>LOG2_BITS_PER_CHAR) >= bits->buf_size)
234
0
   {
235
0
      speex_notify("Buffer too small to pack bits");
236
0
      if (bits->owner)
237
0
      {
238
0
         int new_nchars = ((bits->buf_size+5)*3)>>1;
239
0
         char *tmp = (char*)speex_realloc(bits->chars, new_nchars);
240
0
         if (tmp)
241
0
         {
242
0
            bits->buf_size=new_nchars;
243
0
            bits->chars=tmp;
244
0
         } else {
245
0
            speex_warning("Could not resize input buffer: not packing");
246
0
            return;
247
0
         }
248
0
      } else {
249
0
         speex_warning("Do not own input buffer: not packing");
250
0
         return;
251
0
      }
252
0
   }
253
254
419k
   while(nbBits)
255
353k
   {
256
353k
      int bit;
257
353k
      bit = (d>>(nbBits-1))&1;
258
353k
      bits->chars[bits->charPtr] |= bit<<(BITS_PER_CHAR-1-bits->bitPtr);
259
353k
      bits->bitPtr++;
260
261
353k
      if (bits->bitPtr==BITS_PER_CHAR)
262
44.0k
      {
263
44.0k
         bits->bitPtr=0;
264
44.0k
         bits->charPtr++;
265
44.0k
         bits->chars[bits->charPtr] = 0;
266
44.0k
      }
267
353k
      bits->nbBits++;
268
353k
      nbBits--;
269
353k
   }
270
66.1k
}
271
272
EXPORT int speex_bits_unpack_signed(SpeexBits *bits, int nbBits)
273
0
{
274
0
   unsigned int d=speex_bits_unpack_unsigned(bits,nbBits);
275
   /* If number is negative */
276
0
   if (d>>(nbBits-1))
277
0
   {
278
0
      d |= (~0u)<<nbBits;
279
0
   }
280
0
   return d;
281
0
}
282
283
EXPORT unsigned int speex_bits_unpack_unsigned(SpeexBits *bits, int nbBits)
284
28.7k
{
285
28.7k
   unsigned int d=0;
286
28.7k
   if ((bits->charPtr<<LOG2_BITS_PER_CHAR)+bits->bitPtr+nbBits>bits->nbBits)
287
6.17k
      bits->overflow=1;
288
28.7k
   if (bits->overflow)
289
6.91k
      return 0;
290
84.0k
   while(nbBits)
291
62.2k
   {
292
62.2k
      d<<=1;
293
62.2k
      d |= (bits->chars[bits->charPtr]>>(BITS_PER_CHAR-1 - bits->bitPtr))&1;
294
62.2k
      bits->bitPtr++;
295
62.2k
      if (bits->bitPtr==BITS_PER_CHAR)
296
6.38k
      {
297
6.38k
         bits->bitPtr=0;
298
6.38k
         bits->charPtr++;
299
6.38k
      }
300
62.2k
      nbBits--;
301
62.2k
   }
302
21.8k
   return d;
303
28.7k
}
304
305
EXPORT unsigned int speex_bits_peek_unsigned(SpeexBits *bits, int nbBits)
306
0
{
307
0
   unsigned int d=0;
308
0
   int bitPtr, charPtr;
309
0
   char *chars;
310
311
0
   if ((bits->charPtr<<LOG2_BITS_PER_CHAR)+bits->bitPtr+nbBits>bits->nbBits)
312
0
     bits->overflow=1;
313
0
   if (bits->overflow)
314
0
      return 0;
315
316
0
   bitPtr=bits->bitPtr;
317
0
   charPtr=bits->charPtr;
318
0
   chars = bits->chars;
319
0
   while(nbBits)
320
0
   {
321
0
      d<<=1;
322
0
      d |= (chars[charPtr]>>(BITS_PER_CHAR-1 - bitPtr))&1;
323
0
      bitPtr++;
324
0
      if (bitPtr==BITS_PER_CHAR)
325
0
      {
326
0
         bitPtr=0;
327
0
         charPtr++;
328
0
      }
329
0
      nbBits--;
330
0
   }
331
0
   return d;
332
0
}
333
334
EXPORT int speex_bits_peek(SpeexBits *bits)
335
0
{
336
0
   if ((bits->charPtr<<LOG2_BITS_PER_CHAR)+bits->bitPtr+1>bits->nbBits)
337
0
      bits->overflow=1;
338
0
   if (bits->overflow)
339
0
      return 0;
340
0
   return (bits->chars[bits->charPtr]>>(BITS_PER_CHAR-1 - bits->bitPtr))&1;
341
0
}
342
343
EXPORT void speex_bits_advance(SpeexBits *bits, int n)
344
6.80k
{
345
6.80k
    if (((bits->charPtr<<LOG2_BITS_PER_CHAR)+bits->bitPtr+n>bits->nbBits) || bits->overflow){
346
407
      bits->overflow=1;
347
407
      return;
348
407
    }
349
6.39k
   bits->charPtr += (bits->bitPtr+n) >> LOG2_BITS_PER_CHAR; /* divide by BITS_PER_CHAR */
350
6.39k
   bits->bitPtr = (bits->bitPtr+n) & (BITS_PER_CHAR-1);       /* modulo by BITS_PER_CHAR */
351
6.39k
}
352
353
EXPORT int speex_bits_remaining(SpeexBits *bits)
354
22.7k
{
355
22.7k
   if (bits->overflow)
356
589
      return -1;
357
22.1k
   else
358
22.1k
      return bits->nbBits-((bits->charPtr<<LOG2_BITS_PER_CHAR)+bits->bitPtr);
359
22.7k
}
360
361
EXPORT int speex_bits_nbytes(SpeexBits *bits)
362
1.27k
{
363
1.27k
   return ((bits->nbBits+BITS_PER_CHAR-1)>>LOG2_BITS_PER_CHAR);
364
1.27k
}
365
366
EXPORT void speex_bits_insert_terminator(SpeexBits *bits)
367
1.27k
{
368
1.27k
   if (bits->bitPtr)
369
1.27k
      speex_bits_pack(bits, 0, 1);
370
5.23k
   while (bits->bitPtr)
371
3.95k
      speex_bits_pack(bits, 1, 1);
372
1.27k
}