std/jpeg: optimize IDCT when AC terms are zero

name                                             old speed     new speed     delta

wuffs_jpeg_decode_19k_8bpp/clang11               199MB/s ± 0%  211MB/s ± 0%   +5.69%  (p=0.008 n=5+5)
wuffs_jpeg_decode_30k_24bpp_progressive/clang11  169MB/s ± 1%  176MB/s ± 0%   +4.32%  (p=0.008 n=5+5)
wuffs_jpeg_decode_30k_24bpp_sequential/clang11   269MB/s ± 0%  291MB/s ± 0%   +7.89%  (p=0.008 n=5+5)
wuffs_jpeg_decode_77k_24bpp/clang11              250MB/s ± 0%  254MB/s ± 0%   +1.90%  (p=0.008 n=5+5)
wuffs_jpeg_decode_552k_24bpp_420/clang11         258MB/s ± 0%  262MB/s ± 0%   +1.51%  (p=0.008 n=5+5)
wuffs_jpeg_decode_552k_24bpp_444/clang11         275MB/s ± 0%  356MB/s ± 0%  +29.59%  (p=0.016 n=5+4)
wuffs_jpeg_decode_4002k_24bpp/clang11            261MB/s ± 0%  263MB/s ± 1%   +0.61%  (p=0.008 n=5+5)

wuffs_jpeg_decode_19k_8bpp/gcc10                 153MB/s ± 0%  165MB/s ± 0%   +8.09%  (p=0.008 n=5+5)
wuffs_jpeg_decode_30k_24bpp_progressive/gcc10    180MB/s ± 0%  197MB/s ± 0%   +9.56%  (p=0.008 n=5+5)
wuffs_jpeg_decode_30k_24bpp_sequential/gcc10     288MB/s ± 0%  337MB/s ± 0%  +16.81%  (p=0.008 n=5+5)
wuffs_jpeg_decode_77k_24bpp/gcc10                237MB/s ± 0%  245MB/s ± 0%   +3.47%  (p=0.008 n=5+5)
wuffs_jpeg_decode_552k_24bpp_420/gcc10           247MB/s ± 0%  256MB/s ± 0%   +3.71%  (p=0.016 n=4+5)
wuffs_jpeg_decode_552k_24bpp_444/gcc10           249MB/s ± 0%  348MB/s ± 0%  +39.88%  (p=0.008 n=5+5)
wuffs_jpeg_decode_4002k_24bpp/gcc10              247MB/s ± 0%  254MB/s ± 0%   +2.81%  (p=0.008 n=5+5)
This commit is contained in:
Nigel Tao committed 2023-06-08 22:03:46 +10:00
1 parent ca2909b6d7
commit d6cc525059
3 files changed
+2281 -1524

No files matched your search

