vlc_bits.h 4.5 KB
Newer Older
1
/*****************************************************************************
2
 * bits.h : Bit handling helpers
3
 *****************************************************************************
4
 * Copyright (C) 2003 the VideoLAN team
5
 * $Id$
6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
 *
 * Authors: Laurent Aimar <fenrir@via.ecp.fr>
 *
 * 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, write to the Free Software
Antoine Cellerier's avatar
Antoine Cellerier committed
21
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301, USA.
22 23
 *****************************************************************************/

24 25
#ifndef VLC_BITS_H
#define VLC_BITS_H 1
26

27 28 29 30 31
/**
 * \file
 * This file defines functions, structures for handling streams of bits in vlc
 */

32 33 34 35 36 37
typedef struct bs_s
{
    uint8_t *p_start;
    uint8_t *p;
    uint8_t *p_end;

38
    ssize_t  i_left;    /* i_count number of available bits */
39
} bs_t;
40

41
static inline void bs_init( bs_t *s, const void *p_data, size_t i_data )
42
{
43 44 45
    s->p_start = (void *)p_data;
    s->p       = s->p_start;
    s->p_end   = s->p_start + i_data;
46 47
    s->i_left  = 8;
}
48

49
static inline int bs_pos( const bs_t *s )
50 51 52
{
    return( 8 * ( s->p - s->p_start ) + 8 - s->i_left );
}
53

54
static inline int bs_eof( const bs_t *s )
55 56 57
{
    return( s->p >= s->p_end ? 1: 0 );
}
58

59 60
static inline uint32_t bs_read( bs_t *s, int i_count )
{
61
     static const uint32_t i_mask[33] =
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
     {  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};
    int      i_shr;
    uint32_t i_result = 0;

    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 )
            {
                s->p++;
                s->i_left = 8;
            }
            return( i_result );
        }
        else
        {
            /* less in the buffer than requested */
           i_result |= (*s->p&i_mask[s->i_left]) << -i_shr;
           i_count  -= s->i_left;
           s->p++;
           s->i_left = 8;
        }
    }

    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 )
        {
            s->p++;
            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 );
}

131
static inline void bs_skip( bs_t *s, ssize_t i_count )
132 133 134
{
    s->i_left -= i_count;

Laurent Aimar's avatar
Laurent Aimar committed
135
    if( s->i_left <= 0 )
136
    {
Laurent Aimar's avatar
Laurent Aimar committed
137 138 139 140
        const int i_bytes = ( -s->i_left + 8 ) / 8;

        s->p += i_bytes;
        s->i_left += 8 * i_bytes;
141 142 143
    }
}

144
static inline void bs_write( bs_t *s, int i_count, uint32_t i_bits )
145 146 147 148
{
    while( i_count > 0 )
    {
        if( s->p >= s->p_end )
149
        {
150
            break;
151
        }
152 153 154 155

        i_count--;

        if( ( i_bits >> i_count )&0x01 )
156
        {
157
            *s->p |= 1 << ( s->i_left - 1 );
158
        }
159
        else
160
        {
161
            *s->p &= ~( 1 << ( s->i_left - 1 ) );
162
        }
163 164 165 166 167 168 169 170 171
        s->i_left--;
        if( s->i_left == 0 )
        {
            s->p++;
            s->i_left = 8;
        }
    }
}

172
static inline void bs_align( bs_t *s )
173 174 175 176 177 178 179
{
    if( s->i_left != 8 )
    {
        s->i_left = 8;
        s->p++;
    }
}
180

181
static inline void bs_align_0( bs_t *s )
182 183
{
    if( s->i_left != 8 )
184 185 186
    {
        bs_write( s, s->i_left, 0 );
    }
187
}
188

189
static inline void bs_align_1( bs_t *s )
190 191
{
    while( s->i_left != 8 )
192 193 194
    {
        bs_write( s, 1, 1 );
    }
195 196 197
}

#endif