哲学家问题的算法

#define N 5
#define LEFT (i-1)%N
#define RIGHT (i+1)%N
#define THINKING 0
#define HUNGRY 1
#define EATING 2
int state[N];

void philosopher(int i)
{
   while(TRUE)
   {
       think();
       take_forks();
       eat();
       put_forks(i);
   }
}


void take_forks(int i)
{
   down(&mutex);
   state[i]=HUNGRY;
   test(i);
   up(&mutex);
   down(&s[i]);
}


void put_forks(int i)
{
   down(&mutex);
   state[i]=THINKING;
   test(LEFT);
   test(RIGHT);
   up(&mutex);
}


void test(i)
{
   if(state[i]==HUNGRY && state[LEFT]!=EATING && state[RIGHT]!=EATING)
   {
       state[i]=EATING;
       up(&s[i]);
   }
}

文章来源于领测软件测试网 https://www.ltesting.net/