ringbuffer/src/main.cpp at master · OneOfTheirs/ringbuffer · GitHub

History

138 lines (113 loc) · 3.97 KB

Raw

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

#include <sys/time.h>

#include <stdlib.h>

#include <unistd.h>

#include <string.h>

#include <stdio.h>

#include "RingBuffer.h"

#include "RingBufferConsumer.h"

#include "RingBufferProducer.h"

//#define N_ITERS 100*1000*1000

#define N_ITERS 400

void* produce_function1 ( void *ptr )

{

RingBufferProducer* p_producer = (RingBufferProducer *) ptr; /* type cast to a

pointer to thdata */

struct timespec ts;

ts.tv_sec = 0;

ts.tv_nsec = 1;

unsigned char v[64];

for (unsigned long i = 1 ; i <= N_ITERS; i++)

{

*((unsigned long*)v) = i;

while (p_producer->write(v, 64) != 64)

pthread_yield();

// if (i % 10000 == 0)

// printf("%d\n", i);

}

fprintf(stderr, "producer is done\n");

}

void* produce_function2 ( void *ptr )

{

RingBufferProducer* p_producer = (RingBufferProducer *) ptr; /* type cast to a

pointer to thdata */

struct timespec ts;

ts.tv_sec = 0;

ts.tv_nsec = 1;

unsigned char v[64];

for (unsigned long i = N_ITERS + 1; i <= 2*N_ITERS; i++)

{

*((unsigned long*)v) = i;

while (p_producer->write(v, 64) != 64)

;

//nanosleep(&ts, NULL);

// if (i % 10000 == 0)

// printf("%d\n", i);

}

fprintf(stderr, "producer is done\n");

}

void* consume_function ( void *ptr )

{

RingBufferConsumer* p_consumer = (RingBufferConsumer *) ptr; /* type cast to a

pointer to thdata */

unsigned char v1[64];

unsigned char v2[64];

unsigned char v[64];

struct timespec ts;

ts.tv_sec = 0;

ts.tv_nsec = 1;

*((unsigned long*)v1) = 0;

*((unsigned long*)v2) = N_ITERS;

*((unsigned long*)v) = 0;

unsigned long prev_v1 = *((unsigned long*)v1);

unsigned long prev_v2 = *((unsigned long*)v2);

while(true)

{

if (p_consumer->read(v, 64) != 64)

{

//nanosleep(&ts, NULL);

continue;

}

//else

// if (v % 1000000 == 0) fprintf(stderr, "read %ld\n", v);

fprintf(stderr, "val = %ld\n", *((unsigned long*)v));

if (*((unsigned long*)v) <= N_ITERS)

{

if (prev_v1 + 1 != *((unsigned long*)v))

{

fprintf(stderr, "inconsistency when reading consecutive numbers, prev = %ld, next = %ld\n", prev_v1, *((unsigned long*)v));

p_consumer->dump();

}

prev_v1 = *((unsigned long*)v);

}

if (*((unsigned long*)v) > N_ITERS)

{

if (prev_v2 + 1 != *((unsigned long*)v))

{

fprintf(stderr, "inconsistency when reading consecutive numbers, prev = %ld, next = %ld\n", prev_v2, *((unsigned long*)v));

p_consumer->dump();

}

prev_v2 = *((unsigned long*)v);

}

if (prev_v1 + 1 >= N_ITERS && prev_v2 + 1 >= 2*N_ITERS)

break;

}

int main(int argc, char ** argv)

{

pthread_t producer_thread1, producer_thread2, consumer_thread;

unsigned long order = argc > 1 ? atoi(argv[argc-1]) : 26;

RingBuffer rb(order, YieldWaitConsumerStrategy());

RingBufferConsumer* p_consumer = rb.createConsumer();

RingBufferProducer* p_producer1 = rb.createProducer();

RingBufferProducer* p_producer2 = rb.createProducer();

struct timeval tv1, tv2;

gettimeofday(&tv1, NULL);

pthread_create (&producer_thread1, NULL, &produce_function1, (void*) p_producer1);

pthread_create (&producer_thread2, NULL, &produce_function2, (void*) p_producer2);

pthread_create (&consumer_thread, NULL, &consume_function, (void*) p_consumer);

pthread_join(producer_thread1, NULL);

pthread_join(producer_thread2, NULL);

pthread_join(consumer_thread, NULL);

gettimeofday(&tv2, NULL);

printf("exec time %ld\n", tv2.tv_sec * 1000000 + tv2.tv_usec - tv1.tv_sec * 1000000 - tv1.tv_usec);

}

ringbuffer/src/main.cpp at master · OneOfTheirs/ringbuffer · GitHub

Expand file tree

Breadcrumbs

main.cpp

Latest commit

History

Breadcrumbs

main.cpp

File metadata and controls