-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathts_queue_test.cpp
More file actions
80 lines (63 loc) · 1.55 KB
/
ts_queue_test.cpp
File metadata and controls
80 lines (63 loc) · 1.55 KB
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
#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <assert.h>
#include "ts_queue.hpp"
/* Global shared variables */
TSQueue<int>* q;
int num_producer;
int num_consumer;
int** result;
void* produce(void* arg) {
int tid = *(int*)arg;
int from = tid * num_consumer;
int to = tid * num_consumer + num_consumer;
for (int i = from; i < to; i++) {
q->enqueue(i);
}
return nullptr;
}
void* consume(void* arg) {
int tid = *(int*)arg;
for (int i = 0; i < num_producer; i++) {
int val = q->dequeue();
result[tid][i] = val;
}
return nullptr;
}
struct Thread {
pthread_t t;
int id;
};
int main(int argc, char** argv) {
assert(argc == 3);
q = new TSQueue<int>(20);
num_producer = atoi(argv[1]);
num_consumer = atoi(argv[2]);
result = new int*[num_consumer];
for (int i = 0; i < num_consumer; i++)
result[i] = new int[num_producer];
Thread* producers = new Thread[num_producer];
Thread* consumers = new Thread[num_consumer];
for (int i = 0; i < num_producer; i++) {
producers[i].id = i;
pthread_create(&producers[i].t, 0, produce, (void*)&producers[i].id);
}
for (int i = 0; i < num_consumer; i++) {
consumers[i].id = i;
pthread_create(&consumers[i].t, 0, consume, (void*)&consumers[i].id);
}
for (int i = 0; i < num_producer; i++) {
pthread_join(producers[i].t, 0);
}
for (int i = 0; i < num_consumer; i++) {
pthread_join(consumers[i].t, 0);
}
for (int i = 0; i < num_consumer; i++) {
printf("consumer %d:", i);
for (int j = 0; j < num_producer; j++)
printf(" %d", result[i][j]);
printf("\n");
}
return 0;
}