spmv_main.cpp

#include <math.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>

#include "common.h"

const int N = 1000;
const int M = 10;
const int REPEAT = 100;

extern "C" {
void spmv(uint64_t n, const uint64_t *row, const uint64_t *col,
          const double *mat, const double *x, double *y);
void spmv_compiler_vectorize(uint64_t n, const uint64_t *row,
                             const uint64_t *col, const double *mat,
                             const double *x, double *y);
void spmv_rvv(uint64_t n, const uint64_t *row, const uint64_t *col,
              const double *mat, const double *x, double *y);
void spmv_rvv2(uint64_t n, const uint64_t *row, const uint64_t *col,
               const double *mat, const double *x, double *y);
}

int main() {
  uint64_t row[N + 1];
  uint64_t col[N * M];
  double mat[N * M];
  double x[N];

  double y[N];
  double y1[N];

  // each row has M non zero elements
  for (int i = 0; i < N; i++) {
    row[i] = i * M;
    for (int j = 0; j < M; j++) {
      mat[i * M + j] = (double)rand() / RAND_MAX;
      col[i * M + j] = rand() % N;
    }
    x[i] = (double)rand() / RAND_MAX;
    y[i] = 0.0;
    y1[i] = 0.0;
  }
  row[N] = M * N;

  spmv(N, row, col, mat, x, y);

  spmv_compiler_vectorize(N, row, col, mat, x, y1);

  for (int i = 0; i < N; i++) {
    if (fabs(y[i] - y1[i]) > 1e-6) {
      printf("Mismatch at %d: %lf and %lf\n", i, y[i], y1[i]);
      return 1;
    }
  }

  // check answer
  spmv_rvv(N, row, col, mat, x, y1);

  for (int i = 0; i < N; i++) {
    if (fabs(y[i] - y1[i]) > 1e-6) {
      printf("Mismatch at %d: %lf and %lf\n", i, y[i], y1[i]);
      return 1;
    }
  }

  spmv_rvv2(N, row, col, mat, x, y1);
  for (int i = 0; i < N; i++) {
    if (fabs(y[i] - y1[i]) > 1e-6) {
      printf("Mismatch at %d: %lf and %lf\n", i, y[i], y1[i]);
      return 1;
    }
  }

  printf("Test passed!\n");

  uint64_t begin = get_time_us();
  for (int i = 0; i < REPEAT; i++) {
    spmv(N, row, col, mat, x, y1);
  }
  uint64_t elapsed = get_time_us() - begin;
  double gflops = 2e-3 * N * M * REPEAT / elapsed;
  printf("spmv disable vectorize: %.2f us %.2f gflops\n", (double)elapsed / REPEAT,
         gflops);

  begin = get_time_us();
  for (int i = 0; i < REPEAT; i++) {
    spmv_compiler_vectorize(N, row, col, mat, x, y1);
  }
  elapsed = get_time_us() - begin;
  gflops = 2e-3 * N * M * REPEAT / elapsed;
  printf("spmv compiler vectorize: %.2f us %.2f gflops\n", (double)elapsed / REPEAT, gflops);

  begin = get_time_us();
  for (int i = 0; i < REPEAT; i++) {
    spmv_rvv(N, row, col, mat, x, y1);
  }
  elapsed = get_time_us() - begin;
  gflops = 2e-3 * N * M * REPEAT / elapsed;
  printf("spmv rvv: %.2f us %.2f gflops\n", (double)elapsed / REPEAT, gflops);

  begin = get_time_us();
  for (int i = 0; i < REPEAT; i++) {
    spmv_rvv2(N, row, col, mat, x, y1);
  }
  elapsed = get_time_us() - begin;
  gflops = 2e-3 * N * M * REPEAT / elapsed;
  printf("spmv rvv2: %.2f us %.2f gflops\n", (double)elapsed / REPEAT, gflops);

  return 0;
}