Created
February 11, 2012 15:51
-
-
Save Alexis-D/1801206 to your computer and use it in GitHub Desktop.
Producer / Consumer / Conditions variables / pthreads
This file contains 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 <pthread.h> | |
#include <stdio.h> | |
#include <stdlib.h> | |
#include <unistd.h> | |
#define BUF_SIZE 5 | |
// the buffer works like a stack for | |
// the sake of simplicity, if needed | |
// we may implement a queue | |
typedef struct { | |
int buf[BUF_SIZE]; // the buffer | |
size_t len; // number of items in the buffer | |
pthread_mutex_t mutex; // needed to add/remove data from the buffer | |
pthread_cond_t can_produce; // signaled when items are removed | |
pthread_cond_t can_consume; // signaled when items are added | |
} buffer_t; | |
// produce random numbers | |
void* producer(void *arg) { | |
buffer_t *buffer = (buffer_t*)arg; | |
while(1) { | |
#ifdef UNDERFLOW | |
// used to show that if the producer is somewhat "slow" | |
// the consumer will not fail (i.e. it'll just wait | |
// for new items to consume) | |
sleep(rand() % 3); | |
#endif | |
pthread_mutex_lock(&buffer->mutex); | |
if(buffer->len == BUF_SIZE) { // full | |
// wait until some elements are consumed | |
pthread_cond_wait(&buffer->can_produce, &buffer->mutex); | |
} | |
// in real life it may be some data fetched from | |
// sensors, the web, or just some I/O | |
int t = rand(); | |
printf("Produced: %d\n", t); | |
// append data to the buffer | |
buffer->buf[buffer->len] = t; | |
++buffer->len; | |
// signal the fact that new items may be consumed | |
pthread_cond_signal(&buffer->can_consume); | |
pthread_mutex_unlock(&buffer->mutex); | |
} | |
// never reached | |
return NULL; | |
} | |
// consume random numbers | |
void* consumer(void *arg) { | |
buffer_t *buffer = (buffer_t*)arg; | |
while(1) { | |
#ifdef OVERFLOW | |
// show that the buffer won't overflow if the consumer | |
// is slow (i.e. the producer will wait) | |
sleep(rand() % 3); | |
#endif | |
pthread_mutex_lock(&buffer->mutex); | |
if(buffer->len == 0) { // empty | |
// wait for new items to be appended to the buffer | |
pthread_cond_wait(&buffer->can_consume, &buffer->mutex); | |
} | |
// grab data | |
--buffer->len; | |
printf("Consumed: %d\n", buffer->buf[buffer->len]); | |
// signal the fact that new items may be produced | |
pthread_cond_signal(&buffer->can_produce); | |
pthread_mutex_unlock(&buffer->mutex); | |
} | |
// never reached | |
return NULL; | |
} | |
int main(int argc, char *argv[]) { | |
buffer_t buffer = { | |
.len = 0, | |
.mutex = PTHREAD_MUTEX_INITIALIZER, | |
.can_produce = PTHREAD_COND_INITIALIZER, | |
.can_consume = PTHREAD_COND_INITIALIZER | |
}; | |
pthread_t prod, cons; | |
pthread_create(&prod, NULL, producer, (void*)&buffer); | |
pthread_create(&cons, NULL, consumer, (void*)&buffer); | |
pthread_join(prod, NULL); // will wait forever | |
pthread_join(cons, NULL); | |
return 0; | |
} |
if we want to allow 1 consumer and 1 producer to be able to get/append data at the same time would we need two mutexes?
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
compile with -lpthread