mirror of
https://chromium.googlesource.com/libyuv/libyuv
synced 2026-10-28 18:07:12 +08:00
Implement SIMD 16-bit plane rotation (TransposePlane_16, RotatePlane90_16, RotatePlane180_16, RotatePlane270_16) used by I010Rotate, I210Rotate, and I410Rotate, keeping tile sizes compact with full-register writes and zero cross-lane shuffles: - AVX2: 8x16 tile in ymm0..ymm15 with _Any tail (low-end x86 SIMD) - AVX-512BW: 8x32 tile in zmm0..zmm15 with k1/k2 right/bottom masks - NEON (ARM64/ARM32): 8x16 tile in v0..v23 / q0..q11 with _Any tail - SME: 8xVL tile using ZA16 horizontal/vertical array slices - RVV: 8xVL tile using widening unpacks with hardware vl tail - WASM SIMD: 8x8 tile in v128 with _Any tail Also update 32-bit ARGBRotate x86 transposes to compact vertical in-lane tiles with full-register writes and zero cross-lane shuffles: - TransposeWxH_32_AVX2: 4x8 tile in ymm0..ymm7 with vpmaskmovd tails - TransposeWxH_32_AVX512BW: 4x16 tile in zmm0..zmm7 with k1/k2 tails Add RotatePlane16_SplitMergeUV_Opt and RotatePlane16_SplitMergeUV_Odd unit tests comparing 16-bit rotation against SplitUVPlane + RotatePlane + MergeUVPlane across 0/90/180/270 degrees. Performance on 1275x1650 (1000 iterations, before -> after): CPU 90 degree 180 degree Coral RVV (Verilator) 7306 -> 1415c (5.16x) 2274 -> 719c (3.16x) AMD Rome (Zen 2) 821 -> 215ms (3.82x) 259 -> 181ms (1.44x) AMD Genoa (Zen 4) 483 -> 129ms (3.73x) 149 -> 111ms (1.34x) AMD Turin (Zen 5) 321 -> 101ms (3.18x) 109 -> 78ms (1.40x) AMD Milan (Zen 3) 505 -> 189ms (2.67x) 199 -> 118ms (1.69x) Intel Skylake-X 1076 -> 447ms (2.41x) 353 -> 317ms (1.11x) WASM SIMD (d8) 415 -> 203ms (2.04x) 370 -> 106ms (3.49x) Intel Emerald Rapids 735 -> 422ms (1.74x) 238 -> 233ms (1.02x) Intel Haswell 1120 -> 648ms (1.73x) 438 -> 393ms (1.11x) Intel Ice Lake 774 -> 474ms (1.63x) 279 -> 290ms (0.96x) ARM Neoverse-N1 864 -> 544ms (1.59x) 404 -> 266ms (1.52x) Ampere Siryn 862 -> 576ms (1.50x) 568 -> 329ms (1.72x) Google Axion (Maple) 554 -> 379ms (1.46x) 199 -> 142ms (1.41x) Intel Sapphire Rapids 1126 -> 772ms (1.46x) 301 -> 288ms (1.04x) Intel Granite Rapids 730 -> 565ms (1.29x) 280 -> 280ms (1.00x) NVIDIA Grace 462 -> 365ms (1.26x) 192 -> 126ms (1.52x) ARM Cortex-A53 28290 -> 24386ms (1.16x) 7178 -> 5075ms (1.41x) Google Axion 2 (Tamar) 523 -> 453ms (1.15x) 217 -> 112ms (1.93x) Test: libyuv_unittest --gtest_filter=*Rotate* Bug: b/42280942 Change-Id: I91ba6cac22185b5d294fcb98344fdb8a23cc94ff Reviewed-on: https://chromium-review.googlesource.com/c/libyuv/libyuv/+/8545294 Reviewed-by: richard winterton <rrwinterton@gmail.com> Commit-Queue: Frank Barchard <fbarchard@google.com>
314 lines
11 KiB
C++
314 lines
11 KiB
C++
/*
|
|
* Copyright 2024 The LibYuv 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 in the root of the source
|
|
* tree. An additional intellectual property rights grant can be found
|
|
* in the file PATENTS. All contributing project authors may
|
|
* be found in the AUTHORS file in the root of the source tree.
|
|
*/
|
|
|
|
#include "libyuv/rotate_row.h"
|
|
#include "libyuv/row.h"
|
|
|
|
#ifdef __cplusplus
|
|
namespace libyuv {
|
|
extern "C" {
|
|
#endif
|
|
|
|
// Note: every register written by an inline asm block (vector, general
|
|
// purpose, mask/predicate, "cc" for flags and "memory" for stores) must be
|
|
// listed in its clobber list, even when the ABI treats it as caller-saved.
|
|
// With LTO/LTCG the compiler may keep values live in any register across the
|
|
// asm statement, and other OS ABIs (e.g. Windows) differ in which registers
|
|
// are callee-saved. List "memory" first, then "cc", then registers.
|
|
|
|
#if !defined(LIBYUV_DISABLE_SME) && defined(CLANG_HAS_SME) && \
|
|
defined(__aarch64__)
|
|
|
|
__arm_locally_streaming __arm_new("za") void TransposeWxH_SME(
|
|
const uint8_t* src,
|
|
int src_stride,
|
|
uint8_t* dst,
|
|
int dst_stride,
|
|
int width,
|
|
int height) {
|
|
int vl;
|
|
asm("cntb %x0" : "=r"(vl));
|
|
|
|
do {
|
|
const uint8_t* src2 = src;
|
|
uint8_t* dst2 = dst;
|
|
|
|
// Process up to VL elements per iteration of the inner loop.
|
|
int block_height = height > vl ? vl : height;
|
|
|
|
int width2 = width;
|
|
do {
|
|
const uint8_t* src3 = src2;
|
|
|
|
// Process up to VL elements per iteration of the inner loop.
|
|
int block_width = width2 > vl ? vl : width2;
|
|
|
|
asm volatile(
|
|
"mov w12, #0 \n"
|
|
|
|
// Create a predicate to handle loading partial rows.
|
|
"whilelt p0.b, wzr, %w[block_width] \n"
|
|
|
|
// Load H <= VL rows into ZA0.
|
|
"1: \n"
|
|
"ld1b {za0h.b[w12, 0]}, p0/z, [%[src3]] \n"
|
|
"add %[src3], %[src3], %[src_stride] \n"
|
|
"add w12, w12, #1 \n"
|
|
"cmp w12, %w[block_height] \n"
|
|
"b.ne 1b \n"
|
|
|
|
// Create a predicate to handle storing partial columns.
|
|
"whilelt p0.b, wzr, %w[block_height] \n"
|
|
"mov w12, #0 \n"
|
|
|
|
// Store W <= VL columns from ZA0.
|
|
"2: \n"
|
|
"st1b {za0v.b[w12, 0]}, p0, [%[dst2]] \n"
|
|
"add %[dst2], %[dst2], %[dst_stride] \n"
|
|
"add w12, w12, #1 \n"
|
|
"cmp w12, %w[block_width] \n"
|
|
"b.ne 2b \n"
|
|
: [src3] "+r"(src3), // %[src3]
|
|
[dst2] "+r"(dst2) // %[dst2]
|
|
: [src_stride] "r"((ptrdiff_t)src_stride), // %[src_stride]
|
|
[dst_stride] "r"((ptrdiff_t)dst_stride), // %[dst_stride]
|
|
[block_width] "r"(block_width), // %[block_width]
|
|
[block_height] "r"(block_height) // %[block_height]
|
|
: "cc", "memory", "p0", "w12", "za");
|
|
|
|
src2 += vl;
|
|
width2 -= vl;
|
|
} while (width2 > 0);
|
|
|
|
src += vl * src_stride;
|
|
dst += vl;
|
|
height -= vl;
|
|
} while (height > 0);
|
|
}
|
|
|
|
__arm_locally_streaming __arm_new("za") void TransposeUVWxH_SME(
|
|
const uint8_t* src,
|
|
int src_stride,
|
|
uint8_t* dst_a,
|
|
int dst_stride_a,
|
|
uint8_t* dst_b,
|
|
int dst_stride_b,
|
|
int width,
|
|
int height) {
|
|
int vl;
|
|
asm("cnth %x0" : "=r"(vl));
|
|
|
|
do {
|
|
const uint8_t* src2 = src;
|
|
uint8_t* dst2_a = dst_a;
|
|
uint8_t* dst2_b = dst_b;
|
|
|
|
// Process up to VL bytes per iteration of the inner loop.
|
|
int block_height = height > vl * 2 ? vl * 2 : height;
|
|
|
|
int width2 = width;
|
|
do {
|
|
const uint8_t* src3 = src2;
|
|
|
|
// Process up to VL 16-bit elements per iteration of the inner loop.
|
|
int block_width = width2 > vl ? vl : width2;
|
|
|
|
asm volatile(
|
|
"mov w12, #0 \n"
|
|
|
|
// Create a predicate to handle loading partial rows,
|
|
// %[block_width] is always a multiple of two here.
|
|
"whilelt p0.b, wzr, %w[block_width] \n"
|
|
|
|
// Load H <= VL rows into ZA0, such that U/V components exist in
|
|
// alternating columns.
|
|
"1: \n"
|
|
"ld1b {za0h.b[w12, 0]}, p0/z, [%[src]] \n"
|
|
"add %[src], %[src], %[src_stride] \n"
|
|
"add w12, w12, #1 \n"
|
|
"cmp w12, %w[block_height] \n"
|
|
"b.ne 1b \n"
|
|
|
|
// Create a predicate to handle storing partial columns.
|
|
"whilelt p0.b, wzr, %w[block_height] \n"
|
|
"mov w12, #0 \n"
|
|
|
|
// Store alternating UV data from pairs of ZA0 columns.
|
|
"2: \n"
|
|
"st1b {za0v.b[w12, 0]}, p0, [%[dst_a]] \n"
|
|
"st1b {za0v.b[w12, 1]}, p0, [%[dst_b]] \n"
|
|
"add %[dst_a], %[dst_a], %[dst_stride_a] \n"
|
|
"add %[dst_b], %[dst_b], %[dst_stride_b] \n"
|
|
"add w12, w12, #2 \n"
|
|
"cmp w12, %w[block_width] \n"
|
|
"b.ne 2b \n"
|
|
: [src] "+r"(src3), // %[src]
|
|
[dst_a] "+r"(dst2_a), // %[dst_a]
|
|
[dst_b] "+r"(dst2_b) // %[dst_b]
|
|
: [src_stride] "r"((ptrdiff_t)src_stride), // %[src_stride]
|
|
[dst_stride_a] "r"((ptrdiff_t)dst_stride_a), // %[dst_stride_a]
|
|
[dst_stride_b] "r"((ptrdiff_t)dst_stride_b), // %[dst_stride_b]
|
|
[block_width] "r"(block_width * 2), // %[block_width]
|
|
[block_height] "r"(block_height) // %[block_height]
|
|
: "cc", "memory", "p0", "w12", "za");
|
|
|
|
src2 += 2 * vl;
|
|
width2 -= vl;
|
|
} while (width2 > 0);
|
|
|
|
src += 2 * vl * src_stride;
|
|
dst_a += 2 * vl;
|
|
dst_b += 2 * vl;
|
|
height -= 2 * vl;
|
|
} while (height > 0);
|
|
}
|
|
|
|
__arm_locally_streaming __arm_new("za") void TransposeWxH_32_SME(
|
|
const uint8_t* src,
|
|
int src_stride,
|
|
uint8_t* dst,
|
|
int dst_stride,
|
|
int width,
|
|
int height) {
|
|
int vl;
|
|
asm("cntw %x0" : "=r"(vl));
|
|
|
|
do {
|
|
const uint8_t* src2 = src;
|
|
uint8_t* dst2 = dst;
|
|
|
|
// Process up to VL 32-bit rows per iteration of the outer loop.
|
|
int block_height = height > vl ? vl : height;
|
|
|
|
int width2 = width;
|
|
do {
|
|
const uint8_t* src3 = src2;
|
|
|
|
// Process up to VL 32-bit columns per iteration of the inner loop.
|
|
int block_width = width2 > vl ? vl : width2;
|
|
|
|
asm volatile(
|
|
"mov w12, #0 \n"
|
|
|
|
// Create a predicate to handle loading partial rows.
|
|
"whilelt p0.s, wzr, %w[block_width] \n"
|
|
|
|
// Load H <= VL rows into ZA0.S.
|
|
"1: \n"
|
|
"ld1w {za0h.s[w12, 0]}, p0/z, [%[src3]] \n"
|
|
"add %[src3], %[src3], %[src_stride] \n"
|
|
"add w12, w12, #1 \n"
|
|
"cmp w12, %w[block_height] \n"
|
|
"b.ne 1b \n"
|
|
|
|
// Create a predicate to handle storing partial columns.
|
|
"whilelt p0.s, wzr, %w[block_height] \n"
|
|
"mov w12, #0 \n"
|
|
|
|
// Store W <= VL columns from ZA0.S.
|
|
"2: \n"
|
|
"st1w {za0v.s[w12, 0]}, p0, [%[dst2]] \n"
|
|
"add %[dst2], %[dst2], %[dst_stride] \n"
|
|
"add w12, w12, #1 \n"
|
|
"cmp w12, %w[block_width] \n"
|
|
"b.ne 2b \n"
|
|
: [src3] "+r"(src3), // %[src3]
|
|
[dst2] "+r"(dst2) // %[dst2]
|
|
: [src_stride] "r"((ptrdiff_t)src_stride), // %[src_stride]
|
|
[dst_stride] "r"((ptrdiff_t)dst_stride), // %[dst_stride]
|
|
[block_width] "r"(block_width), // %[block_width]
|
|
[block_height] "r"(block_height) // %[block_height]
|
|
: "cc", "memory", "p0", "w12", "za");
|
|
|
|
src2 += vl * 4;
|
|
width2 -= vl;
|
|
} while (width2 > 0);
|
|
|
|
src += (ptrdiff_t)vl * src_stride;
|
|
dst += vl * 4;
|
|
height -= vl;
|
|
} while (height > 0);
|
|
}
|
|
|
|
__arm_locally_streaming __arm_new("za") void TransposeWxH_16_SME(
|
|
const uint16_t* src,
|
|
int src_stride,
|
|
uint16_t* dst,
|
|
int dst_stride,
|
|
int width,
|
|
int height) {
|
|
int vl;
|
|
asm("cnth %x0" : "=r"(vl));
|
|
|
|
do {
|
|
const uint16_t* src2 = src;
|
|
uint16_t* dst2 = dst;
|
|
|
|
// Process up to VL 16-bit rows per iteration of the outer loop.
|
|
int block_height = height > vl ? vl : height;
|
|
|
|
int width2 = width;
|
|
do {
|
|
const uint16_t* src3 = src2;
|
|
|
|
// Process up to VL 16-bit columns per iteration of the inner loop.
|
|
int block_width = width2 > vl ? vl : width2;
|
|
|
|
asm volatile(
|
|
"mov w12, #0 \n"
|
|
|
|
// Create a predicate to handle loading partial rows.
|
|
"whilelt p0.h, wzr, %w[block_width] \n"
|
|
|
|
// Load H <= VL rows into ZA0.H.
|
|
"1: \n"
|
|
"ld1h {za0h.h[w12, 0]}, p0/z, [%[src3]] \n"
|
|
"add %[src3], %[src3], %[src_stride] \n"
|
|
"add w12, w12, #1 \n"
|
|
"cmp w12, %w[block_height] \n"
|
|
"b.ne 1b \n"
|
|
|
|
// Create a predicate to handle storing partial columns.
|
|
"whilelt p0.h, wzr, %w[block_height] \n"
|
|
"mov w12, #0 \n"
|
|
|
|
// Store W <= VL columns from ZA0.H.
|
|
"2: \n"
|
|
"st1h {za0v.h[w12, 0]}, p0, [%[dst2]] \n"
|
|
"add %[dst2], %[dst2], %[dst_stride] \n"
|
|
"add w12, w12, #1 \n"
|
|
"cmp w12, %w[block_width] \n"
|
|
"b.ne 2b \n"
|
|
: [src3] "+r"(src3), // %[src3]
|
|
[dst2] "+r"(dst2) // %[dst2]
|
|
: [src_stride] "r"((ptrdiff_t)src_stride * 2), // %[src_stride]
|
|
[dst_stride] "r"((ptrdiff_t)dst_stride * 2), // %[dst_stride]
|
|
[block_width] "r"(block_width), // %[block_width]
|
|
[block_height] "r"(block_height) // %[block_height]
|
|
: "memory", "cc", "w12", "p0", "za");
|
|
|
|
src2 += vl;
|
|
width2 -= vl;
|
|
} while (width2 > 0);
|
|
|
|
src += (ptrdiff_t)vl * src_stride;
|
|
dst += vl;
|
|
height -= vl;
|
|
} while (height > 0);
|
|
}
|
|
|
|
#endif // !defined(LIBYUV_DISABLE_SME) && defined(CLANG_HAS_SME) &&
|
|
// defined(__aarch64__)
|
|
|
|
#ifdef __cplusplus
|
|
} // extern "C"
|
|
} // namespace libyuv
|
|
#endif
|