// Auto-generated file. Do not edit! // Template: src/x32-packw/scalar.c.in // Generator: tools/xngen // // Copyright 2023 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. #include #include #include #include "xnnpack/math.h" #include "xnnpack/packw.h" void xnn_x32_packw_gemm_goi_ukernel_x4__scalar_int_u4( size_t g, size_t nc, size_t kc, size_t nr, size_t kr, size_t sr, const uint32_t* weights, const uint32_t* bias, const void* scale, uint32_t* packed_weights, size_t extra_bytes, const void* params) { assert(g != 0); assert(nc != 0); assert(kc != 0); assert(nr == 4); assert(kr == 1); assert(sr == 1); assert(weights != NULL); assert(packed_weights != NULL); uint32_t* out = (uint32_t*) packed_weights; const uint32_t* b = (const uint32_t*) bias; do { // NC main loop multiple of 4 const uint32_t* w0 = (const uint32_t*) weights; size_t n = nc; for (;n >= 4; n -= 4) { if XNN_LIKELY(b != NULL) { out[0] = b[0]; out[1] = b[1]; out[2] = b[2]; out[3] = b[3]; b += 4; } else { out[0] = 0; out[1] = 0; out[2] = 0; out[3] = 0; } out += 4; const uint32_t* w1 = w0 + kc; const uint32_t* w2 = w1 + kc; const uint32_t* w3 = w2 + kc; // KC main loop multiple of 4x4 size_t k = kc; for (; k >= 4; k -= 4) { const uint32_t v00 = w0[0]; const uint32_t v01 = w0[1]; const uint32_t v02 = w0[2]; const uint32_t v03 = w0[3]; w0 += 4; const uint32_t v10 = w1[0]; const uint32_t v11 = w1[1]; const uint32_t v12 = w1[2]; const uint32_t v13 = w1[3]; w1 += 4; const uint32_t v20 = w2[0]; const uint32_t v21 = w2[1]; const uint32_t v22 = w2[2]; const uint32_t v23 = w2[3]; w2 += 4; const uint32_t v30 = w3[0]; const uint32_t v31 = w3[1]; const uint32_t v32 = w3[2]; const uint32_t v33 = w3[3]; w3 += 4; out[0] = v00; out[1] = v10; out[2] = v20; out[3] = v30; out[4] = v01; out[5] = v11; out[6] = v21; out[7] = v31; out[8] = v02; out[9] = v12; out[10] = v22; out[11] = v32; out[12] = v03; out[13] = v13; out[14] = v23; out[15] = v33; out += 16; } // KC remainder for (; k != 0; --k) { const uint32_t v0 = *w0++; out[0] = v0; const uint32_t v1 = *w1++; out[1] = v1; const uint32_t v2 = *w2++; out[2] = v2; const uint32_t v3 = *w3++; out[3] = v3; out += 4; } out = (uint32_t*) ((uintptr_t) out + extra_bytes); w0 = w3; } // NC remainder (1..3) if XNN_UNLIKELY(n != 0) { if XNN_LIKELY(b != NULL) { size_t nb = n; do { *out++ = *b++; } while (--nb != 0); } else { size_t nb = n; do { *out++ = 0; } while (--nb != 0); } out += (4 - n); // NR remainder has less than 4 rows so last row is not loaded const uint32_t* w1 = w0 + kc; if XNN_UNPREDICTABLE(n < 2) { w1 = w0; } const uint32_t* w2 = w1 + kc; if XNN_UNPREDICTABLE(n <= 2) { w2 = w1; } // KC main loop multiple of 4x4 size_t k = kc; for (; k >= 4; k -= 4) { const uint32_t v00 = w0[0]; const uint32_t v01 = w0[1]; const uint32_t v02 = w0[2]; const uint32_t v03 = w0[3]; w0 += 4; const uint32_t v10 = w1[0]; const uint32_t v11 = w1[1]; const uint32_t v12 = w1[2]; const uint32_t v13 = w1[3]; w1 += 4; const uint32_t v20 = w2[0]; const uint32_t v21 = w2[1]; const uint32_t v22 = w2[2]; const uint32_t v23 = w2[3]; w2 += 4; out[0] = v00; out[1] = v10; out[2] = v20; out[4] = v01; out[5] = v11; out[6] = v21; out[8] = v02; out[9] = v12; out[10] = v22; out[12] = v03; out[13] = v13; out[14] = v23; out += 16; } // KC remainder of 1..3 for (; k != 0; --k) { const uint32_t v0 = *w0++; out[0] = v0; const uint32_t v1 = *w1++; out[1] = v1; const uint32_t v2 = *w2++; out[2] = v2; out += 4; } out = (uint32_t*) ((uintptr_t) out + extra_bytes); } weights += nc * kc; } while (--g != 0); }