// Copyright 2019 Google LLC // // This source code is licensed under the BSD-style license found in the // LICENSE file in the root directory of this source tree. $assert MR % 4 == 0 $assert NR % 4 == 0 $ABC = "0123456789ABCDEFGHIJKLMN" #include #include #include void xnn_f32_ppmm_ukernel_${MR}x${NR}__sse( size_t mr, size_t nc, size_t kc, const float*restrict a, const float*restrict w, float*restrict c, size_t cm_stride, size_t cn_stride, const union xnn_f32_output_params params[restrict static 1]) { assert(mr != 0); assert(mr <= ${MR}); assert(nc != 0); assert(kc != 0); assert(kc % sizeof(float) == 0); float* c0 = c; $for M in range(1, MR): float* c${M} = (float*) ((uintptr_t) c${M-1} + cm_stride); $if M % 2 == 0: if XNN_UNPREDICTABLE(mr <= ${M}) { c${M} = c${M-1}; } $elif M + 1 == MR: if XNN_UNPREDICTABLE(mr != ${M+1}) { c${M} = c${M-1}; } $else: if XNN_UNPREDICTABLE(mr < ${M+1}) { c${M} = c${M-1}; } do { __m128 vacc0x${ABC[0:4]} = _mm_load_ps(w); $for N in range(4, NR, 4): __m128 vacc0x${ABC[N:N+4]} = _mm_load_ps(w + ${N}); $for M in range(1, MR): $for N in range(0, NR, 4): __m128 vacc${M}x${ABC[N:N+4]} = vacc0x${ABC[N:N+4]}; w += ${NR}; size_t k = kc; do { const __m128 va${ABC[0:4]} = _mm_load_ps(a); $for M in range(4, MR, 4): const __m128 va${ABC[M:M+4]} = _mm_load_ps(a + ${M}); a += ${MR}; const __m128 vb${ABC[0:4]} = _mm_load_ps(w); $for N in range(4, NR, 4): const __m128 vb${ABC[N:N+4]} = _mm_load_ps(w + ${N}); w += ${NR}; $for M in range(MR): $MMMM = str(M) * 4 const __m128 va${MMMM} = _mm_shuffle_ps(va${ABC[M&-4:4+M&-4]}, va${ABC[M&-4:4+M&-4]}, _MM_SHUFFLE(${M % 4}, ${M % 4}, ${M % 4}, ${M % 4})); $for N in range(0, NR, 4): $for M in range(MR): $MMMM = str(M) * 4 vacc${M}x${ABC[N:N+4]} = _mm_add_ps(vacc${M}x${ABC[N:N+4]}, _mm_mul_ps(va${MMMM}, vb${ABC[N:N+4]})); k -= sizeof(float); } while (k != 0); const __m128 vmax = _mm_load_ps(params->sse.max); $for N in range(0, NR, 4): $for M in range(MR): vacc${M}x${ABC[N:N+4]} = _mm_min_ps(vacc${M}x${ABC[N:N+4]}, vmax); const __m128 vmin = _mm_load_ps(params->sse.min); $for N in range(0, NR, 4): $for M in range(MR): vacc${M}x${ABC[N:N+4]} = _mm_max_ps(vacc${M}x${ABC[N:N+4]}, vmin); if XNN_LIKELY(nc >= ${NR}) { $for M in reversed(range(MR)): _mm_storeu_ps(c${M}, vacc${M}x${ABC[0:4]}); $for N in range(4, NR, 4): _mm_storeu_ps(c${M} + ${N}, vacc${M}x${ABC[N:N+4]}); a = (const float*) ((uintptr_t) a - kc * ${MR}); $for M in reversed(range(MR)): c${M} = (float*) ((uintptr_t) c${M} + cn_stride); nc -= ${NR}; } else { $for LOG2N in reversed(range(NR.bit_length())): $if NR != 1 << LOG2N: if (nc & ${1 << LOG2N}) { $if LOG2N >= 2: $for M in reversed(range(MR)): _mm_storeu_ps(c${M}, vacc${M}x${ABC[0:4]}); $for N in range(4, 1 << LOG2N, 4): _mm_storeu_ps(c${M} + ${N}, vacc${M}x${ABC[N:N+4]}); $for M in reversed(range(MR)): $for N in range(0, 1 << (LOG2N - 1), 4): vacc${M}x${ABC[N:N+4]} = vacc${M}x${ABC[N + (1 << LOG2N):N + (1 << LOG2N)+4]}; $for M in reversed(range(MR)): c${M} += ${1 << LOG2N}; $elif LOG2N == 1: $for M in reversed(range(MR)): _mm_storel_pi((__m64*) c${M}, vacc${M}x${ABC[0:4]}); $for M in reversed(range(MR)): vacc${M}x${ABC[0:4]} = _mm_movehl_ps(vacc${M}x${ABC[0:4]}, vacc${M}x${ABC[0:4]}); $for M in reversed(range(MR)): c${M} += 2; $elif LOG2N == 0: $for M in reversed(range(MR)): _mm_store_ss(c${M}, vacc${M}x${ABC[0:4]}); } nc = 0; } } while (nc != 0); }