File size: 4,630 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-sve2_loop_105",
  "definition": "loop_105",
  "dataset": "simd-loop",
  "author": "baseline-simd-loop-sve2",
  "spec": {
    "language": "cpp",
    "target_hardware": [
      "aarch64"
    ],
    "entry_point": "kernel.cpp::inner_loop_105",
    "dependencies": [],
    "isa_features": [
      "sve2"
    ],
    "compile_flags": [
      "-O3",
      "-std=c++14",
      "-march=native",
      "-Wno-c++11-narrowing"
    ],
    "link_flags": []
  },
  "sources": [
    {
      "path": "loop_105.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_105_data {\n    float *a;\n    float *b;\n    int n;\n    float res;\n};\n\n#ifdef __cplusplus\nextern \"C\" {\n#endif\nint kernelshift_entry_loop_105(void *a, void *b, int64_t n, void *res_out);\n#ifdef __cplusplus\n}\n#endif\n"
    },
    {
      "path": "loop_105.cpp",
      "content": "// Auto-generated by scripts/gen_simd_loop_harness.py \u2014 do not hand-edit.\n#include \"loop_105.h\"\n#include <cassert>\n#include <limits>\n\nextern \"C\" void inner_loop_105(struct loop_105_data *data);\n\nextern \"C\" int kernelshift_entry_loop_105(void *a, void *b, int64_t n, void *res_out) {\n    if (n < 0 || n > std::numeric_limits<int>::max()) return -1;\n    struct loop_105_data data;\n    data.a = static_cast<float *>(a);\n    data.b = static_cast<float *>(b);\n    data.n = static_cast<int>(n);\n    data.res = 0.0f;\n    inner_loop_105(&data);\n    *static_cast<float *>(res_out) = data.res;\n    return 0;\n}\n"
    },
    {
      "path": "kernel.cpp",
      "content": "#include \"loop_105.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\nfloat cascade_summation_16(float * a)\n\n{\n  float t0 = a[0] + a[1];\n  float t1 = a[2] + a[3];\n  float t2 = a[4] + a[5];\n  float t3 = a[6] + a[7];\n  float t4 = a[8] + a[9];\n  float t5 = a[10] + a[11];\n  float t6 = a[12] + a[13];\n  float t7 = a[14] + a[15];\n  float t10 = t0 + t1;\n  float t11 = t2 + t3;\n  float t12 = t4 + t5;\n  float t13 = t6 + t7;\n  float t100 = t10 + t11;\n  float t101 = t12 + t13;\n  return t100 + t101;\n}\nfloat NOINLINE cascade_summation(float * a, float * b,\n                                        int n)\n\n{\n  if (n == 16) {\n    return cascade_summation_16(a);\n  }\n  float *s = a;\n  float *d = b;\n  float *lmt = a + n;\n  svbool_t p_all = svptrue_b32();\n  svuint32_t idx = svuzp1(svindex_u32(0, 1), svindex_u32(1, 1));\n#define LOAD(p) svld1_vnum(p_all, s, p)\n#define LOAD_PAIR lda = svcreate2(LOAD(0), LOAD(1))\n  while (s < lmt) {\n    svfloat32x2_t lda = LOAD_PAIR;\n    svfloat32_t b_vec = svaddp_x(p_all, svget2(lda, 0), svget2(lda, 1));\n    svfloat32_t b_res = svtbl(b_vec, idx);\n    svst1(p_all, d, b_res);\n    s += svcntw() * 2;\n    d += svcntw();\n  }\n  int half = n / 2;\n  return cascade_summation(b, b + half, half);\n}\nextern \"C\" void inner_loop_105(struct loop_105_data * input)\n\n{\n  float *a = input->a;\n  float *b = input->b;\n  int n = input->n;\n  input->res = cascade_summation(a, b, n);\n}\n"
    }
  ],
  "description": "Arm hand-written SVE kernel for loop_105 (sve2 tier expert ceiling)."
}