KernelShift / solutions /simd-loop /baseline-simd-loop-sve2 /loop_219 /baseline-simd-loop-sve2_loop_219.json
Download solutions/simd-loop/baseline-simd-loop-sve2/loop_219/baseline-simd-loop-sve2_loop_219.json from l3lab/KernelShift: direct link, hf CLI and curl.
- Browser
- Download file 7.16 kB
-
https://huggingface.co/datasets/l3lab/KernelShift/resolve/main/solutions/simd-loop/baseline-simd-loop-sve2/loop_219/baseline-simd-loop-sve2_loop_219.json
- Command line
-
hf download hf://datasets/l3lab/KernelShift/solutions/simd-loop/baseline-simd-loop-sve2/loop_219/baseline-simd-loop-sve2_loop_219.json
-
curl -L -o baseline-simd-loop-sve2_loop_219.json https://huggingface.co/datasets/l3lab/KernelShift/resolve/main/solutions/simd-loop/baseline-simd-loop-sve2/loop_219/baseline-simd-loop-sve2_loop_219.json
7.16 kB
| { | |
| "name": "baseline-simd-loop-sve2_loop_219", | |
| "definition": "loop_219", | |
| "dataset": "simd-loop", | |
| "author": "baseline-simd-loop-sve2", | |
| "spec": { | |
| "language": "cpp", | |
| "target_hardware": [ | |
| "aarch64" | |
| ], | |
| "entry_point": "kernel.cpp::inner_loop_219", | |
| "dependencies": [], | |
| "isa_features": [ | |
| "sve2" | |
| ], | |
| "compile_flags": [ | |
| "-O3", | |
| "-std=c++14", | |
| "-march=armv9-a+sve2", | |
| "-Wno-c++11-narrowing" | |
| ], | |
| "link_flags": [] | |
| }, | |
| "sources": [ | |
| { | |
| "path": "loop_219.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_219_data {\n uint64_t m;\n uint64_t n;\n uint8_t *a;\n uint8_t *b;\n uint32_t *c;\n};\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nint kernelshift_entry_loop_219(void *a, void *b, int64_t m, int64_t n, void *res_out);\n#ifdef __cplusplus\n}\n#endif\n" | |
| }, | |
| { | |
| "path": "loop_219.cpp", | |
| "content": "// Auto-generated by scripts/gen_simd_loop_harness.py \u2014 do not hand-edit.\n// Expert-baseline binding: pads edge-size workloads to the sizes Arm's kernel\n// supports (see _SVE_PAD_BINDINGS in the generator). Plain call otherwise.\n#include \"loop_219.h\"\n#include <stdint.h>\n#include <stdlib.h>\n#include <string.h>\n// Vector-length units for the padding rules below. Arm's kernel is built for\n// 128-bit SVE (Graviton3/4), so a build without SVE (the neon arm of an ISA\n// ablation lifts this binding too) pads to the same sizes with constants.\n#if defined(__ARM_FEATURE_SVE)\n#include <arm_sve.h>\n#define _VLW() ((uint64_t)svcntw())\n#define _VLH() ((uint64_t)svcnth())\n#else\n#define _VLW() ((uint64_t)4)\n#define _VLH() ((uint64_t)8)\n#endif\n\nextern \"C\" void inner_loop_219(struct loop_219_data *data);\n\nstatic inline uint64_t _round_up(uint64_t v, uint64_t m) { return (v + m - 1) / m * m; }\nstatic inline void *_zeroed(uint64_t bytes) { void *p = calloc(bytes ? bytes : 1, 1); if (!p) abort(); return p; }\n\nextern \"C\" int kernelshift_entry_loop_219(void *a, void *b, int64_t m_in, int64_t n_in, void *res_out) {\n const uint64_t m = (uint64_t)m_in, n = (uint64_t)n_in, vlw = _VLW();\n const uint64_t mm = (8 * vlw > 64 ? 8 * vlw : 64), nm = (2 * vlw > 16 ? 2 * vlw : 16);\n struct loop_219_data _kd;\n if (m % mm == 0 && n % nm == 0) {\n _kd.a = static_cast<uint8_t *>(a); _kd.b = static_cast<uint8_t *>(b);\n _kd.c = static_cast<uint32_t *>(res_out); _kd.m = m; _kd.n = n;\n inner_loop_219(&_kd);\n return 0;\n }\n const uint64_t mp = _round_up(m, mm), np = _round_up(n, nm);\n uint8_t *pa = (uint8_t *)_zeroed(np * mp), *pb = (uint8_t *)_zeroed(np);\n uint32_t *pc = (uint32_t *)_zeroed(mp * sizeof(uint32_t));\n for (uint64_t i = 0; i < n; ++i) memcpy(pa + i * mp, static_cast<uint8_t *>(a) + i * m, m);\n memcpy(pb, b, n);\n _kd.a = pa; _kd.b = pb; _kd.c = pc; _kd.m = mp; _kd.n = np;\n inner_loop_219(&_kd);\n memcpy(res_out, pc, m * sizeof(uint32_t));\n free(pa); free(pb); free(pc);\n return 0;\n}\n" | |
| }, | |
| { | |
| "path": "kernel.cpp", | |
| "content": "#include \"loop_219.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\n#define OUTER_LOOP_ATTR SC_SVE_LOOP_ATTR\n#define MLA(w,u,v) (w) += (uint32_t)(u) * (uint32_t)(v)\nsvuint8x4_t svzip4(svuint8_t a, svuint8_t b, svuint8_t c, svuint8_t d)\n\n{\n svuint8_t e = svzip1(a, c);\n svuint8_t f = svzip2(a, c);\n svuint8_t g = svzip1(b, d);\n svuint8_t h = svzip2(b, d);\n return svcreate4(svzip1(e, g), svzip2(e, g), svzip1(f, h), svzip2(f, h));\n}\nextern \"C\" void inner_loop_219(struct loop_219_data *data)\n\n{\n uint64_t m = data->m;\n uint64_t n = data->n;\n uint8_t *a = data->a;\n uint8_t *b = data->b;\n uint32_t *c = data->c;\n uint8_t *a_ptr;\n uint32_t *c_ptr;\n uint64_t m_idx, n_idx;\n svbool_t p_ldx = svptrue_pat_b8(SV_VL8);\n svuint32x4_t acc_0, acc_1;\n svuint8x4_t zip_0, zip_1;\n svuint8x2_t lda_0, lda_1, lda_2, lda_3;\n svuint8_t ldx;\n#define ZERO svdup_u32(0)\n#define ZERO_QUAD(q) acc_##q = svcreate4(ZERO, ZERO, ZERO, ZERO)\n#define GETA(q,p) svget2(lda_##q, p)\n#define GETB(q,p) svget4(acc_##q, p)\n#define ZIP4_QUAD(i) zip_##i = svzip4(GETA(0, i), GETA(1, i), GETA(2, i), GETA(3, i))\n#define UDOT(l,q,p) svdot_lane(GETB(q, p), svget4(zip_##q, p), ldx, l)\n#define UDOT_LANE(l,q) acc_##q = svcreate4(UDOT(l, q, 0), UDOT(l, q, 1), UDOT(l, q, 2), UDOT(l, q, 3))\n svbool_t p_all = svptrue_b8();\n#define LOAD(i,p) svld1_vnum(p_all, &a_ptr[m * i], p)\n#define LOAD_PAIR(i) lda_##i = svcreate2(LOAD(i, 0), LOAD(i, 1))\n#define STORE(q,p) svst1_vnum(p_all, c_ptr, q * 4 + p, GETB(q, p));\n#define STORE_QUAD(q) STORE(q, 0) STORE(q, 1) STORE(q, 2) STORE(q, 3)\n for (m_idx = 0; m_idx < m; m_idx += svcntb() * 2) {\n ZERO_QUAD(0);\n ZERO_QUAD(1);\n a_ptr = &a[m_idx];\n for (n_idx = 0; n_idx < n; n_idx += 8) {\n ldx = svld1rq(p_ldx, &b[n_idx]);\n LOAD_PAIR(0);\n LOAD_PAIR(1);\n LOAD_PAIR(2);\n LOAD_PAIR(3);\n ZIP4_QUAD(0);\n ZIP4_QUAD(1);\n UDOT_LANE(0, 0);\n UDOT_LANE(0, 1);\n a_ptr += 4 * m;\n LOAD_PAIR(0);\n LOAD_PAIR(1);\n LOAD_PAIR(2);\n LOAD_PAIR(3);\n ZIP4_QUAD(0);\n ZIP4_QUAD(1);\n UDOT_LANE(1, 0);\n UDOT_LANE(1, 1);\n a_ptr += 4 * m;\n }\n c_ptr = &c[m_idx];\n STORE_QUAD(0);\n STORE_QUAD(1);\n }\n}\n#undef MAX_VL\n#define MAX_VL 2048\n#undef PROBLEM_SIZE_LIMIT_KIB\n#define PROBLEM_SIZE_LIMIT_KIB 257\n#define PROBLEM_SIZE_ACTUAL(m,n) ((n)*((m)+1)*sizeof(uint8_t))\n" | |
| } | |
| ], | |
| "description": "Arm hand-written SVE kernel for loop_219 (sve2 tier expert ceiling)." | |
| } | |