+1203 -797
View File
@@ -119,1112 +119,1518 @@ pri func decoder.decode_idct!(dst_buffer: slice base.u8, dst_stride: base.u64, b
// ==== First pass, column 0.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x08] |
this.mcu_blocks[args.b][0x10] |
this.mcu_blocks[args.b][0x18] |
this.mcu_blocks[args.b][0x20] |
this.mcu_blocks[args.b][0x28] |
this.mcu_blocks[args.b][0x30] |
this.mcu_blocks[args.b][0x38])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x10]) ~mod* (this.quant_tables[args.q][0x10] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x30]) ~mod* (this.quant_tables[args.q][0x30] as base.u32)
intermediate[0x00] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x00]) ~mod*
(this.quant_tables[args.q][0x00] as base.u32)) ~mod<< 2
intermediate[0x08] = intermediate[0x00]
intermediate[0x10] = intermediate[0x00]
intermediate[0x18] = intermediate[0x00]
intermediate[0x20] = intermediate[0x00]
intermediate[0x28] = intermediate[0x00]
intermediate[0x30] = intermediate[0x00]
intermediate[0x38] = intermediate[0x00]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x10]) ~mod* (this.quant_tables[args.q][0x10] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x30]) ~mod* (this.quant_tables[args.q][0x30] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x00]) ~mod* (this.quant_tables[args.q][0x00] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x20]) ~mod* (this.quant_tables[args.q][0x20] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x00]) ~mod* (this.quant_tables[args.q][0x00] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x20]) ~mod* (this.quant_tables[args.q][0x20] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x08]) ~mod* (this.quant_tables[args.q][0x08] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x18]) ~mod* (this.quant_tables[args.q][0x18] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x28]) ~mod* (this.quant_tables[args.q][0x28] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x38]) ~mod* (this.quant_tables[args.q][0x38] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x08]) ~mod* (this.quant_tables[args.q][0x08] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x18]) ~mod* (this.quant_tables[args.q][0x18] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x28]) ~mod* (this.quant_tables[args.q][0x28] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x38]) ~mod* (this.quant_tables[args.q][0x38] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x00] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x38] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x08] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x30] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x10] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x28] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x18] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x20] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x00] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x38] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x08] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x30] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x10] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x28] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x18] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x20] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== First pass, column 1.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x09] |
this.mcu_blocks[args.b][0x11] |
this.mcu_blocks[args.b][0x19] |
this.mcu_blocks[args.b][0x21] |
this.mcu_blocks[args.b][0x29] |
this.mcu_blocks[args.b][0x31] |
this.mcu_blocks[args.b][0x39])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x11]) ~mod* (this.quant_tables[args.q][0x11] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x31]) ~mod* (this.quant_tables[args.q][0x31] as base.u32)
intermediate[0x01] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x01]) ~mod*
(this.quant_tables[args.q][0x01] as base.u32)) ~mod<< 2
intermediate[0x09] = intermediate[0x01]
intermediate[0x11] = intermediate[0x01]
intermediate[0x19] = intermediate[0x01]
intermediate[0x21] = intermediate[0x01]
intermediate[0x29] = intermediate[0x01]
intermediate[0x31] = intermediate[0x01]
intermediate[0x39] = intermediate[0x01]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x11]) ~mod* (this.quant_tables[args.q][0x11] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x31]) ~mod* (this.quant_tables[args.q][0x31] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x01]) ~mod* (this.quant_tables[args.q][0x01] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x21]) ~mod* (this.quant_tables[args.q][0x21] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x01]) ~mod* (this.quant_tables[args.q][0x01] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x21]) ~mod* (this.quant_tables[args.q][0x21] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x09]) ~mod* (this.quant_tables[args.q][0x09] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x19]) ~mod* (this.quant_tables[args.q][0x19] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x29]) ~mod* (this.quant_tables[args.q][0x29] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x39]) ~mod* (this.quant_tables[args.q][0x39] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x09]) ~mod* (this.quant_tables[args.q][0x09] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x19]) ~mod* (this.quant_tables[args.q][0x19] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x29]) ~mod* (this.quant_tables[args.q][0x29] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x39]) ~mod* (this.quant_tables[args.q][0x39] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x01] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x39] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x09] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x31] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x11] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x29] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x19] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x21] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x01] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x39] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x09] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x31] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x11] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x29] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x19] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x21] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== First pass, column 2.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x0A] |
this.mcu_blocks[args.b][0x12] |
this.mcu_blocks[args.b][0x1A] |
this.mcu_blocks[args.b][0x22] |
this.mcu_blocks[args.b][0x2A] |
this.mcu_blocks[args.b][0x32] |
this.mcu_blocks[args.b][0x3A])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x12]) ~mod* (this.quant_tables[args.q][0x12] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x32]) ~mod* (this.quant_tables[args.q][0x32] as base.u32)
intermediate[0x02] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x02]) ~mod*
(this.quant_tables[args.q][0x02] as base.u32)) ~mod<< 2
intermediate[0x0A] = intermediate[0x02]
intermediate[0x12] = intermediate[0x02]
intermediate[0x1A] = intermediate[0x02]
intermediate[0x22] = intermediate[0x02]
intermediate[0x2A] = intermediate[0x02]
intermediate[0x32] = intermediate[0x02]
intermediate[0x3A] = intermediate[0x02]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x12]) ~mod* (this.quant_tables[args.q][0x12] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x32]) ~mod* (this.quant_tables[args.q][0x32] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x02]) ~mod* (this.quant_tables[args.q][0x02] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x22]) ~mod* (this.quant_tables[args.q][0x22] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x02]) ~mod* (this.quant_tables[args.q][0x02] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x22]) ~mod* (this.quant_tables[args.q][0x22] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0A]) ~mod* (this.quant_tables[args.q][0x0A] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1A]) ~mod* (this.quant_tables[args.q][0x1A] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2A]) ~mod* (this.quant_tables[args.q][0x2A] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3A]) ~mod* (this.quant_tables[args.q][0x3A] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0A]) ~mod* (this.quant_tables[args.q][0x0A] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1A]) ~mod* (this.quant_tables[args.q][0x1A] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2A]) ~mod* (this.quant_tables[args.q][0x2A] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3A]) ~mod* (this.quant_tables[args.q][0x3A] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x02] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3A] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0A] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x32] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x12] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2A] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1A] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x22] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x02] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3A] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0A] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x32] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x12] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2A] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1A] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x22] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== First pass, column 3.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x0B] |
this.mcu_blocks[args.b][0x13] |
this.mcu_blocks[args.b][0x1B] |
this.mcu_blocks[args.b][0x23] |
this.mcu_blocks[args.b][0x2B] |
this.mcu_blocks[args.b][0x33] |
this.mcu_blocks[args.b][0x3B])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x13]) ~mod* (this.quant_tables[args.q][0x13] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x33]) ~mod* (this.quant_tables[args.q][0x33] as base.u32)
intermediate[0x03] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x03]) ~mod*
(this.quant_tables[args.q][0x03] as base.u32)) ~mod<< 2
intermediate[0x0B] = intermediate[0x03]
intermediate[0x13] = intermediate[0x03]
intermediate[0x1B] = intermediate[0x03]
intermediate[0x23] = intermediate[0x03]
intermediate[0x2B] = intermediate[0x03]
intermediate[0x33] = intermediate[0x03]
intermediate[0x3B] = intermediate[0x03]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x13]) ~mod* (this.quant_tables[args.q][0x13] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x33]) ~mod* (this.quant_tables[args.q][0x33] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x03]) ~mod* (this.quant_tables[args.q][0x03] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x23]) ~mod* (this.quant_tables[args.q][0x23] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x03]) ~mod* (this.quant_tables[args.q][0x03] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x23]) ~mod* (this.quant_tables[args.q][0x23] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0B]) ~mod* (this.quant_tables[args.q][0x0B] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1B]) ~mod* (this.quant_tables[args.q][0x1B] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2B]) ~mod* (this.quant_tables[args.q][0x2B] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3B]) ~mod* (this.quant_tables[args.q][0x3B] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0B]) ~mod* (this.quant_tables[args.q][0x0B] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1B]) ~mod* (this.quant_tables[args.q][0x1B] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2B]) ~mod* (this.quant_tables[args.q][0x2B] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3B]) ~mod* (this.quant_tables[args.q][0x3B] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x03] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3B] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0B] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x33] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x13] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2B] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1B] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x23] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x03] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3B] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0B] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x33] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x13] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2B] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1B] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x23] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== First pass, column 4.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x0C] |
this.mcu_blocks[args.b][0x14] |
this.mcu_blocks[args.b][0x1C] |
this.mcu_blocks[args.b][0x24] |
this.mcu_blocks[args.b][0x2C] |
this.mcu_blocks[args.b][0x34] |
this.mcu_blocks[args.b][0x3C])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x14]) ~mod* (this.quant_tables[args.q][0x14] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x34]) ~mod* (this.quant_tables[args.q][0x34] as base.u32)
intermediate[0x04] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x04]) ~mod*
(this.quant_tables[args.q][0x04] as base.u32)) ~mod<< 2
intermediate[0x0C] = intermediate[0x04]
intermediate[0x14] = intermediate[0x04]
intermediate[0x1C] = intermediate[0x04]
intermediate[0x24] = intermediate[0x04]
intermediate[0x2C] = intermediate[0x04]
intermediate[0x34] = intermediate[0x04]
intermediate[0x3C] = intermediate[0x04]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x14]) ~mod* (this.quant_tables[args.q][0x14] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x34]) ~mod* (this.quant_tables[args.q][0x34] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x04]) ~mod* (this.quant_tables[args.q][0x04] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x24]) ~mod* (this.quant_tables[args.q][0x24] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x04]) ~mod* (this.quant_tables[args.q][0x04] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x24]) ~mod* (this.quant_tables[args.q][0x24] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0C]) ~mod* (this.quant_tables[args.q][0x0C] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1C]) ~mod* (this.quant_tables[args.q][0x1C] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2C]) ~mod* (this.quant_tables[args.q][0x2C] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3C]) ~mod* (this.quant_tables[args.q][0x3C] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0C]) ~mod* (this.quant_tables[args.q][0x0C] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1C]) ~mod* (this.quant_tables[args.q][0x1C] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2C]) ~mod* (this.quant_tables[args.q][0x2C] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3C]) ~mod* (this.quant_tables[args.q][0x3C] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x04] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3C] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0C] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x34] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x14] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2C] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1C] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x24] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x04] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3C] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0C] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x34] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x14] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2C] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1C] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x24] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== First pass, column 5.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x0D] |
this.mcu_blocks[args.b][0x15] |
this.mcu_blocks[args.b][0x1D] |
this.mcu_blocks[args.b][0x25] |
this.mcu_blocks[args.b][0x2D] |
this.mcu_blocks[args.b][0x35] |
this.mcu_blocks[args.b][0x3D])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x15]) ~mod* (this.quant_tables[args.q][0x15] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x35]) ~mod* (this.quant_tables[args.q][0x35] as base.u32)
intermediate[0x05] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x05]) ~mod*
(this.quant_tables[args.q][0x05] as base.u32)) ~mod<< 2
intermediate[0x0D] = intermediate[0x05]
intermediate[0x15] = intermediate[0x05]
intermediate[0x1D] = intermediate[0x05]
intermediate[0x25] = intermediate[0x05]
intermediate[0x2D] = intermediate[0x05]
intermediate[0x35] = intermediate[0x05]
intermediate[0x3D] = intermediate[0x05]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x15]) ~mod* (this.quant_tables[args.q][0x15] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x35]) ~mod* (this.quant_tables[args.q][0x35] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x05]) ~mod* (this.quant_tables[args.q][0x05] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x25]) ~mod* (this.quant_tables[args.q][0x25] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x05]) ~mod* (this.quant_tables[args.q][0x05] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x25]) ~mod* (this.quant_tables[args.q][0x25] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0D]) ~mod* (this.quant_tables[args.q][0x0D] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1D]) ~mod* (this.quant_tables[args.q][0x1D] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2D]) ~mod* (this.quant_tables[args.q][0x2D] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3D]) ~mod* (this.quant_tables[args.q][0x3D] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0D]) ~mod* (this.quant_tables[args.q][0x0D] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1D]) ~mod* (this.quant_tables[args.q][0x1D] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2D]) ~mod* (this.quant_tables[args.q][0x2D] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3D]) ~mod* (this.quant_tables[args.q][0x3D] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x05] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3D] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0D] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x35] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x15] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2D] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1D] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x25] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x05] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3D] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0D] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x35] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x15] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2D] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1D] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x25] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== First pass, column 6.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x0E] |
this.mcu_blocks[args.b][0x16] |
this.mcu_blocks[args.b][0x1E] |
this.mcu_blocks[args.b][0x26] |
this.mcu_blocks[args.b][0x2E] |
this.mcu_blocks[args.b][0x36] |
this.mcu_blocks[args.b][0x3E])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x16]) ~mod* (this.quant_tables[args.q][0x16] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x36]) ~mod* (this.quant_tables[args.q][0x36] as base.u32)
intermediate[0x06] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x06]) ~mod*
(this.quant_tables[args.q][0x06] as base.u32)) ~mod<< 2
intermediate[0x0E] = intermediate[0x06]
intermediate[0x16] = intermediate[0x06]
intermediate[0x1E] = intermediate[0x06]
intermediate[0x26] = intermediate[0x06]
intermediate[0x2E] = intermediate[0x06]
intermediate[0x36] = intermediate[0x06]
intermediate[0x3E] = intermediate[0x06]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x16]) ~mod* (this.quant_tables[args.q][0x16] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x36]) ~mod* (this.quant_tables[args.q][0x36] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x06]) ~mod* (this.quant_tables[args.q][0x06] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x26]) ~mod* (this.quant_tables[args.q][0x26] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x06]) ~mod* (this.quant_tables[args.q][0x06] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x26]) ~mod* (this.quant_tables[args.q][0x26] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0E]) ~mod* (this.quant_tables[args.q][0x0E] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1E]) ~mod* (this.quant_tables[args.q][0x1E] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2E]) ~mod* (this.quant_tables[args.q][0x2E] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3E]) ~mod* (this.quant_tables[args.q][0x3E] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0E]) ~mod* (this.quant_tables[args.q][0x0E] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1E]) ~mod* (this.quant_tables[args.q][0x1E] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2E]) ~mod* (this.quant_tables[args.q][0x2E] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3E]) ~mod* (this.quant_tables[args.q][0x3E] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x06] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3E] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0E] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x36] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x16] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2E] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1E] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x26] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x06] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3E] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0E] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x36] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x16] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2E] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1E] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x26] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== First pass, column 7.
// Even rows.
if (0 == (
this.mcu_blocks[args.b][0x0F] |
this.mcu_blocks[args.b][0x17] |
this.mcu_blocks[args.b][0x1F] |
this.mcu_blocks[args.b][0x27] |
this.mcu_blocks[args.b][0x2F] |
this.mcu_blocks[args.b][0x37] |
this.mcu_blocks[args.b][0x3F])) {
// Fast path when the 1-dimensional AC terms are all zero.
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x17]) ~mod* (this.quant_tables[args.q][0x17] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x37]) ~mod* (this.quant_tables[args.q][0x37] as base.u32)
intermediate[0x07] =
(this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x07]) ~mod*
(this.quant_tables[args.q][0x07] as base.u32)) ~mod<< 2
intermediate[0x0F] = intermediate[0x07]
intermediate[0x17] = intermediate[0x07]
intermediate[0x1F] = intermediate[0x07]
intermediate[0x27] = intermediate[0x07]
intermediate[0x2F] = intermediate[0x07]
intermediate[0x37] = intermediate[0x07]
intermediate[0x3F] = intermediate[0x07]
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
} else {
// Even rows.
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
bq2 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x17]) ~mod* (this.quant_tables[args.q][0x17] as base.u32)
bq6 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x37]) ~mod* (this.quant_tables[args.q][0x37] as base.u32)
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x07]) ~mod* (this.quant_tables[args.q][0x07] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x27]) ~mod* (this.quant_tables[args.q][0x27] as base.u32)
ca = (bq2 ~mod+ bq6) ~mod* 0x1151
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
cb2 = ca ~mod+ (bq2 ~mod* 0x187E)
cb6 = ca ~mod- (bq6 ~mod* 0x3B21)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
bq0 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x07]) ~mod* (this.quant_tables[args.q][0x07] as base.u32)
bq4 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x27]) ~mod* (this.quant_tables[args.q][0x27] as base.u32)
// Odd rows.
ccp = (bq0 ~mod+ bq4) ~mod<< 13
ccm = (bq0 ~mod- bq4) ~mod<< 13
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0F]) ~mod* (this.quant_tables[args.q][0x0F] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1F]) ~mod* (this.quant_tables[args.q][0x1F] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2F]) ~mod* (this.quant_tables[args.q][0x2F] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3F]) ~mod* (this.quant_tables[args.q][0x3F] as base.u32)
cd0 = ccp ~mod+ cb2
cd1 = ccm ~mod+ cb6
cd2 = ccm ~mod- cb6
cd3 = ccp ~mod- cb2
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
// Odd rows.
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
bq1 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x0F]) ~mod* (this.quant_tables[args.q][0x0F] as base.u32)
bq3 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x1F]) ~mod* (this.quant_tables[args.q][0x1F] as base.u32)
bq5 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x2F]) ~mod* (this.quant_tables[args.q][0x2F] as base.u32)
bq7 = this.util.sign_extend_convert_u16_u32(a: this.mcu_blocks[args.b][0x3F]) ~mod* (this.quant_tables[args.q][0x3F] as base.u32)
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ci51 = bq5 ~mod+ bq1
ci53 = bq5 ~mod+ bq3
ci71 = bq7 ~mod+ bq1
ci73 = bq7 ~mod+ bq3
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
cj = (ci73 ~mod+ ci51) ~mod* 0x25A1
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
ck1 = bq1 ~mod* 0x300B
ck3 = bq3 ~mod* 0x6254
ck5 = bq5 ~mod* 0x41B3
ck7 = bq7 ~mod* 0x098E
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
ci51 ~mod*= 0xFFFF_F384
ci53 ~mod*= 0xFFFF_ADFD
ci71 ~mod*= 0xFFFF_E333
ci73 ~mod*= 0xFFFF_C13B
// Combine rows.
cl51 = ci51 ~mod+ cj
cl73 = ci73 ~mod+ cj
intermediate[0x07] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3F] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0F] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x37] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x17] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2F] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1F] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x27] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
ck1 ~mod+= ci71 ~mod+ cl51
ck3 ~mod+= ci53 ~mod+ cl73
ck5 ~mod+= ci53 ~mod+ cl51
ck7 ~mod+= ci71 ~mod+ cl73
// Combine rows.
intermediate[0x07] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod+ ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x3F] = this.util.sign_extend_rshift_u32(a: (cd0 ~mod- ck1) ~mod+ (1 << 10), n: 11)
intermediate[0x0F] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod+ ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x37] = this.util.sign_extend_rshift_u32(a: (cd1 ~mod- ck3) ~mod+ (1 << 10), n: 11)
intermediate[0x17] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod+ ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x2F] = this.util.sign_extend_rshift_u32(a: (cd2 ~mod- ck5) ~mod+ (1 << 10), n: 11)
intermediate[0x1F] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod+ ck7) ~mod+ (1 << 10), n: 11)
intermediate[0x27] = this.util.sign_extend_rshift_u32(a: (cd3 ~mod- ck7) ~mod+ (1 << 10), n: 11)
}
// ==== Second pass, row 0.
// Even columns.
if (0 == (
intermediate[0x01] |
intermediate[0x02] |
intermediate[0x03] |
intermediate[0x04] |
intermediate[0x05] |
intermediate[0x06] |
intermediate[0x07])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x02]
in6 = intermediate[0x06]
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x00] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
in0 = intermediate[0x00]
in4 = intermediate[0x04]
} else {
// Even columns.
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
in2 = intermediate[0x02]
in6 = intermediate[0x06]
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
ra = (in2 ~mod+ in6) ~mod* 0x1151
// Odd columns.
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
in1 = intermediate[0x01]
in3 = intermediate[0x03]
in5 = intermediate[0x05]
in7 = intermediate[0x07]
in0 = intermediate[0x00]
in4 = intermediate[0x04]
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Odd columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
in1 = intermediate[0x01]
in3 = intermediate[0x03]
in5 = intermediate[0x05]
in7 = intermediate[0x07]
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Combine columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
if args.dst_stride > args.dst_buffer.length() {
return nothing
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
// ==== Second pass, row 1.
// Even columns.
if (0 == (
intermediate[0x09] |
intermediate[0x0A] |
intermediate[0x0B] |
intermediate[0x0C] |
intermediate[0x0D] |
intermediate[0x0E] |
intermediate[0x0F])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x0A]
in6 = intermediate[0x0E]
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x08] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
in0 = intermediate[0x08]
in4 = intermediate[0x0C]
} else {
// Even columns.
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
in2 = intermediate[0x0A]
in6 = intermediate[0x0E]
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
ra = (in2 ~mod+ in6) ~mod* 0x1151
// Odd columns.
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
in1 = intermediate[0x09]
in3 = intermediate[0x0B]
in5 = intermediate[0x0D]
in7 = intermediate[0x0F]
in0 = intermediate[0x08]
in4 = intermediate[0x0C]
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Odd columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
in1 = intermediate[0x09]
in3 = intermediate[0x0B]
in5 = intermediate[0x0D]
in7 = intermediate[0x0F]
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Combine columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
if args.dst_stride > args.dst_buffer.length() {
return nothing
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
// ==== Second pass, row 2.
// Even columns.
if (0 == (
intermediate[0x11] |
intermediate[0x12] |
intermediate[0x13] |
intermediate[0x14] |
intermediate[0x15] |
intermediate[0x16] |
intermediate[0x17])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x12]
in6 = intermediate[0x16]
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x10] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
in0 = intermediate[0x10]
in4 = intermediate[0x14]
} else {
// Even columns.
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
in2 = intermediate[0x12]
in6 = intermediate[0x16]
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
ra = (in2 ~mod+ in6) ~mod* 0x1151
// Odd columns.
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
in1 = intermediate[0x11]
in3 = intermediate[0x13]
in5 = intermediate[0x15]
in7 = intermediate[0x17]
in0 = intermediate[0x10]
in4 = intermediate[0x14]
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Odd columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
in1 = intermediate[0x11]
in3 = intermediate[0x13]
in5 = intermediate[0x15]
in7 = intermediate[0x17]
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Combine columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
if args.dst_stride > args.dst_buffer.length() {
return nothing
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
// ==== Second pass, row 3.
// Even columns.
if (0 == (
intermediate[0x19] |
intermediate[0x1A] |
intermediate[0x1B] |
intermediate[0x1C] |
intermediate[0x1D] |
intermediate[0x1E] |
intermediate[0x1F])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x1A]
in6 = intermediate[0x1E]
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x18] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
in0 = intermediate[0x18]
in4 = intermediate[0x1C]
} else {
// Even columns.
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
in2 = intermediate[0x1A]
in6 = intermediate[0x1E]
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
ra = (in2 ~mod+ in6) ~mod* 0x1151
// Odd columns.
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
in1 = intermediate[0x19]
in3 = intermediate[0x1B]
in5 = intermediate[0x1D]
in7 = intermediate[0x1F]
in0 = intermediate[0x18]
in4 = intermediate[0x1C]
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Odd columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
in1 = intermediate[0x19]
in3 = intermediate[0x1B]
in5 = intermediate[0x1D]
in7 = intermediate[0x1F]
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Combine columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
if args.dst_stride > args.dst_buffer.length() {
return nothing
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
// ==== Second pass, row 4.
// Even columns.
if (0 == (
intermediate[0x21] |
intermediate[0x22] |
intermediate[0x23] |
intermediate[0x24] |
intermediate[0x25] |
intermediate[0x26] |
intermediate[0x27])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x22]
in6 = intermediate[0x26]
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x20] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
in0 = intermediate[0x20]
in4 = intermediate[0x24]
} else {
// Even columns.
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
in2 = intermediate[0x22]
in6 = intermediate[0x26]
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
ra = (in2 ~mod+ in6) ~mod* 0x1151
// Odd columns.
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
in1 = intermediate[0x21]
in3 = intermediate[0x23]
in5 = intermediate[0x25]
in7 = intermediate[0x27]
in0 = intermediate[0x20]
in4 = intermediate[0x24]
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Odd columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
in1 = intermediate[0x21]
in3 = intermediate[0x23]
in5 = intermediate[0x25]
in7 = intermediate[0x27]
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Combine columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
if args.dst_stride > args.dst_buffer.length() {
return nothing
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
// ==== Second pass, row 5.
// Even columns.
if (0 == (
intermediate[0x29] |
intermediate[0x2A] |
intermediate[0x2B] |
intermediate[0x2C] |
intermediate[0x2D] |
intermediate[0x2E] |
intermediate[0x2F])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x2A]
in6 = intermediate[0x2E]
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x28] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
in0 = intermediate[0x28]
in4 = intermediate[0x2C]
} else {
// Even columns.
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
in2 = intermediate[0x2A]
in6 = intermediate[0x2E]
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
ra = (in2 ~mod+ in6) ~mod* 0x1151
// Odd columns.
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
in1 = intermediate[0x29]
in3 = intermediate[0x2B]
in5 = intermediate[0x2D]
in7 = intermediate[0x2F]
in0 = intermediate[0x28]
in4 = intermediate[0x2C]
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Odd columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
in1 = intermediate[0x29]
in3 = intermediate[0x2B]
in5 = intermediate[0x2D]
in7 = intermediate[0x2F]
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Combine columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
if args.dst_stride > args.dst_buffer.length() {
return nothing
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
// ==== Second pass, row 6.
// Even columns.
if (0 == (
intermediate[0x31] |
intermediate[0x32] |
intermediate[0x33] |
intermediate[0x34] |
intermediate[0x35] |
intermediate[0x36] |
intermediate[0x37])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x32]
in6 = intermediate[0x36]
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x30] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
in0 = intermediate[0x30]
in4 = intermediate[0x34]
} else {
// Even columns.
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
in2 = intermediate[0x32]
in6 = intermediate[0x36]
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
ra = (in2 ~mod+ in6) ~mod* 0x1151
// Odd columns.
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
in1 = intermediate[0x31]
in3 = intermediate[0x33]
in5 = intermediate[0x35]
in7 = intermediate[0x37]
in0 = intermediate[0x30]
in4 = intermediate[0x34]
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Odd columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
in1 = intermediate[0x31]
in3 = intermediate[0x33]
in5 = intermediate[0x35]
in7 = intermediate[0x37]
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Combine columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
if args.dst_stride > args.dst_buffer.length() {
return nothing
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if args.dst_stride > args.dst_buffer.length() {
return nothing
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
}
assert 8 <= args.dst_buffer.length() via "a <= b: a <= c; c <= b"(c: args.dst_stride)
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer = args.dst_buffer[args.dst_stride ..]
// ==== Second pass, row 7.
// Even columns.
if (0 == (
intermediate[0x39] |
intermediate[0x3A] |
intermediate[0x3B] |
intermediate[0x3C] |
intermediate[0x3D] |
intermediate[0x3E] |
intermediate[0x3F])) {
// Fast path when the 1-dimensional AC terms are all zero.
in2 = intermediate[0x3A]
in6 = intermediate[0x3E]
if 8 > args.dst_buffer.length() {
return nothing
}
ra = (in2 ~mod+ in6) ~mod* 0x1151
args.dst_buffer[0] = BIAS_AND_CLAMP[((intermediate[0x38] ~mod+ (1 << 4)) >> 5) & 1023]
args.dst_buffer[1] = args.dst_buffer[0]
args.dst_buffer[2] = args.dst_buffer[0]
args.dst_buffer[3] = args.dst_buffer[0]
args.dst_buffer[4] = args.dst_buffer[0]
args.dst_buffer[5] = args.dst_buffer[0]
args.dst_buffer[6] = args.dst_buffer[0]
args.dst_buffer[7] = args.dst_buffer[0]
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
} else {
// Even columns.
in0 = intermediate[0x38]
in4 = intermediate[0x3C]
in2 = intermediate[0x3A]
in6 = intermediate[0x3E]
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
ra = (in2 ~mod+ in6) ~mod* 0x1151
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rb2 = ra ~mod+ (in2 ~mod* 0x187E)
rb6 = ra ~mod- (in6 ~mod* 0x3B21)
// Odd columns.
in0 = intermediate[0x38]
in4 = intermediate[0x3C]
in1 = intermediate[0x39]
in3 = intermediate[0x3B]
in5 = intermediate[0x3D]
in7 = intermediate[0x3F]
rcp = (in0 ~mod+ in4) ~mod<< 13
rcm = (in0 ~mod- in4) ~mod<< 13
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rd0 = rcp ~mod+ rb2
rd1 = rcm ~mod+ rb6
rd2 = rcm ~mod- rb6
rd3 = rcp ~mod- rb2
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
// Odd columns.
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
in1 = intermediate[0x39]
in3 = intermediate[0x3B]
in5 = intermediate[0x3D]
in7 = intermediate[0x3F]
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
ri51 = in5 ~mod+ in1
ri53 = in5 ~mod+ in3
ri71 = in7 ~mod+ in1
ri73 = in7 ~mod+ in3
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rj = (ri73 ~mod+ ri51) ~mod* 0x25A1
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
rk1 = in1 ~mod* 0x300B
rk3 = in3 ~mod* 0x6254
rk5 = in5 ~mod* 0x41B3
rk7 = in7 ~mod* 0x098E
// Combine columns.
ri51 ~mod*= 0xFFFF_F384
ri53 ~mod*= 0xFFFF_ADFD
ri71 ~mod*= 0xFFFF_E333
ri73 ~mod*= 0xFFFF_C13B
rl51 = ri51 ~mod+ rj
rl73 = ri73 ~mod+ rj
rk1 ~mod+= ri71 ~mod+ rl51
rk3 ~mod+= ri53 ~mod+ rl73
rk5 ~mod+= ri53 ~mod+ rl51
rk7 ~mod+= ri71 ~mod+ rl73
// Combine columns.
if 8 > args.dst_buffer.length() {
return nothing
}
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
if 8 > args.dst_buffer.length() {
return nothing
}
args.dst_buffer[0] = BIAS_AND_CLAMP[(((rd0 ~mod+ rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[7] = BIAS_AND_CLAMP[(((rd0 ~mod- rk1) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[1] = BIAS_AND_CLAMP[(((rd1 ~mod+ rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[6] = BIAS_AND_CLAMP[(((rd1 ~mod- rk3) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[2] = BIAS_AND_CLAMP[(((rd2 ~mod+ rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[5] = BIAS_AND_CLAMP[(((rd2 ~mod- rk5) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[3] = BIAS_AND_CLAMP[(((rd3 ~mod+ rk7) ~mod+ (1 << 17)) >> 18) & 1023]
args.dst_buffer[4] = BIAS_AND_CLAMP[(((rd3 ~mod- rk7) ~mod+ (1 << 17)) >> 18) & 1023]
// -------- END generated by script/print-jpeg-idct-code.go
}