src/queue.xs

filter: Statementstmt 0.0% 0 / 42 Branchbran 0.0% 0 / 20 Conditioncond n/a MC/DCmcdc n/a Subroutinesub n/a Podpod n/a totaltotal 0.0% 0 / 62 CC 0 SCAR 0
CC
0
Cov
0%
CRAP 0
« blib/lib/NgxQueue.pm ↑ Summary
1 #include "EXTERN.h"
2 #include "perl.h"
3 #include "XSUB.h"
4 #include "ppport.h"
5  
6 #include "ngx-queue.h"
7  
8 typedef struct p5_ngx_queue_s p5_ngx_queue_t;
9 typedef p5_ngx_queue_t* NgxQueue;
10  
11 struct p5_ngx_queue_s {
12 ngx_queue_t queue;
13 SV* data;
14 };
15  
16 /* from List::Util */
17 #if PERL_VERSION < 13 || (PERL_VERSION == 13 && PERL_SUBVERSION < 9)
18 # define PERL_HAS_BAD_MULTICALL_REFCOUNT
19 #endif
20  
21 MODULE = NgxQueue PACKAGE = NgxQueue
22  
23 PROTOTYPES: DISABLE
24  
25 NgxQueue
26 new(char* class_name, SV* data = NULL)
27 CODE:
28 {
29 PERL_UNUSED_VAR(class_name);
30 0 Newx(RETVAL, 1, p5_ngx_queue_t);
31 0 ngx_queue_init(&RETVAL->queue);
32  
33 0 ▶ if (data) {
Branch: 1 branch
BranchTrueFalseTotal
if (data) { 0 0 0
34 0 RETVAL->data = newRV_inc(data);
35 }
36 else {
37 0 RETVAL->data = NULL;
38 }
39 }
40 OUTPUT:
41 RETVAL
42  
43 void
44 DESTROY(NgxQueue self)
45 CODE:
46 {
47 int cnt;
48  
49 0 ▶ if (self->data) {
Branch: 1 branch
BranchTrueFalseTotal
if (self->data) { 0 0 0
50 0 cnt = SvREFCNT(self->data);
51 0 SvREFCNT_dec(self->data);
52 0 ▶ if (cnt <= 1) {
Branch: 1 branch
BranchTrueFalseTotal
if (cnt <= 1) { 0 0 0
53 0 self->data = NULL;
54 0 Safefree(self);
55 }
56 }
57 }
58  
59 void
60 data(NgxQueue self)
61 CODE:
62 {
63 0 ▶ if (self->data) {
Branch: 1 branch
BranchTrueFalseTotal
if (self->data) { 0 0 0
64 0 ST(0) = SvRV(self->data);
65 0 XSRETURN(1);
66 }
67 else {
68 0 XSRETURN(0);
69 }
70 }
71  
72 int
73 empty(NgxQueue h)
74 CODE:
75 {
76 0 ▶ RETVAL = ngx_queue_empty(&h->queue);
Branch: 1 branch
BranchTrueFalseTotal
RETVAL = ngx_queue_empty(&h->queue); 0 0 0
77 }
78 OUTPUT:
79 RETVAL
80  
81 void
82 insert_head(NgxQueue h, NgxQueue x)
83 ALIAS:
84 insert_after = 1
85 CODE:
86 {
87 PERL_UNUSED_VAR(ix);
88 0 ngx_queue_insert_head(&h->queue, &x->queue);
89 PERL_UNUSED_VAR(SvREFCNT_inc(x->data));
90 }
91  
92 void
93 insert_tail(NgxQueue h, NgxQueue x)
94 CODE:
95 {
96 0 ngx_queue_insert_tail(&h->queue, &x->queue);
97 PERL_UNUSED_VAR(SvREFCNT_inc(x->data));
98 }
99  
100 NgxQueue
101 head(NgxQueue h)
102 CODE:
103 {
104 0 ngx_queue_t* q = ngx_queue_head(&h->queue);
105 0 RETVAL = ngx_queue_data(q, p5_ngx_queue_t, queue);
106 PERL_UNUSED_VAR(SvREFCNT_inc(RETVAL->data));
107 }
108 OUTPUT:
109 RETVAL
110  
111 NgxQueue
112 last(NgxQueue h)
113 CODE:
114 {
115 0 ngx_queue_t* q = ngx_queue_last(&h->queue);
116 0 RETVAL = ngx_queue_data(q, p5_ngx_queue_t, queue);
117 PERL_UNUSED_VAR(SvREFCNT_inc(RETVAL->data));
118 }
119 OUTPUT:
120 RETVAL
121  
122 NgxQueue
123 next(NgxQueue h)
124 CODE:
125 {
126 0 ngx_queue_t* q = ngx_queue_next(&h->queue);
127 0 RETVAL = ngx_queue_data(q, p5_ngx_queue_t, queue);
128 PERL_UNUSED_VAR(SvREFCNT_inc(RETVAL->data));
129 }
130 OUTPUT:
131 RETVAL
132  
133 NgxQueue
134 prev(NgxQueue h)
135 CODE:
136 {
137 0 ngx_queue_t* q = ngx_queue_prev(&h->queue);
138 0 RETVAL = ngx_queue_data(q, p5_ngx_queue_t, queue);
139 PERL_UNUSED_VAR(SvREFCNT_inc(RETVAL->data));
140 }
141 OUTPUT:
142 RETVAL
143  
144 void
145 remove(NgxQueue x)
146 CODE:
147 {
148 0 ngx_queue_remove(&x->queue);
149 0 SvREFCNT_dec(x->data);
150 }
151  
152 void
153 split(NgxQueue h, NgxQueue q, NgxQueue n)
154 CODE:
155 {
156 0 ngx_queue_split(&h->queue, &q->queue, &n->queue);
157 }
158  
159 void
160 add(NgxQueue self, NgxQueue n)
161 CODE:
162 {
163 0 ngx_queue_add(&self->queue, &n->queue);
164 }
165  
166 void
167 foreach(NgxQueue h, SV* cb)
168 CODE:
169 {
170 ngx_queue_t* q;
171 CV* cv;
172 HV* stash;
173 GV* gv;
174  
175 0 cv = sv_2cv(cb, &stash, &gv, 0);
176  
177 0 ▶ if (cv == Nullcv) {
Branch: 1 branch
BranchTrueFalseTotal
if (cv == Nullcv) { 0 0 0
178 0 croak("Not a subroutine reference");
179 }
180  
181 0 SAVESPTR(GvSV(PL_defgv));
182  
183 dMULTICALL;
184 0 I32 gimme = G_SCALAR;
185 0 ▶ PUSH_MULTICALL(cv);
Branch: 1 branch
BranchTrueFalseTotal
PUSH_MULTICALL(cv); 0 0 0
186  
187 0 ▶ ngx_queue_foreach(q, &h->queue) {
Branch: 2 branches
BranchTrueFalseTotal
ngx_queue_foreach(q, &h->queue) { 0 0 0
ngx_queue_foreach(q, &h->queue) { 0 0 0
188 0 NgxQueue queue = ngx_queue_data(q, p5_ngx_queue_t, queue);
189 0 sv_setref_pv(GvSV(PL_defgv), "NgxQueue", (void*)queue);
190 0 if (queue->data) {
191 PERL_UNUSED_VAR(SvREFCNT_inc(queue->data));
192 }
193 0 MULTICALL;
194 }
195 #ifdef PERL_HAS_BAD_MULTICALL_REFCOUNT
196 if (CvDEPTH(multicall_cv) > 1)
197 SvREFCNT_inc_simple_void_NN(multicall_cv);
198 #endif
199 0 ▶ POP_MULTICALL;
Branch: 1 branch
BranchTrueFalseTotal
POP_MULTICALL; 0 0 0
200 }
201  
« blib/lib/NgxQueue.pm ↑ Summary