aboutsummaryrefslogtreecommitdiffstats
path: root/OLD/csci4061/112320_breakout/sol-semaphore.c
blob: 4af3a5b3dee5ae262bbc5f8ec2eef2d5560cb1a3 (plain) (blame)
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
#define NUM_ARGS 0

#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/stat.h>
#include <unistd.h>
#include <fcntl.h>
#include <dirent.h>
#include <string.h>
#include <time.h>
#include <pthread.h>
#include <semaphore.h>
#include<sys/time.h>

long semTotal = 0;

struct buffer {

	int vals[100];
	int index;
};

struct semBuffer {

	struct buffer* q;
	sem_t* psem;
	sem_t* csem;
	pthread_mutex_t* mutex;
};

void insert(struct buffer* q, int val) {

	q->vals[q->index] = val;
	++q->index;
}

int delete(struct buffer* q) {

	--q->index;
	int val = q->vals[q->index];
	return val;
}

// TODO: Insert code to use a semaphore.
void* semProducer(void* arg) {

	// Random delay. DO NOT REMOVE!
	usleep(rand() % 1000);

	struct semBuffer* sq = (struct semBuffer*) arg;
	sem_wait(sq->psem);
	pthread_mutex_lock(sq->mutex);

	static int in = 0;
	++in;
	// Add an element to the queue.
	insert(sq->q, in);

	pthread_mutex_unlock(sq->mutex);
	sem_post(sq->csem);

}

// TODO: Insert code to use a semaphore.
void* semConsumer(void* arg) {

	// Random delay. DO NOT REMOVE!
	usleep(rand() % 1000);

	struct semBuffer* sq = (struct semBuffer*) arg;

	sem_wait(sq->csem);
	pthread_mutex_lock(sq->mutex);

	// Reove an element from the queue.
	semTotal += delete(sq->q);

	pthread_mutex_unlock(sq->mutex);
	sem_post(sq->psem);
}

int main(int argc, char** argv) {

	if (argc != NUM_ARGS + 1) {

		printf("Wrong number of args, expected %d, given %d\n", NUM_ARGS, argc - 1);
		exit(1);
	}

	// Seed the random generator.
	srand(time(NULL));

	// Create threads.
	pthread_t semPool[100];

	struct timeval start;
	gettimeofday(&start, NULL);

	// Create task queue.
	struct semBuffer* sq = (struct semBuffer*) malloc(sizeof(struct semBuffer));

	sq->q = (struct buffer*) malloc(sizeof(struct buffer));
	sq->q->index=0;
	sq->psem = (sem_t*) malloc(sizeof(sem_t));
	sq->csem = (sem_t*) malloc(sizeof(sem_t));
	sq->mutex = (pthread_mutex_t*) malloc(sizeof(pthread_mutex_t));

	// TODO: Initilaize semaphores
	sem_init(sq->psem, 0, 50);
	sem_init(sq->csem, 0, 0);
	
	pthread_mutex_init(sq->mutex, NULL);

	for (int i=0; i < 50; ++i) {

		pthread_create(&semPool[i], NULL, semProducer, (void*) sq);
		pthread_create(&semPool[50 + i], NULL, semConsumer, (void*) sq);
	}

	for (int i=0; i < 100; ++i) pthread_join(semPool[i], NULL);

	struct timeval end;
	gettimeofday(&end, NULL);
	printf("Sem Test: \nTotal of buffer  = %ld\n", semTotal);
	printf("Time (in us) to complete = %ld\n", ((end.tv_sec - start.tv_sec) * 1000000) + (end.tv_usec - start.tv_usec));
}