{ "name": "baseline-simd-loop-sve_loop_126", "definition": "loop_126", "dataset": "simd-loop", "author": "baseline-simd-loop-sve", "spec": { "language": "cpp", "target_hardware": [ "aarch64" ], "entry_point": "kernel.cpp::inner_loop_126", "dependencies": [], "isa_features": [ "sve" ], "compile_flags": [ "-O3", "-std=c++14", "-march=armv8.2-a+sve", "-Wno-c++11-narrowing" ], "link_flags": [] }, "sources": [ { "path": "loop_126.h", "content": "// Auto-generated by scripts/gen_simd_loop_harness.py \u2014 do not hand-edit.\n#pragma once\n#include \n\nstruct loop_126_data {\n uint32_t *a;\n uint32_t *b;\n int n;\n uint32_t res;\n};\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nint kernelshift_entry_loop_126(void *a, void *b, int64_t n, void *res_out);\n#ifdef __cplusplus\n}\n#endif\n" }, { "path": "loop_126.cpp", "content": "// Auto-generated by scripts/gen_simd_loop_harness.py \u2014 do not hand-edit.\n#include \"loop_126.h\"\n#include \n#include \n\nextern \"C\" void inner_loop_126(struct loop_126_data *data);\n\nextern \"C\" int kernelshift_entry_loop_126(void *a, void *b, int64_t n, void *res_out) {\n if (n < 0 || n > std::numeric_limits::max()) return -1;\n struct loop_126_data data;\n data.a = static_cast(a);\n data.b = static_cast(b);\n data.n = static_cast(n);\n data.res = 0u;\n inner_loop_126(&data);\n *static_cast(res_out) = data.res;\n return 0;\n}\n" }, { "path": "kernel.cpp", "content": "#include \"loop_126.h\"\n#include \n#include \n#include \n#include \n#include \n#include \n#include \n#include \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\nextern \"C\" void inner_loop_126(struct loop_126_data * data)\n\n{\n uint32_t *a = data->a;\n uint32_t *b = data->b;\n int n = data->n;\n int pad = get_sve_vl() <= 512 ? 64 : 256;\n uint32_t *lmt = a + (n - (n % pad));\n uint32_t res = 0;\n svuint32_t res_vec = svdup_u32(res);\n svuint32_t tmp_vec = svdup_u32(0);\n svuint32_t pred_vec = svdup_u32(1);\n while (a < lmt) {\n svuint32_t a_vec = svld1(svptrue_b32(), a);\n svuint32_t b_vec = svld1(svptrue_b32(), b);\n res_vec = svmla_x(svptrue_b32(), res_vec, a_vec, b_vec);\n tmp_vec = svand_x(svptrue_b32(), res_vec, pred_vec);\n res_vec = svadd_x(svptrue_b32(), res_vec, tmp_vec);\n a += svcntw();\n b += svcntw();\n }\n res = svaddv(svptrue_b32(), res_vec);\n for (int i = 0; i < (n % pad); i++) {\n res += a[i] * b[i];\n if (res % 2) {\n res++;\n }\n }\n data->res = res;\n}\n" } ], "description": "Arm hand-written SVE kernel for loop_126 (sve tier expert ceiling)." }