-
-
Notifications
You must be signed in to change notification settings - Fork 2
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
6 changed files
with
245 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,218 @@ | ||
| // 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. | ||
|
|
||
| #[cfg(target_arch = "x86")] | ||
| use std::arch::x86::*; | ||
| #[cfg(target_arch = "x86_64")] | ||
| use std::arch::x86_64::*; | ||
| use erydanos::_mm_prefer_fma_ps; | ||
| use crate::unsafe_slice::UnsafeSlice; | ||
|
|
||
| pub fn gaussian_blur_vertical_pass_impl_f32_sse<T, const CHANNEL_CONFIGURATION: usize>( | ||
| undef_src: &[T], | ||
| src_stride: u32, | ||
| undef_unsafe_dst: &UnsafeSlice<T>, | ||
| dst_stride: u32, | ||
| width: u32, | ||
| height: u32, | ||
| kernel_size: usize, | ||
| kernel: &[f32], | ||
| start_y: u32, | ||
| end_y: u32, | ||
| ) { | ||
| let src: &[f32] = unsafe { std::mem::transmute(undef_src) }; | ||
| let unsafe_dst: &UnsafeSlice<'_, u8> = unsafe { std::mem::transmute(undef_unsafe_dst) }; | ||
| let half_kernel = (kernel_size / 2) as i32; | ||
|
|
||
| let zeros = unsafe { _mm_setzero_ps() }; | ||
| let total_length = width as usize * CHANNEL_CONFIGURATION; | ||
| for y in start_y..end_y { | ||
| let y_dst_shift = y as usize * dst_stride as usize; | ||
|
|
||
| let mut cx = 0usize; | ||
|
|
||
| unsafe { | ||
|
|
||
| while cx + 24 < total_length { | ||
| let mut store0 = zeros; | ||
| let mut store1 = zeros; | ||
| let mut store2 = zeros; | ||
| let mut store3 = zeros; | ||
| let mut store4 = zeros; | ||
| let mut store5 = zeros; | ||
|
|
||
| let mut r = -half_kernel; | ||
| while r <= half_kernel { | ||
| let weight = *kernel.get_unchecked((r + half_kernel) as usize); | ||
| let f_weight = _mm_set1_ps(weight); | ||
|
|
||
| let py = | ||
| std::cmp::min(std::cmp::max(y as i64 + r as i64, 0), (height - 1) as i64); | ||
| let y_src_shift = py as usize * src_stride as usize; | ||
| let s_ptr = src.as_ptr().add(y_src_shift + cx); | ||
| let px_0 = _mm_loadu_ps(s_ptr); | ||
| let px_1 = _mm_loadu_ps(s_ptr.add(4)); | ||
| let px_2 = _mm_loadu_ps(s_ptr.add(8)); | ||
| let px_3 = _mm_loadu_ps(s_ptr.add(12)); | ||
| let px_4 = _mm_loadu_ps(s_ptr.add(16)); | ||
| let px_5 = _mm_loadu_ps(s_ptr.add(20)); | ||
| store0 = _mm_prefer_fma_ps(store0, px_0, f_weight); | ||
| store1 = _mm_prefer_fma_ps(store1, px_1, f_weight); | ||
| store2 = _mm_prefer_fma_ps(store2, px_2, f_weight); | ||
| store3 = _mm_prefer_fma_ps(store2, px_3, f_weight); | ||
| store4 = _mm_prefer_fma_ps(store4, px_4, f_weight); | ||
| store5 = _mm_prefer_fma_ps(store5, px_5, f_weight); | ||
|
|
||
| r += 1; | ||
| } | ||
|
|
||
| let dst_ptr = (unsafe_dst.slice.as_ptr() as *mut f32).add(y_dst_shift + cx); | ||
| _mm_storeu_ps(dst_ptr, store0); | ||
| _mm_storeu_ps(dst_ptr.add(4), store1); | ||
| _mm_storeu_ps(dst_ptr.add(8), store2); | ||
| _mm_storeu_ps(dst_ptr.add(12), store3); | ||
| _mm_storeu_ps(dst_ptr.add(16), store4); | ||
| _mm_storeu_ps(dst_ptr.add(20), store5); | ||
|
|
||
| cx += 24; | ||
| } | ||
|
|
||
| while cx + 16 < total_length { | ||
| let mut store0 = zeros; | ||
| let mut store1 = zeros; | ||
| let mut store2 = zeros; | ||
| let mut store3 = zeros; | ||
|
|
||
| let mut r = -half_kernel; | ||
| while r <= half_kernel { | ||
| let weight = *kernel.get_unchecked((r + half_kernel) as usize); | ||
| let f_weight = _mm_set1_ps(weight); | ||
|
|
||
| let py = | ||
| std::cmp::min(std::cmp::max(y as i64 + r as i64, 0), (height - 1) as i64); | ||
| let y_src_shift = py as usize * src_stride as usize; | ||
| let s_ptr = src.as_ptr().add(y_src_shift + cx); | ||
| let px_0 = _mm_loadu_ps(s_ptr); | ||
| let px_1 = _mm_loadu_ps(s_ptr.add(4)); | ||
| let px_2 = _mm_loadu_ps(s_ptr.add(8)); | ||
| let px_3 = _mm_loadu_ps(s_ptr.add(12)); | ||
| store0 = _mm_prefer_fma_ps(store0, px_0, f_weight); | ||
| store1 = _mm_prefer_fma_ps(store1, px_1, f_weight); | ||
| store2 = _mm_prefer_fma_ps(store2, px_2, f_weight); | ||
| store3 = _mm_prefer_fma_ps(store2, px_3, f_weight); | ||
|
|
||
| r += 1; | ||
| } | ||
|
|
||
| let dst_ptr = (unsafe_dst.slice.as_ptr() as *mut f32).add(y_dst_shift + cx); | ||
| _mm_storeu_ps(dst_ptr, store0); | ||
| _mm_storeu_ps(dst_ptr.add(4), store1); | ||
| _mm_storeu_ps(dst_ptr.add(8), store2); | ||
| _mm_storeu_ps(dst_ptr.add(12), store3); | ||
|
|
||
| cx += 16; | ||
| } | ||
|
|
||
| while cx + 8 < total_length { | ||
| let mut store0 = zeros; | ||
| let mut store1 = zeros; | ||
|
|
||
| let mut r = -half_kernel; | ||
| while r <= half_kernel { | ||
| let weight = *kernel.get_unchecked((r + half_kernel) as usize); | ||
| let f_weight = _mm_set1_ps(weight); | ||
|
|
||
| let py = | ||
| std::cmp::min(std::cmp::max(y as i64 + r as i64, 0), (height - 1) as i64); | ||
| let y_src_shift = py as usize * src_stride as usize; | ||
| let s_ptr = src.as_ptr().add(y_src_shift + cx); | ||
| let px_0 = _mm_loadu_ps(s_ptr); | ||
| let px_1 = _mm_loadu_ps(s_ptr.add(4)); | ||
| store0 = _mm_prefer_fma_ps(store0, px_0, f_weight); | ||
| store1 = _mm_prefer_fma_ps(store1, px_1, f_weight); | ||
| r += 1; | ||
| } | ||
|
|
||
| let dst_ptr = (unsafe_dst.slice.as_ptr() as *mut f32).add(y_dst_shift + cx); | ||
| _mm_storeu_ps(dst_ptr, store0); | ||
| _mm_storeu_ps(dst_ptr.add(4), store1); | ||
|
|
||
| cx += 8; | ||
| } | ||
|
|
||
| while cx + 4 < total_length { | ||
| let mut store0 = zeros; | ||
|
|
||
| let mut r = -half_kernel; | ||
| while r <= half_kernel { | ||
| let weight = *kernel.get_unchecked((r + half_kernel) as usize); | ||
| let f_weight = _mm_set1_ps(weight); | ||
|
|
||
| let py = | ||
| std::cmp::min(std::cmp::max(y as i64 + r as i64, 0), (height - 1) as i64); | ||
| let y_src_shift = py as usize * src_stride as usize; | ||
| let s_ptr = src.as_ptr().add(y_src_shift + cx); | ||
| let lo_lo = _mm_loadu_ps(s_ptr); | ||
| store0 = _mm_prefer_fma_ps(store0, lo_lo, f_weight); | ||
|
|
||
| r += 1; | ||
| } | ||
|
|
||
| let dst_ptr = (unsafe_dst.slice.as_ptr() as *mut f32).add(y_dst_shift + cx); | ||
| _mm_storeu_ps(dst_ptr, store0); | ||
|
|
||
| cx += 4; | ||
| } | ||
|
|
||
| while cx < total_length { | ||
| let mut store0 = zeros; | ||
|
|
||
| let mut r = -half_kernel; | ||
| while r <= half_kernel { | ||
| let weight = *kernel.get_unchecked((r + half_kernel) as usize); | ||
| let f_weight = _mm_set1_ps(weight); | ||
|
|
||
| let py = | ||
| std::cmp::min(std::cmp::max(y as i64 + r as i64, 0), (height - 1) as i64); | ||
| let y_src_shift = py as usize * src_stride as usize; | ||
| let s_ptr = src.as_ptr().add(y_src_shift + cx); | ||
| let f_pixel = _mm_setr_ps(s_ptr.read_unaligned(), 0., 0., 0.); | ||
| store0 = _mm_prefer_fma_ps(store0, f_pixel, f_weight); | ||
|
|
||
| r += 1; | ||
| } | ||
|
|
||
| let dst_ptr = (unsafe_dst.slice.as_ptr() as *mut f32).add(y_dst_shift + cx); | ||
|
|
||
| let pixel = _mm_extract_ps::<0>(store0); | ||
| (dst_ptr as * mut i32).write_unaligned(pixel); | ||
|
|
||
| cx += 1; | ||
| } | ||
| } | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters