-
Notifications
You must be signed in to change notification settings - Fork 0
/
test.js
415 lines (379 loc) · 13.2 KB
/
test.js
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
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
/**
* Utility function to compare test output with expected values
*
* @param {*} testName
* @param {*} expected
* @param {*} output
*/
function compareOutput(testName, expected, output) {
let errCnt = 0;
for (let i = 0; i < expected.length; i++) {
let ex = expected[i];
let out = output[i];
let ok = true;
if (Array.isArray(ex)) { // Compare values, since shallow === doesn't work on arrays
for (let j = 0; j < ex.length; j++) {
if (ex[j] != out[j]) {
ok = false;
}
}
} else {
if (ex != out) {
ok = false;
}
}
if (!ok) {
errCnt++;
console.error("Error: " + testName + " output[" + i + "]:" + out + " doesn't match expected value of " + ex);
}
}
console.log(testName + " tests " + (errCnt === 0 ? "passed!" : " failed with " + errCnt + " failures"));
}
function testYCbCrToRGB(fn) {
// Array of input values and corresponding expected output values
// Note: Our integer YCbCr --> RGB has rounding errors, hence RGB values like '1', '254'
let testData = [ // Y, Cb, Cr, R, G, B, A
[0, 128, 128, 0, 0, 0, 255], // Black
[255, 128, 128, 255, 255, 255, 255], // White
[76, 85, 255, 254, 0, 0, 255], // Red
[150, 44, 21, 0, 255, 1, 255], // Green
[29, 255, 107, 0, 0, 254, 255], // Blue
];
let output = new Array(testData.length);
for (let i = 0; i < output.length; i++) {
output[i] = [0, 0, 0, 0];
}
let expected = [];
for (let i = 0; i < testData.length; i++) {
fn(testData[i][0], testData[i][1], testData[i][2], output[i]);
expected[i] = [testData[i][3], testData[i][4], testData[i][5], testData[i][6]];
}
testName = fn.name;
compareOutput(testName, expected, output);
}
function testExtend() {
// From Table 5 in https://www.impulseadventure.com/photo/jpeg-huffman-coding.html
let testData = [ // Bitstring, size, expected value. Uses strings for readability (vs 0b...)
["0", 0, 0],
["0", 1, -1],
["1", 1, 1],
["00", 2, -3],
["001", 3, -6],
["110", 3, 6],
["10001", 5, 17],
["00101", 5, -26],
["11110", 5, 30],
["0000000000", 10, -1023],
["11111111111", 11, 2047],
];
let output = [];
let expected = [];
for (let i = 0; i < testData.length; i++) {
output[i] = extend(parseInt(testData[i][0], 2), testData[i][1]);
expected[i] = testData[i][2];
}
testName = "Extend";
compareOutput(testName, expected, output);
}
function testLevelShift() {
// Example data from https://en.wikipedia.org/wiki/JPEG#Decoding
let coeffs = [
-66, -63, -71, -68, -56, -65, -68, -46,
-71, -73, -72, -46, -20, -41, -66, -57,
-70, -78, -68, -17, 20, -14, -61, -63,
-63, -73, -62, -8, 27, -14, -60, -58,
-58, -65, -61, -27, -6, -40, -68, -50,
-57, -57, -64, -58, -48, -66, -72, -47,
-53, -46, -61, -74, -65, -63, -62, -45,
-47, -34, -53, -74, -60, -47, -47, -41,
];
let expected = [
62, 65, 57, 60, 72, 63, 60, 82,
57, 55, 56, 82, 108, 87, 62, 71,
58, 50, 60, 111, 148, 114, 67, 65,
65, 55, 66, 120, 155, 114, 68, 70,
70, 63, 67, 101, 122, 88, 60, 78,
71, 71, 64, 70, 80, 62, 56, 81,
75, 82, 67, 54, 63, 65, 66, 83,
81, 94, 75, 54, 68, 81, 81, 87,
];
levelShift(coeffs);
testName = "Level shift";
compareOutput(testName, expected, coeffs);
}
function testReorder() {
// Example data from https://en.wikipedia.org/wiki/JPEG#Decoding
let coeffs = [
-26,
-3, 0,
-3, -2, -6,
2, -4, 1, -3,
1, 1, 5, 1, 2,
-1, 1, -1, 2, 0, 0,
0, 0, 0, -1, -1, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0,
0, 0, 0, 0,
0, 0, 0,
0, 0,
0,
];
let expected = [
-26, -3, -6, 2, 2, -1, 0, 0,
0, -2, -4, 1, 1, 0, 0, 0,
-3, 1, 5, -1, -1, 0, 0, 0,
-3, 1, 2, -1, 0, 0, 0, 0,
1, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
];
let scratch = new Array(coeffs.length);
reorder(coeffs, scratch);
testName = "Reordering";
compareOutput(testName, expected, coeffs);
}
function testDequantize() {
// Example data from https://en.wikipedia.org/wiki/JPEG#Decoding
let quantTable = [
16, 11, 10, 16, 24, 40, 51, 61,
12, 12, 14, 19, 26, 58, 60, 55,
14, 13, 16, 24, 40, 57, 69, 56,
14, 17, 22, 29, 51, 87, 80, 62,
18, 22, 37, 56, 68, 109, 103, 77,
24, 35, 55, 64, 81, 104, 113, 92,
49, 64, 78, 87, 103, 121, 120, 101,
72, 92, 95, 98, 112, 100, 103, 99,
];
let coeffs = [
-26, -3, -6, 2, 2, -1, 0, 0,
0, -2, -4, 1, 1, 0, 0, 0,
-3, 1, 5, -1, -1, 0, 0, 0,
-3, 1, 2, -1, 0, 0, 0, 0,
1, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
];
let expected = [
-416, -33, -60, 32, 48, -40, 0, 0,
0, -24, -56, 19, 26, 0, 0, 0,
-42, 13, 80, -24, -40, 0, 0, 0,
-42, 17, 44, -29, 0, 0, 0, 0,
18, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
];
dequantize(coeffs, quantTable);
testName = "Dequantization";
compareOutput(testName, expected, coeffs);
}
function testIDCT(fn) {
// Example data from https://en.wikipedia.org/wiki/JPEG#Decoding
let input = [
-416, -33, -60, 32, 48, -40, 0, 0,
0, -24, -56, 19, 26, 0, 0, 0,
-42, 13, 80, -24, -40, 0, 0, 0,
-42, 17, 44, -29, 0, 0, 0, 0,
18, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0,
];
let expected = [
-66, -63, -71, -68, -56, -65, -68, -46,
-71, -73, -72, -46, -20, -41, -66, -57,
-70, -78, -68, -17, 20, -14, -61, -63,
-63, -73, -62, -8, 27, -14, -60, -58,
-58, -65, -61, -27, -6, -40, -68, -50,
-57, -57, -64, -58, -48, -66, -72, -47,
-53, -46, -61, -74, -65, -63, -62, -45,
-47, -34, -53, -74, -60, -47, -47, -41,
];
let output = fn(input);
testName = fn.name;
compareOutput(testName, expected, output);
// This example was seen in the wild while writing the chen-wang IDCT
input = new Array(64).fill(0);
input[0] = 6; // Not special; could be another small # like 5, 7, 8....
expected = new Array(64).fill(1);
output = fn(input);
compareOutput(testName, expected, output);
// This example was seen in the wild while writing the chen-wang IDCT
input = new Array(64).fill(0);
input[0] = -6; // Not special; could be another small # like -9, -8, -7....
expected = new Array(64).fill(-1);
output = fn(input);
compareOutput(testName, expected, output);
}
function testHuffmanDecoder(decoder) {
const bits = [0,0,0,7,1,1,1,1,1,0,0,0,0,0,0,0,0]; // BITS needs to be 1-indexed, so set [0]...
delete bits[0]; // ... then delete it here. Gross but simplifies things for testing.
const values = [4, 5, 3, 2, 6, 1, 0, 7, 8, 9, 10, 11];
const lengths = [3, 3, 3, 3, 3, 3, 3, 4, 5, 6, 7, 8];
// Binary representation of huffman codes for <values> followed by 5 padding bits in the last byte
const codeStr = [0b00000101, 0b00111001, 0b01110111, 0b01111011, 0b11101111, 0b11011111, 0b11011111];
const reader = new DataViewReader(new DataView(new Uint8Array(codeStr).buffer));
const img = {}; // Dummy mock
img.scan = {};
img.scan.dcpred = [];
let testCnt = 0;
let errCnt = 0;
decoder.initDecoder(bits);
function runInsertTest(level, value, expected) {
let val = decoder.insertCode(level, value);
testCnt++;
if (val != expected) {
console.error("Test " + testCnt + " Failed (expected " + expected + ", got " + val
+ " while inserting " + value + ")");
errCnt++;
}
}
// Test insertions
for (let i = 0; i < values.length; i++) {
runInsertTest(lengths[i], values[i], true);
}
// We shouldn't be able to insert an 8th node at L3,
// but the HuffTree currently has no way of knowing this
// since nodes don't know the state of other nodes.
// For this to be a problem in practice, the JPEG
// file would have to be out-of-spec/corrupt
//runInsertTest(3, 12, false); // Too many nodes in tree
// Test retrieval
for (let i = 0; i < values.length; i++) {
let ret = decoder.decodeHuffman(reader, img);
testCnt++
if (ret != values[i]) {
console.error("Test " + testCnt + " Failed (expected " + values[i] + ", got " + ret + ")");
errCnt++;
}
}
console.log(decoder.constructor.name + " tests " + (errCnt === 0 ? "passed!" : " failed with " + errCnt + " failures"));
}
function testHasMoreBytes() {
let errCnt = 0;
let testCnt = 0;
const data = [0b00000101, 0b00111001, 0b01110111, 0b01111011];
let reader = new DataViewReader(new DataView(new Uint8Array(data).buffer));
// Test initial state
testCnt++;
if (!reader.hasMoreBytes()) {
console.error(`Test ${testCnt} (initial state) failed`);
errCnt++;
}
reader.nextByte();
reader.nextByte();
reader.nextByte();
// One more byte left
testCnt++;
if (!reader.hasMoreBytes()) {
console.error(`Test ${testCnt} (one byte left) failed`);
errCnt++;
}
reader.nextByte();
// Reader is empty
testCnt++;
if (reader.hasMoreBytes()) {
console.error(`Test ${testCnt} (reader is empty) failed`);
errCnt++;
}
if (errCnt) {
console.error(`DataViewReader ${errCnt}/${testCnt} tests failed`);
} else {
console.log(`DataViewReader ${testCnt}/${testCnt} tests passed`);
}
}
function testAlign() {
let errCnt = 0;
let testCnt = 0;
const data = [0b00000000, 0b00001111];
reader = new DataViewReader(new DataView(new Uint8Array(data).buffer));
let byte;
let testName = "";
testName = "Read a few bits, then align"
testCnt++;
reader.reset();
reader.nextBit() && reader.nextBit() && reader.nextBit();
reader.align();
byte = reader.nextByte();
if (byte != 0b00001111) {
console.error(`Test ${testCnt} (${testName}) failed`);
errCnt++;
}
testName = "Call align when we're already aligned";
testCnt++;
reader.reset();
reader.align();
byte = reader.nextByte();
if (byte != 0b0000000) {
console.error(`Test ${testCnt} (${testName}) failed`);
errCnt++;
}
if (errCnt) {
console.error(`DataViewReader ${errCnt}/${testCnt} tests failed`);
} else {
console.log(`DataViewReader ${testCnt}/${testCnt} tests passed`);
}
}
function testNextBit() {
let errCnt = 0;
let testCnt = 0;
// Byte #3 is 'stuffed'; values of bytes 1+2 are arbitrary but not 0xFF or 0x00
const data = [0b00001100, 0b11111111, 0b00000000, 0b10101010];
const reader = new DataViewReader(new DataView(new Uint8Array(data).buffer));
testName = "Stuffed byte";
testCnt++;
reader.reset();
for (let i = 0; i < 8; i++) {
reader.nextBit();
}
// Index should be 2 since that's the address of the 0x00 'stuffing'
if (reader.nextBit() != 1 || reader.currentIndex() != 2) {
console.error(`Test ${testCnt} (${testName}) failed`);
errCnt++;
}
testName = "Reading bits after stuffed byte";
testCnt++;
reader.reset();
for (let i = 0; i < 16; i++) {
reader.nextBit();
}
if (reader.nextBit() != 1 || reader.currentIndex() != 3) {
console.error(`Test ${testCnt} (${testName}) failed`);
errCnt++;
}
if (errCnt) {
console.error(`DataViewReader ${errCnt}/${testCnt} tests failed`);
} else {
console.log(`DataViewReader ${testCnt}/${testCnt} tests passed`);
}
}
// Reader
testHasMoreBytes();
testAlign();
testNextBit();
// Huffman decoder
let huffDecoder = new HuffTree();
testHuffmanDecoder(huffDecoder);
huffDecoder = new HuffArray();
testHuffmanDecoder(huffDecoder);
// Misc
testExtend();
testDequantize();
testReorder();
testLevelShift();
// IDCT
idctFn = idct;
testIDCT(idct);
idctFn = idctCached;
testIDCT(idctFn);
idctFn = idctChenWang;
testIDCT(idctFn);
// Colorspace conversion
colorspaceFn = YCbCrToRGB;
testYCbCrToRGB(colorspaceFn);
colorspaceFn = YCbCrToRGBInt;
testYCbCrToRGB(colorspaceFn);