- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
- 46
- 47
- 48
- 49
- 50
- 51
- 52
- 53
- 54
- 55
- 56
- 57
- 58
- 59
- 60
- 61
- 62
- 63
- 64
- 65
- 66
- 67
- 68
- 69
- 70
- 71
- 72
- 73
- 74
- 75
- 76
- 77
- 78
- 79
- 80
- 81
- 82
- 83
- 84
- 85
- 86
- 87
- 88
- 89
- 90
- 91
- 92
- 93
- 94
- 95
- 96
- 97
- 98
- 99
- 100
#include <pthread.h>
#include <stdio.h>
#include <semaphore.h>
#include <unistd.h>
typedef struct _ph_fork {
int number;
sem_t is_free;
} ph_fork;
typedef enum state {
EATING,
THINKING
} state;
typedef struct _philosopher {
int number;
int ph_fork_amount;
int ph_forks[2];
int times_eaten;
int times_thought;
state st;
pthread_t thread;
} philosopher;
ph_fork* f_arr[5] = {0};
philosopher* ph_arr[5] = {0};
void* routine(void* arg) {
philosopher* ph = (philosopher*)arg;
int frks[2] = {0};
frks[0] = ph->ph_forks[0];
frks[1] = ph->ph_forks[1];
int ph_fork_left_odd = frks[0] % 2;
int ph_fork_right_odd = frks[1] % 2;
printf("Philosopher %d has taken a seat at the table.\n", ph->number);
for (int i = 0; i < 72; i++) {
if (!(ph_fork_left_odd && ph_fork_right_odd)) {
if (ph_fork_left_odd) {
sem_wait(&f_arr[frks[0] - 1]->is_free);
printf("Philosopher %d takes left fork…\n", ph->number);
ph->ph_fork_amount++;
sem_wait(&f_arr[frks[1] - 1]->is_free);
printf("Philosopher %d takes right fork…\n", ph->number);
ph->ph_fork_amount++;
}
if (ph_fork_right_odd) {
sem_wait(&f_arr[frks[1] - 1]->is_free);
printf("Philosopher %d takes right fork…\n", ph->number);
ph->ph_fork_amount++;
sem_wait(&f_arr[frks[0] - 1]->is_free);
printf("Philosopher %d takes left fork…\n", ph->number);
ph->ph_fork_amount++;
}
} else { // Special case when both ph_forks are odd
sem_wait(&f_arr[frks[0] - 1]->is_free);
printf("Philosopher %d takes left fork…\n", ph->number);
ph->ph_fork_amount++;
sem_wait(&f_arr[frks[1] - 1]->is_free);
printf("Philosopher %d takes right fork…\n", ph->number);
ph->ph_fork_amount++;
}
if (ph->ph_fork_amount == 2) {
ph->st = EATING;
ph->times_eaten++;
printf("Philosopher %d is eating…\n", ph->number);
sleep(1);
};
if (!(ph_fork_left_odd && ph_fork_right_odd)) {
if (ph_fork_left_odd) {
printf("Philosopher %d puts back left fork…\n", ph->number);
sem_post(&f_arr[frks[0] - 1]->is_free);
ph->ph_fork_amount--;
printf("Philosopher %d puts back right fork…\n", ph->number);
sem_post(&f_arr[frks[1] - 1]->is_free);
ph->ph_fork_amount--;
}
if (ph_fork_right_odd) {
printf("Philosopher %d puts back right fork…\n", ph->number);
sem_post(&f_arr[frks[1] - 1]->is_free);
ph->ph_fork_amount--;
printf("Philosopher %d puts back left fork…\n", ph->number);
sem_post(&f_arr[frks[0] - 1]->is_free);
ph->ph_fork_amount--;
}
} else { // Special case when both ph_forks are odd
printf("Philosopher %d puts back left fork…\n", ph->number);
sem_post(&f_arr[frks[0] - 1]->is_free);
ph->ph_fork_amount--;
printf("Philosopher %d puts back right fork…\n", ph->number);
sem_post(&f_arr[frks[1] - 1]->is_free);
ph->ph_fork_amount--;
}
if (ph->ph_fork_amount == 0) {
ph->st = THINKING;
printf("Philosopher %d is thinking…\n", ph->number);
ph->times_thought++;
sleep(1);
}
}
printf("Philosopher %d has finished his lunch and left.\n", ph->number);
return NULL;
};
Комментарии (0) RSS