| 1 |
|
| #define PERL_NO_GET_CONTEXT |
| 2 |
|
| #include "EXTERN.h" |
| 3 |
|
| #include "perl.h" |
| 4 |
|
| #define NO_XSLOCKS |
| 5 |
|
| #include "XSUB.h" |
| 6 |
|
| |
| 7 |
|
| #include "message.h" |
| 8 |
|
| #include "queue.h" |
| 9 |
|
| |
| 10 |
1 |
| static int queue_destructor(pTHX_ SV* queue_object, MAGIC* mg) { |
| 11 |
1 |
| message_queue* queue = (message_queue*)mg->mg_ptr; |
| 12 |
|
| int alive; |
| 13 |
|
| MUTEX_LOCK(&queue->mutex); |
| 14 |
1 |
| alive = --queue->refcount; |
| 15 |
|
| MUTEX_UNLOCK(&queue->mutex); |
| 16 |
1 |
▶ | if (!alive) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (!alive) { |
1 |
0 |
1 |
|
| 17 |
1 |
| queue_destroy(queue); |
| 18 |
1 |
| PerlMemShared_free(queue); |
| 19 |
|
| } |
| 20 |
1 |
| return 0; |
| 21 |
|
| } |
| 22 |
|
| |
| 23 |
0 |
| static int queue_duplicator(pTHX_ MAGIC* mg, CLONE_PARAMS* params) { |
| 24 |
0 |
| message_queue* queue = (message_queue*)mg->mg_ptr; |
| 25 |
|
| MUTEX_LOCK(&queue->mutex); |
| 26 |
0 |
| queue->refcount++; |
| 27 |
|
| MUTEX_UNLOCK(&queue->mutex); |
| 28 |
0 |
| return 0; |
| 29 |
|
| } |
| 30 |
|
| |
| 31 |
|
| static const MGVTBL queue_magic = { NULL, NULL, NULL, NULL, queue_destructor, NULL, queue_duplicator, NULL }; |
| 32 |
|
| |
| 33 |
|
| #ifndef mg_findext |
| 34 |
|
| #define mg_findext(sv, magic, ptr) mg_find(sv, magic) |
| 35 |
|
| #endif |
| 36 |
|
| |
| 37 |
3 |
| static message_queue* S_get_queue(pTHX_ SV* queue_object) { |
| 38 |
3 |
▶ | if (!sv_isobject(queue_object) || !sv_derived_from(queue_object, "Thread::Channel")) |
Branch: 2 branches
| Branch | True | False | Total |
| if (!sv_isobject(queue_object) || !sv_derived_from(queue_object, "Thread::Channel")) |
3 |
0 |
3 |
| if (!sv_isobject(queue_object) || !sv_derived_from(queue_object, "Thread::Channel")) |
0 |
3 |
3 |
|
| 39 |
0 |
| Perl_croak(aTHX_ "Something is very wrong, this is not a queue object\n"); |
| 40 |
3 |
| MAGIC* mg = mg_findext(SvRV(queue_object), PERL_MAGIC_ext, &queue_magic); |
| 41 |
3 |
| return (message_queue*) mg->mg_ptr; |
| 42 |
|
| } |
| 43 |
|
| #define get_queue(object) S_get_queue(aTHX_ object) |
| 44 |
|
| |
| 45 |
|
| MODULE = Thread::Channel PACKAGE = Thread::Channel |
| 46 |
|
| |
| 47 |
|
| PROTOTYPES: DISABLED |
| 48 |
|
| |
| 49 |
|
| SV* |
| 50 |
|
| new(class) |
| 51 |
|
| SV* class; |
| 52 |
|
| PREINIT: |
| 53 |
|
| message_queue* queue; |
| 54 |
|
| SV* referent; |
| 55 |
|
| MAGIC* mg; |
| 56 |
|
| CODE: |
| 57 |
1 |
| queue = PerlMemShared_calloc(1, sizeof(message_queue)); |
| 58 |
1 |
| queue_init(queue); |
| 59 |
1 |
| referent = newSV(0); |
| 60 |
1 |
| mg = sv_magicext(referent, NULL, PERL_MAGIC_ext, &queue_magic, (const char*)queue, 0); |
| 61 |
1 |
| mg->mg_flags |= MGf_DUP|MGf_COPY; |
| 62 |
1 |
| RETVAL = newRV_noinc(referent); |
| 63 |
1 |
| sv_bless(RETVAL, gv_stashsv(class, FALSE)); |
| 64 |
|
| OUTPUT: |
| 65 |
|
| RETVAL |
| 66 |
|
| |
| 67 |
|
| void |
| 68 |
|
| enqueue(object, ...) |
| 69 |
|
| SV* object; |
| 70 |
|
| PREINIT: |
| 71 |
|
| message_queue* queue; |
| 72 |
|
| const message* message; |
| 73 |
|
| CODE: |
| 74 |
1 |
| queue = get_queue(object); |
| 75 |
1 |
▶ | if (items == 1) |
Branch: 1 branch
| Branch | True | False | Total |
| if (items == 1) |
0 |
1 |
1 |
|
| 76 |
0 |
| Perl_croak(aTHX_ "Can't send an empty list\n"); |
| 77 |
1 |
▶ | PUSHMARK(MARK + 2); |
Branch: 1 branch
| Branch | True | False | Total |
| PUSHMARK(MARK + 2); |
0 |
1 |
1 |
|
| 78 |
1 |
▶ | message_from_stack(message, MARK + 1); |
Branch: 1 branch
| Branch | True | False | Total |
| message_from_stack(message, MARK + 1); |
0 |
1 |
1 |
|
| 79 |
1 |
| queue_enqueue(queue, message); |
| 80 |
|
| |
| 81 |
|
| void |
| 82 |
|
| dequeue(object) |
| 83 |
|
| SV* object; |
| 84 |
|
| PREINIT: |
| 85 |
|
| message_queue* queue; |
| 86 |
|
| const message* message; |
| 87 |
|
| PPCODE: |
| 88 |
1 |
| queue = get_queue(object); |
| 89 |
1 |
| message = queue_dequeue(queue); |
| 90 |
1 |
| message_to_stack(message, GIMME_V); |
| 91 |
1 |
| destroy_message(message); |
| 92 |
|
| |
| 93 |
|
| |
| 94 |
|
| void |
| 95 |
|
| dequeue_nb(object) |
| 96 |
|
| SV* object; |
| 97 |
|
| PREINIT: |
| 98 |
|
| message_queue* queue; |
| 99 |
|
| const message* message; |
| 100 |
|
| PPCODE: |
| 101 |
1 |
| queue = get_queue(object); |
| 102 |
1 |
▶ | if (message = queue_dequeue_nb(queue)) { |
Branch: 1 branch
| Branch | True | False | Total |
| if (message = queue_dequeue_nb(queue)) { |
0 |
1 |
1 |
|
| 103 |
0 |
| message_to_stack(message, GIMME_V); |
| 104 |
0 |
| destroy_message(message); |
| 105 |
|
| } |
| 106 |
|
| else |
| 107 |
1 |
| XSRETURN_EMPTY; |