Coverage Report

Created: 2026-10-28 06:12

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/work/dav1d/src/getbits.c
Line
Count
Source
1
/*
2
 * Copyright © 2018, VideoLAN and dav1d authors
3
 * Copyright © 2018, Two Orioles, LLC
4
 * All rights reserved.
5
 *
6
 * Redistribution and use in source and binary forms, with or without
7
 * modification, are permitted provided that the following conditions are met:
8
 *
9
 * 1. Redistributions of source code must retain the above copyright notice, this
10
 *    list of conditions and the following disclaimer.
11
 *
12
 * 2. Redistributions in binary form must reproduce the above copyright notice,
13
 *    this list of conditions and the following disclaimer in the documentation
14
 *    and/or other materials provided with the distribution.
15
 *
16
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
17
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
20
 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26
 */
27
28
#include "config.h"
29
30
#include <limits.h>
31
32
#include "common/intops.h"
33
34
#include "src/getbits.h"
35
36
void dav1d_init_get_bits(GetBits *const c, const uint8_t *const data,
37
                         const size_t sz)
38
64.5k
{
39
64.5k
    assert(sz);
40
64.5k
    c->ptr = c->ptr_start = data;
41
64.5k
    c->ptr_end = &c->ptr_start[sz];
42
64.5k
    c->state = 0;
43
64.5k
    c->bits_left = 0;
44
64.5k
    c->error = 0;
45
64.5k
}
46
47
2.36M
unsigned dav1d_get_bit(GetBits *const c) {
48
2.36M
    if (!c->bits_left) {
49
352k
        if (c->ptr >= c->ptr_end) {
50
429
            c->error = 1;
51
352k
        } else {
52
352k
            const unsigned state = *c->ptr++;
53
352k
            c->bits_left = 7;
54
352k
            c->state = (uint64_t) state << 57;
55
352k
            return state >> 7;
56
352k
        }
57
352k
    }
58
59
2.01M
    const uint64_t state = c->state;
60
2.01M
    c->bits_left--;
61
2.01M
    c->state = state << 1;
62
2.01M
    return (unsigned) (state >> 63);
63
2.36M
}
64
65
736k
static inline void refill(GetBits *const c, const int n) {
66
736k
    assert(c->bits_left >= 0 && c->bits_left < 32);
67
736k
    unsigned state = 0;
68
776k
    do {
69
776k
        if (c->ptr >= c->ptr_end) {
70
482
            c->error = 1;
71
482
            if (state) break;
72
440
            return;
73
482
        }
74
775k
        state = (state << 8) | *c->ptr++;
75
775k
        c->bits_left += 8;
76
775k
    } while (n > c->bits_left);
77
736k
    c->state |= (uint64_t) state << (64 - c->bits_left);
78
736k
}
79
80
#define GET_BITS(name, type, type64)            \
81
1.28M
type name(GetBits *const c, const int n) {      \
82
1.28M
    assert(n > 0 && n <= 32);                   \
83
1.28M
    /* Unsigned cast avoids refill after eob */ \
84
1.28M
    if ((unsigned) n > (unsigned) c->bits_left) \
85
1.28M
        refill(c, n);                           \
86
1.28M
    const uint64_t state = c->state;            \
87
1.28M
    c->bits_left -= n;                          \
88
1.28M
    c->state = state << n;                      \
89
1.28M
    return (type) ((type64) state >> (64 - n)); \
90
1.28M
}
dav1d_get_bits
Line
Count
Source
81
1.10M
type name(GetBits *const c, const int n) {      \
82
1.10M
    assert(n > 0 && n <= 32);                   \
83
1.10M
    /* Unsigned cast avoids refill after eob */ \
84
1.10M
    if ((unsigned) n > (unsigned) c->bits_left) \
85
1.10M
        refill(c, n);                           \
86
1.10M
    const uint64_t state = c->state;            \
87
1.10M
    c->bits_left -= n;                          \
88
1.10M
    c->state = state << n;                      \
89
1.10M
    return (type) ((type64) state >> (64 - n)); \
90
1.10M
}
dav1d_get_sbits
Line
Count
Source
81
175k
type name(GetBits *const c, const int n) {      \
82
175k
    assert(n > 0 && n <= 32);                   \
83
175k
    /* Unsigned cast avoids refill after eob */ \
84
175k
    if ((unsigned) n > (unsigned) c->bits_left) \
85
175k
        refill(c, n);                           \
86
175k
    const uint64_t state = c->state;            \
87
175k
    c->bits_left -= n;                          \
88
175k
    c->state = state << n;                      \
89
175k
    return (type) ((type64) state >> (64 - n)); \
90
175k
}
91
92
GET_BITS(dav1d_get_bits,  unsigned, uint64_t)
93
GET_BITS(dav1d_get_sbits, int,      int64_t)
94
95
64.8k
unsigned dav1d_get_uleb128(GetBits *const c) {
96
64.8k
    uint64_t val = 0;
97
64.8k
    unsigned i = 0, more;
98
99
70.5k
    do {
100
70.5k
        const int v = dav1d_get_bits(c, 8);
101
70.5k
        more = v & 0x80;
102
70.5k
        val |= ((uint64_t) (v & 0x7F)) << i;
103
70.5k
        i += 7;
104
70.5k
    } while (more && i < 56);
105
106
64.8k
    if (val > UINT32_MAX || more) {
107
10
        c->error = 1;
108
10
        return 0;
109
10
    }
110
111
64.8k
    return (unsigned) val;
112
64.8k
}
113
114
20.6k
unsigned dav1d_get_uniform(GetBits *const c, const unsigned max) {
115
    // Output in range [0..max-1]
116
    // max must be > 1, or else nothing is read from the bitstream
117
20.6k
    assert(max > 1);
118
20.6k
    const int l = ulog2(max) + 1;
119
20.6k
    assert(l > 1);
120
20.6k
    const unsigned m = (1U << l) - max;
121
20.6k
    const unsigned v = dav1d_get_bits(c, l - 1);
122
20.6k
    return v < m ? v : (v << 1) - m + dav1d_get_bit(c);
123
20.6k
}
124
125
257
unsigned dav1d_get_vlc(GetBits *const c) {
126
257
    if (dav1d_get_bit(c))
127
9
        return 0;
128
129
248
    int n_bits = 0;
130
662
    do {
131
662
        if (++n_bits == 32)
132
0
            return UINT32_MAX;
133
662
    } while (!dav1d_get_bit(c));
134
135
248
    return ((1U << n_bits) - 1) + dav1d_get_bits(c, n_bits);
136
248
}
137
138
static unsigned get_bits_subexp_u(GetBits *const c, const unsigned ref,
139
                                  const unsigned n)
140
105k
{
141
105k
    unsigned v = 0;
142
143
234k
    for (int i = 0;; i++) {
144
234k
        const int b = i ? 3 + i - 1 : 3;
145
146
234k
        if (n < v + 3 * (1 << b)) {
147
7.55k
            v += dav1d_get_uniform(c, n - v + 1);
148
7.55k
            break;
149
7.55k
        }
150
151
226k
        if (!dav1d_get_bit(c)) {
152
98.0k
            v += dav1d_get_bits(c, b);
153
98.0k
            break;
154
98.0k
        }
155
156
128k
        v += 1 << b;
157
128k
    }
158
159
105k
    return ref * 2 <= n ? inv_recenter(ref, v) : n - inv_recenter(n - ref, v);
160
105k
}
161
162
105k
int dav1d_get_bits_subexp(GetBits *const c, const int ref, const unsigned n) {
163
105k
    return (int) get_bits_subexp_u(c, ref + (1 << n), 2 << n) - (1 << n);
164
105k
}