Coverage Report

Created: 2026-10-19 06:56

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/jbig2dec/jbig2_arith_int.c
Line
Count
Source
1
/* Copyright (C) 2001-2023 Artifex Software, Inc.
2
   All Rights Reserved.
3
4
   This software is provided AS-IS with no warranty, either express or
5
   implied.
6
7
   This software is distributed under license and may not be copied,
8
   modified or distributed except as expressly authorized under the terms
9
   of the license contained in the file LICENSE in this distribution.
10
11
   Refer to licensing information at http://www.artifex.com or contact
12
   Artifex Software, Inc.,  39 Mesa Street, Suite 108A, San Francisco,
13
   CA 94129, USA, for further information.
14
*/
15
16
/*
17
    jbig2dec
18
*/
19
20
/* Annex A */
21
22
#ifdef HAVE_CONFIG_H
23
#include "config.h"
24
#endif
25
#include "os_types.h"
26
27
#include <stddef.h>
28
#include <string.h>             /* memset() */
29
30
#include "jbig2.h"
31
#include "jbig2_priv.h"
32
#include "jbig2_arith.h"
33
#include "jbig2_arith_int.h"
34
35
struct _Jbig2ArithIntCtx {
36
    Jbig2ArithCx IAx[512];
37
};
38
39
Jbig2ArithIntCtx *
40
jbig2_arith_int_ctx_new(Jbig2Ctx *ctx)
41
49.6k
{
42
49.6k
    Jbig2ArithIntCtx *result = jbig2_new(ctx, Jbig2ArithIntCtx, 1);
43
44
49.6k
    if (result == NULL) {
45
79
        jbig2_error(ctx, JBIG2_SEVERITY_FATAL, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to allocate arithmetic integer coding state");
46
79
        return NULL;
47
49.5k
    } else {
48
49.5k
        memset(result->IAx, 0, sizeof(result->IAx));
49
49.5k
    }
50
51
49.5k
    return result;
52
49.6k
}
53
54
/* A.2 */
55
/* Return value: -1 on error, 0 on normal value, 1 on OOB return. */
56
int
57
jbig2_arith_int_decode(Jbig2Ctx *ctx, Jbig2ArithIntCtx *actx, Jbig2ArithState *as, int32_t *p_result)
58
16.2M
{
59
16.2M
    Jbig2ArithCx *IAx = actx->IAx;
60
16.2M
    int PREV = 1;
61
16.2M
    int S;
62
16.2M
    int32_t V;
63
16.2M
    int bit;
64
16.2M
    int n_tail, offset;
65
16.2M
    int i;
66
67
16.2M
    S = jbig2_arith_decode(ctx, as, &IAx[PREV]);
68
16.2M
    if (S < 0)
69
0
        return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx S");
70
16.2M
    PREV = (PREV << 1) | S;
71
72
16.2M
    bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
73
16.2M
    if (bit < 0)
74
0
        return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 0");
75
16.2M
    PREV = (PREV << 1) | bit;
76
16.2M
    if (bit) {
77
10.1M
        bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
78
10.1M
        if (bit < 0)
79
0
            return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 1");
80
10.1M
        PREV = (PREV << 1) | bit;
81
82
10.1M
        if (bit) {
83
4.99M
            bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
84
4.99M
            if (bit < 0)
85
0
                return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 2");
86
4.99M
            PREV = (PREV << 1) | bit;
87
88
4.99M
            if (bit) {
89
4.53M
                bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
90
4.53M
                if (bit < 0)
91
0
                    return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 3");
92
4.53M
                PREV = (PREV << 1) | bit;
93
94
4.53M
                if (bit) {
95
1.89M
                    bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
96
1.89M
                    if (bit < 0)
97
0
                        return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 4");
98
1.89M
                    PREV = (PREV << 1) | bit;
99
100
1.89M
                    if (bit) {
101
229k
                        n_tail = 32;
102
229k
                        offset = 4436;
103
1.66M
                    } else {
104
1.66M
                        n_tail = 12;
105
1.66M
                        offset = 340;
106
1.66M
                    }
107
2.64M
                } else {
108
2.64M
                    n_tail = 8;
109
2.64M
                    offset = 84;
110
2.64M
                }
111
4.53M
            } else {
112
460k
                n_tail = 6;
113
460k
                offset = 20;
114
460k
            }
115
5.13M
        } else {
116
5.13M
            n_tail = 4;
117
5.13M
            offset = 4;
118
5.13M
        }
119
10.1M
    } else {
120
6.16M
        n_tail = 2;
121
6.16M
        offset = 0;
122
6.16M
    }
123
124
16.2M
    V = 0;
125
100M
    for (i = 0; i < n_tail; i++) {
126
84.0M
        bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
127
84.0M
        if (bit < 0)
128
0
            return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx V bit %d", i);
129
84.0M
        PREV = ((PREV << 1) & 511) | (PREV & 256) | bit;
130
84.0M
        V = (V << 1) | bit;
131
84.0M
    }
132
133
    /* offset is always >=0, so underflow can't happen. */
134
    /* avoid overflow by clamping 32 bit value. */
135
16.2M
    if (V > INT32_MAX - offset)
136
255
        V = INT32_MAX;
137
16.2M
    else
138
16.2M
        V += offset;
139
16.2M
    V = S ? -V : V;
140
16.2M
    *p_result = V;
141
16.2M
    return S && V == 0 ? 1 : 0;
142
16.2M
}
143
144
void
145
jbig2_arith_int_ctx_free(Jbig2Ctx *ctx, Jbig2ArithIntCtx *iax)
146
66.4k
{
147
66.4k
    jbig2_free(ctx->allocator, iax);
148
66.4k
}