Files
kernels/benchmarks/vector/sgemm_nn/vx_vec_sgemm_nn.c
2019-11-24 09:05:07 -05:00

96 lines
2.2 KiB
C

#include <stdio.h>
#include <stdlib.h>
#include "../../../runtime/intrinsics/vx_intrinsics.h"
#include "vx_vec_sgemm_nn.h"
//---------------------------------------------------------------
/* # void sgemm_nn(size_t n, size_t m, size_t k,
# int *a, // m * k matri size_t lda,
# int *b, // k * n matrix size_t ldb,
# int *c, // m * n matrix size_t ldc)
# c += a*b (alpha=1, no transpose on input matrices)
# matrices stored in C row-major order */
//---------------------------------------------------------------
int main()
{
vx_tmc(1);
int m = 3;
int k = 3;
int n = 3;
int* a1 = (int*)malloc(sizeof(int) * m * k);
int* b1 = (int*)malloc(sizeof(int) * k * n);
int* c1 = (int*)malloc(sizeof(int) * m * n);
int* d1 = (int*)malloc(sizeof(int) * m * n); //verfication
for (int i = 0; i < (m * k); ++i) a1[i] = i;
for (int i = 0; i < (k * n); ++i) b1[i] = 1;
for (int i = 0; i < (m * n); ++i) c1[i] = 0;
for (int i = 0; i < (m * n); ++i) d1[i] = 0;
#if 1
printf("sgemm_nn\na[%d]:", m*k);
for (int i = 0; i < m*k; ++i) {
if(!(i % k)) printf("\n");
printf("%d ", a1[i]);
}
printf("\n\nb[%d]:", k*n);
for (int i = 0; i < k*n; ++i) {
if (!(i % n)) printf("\n");
printf("%d ", b1[i]);
}
#endif
vx_vec_sgemm_nn(n, m, k, a1, b1, c1);
// vx_vec_sgemm_nn(n, a1, b1, c1);
#if 1
printf("\n\nc[%d]:\n", m*n);
for (int i = 0; i < m*n; ++i) {
if (!(i % n)) printf("\n");
printf("%d ", c1[i]);
}
#endif
for (int r = 0; r < k; r++) {
for (int c = 0; c < m; c++) {
for (int i = 0; i < n; i++) {
d1[r*k+i] += a1[r*k+c]*b1[i*n+c];
}
}
}
#if 1
printf("\n\nc[%d]:\n", m*n);
for(int i = 0; i < m; ++i) {
for(int j = 0; j < n; ++j) {
printf("%d ", c1[i*m+j]);
}
printf("\n");
}
#endif
for(int i = 0; i < m*n; ++i)
{
if(c1[i] != d1[i])
{
printf("\n<sgemm_nn> FAILED at <index: %d>! \n", i);
return 1;
}
}
printf("\nPASS.......................... <sgemm_nn> \n");
free(a1); free(b1); free(c1);
vx_tmc(0);
return 0;
}