#include "internal.h"





/****************************************************************************/
void benchmark_lfds611_queue( void )
{
  unsigned int
    loop,
    thread_count,
    cpu_count;

  struct lfds611_queue_state
    *qs;

  struct lfds611_queue_benchmark
    *qb;

  thread_state_t
    *thread_handles;

  lfds611_atom_t
    total_operations_for_full_test_for_all_cpus,
    total_operations_for_full_test_for_all_cpus_for_one_cpu = 0;

  double
    mean_operations_per_second_per_cpu,
    difference_per_second_per_cpu,
    total_difference_per_second_per_cpu,
    std_dev_per_second_per_cpu,
    scalability;

  /* TRD : here we benchmark the queue

           the benchmark is to have a single queue
           where a worker thread busy-works dequeuing and then queuing
  */

  cpu_count = abstraction_cpu_count();

  thread_handles = (thread_state_t *) malloc( sizeof(thread_state_t) * cpu_count );

  qb = (struct lfds611_queue_benchmark *) malloc( sizeof(struct lfds611_queue_benchmark) * cpu_count );

  // TRD : print the benchmark ID and CSV header
  printf( "\n"
          "Release %s Queue Benchmark #1\n"
          "CPUs,total ops,mean ops/sec per CPU,standard deviation,scalability\n", LFDS611_RELEASE_NUMBER_STRING );

  // TRD : we run CPU count times for scalability
  for( thread_count = 1 ; thread_count <= cpu_count ; thread_count++ )
  {
    // TRD : initialisation
    lfds611_queue_new( &qs, 1000 );

    for( loop = 0 ; loop < cpu_count ; loop++ )
    {
      (qb+loop)->qs = qs;
      (qb+loop)->operation_count = 0;
    }

    // TRD : populate the queue (we don't actually use the user data)
    for( loop = 0 ; loop < 500 ; loop++ )
      lfds611_queue_enqueue( qs, (void *) (lfds611_atom_t) loop );

    // TRD : main test
    for( loop = 0 ; loop < thread_count ; loop++ )
      abstraction_thread_start( &thread_handles[loop], loop, benchmark_lfds611_queue_thread_delfds611_queue_and_enqueue, qb+loop );

    for( loop = 0 ; loop < thread_count ; loop++ )
      abstraction_thread_wait( thread_handles[loop] );

    // TRD : post test math
    total_operations_for_full_test_for_all_cpus = 0;
    total_difference_per_second_per_cpu = 0;

    for( loop = 0 ; loop < thread_count ; loop++ )
      total_operations_for_full_test_for_all_cpus += (qb+loop)->operation_count;

    mean_operations_per_second_per_cpu = ((double) total_operations_for_full_test_for_all_cpus / (double) thread_count) / (double) 10;

    if( thread_count == 1 )
      total_operations_for_full_test_for_all_cpus_for_one_cpu = total_operations_for_full_test_for_all_cpus;

    for( loop = 0 ; loop < thread_count ; loop++ )
    {
      difference_per_second_per_cpu = ((double) (qb+loop)->operation_count / (double) 10) - mean_operations_per_second_per_cpu;
      total_difference_per_second_per_cpu += difference_per_second_per_cpu * difference_per_second_per_cpu;
    }

    std_dev_per_second_per_cpu = sqrt( (double) total_difference_per_second_per_cpu );

    scalability = (double) total_operations_for_full_test_for_all_cpus / (double) (total_operations_for_full_test_for_all_cpus_for_one_cpu * thread_count);

    printf( "%u,%u,%.0f,%.0f,%0.2f\n", thread_count, (unsigned int) total_operations_for_full_test_for_all_cpus, mean_operations_per_second_per_cpu, std_dev_per_second_per_cpu, scalability );

    // TRD : cleanup
    lfds611_queue_delete( qs, NULL, NULL );
  }

  free( qb );

  free( thread_handles );

  return;
}





/****************************************************************************/
thread_return_t CALLING_CONVENTION benchmark_lfds611_queue_thread_delfds611_queue_and_enqueue( void *queue_benchmark )
{
  struct lfds611_queue_benchmark
    *qb;

  void
    *user_data;

  time_t
    start_time;

  assert( queue_benchmark != NULL );

  qb = (struct lfds611_queue_benchmark *) queue_benchmark;

  time( &start_time );

  while( time(NULL) < start_time + 10 )
  {
    lfds611_queue_dequeue( qb->qs, &user_data );
    lfds611_queue_enqueue( qb->qs, user_data );

    qb->operation_count += 2;
  }

  return( (thread_return_t) EXIT_SUCCESS );
}