File size: 6,824 Bytes
bbe836b
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
{
  "name": "baseline-simd-loop-sve_loop_113",
  "definition": "loop_113",
  "dataset": "simd-loop",
  "author": "baseline-simd-loop-sve",
  "spec": {
    "language": "cpp",
    "target_hardware": [
      "aarch64"
    ],
    "entry_point": "kernel.cpp::inner_loop_113",
    "dependencies": [],
    "isa_features": [
      "sve"
    ],
    "compile_flags": [
      "-O3",
      "-std=c++14",
      "-march=armv8.2-a+sve",
      "-Wno-c++11-narrowing"
    ],
    "link_flags": []
  },
  "sources": [
    {
      "path": "loop_113.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_113_data {\n    uint32_t *a0;\n    uint32_t *b0;\n    uint32_t *c0;\n    uint64_t size;\n};\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nint kernelshift_entry_loop_113(void *a0, void *b0, int64_t n, void *res_out);\n#ifdef __cplusplus\n}\n#endif\n"
    },
    {
      "path": "loop_113.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_113.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_113(struct loop_113_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_113(void *a0, void *b0, int64_t n_in, void *res_out) {\n    const uint64_t n = (uint64_t)n_in, mult = 2 * _VLW();\n    struct loop_113_data data;\n    if (n % mult == 0) {\n        data.a0 = static_cast<uint32_t *>(a0); data.b0 = static_cast<uint32_t *>(b0);\n        data.c0 = static_cast<uint32_t *>(res_out); data.size = n;\n        inner_loop_113(&data);\n        return 0;\n    }\n    const uint64_t np = _round_up(n, mult);\n    uint32_t *pa = (uint32_t *)_zeroed(np * 4), *pb = (uint32_t *)_zeroed(np * 4), *pc = (uint32_t *)_zeroed(np * 4);\n    memcpy(pa, a0, n * 4); memcpy(pb, b0, n * 4);\n    data.a0 = pa; data.b0 = pb; data.c0 = pc; data.size = np;\n    inner_loop_113(&data);\n    memcpy(res_out, pc, n * 4);\n    free(pa); free(pb); free(pc);\n    return 0;\n}\n"
    },
    {
      "path": "kernel.cpp",
      "content": "#include \"loop_113.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\nextern \"C\" void inner_loop_113(struct loop_113_data * input)\n\n{\n  uint32_t * a0 = input->a0;\n  uint32_t * b0 = input->b0;\n  uint32_t * c0 = input->c0;\n  uint64_t size = input->size;\n  uint64_t count = 0, count_1 = 0;\n  asm volatile(\n      \"       whilelt p0.s, %[count], %[size]             \\n\"\n      \"       b.none  3f                                  \\n\"\n      \"       cntw    %[count_1]                          \\n\"\n      \"       whilelt p1.s, %[count_1], %[size]           \\n\"\n      \"       b.none  2f                                  \\n\"\n      \"1:                                                 \\n\"\n      \"       uzp1    p2.s, p0.s, p1.s                    \\n\"\n      \"       ld2w    {z10.s,z11.s}, p2/z, [%[a0], %[count], lsl #2] \\n\"\n      \"       ld2w    {z20.s,z21.s}, p2/z, [%[b0], %[count], lsl #2] \\n\"\n      \"       add    z10.s, z10.s, z11.s                  \\n\"\n      \"       add    z11.s, z20.s, z21.s                  \\n\"\n      \"       st2w    {z10.s,z11.s}, p2, [%[c0], %[count], lsl #2] \\n\"\n      \"       incw    %[count], all, mul #2               \\n\"\n      \"       whilelt p1.s, %[count], %[size]             \\n\"\n      \"       b.first 1b                                  \\n\"\n      \"       decw    %[count]                            \\n\"\n      \"       whilelt p0.s, %[count], %[size]             \\n\"\n      \"       b.none  3f                                  \\n\"\n      \"2:                                                 \\n\"\n      \"       pfalse  p1.b                                \\n\"\n      \"       uzp1    p2.s, p0.s, p1.s                    \\n\"\n      \"       ld2w    {z10.s,z11.s}, p2/z, [%[a0], %[count], lsl #2] \\n\"\n      \"       ld2w    {z20.s,z21.s}, p2/z, [%[b0], %[count], lsl #2] \\n\"\n      \"       add     z10.s, z10.s, z11.s                 \\n\"\n      \"       add     z11.s, z20.s, z21.s                 \\n\"\n      \"       st2w    {z10.s,z11.s}, p2, [%[c0], %[count], lsl #2]  \\n\"\n      \"3:                                                 \\n\"\n      : [count] \"+&r\"(count), [count_1] \"+&r\"(count_1)\n      : [a0] \"r\"(a0), [b0] \"r\"(b0), [c0] \"r\"(c0), [size] \"r\"(size)\n      : \"z10\", \"z11\", \"z20\", \"z21\", \"p0\", \"p1\", \"p2\", \"cc\", \"memory\");\n}\n"
    }
  ],
  "description": "Arm hand-written SVE kernel for loop_113 (sve tier expert ceiling)."
}