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) the JPEG XL Project Authors. All rights reserved.
//
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
#if defined(LIB_JXL_CONVOLVE_INL_H_) == defined(HWY_TARGET_TOGGLE)
#ifdef LIB_JXL_CONVOLVE_INL_H_
#undef LIB_JXL_CONVOLVE_INL_H_
#else
#define LIB_JXL_CONVOLVE_INL_H_
#endif
#include <hwy/highway.h>
#include "lib/jxl/base/status.h"
HWY_BEFORE_NAMESPACE();
namespace jxl {
namespace HWY_NAMESPACE {
namespace {
// These templates are not found via ADL.
using hwy::HWY_NAMESPACE::Broadcast;
#if HWY_TARGET != HWY_SCALAR
using hwy::HWY_NAMESPACE::CombineShiftRightBytes;
#endif
using hwy::HWY_NAMESPACE::Vec;
// Synthesizes left/right neighbors from a vector of center pixels.
class Neighbors {
public:
using D = HWY_CAPPED(float, 16);
using V = Vec<D>;
// Returns l[i] == c[Mirror(i - 1)].
HWY_INLINE HWY_MAYBE_UNUSED static V FirstL1(const V c) {
#if HWY_CAP_GE256
const D d;
HWY_ALIGN constexpr int32_t lanes[16] = {0, 0, 1, 2, 3, 4, 5, 6,
7, 8, 9, 10, 11, 12, 13, 14};
const auto indices = SetTableIndices(d, lanes);
// c = PONM'LKJI
return TableLookupLanes(c, indices); // ONML'KJII
#elif HWY_TARGET == HWY_SCALAR
return c; // Same (the first mirrored value is the last valid one)
#else // 128 bit
// c = LKJI
#if HWY_TARGET <= (1 << HWY_HIGHEST_TARGET_BIT_X86)
return V{_mm_shuffle_ps(c.raw, c.raw, _MM_SHUFFLE(2, 1, 0, 0))}; // KJII
#else
const D d;
// TODO(deymo): Figure out if this can be optimized using a single vsri
// instruction to convert LKJI to KJII.
HWY_ALIGN constexpr int lanes[4] = {0, 0, 1, 2}; // KJII
const auto indices = SetTableIndices(d, lanes);
return TableLookupLanes(c, indices);
#endif
#endif
}
// Returns l[i] == c[Mirror(i - 2)].
HWY_INLINE HWY_MAYBE_UNUSED static V FirstL2(const V c) {
#if HWY_CAP_GE256
const D d;
HWY_ALIGN constexpr int32_t lanes[16] = {1, 0, 0, 1, 2, 3, 4, 5,
6, 7, 8, 9, 10, 11, 12, 13};
const auto indices = SetTableIndices(d, lanes);
// c = PONM'LKJI
return TableLookupLanes(c, indices); // NMLK'JIIJ
#elif HWY_TARGET == HWY_SCALAR
const D d;
JXL_ASSERT(false); // unsupported, avoid calling this.
return Zero(d);
#else // 128 bit
// c = LKJI
#if HWY_TARGET <= (1 << HWY_HIGHEST_TARGET_BIT_X86)
return V{_mm_shuffle_ps(c.raw, c.raw, _MM_SHUFFLE(1, 0, 0, 1))}; // JIIJ
#else
const D d;
HWY_ALIGN constexpr int lanes[4] = {1, 0, 0, 1}; // JIIJ
const auto indices = SetTableIndices(d, lanes);
return TableLookupLanes(c, indices);
#endif
#endif
}
// Returns l[i] == c[Mirror(i - 3)].
HWY_INLINE HWY_MAYBE_UNUSED static V FirstL3(const V c) {
#if HWY_CAP_GE256
const D d;
HWY_ALIGN constexpr int32_t lanes[16] = {2, 1, 0, 0, 1, 2, 3, 4,
5, 6, 7, 8, 9, 10, 11, 12};
const auto indices = SetTableIndices(d, lanes);
// c = PONM'LKJI
return TableLookupLanes(c, indices); // MLKJ'IIJK
#elif HWY_TARGET == HWY_SCALAR
const D d;
JXL_ASSERT(false); // unsupported, avoid calling this.
return Zero(d);
#else // 128 bit
// c = LKJI
#if HWY_TARGET <= (1 << HWY_HIGHEST_TARGET_BIT_X86)
return V{_mm_shuffle_ps(c.raw, c.raw, _MM_SHUFFLE(0, 0, 1, 2))}; // IIJK
#else
const D d;
HWY_ALIGN constexpr int lanes[4] = {2, 1, 0, 0}; // IIJK
const auto indices = SetTableIndices(d, lanes);
return TableLookupLanes(c, indices);
#endif
#endif
}
};
} // namespace
// NOLINTNEXTLINE(google-readability-namespace-comments)
} // namespace HWY_NAMESPACE
} // namespace jxl
HWY_AFTER_NAMESPACE();
#endif // LIB_JXL_CONVOLVE_INL_H_
|
