/src/jbig2dec/jbig2_arith_int.c
Line | Count | Source (jump to first uncovered line) |
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 | 20.5k | { |
42 | 20.5k | Jbig2ArithIntCtx *result = jbig2_new(ctx, Jbig2ArithIntCtx, 1); |
43 | | |
44 | 20.5k | if (result == NULL) { |
45 | 92 | jbig2_error(ctx, JBIG2_SEVERITY_FATAL, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to allocate arithmetic integer coding state"); |
46 | 92 | return NULL; |
47 | 20.4k | } else { |
48 | 20.4k | memset(result->IAx, 0, sizeof(result->IAx)); |
49 | 20.4k | } |
50 | | |
51 | 20.4k | return result; |
52 | 20.5k | } |
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 | 38.6M | { |
59 | 38.6M | Jbig2ArithCx *IAx = actx->IAx; |
60 | 38.6M | int PREV = 1; |
61 | 38.6M | int S; |
62 | 38.6M | int32_t V; |
63 | 38.6M | int bit; |
64 | 38.6M | int n_tail, offset; |
65 | 38.6M | int i; |
66 | | |
67 | 38.6M | S = jbig2_arith_decode(ctx, as, &IAx[PREV]); |
68 | 38.6M | if (S < 0) |
69 | 0 | return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx S"); |
70 | 38.6M | PREV = (PREV << 1) | S; |
71 | | |
72 | 38.6M | bit = jbig2_arith_decode(ctx, as, &IAx[PREV]); |
73 | 38.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 | 38.6M | PREV = (PREV << 1) | bit; |
76 | 38.6M | if (bit) { |
77 | 9.54M | bit = jbig2_arith_decode(ctx, as, &IAx[PREV]); |
78 | 9.54M | if (bit < 0) |
79 | 0 | return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 1"); |
80 | 9.54M | PREV = (PREV << 1) | bit; |
81 | | |
82 | 9.54M | if (bit) { |
83 | 7.13M | bit = jbig2_arith_decode(ctx, as, &IAx[PREV]); |
84 | 7.13M | if (bit < 0) |
85 | 0 | return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 2"); |
86 | 7.13M | PREV = (PREV << 1) | bit; |
87 | | |
88 | 7.13M | if (bit) { |
89 | 7.06M | bit = jbig2_arith_decode(ctx, as, &IAx[PREV]); |
90 | 7.06M | if (bit < 0) |
91 | 0 | return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 3"); |
92 | 7.06M | PREV = (PREV << 1) | bit; |
93 | | |
94 | 7.06M | if (bit) { |
95 | 6.34M | bit = jbig2_arith_decode(ctx, as, &IAx[PREV]); |
96 | 6.34M | if (bit < 0) |
97 | 0 | return jbig2_error(ctx, JBIG2_SEVERITY_WARNING, JBIG2_UNKNOWN_SEGMENT_NUMBER, "failed to decode IAx decision bit 4"); |
98 | 6.34M | PREV = (PREV << 1) | bit; |
99 | | |
100 | 6.34M | if (bit) { |
101 | 244k | n_tail = 32; |
102 | 244k | offset = 4436; |
103 | 6.10M | } else { |
104 | 6.10M | n_tail = 12; |
105 | 6.10M | offset = 340; |
106 | 6.10M | } |
107 | 6.34M | } else { |
108 | 720k | n_tail = 8; |
109 | 720k | offset = 84; |
110 | 720k | } |
111 | 7.06M | } else { |
112 | 65.6k | n_tail = 6; |
113 | 65.6k | offset = 20; |
114 | 65.6k | } |
115 | 7.13M | } else { |
116 | 2.41M | n_tail = 4; |
117 | 2.41M | offset = 4; |
118 | 2.41M | } |
119 | 29.1M | } else { |
120 | 29.1M | n_tail = 2; |
121 | 29.1M | offset = 0; |
122 | 29.1M | } |
123 | | |
124 | 38.6M | V = 0; |
125 | 193M | for (i = 0; i < n_tail; i++) { |
126 | 155M | bit = jbig2_arith_decode(ctx, as, &IAx[PREV]); |
127 | 155M | 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 | 155M | PREV = ((PREV << 1) & 511) | (PREV & 256) | bit; |
130 | 155M | V = (V << 1) | bit; |
131 | 155M | } |
132 | | |
133 | | /* offset is always >=0, so underflow can't happen. */ |
134 | | /* avoid overflow by clamping 32 bit value. */ |
135 | 38.6M | if (V > INT32_MAX - offset) |
136 | 95 | V = INT32_MAX; |
137 | 38.6M | else |
138 | 38.6M | V += offset; |
139 | 38.6M | V = S ? -V : V; |
140 | 38.6M | *p_result = V; |
141 | 38.6M | return S && V == 0 ? 1 : 0; |
142 | 38.6M | } |
143 | | |
144 | | void |
145 | | jbig2_arith_int_ctx_free(Jbig2Ctx *ctx, Jbig2ArithIntCtx *iax) |
146 | 28.1k | { |
147 | 28.1k | jbig2_free(ctx->allocator, iax); |
148 | 28.1k | } |