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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207 | // Copyright 2021 Jeisson Hidalgo-Cespedes <jeisson.hidalgo@ucr.ac.cr> CC-BY-4
// Simulates a producer and a consumer that share a bounded buffer
// @see `man feature_test_macros`
#define _DEFAULT_SOURCE
#include <assert.h>
#include <errno.h>
#include <pthread.h>
#include <semaphore.h>
#include <stdio.h>
#include <stdlib.h>
#include <sys/random.h>
#include <unistd.h>
enum {
ERR_NOMEM_SHARED = EXIT_FAILURE + 1,
ERR_NOMEM_BUFFER,
ERR_NO_ARGS,
ERR_BUFFER_CAPACITY,
ERR_ROUND_COUNT,
ERR_MIN_PROD_DELAY,
ERR_MAX_PROD_DELAY,
ERR_MIN_CONS_DELAY,
ERR_MAX_CONS_DELAY,
ERR_CREATE_THREAD,
};
typedef struct {
size_t thread_count;
size_t buffer_capacity;
double* buffer;
size_t rounds;
useconds_t producer_min_delay;
useconds_t producer_max_delay;
useconds_t consumer_min_delay;
useconds_t consumer_max_delay;
sem_t can_produce;
sem_t can_consume;
} shared_data_t;
typedef struct {
size_t thread_number;
shared_data_t* shared_data;
} private_data_t;
int analyze_arguments(int argc, char* argv[], shared_data_t* shared_data);
int create_threads(shared_data_t* shared_data);
void* produce(void* data);
void* consume(void* data);
useconds_t random_between(useconds_t min, useconds_t max);
int main(int argc, char* argv[]) {
int error = EXIT_SUCCESS;
shared_data_t* shared_data = (shared_data_t*)
calloc(1, sizeof(shared_data_t));
if (shared_data) {
error = analyze_arguments(argc, argv, shared_data);
if (error == EXIT_SUCCESS) {
shared_data->buffer = (double*)
calloc(shared_data->buffer_capacity, sizeof(double));
if (shared_data->buffer) {
sem_init(&shared_data->can_produce, /*pshared*/ 0,
shared_data->buffer_capacity);
sem_init(&shared_data->can_consume, /*pshared*/ 0, /*value*/ 0);
unsigned int seed = 0u;
getrandom(&seed, sizeof(seed), GRND_NONBLOCK);
srandom(seed);
struct timespec start_time;
clock_gettime(/*clk_id*/CLOCK_MONOTONIC, &start_time);
error = create_threads(shared_data);
struct timespec finish_time;
clock_gettime(/*clk_id*/CLOCK_MONOTONIC, &finish_time);
double elapsed = (finish_time.tv_sec - start_time.tv_sec) +
(finish_time.tv_nsec - start_time.tv_nsec) * 1e-9;
printf("execution time: %.9lfs\n", elapsed);
sem_destroy(&shared_data->can_consume);
sem_destroy(&shared_data->can_produce);
free(shared_data->buffer);
} else {
fprintf(stderr, "error: could not create buffer\n");
error = ERR_NOMEM_BUFFER;
}
}
free(shared_data);
} else {
fprintf(stderr, "Error: could not allocate shared data\n");
error = ERR_NOMEM_SHARED;
}
return error;
}
int analyze_arguments(int argc, char* argv[], shared_data_t* shared_data) {
int error = EXIT_SUCCESS;
if (argc == 7) {
if (sscanf(argv[1], "%zu", &shared_data->buffer_capacity) != 1
|| shared_data->buffer_capacity == 0) {
fprintf(stderr, "error: invalid buffer capacity\n");
error = ERR_BUFFER_CAPACITY;
} else if (sscanf(argv[2], "%zu", &shared_data->rounds) != 1
|| shared_data->rounds == 0) {
fprintf(stderr, "error: invalid round count\n");
error = ERR_ROUND_COUNT;
} else if (sscanf(argv[3], "%u", &shared_data->producer_min_delay) != 1) {
fprintf(stderr, "error: invalid min producer delay\n");
error = ERR_MIN_PROD_DELAY;
} else if (sscanf(argv[4], "%u", &shared_data->producer_max_delay) != 1) {
fprintf(stderr, "error: invalid max producer delay\n");
error = ERR_MAX_PROD_DELAY;
} else if (sscanf(argv[5], "%u", &shared_data->consumer_min_delay) != 1) {
fprintf(stderr, "error: invalid min consumer delay\n");
error = ERR_MIN_CONS_DELAY;
} else if (sscanf(argv[6], "%u", &shared_data->consumer_max_delay) != 1) {
fprintf(stderr, "error: invalid max consumer delay\n");
error = ERR_MAX_CONS_DELAY;
}
} else {
fprintf(stderr, "usage: prod_cons_bound buffer_capacity rounds"
" producer_min_delay producer_max_delay"
" consumer_min_delay consumer_max_delay\n");
error = ERR_NO_ARGS;
}
return error;
}
int create_threads(shared_data_t* shared_data) {
assert(shared_data);
int error = EXIT_SUCCESS;
pthread_t producer, consumer;
error = pthread_create(&producer, /*attr*/ NULL, produce, shared_data);
if (error == EXIT_SUCCESS) {
error = pthread_create(&consumer, /*attr*/ NULL, consume, shared_data);
if (error != EXIT_SUCCESS) {
fprintf(stderr, "error: could not create consumer\n");
error = ERR_CREATE_THREAD;
}
} else {
fprintf(stderr, "error: could not create producer\n");
error = ERR_CREATE_THREAD;
}
if (error == EXIT_SUCCESS) {
pthread_join(producer, /*value_ptr*/ NULL);
pthread_join(consumer, /*value_ptr*/ NULL);
}
return error;
}
void* produce(void* data) {
// const private_data_t* private_data = (private_data_t*)data;
shared_data_t* shared_data = (shared_data_t*)data;
size_t count = 0;
for (size_t round = 0; round < shared_data->rounds; ++round) {
for (size_t index = 0; index < shared_data->buffer_capacity; ++index) {
// wait(can_produce)
sem_wait(&shared_data->can_produce);
usleep(1000 * random_between(shared_data->producer_min_delay
, shared_data->producer_max_delay));
shared_data->buffer[index] = ++count;
printf("Produced %lg\n", shared_data->buffer[index]);
// signal(can_consume)
sem_post(&shared_data->can_consume);
}
}
return NULL;
}
void* consume(void* data) {
// const private_data_t* private_data = (private_data_t*)data;
shared_data_t* shared_data = (shared_data_t*)data;
for (size_t round = 0; round < shared_data->rounds; ++round) {
for (size_t index = 0; index < shared_data->buffer_capacity; ++index) {
// wait(can_consume)
sem_wait(&shared_data->can_consume);
double value = shared_data->buffer[index];
usleep(1000 * random_between(shared_data->consumer_min_delay
, shared_data->consumer_max_delay));
printf("\tConsumed %lg\n", value);
// signal(can_produce)
sem_post(&shared_data->can_produce);
}
}
return NULL;
}
useconds_t random_between(useconds_t min, useconds_t max) {
return min + (max > min ? (random() % (max - min)) : 0);
}
|