… | |
… | |
2 | #include "perl.h" |
2 | #include "perl.h" |
3 | #include "XSUB.h" |
3 | #include "XSUB.h" |
4 | |
4 | |
5 | #include "libcoro/coro.c" |
5 | #include "libcoro/coro.c" |
6 | |
6 | |
|
|
7 | #include <signal.h> |
|
|
8 | |
7 | #ifdef HAVE_MMAP |
9 | #ifdef HAVE_MMAP |
8 | # include <unistd.h> |
10 | # include <unistd.h> |
9 | # include <sys/mman.h> |
11 | # include <sys/mman.h> |
|
|
12 | # ifndef MAP_ANONYMOUS |
|
|
13 | # ifdef MAP_ANON |
|
|
14 | # define MAP_ANONYMOUS MAP_ANON |
|
|
15 | # else |
|
|
16 | # undef HAVE_MMAP |
|
|
17 | # endif |
|
|
18 | # endif |
10 | #endif |
19 | #endif |
11 | |
20 | |
12 | #define MAY_FLUSH /* increases codesize */ |
21 | #define MAY_FLUSH /* increases codesize and is rarely used */ |
13 | |
|
|
14 | #define TRANSFER_SAVE_DEFAV 0x00000001 |
|
|
15 | #define TRANSFER_SAVE_DEFSV 0x00000002 |
|
|
16 | #define TRANSFER_SAVE_ERRSV 0x00000004 |
|
|
17 | #define TRANSFER_SAVE_CCTXT 0x00000008 |
|
|
18 | |
|
|
19 | #define TRANSFER_SAVE_ALL -1 |
|
|
20 | |
22 | |
21 | #define SUB_INIT "Coro::State::initialize" |
23 | #define SUB_INIT "Coro::State::initialize" |
22 | #define UCORO_STATE "_coro_state" |
24 | #define UCORO_STATE "_coro_state" |
23 | |
25 | |
|
|
26 | /* 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 |
|
|
28 | * and should be unique. */ |
|
|
29 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
|
|
30 | |
|
|
31 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
|
|
32 | |
|
|
33 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
|
|
34 | |
|
|
35 | #include "CoroAPI.h" |
|
|
36 | |
|
|
37 | static struct CoroAPI coroapi; |
|
|
38 | |
|
|
39 | /* this is actually not only the c stack but also c registers etc... */ |
|
|
40 | typedef struct { |
|
|
41 | int refcnt; /* pointer reference counter */ |
|
|
42 | int usecnt; /* shared by how many coroutines */ |
|
|
43 | int gencnt; /* generation counter */ |
|
|
44 | |
|
|
45 | coro_context cctx; |
|
|
46 | |
|
|
47 | void *sptr; |
|
|
48 | long ssize; /* positive == mmap, otherwise malloc */ |
|
|
49 | } coro_stack; |
|
|
50 | |
24 | struct coro { |
51 | struct coro { |
25 | /* the optional C context */ |
52 | /* the optional C context */ |
26 | coro_context cctx; |
53 | coro_stack *stack; |
27 | void *sptr; |
54 | void *cursp; |
28 | long ssize; |
55 | int gencnt; |
29 | |
56 | |
30 | /* optionally saved, might be zero */ |
57 | /* optionally saved, might be zero */ |
31 | AV *defav; |
58 | AV *defav; |
32 | SV *defsv; |
59 | SV *defsv; |
33 | SV *errsv; |
60 | SV *errsv; |
34 | |
61 | |
35 | /* saved global state not related to stacks */ |
62 | /* saved global state not related to stacks */ |
36 | U8 dowarn; |
63 | U8 dowarn; |
|
|
64 | I32 in_eval; |
37 | |
65 | |
38 | /* the stacks and related info (callchain etc..) */ |
66 | /* the stacks and related info (callchain etc..) */ |
39 | PERL_SI *curstackinfo; |
67 | PERL_SI *curstackinfo; |
40 | AV *curstack; |
68 | AV *curstack; |
41 | AV *mainstack; |
69 | AV *mainstack; |
… | |
… | |
59 | I32 savestack_max; |
87 | I32 savestack_max; |
60 | OP **retstack; |
88 | OP **retstack; |
61 | I32 retstack_ix; |
89 | I32 retstack_ix; |
62 | I32 retstack_max; |
90 | I32 retstack_max; |
63 | COP *curcop; |
91 | COP *curcop; |
64 | JMPENV start_env; |
|
|
65 | JMPENV *top_env; |
92 | JMPENV *top_env; |
66 | |
93 | |
67 | /* data associated with this coroutine (initial args) */ |
94 | /* data associated with this coroutine (initial args) */ |
68 | AV *args; |
95 | AV *args; |
69 | }; |
96 | }; |
… | |
… | |
74 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
101 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
75 | static HV *coro_state_stash; |
102 | static HV *coro_state_stash; |
76 | static SV *ucoro_state_sv; |
103 | static SV *ucoro_state_sv; |
77 | static U32 ucoro_state_hash; |
104 | static U32 ucoro_state_hash; |
78 | static HV *padlist_cache; |
105 | static HV *padlist_cache; |
|
|
106 | static SV *coro_mortal; /* will be freed after next transfer */ |
79 | |
107 | |
80 | /* mostly copied from op.c:cv_clone2 */ |
108 | /* mostly copied from op.c:cv_clone2 */ |
81 | STATIC AV * |
109 | STATIC AV * |
82 | clone_padlist (AV *protopadlist) |
110 | clone_padlist (AV *protopadlist) |
83 | { |
111 | { |
… | |
… | |
170 | |
198 | |
171 | return newpadlist; |
199 | return newpadlist; |
172 | } |
200 | } |
173 | |
201 | |
174 | #ifdef MAY_FLUSH |
202 | #ifdef MAY_FLUSH |
175 | STATIC AV * |
203 | STATIC void |
176 | free_padlist (AV *padlist) |
204 | free_padlist (AV *padlist) |
177 | { |
205 | { |
178 | /* may be during global destruction */ |
206 | /* may be during global destruction */ |
179 | if (SvREFCNT(padlist)) |
207 | if (SvREFCNT(padlist)) |
180 | { |
208 | { |
… | |
… | |
245 | #endif |
273 | #endif |
246 | |
274 | |
247 | #define SB do { |
275 | #define SB do { |
248 | #define SE } while (0) |
276 | #define SE } while (0) |
249 | |
277 | |
250 | #define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE |
278 | #define LOAD(state) load_state(aTHX_ (state)); |
251 | #define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE |
279 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
252 | |
280 | |
253 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
281 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
254 | |
282 | |
255 | static void |
283 | static void |
256 | load_state(pTHX_ Coro__State c) |
284 | load_state(pTHX_ Coro__State c) |
257 | { |
285 | { |
258 | PL_dowarn = c->dowarn; |
286 | PL_dowarn = c->dowarn; |
|
|
287 | PL_in_eval = c->in_eval; |
259 | |
288 | |
260 | PL_curstackinfo = c->curstackinfo; |
289 | PL_curstackinfo = c->curstackinfo; |
261 | PL_curstack = c->curstack; |
290 | PL_curstack = c->curstack; |
262 | PL_mainstack = c->mainstack; |
291 | PL_mainstack = c->mainstack; |
263 | PL_stack_sp = c->stack_sp; |
292 | PL_stack_sp = c->stack_sp; |
… | |
… | |
280 | PL_savestack_max = c->savestack_max; |
309 | PL_savestack_max = c->savestack_max; |
281 | PL_retstack = c->retstack; |
310 | PL_retstack = c->retstack; |
282 | PL_retstack_ix = c->retstack_ix; |
311 | PL_retstack_ix = c->retstack_ix; |
283 | PL_retstack_max = c->retstack_max; |
312 | PL_retstack_max = c->retstack_max; |
284 | PL_curcop = c->curcop; |
313 | PL_curcop = c->curcop; |
285 | PL_start_env = c->start_env; |
|
|
286 | PL_top_env = c->top_env; |
314 | PL_top_env = c->top_env; |
287 | |
315 | |
288 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
316 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
289 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
317 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
290 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
318 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
… | |
… | |
330 | |
358 | |
331 | PUSHs (Nullsv); |
359 | PUSHs (Nullsv); |
332 | /* this loop was inspired by pp_caller */ |
360 | /* this loop was inspired by pp_caller */ |
333 | for (;;) |
361 | for (;;) |
334 | { |
362 | { |
335 | do |
363 | while (cxix >= 0) |
336 | { |
364 | { |
337 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
365 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
338 | |
366 | |
339 | if (CxTYPE(cx) == CXt_SUB) |
367 | if (CxTYPE(cx) == CXt_SUB) |
340 | { |
368 | { |
… | |
… | |
366 | /* I never used formats, so how should I know how these are implemented? */ |
394 | /* I never used formats, so how should I know how these are implemented? */ |
367 | /* my bold guess is as a simple, plain sub... */ |
395 | /* my bold guess is as a simple, plain sub... */ |
368 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
396 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
369 | } |
397 | } |
370 | } |
398 | } |
371 | while (cxix >= 0); |
|
|
372 | |
399 | |
373 | if (top_si->si_type == PERLSI_MAIN) |
400 | if (top_si->si_type == PERLSI_MAIN) |
374 | break; |
401 | break; |
375 | |
402 | |
376 | top_si = top_si->si_prev; |
403 | top_si = top_si->si_prev; |
… | |
… | |
383 | |
410 | |
384 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
411 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
385 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
412 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
386 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
413 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
387 | |
414 | |
388 | /* I have not the slightest idea of why av_reify is necessary */ |
|
|
389 | /* but if it's missing the defav contents magically get replaced sometimes */ |
|
|
390 | if (c->defav) |
|
|
391 | av_reify (c->defav); |
|
|
392 | |
|
|
393 | c->dowarn = PL_dowarn; |
415 | c->dowarn = PL_dowarn; |
|
|
416 | c->in_eval = PL_in_eval; |
394 | |
417 | |
395 | c->curstackinfo = PL_curstackinfo; |
418 | c->curstackinfo = PL_curstackinfo; |
396 | c->curstack = PL_curstack; |
419 | c->curstack = PL_curstack; |
397 | c->mainstack = PL_mainstack; |
420 | c->mainstack = PL_mainstack; |
398 | c->stack_sp = PL_stack_sp; |
421 | c->stack_sp = PL_stack_sp; |
… | |
… | |
415 | c->savestack_max = PL_savestack_max; |
438 | c->savestack_max = PL_savestack_max; |
416 | c->retstack = PL_retstack; |
439 | c->retstack = PL_retstack; |
417 | c->retstack_ix = PL_retstack_ix; |
440 | c->retstack_ix = PL_retstack_ix; |
418 | c->retstack_max = PL_retstack_max; |
441 | c->retstack_max = PL_retstack_max; |
419 | c->curcop = PL_curcop; |
442 | c->curcop = PL_curcop; |
420 | c->start_env = PL_start_env; |
|
|
421 | c->top_env = PL_top_env; |
443 | c->top_env = PL_top_env; |
422 | } |
444 | } |
423 | |
445 | |
424 | /* |
446 | /* |
425 | * allocate various perl stacks. This is an exact copy |
447 | * allocate various perl stacks. This is an exact copy |
… | |
… | |
437 | |
459 | |
438 | PL_stack_base = AvARRAY(PL_curstack); |
460 | PL_stack_base = AvARRAY(PL_curstack); |
439 | PL_stack_sp = PL_stack_base; |
461 | PL_stack_sp = PL_stack_base; |
440 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
462 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
441 | |
463 | |
442 | New(50,PL_tmps_stack,64,SV*); |
464 | New(50,PL_tmps_stack,96,SV*); |
443 | PL_tmps_floor = -1; |
465 | PL_tmps_floor = -1; |
444 | PL_tmps_ix = -1; |
466 | PL_tmps_ix = -1; |
445 | PL_tmps_max = 64; |
467 | PL_tmps_max = 96; |
446 | |
468 | |
447 | New(54,PL_markstack,12,I32); |
469 | New(54,PL_markstack,16,I32); |
448 | PL_markstack_ptr = PL_markstack; |
470 | PL_markstack_ptr = PL_markstack; |
449 | PL_markstack_max = PL_markstack + 12; |
471 | PL_markstack_max = PL_markstack + 16; |
450 | |
472 | |
451 | SET_MARK_OFFSET; |
473 | SET_MARK_OFFSET; |
452 | |
474 | |
453 | New(54,PL_scopestack,12,I32); |
475 | New(54,PL_scopestack,16,I32); |
454 | PL_scopestack_ix = 0; |
476 | PL_scopestack_ix = 0; |
455 | PL_scopestack_max = 12; |
477 | PL_scopestack_max = 16; |
456 | |
478 | |
457 | New(54,PL_savestack,64,ANY); |
479 | New(54,PL_savestack,96,ANY); |
458 | PL_savestack_ix = 0; |
480 | PL_savestack_ix = 0; |
459 | PL_savestack_max = 64; |
481 | PL_savestack_max = 96; |
460 | |
482 | |
461 | New(54,PL_retstack,8,OP*); |
483 | New(54,PL_retstack,8,OP*); |
462 | PL_retstack_ix = 0; |
484 | PL_retstack_ix = 0; |
463 | PL_retstack_max = 8; |
485 | PL_retstack_max = 8; |
464 | } |
486 | } |
… | |
… | |
468 | * still there is a memleak of 128 bytes... |
490 | * still there is a memleak of 128 bytes... |
469 | */ |
491 | */ |
470 | STATIC void |
492 | STATIC void |
471 | destroy_stacks(pTHX) |
493 | destroy_stacks(pTHX) |
472 | { |
494 | { |
|
|
495 | if (!IN_DESTRUCT) |
|
|
496 | { |
473 | /* is this ugly, I ask? */ |
497 | /* is this ugly, I ask? */ |
474 | while (PL_scopestack_ix) |
498 | while (PL_scopestack_ix) |
475 | LEAVE; |
499 | LEAVE; |
476 | |
500 | |
477 | /* sure it is, but more important: is it correct?? :/ */ |
501 | /* sure it is, but more important: is it correct?? :/ */ |
478 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
502 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
479 | FREETMPS; |
503 | FREETMPS; |
|
|
504 | } |
480 | |
505 | |
481 | while (PL_curstackinfo->si_next) |
506 | while (PL_curstackinfo->si_next) |
482 | PL_curstackinfo = PL_curstackinfo->si_next; |
507 | PL_curstackinfo = PL_curstackinfo->si_next; |
483 | |
508 | |
484 | while (PL_curstackinfo) |
509 | while (PL_curstackinfo) |
… | |
… | |
489 | dSP; |
514 | dSP; |
490 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
515 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
491 | PUTBACK; /* possibly superfluous */ |
516 | PUTBACK; /* possibly superfluous */ |
492 | } |
517 | } |
493 | |
518 | |
|
|
519 | if (!IN_DESTRUCT) |
|
|
520 | { |
494 | dounwind(-1); |
521 | dounwind(-1); |
495 | |
|
|
496 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
522 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
|
|
523 | } |
|
|
524 | |
497 | Safefree(PL_curstackinfo->si_cxstack); |
525 | Safefree(PL_curstackinfo->si_cxstack); |
498 | Safefree(PL_curstackinfo); |
526 | Safefree(PL_curstackinfo); |
499 | PL_curstackinfo = p; |
527 | PL_curstackinfo = p; |
500 | } |
528 | } |
501 | |
529 | |
… | |
… | |
505 | Safefree(PL_savestack); |
533 | Safefree(PL_savestack); |
506 | Safefree(PL_retstack); |
534 | Safefree(PL_retstack); |
507 | } |
535 | } |
508 | |
536 | |
509 | static void |
537 | static void |
510 | allocate_stack (Coro__State ctx) |
538 | allocate_stack (Coro__State ctx, int alloc) |
511 | { |
539 | { |
|
|
540 | coro_stack *stack; |
|
|
541 | |
|
|
542 | New (0, stack, 1, coro_stack); |
|
|
543 | |
|
|
544 | stack->refcnt = 1; |
|
|
545 | stack->usecnt = 1; |
|
|
546 | stack->gencnt = ctx->gencnt = 0; |
|
|
547 | if (alloc) |
|
|
548 | { |
512 | #ifdef HAVE_MMAP |
549 | #if HAVE_MMAP |
513 | ctx->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-use */ |
550 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
514 | ctx->sptr = mmap (0, ctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); |
551 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
515 | if (ctx->sptr == (void *)-1) |
552 | if (stack->sptr == (void *)-1) |
516 | #endif |
553 | #endif |
517 | { |
554 | { |
518 | /*FIXME*//*D*//* reasonable stack size! */ |
555 | /*FIXME*//*D*//* reasonable stack size! */ |
519 | ctx->ssize = 4096 * sizeof (long); |
556 | stack->ssize = -4096 * sizeof (long); |
520 | New (0, ctx->sptr, 4096, long); |
557 | New (0, stack->sptr, 4096, long); |
|
|
558 | } |
521 | } |
559 | } |
|
|
560 | else |
|
|
561 | stack->sptr = 0; |
|
|
562 | |
|
|
563 | ctx->stack = stack; |
522 | } |
564 | } |
523 | |
565 | |
524 | static void |
566 | static void |
525 | deallocate_stack (Coro__State ctx) |
567 | deallocate_stack (Coro__State ctx) |
526 | { |
568 | { |
|
|
569 | coro_stack *stack = ctx->stack; |
|
|
570 | |
|
|
571 | ctx->stack = 0; |
|
|
572 | |
|
|
573 | if (stack) |
|
|
574 | { |
|
|
575 | if (!--stack->refcnt) |
|
|
576 | { |
527 | #ifdef HAVE_MMAP |
577 | #ifdef HAVE_MMAP |
528 | munmap (ctx->sptr, ctx->ssize); |
578 | if (stack->ssize > 0 && stack->sptr) |
|
|
579 | munmap (stack->sptr, stack->ssize); |
|
|
580 | else |
529 | #else |
581 | #else |
530 | Safefree (ctx->sptr); |
582 | Safefree (stack->sptr); |
531 | #endif |
583 | #endif |
|
|
584 | Safefree (stack); |
|
|
585 | } |
|
|
586 | else if (ctx->gencnt == stack->gencnt) |
|
|
587 | --stack->usecnt; |
|
|
588 | } |
532 | } |
589 | } |
533 | |
590 | |
534 | /* might go away together with optional SAVE_CCTXT */ |
|
|
535 | static void |
591 | static void |
536 | setup_coro (void *arg) |
592 | setup_coro (void *arg) |
537 | { |
593 | { |
538 | /* |
594 | /* |
539 | * emulate part of the perl startup here. |
595 | * emulate part of the perl startup here. |
… | |
… | |
541 | dSP; |
597 | dSP; |
542 | Coro__State ctx = (Coro__State)arg; |
598 | Coro__State ctx = (Coro__State)arg; |
543 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
599 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
544 | |
600 | |
545 | coro_init_stacks (aTHX); |
601 | coro_init_stacks (aTHX); |
546 | JMPENV_BOOTSTRAP; |
|
|
547 | SPAGAIN; |
|
|
548 | |
|
|
549 | /*PL_curcop = 0;*/ |
602 | /*PL_curcop = 0;*/ |
|
|
603 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
550 | SvREFCNT_dec (GvAV (PL_defgv)); |
604 | SvREFCNT_dec (GvAV (PL_defgv)); |
551 | GvAV (PL_defgv) = ctx->args; |
605 | GvAV (PL_defgv) = ctx->args; |
552 | |
606 | |
|
|
607 | SPAGAIN; |
|
|
608 | |
553 | if (ctx->sptr) |
609 | if (ctx->stack) |
554 | { |
610 | { |
|
|
611 | ctx->cursp = 0; |
|
|
612 | |
555 | PUSHMARK(SP); |
613 | PUSHMARK(SP); |
556 | PUTBACK; |
614 | PUTBACK; |
557 | (void) call_sv (sub_init, G_VOID|G_NOARGS); |
615 | (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL); |
|
|
616 | |
|
|
617 | if (SvTRUE (ERRSV)) |
|
|
618 | croak (NULL); |
|
|
619 | else |
558 | croak ("FATAL: CCTXT coroutine returned!"); |
620 | croak ("FATAL: CCTXT coroutine returned!"); |
559 | } |
621 | } |
560 | else |
622 | else |
561 | { |
623 | { |
562 | UNOP myop; |
624 | UNOP myop; |
563 | |
625 | |
… | |
… | |
582 | |
644 | |
583 | ENTER; /* necessary e.g. for dounwind */ |
645 | ENTER; /* necessary e.g. for dounwind */ |
584 | } |
646 | } |
585 | } |
647 | } |
586 | |
648 | |
|
|
649 | static void |
|
|
650 | continue_coro (void *arg) |
|
|
651 | { |
|
|
652 | /* |
|
|
653 | * this is a _very_ stripped down perl interpreter ;) |
|
|
654 | */ |
|
|
655 | Coro__State ctx = (Coro__State)arg; |
|
|
656 | JMPENV coro_start_env; |
|
|
657 | |
|
|
658 | /* same as JMPENV_BOOTSTRAP */ |
|
|
659 | Zero(&coro_start_env, 1, JMPENV); |
|
|
660 | coro_start_env.je_ret = -1; |
|
|
661 | coro_start_env.je_mustcatch = TRUE; |
|
|
662 | PL_top_env = &coro_start_env; |
|
|
663 | |
|
|
664 | ctx->cursp = 0; |
|
|
665 | PL_op = PL_op->op_next; |
|
|
666 | CALLRUNOPS(aTHX); |
|
|
667 | |
|
|
668 | abort (); |
|
|
669 | } |
|
|
670 | |
587 | STATIC void |
671 | STATIC void |
588 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
672 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
589 | { |
673 | { |
590 | dSP; |
674 | dSTACKLEVEL; |
|
|
675 | static struct coro *xnext; |
591 | |
676 | |
592 | if (prev != next) |
677 | if (prev != next) |
593 | { |
678 | { |
594 | /* |
679 | xnext = next; |
595 | * this could be done in newprocess which would lead to |
680 | |
596 | * extremely elegant and fast (basically just SAVE/LOAD) |
|
|
597 | * code here, but lazy allocation of stacks has also |
|
|
598 | * some virtues and the overhead of the if() is nil. |
|
|
599 | */ |
|
|
600 | if (next->mainstack) |
681 | if (next->mainstack) |
601 | { |
682 | { |
602 | SAVE (prev, flags); |
683 | SAVE (prev, flags); |
603 | LOAD (next); |
684 | LOAD (next); |
604 | |
685 | |
605 | /* mark this state as in-use */ |
686 | /* mark this state as in-use */ |
606 | next->mainstack = 0; |
687 | next->mainstack = 0; |
607 | next->tmps_ix = -2; |
688 | next->tmps_ix = -2; |
608 | |
689 | |
|
|
690 | /* stacklevel changed? if yes, grab the stack for us! */ |
609 | if (flags & TRANSFER_SAVE_CCTXT) |
691 | if (flags & TRANSFER_SAVE_CCTXT) |
610 | { |
692 | { |
611 | if (!next->ssize) |
|
|
612 | croak ("destination coroutine has no CCTXT (%p, %d)", next->sptr, next->ssize); |
|
|
613 | |
|
|
614 | if (!prev->ssize) |
693 | if (!prev->stack) |
615 | prev->ssize = 1; /* mark cctx as valid ;) */ |
694 | allocate_stack (prev, 0); |
|
|
695 | else if (prev->cursp != stacklevel |
|
|
696 | && prev->stack->usecnt > 1) |
|
|
697 | { |
|
|
698 | prev->gencnt = ++prev->stack->gencnt; |
|
|
699 | prev->stack->usecnt = 1; |
|
|
700 | } |
616 | |
701 | |
|
|
702 | /* has our stack been invalidated? */ |
|
|
703 | if (next->stack && next->stack->gencnt != next->gencnt) |
|
|
704 | { |
|
|
705 | deallocate_stack (next); |
|
|
706 | allocate_stack (next, 1); |
|
|
707 | coro_create (&(next->stack->cctx), |
|
|
708 | continue_coro, (void *)next, |
|
|
709 | next->stack->sptr, labs (next->stack->ssize)); |
|
|
710 | } |
|
|
711 | |
617 | coro_transfer (&(prev->cctx), &(next->cctx)); |
712 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
713 | /* don't add any code here */ |
618 | } |
714 | } |
619 | |
715 | |
620 | } |
716 | } |
621 | else if (next->tmps_ix == -2) |
717 | else if (next->tmps_ix == -2) |
622 | croak ("tried to transfer to running coroutine"); |
718 | croak ("tried to transfer to running coroutine"); |
… | |
… | |
624 | { |
720 | { |
625 | SAVE (prev, -1); /* first get rid of the old state */ |
721 | SAVE (prev, -1); /* first get rid of the old state */ |
626 | |
722 | |
627 | if (flags & TRANSFER_SAVE_CCTXT) |
723 | if (flags & TRANSFER_SAVE_CCTXT) |
628 | { |
724 | { |
629 | if (!next->ssize) |
725 | if (!prev->stack) |
|
|
726 | allocate_stack (prev, 0); |
|
|
727 | |
|
|
728 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
630 | { |
729 | { |
|
|
730 | setup_coro (next); |
|
|
731 | |
|
|
732 | prev->stack->refcnt++; |
|
|
733 | prev->stack->usecnt++; |
|
|
734 | next->stack = prev->stack; |
|
|
735 | next->gencnt = prev->gencnt; |
|
|
736 | } |
|
|
737 | else |
|
|
738 | { |
631 | allocate_stack (next); |
739 | allocate_stack (next, 1); |
632 | coro_create (&(next->cctx), |
740 | coro_create (&(next->stack->cctx), |
633 | setup_coro, (void *)next, |
741 | setup_coro, (void *)next, |
634 | next->sptr, next->ssize); |
742 | next->stack->sptr, labs (next->stack->ssize)); |
|
|
743 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
744 | /* don't add any code here */ |
635 | } |
745 | } |
636 | |
|
|
637 | if (!prev->ssize) |
|
|
638 | prev->ssize = 1; /* mark cctx as valid ;) */ |
|
|
639 | |
|
|
640 | coro_transfer (&(prev->cctx), &(next->cctx)); |
|
|
641 | } |
746 | } |
642 | else |
747 | else |
643 | setup_coro (next); |
748 | setup_coro (next); |
644 | } |
749 | } |
|
|
750 | |
|
|
751 | /* |
|
|
752 | * xnext is now either prev or next, depending on wether |
|
|
753 | * we switched the c stack or not. that's why I use a global |
|
|
754 | * variable, that should become thread-specific at one point. |
|
|
755 | */ |
|
|
756 | xnext->cursp = stacklevel; |
|
|
757 | } |
|
|
758 | |
|
|
759 | if (coro_mortal) |
|
|
760 | { |
|
|
761 | SvREFCNT_dec (coro_mortal); |
|
|
762 | coro_mortal = 0; |
|
|
763 | } |
|
|
764 | } |
|
|
765 | |
|
|
766 | #define SV_CORO(sv,func) \ |
|
|
767 | do { \ |
|
|
768 | if (SvROK (sv)) \ |
|
|
769 | sv = SvRV (sv); \ |
|
|
770 | \ |
|
|
771 | if (SvTYPE(sv) == SVt_PVHV) \ |
|
|
772 | { \ |
|
|
773 | HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ |
|
|
774 | \ |
|
|
775 | if (!he) \ |
|
|
776 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ |
|
|
777 | \ |
|
|
778 | (sv) = SvRV (HeVAL(he)); \ |
|
|
779 | } \ |
|
|
780 | \ |
|
|
781 | /* must also be changed inside Coro::Cont::yield */ \ |
|
|
782 | if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \ |
|
|
783 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
|
|
784 | \ |
|
|
785 | } while(0) |
|
|
786 | |
|
|
787 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
|
|
788 | |
|
|
789 | static void |
|
|
790 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
|
|
791 | { |
|
|
792 | SV_CORO (prev, "Coro::transfer"); |
|
|
793 | SV_CORO (next, "Coro::transfer"); |
|
|
794 | |
|
|
795 | transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); |
|
|
796 | } |
|
|
797 | |
|
|
798 | /** Coro ********************************************************************/ |
|
|
799 | |
|
|
800 | #define PRIO_MAX 3 |
|
|
801 | #define PRIO_HIGH 1 |
|
|
802 | #define PRIO_NORMAL 0 |
|
|
803 | #define PRIO_LOW -1 |
|
|
804 | #define PRIO_IDLE -3 |
|
|
805 | #define PRIO_MIN -4 |
|
|
806 | |
|
|
807 | /* for Coro.pm */ |
|
|
808 | static GV *coro_current, *coro_idle; |
|
|
809 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
|
|
810 | static int coro_nready; |
|
|
811 | |
|
|
812 | static void |
|
|
813 | coro_enq (SV *sv) |
|
|
814 | { |
|
|
815 | if (SvTYPE (sv) == SVt_PVHV) |
|
|
816 | { |
|
|
817 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
818 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
819 | |
|
|
820 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
821 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
822 | : prio; |
|
|
823 | |
|
|
824 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
825 | coro_nready++; |
|
|
826 | |
|
|
827 | return; |
|
|
828 | } |
|
|
829 | |
|
|
830 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
831 | } |
|
|
832 | |
|
|
833 | static SV * |
|
|
834 | coro_deq (int min_prio) |
|
|
835 | { |
|
|
836 | int prio = PRIO_MAX - PRIO_MIN; |
|
|
837 | |
|
|
838 | min_prio -= PRIO_MIN; |
|
|
839 | if (min_prio < 0) |
|
|
840 | min_prio = 0; |
|
|
841 | |
|
|
842 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
|
|
843 | if (av_len (coro_ready[prio]) >= 0) |
|
|
844 | { |
|
|
845 | coro_nready--; |
|
|
846 | return av_shift (coro_ready[prio]); |
645 | } |
847 | } |
|
|
848 | |
|
|
849 | return 0; |
|
|
850 | } |
|
|
851 | |
|
|
852 | static void |
|
|
853 | api_ready (SV *coro) |
|
|
854 | { |
|
|
855 | if (SvROK (coro)) |
|
|
856 | coro = SvRV (coro); |
|
|
857 | |
|
|
858 | coro_enq (SvREFCNT_inc (coro)); |
|
|
859 | } |
|
|
860 | |
|
|
861 | static void |
|
|
862 | api_schedule (void) |
|
|
863 | { |
|
|
864 | SV *prev, *next; |
|
|
865 | |
|
|
866 | prev = SvRV (GvSV (coro_current)); |
|
|
867 | next = coro_deq (PRIO_MIN); |
|
|
868 | |
|
|
869 | if (!next) |
|
|
870 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
|
|
871 | |
|
|
872 | /* free this only after the transfer */ |
|
|
873 | coro_mortal = prev; |
|
|
874 | SV_CORO (prev, "Coro::schedule"); |
|
|
875 | |
|
|
876 | SvRV (GvSV (coro_current)) = next; |
|
|
877 | |
|
|
878 | SV_CORO (next, "Coro::schedule"); |
|
|
879 | |
|
|
880 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), |
|
|
881 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
|
|
882 | } |
|
|
883 | |
|
|
884 | static void |
|
|
885 | api_cede (void) |
|
|
886 | { |
|
|
887 | coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
888 | |
|
|
889 | api_schedule (); |
646 | } |
890 | } |
647 | |
891 | |
648 | MODULE = Coro::State PACKAGE = Coro::State |
892 | MODULE = Coro::State PACKAGE = Coro::State |
649 | |
893 | |
650 | PROTOTYPES: ENABLE |
894 | PROTOTYPES: ENABLE |
… | |
… | |
662 | |
906 | |
663 | if (!padlist_cache) |
907 | if (!padlist_cache) |
664 | padlist_cache = newHV (); |
908 | padlist_cache = newHV (); |
665 | |
909 | |
666 | main_mainstack = PL_mainstack; |
910 | main_mainstack = PL_mainstack; |
|
|
911 | |
|
|
912 | coroapi.ver = CORO_API_VERSION; |
|
|
913 | coroapi.transfer = api_transfer; |
667 | } |
914 | } |
668 | |
915 | |
669 | Coro::State |
916 | Coro::State |
670 | _newprocess(args) |
917 | _newprocess(args) |
671 | SV * args |
918 | SV * args |
… | |
… | |
678 | |
925 | |
679 | New (0, coro, 1, struct coro); |
926 | New (0, coro, 1, struct coro); |
680 | |
927 | |
681 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
928 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
682 | coro->mainstack = 0; /* actual work is done inside transfer */ |
929 | coro->mainstack = 0; /* actual work is done inside transfer */ |
683 | coro->sptr = 0; |
930 | coro->stack = 0; |
684 | coro->ssize = 0; |
|
|
685 | |
931 | |
686 | RETVAL = coro; |
932 | RETVAL = coro; |
687 | OUTPUT: |
933 | OUTPUT: |
688 | RETVAL |
934 | RETVAL |
689 | |
935 | |
690 | void |
936 | void |
691 | transfer(prev, next, flags = TRANSFER_SAVE_ALL) |
937 | transfer(prev, next, flags) |
692 | Coro::State_or_hashref prev |
938 | SV *prev |
693 | Coro::State_or_hashref next |
939 | SV *next |
694 | int flags |
940 | int flags |
695 | PROTOTYPE: @ |
941 | PROTOTYPE: @ |
696 | CODE: |
942 | CODE: |
|
|
943 | PUTBACK; |
|
|
944 | SV_CORO (next, "Coro::transfer"); |
|
|
945 | SV_CORO (prev, "Coro::transfer"); |
697 | transfer (aTHX_ prev, next, flags); |
946 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
|
|
947 | SPAGAIN; |
698 | |
948 | |
699 | void |
949 | void |
700 | DESTROY(coro) |
950 | DESTROY(coro) |
701 | Coro::State coro |
951 | Coro::State coro |
702 | CODE: |
952 | CODE: |
703 | |
953 | |
704 | if (coro->mainstack && coro->mainstack != main_mainstack) |
954 | if (coro->mainstack && coro->mainstack != main_mainstack) |
705 | { |
955 | { |
706 | struct coro temp; |
956 | struct coro temp; |
707 | |
957 | |
|
|
958 | PUTBACK; |
708 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
959 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
709 | LOAD(aTHX_ coro); |
960 | LOAD(aTHX_ coro); |
|
|
961 | SPAGAIN; |
710 | |
962 | |
711 | destroy_stacks (aTHX); |
963 | destroy_stacks (aTHX); |
712 | |
964 | |
713 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
965 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
|
|
966 | SPAGAIN; |
714 | |
967 | |
715 | coro->mainstack = 0; |
968 | coro->mainstack = 0; |
716 | } |
969 | } |
717 | |
970 | |
718 | if (coro->sptr) |
|
|
719 | { |
|
|
720 | deallocate_stack (coro); |
971 | deallocate_stack (coro); |
721 | coro->sptr = 0; |
|
|
722 | } |
|
|
723 | |
972 | |
724 | Safefree (coro); |
973 | Safefree (coro); |
725 | |
974 | |
726 | void |
975 | void |
727 | flush() |
976 | flush() |
728 | CODE: |
977 | CODE: |
729 | #ifdef MAY_FLUSH |
978 | #ifdef MAY_FLUSH |
730 | flush_padlist_cache (); |
979 | flush_padlist_cache (); |
731 | #endif |
980 | #endif |
732 | |
981 | |
|
|
982 | void |
|
|
983 | _exit(code) |
|
|
984 | int code |
|
|
985 | PROTOTYPE: $ |
|
|
986 | CODE: |
|
|
987 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
|
|
988 | _exit (code); |
|
|
989 | #else |
|
|
990 | signal (SIGTERM, SIG_DFL); |
|
|
991 | raise (SIGTERM); |
|
|
992 | exit (code); |
|
|
993 | #endif |
|
|
994 | |
733 | MODULE = Coro::State PACKAGE = Coro::Cont |
995 | MODULE = Coro::State PACKAGE = Coro::Cont |
734 | |
996 | |
735 | # this is slightly dirty |
997 | # this is slightly dirty (should expose a c-level api) |
736 | |
998 | |
737 | void |
999 | void |
738 | yield(...) |
1000 | yield(...) |
739 | PROTOTYPE: @ |
1001 | PROTOTYPE: @ |
740 | CODE: |
1002 | CODE: |
… | |
… | |
758 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
1020 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
759 | SvREFCNT_dec (sv); |
1021 | SvREFCNT_dec (sv); |
760 | |
1022 | |
761 | transfer(aTHX_ prev, next, 0); |
1023 | transfer(aTHX_ prev, next, 0); |
762 | |
1024 | |
|
|
1025 | MODULE = Coro::State PACKAGE = Coro |
|
|
1026 | |
|
|
1027 | # this is slightly dirty (should expose a c-level api) |
|
|
1028 | |
|
|
1029 | BOOT: |
|
|
1030 | { |
|
|
1031 | int i; |
|
|
1032 | HV *stash = gv_stashpv ("Coro", TRUE); |
|
|
1033 | |
|
|
1034 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
|
|
1035 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
|
|
1036 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
|
|
1037 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
|
|
1038 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
|
|
1039 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
|
|
1040 | |
|
|
1041 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
|
|
1042 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
|
|
1043 | |
|
|
1044 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
|
|
1045 | coro_ready[i] = newAV (); |
|
|
1046 | |
|
|
1047 | { |
|
|
1048 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
1049 | |
|
|
1050 | coroapi.schedule = api_schedule; |
|
|
1051 | coroapi.cede = api_cede; |
|
|
1052 | coroapi.ready = api_ready; |
|
|
1053 | coroapi.nready = &coro_nready; |
|
|
1054 | coroapi.current = coro_current; |
|
|
1055 | |
|
|
1056 | GCoroAPI = &coroapi; |
|
|
1057 | sv_setiv(sv, (IV)&coroapi); |
|
|
1058 | SvREADONLY_on(sv); |
|
|
1059 | } |
|
|
1060 | } |
|
|
1061 | |
|
|
1062 | void |
|
|
1063 | ready(self) |
|
|
1064 | SV * self |
|
|
1065 | PROTOTYPE: $ |
|
|
1066 | CODE: |
|
|
1067 | api_ready (self); |
|
|
1068 | |
|
|
1069 | int |
|
|
1070 | nready(...) |
|
|
1071 | PROTOTYPE: |
|
|
1072 | CODE: |
|
|
1073 | RETVAL = coro_nready; |
|
|
1074 | OUTPUT: |
|
|
1075 | RETVAL |
|
|
1076 | |
|
|
1077 | void |
|
|
1078 | schedule(...) |
|
|
1079 | PROTOTYPE: |
|
|
1080 | CODE: |
|
|
1081 | api_schedule (); |
|
|
1082 | |
|
|
1083 | void |
|
|
1084 | cede(...) |
|
|
1085 | PROTOTYPE: |
|
|
1086 | CODE: |
|
|
1087 | api_cede (); |
|
|
1088 | |