#define NUMPREDS 5000
#define NUMSUBS 3000
#define NUMARRAYS 4
#define UNFOLD 8

#include <stdio.h>
#include <stdlib.h>
#include <sys/resource.h>
#include <sys/types.h>
#include <time.h>

#include "k20.h"

char p[NUMPREDS];
char* myarray[NUMARRAYS][NUMSUBS];
int answer[NUMSUBS+1];

void init(float prob)
{
  int i,j;

  for(i=0;i<NUMPREDS;i++) {
    p[i] = (random() < prob*RAND_MAX);
  }

  for(i=0;i<NUMARRAYS;i++) {
    for(j=0;j<NUMSUBS;j++) {
      myarray[i][j] = &p[random() % NUMPREDS];
    }
  }

  for(j=0;j<NUMSUBS;j++) {
    answer[j] = -2;
  }
}

void mruntest(int repeats)
{

  int i,j;
  int iter;
  int ansindex;

  for(iter=1;iter<=repeats;iter++) {
    ansindex=0;

    for(j=0;j<NUMSUBS;j++) {
      for(i=0;i<NUMARRAYS;i++) {
	if(!(*myarray[i][j])) goto next;
      }
      answer[ansindex++] = j;
    next:;
    }
    answer[ansindex++]=-1;
  }
}

void runtest(int repeats)
{ /* specialized for NUMARRAYS=4 */

  int j;
  int iter;
  int ansindex;

  for(iter=1;iter<=repeats;iter++) {
    ansindex=0;

    for(j=0;j<NUMSUBS;j++) {
      if(
#ifdef LOGICALAND
	 (*myarray[0][j]) & (*myarray[1][j]) & (*myarray[2][j]) & (*myarray[3][j])
#else
	 (*myarray[0][j]) && (*myarray[1][j]) && (*myarray[2][j]) && (*myarray[3][j])
#endif
	 )
	{ answer[ansindex++] = j; }
    }
  }
}

K cruntest(K myarray, K preds, K kAnswer) {
  // specialized for NUMARRAYS=4 
  int j;
  int iter;
  int ansindex;

  ansindex=0;

  // printf("%d %d\n", KI((KK(myarray)[0]))[0], KI((KK(myarray)[0]))[1]);
  // printf("%d %d\n", KI(preds)[KI((KK(myarray)[0]))[0]], KI(preds)[KI((KK(myarray)[0]))[1]]);

  for(j=0;j<NUMSUBS;j++) {
    if(
#ifdef LOGICALAND
       (KI(preds)[KI((KK(myarray)[0]))[j]]) & (KI(preds)[KI((KK(myarray)[2]))[j]]) &
       (KI(preds)[KI((KK(myarray)[1]))[j]]) & (KI(preds)[KI((KK(myarray)[3]))[j]])
#else
       (KI(preds)[KI((KK(myarray)[0]))[j]]) && (KI(preds)[KI((KK(myarray)[2]))[j]]) &&
       (KI(preds)[KI((KK(myarray)[1]))[j]]) && (KI(preds)[KI((KK(myarray)[3]))[j]])
#endif
       )
      { KI(kAnswer)[ansindex++] = j; }
  }

  return gi(ansindex);
}

int main(int argc, char**argv)
{
  time_t starttime;
  time_t endtime;
  struct rusage startusage;
  struct rusage endusage;

  int iterations = 10000;
  int verbose = 1;
  float prob = 0.02;

  if (argc>1) {
    verbose=0;
    sscanf(argv[1],"%f",&prob);
  }

  init(prob);

  getrusage(RUSAGE_SELF, &startusage); time(&starttime);

  runtest(iterations);

  getrusage(RUSAGE_SELF, &endusage); time(&endtime);

  if (verbose) {
    printf("user, sys, elapsed: %f %f %d \n",
	   (endusage.ru_utime.tv_sec-startusage.ru_utime.tv_sec) +
	   (endusage.ru_utime.tv_usec-startusage.ru_utime.tv_usec)/1000000.0,
	   (endusage.ru_stime.tv_sec-startusage.ru_stime.tv_sec) +
	   (endusage.ru_stime.tv_usec-startusage.ru_stime.tv_usec)/1000000.0,
	   endtime - starttime);
    
    printf("CPU per subscription: %f \n",
	   (endusage.ru_utime.tv_sec-startusage.ru_utime.tv_sec +
	    (endusage.ru_utime.tv_usec-startusage.ru_utime.tv_usec)/1000000.0)
	   /iterations);
  }
  else {
    printf("%f %f\n",prob,(endusage.ru_utime.tv_sec-startusage.ru_utime.tv_sec +
			   (endusage.ru_utime.tv_usec-startusage.ru_utime.tv_usec)/1000000.0)
	   /iterations);
  }
    
}