Coverage Report

Created: 2026-06-10 07:53

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