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
|
/*
* LASX optimized hash slide, based on Intel AVX2 implementation
*
* Copyright (C) 2017 Intel Corporation
* Copyright (C) 2025 Vladislav Shchapov <vladislav@shchapov.ru>
* Authors:
* Arjan van de Ven <arjan@linux.intel.com>
* Jim Kukunas <james.t.kukunas@linux.intel.com>
* Mika T. Lindqvist <postmaster@raasu.org>
*
* For conditions of distribution and use, see copyright notice in zlib.h
*/
#ifdef LOONGARCH_LASX
#include "zbuild.h"
#include "deflate.h"
#include <lasxintrin.h>
static inline void slide_hash_chain(Pos *table, uint32_t entries, const __m256i wsize) {
table += entries;
table -= 32;
do {
__m256i value1, value2, result1, result2;
value1 = __lasx_xvld(table, 0);
value2 = __lasx_xvld(table, 32);
result1 = __lasx_xvssub_hu(value1, wsize);
result2 = __lasx_xvssub_hu(value2, wsize);
__lasx_xvst(result1, table, 0);
__lasx_xvst(result2, table, 32);
table -= 32;
entries -= 32;
} while (entries > 0);
}
Z_INTERNAL void slide_hash_lasx(deflate_state *s) {
Assert(s->w_size <= UINT16_MAX, "w_size should fit in uint16_t");
uint16_t wsize = (uint16_t)s->w_size;
const __m256i ymm_wsize = __lasx_xvreplgr2vr_h((short)wsize);
slide_hash_chain(s->head, HASH_SIZE, ymm_wsize);
slide_hash_chain(s->prev, wsize, ymm_wsize);
}
#endif
|
