Debian Codegraph @

src/x32-packw/gen/x32-packw-x16-gemm-gio-avx-u1-prfm.c

raw
1 // Auto-generated file. Do not edit!
2 // Template: src/x32-packw/gio-avx.c.in
3 // Generator: tools/xngen
4 //
5 // Copyright 2024 Google LLC
6 //
7 // This source code is licensed under the BSD-style license found in the
8 // LICENSE file in the root directory of this source tree.
9
10 #include <assert.h>
11 #include <stddef.h>
12 #include <stdint.h>
13
14 #include <immintrin.h>
15
16 #include "xnnpack/intrinsics-polyfill.h"
17 #include "xnnpack/packw.h"
18 #include "xnnpack/prefetch.h"
19
20
21 void xnn_x32_packw_gemm_gio_ukernel_x16__avx_u1_prfm(
22 size_t g,
23 size_t nc,
24 size_t kc,
25 size_t nr,
26 size_t kr,
27 size_t sr,
28 size_t k_stride,
29 const uint32_t* weights,
30 const uint32_t* bias,
31 const void* scale,
32 uint32_t* packed_weights,
33 size_t extra_bytes,
34 const void* params)
35 {
36 assert(g != 0);
37 assert(nc != 0);
38 assert(kc != 0);
39 assert(nr == 16); // This kernel is for NR=16
40 assert(kr == 1);
41 assert(sr == 1);
42 assert(k_stride != 0);
43 assert(weights != NULL);
44 assert(packed_weights != NULL);
45 static const int32_t mask_table[32] = {
46 -1, -1, -1, -1, -1, -1, -1, -1,
47 -1, -1, -1, -1, -1, -1, -1, -1,
48 0, 0, 0, 0, 0, 0, 0, 0,
49 0, 0, 0, 0, 0, 0, 0, 0,
50 };
51
52 const __m256 vzero = _mm256_setzero_ps();
53 const float* b = (const float*) bias;
54 float* packed_w = (float*) packed_weights;
55 do {
56 // NC main loop multiple of 16
57 const float* w = (const float*) weights;
58 size_t n = nc;
59
60 for (; n >= 16; n -= 16) {
61 if XNN_LIKELY(b != NULL) {
62 const __m256 vb0 = _mm256_loadu_ps(b + 0);
63 const __m256 vb8 = _mm256_loadu_ps(b + 8);
64 _mm256_store_ps(packed_w + 0, vb0);
65 _mm256_store_ps(packed_w + 8, vb8);
66 b += 16;
67 } else {
68 _mm256_store_ps(packed_w + 0, vzero);
69 _mm256_store_ps(packed_w + 8, vzero);
70 }
71 packed_w += 16;
72
73 size_t k = kc;
74
75 // KC remainder loop
76 for (; k > 0; --k) {
77 const __m256 v0 = _mm256_loadu_ps(w + 0);
78 const __m256 v8 = _mm256_loadu_ps(w + 8);
79 xnn_prefetch_to_l1((const int8_t*) w + 960);
80 _mm256_store_ps(packed_w + 0, v0);
81 _mm256_store_ps(packed_w + 8, v8);
82 w += k_stride;
83 packed_w += 16;
84 }
85 w = w - kc * k_stride + 16; // Advance to next column of 16 floats
86 }
87
88 // NC remainder (1..15)
89 if XNN_UNLIKELY(n != 0) {
90 assert(n >= 1);
91 assert(n <= 15);
92 const __m256i vmask0 = _mm256_loadu_si256((const __m256i*) &mask_table[16 - n]);
93 const __m256i vmask8 = _mm256_loadu_si256((const __m256i*) &mask_table[24 - n]);
94
95 if XNN_LIKELY(b != NULL) {
96 const __m256 vb0 = _mm256_maskload_ps(b + 0, vmask0);
97 const __m256 vb8 = _mm256_maskload_ps(b + 8, vmask8);
98 _mm256_store_ps(packed_w + 0, vb0);
99 _mm256_store_ps(packed_w + 8, vb8);
100 b += n;
101 } else {
102 _mm256_store_ps(packed_w + 0, vzero);
103 _mm256_store_ps(packed_w + 8, vzero);
104 }
105 packed_w += 16;
106
107 // KC main loop
108 for (size_t k = kc; k > 0; --k) {
109 const __m256 v0 = _mm256_maskload_ps(w + 0, vmask0);
110 const __m256 v8 = _mm256_maskload_ps(w + 8, vmask8);
111 _mm256_store_ps(packed_w + 0, v0);
112 _mm256_store_ps(packed_w + 8, v8);
113 w += k_stride;
114 packed_w += 16;
115 }
116 }
117 weights += nc * kc;
118 } while (--g != 0);
119 }