xref: /aosp_15_r20/external/XNNPACK/src/f32-igemm/sse-dup.c.in (revision 4bdc94577ba0e567308109d787f7fec7b531ce36)
1// Copyright 2019 Google LLC
2//
3// This source code is licensed under the BSD-style license found in the
4// LICENSE file in the root directory of this source tree.
5
6$assert NR % 4 == 0
7$ABC = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
8$SSE_HEADER = {1: "xmmintrin.h", 2: "emmintrin.h"}[SSE]
9#include <assert.h>
10
11#include <${SSE_HEADER}>
12
13#include <xnnpack/igemm.h>
14
15
16$ISA = {1: "sse", 2: "sse2"}[SSE]
17void xnn_f32_igemm_minmax_ukernel_${MR}x${NR}__${ISA}_dup(
18    size_t mr,
19    size_t nc,
20    size_t kc,
21    size_t ks,
22    const float**restrict a,
23    const float*restrict w,
24    float*restrict c,
25    size_t cm_stride,
26    size_t cn_stride,
27    size_t a_offset,
28    const float* zero,
29    const union xnn_f32_minmax_params params[restrict XNN_MIN_ELEMENTS(1)])
30{
31  assert(mr != 0);
32  assert(mr <= ${MR});
33  assert(nc != 0);
34  assert(kc != 0);
35  assert(kc % sizeof(float) == 0);
36  assert(ks != 0);
37  assert(ks % (${MR} * sizeof(void*)) == 0);
38  assert(a_offset % sizeof(float) == 0);
39  assert(a != NULL);
40  assert(w != NULL);
41  assert(c != NULL);
42
43  float* c0 = c;
44  $for M in range(1, MR):
45    float* c${M} = (float*) ((uintptr_t) c${M-1} + cm_stride);
46    $if M % 2 == 0:
47      if XNN_UNPREDICTABLE(mr <= ${M}) {
48        c${M} = c${M-1};
49      }
50    $elif M + 1 == MR:
51      if XNN_UNPREDICTABLE(mr != ${M+1}) {
52        c${M} = c${M-1};
53      }
54    $else:
55      if XNN_UNPREDICTABLE(mr < ${M+1}) {
56        c${M} = c${M-1};
57      }
58
59  do {
60    __m128 vacc0x${ABC[0:4]} = _mm_load_ps(w);
61    $for N in range(4, NR, 4):
62      __m128 vacc0x${ABC[N:N+4]} = _mm_load_ps(w + ${N});
63    $for M in range(1, MR):
64      $for N in range(0, NR, 4):
65        __m128 vacc${M}x${ABC[N:N+4]} = vacc0x${ABC[N:N+4]};
66    w += ${NR};
67
68    size_t p = ks;
69    do {
70      $for M in range(MR):
71        const float* restrict a${M} = a[${M}];
72        assert(a${M} != NULL);
73        if XNN_UNPREDICTABLE(a${M} != zero) {
74          a${M} = (const float*) ((uintptr_t) a${M} + a_offset);
75        }
76      a += ${MR};
77
78      size_t k = kc;
79      while (k >= 4 * sizeof(float)) {
80        $for M in range(MR):
81          const __m128 va${M} = _mm_loadu_ps(a${M});
82          a${M} += 4;
83
84        $for L in range(4):
85          $LLLL = str(L) * 4
86
87          $for M in range(MR):
88            $if SSE >= 2 and L < 3:
89              const __m128 va${M}c${LLLL} = _mm_castsi128_ps(_mm_shuffle_epi32(_mm_castps_si128(va${M}), _MM_SHUFFLE(${L}, ${L}, ${L}, ${L})));
90            $else:
91              const __m128 va${M}c${LLLL} = _mm_shuffle_ps(va${M}, va${M}, _MM_SHUFFLE(${L}, ${L}, ${L}, ${L}));
92
93          $for N in range(0, NR, 4):
94            const __m128 vb${ABC[N:N+4]}c${L} = _mm_load_ps(w + ${L * NR + N});
95
96          $for N in range(0, NR, 4):
97            $for M in range(MR):
98              vacc${M}x${ABC[N:N+4]} = _mm_add_ps(vacc${M}x${ABC[N:N+4]}, _mm_mul_ps(va${M}c${LLLL}, vb${ABC[N:N+4]}c${L}));
99
100        w += ${4 * NR};
101        k -= 4 * sizeof(float);
102      }
103      if XNN_UNLIKELY(k != 0) {
104        do {
105          const __m128 vb${ABC[0:4]} = _mm_load_ps(w);
106          $for N in range(4, NR, 4):
107            const __m128 vb${ABC[N:N+4]} = _mm_load_ps(w + ${N});
108          w += ${NR};
109
110          $for M in range(MR):
111            const __m128 va${M} = _mm_load1_ps(a${M});
112            a${M} += 1;
113
114          $for M in range(MR):
115            $for N in range(0, NR, 4):
116              vacc${M}x${ABC[N:N+4]} = _mm_add_ps(vacc${M}x${ABC[N:N+4]}, _mm_mul_ps(va${M}, vb${ABC[N:N+4]}));
117          k -= sizeof(float);
118        } while (k != 0);
119      }
120      p -= ${MR} * sizeof(void*);
121    } while (p != 0);
122
123    const __m128 vmax = _mm_load_ps(params->sse.max);
124    $for N in range(0, NR, 4):
125      $for M in range(MR):
126        vacc${M}x${ABC[N:N+4]} = _mm_min_ps(vacc${M}x${ABC[N:N+4]}, vmax);
127
128    const __m128 vmin = _mm_load_ps(params->sse.min);
129    $for N in range(0, NR, 4):
130      $for M in range(MR):
131        vacc${M}x${ABC[N:N+4]} = _mm_max_ps(vacc${M}x${ABC[N:N+4]}, vmin);
132
133    if XNN_LIKELY(nc >= ${NR}) {
134      $for M in reversed(range(MR)):
135        _mm_storeu_ps(c${M}, vacc${M}x${ABC[0:4]});
136        $for N in range(4, NR, 4):
137          _mm_storeu_ps(c${M} + ${N}, vacc${M}x${ABC[N:N+4]});
138        c${M} = (float*) ((uintptr_t) c${M} + cn_stride);
139
140      a = (const float**restrict) ((uintptr_t) a - ks);
141      nc -= ${NR};
142    } else {
143      $for LOG2N in reversed(range(NR.bit_length())):
144        $if NR != 1 << LOG2N:
145          if (nc & ${1 << LOG2N}) {
146            $if LOG2N >= 2:
147              $for M in reversed(range(MR)):
148                _mm_storeu_ps(c${M}, vacc${M}x${ABC[0:4]});
149                $for N in range(4, 1 << LOG2N, 4):
150                  _mm_storeu_ps(c${M} + ${N}, vacc${M}x${ABC[N:N+4]});
151
152              $for M in reversed(range(MR)):
153                $for N in range(0, 1 << (LOG2N - 1), 4):
154                  vacc${M}x${ABC[N:N+4]} = vacc${M}x${ABC[N + (1 << LOG2N):N + (1 << LOG2N)+4]};
155
156              $for M in reversed(range(MR)):
157                c${M} += ${1 << LOG2N};
158            $elif LOG2N == 1:
159              $for M in reversed(range(MR)):
160                _mm_storel_pi((__m64*) c${M}, vacc${M}x${ABC[0:4]});
161
162              $for M in reversed(range(MR)):
163                vacc${M}x${ABC[0:4]} = _mm_movehl_ps(vacc${M}x${ABC[0:4]}, vacc${M}x${ABC[0:4]});
164
165              $for M in reversed(range(MR)):
166                c${M} += 2;
167            $elif LOG2N == 0:
168              $for M in reversed(range(MR)):
169                _mm_store_ss(c${M}, vacc${M}x${ABC[0:4]});
170          }
171
172      nc = 0;
173    }
174  } while (nc != 0);
175}
176