| Line |
Branch |
Exec |
Source |
| 1 |
|
|
/** |
| 2 |
|
|
* @file exchange_manager_consumer.cpp |
| 3 |
|
|
* @author Vincent Berenz |
| 4 |
|
|
* @license License BSD-3-Clause |
| 5 |
|
|
* @copyright Copyright (c) 2019, New York University and Max Planck |
| 6 |
|
|
* Gesellschaft. |
| 7 |
|
|
* @date 2019-05-22 |
| 8 |
|
|
* |
| 9 |
|
|
* @brief Demonstrate how to use the exchange manage consummer |
| 10 |
|
|
*/ |
| 11 |
|
|
#include "shared_memory/exchange_manager_consumer.hpp" |
| 12 |
|
|
#include <signal.h> |
| 13 |
|
|
#include <stdlib.h> |
| 14 |
|
|
#include <time.h> |
| 15 |
|
|
#include <unistd.h> |
| 16 |
|
|
#include <iostream> |
| 17 |
|
|
#include "shared_memory/demos/four_int_values.hpp" |
| 18 |
|
|
|
| 19 |
|
|
#define SEGMENT_ID "exchange_demo_segment" |
| 20 |
|
|
#define OBJECT_ID "exchange_demo_object" |
| 21 |
|
|
#define QUEUE_SIZE 2000 * 4 |
| 22 |
|
|
|
| 23 |
|
|
static bool RUNNING = true; |
| 24 |
|
|
|
| 25 |
|
✗ |
void stop(int) |
| 26 |
|
|
{ |
| 27 |
|
✗ |
RUNNING = false; |
| 28 |
|
|
} |
| 29 |
|
|
|
| 30 |
|
✗ |
void execute() |
| 31 |
|
|
{ |
| 32 |
|
✗ |
srand(time(NULL)); |
| 33 |
|
|
|
| 34 |
|
|
// Four_int_values is a subclass of shared_memory/serializable, |
| 35 |
|
|
// i.e an object which can be serialized as an array of double |
| 36 |
|
✗ |
bool leading = false; // producer expected to start first, and to survive |
| 37 |
|
|
// serveral consumers |
| 38 |
|
✗ |
bool autolock = false; // to read several items in a single shot |
| 39 |
|
|
shared_memory::Exchange_manager_consumer<shared_memory::Four_int_values, |
| 40 |
|
|
QUEUE_SIZE> |
| 41 |
|
✗ |
exchange(SEGMENT_ID, OBJECT_ID, leading, autolock); |
| 42 |
|
|
|
| 43 |
|
✗ |
while (RUNNING) |
| 44 |
|
|
{ |
| 45 |
|
|
// values serialized in shared memory will be deserialized in this |
| 46 |
|
|
// object |
| 47 |
|
✗ |
shared_memory::Four_int_values fiv; |
| 48 |
|
|
|
| 49 |
|
✗ |
if (exchange.ready_to_consume()) |
| 50 |
|
|
{ |
| 51 |
|
|
// required because autolock is false |
| 52 |
|
✗ |
exchange.lock(); |
| 53 |
|
|
|
| 54 |
|
|
// we arbitrary consider we can only consume 3 items per iteration |
| 55 |
|
✗ |
for (int i = 0; i < 3; i++) |
| 56 |
|
|
{ |
| 57 |
|
✗ |
bool consuming = exchange.consume(fiv); |
| 58 |
|
|
|
| 59 |
|
✗ |
if (!consuming) break; |
| 60 |
|
|
|
| 61 |
|
✗ |
fiv.print(); |
| 62 |
|
|
} |
| 63 |
|
|
|
| 64 |
|
✗ |
exchange.unlock(); |
| 65 |
|
|
} |
| 66 |
|
|
else |
| 67 |
|
|
{ |
| 68 |
|
✗ |
std::cout << "waiting for producer\n"; |
| 69 |
|
|
} |
| 70 |
|
|
|
| 71 |
|
|
// note : faster than producer, |
| 72 |
|
|
// as otherwise the buffer of the producer |
| 73 |
|
|
// would end up overflowing |
| 74 |
|
|
|
| 75 |
|
✗ |
usleep(1000); |
| 76 |
|
|
} |
| 77 |
|
|
} |
| 78 |
|
|
|
| 79 |
|
✗ |
int main() |
| 80 |
|
|
{ |
| 81 |
|
✗ |
RUNNING = true; |
| 82 |
|
|
|
| 83 |
|
|
// cleaning and exit on ctrl+c |
| 84 |
|
|
struct sigaction cleaning; |
| 85 |
|
✗ |
cleaning.sa_handler = stop; |
| 86 |
|
✗ |
sigemptyset(&cleaning.sa_mask); |
| 87 |
|
✗ |
cleaning.sa_flags = 0; |
| 88 |
|
✗ |
sigaction(SIGINT, &cleaning, nullptr); |
| 89 |
|
|
|
| 90 |
|
✗ |
execute(); |
| 91 |
|
|
} |
| 92 |
|
|
|