forked from remzi-arpacidusseau/ostep-code
-
Notifications
You must be signed in to change notification settings - Fork 0
/
pc_single_cv.c
108 lines (92 loc) · 2.32 KB
/
pc_single_cv.c
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
101
102
103
104
105
106
107
#include <assert.h>
#include <pthread.h>
#include <semaphore.h>
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include "common.h"
#include "common_threads.h"
int max;
int loops;
int *buffer;
int use_ptr = 0;
int fill_ptr = 0;
int num_full = 0;
pthread_cond_t cv = PTHREAD_COND_INITIALIZER;
pthread_mutex_t m = PTHREAD_MUTEX_INITIALIZER;
int consumers = 1;
int verbose = 1;
void do_fill(int value) {
buffer[fill_ptr] = value;
fill_ptr = (fill_ptr + 1) % max;
num_full++;
}
int do_get() {
int tmp = buffer[use_ptr];
use_ptr = (use_ptr + 1) % max;
num_full--;
return tmp;
}
void *producer(void *arg) {
int i;
for (i = 0; i < loops; i++) {
Mutex_lock(&m); // p1
while (num_full == max) // p2
Cond_wait(&cv, &m); // p3
do_fill(i); // p4
Cond_signal(&cv); // p5
Mutex_unlock(&m); // p6
}
// end case: put an end-of-production marker (-1)
// into shared buffer, one per consumer
for (i = 0; i < consumers; i++) {
Mutex_lock(&m);
while (num_full == max)
Cond_wait(&cv, &m);
do_fill(-1);
Cond_signal(&cv);
Mutex_unlock(&m);
}
return NULL;
}
void *consumer(void *arg) {
int tmp = 0;
// consumer: keep pulling data out of shared buffer
// until you receive a -1 (end-of-production marker)
while (tmp != -1) {
Mutex_lock(&m); // c1
while (num_full == 0) // c2
Cond_wait(&cv, &m); // c3
tmp = do_get(); // c4
Cond_signal(&cv); // c5
Mutex_unlock(&m); // c6
}
return NULL;
}
int
main(int argc, char *argv[])
{
if (argc != 4) {
fprintf(stderr, "usage: %s <buffersize> <loops> <consumers>\n", argv[0]);
exit(1);
}
max = atoi(argv[1]);
loops = atoi(argv[2]);
consumers = atoi(argv[3]);
buffer = (int *) malloc(max * sizeof(int));
assert(buffer != NULL);
int i;
for (i = 0; i < max; i++) {
buffer[i] = 0;
}
pthread_t pid, cid[consumers];
Pthread_create(&pid, NULL, producer, NULL);
for (i = 0; i < consumers; i++) {
Pthread_create(&cid[i], NULL, consumer, (void *) (long long int) i);
}
Pthread_join(pid, NULL);
for (i = 0; i < consumers; i++) {
Pthread_join(cid[i], NULL);
}
return 0;
}