KernelShift / solutions /simd-loop /baseline-simd-loop-sve2 /loop_104 /baseline-simd-loop-sve2_loop_104.json
VanishD's picture
shuaiwei huang
allen wu
weihua du
KernelShift dataset
bbe836b
Raw History Blame Contribute Delete
13 kB
{
"name": "baseline-simd-loop-sve2_loop_104",
"definition": "loop_104",
"dataset": "simd-loop",
"author": "baseline-simd-loop-sve2",
"spec": {
"language": "cpp",
"target_hardware": [
"aarch64"
],
"entry_point": "kernel.cpp::inner_loop_104",
"dependencies": [],
"isa_features": [
"sve2"
],
"compile_flags": [
"-O3",
"-std=c++14",
"-march=native",
"-Wno-c++11-narrowing"
],
"link_flags": []
},
"sources": [
{
"path": "loop_104.h",
"content": "// Auto-generated by scripts/gen_simd_loop_harness.py \u2014 do not hand-edit.\n#pragma once\n#include <stdint.h>\n\nstruct loop_104_data {\n uint32_t *histogram;\n uint64_t histogram_size;\n uint8_t *data;\n int n;\n};\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nint kernelshift_entry_loop_104(void *data, int64_t histogram_size, int64_t n, void *res_out);\n#ifdef __cplusplus\n}\n#endif\n"
},
{
"path": "loop_104.cpp",
"content": "// Auto-generated by scripts/gen_simd_loop_harness.py \u2014 do not hand-edit.\n#include \"loop_104.h\"\n#include <stdint.h>\n\nextern \"C\" void inner_loop_104(struct loop_104_data *data);\n\nextern \"C\" int kernelshift_entry_loop_104(void *data, int64_t histogram_size, int64_t n, void *res_out) {\n struct loop_104_data _kd;\n _kd.data = static_cast<uint8_t *>(data);\n _kd.histogram = static_cast<uint32_t *>(res_out);\n _kd.histogram_size = static_cast<uint64_t>(histogram_size);\n _kd.n = static_cast<int>(n);\n inner_loop_104(&_kd);\n return 0;\n}\n"
},
{
"path": "kernel.cpp",
"content": "#include \"loop_104.h\"\n#include <stdint.h>\n#include <string.h>\n#include <stdlib.h>\n#include <stdio.h>\n#include <limits.h>\n#include <assert.h>\n#include <math.h>\n#include <arm_sve.h>\n#define restrict __restrict\n#define SC_SVE_ATTR\n#define SC_SVE_LOOP_ATTR\n#define NS_SVE_LOOP_ATTR\n#define NOINLINE __attribute__((noinline))\n#define FOR_COND(P, S, I, N) svptest_first(svptrue_b##S(), P = svwhilelt_b##S(I, N))\n#define FOR_LOOP(T, I, M, N, P, S, W) for (T I = M; FOR_COND(P, S, I, N); I += svcnt##W())\n#define FOR_LOOP_8(T, I, M, N, P) FOR_LOOP(T, I, M, N, P, 8, b)\n#define FOR_LOOP_16(T, I, M, N, P) FOR_LOOP(T, I, M, N, P, 16, h)\n#define FOR_LOOP_32(T, I, M, N, P) FOR_LOOP(T, I, M, N, P, 32, w)\n#define FOR_LOOP_64(T, I, M, N, P) FOR_LOOP(T, I, M, N, P, 64, d)\nstatic inline uint32_t get_sve_vl(void) {\n uint64_t vl = 0; asm volatile(\"incb %[vl], all, mul #8\" : [vl] \"+r\"(vl) : :);\n return (uint32_t)vl;\n}\nstatic inline uint32_t get_vl(void) { return get_sve_vl(); }\n// common/helpers.h: 64-byte-aligned scratch. Only reached when the harness\n// hands a kernel a NULL scratch buffer (it never does \u2014 every scratch field is\n// bound), so a plain aligned malloc stands in for Arm's arena allocator.\nstatic inline void *alloc_64b(uint64_t size, const char *name) {\n void *p = NULL; (void)name;\n if (posix_memalign(&p, 64, size ? size : 64) != 0) abort();\n return p;\n}\n#define ALLOC_64B(P, S, N) P = (__typeof__(P))alloc_64b((S) * sizeof((P)[0]), N)\n\n#define IDX(i,o) svuint8_t idx_##i = svadd_x(all, idx_0, o)\n#define ACC(n) svuint8_t acc_##n = svdup_u8(0)\nvoid NOINLINE histogram_1(uint32_t *hist, uint8_t *data, uint64_t n) {\n svbool_t all = svptrue_b8();\n svuint8_t cap = svdup_u8(191);\n svuint8_t top = svdup_u8(0x3f);\n svuint8_t idx_0 = svindex_u8(0, 1);\n IDX(1, 16);\n IDX(2, 32);\n IDX(3, 48);\n IDX(4, 64);\n IDX(5, 80);\n IDX(6, 96);\n IDX(7, 112);\n for (uint64_t i = 0; i < n;) {\n ACC(0);\n ACC(1);\n ACC(2);\n ACC(3);\n ACC(4);\n ACC(5);\n ACC(6);\n ACC(7);\n ACC(8);\n ACC(9);\n ACC(a);\n ACC(b);\n ACC(c);\n ACC(d);\n ACC(e);\n ACC(f);\n while (1) {\n svuint8_t val_0 = svld1rq(all, data + i);\n svuint8_t val_1 = svand_x(all, val_0, top);\n svbool_t cmp = svcmpgt(all, val_0, 127);\n val_1 = svsel(cmp, val_1, cap);\n#define STEP(i,j,k) acc_##i = svadd_x(all, acc_##i, svhistseg(idx_##j, val_##k))\n STEP(0, 0, 0);\n STEP(8, 0, 1);\n STEP(1, 1, 0);\n STEP(9, 1, 1);\n STEP(2, 2, 0);\n STEP(a, 2, 1);\n STEP(3, 3, 0);\n STEP(b, 3, 1);\n STEP(4, 4, 0);\n STEP(c, 4, 1);\n STEP(5, 5, 0);\n STEP(d, 5, 1);\n STEP(6, 6, 0);\n STEP(e, 6, 1);\n STEP(7, 7, 0);\n STEP(f, 7, 1);\n#undef STEP\n i += 16;\n if (i >= n) {\n break;\n } else if (i % 64 == 0) {\n val_0 = acc_0;\n val_1 = acc_1;\n#define UMAX(i,j) val_##i = svmax_x(all, val_##i, acc_##j)\n UMAX(0, 2);\n UMAX(1, 3);\n UMAX(0, 4);\n UMAX(1, 5);\n UMAX(0, 6);\n UMAX(1, 7);\n UMAX(0, 8);\n UMAX(1, 9);\n UMAX(0, a);\n UMAX(1, b);\n UMAX(0, c);\n UMAX(1, d);\n UMAX(0, e);\n UMAX(1, f);\n#undef UMAX\n cmp = svcmplt(all, cap, svmax_x(all, val_0, val_1));\n if (svptest_any(cmp, cmp)) break;\n }\n }\n svuint16_t lo, hi;\n svuint32x2_t v1, v2;\n#define WB_128(n,o) v1 = svld2_vnum(all, ptr, 0x##o); v2 = svld2_vnum(all, ptr, 0x##o + 2); lo = svunpklo(acc_##n); hi = svunpkhi(acc_##n); v1 = svset2(v1, 0, svaddwb(svget2(v1, 0), lo)); v1 = svset2(v1, 1, svaddwt(svget2(v1, 1), lo)); v2 = svset2(v2, 0, svaddwb(svget2(v2, 0), hi)); v2 = svset2(v2, 1, svaddwt(svget2(v2, 1), hi)); svst2_vnum(all, ptr, 0x##o, v1); svst2_vnum(all, ptr, 0x##o + 2, v2);\n uint32_t *ptr = hist;\n WB_128(0, 0);\n WB_128(1, 4);\n WB_128(2, 8);\n WB_128(3, c);\n ptr += 4 * svcntb();\n WB_128(4, 0);\n WB_128(5, 4);\n WB_128(6, 8);\n WB_128(7, c);\n ptr += 4 * svcntb();\n WB_128(8, 0);\n WB_128(9, 4);\n WB_128(a, 8);\n WB_128(b, c);\n ptr += 4 * svcntb();\n WB_128(c, 0);\n WB_128(d, 4);\n WB_128(e, 8);\n WB_128(f, c);\n }\n}\nvoid NOINLINE histogram_2(uint32_t *hist, uint8_t *data, uint64_t n) {\n svbool_t all = svptrue_b8();\n svuint8_t cap = svdup_u8(191);\n svuint8_t idx_0 = svindex_u8(0, 1);\n IDX(1, 32);\n IDX(2, 64);\n IDX(3, 96);\n IDX(4, 128);\n IDX(5, 160);\n IDX(6, 192);\n IDX(7, 224);\n for (uint64_t i = 0; i < n;) {\n ACC(0);\n ACC(1);\n ACC(2);\n ACC(3);\n ACC(4);\n ACC(5);\n ACC(6);\n ACC(7);\n while (1) {\n svuint8_t val = svld1rq(all, data + i);\n#define STEP(i) acc_##i = svadd_x(all, acc_##i, svhistseg(idx_##i, val))\n STEP(0);\n STEP(1);\n STEP(2);\n STEP(3);\n STEP(4);\n STEP(5);\n STEP(6);\n STEP(7);\n#undef STEP\n i += 16;\n if (i >= n) {\n break;\n } else if (i % 64 == 0) {\n svuint8_t val_0 = acc_0;\n svuint8_t val_1 = acc_1;\n#define UMAX(i,j) val_##i = svmax_x(all, val_##i, acc_##i)\n UMAX(0, 2);\n UMAX(1, 3);\n UMAX(0, 4);\n UMAX(1, 5);\n UMAX(0, 6);\n UMAX(1, 7);\n#undef UMAX\n svbool_t cmp = svcmplt(all, cap, svmax_x(all, val_0, val_1));\n if (svptest_any(cmp, cmp)) break;\n }\n }\n svuint16_t lo1, lo2, hi1, hi2;\n svuint32x4_t v1, v2;\n#define WB_256(m,n,o) v##m = svld4_vnum(all, hist, o); lo##m = svextb_x(all, svreinterpret_u16(acc_##n)); hi##m = svlsr_x(all, svreinterpret_u16(acc_##n), 8); v##m = svset4(v##m, 0, svaddwb(svget4(v##m, 0), lo##m)); v##m = svset4(v##m, 2, svaddwt(svget4(v##m, 2), lo##m)); v##m = svset4(v##m, 1, svaddwb(svget4(v##m, 1), hi##m)); v##m = svset4(v##m, 3, svaddwt(svget4(v##m, 3), hi##m)); svst4_vnum(all, hist, o, v##m);\n WB_256(1, 0, 0);\n WB_256(2, 1, 4);\n WB_256(1, 2, 8);\n WB_256(2, 3, 12);\n WB_256(1, 4, 16);\n WB_256(2, 5, 20);\n WB_256(1, 6, 24);\n WB_256(2, 7, 28);\n }\n}\nvoid NOINLINE histogram_4(uint32_t *hist, uint8_t *data, uint64_t n) {\n svbool_t all = svptrue_b8();\n svuint8_t cap = svdup_u8(191);\n svuint8_t idx_0 = svindex_u8(0, 1);\n IDX(1, 64);\n IDX(2, 128);\n IDX(3, 192);\n for (uint8_t *end = data + n; data < end;) {\n ACC(0);\n ACC(1);\n ACC(2);\n ACC(3);\n while (1) {\n svuint8_t val_0 = svld1rq(all, data + 0);\n svuint8_t val_1 = svld1rq(all, data + 16);\n svuint8_t val_2 = svld1rq(all, data + 32);\n svuint8_t val_3 = svld1rq(all, data + 48);\n#define STEP(i,j) acc_##i = svadd_x(all, acc_##i, svhistseg(idx_##i, val_##j))\n STEP(0, 0);\n STEP(0, 1);\n STEP(0, 2);\n STEP(0, 3);\n STEP(1, 0);\n STEP(1, 1);\n STEP(1, 2);\n STEP(1, 3);\n STEP(2, 0);\n STEP(2, 1);\n STEP(2, 2);\n STEP(2, 3);\n STEP(3, 0);\n STEP(3, 1);\n STEP(3, 2);\n STEP(3, 3);\n#undef STEP\n data += 64;\n if (data >= end) {\n break;\n } else {\n svbool_t cmp_0 = svcmpge(all, cap, acc_0);\n svbool_t cmp_1 = svcmpge(all, cap, acc_1);\n svbool_t cmp_2 = svcmpge(all, cap, acc_2);\n svbool_t cmp_3 = svcmpge(all, cap, acc_3);\n cmp_0 = svand_z(cmp_0, cmp_1, cmp_2);\n cmp_3 = svnand_z(all, cmp_0, cmp_3);\n if (svptest_any(cmp_3, cmp_3)) break;\n }\n }\n svuint16_t lo1, lo2, hi1, hi2;\n svuint32x4_t v1, v2;\n#define LOAD_512(m,o) v##m = svld4_vnum(all, hist, 0x##o)\n#define ADDW_512(m) v##m = svset4(v##m, 0, svaddwb(svget4(v##m, 0), lo##m)); v##m = svset4(v##m, 2, svaddwt(svget4(v##m, 2), lo##m)); v##m = svset4(v##m, 1, svaddwb(svget4(v##m, 1), hi##m)); v##m = svset4(v##m, 3, svaddwt(svget4(v##m, 3), hi##m));\n#define UNPK_512(m,n) lo##m = svextb_x(all, svreinterpret_u16(acc_##n)); hi##m = svlsr_x(all, svreinterpret_u16(acc_##n), 8);\n#define STOR_512(m,o) svst4_vnum(all, hist, 0x##o, v##m)\n LOAD_512(1, 0);\n LOAD_512(2, 4);\n UNPK_512(1, 0);\n ADDW_512(1);\n STOR_512(1, 0);\n LOAD_512(1, 8);\n UNPK_512(2, 1);\n ADDW_512(2);\n STOR_512(2, 4);\n LOAD_512(2, c);\n UNPK_512(1, 2);\n ADDW_512(1);\n UNPK_512(2, 3);\n ADDW_512(2);\n STOR_512(1, 8);\n STOR_512(2, a);\n }\n}\nvoid NOINLINE histogram_8(uint32_t *hist, uint8_t *data, uint64_t n) {\n svbool_t all = svptrue_b8();\n svuint8_t cap = svdup_u8(191);\n svuint8_t idx_0 = svindex_u8(0, 1);\n IDX(1, 128);\n for (uint8_t *end = data + n; data < end;) {\n ACC(0);\n ACC(1);\n while (1) {\n svuint8_t val_0 = svld1rq(all, data + 0);\n svuint8_t val_1 = svld1rq(all, data + 16);\n svuint8_t val_2 = svld1rq(all, data + 32);\n svuint8_t val_3 = svld1rq(all, data + 48);\n#define STEP(i,j) acc_##i = svadd_x(all, acc_##i, svhistseg(idx_##i, val_##j))\n STEP(0, 0);\n STEP(0, 1);\n STEP(0, 2);\n STEP(0, 3);\n STEP(1, 0);\n STEP(1, 1);\n STEP(1, 2);\n STEP(1, 3);\n#undef STEP\n data += 64;\n if (data >= end) {\n break;\n } else {\n svbool_t cmp_0 = svcmpge(all, cap, acc_0);\n svbool_t cmp_1 = svcmpge(all, cap, acc_1);\n cmp_0 = svnand_z(all, cmp_0, cmp_1);\n if (svptest_any(cmp_0, cmp_0)) break;\n }\n }\n svuint16_t lo1, lo2, hi1, hi2;\n svuint32x4_t v1, v2;\n#define LOAD_1024(m,o) v##m = svld4_vnum(all, hist, 0x##o)\n#define ADDW_1024(m) v##m = svset4(v##m, 0, svaddwb(svget4(v##m, 0), lo##m)); v##m = svset4(v##m, 2, svaddwt(svget4(v##m, 2), lo##m)); v##m = svset4(v##m, 1, svaddwb(svget4(v##m, 1), hi##m)); v##m = svset4(v##m, 3, svaddwt(svget4(v##m, 3), hi##m));\n#define UNPK_1024(m,n) lo##m = svextb_x(all, svreinterpret_u16(acc_##n)); hi##m = svlsr_x(all, svreinterpret_u16(acc_##n), 8);\n#define STOR_1024(m,o) svst4_vnum(all, hist, 0x##o, v##m)\n LOAD_1024(1, 0);\n LOAD_1024(2, 4);\n UNPK_1024(1, 0);\n ADDW_1024(1);\n UNPK_1024(2, 1);\n ADDW_1024(2);\n STOR_1024(1, 0);\n STOR_1024(2, 4);\n }\n}\n#undef IDX\n#undef ACC\nvoid NOINLINE update(uint32_t *histogram, uint8_t *data, int n) {\n switch (8 * svcntb()) {\n case 128:\n histogram_1(histogram, data, n);\n break;\n case 256:\n histogram_2(histogram, data, n);\n break;\n case 512:\n histogram_4(histogram, data, n);\n break;\n case 1024:\n histogram_8(histogram, data, n);\n break;\n default: {\n svbool_t p;\n FOR_LOOP_32(int, i, 0, n, p) {\n svuint32_t idx = svld1ub_u32(p, data + i);\n svuint32_t val = svld1_gather_index(p, histogram, idx);\n svuint32_t cnt = svhistcnt_z(p, idx, idx);\n val = svadd_x(p, val, cnt);\n svst1_scatter_index(p, histogram, idx, val);\n }\n break;\n }\n }\n}\nextern \"C\" void inner_loop_104(struct loop_104_data * input) {\n uint32_t *histogram = input->histogram;\n uint64_t histogram_size = input->histogram_size;\n uint8_t *data = input->data;\n int n = input->n;\n memset(histogram, 0, histogram_size);\n update(histogram, data, n);\n}\n"
}
],
"description": "Arm hand-written SVE kernel for loop_104 (sve2 tier expert ceiling)."
}