Coverage Report

Created: 2026-05-30 06:10

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
242k
{
39
242k
    assert(sz);
40
242k
    c->ptr = c->ptr_start = data;
41
242k
    c->ptr_end = &c->ptr_start[sz];
42
242k
    c->state = 0;
43
242k
    c->bits_left = 0;
44
242k
    c->error = 0;
45
242k
}
46
47
8.71M
unsigned dav1d_get_bit(GetBits *const c) {
48
8.71M
    if (!c->bits_left) {
49
1.33M
        if (c->ptr >= c->ptr_end) {
50
1.18k
            c->error = 1;
51
1.33M
        } else {
52
1.33M
            const unsigned state = *c->ptr++;
53
1.33M
            c->bits_left = 7;
54
1.33M
            c->state = (uint64_t) state << 57;
55
1.33M
            return state >> 7;
56
1.33M
        }
57
1.33M
    }
58
59
7.38M
    const uint64_t state = c->state;
60
7.38M
    c->bits_left--;
61
7.38M
    c->state = state << 1;
62
7.38M
    return (unsigned) (state >> 63);
63
8.71M
}
64
65
2.94M
static inline void refill(GetBits *const c, const int n) {
66
2.94M
    assert(c->bits_left >= 0 && c->bits_left < 32);
67
2.94M
    unsigned state = 0;
68
3.19M
    do {
69
3.19M
        if (c->ptr >= c->ptr_end) {
70
2.64k
            c->error = 1;
71
2.64k
            if (state) break;
72
2.45k
            return;
73
2.64k
        }
74
3.19M
        state = (state << 8) | *c->ptr++;
75
3.19M
        c->bits_left += 8;
76
3.19M
    } while (n > c->bits_left);
77
2.94M
    c->state |= (uint64_t) state << (64 - c->bits_left);
78
2.94M
}
79
80
#define GET_BITS(name, type, type64)            \
81
5.51M
type name(GetBits *const c, const int n) {      \
82
5.51M
    assert(n > 0 && n <= 32);                   \
83
5.51M
    /* Unsigned cast avoids refill after eob */ \
84
5.51M
    if ((unsigned) n > (unsigned) c->bits_left) \
85
5.51M
        refill(c, n);                           \
86
5.51M
    const uint64_t state = c->state;            \
87
5.51M
    c->bits_left -= n;                          \
88
5.51M
    c->state = state << n;                      \
89
5.51M
    return (type) ((type64) state >> (64 - n)); \
90
5.51M
}
dav1d_get_bits
Line
Count
Source
81
4.97M
type name(GetBits *const c, const int n) {      \
82
4.97M
    assert(n > 0 && n <= 32);                   \
83
4.97M
    /* Unsigned cast avoids refill after eob */ \
84
4.97M
    if ((unsigned) n > (unsigned) c->bits_left) \
85
4.97M
        refill(c, n);                           \
86
4.97M
    const uint64_t state = c->state;            \
87
4.97M
    c->bits_left -= n;                          \
88
4.97M
    c->state = state << n;                      \
89
4.97M
    return (type) ((type64) state >> (64 - n)); \
90
4.97M
}
dav1d_get_sbits
Line
Count
Source
81
531k
type name(GetBits *const c, const int n) {      \
82
531k
    assert(n > 0 && n <= 32);                   \
83
531k
    /* Unsigned cast avoids refill after eob */ \
84
531k
    if ((unsigned) n > (unsigned) c->bits_left) \
85
531k
        refill(c, n);                           \
86
531k
    const uint64_t state = c->state;            \
87
531k
    c->bits_left -= n;                          \
88
531k
    c->state = state << n;                      \
89
531k
    return (type) ((type64) state >> (64 - n)); \
90
531k
}
91
92
GET_BITS(dav1d_get_bits,  unsigned, uint64_t)
93
GET_BITS(dav1d_get_sbits, int,      int64_t)
94
95
184k
unsigned dav1d_get_uleb128(GetBits *const c) {
96
184k
    uint64_t val = 0;
97
184k
    unsigned i = 0, more;
98
99
190k
    do {
100
190k
        const int v = dav1d_get_bits(c, 8);
101
190k
        more = v & 0x80;
102
190k
        val |= ((uint64_t) (v & 0x7F)) << i;
103
190k
        i += 7;
104
190k
    } while (more && i < 56);
105
106
184k
    if (val > UINT32_MAX || more) {
107
386
        c->error = 1;
108
386
        return 0;
109
386
    }
110
111
184k
    return (unsigned) val;
112
184k
}
113
114
66.9k
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
66.9k
    assert(max > 1);
118
66.9k
    const int l = ulog2(max) + 1;
119
66.9k
    assert(l > 1);
120
66.9k
    const unsigned m = (1U << l) - max;
121
66.9k
    const unsigned v = dav1d_get_bits(c, l - 1);
122
66.9k
    return v < m ? v : (v << 1) - m + dav1d_get_bit(c);
123
66.9k
}
124
125
3.50k
unsigned dav1d_get_vlc(GetBits *const c) {
126
3.50k
    if (dav1d_get_bit(c))
127
86
        return 0;
128
129
3.42k
    int n_bits = 0;
130
10.8k
    do {
131
10.8k
        if (++n_bits == 32)
132
12
            return UINT32_MAX;
133
10.8k
    } while (!dav1d_get_bit(c));
134
135
3.40k
    return ((1U << n_bits) - 1) + dav1d_get_bits(c, n_bits);
136
3.42k
}
137
138
static unsigned get_bits_subexp_u(GetBits *const c, const unsigned ref,
139
                                  const unsigned n)
140
799k
{
141
799k
    unsigned v = 0;
142
143
1.07M
    for (int i = 0;; i++) {
144
1.07M
        const int b = i ? 3 + i - 1 : 3;
145
146
1.07M
        if (n < v + 3 * (1 << b)) {
147
11.4k
            v += dav1d_get_uniform(c, n - v + 1);
148
11.4k
            break;
149
11.4k
        }
150
151
1.05M
        if (!dav1d_get_bit(c)) {
152
788k
            v += dav1d_get_bits(c, b);
153
788k
            break;
154
788k
        }
155
156
270k
        v += 1 << b;
157
270k
    }
158
159
799k
    return ref * 2 <= n ? inv_recenter(ref, v) : n - inv_recenter(n - ref, v);
160
799k
}
161
162
799k
int dav1d_get_bits_subexp(GetBits *const c, const int ref, const unsigned n) {
163
799k
    return (int) get_bits_subexp_u(c, ref + (1 << n), 2 << n) - (1 << n);
164
799k
}