source: CIVL/examples/omp/DataRaceBench/micro-benchmarks/matrixmultiply-orig-no.c@ e5cec5ae

// Classic i-k-j matrix multiplication
#define N 100
#define M 100 
#define K 100
            
int i,j,k;  
double a[N][M],b[M][K],c[N][K];
            
int mmm()   
{           
#pragma omp parallel for private(j,k)
  for (i = 0; i < N; i++) 
    for (k = 0; k < K; k++) 
      for (j = 0; j < M; j++)
        c[i][j]= c[i][j]+a[i][k]*b[k][j];
  return 0; 
} 

int main()
{
  mmm();
  return 0;
}