mirror of https://github.com/xemu-project/xemu.git
util/bufferiszero: Add simd acceleration for aarch64
Because non-embedded aarch64 is expected to have AdvSIMD enabled, merely double-check with the compiler flags for __ARM_NEON and don't bother with a runtime check. Otherwise, model the loop after the x86 SSE2 function. Use UMAXV for the vector reduction. This is 3 cycles on cortex-a76 and 2 cycles on neoverse-n1. Reviewed-by: Philippe Mathieu-Daudé <philmd@linaro.org> Signed-off-by: Richard Henderson <richard.henderson@linaro.org>
This commit is contained in:
parent
bf67aa3dd2
commit
22437b4de9
|
@ -198,6 +198,73 @@ static unsigned best_accel(void)
|
||||||
return info & CPUINFO_SSE2 ? 1 : 0;
|
return info & CPUINFO_SSE2 ? 1 : 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#elif defined(__aarch64__) && defined(__ARM_NEON)
|
||||||
|
#include <arm_neon.h>
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Helper for preventing the compiler from reassociating
|
||||||
|
* chains of binary vector operations.
|
||||||
|
*/
|
||||||
|
#define REASSOC_BARRIER(vec0, vec1) asm("" : "+w"(vec0), "+w"(vec1))
|
||||||
|
|
||||||
|
static bool buffer_is_zero_simd(const void *buf, size_t len)
|
||||||
|
{
|
||||||
|
uint32x4_t t0, t1, t2, t3;
|
||||||
|
|
||||||
|
/* Align head/tail to 16-byte boundaries. */
|
||||||
|
const uint32x4_t *p = QEMU_ALIGN_PTR_DOWN(buf + 16, 16);
|
||||||
|
const uint32x4_t *e = QEMU_ALIGN_PTR_DOWN(buf + len - 1, 16);
|
||||||
|
|
||||||
|
/* Unaligned loads at head/tail. */
|
||||||
|
t0 = vld1q_u32(buf) | vld1q_u32(buf + len - 16);
|
||||||
|
|
||||||
|
/* Collect a partial block at tail end. */
|
||||||
|
t1 = e[-7] | e[-6];
|
||||||
|
t2 = e[-5] | e[-4];
|
||||||
|
t3 = e[-3] | e[-2];
|
||||||
|
t0 |= e[-1];
|
||||||
|
REASSOC_BARRIER(t0, t1);
|
||||||
|
REASSOC_BARRIER(t2, t3);
|
||||||
|
t0 |= t1;
|
||||||
|
t2 |= t3;
|
||||||
|
REASSOC_BARRIER(t0, t2);
|
||||||
|
t0 |= t2;
|
||||||
|
|
||||||
|
/*
|
||||||
|
* Loop over complete 128-byte blocks.
|
||||||
|
* With the head and tail removed, e - p >= 14, so the loop
|
||||||
|
* must iterate at least once.
|
||||||
|
*/
|
||||||
|
do {
|
||||||
|
/*
|
||||||
|
* Reduce via UMAXV. Whatever the actual result,
|
||||||
|
* it will only be zero if all input bytes are zero.
|
||||||
|
*/
|
||||||
|
if (unlikely(vmaxvq_u32(t0) != 0)) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
t0 = p[0] | p[1];
|
||||||
|
t1 = p[2] | p[3];
|
||||||
|
t2 = p[4] | p[5];
|
||||||
|
t3 = p[6] | p[7];
|
||||||
|
REASSOC_BARRIER(t0, t1);
|
||||||
|
REASSOC_BARRIER(t2, t3);
|
||||||
|
t0 |= t1;
|
||||||
|
t2 |= t3;
|
||||||
|
REASSOC_BARRIER(t0, t2);
|
||||||
|
t0 |= t2;
|
||||||
|
p += 8;
|
||||||
|
} while (p < e - 7);
|
||||||
|
|
||||||
|
return vmaxvq_u32(t0) == 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
#define best_accel() 1
|
||||||
|
static biz_accel_fn const accel_table[] = {
|
||||||
|
buffer_is_zero_int_ge256,
|
||||||
|
buffer_is_zero_simd,
|
||||||
|
};
|
||||||
#else
|
#else
|
||||||
#define best_accel() 0
|
#define best_accel() 0
|
||||||
static biz_accel_fn const accel_table[1] = {
|
static biz_accel_fn const accel_table[1] = {
|
||||||
|
|
Loading…
Reference in New Issue