vlc_bits.h 6.33 KB
Newer Older
1
/*****************************************************************************
Pere Orga's avatar
Pere Orga committed
2
 * vlc_bits.h : Bit handling helpers
3
 *****************************************************************************
4
 * Copyright (C) 2001, 2002, 2003, 2006, 2015 VLC authors and VideoLAN
5
 * $Id$
6 7
 *
 * Authors: Laurent Aimar <fenrir@via.ecp.fr>
8 9
 *          Gildas Bazin <gbazin at videolan dot org>
 *          Rafaël Carré <funman at videolan dot org>
10
 *
Jean-Baptiste Kempf's avatar
Jean-Baptiste Kempf committed
11 12 13
 * This program is free software; you can redistribute it and/or modify it
 * under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or
14 15 16 17
 * (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
Jean-Baptiste Kempf's avatar
Jean-Baptiste Kempf committed
18 19
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
20
 *
Jean-Baptiste Kempf's avatar
Jean-Baptiste Kempf committed
21 22 23
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
24
 *****************************************************************************/
25 26
#ifndef VLC_BITS_H
#define VLC_BITS_H 1
27

28
#include <vlc_common.h>
29

30 31 32 33 34
/**
 * \file
 * This file defines functions, structures for handling streams of bits in vlc
 */

35 36 37 38 39 40
typedef struct bs_s
{
    uint8_t *p_start;
    uint8_t *p;
    uint8_t *p_end;

41
    ssize_t  i_left;    /* i_count number of available bits */
42
    bool     b_read_only;
43 44 45 46

     /* forward read modifier (p_start, p_end, p_fwpriv, count) */
    uint8_t *(*pf_forward)(uint8_t *, uint8_t *, void *, size_t);
    void    *p_fwpriv;
47
} bs_t;
48

49
static inline void bs_write_init( bs_t *s, void *p_data, size_t i_data )
50
{
51
    s->p_start = (uint8_t *)p_data;
52 53
    s->p       = s->p_start;
    s->p_end   = s->p_start + i_data;
54
    s->i_left  = 8;
55
    s->b_read_only = false;
56 57
    s->p_fwpriv = NULL;
    s->pf_forward = NULL;
58 59 60 61 62 63
}

static inline void bs_init( bs_t *s, const void *p_data, size_t i_data )
{
    bs_write_init( s, (void*) p_data, i_data );
    s->b_read_only = true;
64
}
65

66
static inline int bs_pos( const bs_t *s )
67 68 69
{
    return( 8 * ( s->p - s->p_start ) + 8 - s->i_left );
}
70

71 72 73 74 75 76 77 78
static inline int bs_remain( const bs_t *s )
{
    if( s->p >= s->p_end )
        return 0;
    else
    return( 8 * ( s->p_end - s->p ) - 8 + s->i_left );
}

79
static inline int bs_eof( const bs_t *s )
80 81 82
{
    return( s->p >= s->p_end ? 1: 0 );
}
83

84 85 86
#define bs_forward( s, i ) \
    s->p = s->pf_forward ? s->pf_forward( s->p, s->p_end, s->p_fwpriv, i ) : s->p + i

87 88
static inline uint32_t bs_read( bs_t *s, int i_count )
{
89
     static const uint32_t i_mask[33] =
90 91 92 93 94 95 96 97 98
     {  0x00,
        0x01,      0x03,      0x07,      0x0f,
        0x1f,      0x3f,      0x7f,      0xff,
        0x1ff,     0x3ff,     0x7ff,     0xfff,
        0x1fff,    0x3fff,    0x7fff,    0xffff,
        0x1ffff,   0x3ffff,   0x7ffff,   0xfffff,
        0x1fffff,  0x3fffff,  0x7fffff,  0xffffff,
        0x1ffffff, 0x3ffffff, 0x7ffffff, 0xfffffff,
        0x1fffffff,0x3fffffff,0x7fffffff,0xffffffff};
99
    int      i_shr, i_drop = 0;
100 101
    uint32_t i_result = 0;

102 103 104 105 106 107
    if( i_count > 32 )
    {
        i_drop = i_count - 32;
        i_count = 32;
    }

108 109 110 111 112 113 114 115 116 117 118 119 120 121
    while( i_count > 0 )
    {
        if( s->p >= s->p_end )
        {
            break;
        }

        if( ( i_shr = s->i_left - i_count ) >= 0 )
        {
            /* more in the buffer than requested */
            i_result |= ( *s->p >> i_shr )&i_mask[i_count];
            s->i_left -= i_count;
            if( s->i_left == 0 )
            {
122
                bs_forward( s, 1 );
123 124
                s->i_left = 8;
            }
125
            break;
126 127 128 129
        }
        else
        {
            /* less in the buffer than requested */
130 131 132 133
           if( -i_shr == 32 )
               i_result = 0;
           else
               i_result |= (*s->p&i_mask[s->i_left]) << -i_shr;
134
           i_count  -= s->i_left;
135
           bs_forward( s, 1);
136 137 138 139
           s->i_left = 8;
        }
    }

140 141 142
    if( i_drop )
        bs_forward( s, i_drop );

143 144 145 146 147 148 149 150 151 152 153 154 155
    return( i_result );
}

