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