/src/libjxl/lib/jxl/icc_codec.cc
Line | Count | Source |
1 | | // Copyright (c) the JPEG XL Project Authors. All rights reserved. |
2 | | // |
3 | | // Use of this source code is governed by a BSD-style |
4 | | // license that can be found in the LICENSE file. |
5 | | |
6 | | #include "lib/jxl/icc_codec.h" |
7 | | |
8 | | #include <jxl/memory_manager.h> |
9 | | |
10 | | #include <algorithm> |
11 | | #include <cstddef> |
12 | | #include <cstdint> |
13 | | |
14 | | #include "lib/jxl/base/common.h" |
15 | | #include "lib/jxl/base/status.h" |
16 | | #include "lib/jxl/dec_ans.h" |
17 | | #include "lib/jxl/dec_bit_reader.h" |
18 | | #include "lib/jxl/fields.h" |
19 | | #include "lib/jxl/icc_codec_common.h" |
20 | | #include "lib/jxl/padded_bytes.h" |
21 | | |
22 | | namespace jxl { |
23 | | namespace { |
24 | | |
25 | | // Shuffles or interleaves bytes, for example with width 2, turns "ABCDabcd" |
26 | | // into "AaBbCcDd". Transposes a matrix of ceil(size / width) columns and |
27 | | // width rows. There are size elements, size may be < width * height, if so the |
28 | | // last elements of the rightmost column are missing, the missing spots are |
29 | | // transposed along with the filled spots, and the result has the missing |
30 | | // elements at the end of the bottom row. The input is the input matrix in |
31 | | // scanline order but with missing elements skipped (which may occur in multiple |
32 | | // locations), the output is the result matrix in scanline order (with |
33 | | // no need to skip missing elements as they are past the end of the data). |
34 | | Status Shuffle(JxlMemoryManager* memory_manager, uint8_t* data, size_t size, |
35 | 1.88k | size_t width) { |
36 | 1.88k | size_t height = (size + width - 1) / width; // amount of rows of output |
37 | 1.88k | PaddedBytes result(memory_manager); |
38 | 1.88k | JXL_ASSIGN_OR_RETURN(result, |
39 | 1.88k | PaddedBytes::WithInitialSpace(memory_manager, size)); |
40 | | // i = output index, j input index |
41 | 1.88k | size_t s = 0; |
42 | 1.88k | size_t j = 0; |
43 | 18.1k | for (size_t i = 0; i < size; i++) { |
44 | 16.2k | result[i] = data[j]; |
45 | 16.2k | j += height; |
46 | 16.2k | if (j >= size) j = ++s; |
47 | 16.2k | } |
48 | | |
49 | 18.1k | for (size_t i = 0; i < size; i++) { |
50 | 16.2k | data[i] = result[i]; |
51 | 16.2k | } |
52 | 1.88k | return true; |
53 | 1.88k | } |
54 | | |
55 | | // TODO(eustas): should be 20, or even 18, once DecodeVarInt is improved; |
56 | | // currently DecodeVarInt does not signal the errors, and marks |
57 | | // 11 bytes as used even if only 10 are used (and 9 is enough for |
58 | | // 63-bit values). |
59 | | constexpr const size_t kPreambleSize = 22; // enough for reading 2 VarInts |
60 | | |
61 | 22.0k | uint64_t DecodeVarInt(const uint8_t* input, size_t inputSize, size_t* pos) { |
62 | 22.0k | size_t i; |
63 | 22.0k | uint64_t ret = 0; |
64 | 28.9k | for (i = 0; *pos + i < inputSize && i < 10; ++i) { |
65 | 28.7k | ret |= static_cast<uint64_t>(input[*pos + i] & 127) |
66 | 28.7k | << static_cast<uint64_t>(7 * i); |
67 | | // If the next-byte flag is not set, stop |
68 | 28.7k | if ((input[*pos + i] & 128) == 0) break; |
69 | 28.7k | } |
70 | | // TODO(user): Return a decoding error if i == 10. |
71 | 22.0k | *pos += i + 1; |
72 | 22.0k | return ret; |
73 | 22.0k | } |
74 | | |
75 | | } // namespace |
76 | | |
77 | | // Mimics the beginning of UnpredictICC for quick validity check. |
78 | | // At least kPreambleSize bytes of data should be valid at invocation time. |
79 | 3.20k | Status CheckPreamble(const PaddedBytes& data, size_t enc_size) { |
80 | 3.20k | const uint8_t* enc = data.data(); |
81 | 3.20k | size_t size = data.size(); |
82 | 3.20k | size_t pos = 0; |
83 | 3.20k | uint64_t osize = DecodeVarInt(enc, size, &pos); |
84 | 3.20k | JXL_RETURN_IF_ERROR(CheckIs32Bit(osize)); |
85 | 3.16k | if (pos >= size) return JXL_FAILURE("Out of bounds"); |
86 | 3.16k | uint64_t csize = DecodeVarInt(enc, size, &pos); |
87 | 3.16k | JXL_RETURN_IF_ERROR(CheckIs32Bit(csize)); |
88 | 3.15k | JXL_RETURN_IF_ERROR(CheckOutOfBounds(pos, csize, size)); |
89 | | // We expect that UnpredictICC inflates input, not the other way round. |
90 | 3.11k | if (osize + 65536 < enc_size) return JXL_FAILURE("Malformed ICC"); |
91 | | |
92 | | // NB(eustas): 64 MiB ICC should be enough for everything!? |
93 | 3.05k | const size_t output_limit = 1 << 28; |
94 | 3.05k | if (output_limit && osize > output_limit) { |
95 | 12 | return JXL_FAILURE("Decoded ICC is too large"); |
96 | 12 | } |
97 | 3.04k | return true; |
98 | 3.05k | } |
99 | | |
100 | | // Decodes the result of PredictICC back to a valid ICC profile. |
101 | 9.34k | Status UnpredictICC(const uint8_t* enc, size_t size, PaddedBytes* result) { |
102 | 9.34k | if (!result->empty()) return JXL_FAILURE("result must be empty initially"); |
103 | 9.34k | JxlMemoryManager* memory_manager = result->memory_manager(); |
104 | 9.34k | size_t pos = 0; |
105 | | // TODO(lode): technically speaking we need to check that the entire varint |
106 | | // decoding never goes out of bounds, not just the first byte. This requires |
107 | | // a DecodeVarInt function that returns an error code. It is safe to use |
108 | | // DecodeVarInt with out of bounds values, it silently returns, but the |
109 | | // specification requires an error. Idem for all DecodeVarInt below. |
110 | 9.34k | if (pos >= size) return JXL_FAILURE("Out of bounds"); |
111 | 3.46k | uint64_t osize = DecodeVarInt(enc, size, &pos); // Output size |
112 | 3.46k | JXL_RETURN_IF_ERROR(CheckIs32Bit(osize)); |
113 | 3.45k | if (pos >= size) return JXL_FAILURE("Out of bounds"); |
114 | 3.39k | uint64_t csize = DecodeVarInt(enc, size, &pos); // Commands size |
115 | | // Every command is translated to at least on byte. |
116 | 3.39k | JXL_RETURN_IF_ERROR(CheckIs32Bit(csize)); |
117 | 3.38k | size_t cpos = pos; // pos in commands stream |
118 | 3.38k | JXL_RETURN_IF_ERROR(CheckOutOfBounds(pos, csize, size)); |
119 | 1.85k | size_t commands_end = cpos + csize; |
120 | 1.85k | pos = commands_end; // pos in data stream |
121 | | |
122 | | // Header |
123 | 1.85k | PaddedBytes header{memory_manager}; |
124 | 1.85k | JXL_RETURN_IF_ERROR(header.append(ICCInitialHeaderPrediction(osize))); |
125 | 112k | for (size_t i = 0; i <= kICCHeaderSize; i++) { |
126 | 112k | if (result->size() == osize) { |
127 | 907 | if (cpos != commands_end) return JXL_FAILURE("Not all commands used"); |
128 | 737 | if (pos != size) return JXL_FAILURE("Not all data used"); |
129 | 38 | return true; // Valid end |
130 | 737 | } |
131 | 111k | if (i == kICCHeaderSize) break; // Done |
132 | 110k | ICCPredictHeader(result->data(), result->size(), header.data(), i); |
133 | 110k | if (pos >= size) return JXL_FAILURE("Out of bounds"); |
134 | 110k | JXL_RETURN_IF_ERROR(result->push_back(enc[pos++] + header[i])); |
135 | 110k | } |
136 | 822 | if (cpos >= commands_end) return JXL_FAILURE("Out of bounds"); |
137 | | |
138 | | // Tag list |
139 | 813 | uint64_t numtags = DecodeVarInt(enc, size, &cpos); |
140 | | |
141 | 813 | if (numtags != 0) { |
142 | 631 | numtags--; |
143 | 631 | JXL_RETURN_IF_ERROR(CheckIs32Bit(numtags)); |
144 | 591 | JXL_RETURN_IF_ERROR(AppendUint32(numtags, result)); |
145 | 591 | uint64_t prevtagstart = kICCHeaderSize + numtags * 12; |
146 | 591 | uint64_t prevtagsize = 0; |
147 | 12.1k | for (;;) { |
148 | 12.1k | if (result->size() > osize) return JXL_FAILURE("Invalid result size"); |
149 | 12.1k | if (cpos > commands_end) return JXL_FAILURE("Out of bounds"); |
150 | 12.0k | if (cpos == commands_end) break; // Valid end |
151 | 11.9k | uint8_t command = enc[cpos++]; |
152 | 11.9k | uint8_t tagcode = command & 63; |
153 | 11.9k | Tag tag; |
154 | 11.9k | if (tagcode == 0) { |
155 | 315 | break; |
156 | 11.6k | } else if (tagcode == kCommandTagUnknown) { |
157 | 497 | JXL_RETURN_IF_ERROR(CheckOutOfBounds(pos, 4, size)); |
158 | 481 | tag = DecodeKeyword(enc, size, pos); |
159 | 481 | pos += 4; |
160 | 11.1k | } else if (tagcode == kCommandTagTRC) { |
161 | 1.00k | tag = kRtrcTag; |
162 | 10.1k | } else if (tagcode == kCommandTagXYZ) { |
163 | 658 | tag = kRxyzTag; |
164 | 9.51k | } else { |
165 | 9.51k | if (tagcode - kCommandTagStringFirst >= kNumTagStrings) { |
166 | 60 | return JXL_FAILURE("Unknown tagcode"); |
167 | 60 | } |
168 | 9.45k | tag = *kTagStrings[tagcode - kCommandTagStringFirst]; |
169 | 9.45k | } |
170 | 11.5k | JXL_RETURN_IF_ERROR(AppendKeyword(tag, result)); |
171 | | |
172 | 11.5k | uint64_t tagstart; |
173 | 11.5k | uint64_t tagsize = prevtagsize; |
174 | 11.5k | if (tag == kRxyzTag || tag == kGxyzTag || tag == kBxyzTag || |
175 | 9.02k | tag == kKxyzTag || tag == kWtptTag || tag == kBkptTag || |
176 | 6.17k | tag == kLumiTag) { |
177 | 6.17k | tagsize = 20; |
178 | 6.17k | } |
179 | | |
180 | 11.5k | if (command & kFlagBitOffset) { |
181 | 2.03k | if (cpos >= commands_end) return JXL_FAILURE("Out of bounds"); |
182 | 2.00k | tagstart = DecodeVarInt(enc, size, &cpos); |
183 | 9.55k | } else { |
184 | 9.55k | JXL_RETURN_IF_ERROR(CheckIs32Bit(prevtagstart)); |
185 | 9.55k | tagstart = prevtagstart + prevtagsize; |
186 | 9.55k | } |
187 | 11.5k | JXL_RETURN_IF_ERROR(CheckIs32Bit(tagstart)); |
188 | 11.5k | JXL_RETURN_IF_ERROR(AppendUint32(tagstart, result)); |
189 | 11.5k | if (command & kFlagBitSize) { |
190 | 1.83k | if (cpos >= commands_end) return JXL_FAILURE("Out of bounds"); |
191 | 1.80k | tagsize = DecodeVarInt(enc, size, &cpos); |
192 | 1.80k | } |
193 | 11.5k | JXL_RETURN_IF_ERROR(CheckIs32Bit(tagsize)); |
194 | 11.5k | JXL_RETURN_IF_ERROR(AppendUint32(tagsize, result)); |
195 | 11.5k | prevtagstart = tagstart; |
196 | 11.5k | prevtagsize = tagsize; |
197 | | |
198 | 11.5k | if (tagcode == kCommandTagTRC) { |
199 | 995 | JXL_RETURN_IF_ERROR(AppendKeyword(kGtrcTag, result)); |
200 | 995 | JXL_RETURN_IF_ERROR(AppendUint32(tagstart, result)); |
201 | 995 | JXL_RETURN_IF_ERROR(AppendUint32(tagsize, result)); |
202 | 995 | JXL_RETURN_IF_ERROR(AppendKeyword(kBtrcTag, result)); |
203 | 995 | JXL_RETURN_IF_ERROR(AppendUint32(tagstart, result)); |
204 | 995 | JXL_RETURN_IF_ERROR(AppendUint32(tagsize, result)); |
205 | 995 | } |
206 | | |
207 | 11.5k | if (tagcode == kCommandTagXYZ) { |
208 | 657 | JXL_RETURN_IF_ERROR(CheckIs32Bit(tagstart + tagsize * 2)); |
209 | 657 | JXL_RETURN_IF_ERROR(AppendKeyword(kGxyzTag, result)); |
210 | 657 | JXL_RETURN_IF_ERROR(AppendUint32(tagstart + tagsize, result)); |
211 | 657 | JXL_RETURN_IF_ERROR(AppendUint32(tagsize, result)); |
212 | 657 | JXL_RETURN_IF_ERROR(AppendKeyword(kBxyzTag, result)); |
213 | 657 | JXL_RETURN_IF_ERROR(AppendUint32(tagstart + tagsize * 2, result)); |
214 | 657 | JXL_RETURN_IF_ERROR(AppendUint32(tagsize, result)); |
215 | 657 | } |
216 | 11.5k | } |
217 | 591 | } |
218 | | |
219 | | // Main Content |
220 | 6.44k | for (;;) { |
221 | 6.44k | if (result->size() > osize) return JXL_FAILURE("Invalid result size"); |
222 | 6.44k | if (cpos > commands_end) return JXL_FAILURE("Out of bounds"); |
223 | 6.43k | if (cpos == commands_end) break; // Valid end |
224 | 6.28k | uint8_t command = enc[cpos++]; |
225 | 6.28k | if (command == kCommandInsert) { |
226 | 657 | if (cpos >= commands_end) return JXL_FAILURE("Out of bounds"); |
227 | 649 | uint64_t num = DecodeVarInt(enc, size, &cpos); |
228 | 649 | JXL_RETURN_IF_ERROR(CheckOutOfBounds(pos, num, size)); |
229 | 2.32k | for (size_t i = 0; i < num; i++) { |
230 | 1.72k | JXL_RETURN_IF_ERROR(result->push_back(enc[pos++])); |
231 | 1.72k | } |
232 | 5.62k | } else if (command == kCommandShuffle2 || command == kCommandShuffle4) { |
233 | 1.17k | if (cpos >= commands_end) return JXL_FAILURE("Out of bounds"); |
234 | 1.16k | uint64_t num = DecodeVarInt(enc, size, &cpos); |
235 | 1.16k | JXL_RETURN_IF_ERROR(CheckOutOfBounds(pos, num, size)); |
236 | 1.12k | PaddedBytes shuffled(memory_manager); |
237 | 1.12k | JXL_ASSIGN_OR_RETURN(shuffled, |
238 | 1.12k | PaddedBytes::WithInitialSpace(memory_manager, num)); |
239 | 9.29k | for (size_t i = 0; i < num; i++) { |
240 | 8.16k | shuffled[i] = enc[pos + i]; |
241 | 8.16k | } |
242 | 1.12k | if (command == kCommandShuffle2) { |
243 | 348 | JXL_RETURN_IF_ERROR(Shuffle(memory_manager, shuffled.data(), num, 2)); |
244 | 780 | } else if (command == kCommandShuffle4) { |
245 | 780 | JXL_RETURN_IF_ERROR(Shuffle(memory_manager, shuffled.data(), num, 4)); |
246 | 780 | } |
247 | 9.29k | for (size_t i = 0; i < num; i++) { |
248 | 8.16k | JXL_RETURN_IF_ERROR(result->push_back(shuffled[i])); |
249 | 8.16k | pos++; |
250 | 8.16k | } |
251 | 4.44k | } else if (command == kCommandPredict) { |
252 | 1.96k | JXL_RETURN_IF_ERROR(CheckOutOfBounds(cpos, 2, commands_end)); |
253 | 1.94k | uint8_t flags = enc[cpos++]; |
254 | | |
255 | 1.94k | size_t width = (flags & 3) + 1; |
256 | 1.94k | if (width == 3) return JXL_FAILURE("Invalid width"); |
257 | | |
258 | 1.94k | int order = (flags & 12) >> 2; |
259 | 1.94k | if (order == 3) return JXL_FAILURE("Invalid order"); |
260 | | |
261 | 1.94k | uint64_t stride = width; |
262 | 1.94k | if (flags & 16) { |
263 | 514 | if (cpos >= commands_end) return JXL_FAILURE("Out of bounds"); |
264 | 514 | stride = DecodeVarInt(enc, size, &cpos); |
265 | 514 | if (stride < width) { |
266 | 3 | return JXL_FAILURE("Invalid stride"); |
267 | 3 | } |
268 | 514 | } |
269 | | // If stride * 4 >= result->size(), return failure. The check |
270 | | // "size == 0 || ((size - 1) >> 2) < stride" corresponds to |
271 | | // "stride * 4 >= size", but does not suffer from integer overflow. |
272 | | // This check is more strict than necessary but follows the specification |
273 | | // and the encoder should ensure this is followed. |
274 | 1.93k | if (result->empty() || ((result->size() - 1u) >> 2u) < stride) { |
275 | 62 | return JXL_FAILURE("Invalid stride"); |
276 | 62 | } |
277 | | |
278 | 1.87k | if (cpos >= commands_end) return JXL_FAILURE("Out of bounds"); |
279 | 1.86k | uint64_t num = DecodeVarInt(enc, size, &cpos); // in bytes |
280 | 1.86k | JXL_RETURN_IF_ERROR(CheckOutOfBounds(pos, num, size)); |
281 | | |
282 | 1.83k | PaddedBytes shuffled(memory_manager); |
283 | 1.83k | JXL_ASSIGN_OR_RETURN(shuffled, |
284 | 1.83k | PaddedBytes::WithInitialSpace(memory_manager, num)); |
285 | | |
286 | 27.9k | for (size_t i = 0; i < num; i++) { |
287 | 26.0k | shuffled[i] = enc[pos + i]; |
288 | 26.0k | } |
289 | 1.83k | if (width > 1) { |
290 | 753 | JXL_RETURN_IF_ERROR( |
291 | 753 | Shuffle(memory_manager, shuffled.data(), num, width)); |
292 | 753 | } |
293 | | |
294 | 1.83k | size_t start = result->size(); |
295 | 27.9k | for (size_t i = 0; i < num; i++) { |
296 | 26.0k | uint8_t predicted = LinearPredictICCValue(result->data(), start, i, |
297 | 26.0k | stride, width, order); |
298 | 26.0k | JXL_RETURN_IF_ERROR(result->push_back(predicted + shuffled[i])); |
299 | 26.0k | } |
300 | 1.83k | pos += num; |
301 | 2.48k | } else if (command == kCommandXYZ) { |
302 | 878 | JXL_RETURN_IF_ERROR(AppendKeyword(kXyz_Tag, result)); |
303 | 4.39k | for (int i = 0; i < 4; i++) { |
304 | 3.51k | JXL_RETURN_IF_ERROR(result->push_back(0)); |
305 | 3.51k | } |
306 | 878 | JXL_RETURN_IF_ERROR(CheckOutOfBounds(pos, 12, size)); |
307 | 11.2k | for (size_t i = 0; i < 12; i++) { |
308 | 10.4k | JXL_RETURN_IF_ERROR(result->push_back(enc[pos++])); |
309 | 10.4k | } |
310 | 1.60k | } else if (command >= kCommandTypeStartFirst && |
311 | 1.51k | command < kCommandTypeStartFirst + kNumTypeStrings) { |
312 | 1.40k | JXL_RETURN_IF_ERROR(AppendKeyword( |
313 | 1.40k | *kTypeStrings[command - kCommandTypeStartFirst], result)); |
314 | 7.02k | for (size_t i = 0; i < 4; i++) { |
315 | 5.62k | JXL_RETURN_IF_ERROR(result->push_back(0)); |
316 | 5.62k | } |
317 | 1.40k | } else { |
318 | 197 | return JXL_FAILURE("Unknown command"); |
319 | 197 | } |
320 | 6.28k | } |
321 | | |
322 | 157 | if (pos != size) return JXL_FAILURE("Not all data used"); |
323 | 6 | if (result->size() != osize) return JXL_FAILURE("Invalid result size"); |
324 | | |
325 | 3 | return true; |
326 | 6 | } |
327 | | |
328 | 33.5k | Status ICCReader::Init(BitReader* reader) { |
329 | 33.5k | JXL_RETURN_IF_ERROR(CheckEOI(reader)); |
330 | 33.5k | JxlMemoryManager* memory_manager = decompressed_.memory_manager(); |
331 | 33.5k | used_bits_base_ = reader->TotalBitsConsumed(); |
332 | 33.5k | if (bits_to_skip_ == 0) { |
333 | 33.4k | enc_size_ = U64Coder::Read(reader); |
334 | 33.4k | if (enc_size_ > 268435456) { |
335 | | // Avoid too large memory allocation for invalid file. |
336 | 204 | return JXL_FAILURE("Too large encoded profile"); |
337 | 204 | } |
338 | 33.2k | JXL_RETURN_IF_ERROR(DecodeHistograms( |
339 | 33.2k | memory_manager, reader, kNumICCContexts, &code_, &context_map_)); |
340 | 33.3k | JXL_ASSIGN_OR_RETURN(ans_reader_, ANSSymbolReader::Create(&code_, reader)); |
341 | 33.3k | i_ = 0; |
342 | 33.3k | JXL_RETURN_IF_ERROR( |
343 | 33.3k | decompressed_.resize(std::min<size_t>(i_ + 0x400, enc_size_))); |
344 | 27.7k | for (; i_ < std::min<size_t>(2, enc_size_); i_++) { |
345 | 11.0k | decompressed_[i_] = ans_reader_.ReadHybridUint( |
346 | 11.0k | ICCANSContext(i_, i_ > 0 ? decompressed_[i_ - 1] : 0, |
347 | 11.0k | i_ > 1 ? decompressed_[i_ - 2] : 0), |
348 | 11.0k | reader, context_map_); |
349 | 11.0k | } |
350 | 16.6k | if (enc_size_ > kPreambleSize) { |
351 | 74.6k | for (; i_ < kPreambleSize; i_++) { |
352 | 71.0k | decompressed_[i_] = ans_reader_.ReadHybridUint( |
353 | 71.0k | ICCANSContext(i_, decompressed_[i_ - 1], decompressed_[i_ - 2]), |
354 | 71.0k | reader, context_map_); |
355 | 71.0k | } |
356 | 3.55k | JXL_RETURN_IF_ERROR(CheckEOI(reader)); |
357 | 3.20k | JXL_RETURN_IF_ERROR(CheckPreamble(decompressed_, enc_size_)); |
358 | 3.20k | } |
359 | 16.1k | bits_to_skip_ = reader->TotalBitsConsumed() - used_bits_base_; |
360 | 16.1k | } else { |
361 | 94 | reader->SkipBits(bits_to_skip_); |
362 | 94 | } |
363 | 16.2k | return true; |
364 | 33.5k | } |
365 | | |
366 | 10.9k | Status ICCReader::Process(BitReader* reader, PaddedBytes* icc) { |
367 | 10.9k | auto checkpoint = jxl::make_unique<ANSSymbolReader::Checkpoint>(); |
368 | 10.9k | size_t saved_i = 0; |
369 | 34.9k | auto save = [&]() { |
370 | 34.9k | ans_reader_.Save(checkpoint.get()); |
371 | 34.9k | bits_to_skip_ = reader->TotalBitsConsumed() - used_bits_base_; |
372 | 34.9k | saved_i = i_; |
373 | 34.9k | }; |
374 | 10.9k | save(); |
375 | 34.9k | auto check_and_restore = [&]() -> Status { |
376 | 34.9k | Status status = CheckEOI(reader); |
377 | 34.9k | if (!status) { |
378 | | // not enough bytes. |
379 | 1.55k | ans_reader_.Restore(*checkpoint); |
380 | 1.55k | i_ = saved_i; |
381 | 1.55k | return status; |
382 | 1.55k | } |
383 | 33.4k | return true; |
384 | 34.9k | }; |
385 | 13.1M | for (; i_ < enc_size_; i_++) { |
386 | 13.1M | if (i_ % ANSSymbolReader::kMaxCheckpointInterval == 0 && i_ > 0) { |
387 | 24.7k | JXL_RETURN_IF_ERROR(check_and_restore()); |
388 | 24.0k | save(); |
389 | 24.0k | if ((i_ > 0) && (((i_ & 0xFFFF) == 0))) { |
390 | 116 | float used_bytes = |
391 | 116 | (reader->TotalBitsConsumed() - used_bits_base_) / 8.0f; |
392 | 116 | if (i_ > used_bytes * 256) return JXL_FAILURE("Corrupted stream"); |
393 | 116 | } |
394 | 24.0k | JXL_RETURN_IF_ERROR( |
395 | 24.0k | decompressed_.resize(std::min<size_t>(i_ + 0x400, enc_size_))); |
396 | 24.0k | } |
397 | 13.1M | JXL_ENSURE(i_ >= 2); |
398 | 13.1M | decompressed_[i_] = ans_reader_.ReadHybridUint( |
399 | 13.1M | ICCANSContext(i_, decompressed_[i_ - 1], decompressed_[i_ - 2]), reader, |
400 | 13.1M | context_map_); |
401 | 13.1M | } |
402 | 10.2k | JXL_RETURN_IF_ERROR(check_and_restore()); |
403 | 9.34k | bits_to_skip_ = reader->TotalBitsConsumed() - used_bits_base_; |
404 | 9.34k | if (!ans_reader_.CheckANSFinalState()) { |
405 | 0 | return JXL_FAILURE("Corrupted ICC profile"); |
406 | 0 | } |
407 | | |
408 | 9.34k | icc->clear(); |
409 | 9.34k | return UnpredictICC(decompressed_.data(), decompressed_.size(), icc); |
410 | 9.34k | } |
411 | | |
412 | 72.1k | Status ICCReader::CheckEOI(BitReader* reader) { |
413 | 72.1k | if (reader->AllReadsWithinBounds()) return true; |
414 | 1.91k | return JXL_NOT_ENOUGH_BYTES("Not enough bytes for reading ICC profile"); |
415 | 72.1k | } |
416 | | |
417 | | } // namespace jxl |