// testingm.cpp
// This tests multiple use of the same barrier 

#include <iostream>
using namespace std;

#include <math.h>
#include "utility.h"
#include "sbarrier.h"

const int nproc = 5;
Barrier* b;  // declare a barrier.

int main()
{
	int i;
   int id;
   int shareid;

   b = (Barrier*)shareint(sizeof(Barrier), shareid);

          // Note that the size of barrier is 16 bytes.
          //     Four integers defined in the barrier.

   b->Barrierinit(5);   //Initialize the barrier to
                    //   block 5 processes.


   id=process_fork(5);


         //STEP I of the computation using 5 processes

    cout<<id<<"  arriving at first barrier"<< endl; 
    // Note the arrival of processes at first barrier ?

    b->WaitAtBarrier();  // Block the processes till
                        //   all of them reach this point

    cout<<id<<" releasing the first barrier" <<endl;  
   // Note the processes released from the first barrier
   

    cout<<id<<"  arriving at next barrier"<< endl; 
    // Note the arrival of processes 

    b->WaitAtBarrier(); //Reuse the barrier to block all the processes

    cout<<id<<" releasing the second time"<<endl;   
				// Note the order of processes
                       //  as they are released again for the second time


   clean_up_shared(shareid);

           b->SemRelease();             // Release Semaphore used in
                                        //   the barrier

   return 0;
}