fast_morphology 0.3.2

Fast morphological operations for images
Documentation 
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

/*
 * Copyright (c) Radzivon Bartoshyk. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 *
 * 1.  Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * 2.  Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 *
 * 3.  Neither the name of the copyright holder nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
use std::arch::aarch64::*;

#[inline(always)]
unsafe fn xvld1q_u8_x4(a: *const u8) -> uint8x16x4_t {
    let v0 = vld1q_u8(a);
    let v1 = vld1q_u8(a.add(16));
    let v2 = vld1q_u8(a.add(32));
    let v3 = vld1q_u8(a.add(48));
    uint8x16x4_t(v0, v1, v2, v3)
}

#[inline(always)]
unsafe fn xvld1q_u8_x2(a: *const u8) -> uint8x16x2_t {
    let v0 = vld1q_u8(a);
    let v1 = vld1q_u8(a.add(16));
    uint8x16x2_t(v0, v1)
}

#[inline(always)]
unsafe fn xvst1q_u8_x4(a: *mut u8, b: uint8x16x4_t) {
    vst1q_u8(a, b.0);
    vst1q_u8(a.add(16), b.1);
    vst1q_u8(a.add(32), b.2);
    vst1q_u8(a.add(48), b.3);
}

#[inline(always)]
unsafe fn xvst1q_u8_x2(a: *mut u8, b: uint8x16x2_t) {
    vst1q_u8(a, b.0);
    vst1q_u8(a.add(16), b.1);
}

pub fn morph_gradient_neon(dilation: &[u8], erosion: &[u8], dst: &mut [u8]) {
    if dilation.len() != erosion.len() || erosion.len() != dst.len() {
        panic!(
            "All array must match in size for gradient but received v0: {}, v1: {}, v2: {}",
            dilation.len(),
            erosion.len(),
            dst.len()
        );
    }
    let length = dilation.len();
    let mut cx = 0usize;

    unsafe {
        while cx + 64 < length {
            let v0_set = xvld1q_u8_x4(dilation.get_unchecked(cx..).as_ptr());
            let v1_set = xvld1q_u8_x4(erosion.get_unchecked(cx..).as_ptr());
            let result_set = uint8x16x4_t(
                vqsubq_u8(v0_set.0, v1_set.0),
                vqsubq_u8(v0_set.1, v1_set.1),
                vqsubq_u8(v0_set.2, v1_set.2),
                vqsubq_u8(v0_set.3, v1_set.3),
            );
            xvst1q_u8_x4(dst.get_unchecked_mut(cx..).as_mut_ptr(), result_set);
            cx += 64;
        }

        while cx + 32 < length {
            let v0_set = xvld1q_u8_x2(dilation.get_unchecked(cx..).as_ptr());
            let v1_set = xvld1q_u8_x2(erosion.get_unchecked(cx..).as_ptr());
            let result_set =
                uint8x16x2_t(vqsubq_u8(v0_set.0, v1_set.0), vqsubq_u8(v0_set.1, v1_set.1));
            xvst1q_u8_x2(dst.get_unchecked_mut(cx..).as_mut_ptr(), result_set);
            cx += 32;
        }

        while cx + 16 < length {
            let v0_set = vld1q_u8(dilation.get_unchecked(cx..).as_ptr());
            let v1_set = vld1q_u8(erosion.get_unchecked(cx..).as_ptr());
            let result_set = vqsubq_u8(v0_set, v1_set);
            vst1q_u8(dst.get_unchecked_mut(cx..).as_mut_ptr(), result_set);
            cx += 16;
        }

        while cx + 8 < length {
            let v0_set = vld1_u8(dilation.get_unchecked(cx..).as_ptr());
            let v1_set = vld1_u8(erosion.get_unchecked(cx..).as_ptr());
            let result_set = vqsub_u8(v0_set, v1_set);
            vst1_u8(dst.get_unchecked_mut(cx..).as_mut_ptr(), result_set);
            cx += 8;
        }

        while cx < length {
            *dst.get_unchecked_mut(cx) = dilation
                .get_unchecked(cx)
                .saturating_sub(*erosion.get_unchecked(cx));
            cx += 1;
        }
    }
}