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 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221
|
/* 14/11/24 kleisauke
* - from reducev_hwy.cpp
*/
/*
This file is part of VIPS.
VIPS is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
/*
These files are distributed with VIPS - http://www.vips.ecs.soton.ac.uk
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif /*HAVE_CONFIG_H*/
#include <glib/gi18n-lib.h>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <vips/vips.h>
#include <vips/vector.h>
#include <vips/debug.h>
#include <vips/internal.h>
#include "presample.h"
#ifdef HAVE_HWY
#undef HWY_TARGET_INCLUDE
#define HWY_TARGET_INCLUDE "libvips/resample/shrinkv_hwy.cpp"
#include <hwy/foreach_target.h>
#include <hwy/highway.h>
namespace HWY_NAMESPACE {
using namespace hwy::HWY_NAMESPACE;
using DU32 = ScalableTag<uint32_t>;
using DU16 = ScalableTag<uint16_t>;
constexpr Rebind<uint8_t, DU16> du8x16;
#if HWY_ARCH_RVV || (HWY_ARCH_ARM_A64 && HWY_TARGET <= HWY_SVE)
constexpr Rebind<uint8_t, DU32> du8x32;
#endif
constexpr DU16 du16;
constexpr DU32 du32;
constexpr int64_t max_uint32 = 1LL << 32;
constexpr int32_t max_bits = 1 << 8;
#if defined(HAVE_HWY_1_1_0) && \
(HWY_ARCH_RVV || (HWY_ARCH_ARM_A64 && HWY_TARGET <= HWY_SVE))
#define InterleaveLower InterleaveWholeLower
#define InterleaveUpper InterleaveWholeUpper
#endif
// Compat for Highway versions < 1.3.0
#ifndef HWY_LANES_CONSTEXPR
#define HWY_LANES_CONSTEXPR
#endif
HWY_ATTR void
vips_shrinkv_add_line_uchar_hwy(VipsPel *pin,
int32_t ne, uint32_t *HWY_RESTRICT sum)
{
#if HWY_TARGET != HWY_SCALAR
#if !defined(HAVE_HWY_1_1_0) && \
(HWY_ARCH_RVV || (HWY_ARCH_ARM_A64 && HWY_TARGET <= HWY_SVE))
/* Ensure we do not cross 128-bit block boundaries on RVV/SVE.
*/
const int32_t N = 8;
#else
HWY_LANES_CONSTEXPR int32_t N = Lanes(du16);
#endif
const auto zero = Zero(du16);
auto *HWY_RESTRICT p = (uint8_t *) pin;
/* Main sum loop: unrolled.
*/
int32_t x = 0;
for (; x + N <= ne; x += N) {
auto pix0 = PromoteTo(du16, LoadU(du8x16, p + x));
auto sum0 = LoadU(du32, &sum[x + 0 * N / 2]);
auto sum1 = LoadU(du32, &sum[x + 1 * N / 2]);
sum0 = Add(sum0, BitCast(du32, InterleaveLower(du16, pix0, zero)));
sum1 = Add(sum1, BitCast(du32, InterleaveUpper(du16, pix0, zero)));
StoreU(sum0, du32, &sum[x + 0 * N / 2]);
StoreU(sum1, du32, &sum[x + 1 * N / 2]);
}
/* `ne` was not a multiple of the vector length `N`;
* proceed one by one.
*/
for (; x < ne; ++x)
sum[x] += p[x];
#endif
}
HWY_ATTR void
vips_shrinkv_write_line_uchar_hwy(VipsPel *pout,
int32_t ne, int32_t vshrink, uint32_t *HWY_RESTRICT sum)
{
#if HWY_TARGET != HWY_SCALAR
#if !defined(HAVE_HWY_1_1_0) && \
(HWY_ARCH_RVV || (HWY_ARCH_ARM_A64 && HWY_TARGET <= HWY_SVE))
/* Ensure we do not cross 128-bit block boundaries on RVV/SVE.
*/
const int32_t N = 8;
#else
HWY_LANES_CONSTEXPR int32_t N = Lanes(du16);
#endif
const uint32_t multiplier = max_uint32 / (max_bits * vshrink);
const uint32_t amend = vshrink / 2;
const auto multiplier_v = Set(du32, multiplier);
const auto amend_v = Set(du32, amend);
/* Main write loop: unrolled.
*/
int32_t x = 0;
for (; x + N <= ne; x += N) {
auto *HWY_RESTRICT q = (uint8_t *) pout + x;
auto sum0 = LoadU(du32, &sum[x + 0 * N / 2]);
auto sum1 = LoadU(du32, &sum[x + 1 * N / 2]);
sum0 = Add(sum0, amend_v);
sum1 = Add(sum1, amend_v);
sum0 = Mul(sum0, multiplier_v);
sum1 = Mul(sum1, multiplier_v);
/* The final 32->8 conversion.
*/
sum0 = ShiftRight<24>(sum0);
sum1 = ShiftRight<24>(sum1);
#if HWY_ARCH_RVV || (HWY_ARCH_ARM_A64 && HWY_TARGET <= HWY_SVE)
/* RVV/SVE defines demotion as writing to the upper or lower half
* of each lane, rather than compacting them within a vector.
*/
auto demoted0 = DemoteTo(du8x32, sum0);
auto demoted1 = DemoteTo(du8x32, sum1);
StoreU(demoted0, du8x32, q + 0 * N / 2);
StoreU(demoted1, du8x32, q + 1 * N / 2);
#else
auto demoted0 = ReorderDemote2To(du16, sum0, sum1);
auto demoted = DemoteTo(du8x16, demoted0);
StoreU(demoted, du8x16, q);
#endif
}
/* `ne` was not a multiple of the vector length `N`;
* proceed one by one.
*/
for (; x < ne; ++x) {
auto *HWY_RESTRICT q = (uint8_t *) pout + x;
*q = ((sum[x] + amend) * multiplier) >> 24;
}
#endif
}
#undef InterleaveLower
#undef InterleaveUpper
} /*namespace HWY_NAMESPACE*/
#if HWY_ONCE
HWY_EXPORT(vips_shrinkv_add_line_uchar_hwy);
HWY_EXPORT(vips_shrinkv_write_line_uchar_hwy);
void
vips_shrinkv_add_line_uchar_hwy(VipsPel *pin,
int ne, unsigned int *restrict sum)
{
/* clang-format off */
HWY_DYNAMIC_DISPATCH(vips_shrinkv_add_line_uchar_hwy)(pin,
ne, sum);
/* clang-format on */
}
void
vips_shrinkv_write_line_uchar_hwy(VipsPel *pout,
int ne, int vshrink, unsigned int *restrict sum)
{
/* clang-format off */
HWY_DYNAMIC_DISPATCH(vips_shrinkv_write_line_uchar_hwy)(pout,
ne, vshrink, sum);
/* clang-format on */
}
#endif /*HWY_ONCE*/
#endif /*HAVE_HWY*/
|