Created
May 30, 2016 20:15
-
-
Save ahmedengu/065c2777a880b323bc7b9f561a706bb2 to your computer and use it in GitHub Desktop.
consumer wait for the buffer to be full , http://ideone.com/X2bxFu
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <stdio.h> | |
#include <pthread.h> | |
#include <semaphore.h> | |
#include <stdlib.h> | |
#include <math.h> | |
#include <ctype.h> | |
#include <time.h> | |
#include <unistd.h> | |
char queueOfChars[10]; | |
int number = 5, buffer = 0; | |
sem_t fullsem, emptysem, producerSync, producerSync1, consumerSync, consumerSync1; | |
void producerPrinting(int i, char tmp, int p) { | |
printf("\nProducer#%d at i=%d : Inserted %c , buffer: %d", p, i, tmp, buffer); | |
} | |
char generateChar() { | |
sleep(1); | |
srand(time(NULL)); | |
return 'a' + ((rand() * 100) % 26); | |
} | |
void consumerProcess(char *tmp) { *tmp = toupper(*tmp); } | |
void consumerPrinting(int i, char tmp, int c) { | |
printf("\nConsumer#%d at i=%d: Getting %c, buffer:%d", c, i, tmp, buffer); | |
} | |
void consumerRead(char *tmp) { *tmp = queueOfChars[--buffer]; } | |
void insert(char e) { | |
if (buffer < number) | |
queueOfChars[buffer++] = e; | |
else | |
buffer = 0; | |
} | |
void *produce(void *a) { | |
int i; | |
for (i = 0; i < number * 2; i++) { | |
sem_wait(&fullsem); | |
sem_wait(&producerSync1); | |
char tmp = generateChar(); | |
insert(tmp); | |
producerPrinting(i, tmp, 1); | |
if (buffer > number - 1) { | |
for (int j = 0; j < number; ++j) { | |
sem_post(&emptysem); | |
} | |
} | |
sem_post(&producerSync); | |
} | |
} | |
void *produce2(void *a) { | |
int i; | |
for (i = 0; i < number * 2; i++) { | |
sem_wait(&fullsem); | |
sem_wait(&producerSync); | |
char tmp = generateChar(); | |
insert(tmp); | |
producerPrinting(i, tmp, 2); | |
if (buffer > number - 1) { | |
for (int j = 0; j < number; ++j) { | |
sem_post(&emptysem); | |
} | |
} | |
sem_post(&producerSync1); | |
} | |
} | |
void *consume(void *a) { | |
int i; | |
for (i = 0; i < number * 2; i++) { | |
sem_wait(&emptysem); | |
sem_wait(&consumerSync1); | |
char tmp; | |
consumerRead(&tmp); | |
consumerProcess(&tmp); | |
consumerPrinting(i, tmp, 1); | |
if (buffer == 0) { | |
for (int j = 0; j < number; ++j) { | |
sem_post(&fullsem); | |
} | |
} | |
sem_post(&consumerSync); | |
} | |
} | |
void *consume2(void *a) { | |
int i, v; | |
for (i = 0; i < number * 2; i++) { | |
sem_wait(&emptysem); | |
sem_wait(&consumerSync); | |
char tmp; | |
consumerRead(&tmp); | |
consumerProcess(&tmp); | |
consumerPrinting(i, tmp, 2); | |
if (buffer == 0) { | |
for (int j = 0; j < number; ++j) { | |
sem_post(&fullsem); | |
} | |
} | |
sem_post(&consumerSync1); | |
} | |
} | |
int main() { | |
pthread_t t[4]; | |
sem_init(&fullsem, 0, 10); | |
sem_init(&emptysem, 0, 0); | |
sem_init(&producerSync, 0, 0); | |
sem_init(&producerSync1, 0, 1); | |
sem_init(&consumerSync, 0, 1); | |
sem_init(&consumerSync1, 0, 1); | |
pthread_create(&t[0], NULL, &produce, NULL); | |
pthread_create(&t[1], NULL, &produce2, NULL); | |
pthread_create(&t[2], NULL, &consume, NULL); | |
pthread_create(&t[3], NULL, &consume2, NULL); | |
pthread_join(t[0], NULL); | |
pthread_join(t[1], NULL); | |
pthread_join(t[2], NULL); | |
pthread_join(t[3], NULL); | |
sem_destroy(&fullsem); | |
sem_destroy(&emptysem); | |
sem_destroy(&consumerSync); | |
sem_destroy(&consumerSync1); | |
sem_destroy(&producerSync); | |
sem_destroy(&producerSync1); | |
return 0; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Producer#1 at i=0 : Inserted g , buffer: 1 | |
Producer#2 at i=0 : Inserted u , buffer: 2 | |
Producer#1 at i=1 : Inserted w , buffer: 3 | |
Producer#2 at i=1 : Inserted g , buffer: 4 | |
Producer#1 at i=2 : Inserted a , buffer: 5 | |
Consumer#2 at i=0: Getting A, buffer:4 | |
Consumer#1 at i=0: Getting G, buffer:3 | |
Consumer#1 at i=1: Getting W, buffer:2 | |
Consumer#2 at i=1: Getting U, buffer:1 | |
Consumer#1 at i=2: Getting G, buffer:0 | |
Producer#2 at i=2 : Inserted k , buffer: 1 | |
Producer#1 at i=3 : Inserted m , buffer: 2 | |
Producer#2 at i=3 : Inserted g , buffer: 3 | |
Producer#1 at i=4 : Inserted a , buffer: 4 | |
Producer#2 at i=4 : Inserted M , buffer: 5 | |
Consumer#2 at i=2: Getting M, buffer:4 | |
Consumer#2 at i=3: Getting A, buffer:3 | |
Consumer#1 at i=3: Getting G, buffer:2 | |
Consumer#1 at i=4: Getting M, buffer:1 | |
Consumer#2 at i=4: Getting K, buffer:0 | |
Producer#1 at i=5 : Inserted Q , buffer: 1 | |
Producer#2 at i=5 : Inserted [ , buffer: 2 | |
Producer#1 at i=6 : Inserted U , buffer: 3 | |
Producer#2 at i=6 : Inserted y , buffer: 4 | |
Producer#1 at i=7 : Inserted O , buffer: 5 | |
Consumer#1 at i=5: Getting O, buffer:4 | |
Consumer#2 at i=5: Getting Y, buffer:3 | |
Consumer#2 at i=6: Getting U, buffer:2 | |
Consumer#1 at i=6: Getting [, buffer:1 | |
Consumer#2 at i=7: Getting Q, buffer:0 | |
Producer#2 at i=7 : Inserted o , buffer: 1 | |
Producer#1 at i=8 : Inserted Q , buffer: 2 | |
Producer#2 at i=8 : Inserted m , buffer: 3 | |
Producer#1 at i=9 : Inserted a , buffer: 4 | |
Producer#2 at i=9 : Inserted o , buffer: 5 | |
Consumer#1 at i=7: Getting O, buffer:4 | |
Consumer#1 at i=8: Getting A, buffer:3 | |
Consumer#2 at i=8: Getting M, buffer:2 | |
Consumer#2 at i=9: Getting Q, buffer:1 | |
Consumer#1 at i=9: Getting O, buffer:0 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment