| 1 |
|
| #define PERL_NO_GET_CONTEXT |
| 2 |
|
| #include "EXTERN.h" |
| 3 |
|
| #include "perl.h" |
| 4 |
|
| |
| 5 |
|
| #include "message.h" |
| 6 |
|
| #include "queue.h" |
| 7 |
|
| |
| 8 |
|
| /* |
| 9 |
|
| * Message queues |
| 10 |
|
| */ |
| 11 |
|
| |
| 12 |
0 |
| static void node_unshift(message** position, message* new_node) { |
| 13 |
0 |
| new_node->next = *position; |
| 14 |
0 |
| *position = new_node; |
| 15 |
0 |
| } |
| 16 |
|
| |
| 17 |
1 |
| static const message* node_shift(message** position) { |
| 18 |
1 |
| message* ret = *position; |
| 19 |
1 |
| *position = (*position)->next; |
| 20 |
1 |
| ret->next = NULL; |
| 21 |
1 |
| return ret; |
| 22 |
|
| } |
| 23 |
|
| |
| 24 |
1 |
| static void node_push(message** end, message* new_node) { |
| 25 |
1 |
| message** cur = end; |
| 26 |
1 |
▶ | while(*cur) |
Branch: 1 branch
| Branch | True | False | Total |
| while(*cur) |
0 |
1 |
1 |
|
| 27 |
0 |
| cur = &(*cur)->next; |
| 28 |
1 |
| *end = *cur = new_node; |
| 29 |
1 |
| new_node->next = NULL; |
| 30 |
1 |
| } |
| 31 |
|
| |
| 32 |
1 |
| static void S_node_destroy(pTHX_ message** current) { |
| 33 |
1 |
▶ | while (*current != NULL) { |
Branch: 1 branch
| Branch | True | False | Total |
| while (*current != NULL) { |
0 |
1 |
1 |
|
| 34 |
0 |
| message** next = &(*current)->next; |
| 35 |
0 |
| destroy_message(*current); |
| 36 |
0 |
| *current = NULL; |
| 37 |
0 |
| current = next; |
| 38 |
|
| } |
| 39 |
1 |
| } |
| 40 |
|
| #define node_destroy(current) S_node_destroy(aTHX_ current) |
| 41 |
|
| |
| 42 |
1 |
| void queue_init(message_queue* queue) { |
| 43 |
1 |
| Zero(queue, 1, message_queue); |
| 44 |
|
| MUTEX_INIT(&queue->mutex); |
| 45 |
|
| COND_INIT(&queue->condvar); |
| 46 |
1 |
| queue->refcount = 1; |
| 47 |
1 |
| } |
| 48 |
|
| |
| 49 |
1 |
| void S_queue_enqueue(pTHX_ message_queue* queue, const message* message_) { |
| 50 |
|
| message* new_entry; |
| 51 |
|
| MUTEX_LOCK(&queue->mutex); |
| 52 |
|
| |
| 53 |
1 |
| node_push(&queue->back, (message*)message_); |
| 54 |
1 |
▶ | if (queue->front == NULL) |
Branch: 1 branch
| Branch | True | False | Total |
| if (queue->front == NULL) |
1 |
0 |
1 |
|
| 55 |
1 |
| queue->front = queue->back; |
| 56 |
|
| |
| 57 |
|
| COND_SIGNAL(&queue->condvar); |
| 58 |
|
| MUTEX_UNLOCK(&queue->mutex); |
| 59 |
1 |
| } |
| 60 |
|
| |
| 61 |
1 |
| static const message* queue_shift(message_queue* queue) { |
| 62 |
1 |
| const message* ret = node_shift(&queue->front); |
| 63 |
|
| |
| 64 |
1 |
▶ | if (queue->front == NULL) |
Branch: 1 branch
| Branch | True | False | Total |
| if (queue->front == NULL) |
1 |
0 |
1 |
|
| 65 |
1 |
| queue->back = NULL; |
| 66 |
1 |
| return ret; |
| 67 |
|
| } |
| 68 |
|
| |
| 69 |
1 |
| const message* S_queue_dequeue(pTHX_ message_queue* queue) { |
| 70 |
|
| const message* ret; |
| 71 |
|
| MUTEX_LOCK(&queue->mutex); |
| 72 |
|
| |
| 73 |
1 |
▶ | while (!queue->front) |
Branch: 1 branch
| Branch | True | False | Total |
| while (!queue->front) |
0 |
1 |
1 |
|
| 74 |
|
| COND_WAIT(&queue->condvar, &queue->mutex); |
| 75 |
|
| |
| 76 |
1 |
| ret = queue_shift(queue); |
| 77 |
|
| MUTEX_UNLOCK(&queue->mutex); |
| 78 |
|
| |
| 79 |
1 |
| return ret; |
| 80 |
|
| } |
| 81 |
|
| |
| 82 |
1 |
| const message* S_queue_dequeue_nb(pTHX_ message_queue* queue) { |
| 83 |
|
| MUTEX_LOCK(&queue->mutex); |
| 84 |
|
| |
| 85 |
1 |
▶ | if (queue->front) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (queue->front) { |
0 |
1 |
1 |
|
| 86 |
0 |
| const message* ret = queue_shift(queue); |
| 87 |
|
| |
| 88 |
|
| MUTEX_UNLOCK(&queue->mutex); |
| 89 |
0 |
| return ret; |
| 90 |
|
| } |
| 91 |
|
| else { |
| 92 |
|
| MUTEX_UNLOCK(&queue->mutex); |
| 93 |
1 |
| return NULL; |
| 94 |
|
| } |
| 95 |
|
| } |
| 96 |
|
| |
| 97 |
1 |
| void S_queue_destroy(pTHX_ message_queue* queue) { |
| 98 |
|
| MUTEX_LOCK(&queue->mutex); |
| 99 |
1 |
| node_destroy(&queue->front); |
| 100 |
|
| COND_DESTROY(&queue->condvar); |
| 101 |
|
| MUTEX_UNLOCK(&queue->mutex); |
| 102 |
|
| MUTEX_DESTROY(&queue->mutex); |
| 103 |
1 |
| } |