#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <time.h>

const int m_rows = 40000;
const int m_cols = m_rows;

_Atomic int hv = 0;
int **matrix;


int main(void){
  printf("1st --> Allocate memory\n");
  clock_t t_t1; t_t1 = clock();
  size_t rows_size = m_rows * sizeof(int*);
  matrix = malloc(rows_size);
  if(matrix == NULL){
    perror("malloc failled");
    return 1;
  }
  size_t data_size = (size_t)m_rows * m_cols * sizeof(int);
  int *data;
  if(posix_memalign((void**)&data, 64, data_size) != 0){
    perror("not able to alocate memory");
    free(matrix);
    return 1;
  }
  t_t1 = clock() - t_t1;
  double t1_ttaken = ((double)t_t1)/CLOCKS_PER_SEC;
  printf(" %f sec\n",t1_ttaken);

  printf("2nd --> Populate the matrix\n");
  clock_t t_t2; t_t2 = clock();
  for(int r = 0; r<m_rows;r++){
    matrix[r] = data + r * m_cols;
  }
  for(int r = 0; r < m_rows; r++){  
    for(int c = 0; c < m_cols; c++){
      matrix[r][c] = r*m_cols+c;
    }
  }
  t_t2 = clock() - t_t2;
  double t2_ttaken = ((double)t_t2)/CLOCKS_PER_SEC; 
  printf(" %f sec\n",t2_ttaken);  

  
  printf("3rd --> Search matrix\n");
  clock_t t_t3; t_t3 = clock();
  for(int r = 0; r < m_rows; r++){
    for(int c = 0; c < m_cols; c++){
      if(matrix[r][c] > hv){
        hv = matrix[r][c];
      }
    }
  }
  t_t3 = clock() - t_t3;
  double t3_ttaken = ((double)t_t3)/CLOCKS_PER_SEC;
  printf(" %f sec\n",t3_ttaken);
 
  printf("Done\n The biggest value found is  %d", hv); 
  free(data);
  free(matrix);
  return 0;
}