Coverage Report

Created: 2025-10-13 07:18

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
33.3k
{
42
33.3k
    Jbig2ArithIntCtx *result = jbig2_new(ctx, Jbig2ArithIntCtx, 1);
43
44
33.3k
    if (result == NULL) {
45
78
        jbig2_error(ctx, JBIG2_SEVERITY_FATAL, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to allocate arithmetic integer coding state");
46
78
        return NULL;
47
33.2k
    } else {
48
33.2k
        memset(result->IAx, 0, sizeof(result->IAx));
49
33.2k
    }
50
51
33.2k
    return result;
52
33.3k
}
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
35.6M
{
59
35.6M
    Jbig2ArithCx *IAx = actx->IAx;
60
35.6M
    int PREV = 1;
61
35.6M
    int S;
62
35.6M
    int32_t V;
63
35.6M
    int bit;
64
35.6M
    int n_tail, offset;
65
35.6M
    int i;
66
67
35.6M
    S = jbig2_arith_decode(ctx, as, &IAx[PREV]);
68
35.6M
    if (S < 0)
69
0
        return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx S");
70
35.6M
    PREV = (PREV << 1) | S;
71
72
35.6M
    bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
73
35.6M
    if (bit < 0)
74
0
        return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 0");
75
35.6M
    PREV = (PREV << 1) | bit;
76
35.6M
    if (bit) {
77
19.9M
        bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
78
19.9M
        if (bit < 0)
79
0
            return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 1");
80
19.9M
        PREV = (PREV << 1) | bit;
81
82
19.9M
        if (bit) {
83
15.2M
            bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
84
15.2M
            if (bit < 0)
85
0
                return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 2");
86
15.2M
            PREV = (PREV << 1) | bit;
87
88
15.2M
            if (bit) {
89
1.30M
                bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
90
1.30M
                if (bit < 0)
91
0
                    return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 3");
92
1.30M
                PREV = (PREV << 1) | bit;
93
94
1.30M
                if (bit) {
95
1.26M
                    bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
96
1.26M
                    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.26M
                    PREV = (PREV << 1) | bit;
99
100
1.26M
                    if (bit) {
101
169k
                        n_tail = 32;
102
169k
                        offset = 4436;
103
1.09M
                    } else {
104
1.09M
                        n_tail = 12;
105
1.09M
                        offset = 340;
106
1.09M
                    }
107
1.26M
                } else {
108
47.0k
                    n_tail = 8;
109
47.0k
                    offset = 84;
110
47.0k
                }
111
13.9M
            } else {
112
13.9M
                n_tail = 6;
113
13.9M
                offset = 20;
114
13.9M
            }
115
15.2M
        } else {
116
4.77M
            n_tail = 4;
117
4.77M
            offset = 4;
118
4.77M
        }
119
19.9M
    } else {
120
15.6M
        n_tail = 2;
121
15.6M
        offset = 0;
122
15.6M
    }
123
124
35.6M
    V = 0;
125
188M
    for (i = 0; i < n_tail; i++) {
126
152M
        bit = jbig2_arith_decode(ctx, as, &IAx[PREV]);
127
152M
        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
152M
        PREV = ((PREV << 1) & 511) | (PREV & 256) | bit;
130
152M
        V = (V << 1) | bit;
131
152M
    }
132
133
    /* offset is always >=0, so underflow can't happen. */
134
    /* avoid overflow by clamping 32 bit value. */
135
35.6M
    if (V > INT32_MAX - offset)
136
52.5k
        V = INT32_MAX;
137
35.5M
    else
138
35.5M
        V += offset;
139
35.6M
    V = S ? -V : V;
140
35.6M
    *p_result = V;
141
35.6M
    return S && V == 0 ? 1 : 0;
142
35.6M
}
143
144
void
145
jbig2_arith_int_ctx_free(Jbig2Ctx *ctx, Jbig2ArithIntCtx *iax)
146
51.0k
{
147
51.0k
    jbig2_free(ctx->allocator, iax);
148
51.0k
}