1 | #include "EXTERN.h" |
1 | #include "EXTERN.h" |
2 | #include "perl.h" |
2 | #include "perl.h" |
3 | #include "XSUB.h" |
3 | #include "XSUB.h" |
|
|
4 | |
|
|
5 | #include "patchlevel.h" |
|
|
6 | |
|
|
7 | #if PATCHLEVEL < 6 |
|
|
8 | # ifndef PL_ppaddr |
|
|
9 | # define PL_ppaddr ppaddr |
|
|
10 | # endif |
|
|
11 | # ifndef call_sv |
|
|
12 | # define call_sv perl_call_sv |
|
|
13 | # endif |
|
|
14 | # ifndef get_sv |
|
|
15 | # define get_sv perl_get_sv |
|
|
16 | # endif |
|
|
17 | # ifndef get_cv |
|
|
18 | # define get_cv perl_get_cv |
|
|
19 | # endif |
|
|
20 | # ifndef IS_PADGV |
|
|
21 | # define IS_PADGV(v) 0 |
|
|
22 | # endif |
|
|
23 | # ifndef IS_PADCONST |
|
|
24 | # define IS_PADCONST(v) 0 |
|
|
25 | # endif |
|
|
26 | #endif |
4 | |
27 | |
5 | #include "libcoro/coro.c" |
28 | #include "libcoro/coro.c" |
6 | |
29 | |
7 | #include <signal.h> |
30 | #include <signal.h> |
8 | |
31 | |
… | |
… | |
16 | # undef HAVE_MMAP |
39 | # undef HAVE_MMAP |
17 | # endif |
40 | # endif |
18 | # endif |
41 | # endif |
19 | #endif |
42 | #endif |
20 | |
43 | |
21 | #define MAY_FLUSH /* increases codesize and is rarely used */ |
|
|
22 | |
|
|
23 | #define SUB_INIT "Coro::State::initialize" |
44 | #define SUB_INIT "Coro::State::initialize" |
24 | #define UCORO_STATE "_coro_state" |
45 | #define UCORO_STATE "_coro_state" |
25 | |
46 | |
26 | /* The next macro should declare a variable stacklevel that contains and approximation |
47 | /* The next macro should declare a variable stacklevel that contains and approximation |
27 | * to the current C stack pointer. Its property is that it changes with each call |
48 | * to the current C stack pointer. Its property is that it changes with each call |
… | |
… | |
47 | void *sptr; |
68 | void *sptr; |
48 | long ssize; /* positive == mmap, otherwise malloc */ |
69 | long ssize; /* positive == mmap, otherwise malloc */ |
49 | } coro_stack; |
70 | } coro_stack; |
50 | |
71 | |
51 | struct coro { |
72 | struct coro { |
|
|
73 | /* the top-level JMPENV for each coroutine, needed to catch dies. */ |
|
|
74 | JMPENV start_env; |
|
|
75 | |
52 | /* the optional C context */ |
76 | /* the optional C context */ |
53 | coro_stack *stack; |
77 | coro_stack *stack; |
54 | void *cursp; |
78 | void *cursp; |
55 | int gencnt; |
79 | int gencnt; |
56 | |
80 | |
57 | /* optionally saved, might be zero */ |
81 | /* optionally saved, might be zero */ |
58 | AV *defav; |
82 | AV *defav; |
59 | SV *defsv; |
83 | SV *defsv; |
60 | SV *errsv; |
84 | SV *errsv; |
61 | /* TODO: PL_pmop might be nice && effortless to save. */ |
|
|
62 | |
85 | |
63 | /* saved global state not related to stacks */ |
86 | /* saved global state not related to stacks */ |
64 | U8 dowarn; |
87 | U8 dowarn; |
65 | I32 in_eval; |
88 | I32 in_eval; |
66 | |
89 | |
… | |
… | |
69 | AV *curstack; |
92 | AV *curstack; |
70 | AV *mainstack; |
93 | AV *mainstack; |
71 | SV **stack_sp; |
94 | SV **stack_sp; |
72 | OP *op; |
95 | OP *op; |
73 | SV **curpad; |
96 | SV **curpad; |
|
|
97 | AV *comppad; |
74 | SV **stack_base; |
98 | SV **stack_base; |
75 | SV **stack_max; |
99 | SV **stack_max; |
76 | SV **tmps_stack; |
100 | SV **tmps_stack; |
77 | I32 tmps_floor; |
101 | I32 tmps_floor; |
78 | I32 tmps_ix; |
102 | I32 tmps_ix; |
… | |
… | |
158 | sv = (SV *) newAV (); |
182 | sv = (SV *) newAV (); |
159 | else if (*name == '%') |
183 | else if (*name == '%') |
160 | sv = (SV *) newHV (); |
184 | sv = (SV *) newHV (); |
161 | else |
185 | else |
162 | sv = NEWSV (0, 0); |
186 | sv = NEWSV (0, 0); |
|
|
187 | #ifdef SvPADBUSY |
163 | if (!SvPADBUSY (sv)) |
188 | if (!SvPADBUSY (sv)) |
|
|
189 | #endif |
164 | SvPADMY_on (sv); |
190 | SvPADMY_on (sv); |
165 | npad[ix] = sv; |
191 | npad[ix] = sv; |
166 | } |
192 | } |
167 | } |
193 | } |
168 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
194 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
… | |
… | |
198 | #endif |
224 | #endif |
199 | |
225 | |
200 | return newpadlist; |
226 | return newpadlist; |
201 | } |
227 | } |
202 | |
228 | |
203 | #ifdef MAY_FLUSH |
|
|
204 | STATIC void |
229 | STATIC void |
205 | free_padlist (AV *padlist) |
230 | free_padlist (AV *padlist) |
206 | { |
231 | { |
207 | /* may be during global destruction */ |
232 | /* may be during global destruction */ |
208 | if (SvREFCNT(padlist)) |
233 | if (SvREFCNT (padlist)) |
209 | { |
234 | { |
210 | I32 i = AvFILLp(padlist); |
235 | I32 i = AvFILLp (padlist); |
211 | while (i >= 0) |
236 | while (i >= 0) |
212 | { |
237 | { |
213 | SV **svp = av_fetch(padlist, i--, FALSE); |
238 | SV **svp = av_fetch (padlist, i--, FALSE); |
214 | SV *sv = svp ? *svp : Nullsv; |
|
|
215 | if (sv) |
239 | if (svp) |
|
|
240 | { |
|
|
241 | SV *sv; |
|
|
242 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
216 | SvREFCNT_dec(sv); |
243 | SvREFCNT_dec (sv); |
|
|
244 | |
|
|
245 | SvREFCNT_dec (*svp); |
|
|
246 | } |
217 | } |
247 | } |
218 | |
248 | |
219 | SvREFCNT_dec((SV*)padlist); |
249 | SvREFCNT_dec ((SV*)padlist); |
220 | } |
250 | } |
221 | } |
251 | } |
222 | #endif |
252 | |
|
|
253 | STATIC int |
|
|
254 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
|
|
255 | { |
|
|
256 | AV *padlist; |
|
|
257 | AV *av = (AV *)mg->mg_obj; |
|
|
258 | |
|
|
259 | /* casting is fun. */ |
|
|
260 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
261 | free_padlist (padlist); |
|
|
262 | } |
|
|
263 | |
|
|
264 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
|
|
265 | |
|
|
266 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
223 | |
267 | |
224 | /* the next two functions merely cache the padlists */ |
268 | /* the next two functions merely cache the padlists */ |
225 | STATIC void |
269 | STATIC void |
226 | get_padlist (CV *cv) |
270 | get_padlist (CV *cv) |
227 | { |
271 | { |
228 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); |
272 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
229 | |
273 | |
230 | if (he && AvFILLp ((AV *)*he) >= 0) |
274 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
231 | CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); |
275 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
232 | else |
276 | else |
233 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
277 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
234 | } |
278 | } |
235 | |
279 | |
236 | STATIC void |
280 | STATIC void |
237 | put_padlist (CV *cv) |
281 | put_padlist (CV *cv) |
238 | { |
282 | { |
239 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); |
283 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
240 | |
284 | |
241 | if (SvTYPE (*he) != SVt_PVAV) |
285 | if (!mg) |
242 | { |
286 | { |
243 | SvREFCNT_dec (*he); |
287 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
|
|
288 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
289 | mg->mg_virtual = &vtbl_coro; |
244 | *he = (SV *)newAV (); |
290 | mg->mg_obj = (SV *)newAV (); |
245 | } |
291 | } |
246 | |
292 | |
247 | av_push ((AV *)*he, (SV *)CvPADLIST (cv)); |
293 | av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); |
248 | } |
294 | } |
249 | |
|
|
250 | #ifdef MAY_FLUSH |
|
|
251 | STATIC void |
|
|
252 | flush_padlist_cache () |
|
|
253 | { |
|
|
254 | HV *hv = padlist_cache; |
|
|
255 | padlist_cache = newHV (); |
|
|
256 | |
|
|
257 | if (hv_iterinit (hv)) |
|
|
258 | { |
|
|
259 | HE *he; |
|
|
260 | AV *padlist; |
|
|
261 | |
|
|
262 | while (!!(he = hv_iternext (hv))) |
|
|
263 | { |
|
|
264 | AV *av = (AV *)HeVAL(he); |
|
|
265 | |
|
|
266 | /* casting is fun. */ |
|
|
267 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
268 | free_padlist (padlist); |
|
|
269 | } |
|
|
270 | } |
|
|
271 | |
|
|
272 | SvREFCNT_dec (hv); |
|
|
273 | } |
|
|
274 | #endif |
|
|
275 | |
295 | |
276 | #define SB do { |
296 | #define SB do { |
277 | #define SE } while (0) |
297 | #define SE } while (0) |
278 | |
298 | |
279 | #define LOAD(state) load_state(aTHX_ (state)); |
299 | #define LOAD(state) load_state(aTHX_ (state)); |
280 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
300 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
281 | |
301 | |
282 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
302 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
283 | |
303 | |
284 | static void |
304 | static void |
285 | load_state(pTHX_ Coro__State c) |
305 | load_state(pTHX_ Coro__State c) |
286 | { |
306 | { |
287 | PL_dowarn = c->dowarn; |
307 | PL_dowarn = c->dowarn; |
… | |
… | |
291 | PL_curstack = c->curstack; |
311 | PL_curstack = c->curstack; |
292 | PL_mainstack = c->mainstack; |
312 | PL_mainstack = c->mainstack; |
293 | PL_stack_sp = c->stack_sp; |
313 | PL_stack_sp = c->stack_sp; |
294 | PL_op = c->op; |
314 | PL_op = c->op; |
295 | PL_curpad = c->curpad; |
315 | PL_curpad = c->curpad; |
|
|
316 | PL_comppad = c->comppad; |
296 | PL_stack_base = c->stack_base; |
317 | PL_stack_base = c->stack_base; |
297 | PL_stack_max = c->stack_max; |
318 | PL_stack_max = c->stack_max; |
298 | PL_tmps_stack = c->tmps_stack; |
319 | PL_tmps_stack = c->tmps_stack; |
299 | PL_tmps_floor = c->tmps_floor; |
320 | PL_tmps_floor = c->tmps_floor; |
300 | PL_tmps_ix = c->tmps_ix; |
321 | PL_tmps_ix = c->tmps_ix; |
… | |
… | |
388 | PUSHs ((SV *)cv); |
409 | PUSHs ((SV *)cv); |
389 | |
410 | |
390 | get_padlist (cv); /* this is a monster */ |
411 | get_padlist (cv); /* this is a monster */ |
391 | } |
412 | } |
392 | } |
413 | } |
|
|
414 | #ifdef CXt_FORMAT |
393 | else if (CxTYPE(cx) == CXt_FORMAT) |
415 | else if (CxTYPE(cx) == CXt_FORMAT) |
394 | { |
416 | { |
395 | /* I never used formats, so how should I know how these are implemented? */ |
417 | /* I never used formats, so how should I know how these are implemented? */ |
396 | /* my bold guess is as a simple, plain sub... */ |
418 | /* my bold guess is as a simple, plain sub... */ |
397 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
419 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
398 | } |
420 | } |
|
|
421 | #endif |
399 | } |
422 | } |
400 | |
423 | |
401 | if (top_si->si_type == PERLSI_MAIN) |
424 | if (top_si->si_type == PERLSI_MAIN) |
402 | break; |
425 | break; |
403 | |
426 | |
… | |
… | |
420 | c->curstack = PL_curstack; |
443 | c->curstack = PL_curstack; |
421 | c->mainstack = PL_mainstack; |
444 | c->mainstack = PL_mainstack; |
422 | c->stack_sp = PL_stack_sp; |
445 | c->stack_sp = PL_stack_sp; |
423 | c->op = PL_op; |
446 | c->op = PL_op; |
424 | c->curpad = PL_curpad; |
447 | c->curpad = PL_curpad; |
|
|
448 | c->comppad = PL_comppad; |
425 | c->stack_base = PL_stack_base; |
449 | c->stack_base = PL_stack_base; |
426 | c->stack_max = PL_stack_max; |
450 | c->stack_max = PL_stack_max; |
427 | c->tmps_stack = PL_tmps_stack; |
451 | c->tmps_stack = PL_tmps_stack; |
428 | c->tmps_floor = PL_tmps_floor; |
452 | c->tmps_floor = PL_tmps_floor; |
429 | c->tmps_ix = PL_tmps_ix; |
453 | c->tmps_ix = PL_tmps_ix; |
… | |
… | |
445 | } |
469 | } |
446 | |
470 | |
447 | /* |
471 | /* |
448 | * allocate various perl stacks. This is an exact copy |
472 | * allocate various perl stacks. This is an exact copy |
449 | * of perl.c:init_stacks, except that it uses less memory |
473 | * of perl.c:init_stacks, except that it uses less memory |
450 | * on the assumption that coroutines do not usually need |
474 | * on the (sometimes correct) assumption that coroutines do |
451 | * a lot of stackspace. |
475 | * not usually need a lot of stackspace. |
452 | */ |
476 | */ |
453 | STATIC void |
477 | STATIC void |
454 | coro_init_stacks (pTHX) |
478 | coro_init_stacks (pTHX) |
455 | { |
479 | { |
456 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
480 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
… | |
… | |
469 | |
493 | |
470 | New(54,PL_markstack,16,I32); |
494 | New(54,PL_markstack,16,I32); |
471 | PL_markstack_ptr = PL_markstack; |
495 | PL_markstack_ptr = PL_markstack; |
472 | PL_markstack_max = PL_markstack + 16; |
496 | PL_markstack_max = PL_markstack + 16; |
473 | |
497 | |
|
|
498 | #ifdef SET_MARK_OFFSET |
474 | SET_MARK_OFFSET; |
499 | SET_MARK_OFFSET; |
|
|
500 | #endif |
475 | |
501 | |
476 | New(54,PL_scopestack,16,I32); |
502 | New(54,PL_scopestack,16,I32); |
477 | PL_scopestack_ix = 0; |
503 | PL_scopestack_ix = 0; |
478 | PL_scopestack_max = 16; |
504 | PL_scopestack_max = 16; |
479 | |
505 | |
… | |
… | |
486 | PL_retstack_max = 8; |
512 | PL_retstack_max = 8; |
487 | } |
513 | } |
488 | |
514 | |
489 | /* |
515 | /* |
490 | * destroy the stacks, the callchain etc... |
516 | * destroy the stacks, the callchain etc... |
491 | * still there is a memleak of 128 bytes... |
|
|
492 | */ |
517 | */ |
493 | STATIC void |
518 | STATIC void |
494 | destroy_stacks(pTHX) |
519 | destroy_stacks(pTHX) |
495 | { |
520 | { |
496 | if (!IN_DESTRUCT) |
521 | if (!IN_DESTRUCT) |
497 | { |
522 | { |
498 | /* is this ugly, I ask? */ |
523 | /* is this ugly, I ask? */ |
499 | while (PL_scopestack_ix) |
524 | LEAVE_SCOPE (0); |
500 | LEAVE; |
|
|
501 | |
525 | |
502 | /* sure it is, but more important: is it correct?? :/ */ |
526 | /* sure it is, but more important: is it correct?? :/ */ |
503 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
|
|
504 | FREETMPS; |
527 | FREETMPS; |
505 | } |
528 | } |
506 | |
529 | |
507 | while (PL_curstackinfo->si_next) |
530 | while (PL_curstackinfo->si_next) |
508 | PL_curstackinfo = PL_curstackinfo->si_next; |
531 | PL_curstackinfo = PL_curstackinfo->si_next; |
509 | |
532 | |
… | |
… | |
546 | stack->usecnt = 1; |
569 | stack->usecnt = 1; |
547 | stack->gencnt = ctx->gencnt = 0; |
570 | stack->gencnt = ctx->gencnt = 0; |
548 | if (alloc) |
571 | if (alloc) |
549 | { |
572 | { |
550 | #if HAVE_MMAP |
573 | #if HAVE_MMAP |
551 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
574 | stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */ |
552 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
575 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
553 | if (stack->sptr == (void *)-1) |
576 | if (stack->sptr == (void *)-1) |
554 | #endif |
577 | #endif |
555 | { |
578 | { |
556 | /*FIXME*//*D*//* reasonable stack size! */ |
579 | /*FIXME*//*D*//* reasonable stack size! */ |
557 | stack->ssize = -4096 * sizeof (long); |
580 | stack->ssize = - (8192 * sizeof (long)); |
558 | New (0, stack->sptr, 4096, long); |
581 | New (0, stack->sptr, 8192, long); |
559 | } |
582 | } |
560 | } |
583 | } |
561 | else |
584 | else |
562 | stack->sptr = 0; |
585 | stack->sptr = 0; |
563 | |
586 | |
… | |
… | |
577 | { |
600 | { |
578 | #ifdef HAVE_MMAP |
601 | #ifdef HAVE_MMAP |
579 | if (stack->ssize > 0 && stack->sptr) |
602 | if (stack->ssize > 0 && stack->sptr) |
580 | munmap (stack->sptr, stack->ssize); |
603 | munmap (stack->sptr, stack->ssize); |
581 | else |
604 | else |
582 | #else |
605 | #endif |
583 | Safefree (stack->sptr); |
606 | Safefree (stack->sptr); |
584 | #endif |
607 | |
585 | Safefree (stack); |
608 | Safefree (stack); |
586 | } |
609 | } |
587 | else if (ctx->gencnt == stack->gencnt) |
610 | else if (ctx->gencnt == stack->gencnt) |
588 | --stack->usecnt; |
611 | --stack->usecnt; |
589 | } |
612 | } |
… | |
… | |
595 | /* |
618 | /* |
596 | * emulate part of the perl startup here. |
619 | * emulate part of the perl startup here. |
597 | */ |
620 | */ |
598 | dSP; |
621 | dSP; |
599 | Coro__State ctx = (Coro__State)arg; |
622 | Coro__State ctx = (Coro__State)arg; |
600 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
623 | SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE); |
601 | |
624 | |
602 | coro_init_stacks (aTHX); |
625 | coro_init_stacks (aTHX); |
603 | /*PL_curcop = 0;*/ |
626 | /*PL_curcop = 0;*/ |
604 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
627 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
605 | SvREFCNT_dec (GvAV (PL_defgv)); |
628 | SvREFCNT_dec (GvAV (PL_defgv)); |
606 | GvAV (PL_defgv) = ctx->args; |
629 | GvAV (PL_defgv) = ctx->args; ctx->args = 0; |
607 | |
630 | |
608 | SPAGAIN; |
631 | SPAGAIN; |
609 | |
632 | |
610 | if (ctx->stack) |
633 | if (ctx->stack) |
611 | { |
634 | { |
… | |
… | |
638 | * that doesn't matter, though, since it is only |
661 | * that doesn't matter, though, since it is only |
639 | * pp_nextstate and we never return... |
662 | * pp_nextstate and we never return... |
640 | * ah yes, and I don't care anyways ;) |
663 | * ah yes, and I don't care anyways ;) |
641 | */ |
664 | */ |
642 | PUTBACK; |
665 | PUTBACK; |
643 | PL_op = pp_entersub(); |
666 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
644 | SPAGAIN; |
667 | SPAGAIN; |
645 | |
668 | |
646 | ENTER; /* necessary e.g. for dounwind */ |
669 | ENTER; /* necessary e.g. for dounwind */ |
647 | } |
670 | } |
648 | } |
671 | } |
… | |
… | |
654 | * this is a _very_ stripped down perl interpreter ;) |
677 | * this is a _very_ stripped down perl interpreter ;) |
655 | */ |
678 | */ |
656 | Coro__State ctx = (Coro__State)arg; |
679 | Coro__State ctx = (Coro__State)arg; |
657 | JMPENV coro_start_env; |
680 | JMPENV coro_start_env; |
658 | |
681 | |
659 | /* same as JMPENV_BOOTSTRAP */ |
|
|
660 | Zero(&coro_start_env, 1, JMPENV); |
|
|
661 | coro_start_env.je_ret = -1; |
|
|
662 | coro_start_env.je_mustcatch = TRUE; |
|
|
663 | PL_top_env = &coro_start_env; |
682 | PL_top_env = &ctx->start_env; |
664 | |
683 | |
665 | ctx->cursp = 0; |
684 | ctx->cursp = 0; |
666 | PL_op = PL_op->op_next; |
685 | PL_op = PL_op->op_next; |
667 | CALLRUNOPS(aTHX); |
686 | CALLRUNOPS(aTHX); |
668 | |
687 | |
… | |
… | |
726 | if (!prev->stack) |
745 | if (!prev->stack) |
727 | allocate_stack (prev, 0); |
746 | allocate_stack (prev, 0); |
728 | |
747 | |
729 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
748 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
730 | { |
749 | { |
|
|
750 | PL_top_env = &next->start_env; |
|
|
751 | |
731 | setup_coro (next); |
752 | setup_coro (next); |
732 | |
753 | |
733 | prev->stack->refcnt++; |
754 | prev->stack->refcnt++; |
734 | prev->stack->usecnt++; |
755 | prev->stack->usecnt++; |
735 | next->stack = prev->stack; |
756 | next->stack = prev->stack; |
736 | next->gencnt = prev->gencnt; |
757 | next->gencnt = prev->gencnt; |
737 | } |
758 | } |
738 | else |
759 | else |
739 | { |
760 | { |
|
|
761 | assert (!next->stack); |
740 | allocate_stack (next, 1); |
762 | allocate_stack (next, 1); |
741 | coro_create (&(next->stack->cctx), |
763 | coro_create (&(next->stack->cctx), |
742 | setup_coro, (void *)next, |
764 | setup_coro, (void *)next, |
743 | next->stack->sptr, labs (next->stack->ssize)); |
765 | next->stack->sptr, labs (next->stack->ssize)); |
744 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
766 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
… | |
… | |
749 | setup_coro (next); |
771 | setup_coro (next); |
750 | } |
772 | } |
751 | |
773 | |
752 | /* |
774 | /* |
753 | * xnext is now either prev or next, depending on wether |
775 | * xnext is now either prev or next, depending on wether |
754 | * we switched the c stack or not. that's why i use a global |
776 | * we switched the c stack or not. that's why I use a global |
755 | * variable, that should become thread-specific at one point. |
777 | * variable, that should become thread-specific at one point. |
756 | */ |
778 | */ |
757 | xnext->cursp = stacklevel; |
779 | xnext->cursp = stacklevel; |
758 | } |
780 | } |
759 | |
781 | |
… | |
… | |
868 | next = coro_deq (PRIO_MIN); |
890 | next = coro_deq (PRIO_MIN); |
869 | |
891 | |
870 | if (!next) |
892 | if (!next) |
871 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
893 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
872 | |
894 | |
|
|
895 | /* free this only after the transfer */ |
873 | coro_mortal = prev; |
896 | coro_mortal = prev; |
874 | SV_CORO (prev, "Coro::schedule"); |
897 | SV_CORO (prev, "Coro::schedule"); |
875 | |
898 | |
876 | SvRV (GvSV (coro_current)) = next; |
899 | SvRV (GvSV (coro_current)) = next; |
877 | |
900 | |
… | |
… | |
921 | Coro__State coro; |
944 | Coro__State coro; |
922 | |
945 | |
923 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
946 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
924 | croak ("Coro::State::_newprocess expects an arrayref"); |
947 | croak ("Coro::State::_newprocess expects an arrayref"); |
925 | |
948 | |
926 | New (0, coro, 1, struct coro); |
949 | Newz (0, coro, 1, struct coro); |
927 | |
950 | |
928 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
951 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
929 | coro->mainstack = 0; /* actual work is done inside transfer */ |
952 | coro->mainstack = 0; /* actual work is done inside transfer */ |
930 | coro->stack = 0; |
953 | coro->stack = 0; |
|
|
954 | |
|
|
955 | /* same as JMPENV_BOOTSTRAP */ |
|
|
956 | /* we might be able to recycle start_env, but safe is safe */ |
|
|
957 | //Zero(&coro->start_env, 1, JMPENV); |
|
|
958 | coro->start_env.je_ret = -1; |
|
|
959 | coro->start_env.je_mustcatch = TRUE; |
931 | |
960 | |
932 | RETVAL = coro; |
961 | RETVAL = coro; |
933 | OUTPUT: |
962 | OUTPUT: |
934 | RETVAL |
963 | RETVAL |
935 | |
964 | |
… | |
… | |
967 | |
996 | |
968 | coro->mainstack = 0; |
997 | coro->mainstack = 0; |
969 | } |
998 | } |
970 | |
999 | |
971 | deallocate_stack (coro); |
1000 | deallocate_stack (coro); |
972 | |
1001 | SvREFCNT_dec (coro->args); |
973 | Safefree (coro); |
1002 | Safefree (coro); |
974 | |
|
|
975 | void |
|
|
976 | flush() |
|
|
977 | CODE: |
|
|
978 | #ifdef MAY_FLUSH |
|
|
979 | flush_padlist_cache (); |
|
|
980 | #endif |
|
|
981 | |
1003 | |
982 | void |
1004 | void |
983 | _exit(code) |
1005 | _exit(code) |
984 | int code |
1006 | int code |
985 | PROTOTYPE: $ |
1007 | PROTOTYPE: $ |
986 | CODE: |
1008 | CODE: |
987 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
|
|
988 | _exit (code); |
1009 | _exit (code); |
989 | #else |
|
|
990 | signal (SIGTERM, SIG_DFL); |
|
|
991 | raise (SIGTERM); |
|
|
992 | exit (code); |
|
|
993 | #endif |
|
|
994 | |
1010 | |
995 | MODULE = Coro::State PACKAGE = Coro::Cont |
1011 | MODULE = Coro::State PACKAGE = Coro::Cont |
996 | |
1012 | |
997 | # this is slightly dirty (should expose a c-level api) |
1013 | # this is slightly dirty (should expose a c-level api) |
998 | |
1014 | |
… | |
… | |
1004 | SV *sv; |
1020 | SV *sv; |
1005 | AV *defav = GvAV (PL_defgv); |
1021 | AV *defav = GvAV (PL_defgv); |
1006 | struct coro *prev, *next; |
1022 | struct coro *prev, *next; |
1007 | |
1023 | |
1008 | if (!returnstk) |
1024 | if (!returnstk) |
1009 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
1025 | returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE)); |
1010 | |
1026 | |
1011 | /* set up @_ -- ugly */ |
1027 | /* set up @_ -- ugly */ |
1012 | av_clear (defav); |
1028 | av_clear (defav); |
1013 | av_fill (defav, items - 1); |
1029 | av_fill (defav, items - 1); |
1014 | while (items--) |
1030 | while (items--) |
… | |
… | |
1057 | sv_setiv(sv, (IV)&coroapi); |
1073 | sv_setiv(sv, (IV)&coroapi); |
1058 | SvREADONLY_on(sv); |
1074 | SvREADONLY_on(sv); |
1059 | } |
1075 | } |
1060 | } |
1076 | } |
1061 | |
1077 | |
|
|
1078 | #if !PERL_MICRO |
|
|
1079 | |
1062 | void |
1080 | void |
1063 | ready(self) |
1081 | ready(self) |
1064 | SV * self |
1082 | SV * self |
1065 | PROTOTYPE: $ |
1083 | PROTOTYPE: $ |
1066 | CODE: |
1084 | CODE: |
1067 | api_ready (self); |
1085 | api_ready (self); |
|
|
1086 | |
|
|
1087 | #endif |
1068 | |
1088 | |
1069 | int |
1089 | int |
1070 | nready(...) |
1090 | nready(...) |
1071 | PROTOTYPE: |
1091 | PROTOTYPE: |
1072 | CODE: |
1092 | CODE: |