/src/Simd/src/Simd/SimdAvx2GrayToBgr.cpp
Line | Count | Source |
1 | | /* |
2 | | * Simd Library (http://ermig1979.github.io/Simd). |
3 | | * |
4 | | * Copyright (c) 2011-2017 Yermalayeu Ihar. |
5 | | * |
6 | | * Permission is hereby granted, free of charge, to any person obtaining a copy |
7 | | * of this software and associated documentation files (the "Software"), to deal |
8 | | * in the Software without restriction, including without limitation the rights |
9 | | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
10 | | * copies of the Software, and to permit persons to whom the Software is |
11 | | * furnished to do so, subject to the following conditions: |
12 | | * |
13 | | * The above copyright notice and this permission notice shall be included in |
14 | | * all copies or substantial portions of the Software. |
15 | | * |
16 | | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
17 | | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
18 | | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
19 | | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
20 | | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
21 | | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
22 | | * SOFTWARE. |
23 | | */ |
24 | | #include "Simd/SimdStore.h" |
25 | | #include "Simd/SimdMemory.h" |
26 | | #include "Simd/SimdConversion.h" |
27 | | |
28 | | namespace Simd |
29 | | { |
30 | | #ifdef SIMD_AVX2_ENABLE |
31 | | namespace Avx2 |
32 | | { |
33 | | template <bool align> SIMD_INLINE void GrayToBgr(uint8_t * bgr, __m256i gray) |
34 | 25.2k | { |
35 | 25.2k | Store<align>((__m256i*)bgr + 0, GrayToBgr<0>(gray)); |
36 | 25.2k | Store<align>((__m256i*)bgr + 1, GrayToBgr<1>(gray)); |
37 | 25.2k | Store<align>((__m256i*)bgr + 2, GrayToBgr<2>(gray)); |
38 | 25.2k | } void Simd::Avx2::GrayToBgr<true>(unsigned char*, long long __vector(4)) Line | Count | Source | 34 | 4.26k | { | 35 | 4.26k | Store<align>((__m256i*)bgr + 0, GrayToBgr<0>(gray)); | 36 | 4.26k | Store<align>((__m256i*)bgr + 1, GrayToBgr<1>(gray)); | 37 | 4.26k | Store<align>((__m256i*)bgr + 2, GrayToBgr<2>(gray)); | 38 | 4.26k | } |
void Simd::Avx2::GrayToBgr<false>(unsigned char*, long long __vector(4)) Line | Count | Source | 34 | 20.9k | { | 35 | 20.9k | Store<align>((__m256i*)bgr + 0, GrayToBgr<0>(gray)); | 36 | 20.9k | Store<align>((__m256i*)bgr + 1, GrayToBgr<1>(gray)); | 37 | 20.9k | Store<align>((__m256i*)bgr + 2, GrayToBgr<2>(gray)); | 38 | 20.9k | } |
|
39 | | |
40 | | template <bool align> void GrayToBgr(const uint8_t * gray, size_t width, size_t height, size_t grayStride, uint8_t *bgr, size_t bgrStride) |
41 | 1.02k | { |
42 | 1.02k | assert(width >= A); |
43 | 1.02k | if (align) |
44 | 1.02k | assert(Aligned(bgr) && Aligned(bgrStride) && Aligned(gray) && Aligned(grayStride)); |
45 | | |
46 | 1.02k | size_t alignedWidth = AlignLo(width, A); |
47 | 4.72k | for (size_t row = 0; row < height; ++row) |
48 | 3.70k | { |
49 | 27.7k | for (size_t col = 0; col < alignedWidth; col += A) |
50 | 24.0k | { |
51 | 24.0k | __m256i _gray = Load<align>((__m256i*)(gray + col)); |
52 | 24.0k | GrayToBgr<align>(bgr + 3 * col, _gray); |
53 | 24.0k | } |
54 | 3.70k | if (alignedWidth != width) |
55 | 1.19k | { |
56 | 1.19k | __m256i _gray = Load<false>((__m256i*)(gray + width - A)); |
57 | 1.19k | GrayToBgr<false>(bgr + 3 * (width - A), _gray); |
58 | 1.19k | } |
59 | 3.70k | gray += grayStride; |
60 | 3.70k | bgr += bgrStride; |
61 | 3.70k | } |
62 | 1.02k | } void Simd::Avx2::GrayToBgr<true>(unsigned char const*, unsigned long, unsigned long, unsigned long, unsigned char*, unsigned long) Line | Count | Source | 41 | 54 | { | 42 | 54 | assert(width >= A); | 43 | 54 | if (align) | 44 | 54 | assert(Aligned(bgr) && Aligned(bgrStride) && Aligned(gray) && Aligned(grayStride)); | 45 | | | 46 | 54 | size_t alignedWidth = AlignLo(width, A); | 47 | 400 | for (size_t row = 0; row < height; ++row) | 48 | 346 | { | 49 | 4.61k | for (size_t col = 0; col < alignedWidth; col += A) | 50 | 4.26k | { | 51 | 4.26k | __m256i _gray = Load<align>((__m256i*)(gray + col)); | 52 | 4.26k | GrayToBgr<align>(bgr + 3 * col, _gray); | 53 | 4.26k | } | 54 | 346 | if (alignedWidth != width) | 55 | 0 | { | 56 | 0 | __m256i _gray = Load<false>((__m256i*)(gray + width - A)); | 57 | 0 | GrayToBgr<false>(bgr + 3 * (width - A), _gray); | 58 | 0 | } | 59 | 346 | gray += grayStride; | 60 | 346 | bgr += bgrStride; | 61 | 346 | } | 62 | 54 | } |
void Simd::Avx2::GrayToBgr<false>(unsigned char const*, unsigned long, unsigned long, unsigned long, unsigned char*, unsigned long) Line | Count | Source | 41 | 972 | { | 42 | 972 | assert(width >= A); | 43 | 972 | if (align) | 44 | 972 | assert(Aligned(bgr) && Aligned(bgrStride) && Aligned(gray) && Aligned(grayStride)); | 45 | | | 46 | 972 | size_t alignedWidth = AlignLo(width, A); | 47 | 4.32k | for (size_t row = 0; row < height; ++row) | 48 | 3.35k | { | 49 | 23.1k | for (size_t col = 0; col < alignedWidth; col += A) | 50 | 19.7k | { | 51 | 19.7k | __m256i _gray = Load<align>((__m256i*)(gray + col)); | 52 | 19.7k | GrayToBgr<align>(bgr + 3 * col, _gray); | 53 | 19.7k | } | 54 | 3.35k | if (alignedWidth != width) | 55 | 1.19k | { | 56 | 1.19k | __m256i _gray = Load<false>((__m256i*)(gray + width - A)); | 57 | 1.19k | GrayToBgr<false>(bgr + 3 * (width - A), _gray); | 58 | 1.19k | } | 59 | 3.35k | gray += grayStride; | 60 | 3.35k | bgr += bgrStride; | 61 | 3.35k | } | 62 | 972 | } |
|
63 | | |
64 | | void GrayToBgr(const uint8_t *gray, size_t width, size_t height, size_t grayStride, uint8_t *bgr, size_t bgrStride) |
65 | 1.02k | { |
66 | 1.02k | if (Aligned(bgr) && Aligned(gray) && Aligned(bgrStride) && Aligned(grayStride)) |
67 | 54 | GrayToBgr<true>(gray, width, height, grayStride, bgr, bgrStride); |
68 | 972 | else |
69 | 972 | GrayToBgr<false>(gray, width, height, grayStride, bgr, bgrStride); |
70 | 1.02k | } |
71 | | } |
72 | | #endif// SIMD_AVX2_ENABLE |
73 | | } |