/rust/registry/src/index.crates.io-6f17d22bba15001f/image-webp-0.2.3/src/transform.rs
Line | Count | Source (jump to first uncovered line) |
1 | | static CONST1: i64 = 20091; |
2 | | static CONST2: i64 = 35468; |
3 | | |
4 | 0 | pub(crate) fn idct4x4(block: &mut [i32]) { |
5 | | // The intermediate results may overflow the types, so we stretch the type. |
6 | 0 | fn fetch(block: &[i32], idx: usize) -> i64 { |
7 | 0 | i64::from(block[idx]) |
8 | 0 | } |
9 | | |
10 | | // Perform one lenght check up front to avoid subsequent bounds checks in this function |
11 | 0 | assert!(block.len() >= 16); |
12 | | |
13 | 0 | for i in 0usize..4 { |
14 | 0 | let a1 = fetch(block, i) + fetch(block, 8 + i); |
15 | 0 | let b1 = fetch(block, i) - fetch(block, 8 + i); |
16 | 0 |
|
17 | 0 | let t1 = (fetch(block, 4 + i) * CONST2) >> 16; |
18 | 0 | let t2 = fetch(block, 12 + i) + ((fetch(block, 12 + i) * CONST1) >> 16); |
19 | 0 | let c1 = t1 - t2; |
20 | 0 |
|
21 | 0 | let t1 = fetch(block, 4 + i) + ((fetch(block, 4 + i) * CONST1) >> 16); |
22 | 0 | let t2 = (fetch(block, 12 + i) * CONST2) >> 16; |
23 | 0 | let d1 = t1 + t2; |
24 | 0 |
|
25 | 0 | block[i] = (a1 + d1) as i32; |
26 | 0 | block[4 + i] = (b1 + c1) as i32; |
27 | 0 | block[4 * 3 + i] = (a1 - d1) as i32; |
28 | 0 | block[4 * 2 + i] = (b1 - c1) as i32; |
29 | 0 | } |
30 | | |
31 | 0 | for i in 0usize..4 { |
32 | 0 | let a1 = fetch(block, 4 * i) + fetch(block, 4 * i + 2); |
33 | 0 | let b1 = fetch(block, 4 * i) - fetch(block, 4 * i + 2); |
34 | 0 |
|
35 | 0 | let t1 = (fetch(block, 4 * i + 1) * CONST2) >> 16; |
36 | 0 | let t2 = fetch(block, 4 * i + 3) + ((fetch(block, 4 * i + 3) * CONST1) >> 16); |
37 | 0 | let c1 = t1 - t2; |
38 | 0 |
|
39 | 0 | let t1 = fetch(block, 4 * i + 1) + ((fetch(block, 4 * i + 1) * CONST1) >> 16); |
40 | 0 | let t2 = (fetch(block, 4 * i + 3) * CONST2) >> 16; |
41 | 0 | let d1 = t1 + t2; |
42 | 0 |
|
43 | 0 | block[4 * i] = ((a1 + d1 + 4) >> 3) as i32; |
44 | 0 | block[4 * i + 3] = ((a1 - d1 + 4) >> 3) as i32; |
45 | 0 | block[4 * i + 1] = ((b1 + c1 + 4) >> 3) as i32; |
46 | 0 | block[4 * i + 2] = ((b1 - c1 + 4) >> 3) as i32; |
47 | 0 | } |
48 | 0 | } |
49 | | |
50 | | // 14.3 |
51 | 0 | pub(crate) fn iwht4x4(block: &mut [i32]) { |
52 | 0 | // Perform one length check up front to avoid subsequent bounds checks in this function |
53 | 0 | assert!(block.len() >= 16); |
54 | | |
55 | 0 | for i in 0usize..4 { |
56 | 0 | let a1 = block[i] + block[12 + i]; |
57 | 0 | let b1 = block[4 + i] + block[8 + i]; |
58 | 0 | let c1 = block[4 + i] - block[8 + i]; |
59 | 0 | let d1 = block[i] - block[12 + i]; |
60 | 0 |
|
61 | 0 | block[i] = a1 + b1; |
62 | 0 | block[4 + i] = c1 + d1; |
63 | 0 | block[8 + i] = a1 - b1; |
64 | 0 | block[12 + i] = d1 - c1; |
65 | 0 | } |
66 | | |
67 | 0 | for block in block.chunks_exact_mut(4) { |
68 | 0 | let a1 = block[0] + block[3]; |
69 | 0 | let b1 = block[1] + block[2]; |
70 | 0 | let c1 = block[1] - block[2]; |
71 | 0 | let d1 = block[0] - block[3]; |
72 | 0 |
|
73 | 0 | let a2 = a1 + b1; |
74 | 0 | let b2 = c1 + d1; |
75 | 0 | let c2 = a1 - b1; |
76 | 0 | let d2 = d1 - c1; |
77 | 0 |
|
78 | 0 | block[0] = (a2 + 3) >> 3; |
79 | 0 | block[1] = (b2 + 3) >> 3; |
80 | 0 | block[2] = (c2 + 3) >> 3; |
81 | 0 | block[3] = (d2 + 3) >> 3; |
82 | 0 | } |
83 | 0 | } |