Search  

---

C:/temp/src/j2k/nto/bakJuly/Basic_Test.cpp

Go to the documentation of this file.

#ifndef __J2K__Basic_Test_CPP__
#define __J2K__Basic_Test_CPP__


#include <j2k/Fred/Standard.hpp>
#include <j2k/nto/Basic_PThread.hpp>
#include <j2k/nto/Mutex.hpp>

/*
 * Objectives:
 *   - See if each thread runs or get enough CPU time
 *   - See the behavior of the scheduler
 *
 * Display:
 *   111111111111   ( Thread 1 running )
 *   222222222222   ( Thread 2 running )
 *   333333333333   ( Thread 3 running )
 *   444444444444   ( Thread 4 running )
 *   555555555555   ( Thread 5 running )
 *   ............   ( Parent   running, i.e. the main() { } )
 *
 */


#define MAX  100

Mutex ml;
int p = 100;

class Fred : public Basic_PThread 
{
public:
   Fred( char* n = ".", int a = 0 ) : Basic_PThread(), s( n ) { } 

   virtual void run() {
     for(;;) {
   for( int i = 0; i < 10; i++ ) {
           ml.lock();
           printf("%s", s);
      ml.unlock();
        }
     
        sched_yield();
     }
   } 

   char* s;
   int   amount;
};

int main( int argc = 0, char* argv[] = NULL) 
{
  Fred*  t1 = new Fred( "1",  10 );
  Fred*  t2 = new Fred( "2", -20 );
  Fred*  t3 = new Fred( "3", -20 );
  Fred*  t4 = new Fred( "4", -20 );
  Fred*  t5 = new Fred( "5", -20 );

  t1->start();
  t2->start();
  t3->start();
  t4->start();
  t5->start();

  t1->join();
  t2->join();
  t3->join();
  t4->join();
  t5->join();

  printf("t1-5 started.\n\n");

  int max = MAX;

  setprio( 0, getprio( 0 ) - 1 );

  for( int i = 0; i < max; i++ ) { 
   printf( "." );
   sched_yield();
  }

  return 0;
}

#endif

---