|
|
1 | #define PERL_NO_GET_CONTEXT |
|
|
2 | |
|
|
3 | #include "libcoro/coro.c" |
|
|
4 | |
1 | #include "EXTERN.h" |
5 | #include "EXTERN.h" |
2 | #include "perl.h" |
6 | #include "perl.h" |
3 | #include "XSUB.h" |
7 | #include "XSUB.h" |
4 | |
8 | |
5 | #include "libcoro/coro.c" |
9 | #include "patchlevel.h" |
|
|
10 | |
|
|
11 | #if PERL_VERSION < 6 |
|
|
12 | # ifndef PL_ppaddr |
|
|
13 | # define PL_ppaddr ppaddr |
|
|
14 | # endif |
|
|
15 | # ifndef call_sv |
|
|
16 | # define call_sv perl_call_sv |
|
|
17 | # endif |
|
|
18 | # ifndef get_sv |
|
|
19 | # define get_sv perl_get_sv |
|
|
20 | # endif |
|
|
21 | # ifndef get_cv |
|
|
22 | # define get_cv perl_get_cv |
|
|
23 | # endif |
|
|
24 | # ifndef IS_PADGV |
|
|
25 | # define IS_PADGV(v) 0 |
|
|
26 | # endif |
|
|
27 | # ifndef IS_PADCONST |
|
|
28 | # define IS_PADCONST(v) 0 |
|
|
29 | # endif |
|
|
30 | #endif |
6 | |
31 | |
7 | #include <signal.h> |
32 | #include <signal.h> |
8 | |
33 | |
9 | #ifdef HAVE_MMAP |
34 | #ifdef HAVE_MMAP |
10 | # include <unistd.h> |
35 | # include <unistd.h> |
11 | # include <sys/mman.h> |
36 | # include <sys/mman.h> |
12 | # ifndef MAP_ANON |
|
|
13 | # ifdef MAP_ANONYMOUS |
37 | # ifndef MAP_ANONYMOUS |
14 | # define MAP_ANON MAP_ANONYMOUS |
38 | # ifdef MAP_ANON |
|
|
39 | # define MAP_ANONYMOUS MAP_ANON |
15 | # else |
40 | # else |
16 | # undef HAVE_MMAP |
41 | # undef HAVE_MMAP |
17 | # endif |
42 | # endif |
18 | # endif |
43 | # endif |
19 | #endif |
44 | #endif |
20 | |
45 | |
21 | #define MAY_FLUSH /* increases codesize */ |
|
|
22 | |
|
|
23 | /* perl-related */ |
|
|
24 | #define TRANSFER_SAVE_DEFAV 0x00000001 |
|
|
25 | #define TRANSFER_SAVE_DEFSV 0x00000002 |
|
|
26 | #define TRANSFER_SAVE_ERRSV 0x00000004 |
|
|
27 | /* c-related */ |
|
|
28 | #define TRANSFER_SAVE_CCTXT 0x00000008 |
|
|
29 | #ifdef CORO_LAZY_STACK |
|
|
30 | # define TRANSFER_LAZY_STACK 0x00000010 |
|
|
31 | #else |
|
|
32 | # define TRANSFER_LAZY_STACK 0x00000000 |
|
|
33 | #endif |
|
|
34 | |
|
|
35 | #define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \ |
|
|
36 | |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT) |
|
|
37 | |
|
|
38 | #define SUB_INIT "Coro::State::initialize" |
46 | #define SUB_INIT "Coro::State::initialize" |
39 | #define UCORO_STATE "_coro_state" |
47 | #define UCORO_STATE "_coro_state" |
40 | |
48 | |
41 | /* The next macro should delcare a variable stacklevel that contains and approximation |
49 | /* The next macro should declare a variable stacklevel that contains and approximation |
42 | * to the current C stack pointer. It's property is that it changes with each call |
50 | * to the current C stack pointer. Its property is that it changes with each call |
43 | * and should be unique. */ |
51 | * and should be unique. */ |
44 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
52 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
45 | |
53 | |
|
|
54 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
|
|
55 | |
46 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
56 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
|
|
57 | |
|
|
58 | #include "CoroAPI.h" |
|
|
59 | |
|
|
60 | #ifdef USE_ITHREADS |
|
|
61 | static perl_mutex coro_mutex; |
|
|
62 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
|
|
63 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
|
|
64 | #else |
|
|
65 | # define LOCK 0 |
|
|
66 | # define UNLOCK 0 |
|
|
67 | #endif |
|
|
68 | |
|
|
69 | static struct CoroAPI coroapi; |
|
|
70 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
71 | static HV *coro_state_stash; |
|
|
72 | static SV *ucoro_state_sv; |
|
|
73 | static U32 ucoro_state_hash; |
|
|
74 | static SV *coro_mortal; /* will be freed after next transfer */ |
47 | |
75 | |
48 | /* this is actually not only the c stack but also c registers etc... */ |
76 | /* this is actually not only the c stack but also c registers etc... */ |
49 | typedef struct { |
77 | typedef struct { |
50 | int refcnt; /* pointer reference counter */ |
78 | int refcnt; /* pointer reference counter */ |
51 | int usecnt; /* shared by how many coroutines */ |
79 | int usecnt; /* shared by how many coroutines */ |
… | |
… | |
56 | void *sptr; |
84 | void *sptr; |
57 | long ssize; /* positive == mmap, otherwise malloc */ |
85 | long ssize; /* positive == mmap, otherwise malloc */ |
58 | } coro_stack; |
86 | } coro_stack; |
59 | |
87 | |
60 | struct coro { |
88 | struct coro { |
|
|
89 | /* the top-level JMPENV for each coroutine, needed to catch dies. */ |
|
|
90 | JMPENV start_env; |
|
|
91 | |
61 | /* the optional C context */ |
92 | /* the optional C context */ |
62 | coro_stack *stack; |
93 | coro_stack *stack; |
63 | void *cursp; |
94 | void *cursp; |
64 | int gencnt; |
95 | int gencnt; |
65 | |
96 | |
… | |
… | |
77 | AV *curstack; |
108 | AV *curstack; |
78 | AV *mainstack; |
109 | AV *mainstack; |
79 | SV **stack_sp; |
110 | SV **stack_sp; |
80 | OP *op; |
111 | OP *op; |
81 | SV **curpad; |
112 | SV **curpad; |
|
|
113 | AV *comppad; |
|
|
114 | CV *compcv; |
82 | SV **stack_base; |
115 | SV **stack_base; |
83 | SV **stack_max; |
116 | SV **stack_max; |
84 | SV **tmps_stack; |
117 | SV **tmps_stack; |
85 | I32 tmps_floor; |
118 | I32 tmps_floor; |
86 | I32 tmps_ix; |
119 | I32 tmps_ix; |
… | |
… | |
95 | I32 savestack_ix; |
128 | I32 savestack_ix; |
96 | I32 savestack_max; |
129 | I32 savestack_max; |
97 | OP **retstack; |
130 | OP **retstack; |
98 | I32 retstack_ix; |
131 | I32 retstack_ix; |
99 | I32 retstack_max; |
132 | I32 retstack_max; |
|
|
133 | PMOP *curpm; |
100 | COP *curcop; |
134 | COP *curcop; |
101 | JMPENV *top_env; |
135 | JMPENV *top_env; |
102 | |
136 | |
103 | /* data associated with this coroutine (initial args) */ |
137 | /* data associated with this coroutine (initial args) */ |
104 | AV *args; |
138 | AV *args; |
105 | }; |
139 | }; |
106 | |
140 | |
107 | typedef struct coro *Coro__State; |
141 | typedef struct coro *Coro__State; |
108 | typedef struct coro *Coro__State_or_hashref; |
142 | typedef struct coro *Coro__State_or_hashref; |
109 | |
143 | |
110 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
111 | static HV *coro_state_stash; |
|
|
112 | static SV *ucoro_state_sv; |
|
|
113 | static U32 ucoro_state_hash; |
|
|
114 | static HV *padlist_cache; |
|
|
115 | |
|
|
116 | /* mostly copied from op.c:cv_clone2 */ |
144 | /* mostly copied from op.c:cv_clone2 */ |
117 | STATIC AV * |
145 | STATIC AV * |
118 | clone_padlist (AV *protopadlist) |
146 | clone_padlist (pTHX_ AV *protopadlist) |
119 | { |
147 | { |
120 | AV *av; |
148 | AV *av; |
121 | I32 ix; |
149 | I32 ix; |
122 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
150 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
123 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
151 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
… | |
… | |
147 | AvFLAGS (av) = AVf_REIFY; |
175 | AvFLAGS (av) = AVf_REIFY; |
148 | |
176 | |
149 | for (ix = fpad; ix > 0; ix--) |
177 | for (ix = fpad; ix > 0; ix--) |
150 | { |
178 | { |
151 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
179 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
180 | |
152 | if (namesv && namesv != &PL_sv_undef) |
181 | if (namesv && namesv != &PL_sv_undef) |
153 | { |
182 | { |
154 | char *name = SvPVX (namesv); /* XXX */ |
183 | char *name = SvPVX (namesv); /* XXX */ |
|
|
184 | |
155 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
185 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
156 | { /* lexical from outside? */ |
186 | { /* lexical from outside? */ |
157 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
187 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
158 | } |
188 | } |
159 | else |
189 | else |
… | |
… | |
165 | sv = (SV *) newAV (); |
195 | sv = (SV *) newAV (); |
166 | else if (*name == '%') |
196 | else if (*name == '%') |
167 | sv = (SV *) newHV (); |
197 | sv = (SV *) newHV (); |
168 | else |
198 | else |
169 | sv = NEWSV (0, 0); |
199 | sv = NEWSV (0, 0); |
|
|
200 | |
|
|
201 | #ifdef SvPADBUSY |
170 | if (!SvPADBUSY (sv)) |
202 | if (!SvPADBUSY (sv)) |
|
|
203 | #endif |
171 | SvPADMY_on (sv); |
204 | SvPADMY_on (sv); |
|
|
205 | |
172 | npad[ix] = sv; |
206 | npad[ix] = sv; |
173 | } |
207 | } |
174 | } |
208 | } |
175 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
209 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
176 | { |
210 | { |
… | |
… | |
205 | #endif |
239 | #endif |
206 | |
240 | |
207 | return newpadlist; |
241 | return newpadlist; |
208 | } |
242 | } |
209 | |
243 | |
210 | #ifdef MAY_FLUSH |
244 | STATIC void |
211 | STATIC AV * |
|
|
212 | free_padlist (AV *padlist) |
245 | free_padlist (pTHX_ AV *padlist) |
213 | { |
246 | { |
214 | /* may be during global destruction */ |
247 | /* may be during global destruction */ |
215 | if (SvREFCNT(padlist)) |
248 | if (SvREFCNT (padlist)) |
216 | { |
249 | { |
217 | I32 i = AvFILLp(padlist); |
250 | I32 i = AvFILLp (padlist); |
218 | while (i >= 0) |
251 | while (i >= 0) |
219 | { |
252 | { |
220 | SV **svp = av_fetch(padlist, i--, FALSE); |
253 | SV **svp = av_fetch (padlist, i--, FALSE); |
221 | SV *sv = svp ? *svp : Nullsv; |
|
|
222 | if (sv) |
254 | if (svp) |
|
|
255 | { |
|
|
256 | SV *sv; |
|
|
257 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
223 | SvREFCNT_dec(sv); |
258 | SvREFCNT_dec (sv); |
|
|
259 | |
|
|
260 | SvREFCNT_dec (*svp); |
|
|
261 | } |
224 | } |
262 | } |
225 | |
263 | |
226 | SvREFCNT_dec((SV*)padlist); |
264 | SvREFCNT_dec ((SV*)padlist); |
227 | } |
265 | } |
228 | } |
266 | } |
229 | #endif |
267 | |
|
|
268 | STATIC int |
|
|
269 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
270 | { |
|
|
271 | AV *padlist; |
|
|
272 | AV *av = (AV *)mg->mg_obj; |
|
|
273 | |
|
|
274 | /* casting is fun. */ |
|
|
275 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
276 | free_padlist (aTHX_ padlist); |
|
|
277 | |
|
|
278 | SvREFCNT_dec (av); |
|
|
279 | } |
|
|
280 | |
|
|
281 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
|
|
282 | |
|
|
283 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
230 | |
284 | |
231 | /* the next two functions merely cache the padlists */ |
285 | /* the next two functions merely cache the padlists */ |
232 | STATIC void |
286 | STATIC void |
233 | get_padlist (CV *cv) |
287 | get_padlist (pTHX_ CV *cv) |
234 | { |
288 | { |
235 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); |
289 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
236 | |
290 | |
237 | if (he && AvFILLp ((AV *)*he) >= 0) |
291 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
238 | CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); |
292 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
239 | else |
293 | else |
240 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
294 | CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); |
241 | } |
295 | } |
242 | |
296 | |
243 | STATIC void |
297 | STATIC void |
244 | put_padlist (CV *cv) |
298 | put_padlist (pTHX_ CV *cv) |
245 | { |
299 | { |
246 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); |
300 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
247 | |
301 | |
248 | if (SvTYPE (*he) != SVt_PVAV) |
302 | if (!mg) |
249 | { |
303 | { |
250 | SvREFCNT_dec (*he); |
304 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
|
|
305 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
306 | mg->mg_virtual = &vtbl_coro; |
251 | *he = (SV *)newAV (); |
307 | mg->mg_obj = (SV *)newAV (); |
252 | } |
308 | } |
253 | |
309 | |
254 | av_push ((AV *)*he, (SV *)CvPADLIST (cv)); |
310 | av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); |
255 | } |
311 | } |
256 | |
|
|
257 | #ifdef MAY_FLUSH |
|
|
258 | STATIC void |
|
|
259 | flush_padlist_cache () |
|
|
260 | { |
|
|
261 | HV *hv = padlist_cache; |
|
|
262 | padlist_cache = newHV (); |
|
|
263 | |
|
|
264 | if (hv_iterinit (hv)) |
|
|
265 | { |
|
|
266 | HE *he; |
|
|
267 | AV *padlist; |
|
|
268 | |
|
|
269 | while (!!(he = hv_iternext (hv))) |
|
|
270 | { |
|
|
271 | AV *av = (AV *)HeVAL(he); |
|
|
272 | |
|
|
273 | /* casting is fun. */ |
|
|
274 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
275 | free_padlist (padlist); |
|
|
276 | } |
|
|
277 | } |
|
|
278 | |
|
|
279 | SvREFCNT_dec (hv); |
|
|
280 | } |
|
|
281 | #endif |
|
|
282 | |
312 | |
283 | #define SB do { |
313 | #define SB do { |
284 | #define SE } while (0) |
314 | #define SE } while (0) |
285 | |
315 | |
286 | #define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE |
316 | #define LOAD(state) load_state(aTHX_ (state)); |
287 | #define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE |
317 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
288 | |
318 | |
289 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
319 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
290 | |
320 | |
291 | static void |
321 | static void |
292 | load_state(pTHX_ Coro__State c) |
322 | load_state(pTHX_ Coro__State c) |
293 | { |
323 | { |
294 | PL_dowarn = c->dowarn; |
324 | PL_dowarn = c->dowarn; |
… | |
… | |
298 | PL_curstack = c->curstack; |
328 | PL_curstack = c->curstack; |
299 | PL_mainstack = c->mainstack; |
329 | PL_mainstack = c->mainstack; |
300 | PL_stack_sp = c->stack_sp; |
330 | PL_stack_sp = c->stack_sp; |
301 | PL_op = c->op; |
331 | PL_op = c->op; |
302 | PL_curpad = c->curpad; |
332 | PL_curpad = c->curpad; |
|
|
333 | PL_comppad = c->comppad; |
|
|
334 | PL_compcv = c->compcv; |
303 | PL_stack_base = c->stack_base; |
335 | PL_stack_base = c->stack_base; |
304 | PL_stack_max = c->stack_max; |
336 | PL_stack_max = c->stack_max; |
305 | PL_tmps_stack = c->tmps_stack; |
337 | PL_tmps_stack = c->tmps_stack; |
306 | PL_tmps_floor = c->tmps_floor; |
338 | PL_tmps_floor = c->tmps_floor; |
307 | PL_tmps_ix = c->tmps_ix; |
339 | PL_tmps_ix = c->tmps_ix; |
… | |
… | |
316 | PL_savestack_ix = c->savestack_ix; |
348 | PL_savestack_ix = c->savestack_ix; |
317 | PL_savestack_max = c->savestack_max; |
349 | PL_savestack_max = c->savestack_max; |
318 | PL_retstack = c->retstack; |
350 | PL_retstack = c->retstack; |
319 | PL_retstack_ix = c->retstack_ix; |
351 | PL_retstack_ix = c->retstack_ix; |
320 | PL_retstack_max = c->retstack_max; |
352 | PL_retstack_max = c->retstack_max; |
|
|
353 | PL_curpm = c->curpm; |
321 | PL_curcop = c->curcop; |
354 | PL_curcop = c->curcop; |
322 | PL_top_env = c->top_env; |
355 | PL_top_env = c->top_env; |
323 | |
356 | |
324 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
357 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
325 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
358 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
… | |
… | |
334 | { |
367 | { |
335 | AV *padlist = (AV *)POPs; |
368 | AV *padlist = (AV *)POPs; |
336 | |
369 | |
337 | if (padlist) |
370 | if (padlist) |
338 | { |
371 | { |
339 | put_padlist (cv); /* mark this padlist as available */ |
372 | put_padlist (aTHX_ cv); /* mark this padlist as available */ |
340 | CvPADLIST(cv) = padlist; |
373 | CvPADLIST(cv) = padlist; |
341 | #ifdef USE_THREADS |
|
|
342 | /*CvOWNER(cv) = (struct perl_thread *)POPs;*/ |
|
|
343 | #endif |
|
|
344 | } |
374 | } |
345 | |
375 | |
346 | ++CvDEPTH(cv); |
376 | ++CvDEPTH(cv); |
347 | } |
377 | } |
348 | |
378 | |
… | |
… | |
366 | |
396 | |
367 | PUSHs (Nullsv); |
397 | PUSHs (Nullsv); |
368 | /* this loop was inspired by pp_caller */ |
398 | /* this loop was inspired by pp_caller */ |
369 | for (;;) |
399 | for (;;) |
370 | { |
400 | { |
371 | do |
401 | while (cxix >= 0) |
372 | { |
402 | { |
373 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
403 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
374 | |
404 | |
375 | if (CxTYPE(cx) == CXt_SUB) |
405 | if (CxTYPE(cx) == CXt_SUB) |
376 | { |
406 | { |
377 | CV *cv = cx->blk_sub.cv; |
407 | CV *cv = cx->blk_sub.cv; |
378 | if (CvDEPTH(cv)) |
408 | if (CvDEPTH(cv)) |
379 | { |
409 | { |
380 | #ifdef USE_THREADS |
|
|
381 | /*XPUSHs ((SV *)CvOWNER(cv));*/ |
|
|
382 | /*CvOWNER(cv) = 0;*/ |
|
|
383 | /*error must unlock this cv etc.. etc...*/ |
|
|
384 | #endif |
|
|
385 | EXTEND (SP, CvDEPTH(cv)*2); |
410 | EXTEND (SP, CvDEPTH(cv)*2); |
386 | |
411 | |
387 | while (--CvDEPTH(cv)) |
412 | while (--CvDEPTH(cv)) |
388 | { |
413 | { |
389 | /* this tells the restore code to increment CvDEPTH */ |
414 | /* this tells the restore code to increment CvDEPTH */ |
… | |
… | |
392 | } |
417 | } |
393 | |
418 | |
394 | PUSHs ((SV *)CvPADLIST(cv)); |
419 | PUSHs ((SV *)CvPADLIST(cv)); |
395 | PUSHs ((SV *)cv); |
420 | PUSHs ((SV *)cv); |
396 | |
421 | |
397 | get_padlist (cv); /* this is a monster */ |
422 | get_padlist (aTHX_ cv); /* this is a monster */ |
398 | } |
423 | } |
399 | } |
424 | } |
|
|
425 | #ifdef CXt_FORMAT |
400 | else if (CxTYPE(cx) == CXt_FORMAT) |
426 | else if (CxTYPE(cx) == CXt_FORMAT) |
401 | { |
427 | { |
402 | /* I never used formats, so how should I know how these are implemented? */ |
428 | /* I never used formats, so how should I know how these are implemented? */ |
403 | /* my bold guess is as a simple, plain sub... */ |
429 | /* my bold guess is as a simple, plain sub... */ |
404 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
430 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
405 | } |
431 | } |
|
|
432 | #endif |
406 | } |
433 | } |
407 | while (cxix >= 0); |
|
|
408 | |
434 | |
409 | if (top_si->si_type == PERLSI_MAIN) |
435 | if (top_si->si_type == PERLSI_MAIN) |
410 | break; |
436 | break; |
411 | |
437 | |
412 | top_si = top_si->si_prev; |
438 | top_si = top_si->si_prev; |
… | |
… | |
418 | } |
444 | } |
419 | |
445 | |
420 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
446 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
421 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
447 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
422 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
448 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
423 | |
|
|
424 | /* I have not the slightest idea of why av_reify is necessary */ |
|
|
425 | /* but if it's missing the defav contents magically get replaced sometimes */ |
|
|
426 | if (c->defav) |
|
|
427 | av_reify (c->defav); |
|
|
428 | |
449 | |
429 | c->dowarn = PL_dowarn; |
450 | c->dowarn = PL_dowarn; |
430 | c->in_eval = PL_in_eval; |
451 | c->in_eval = PL_in_eval; |
431 | |
452 | |
432 | c->curstackinfo = PL_curstackinfo; |
453 | c->curstackinfo = PL_curstackinfo; |
433 | c->curstack = PL_curstack; |
454 | c->curstack = PL_curstack; |
434 | c->mainstack = PL_mainstack; |
455 | c->mainstack = PL_mainstack; |
435 | c->stack_sp = PL_stack_sp; |
456 | c->stack_sp = PL_stack_sp; |
436 | c->op = PL_op; |
457 | c->op = PL_op; |
437 | c->curpad = PL_curpad; |
458 | c->curpad = PL_curpad; |
|
|
459 | c->comppad = PL_comppad; |
|
|
460 | c->compcv = PL_compcv; |
438 | c->stack_base = PL_stack_base; |
461 | c->stack_base = PL_stack_base; |
439 | c->stack_max = PL_stack_max; |
462 | c->stack_max = PL_stack_max; |
440 | c->tmps_stack = PL_tmps_stack; |
463 | c->tmps_stack = PL_tmps_stack; |
441 | c->tmps_floor = PL_tmps_floor; |
464 | c->tmps_floor = PL_tmps_floor; |
442 | c->tmps_ix = PL_tmps_ix; |
465 | c->tmps_ix = PL_tmps_ix; |
… | |
… | |
451 | c->savestack_ix = PL_savestack_ix; |
474 | c->savestack_ix = PL_savestack_ix; |
452 | c->savestack_max = PL_savestack_max; |
475 | c->savestack_max = PL_savestack_max; |
453 | c->retstack = PL_retstack; |
476 | c->retstack = PL_retstack; |
454 | c->retstack_ix = PL_retstack_ix; |
477 | c->retstack_ix = PL_retstack_ix; |
455 | c->retstack_max = PL_retstack_max; |
478 | c->retstack_max = PL_retstack_max; |
|
|
479 | c->curpm = PL_curpm; |
456 | c->curcop = PL_curcop; |
480 | c->curcop = PL_curcop; |
457 | c->top_env = PL_top_env; |
481 | c->top_env = PL_top_env; |
458 | } |
482 | } |
459 | |
483 | |
460 | /* |
484 | /* |
461 | * allocate various perl stacks. This is an exact copy |
485 | * allocate various perl stacks. This is an exact copy |
462 | * of perl.c:init_stacks, except that it uses less memory |
486 | * of perl.c:init_stacks, except that it uses less memory |
463 | * on the assumption that coroutines do not usually need |
487 | * on the (sometimes correct) assumption that coroutines do |
464 | * a lot of stackspace. |
488 | * not usually need a lot of stackspace. |
465 | */ |
489 | */ |
466 | STATIC void |
490 | STATIC void |
467 | coro_init_stacks (pTHX) |
491 | coro_init_stacks (pTHX) |
468 | { |
492 | { |
|
|
493 | LOCK; |
|
|
494 | |
469 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
495 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
470 | PL_curstackinfo->si_type = PERLSI_MAIN; |
496 | PL_curstackinfo->si_type = PERLSI_MAIN; |
471 | PL_curstack = PL_curstackinfo->si_stack; |
497 | PL_curstack = PL_curstackinfo->si_stack; |
472 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
498 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
473 | |
499 | |
… | |
… | |
482 | |
508 | |
483 | New(54,PL_markstack,16,I32); |
509 | New(54,PL_markstack,16,I32); |
484 | PL_markstack_ptr = PL_markstack; |
510 | PL_markstack_ptr = PL_markstack; |
485 | PL_markstack_max = PL_markstack + 16; |
511 | PL_markstack_max = PL_markstack + 16; |
486 | |
512 | |
|
|
513 | #ifdef SET_MARK_OFFSET |
487 | SET_MARK_OFFSET; |
514 | SET_MARK_OFFSET; |
|
|
515 | #endif |
488 | |
516 | |
489 | New(54,PL_scopestack,16,I32); |
517 | New(54,PL_scopestack,16,I32); |
490 | PL_scopestack_ix = 0; |
518 | PL_scopestack_ix = 0; |
491 | PL_scopestack_max = 16; |
519 | PL_scopestack_max = 16; |
492 | |
520 | |
… | |
… | |
495 | PL_savestack_max = 96; |
523 | PL_savestack_max = 96; |
496 | |
524 | |
497 | New(54,PL_retstack,8,OP*); |
525 | New(54,PL_retstack,8,OP*); |
498 | PL_retstack_ix = 0; |
526 | PL_retstack_ix = 0; |
499 | PL_retstack_max = 8; |
527 | PL_retstack_max = 8; |
|
|
528 | |
|
|
529 | UNLOCK; |
500 | } |
530 | } |
501 | |
531 | |
502 | /* |
532 | /* |
503 | * destroy the stacks, the callchain etc... |
533 | * destroy the stacks, the callchain etc... |
504 | * still there is a memleak of 128 bytes... |
|
|
505 | */ |
534 | */ |
506 | STATIC void |
535 | STATIC void |
507 | destroy_stacks(pTHX) |
536 | destroy_stacks(pTHX) |
508 | { |
537 | { |
|
|
538 | if (!IN_DESTRUCT) |
|
|
539 | { |
509 | /* is this ugly, I ask? */ |
540 | /* is this ugly, I ask? */ |
510 | while (PL_scopestack_ix) |
541 | LEAVE_SCOPE (0); |
511 | LEAVE; |
|
|
512 | |
542 | |
513 | /* sure it is, but more important: is it correct?? :/ */ |
543 | /* sure it is, but more important: is it correct?? :/ */ |
514 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
|
|
515 | FREETMPS; |
544 | FREETMPS; |
|
|
545 | |
|
|
546 | /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ |
|
|
547 | } |
516 | |
548 | |
517 | while (PL_curstackinfo->si_next) |
549 | while (PL_curstackinfo->si_next) |
518 | PL_curstackinfo = PL_curstackinfo->si_next; |
550 | PL_curstackinfo = PL_curstackinfo->si_next; |
519 | |
551 | |
520 | while (PL_curstackinfo) |
552 | while (PL_curstackinfo) |
521 | { |
553 | { |
522 | PERL_SI *p = PL_curstackinfo->si_prev; |
554 | PERL_SI *p = PL_curstackinfo->si_prev; |
523 | |
555 | |
524 | { |
556 | { /*D*//*remove*/ |
525 | dSP; |
557 | dSP; |
526 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
558 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
527 | PUTBACK; /* possibly superfluous */ |
559 | PUTBACK; /* possibly superfluous */ |
528 | } |
560 | } |
529 | |
561 | |
530 | dounwind(-1); |
562 | if (!IN_DESTRUCT) |
531 | |
563 | { |
|
|
564 | dounwind (-1);/*D*//*remove*/ |
532 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
565 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
|
|
566 | } |
|
|
567 | |
533 | Safefree(PL_curstackinfo->si_cxstack); |
568 | Safefree (PL_curstackinfo->si_cxstack); |
534 | Safefree(PL_curstackinfo); |
569 | Safefree (PL_curstackinfo); |
535 | PL_curstackinfo = p; |
570 | PL_curstackinfo = p; |
536 | } |
571 | } |
537 | |
572 | |
538 | Safefree(PL_tmps_stack); |
573 | Safefree (PL_tmps_stack); |
539 | Safefree(PL_markstack); |
574 | Safefree (PL_markstack); |
540 | Safefree(PL_scopestack); |
575 | Safefree (PL_scopestack); |
541 | Safefree(PL_savestack); |
576 | Safefree (PL_savestack); |
542 | Safefree(PL_retstack); |
577 | Safefree (PL_retstack); |
543 | } |
578 | } |
544 | |
579 | |
545 | static void |
580 | static void |
546 | allocate_stack (Coro__State ctx, int alloc) |
581 | allocate_stack (Coro__State ctx, int alloc) |
547 | { |
582 | { |
… | |
… | |
550 | New (0, stack, 1, coro_stack); |
585 | New (0, stack, 1, coro_stack); |
551 | |
586 | |
552 | stack->refcnt = 1; |
587 | stack->refcnt = 1; |
553 | stack->usecnt = 1; |
588 | stack->usecnt = 1; |
554 | stack->gencnt = ctx->gencnt = 0; |
589 | stack->gencnt = ctx->gencnt = 0; |
|
|
590 | |
555 | if (alloc) |
591 | if (alloc) |
556 | { |
592 | { |
557 | #ifdef HAVE_MMAP |
593 | #if HAVE_MMAP |
558 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
594 | stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */ |
559 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); |
595 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
560 | if (stack->sptr == (void *)-1) |
596 | if (stack->sptr == (void *)-1) |
561 | #endif |
597 | #endif |
562 | { |
598 | { |
563 | /*FIXME*//*D*//* reasonable stack size! */ |
599 | /*FIXME*//*D*//* reasonable stack size! */ |
564 | stack->ssize = -4096 * sizeof (long); |
600 | stack->ssize = - (8192 * sizeof (long)); |
565 | New (0, stack->sptr, 4096, long); |
601 | New (0, stack->sptr, 8192, long); |
566 | } |
602 | } |
567 | } |
603 | } |
568 | else |
604 | else |
569 | stack->sptr = 0; |
605 | stack->sptr = 0; |
570 | |
606 | |
… | |
… | |
584 | { |
620 | { |
585 | #ifdef HAVE_MMAP |
621 | #ifdef HAVE_MMAP |
586 | if (stack->ssize > 0 && stack->sptr) |
622 | if (stack->ssize > 0 && stack->sptr) |
587 | munmap (stack->sptr, stack->ssize); |
623 | munmap (stack->sptr, stack->ssize); |
588 | else |
624 | else |
589 | #else |
625 | #endif |
590 | Safefree (stack->sptr); |
626 | Safefree (stack->sptr); |
591 | #endif |
627 | |
592 | Safefree (stack); |
628 | Safefree (stack); |
593 | } |
629 | } |
594 | else if (ctx->gencnt == stack->gencnt) |
630 | else if (ctx->gencnt == stack->gencnt) |
595 | --stack->usecnt; |
631 | --stack->usecnt; |
596 | } |
632 | } |
… | |
… | |
600 | setup_coro (void *arg) |
636 | setup_coro (void *arg) |
601 | { |
637 | { |
602 | /* |
638 | /* |
603 | * emulate part of the perl startup here. |
639 | * emulate part of the perl startup here. |
604 | */ |
640 | */ |
|
|
641 | dTHX; |
605 | dSP; |
642 | dSP; |
606 | Coro__State ctx = (Coro__State)arg; |
643 | Coro__State ctx = (Coro__State)arg; |
607 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
644 | SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE); |
608 | |
645 | |
609 | coro_init_stacks (aTHX); |
646 | coro_init_stacks (aTHX); |
610 | /*PL_curcop = 0;*/ |
647 | /*PL_curcop = 0;*/ |
611 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
648 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
612 | SvREFCNT_dec (GvAV (PL_defgv)); |
649 | SvREFCNT_dec (GvAV (PL_defgv)); |
613 | GvAV (PL_defgv) = ctx->args; |
650 | GvAV (PL_defgv) = ctx->args; ctx->args = 0; |
614 | |
651 | |
615 | SPAGAIN; |
652 | SPAGAIN; |
616 | |
653 | |
617 | if (ctx->stack) |
654 | if (ctx->stack) |
618 | { |
655 | { |
… | |
… | |
645 | * that doesn't matter, though, since it is only |
682 | * that doesn't matter, though, since it is only |
646 | * pp_nextstate and we never return... |
683 | * pp_nextstate and we never return... |
647 | * ah yes, and I don't care anyways ;) |
684 | * ah yes, and I don't care anyways ;) |
648 | */ |
685 | */ |
649 | PUTBACK; |
686 | PUTBACK; |
650 | PL_op = pp_entersub(); |
687 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
651 | SPAGAIN; |
688 | SPAGAIN; |
652 | |
689 | |
653 | ENTER; /* necessary e.g. for dounwind */ |
690 | ENTER; /* necessary e.g. for dounwind */ |
654 | } |
691 | } |
655 | } |
692 | } |
… | |
… | |
658 | continue_coro (void *arg) |
695 | continue_coro (void *arg) |
659 | { |
696 | { |
660 | /* |
697 | /* |
661 | * this is a _very_ stripped down perl interpreter ;) |
698 | * this is a _very_ stripped down perl interpreter ;) |
662 | */ |
699 | */ |
|
|
700 | dTHX; |
663 | Coro__State ctx = (Coro__State)arg; |
701 | Coro__State ctx = (Coro__State)arg; |
|
|
702 | JMPENV coro_start_env; |
664 | |
703 | |
665 | /*FIXME*//* must set up top_env here */ |
704 | PL_top_env = &ctx->start_env; |
|
|
705 | |
666 | ctx->cursp = 0; |
706 | ctx->cursp = 0; |
667 | PL_op = PL_op->op_next; |
707 | PL_op = PL_op->op_next; |
668 | CALLRUNOPS(aTHX); |
708 | CALLRUNOPS(aTHX); |
669 | |
709 | |
670 | abort (); |
710 | abort (); |
671 | } |
711 | } |
672 | |
712 | |
673 | STATIC void |
713 | STATIC void |
674 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
714 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
675 | { |
715 | { |
676 | dSP; |
|
|
677 | dSTACKLEVEL; |
716 | dSTACKLEVEL; |
678 | |
717 | |
679 | if (prev != next) |
718 | if (prev != next) |
680 | { |
719 | { |
681 | if (next->mainstack) |
720 | if (next->mainstack) |
682 | { |
721 | { |
|
|
722 | LOCK; |
683 | SAVE (prev, flags); |
723 | SAVE (prev, flags); |
684 | LOAD (next); |
724 | LOAD (next); |
|
|
725 | UNLOCK; |
685 | |
726 | |
686 | /* mark this state as in-use */ |
727 | /* mark this state as in-use */ |
687 | next->mainstack = 0; |
728 | next->mainstack = 0; |
688 | next->tmps_ix = -2; |
729 | next->tmps_ix = -2; |
689 | |
730 | |
… | |
… | |
708 | continue_coro, (void *)next, |
749 | continue_coro, (void *)next, |
709 | next->stack->sptr, labs (next->stack->ssize)); |
750 | next->stack->sptr, labs (next->stack->ssize)); |
710 | } |
751 | } |
711 | |
752 | |
712 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
753 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
754 | prev->cursp = stacklevel; |
|
|
755 | /* don't add any code here */ |
713 | } |
756 | } |
714 | |
757 | else |
|
|
758 | next->cursp = stacklevel; |
715 | } |
759 | } |
716 | else if (next->tmps_ix == -2) |
760 | else if (next->tmps_ix == -2) |
717 | croak ("tried to transfer to running coroutine"); |
761 | croak ("tried to transfer to running coroutine"); |
718 | else |
762 | else |
719 | { |
763 | { |
|
|
764 | LOCK; |
720 | SAVE (prev, -1); /* first get rid of the old state */ |
765 | SAVE (prev, -1); /* first get rid of the old state */ |
|
|
766 | UNLOCK; |
721 | |
767 | |
722 | if (flags & TRANSFER_SAVE_CCTXT) |
768 | if (flags & TRANSFER_SAVE_CCTXT) |
723 | { |
769 | { |
724 | if (!prev->stack) |
770 | if (!prev->stack) |
725 | allocate_stack (prev, 0); |
771 | allocate_stack (prev, 0); |
726 | |
772 | |
727 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
773 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
728 | { |
774 | { |
|
|
775 | PL_top_env = &next->start_env; |
|
|
776 | |
729 | setup_coro (next); |
777 | setup_coro (next); |
|
|
778 | next->cursp = stacklevel; |
730 | |
779 | |
731 | prev->stack->refcnt++; |
780 | prev->stack->refcnt++; |
732 | prev->stack->usecnt++; |
781 | prev->stack->usecnt++; |
733 | next->stack = prev->stack; |
782 | next->stack = prev->stack; |
734 | next->gencnt = prev->gencnt; |
783 | next->gencnt = prev->gencnt; |
735 | } |
784 | } |
736 | else |
785 | else |
737 | { |
786 | { |
|
|
787 | assert (!next->stack); |
738 | allocate_stack (next, 1); |
788 | allocate_stack (next, 1); |
739 | coro_create (&(next->stack->cctx), |
789 | coro_create (&(next->stack->cctx), |
740 | setup_coro, (void *)next, |
790 | setup_coro, (void *)next, |
741 | next->stack->sptr, labs (next->stack->ssize)); |
791 | next->stack->sptr, labs (next->stack->ssize)); |
742 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
792 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
793 | prev->cursp = stacklevel; |
|
|
794 | /* don't add any code here */ |
743 | } |
795 | } |
744 | } |
796 | } |
745 | else |
797 | else |
|
|
798 | { |
746 | setup_coro (next); |
799 | setup_coro (next); |
|
|
800 | next->cursp = stacklevel; |
|
|
801 | } |
747 | } |
802 | } |
748 | } |
803 | } |
749 | |
804 | |
750 | next->cursp = stacklevel; |
805 | LOCK; |
|
|
806 | if (coro_mortal) |
|
|
807 | { |
|
|
808 | SvREFCNT_dec (coro_mortal); |
|
|
809 | coro_mortal = 0; |
|
|
810 | } |
|
|
811 | UNLOCK; |
|
|
812 | } |
|
|
813 | |
|
|
814 | #define SV_CORO(sv,func) \ |
|
|
815 | do { \ |
|
|
816 | if (SvROK (sv)) \ |
|
|
817 | sv = SvRV (sv); \ |
|
|
818 | \ |
|
|
819 | if (SvTYPE (sv) == SVt_PVHV) \ |
|
|
820 | { \ |
|
|
821 | HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ |
|
|
822 | \ |
|
|
823 | if (!he) \ |
|
|
824 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ |
|
|
825 | \ |
|
|
826 | (sv) = SvRV (HeVAL(he)); \ |
|
|
827 | } \ |
|
|
828 | \ |
|
|
829 | /* must also be changed inside Coro::Cont::yield */ \ |
|
|
830 | if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ |
|
|
831 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
|
|
832 | \ |
|
|
833 | } while(0) |
|
|
834 | |
|
|
835 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
|
|
836 | |
|
|
837 | static void |
|
|
838 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
|
|
839 | { |
|
|
840 | SV_CORO (prev, "Coro::transfer"); |
|
|
841 | SV_CORO (next, "Coro::transfer"); |
|
|
842 | |
|
|
843 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
|
|
844 | } |
|
|
845 | |
|
|
846 | /** Coro ********************************************************************/ |
|
|
847 | |
|
|
848 | #define PRIO_MAX 3 |
|
|
849 | #define PRIO_HIGH 1 |
|
|
850 | #define PRIO_NORMAL 0 |
|
|
851 | #define PRIO_LOW -1 |
|
|
852 | #define PRIO_IDLE -3 |
|
|
853 | #define PRIO_MIN -4 |
|
|
854 | |
|
|
855 | /* for Coro.pm */ |
|
|
856 | static GV *coro_current, *coro_idle; |
|
|
857 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
|
|
858 | static int coro_nready; |
|
|
859 | |
|
|
860 | static void |
|
|
861 | coro_enq (pTHX_ SV *sv) |
|
|
862 | { |
|
|
863 | if (SvTYPE (sv) == SVt_PVHV) |
|
|
864 | { |
|
|
865 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
866 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
867 | |
|
|
868 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
869 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
870 | : prio; |
|
|
871 | |
|
|
872 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
873 | coro_nready++; |
|
|
874 | |
|
|
875 | return; |
|
|
876 | } |
|
|
877 | |
|
|
878 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
879 | } |
|
|
880 | |
|
|
881 | static SV * |
|
|
882 | coro_deq (pTHX_ int min_prio) |
|
|
883 | { |
|
|
884 | int prio = PRIO_MAX - PRIO_MIN; |
|
|
885 | |
|
|
886 | min_prio -= PRIO_MIN; |
|
|
887 | if (min_prio < 0) |
|
|
888 | min_prio = 0; |
|
|
889 | |
|
|
890 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
|
|
891 | if (av_len (coro_ready[prio]) >= 0) |
|
|
892 | { |
|
|
893 | coro_nready--; |
|
|
894 | return av_shift (coro_ready[prio]); |
|
|
895 | } |
|
|
896 | |
|
|
897 | return 0; |
|
|
898 | } |
|
|
899 | |
|
|
900 | static void |
|
|
901 | api_ready (SV *coro) |
|
|
902 | { |
|
|
903 | dTHX; |
|
|
904 | |
|
|
905 | if (SvROK (coro)) |
|
|
906 | coro = SvRV (coro); |
|
|
907 | |
|
|
908 | LOCK; |
|
|
909 | coro_enq (aTHX_ SvREFCNT_inc (coro)); |
|
|
910 | UNLOCK; |
|
|
911 | } |
|
|
912 | |
|
|
913 | static void |
|
|
914 | api_schedule (void) |
|
|
915 | { |
|
|
916 | dTHX; |
|
|
917 | |
|
|
918 | SV *prev, *next; |
|
|
919 | |
|
|
920 | LOCK; |
|
|
921 | |
|
|
922 | prev = SvRV (GvSV (coro_current)); |
|
|
923 | next = coro_deq (aTHX_ PRIO_MIN); |
|
|
924 | |
|
|
925 | if (!next) |
|
|
926 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
|
|
927 | |
|
|
928 | /* free this only after the transfer */ |
|
|
929 | coro_mortal = prev; |
|
|
930 | SV_CORO (prev, "Coro::schedule"); |
|
|
931 | |
|
|
932 | SvRV (GvSV (coro_current)) = next; |
|
|
933 | |
|
|
934 | SV_CORO (next, "Coro::schedule"); |
|
|
935 | |
|
|
936 | UNLOCK; |
|
|
937 | |
|
|
938 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), |
|
|
939 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
|
|
940 | } |
|
|
941 | |
|
|
942 | static void |
|
|
943 | api_cede (void) |
|
|
944 | { |
|
|
945 | dTHX; |
|
|
946 | |
|
|
947 | LOCK; |
|
|
948 | coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
949 | UNLOCK; |
|
|
950 | |
|
|
951 | api_schedule (); |
751 | } |
952 | } |
752 | |
953 | |
753 | MODULE = Coro::State PACKAGE = Coro::State |
954 | MODULE = Coro::State PACKAGE = Coro::State |
754 | |
955 | |
755 | PROTOTYPES: ENABLE |
956 | PROTOTYPES: ENABLE |
756 | |
957 | |
757 | BOOT: |
958 | BOOT: |
758 | { /* {} necessary for stoopid perl-5.6.x */ |
959 | { /* {} necessary for stoopid perl-5.6.x */ |
|
|
960 | #ifdef USE_ITHREADS |
|
|
961 | MUTEX_INIT (&coro_mutex); |
|
|
962 | #endif |
|
|
963 | |
759 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
964 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
760 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
965 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
761 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
966 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
762 | |
967 | |
763 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
968 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
764 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
969 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
765 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
970 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
766 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
971 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
767 | |
972 | |
768 | if (!padlist_cache) |
|
|
769 | padlist_cache = newHV (); |
|
|
770 | |
|
|
771 | main_mainstack = PL_mainstack; |
973 | main_mainstack = PL_mainstack; |
|
|
974 | |
|
|
975 | coroapi.ver = CORO_API_VERSION; |
|
|
976 | coroapi.transfer = api_transfer; |
772 | } |
977 | } |
773 | |
978 | |
774 | Coro::State |
979 | Coro::State |
775 | _newprocess(args) |
980 | _newprocess(args) |
776 | SV * args |
981 | SV * args |
… | |
… | |
779 | Coro__State coro; |
984 | Coro__State coro; |
780 | |
985 | |
781 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
986 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
782 | croak ("Coro::State::_newprocess expects an arrayref"); |
987 | croak ("Coro::State::_newprocess expects an arrayref"); |
783 | |
988 | |
784 | New (0, coro, 1, struct coro); |
989 | Newz (0, coro, 1, struct coro); |
785 | |
990 | |
786 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
991 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
787 | coro->mainstack = 0; /* actual work is done inside transfer */ |
992 | /*coro->mainstack = 0; *//*actual work is done inside transfer */ |
788 | coro->stack = 0; |
993 | /*coro->stack = 0;*/ |
|
|
994 | |
|
|
995 | /* same as JMPENV_BOOTSTRAP */ |
|
|
996 | /* we might be able to recycle start_env, but safe is safe */ |
|
|
997 | /*Zero(&coro->start_env, 1, JMPENV);*/ |
|
|
998 | coro->start_env.je_ret = -1; |
|
|
999 | coro->start_env.je_mustcatch = TRUE; |
789 | |
1000 | |
790 | RETVAL = coro; |
1001 | RETVAL = coro; |
791 | OUTPUT: |
1002 | OUTPUT: |
792 | RETVAL |
1003 | RETVAL |
793 | |
1004 | |
794 | void |
1005 | void |
795 | transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) |
1006 | transfer(prev, next, flags) |
796 | Coro::State_or_hashref prev |
1007 | SV *prev |
797 | Coro::State_or_hashref next |
1008 | SV *next |
798 | int flags |
1009 | int flags |
799 | PROTOTYPE: @ |
1010 | PROTOTYPE: @ |
800 | CODE: |
1011 | CODE: |
801 | PUTBACK; |
1012 | PUTBACK; |
|
|
1013 | SV_CORO (next, "Coro::transfer"); |
|
|
1014 | SV_CORO (prev, "Coro::transfer"); |
802 | transfer (aTHX_ prev, next, flags); |
1015 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
803 | SPAGAIN; |
1016 | SPAGAIN; |
804 | |
1017 | |
805 | void |
1018 | void |
806 | DESTROY(coro) |
1019 | DESTROY(coro) |
807 | Coro::State coro |
1020 | Coro::State coro |
… | |
… | |
809 | |
1022 | |
810 | if (coro->mainstack && coro->mainstack != main_mainstack) |
1023 | if (coro->mainstack && coro->mainstack != main_mainstack) |
811 | { |
1024 | { |
812 | struct coro temp; |
1025 | struct coro temp; |
813 | |
1026 | |
|
|
1027 | PUTBACK; |
814 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
1028 | SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL); |
815 | LOAD(aTHX_ coro); |
1029 | LOAD (aTHX_ coro); |
|
|
1030 | SPAGAIN; |
816 | |
1031 | |
817 | destroy_stacks (aTHX); |
1032 | destroy_stacks (aTHX); |
818 | |
1033 | |
819 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
1034 | LOAD ((&temp)); /* this will get rid of defsv etc.. */ |
|
|
1035 | SPAGAIN; |
820 | |
1036 | |
821 | coro->mainstack = 0; |
1037 | coro->mainstack = 0; |
822 | } |
1038 | } |
823 | |
1039 | |
824 | deallocate_stack (coro); |
1040 | deallocate_stack (coro); |
825 | |
1041 | SvREFCNT_dec (coro->args); |
826 | Safefree (coro); |
1042 | Safefree (coro); |
827 | |
|
|
828 | void |
|
|
829 | flush() |
|
|
830 | CODE: |
|
|
831 | #ifdef MAY_FLUSH |
|
|
832 | flush_padlist_cache (); |
|
|
833 | #endif |
|
|
834 | |
1043 | |
835 | void |
1044 | void |
836 | _exit(code) |
1045 | _exit(code) |
837 | int code |
1046 | int code |
838 | PROTOTYPE: $ |
1047 | PROTOTYPE: $ |
839 | CODE: |
1048 | CODE: |
840 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
|
|
841 | _exit (code); |
1049 | _exit (code); |
842 | #else |
|
|
843 | signal (SIGTERM, SIG_DFL); |
|
|
844 | raise (SIGTERM); |
|
|
845 | exit (code); |
|
|
846 | #endif |
|
|
847 | |
1050 | |
848 | MODULE = Coro::State PACKAGE = Coro::Cont |
1051 | MODULE = Coro::State PACKAGE = Coro::Cont |
849 | |
1052 | |
850 | # this is slightly dirty |
1053 | # this is slightly dirty (should expose a c-level api) |
851 | |
1054 | |
852 | void |
1055 | void |
853 | yield(...) |
1056 | yield(...) |
854 | PROTOTYPE: @ |
1057 | PROTOTYPE: @ |
855 | CODE: |
1058 | CODE: |
856 | static SV *returnstk; |
1059 | SV *yieldstack; |
857 | SV *sv; |
1060 | SV *sv; |
858 | AV *defav = GvAV (PL_defgv); |
1061 | AV *defav = GvAV (PL_defgv); |
859 | struct coro *prev, *next; |
1062 | struct coro *prev, *next; |
860 | |
1063 | |
861 | if (!returnstk) |
1064 | yieldstack = *hv_fetch ( |
862 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
1065 | (HV *)SvRV (GvSV (coro_current)), |
|
|
1066 | "yieldstack", sizeof ("yieldstack") - 1, |
|
|
1067 | 0 |
|
|
1068 | ); |
863 | |
1069 | |
864 | /* set up @_ -- ugly */ |
1070 | /* set up @_ -- ugly */ |
865 | av_clear (defav); |
1071 | av_clear (defav); |
866 | av_fill (defav, items - 1); |
1072 | av_fill (defav, items - 1); |
867 | while (items--) |
1073 | while (items--) |
868 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
1074 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
869 | |
1075 | |
870 | mg_get (returnstk); /* isn't documentation wrong for mg_get? */ |
|
|
871 | sv = av_pop ((AV *)SvRV (returnstk)); |
1076 | sv = av_pop ((AV *)SvRV (yieldstack)); |
872 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
1077 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
873 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
1078 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
874 | SvREFCNT_dec (sv); |
1079 | SvREFCNT_dec (sv); |
875 | |
1080 | |
876 | transfer(aTHX_ prev, next, 0); |
1081 | transfer (aTHX_ prev, next, 0); |
877 | |
1082 | |
|
|
1083 | MODULE = Coro::State PACKAGE = Coro |
|
|
1084 | |
|
|
1085 | # this is slightly dirty (should expose a c-level api) |
|
|
1086 | |
|
|
1087 | BOOT: |
|
|
1088 | { |
|
|
1089 | int i; |
|
|
1090 | HV *stash = gv_stashpv ("Coro", TRUE); |
|
|
1091 | |
|
|
1092 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
|
|
1093 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
|
|
1094 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
|
|
1095 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
|
|
1096 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
|
|
1097 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
|
|
1098 | |
|
|
1099 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
|
|
1100 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
|
|
1101 | |
|
|
1102 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
|
|
1103 | coro_ready[i] = newAV (); |
|
|
1104 | |
|
|
1105 | { |
|
|
1106 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
1107 | |
|
|
1108 | coroapi.schedule = api_schedule; |
|
|
1109 | coroapi.cede = api_cede; |
|
|
1110 | coroapi.ready = api_ready; |
|
|
1111 | coroapi.nready = &coro_nready; |
|
|
1112 | coroapi.current = coro_current; |
|
|
1113 | |
|
|
1114 | GCoroAPI = &coroapi; |
|
|
1115 | sv_setiv(sv, (IV)&coroapi); |
|
|
1116 | SvREADONLY_on(sv); |
|
|
1117 | } |
|
|
1118 | } |
|
|
1119 | |
|
|
1120 | #if !PERL_MICRO |
|
|
1121 | |
|
|
1122 | void |
|
|
1123 | ready(self) |
|
|
1124 | SV * self |
|
|
1125 | PROTOTYPE: $ |
|
|
1126 | CODE: |
|
|
1127 | api_ready (self); |
|
|
1128 | |
|
|
1129 | #endif |
|
|
1130 | |
|
|
1131 | int |
|
|
1132 | nready(...) |
|
|
1133 | PROTOTYPE: |
|
|
1134 | CODE: |
|
|
1135 | RETVAL = coro_nready; |
|
|
1136 | OUTPUT: |
|
|
1137 | RETVAL |
|
|
1138 | |
|
|
1139 | void |
|
|
1140 | schedule(...) |
|
|
1141 | PROTOTYPE: |
|
|
1142 | CODE: |
|
|
1143 | api_schedule (); |
|
|
1144 | |
|
|
1145 | void |
|
|
1146 | cede(...) |
|
|
1147 | PROTOTYPE: |
|
|
1148 | CODE: |
|
|
1149 | api_cede (); |
|
|
1150 | |