Do we need to compile a .o object from mbarrier.h to use barriers in .cpp files?  Or does #include "mbarrier.h" within testmb.cpp suffice?

So far, I've tried 

>g++ -o testmb testmb.cpp util.o

and I get a long error message.  What do I type into the command line to run testmb.cpp?  

So to clarify, we need to modify the original file testmb.cpp on Dr. Pamula's site??

I have modified testmb.cpp to include:

#include "utility.h"

extern "C"{

..

..

}

but I'm still getting the same compilation error

Also, in testmb.cpp, the original code for Barrierinit() is:

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

You changed this to 

b[0]->Barrierinit(6);  ???

I also included "#include "mbarrier.h".

Below is the testmb.cpp I have, and below that is the output I get.:

----------------

#include <math.h>^M
#include <iostream>^M
using namespace std;^M
^M
#include "mbarrier.h"^M
#include "utility.h"^M
extern "C" {
    int process_fork(int nproc);
    void process_join(int nproc, int id);
    int *shareint(int size, int& id);
    int *sharerealarray(int size, int& id);
    int *sharelist (int size, int& id);
    int *sharereal(int size, int& id);
    void spin_lock_init(int& lock, int condition);
    void spin_lock(int lock);
    void spin_unlock(int lock);
    void clean_up_shared(int id);
    void clean_up_sem(int id);
}
const int nproc = 5;^M
Barrier* b;  // declare a barrier.^M
^M
int main()^M
{^M
        int i;^M
   int id;^M
   int shareid;^M
^M
   b = (Barrier*)sharelist(sizeof(Barrier)*3, shareid);^M
^M
          // Note that the size of barrier is 16 bytes.^M
          //     Four integers defined in the barrier.^M
^M
   b[0].Barrierinit(6);   //Initialize the barrier to^M
                    //   block 6 processes.^M
^M
^M
   id=process_fork(6);^M
^M
^M
         //STEP I of the computation using 6 processes^M
^M
    cout<<id<<"  arriving at first barrier"<< endl; ^M
    // Note the arrival of processes at first barrier ?^M
^M
    b[0].WaitAtBarrier();  // Block the processes till^M
                        //   all of them reach this point^M
^M
    cout<<id<<" releasing the first barrier" <<endl;  ^M
   // Note the processes released from the first barrier^M

 ^M
^M
    cout<<id<<"  arriving at next barrier"<< endl; ^M
    // Note the arrival of processes ^M
^M
    b[0].WaitAtBarrier(); //Reuse the barrier to block all the processes^M
^M
    cout<<id<<" releasing the second time"<<endl;   ^M
                                // Note the order of processes^M
                       //  as they are released again for the second time^M
^M
^M
   clean_up_shared(shareid);^M
^M
           b[0].SemRelease();             // Release Semaphore used in^M
                                        //   the barrier^M
    return 0;^M
^M
^M
}^M

-------------------------------------

1  arriving at first barrier
2  arriving at first barrier
3  arriving at first barrier
4  arriving at first barrier
0  arriving at first barrier
5  arriving at first barrier
5 releasing the first barrier
5  arriving at next barrier
0 releasing the first barrier
3 releasing the first barrier
2 releasing the first barrier
3  arriving at next barrier
4 releasing the first barrier
2  arriving at next barrier
4  arriving at next barrier
0  arriving at next barrier
1 releasing the first barrier
1  arriving at next barrier
4 releasing the second time
3 releasing the second time
1 releasing the second time
2 releasing the second time
5 releasing the second time
0 releasing the second time

Please let me know if I'm misunderstainding something.

Thanks,

ahnman341 wrote:

OMG i got it to work.

 

 

<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3

<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3

<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3

<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3

<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3<3

Congratulations!