KernelShift / solutions /simd-loop /baseline-simd-loop-sve /loop_103 /baseline-simd-loop-sve_loop_103.json
Download solutions/simd-loop/baseline-simd-loop-sve/loop_103/baseline-simd-loop-sve_loop_103.json from l3lab/KernelShift: direct link, hf CLI and curl.
- Browser
- Download file 5.81 kB
-
https://huggingface.co/datasets/l3lab/KernelShift/resolve/main/solutions/simd-loop/baseline-simd-loop-sve/loop_103/baseline-simd-loop-sve_loop_103.json
- Command line
-
hf download hf://datasets/l3lab/KernelShift/solutions/simd-loop/baseline-simd-loop-sve/loop_103/baseline-simd-loop-sve_loop_103.json
-
curl -L -o baseline-simd-loop-sve_loop_103.json https://huggingface.co/datasets/l3lab/KernelShift/resolve/main/solutions/simd-loop/baseline-simd-loop-sve/loop_103/baseline-simd-loop-sve_loop_103.json
5.81 kB
| { | |
| "name": "baseline-simd-loop-sve_loop_103", | |
| "definition": "loop_103", | |
| "dataset": "simd-loop", | |
| "author": "baseline-simd-loop-sve", | |
| "spec": { | |
| "language": "cpp", | |
| "target_hardware": [ | |
| "aarch64" | |
| ], | |
| "entry_point": "kernel.cpp::inner_loop_103", | |
| "dependencies": [], | |
| "isa_features": [ | |
| "sve" | |
| ], | |
| "compile_flags": [ | |
| "-O3", | |
| "-std=c++14", | |
| "-march=armv8.2-a+sve", | |
| "-Wno-c++11-narrowing" | |
| ], | |
| "link_flags": [] | |
| }, | |
| "sources": [ | |
| { | |
| "path": "loop_103.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_103_data {\n uint8_t *p;\n uint8_t *end;\n int checksum;\n};\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nint kernelshift_entry_loop_103(void *p, int64_t n, void *res_out);\n#ifdef __cplusplus\n}\n#endif\n" | |
| }, | |
| { | |
| "path": "loop_103.cpp", | |
| "content": "// Auto-generated by scripts/gen_simd_loop_harness.py \u2014 do not hand-edit.\n#include \"loop_103.h\"\n#include <stdint.h>\n\nextern \"C\" void inner_loop_103(struct loop_103_data *data);\n\nextern \"C\" int kernelshift_entry_loop_103(void *p, int64_t n, void *res_out) {\n struct loop_103_data _kd;\n _kd.p = static_cast<uint8_t *>(p);\n _kd.end = static_cast<uint8_t *>(p) + n;\n _kd.checksum = 0;\n inner_loop_103(&_kd);\n *static_cast<int *>(res_out) = _kd.checksum;\n return 0;\n}\n" | |
| }, | |
| { | |
| "path": "kernel.cpp", | |
| "content": "#include \"loop_103.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\nuint8_t *NOINLINE skip_whitespace(uint8_t *p, uint8_t *end) {\n asm volatile(\n \" dup z4.b, 0x20 \\n\"\n \" whilelt p0.b, %[p], %[end] \\n\"\n \"1: ld1b z0.b, p0/z, [%[p]] \\n\"\n \" cmpne p1.b, p0/z, z0.b, 0x09 \\n\"\n \" cmpne p1.b, p1/z, z0.b, 0x0A \\n\"\n \" cmpne p1.b, p1/z, z0.b, 0x0D \\n\"\n \" cmpne p1.b, p1/z, z0.b, z4.b \\n\"\n \" b.any 2f \\n\"\n \" incb %[p] \\n\"\n \" whilelt p0.b, %[p], %[end] \\n\"\n \" b.first 1b \\n\"\n \" mov %[p], %[end] \\n\"\n \" b 3f \\n\"\n \"2: brkb p1.b, p0/z, p1.b \\n\"\n \" incp %[p], p1.b \\n\"\n \"3: \\n\"\n : [p] \"+&r\"(p)\n : [end] \"r\"(end)\n : \"v0\", \"v4\", \"p0\", \"p1\", \"cc\", \"memory\");\n return p;\n}\nuint8_t *NOINLINE skip_word(uint8_t *p, uint8_t *end) {\n asm volatile(\n \" dup z4.b, 0x20 \\n\"\n \" whilelt p0.b, %[p], %[end] \\n\"\n \"1: ld1b z0.b, p0/z, [%[p]] \\n\"\n \" cmpeq p1.b, p0/z, z0.b, 0x09 \\n\"\n \" cmpeq p2.b, p0/z, z0.b, 0x0A \\n\"\n \" cmpeq p3.b, p0/z, z0.b, 0x0D \\n\"\n \" cmpeq p4.b, p0/z, z0.b, z4.b \\n\"\n \" orr p1.b, p0/z, p1.b, p2.b \\n\"\n \" orr p1.b, p0/z, p1.b, p3.b \\n\"\n \" orrs p1.b, p0/z, p1.b, p4.b \\n\"\n \" b.any 2f \\n\"\n \" incb %[p] \\n\"\n \" whilelt p0.b, %[p], %[end] \\n\"\n \" b.first 1b \\n\"\n \" mov %[p], %[end] \\n\"\n \" b 3f \\n\"\n \"2: brkb p1.b, p0/z, p1.b \\n\"\n \" incp %[p], p1.b \\n\"\n \"3: \\n\"\n : [p] \"+&r\"(p)\n : [end] \"r\"(end)\n : \"v0\", \"v4\", \"p0\", \"p1\", \"cc\", \"memory\");\n return p;\n}\nextern \"C\" void inner_loop_103(struct loop_103_data * input) {\n uint8_t *p = input->p;\n uint8_t *end = input->end;\n int count = 0;\n p = skip_whitespace(p, end);\n while (p != end) {\n count++;\n p = skip_word(p, end);\n p = skip_whitespace(p, end);\n }\n input->checksum = count;\n}\n" | |
| } | |
| ], | |
| "description": "Arm hand-written SVE kernel for loop_103 (sve tier expert ceiling)." | |
| } | |