static inline uint32_t bs_read1( bs_t *s )
{
    if( s->p < s->p_end )
    {
        unsigned int i_result;

        s->i_left--;
        i_result = ( *s->p >> s->i_left )&0x01;
        if( s->i_left == 0 )
        {
156
            bs_forward( s, 1 );
157 158 159 160 161 162 163 164 165 166 167 168 169 170
            s->i_left = 8;
        }
        return i_result;
    }

    return 0;
}

static inline uint32_t bs_show( bs_t *s, int i_count )
{
    bs_t     s_tmp = *s;
    return bs_read( &s_tmp, i_count );
}

171
static inline void bs_skip( bs_t *s, ssize_t i_count )
172 173 174
{
    s->i_left -= i_count;

Laurent Aimar's avatar
Laurent Aimar committed
175
    if( s->i_left <= 0 )
176
    {
177
        const size_t i_bytes = 1 + s->i_left / -8;
178
        bs_forward( s, i_bytes );
179 180 181 182
        if( i_bytes * 8 < i_bytes /* ofw */ )
            s->i_left = i_bytes;
        else
            s->i_left += 8 * i_bytes;
183 184 185
    }
}

186
static inline void bs_write( bs_t *s, int i_count, uint32_t i_bits )
187
{
188 189 190
    if( s->b_read_only )
        return;

191 192 193
    while( i_count > 0 )
    {
        if( s->p >= s->p_end )
194
        {
195
            break;
196
        }
197 198 199 200

        i_count--;

        if( ( i_bits >> i_count )&0x01 )
201
        {
202
            *s->p |= 1 << ( s->i_left - 1 );
203
        }
204
        else
205
        {
206
            *s->p &= ~( 1 << ( s->i_left - 1 ) );
207
        }
208 209 210
        s->i_left--;
        if( s->i_left == 0 )
        {
211
            bs_forward( s, 1 );
212 213 214 215 216
            s->i_left = 8;
        }
    }
}

217 218 219 220 221
static inline bool bs_aligned( bs_t *s )
{
    return s->i_left % 8 == 0;
}

222
static inline void bs_align( bs_t *s )
223 224 225 226 227 228 229
{
    if( s->i_left != 8 )
    {
        s->i_left = 8;
        s->p++;
    }
}
230

231
static inline void bs_align_0( bs_t *s )
232 233
{
    if( s->i_left != 8 )
234 235 236
    {
        bs_write( s, s->i_left, 0 );
    }
237
}
238

239
static inline void bs_align_1( bs_t *s )
240
{
241
    while( !s->b_read_only && s->i_left != 8 )
242 243 244
    {
        bs_write( s, 1, 1 );
    }
245 246
}

247
/* Read unsigned Exp-Golomb code */
248
static inline uint_fast32_t bs_read_ue( bs_t * bs )
249
{
250
    unsigned i = 0;
251

252
    while( bs_read1( bs ) == 0 && bs->p < bs->p_end && i < 31 )
253 254
        i++;

255
    return (1U << i) - 1 + bs_read( bs, i );
256 257 258
}

/* Read signed Exp-Golomb code */
259
static inline int_fast32_t bs_read_se( bs_t *s )
260
{
261
    uint_fast32_t val = bs_read_ue( s );
262

263 264
    return (val & 0x01) ? (int_fast32_t)((val + 1) / 2)
                        : -(int_fast32_t)(val / 2);
265 266
}

267 268
#undef bs_forward

269
#endif