ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.48 by pcg, Sat Nov 15 03:53:37 2003 UTC

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 4
5#if 1 5#include "patchlevel.h"
6# define CHK(x) (void *)0 6
7#else 7#if PATCHLEVEL < 6
8# define CHK(x) if (!(x)) croak("FATAL, CHK: " #x) 8# ifndef PL_ppaddr
9# define PL_ppaddr ppaddr
9#endif 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
10 27
28#include "libcoro/coro.c"
29
30#include <signal.h>
31
32#ifdef HAVE_MMAP
33# include <unistd.h>
34# include <sys/mman.h>
35# ifndef MAP_ANONYMOUS
36# ifdef MAP_ANON
37# define MAP_ANONYMOUS MAP_ANON
38# else
39# undef HAVE_MMAP
40# endif
41# endif
42#endif
43
11#define MAY_FLUSH /* increases codesize */ 44#define MAY_FLUSH /* increases codesize and is rarely used */
12 45
13#define SUB_INIT "Coro::State::initialize" 46#define SUB_INIT "Coro::State::initialize"
47#define UCORO_STATE "_coro_state"
14 48
15#define TRANSFER_SAVE_DEFAV 0x00000001 49/* The next macro should declare a variable stacklevel that contains and approximation
16#define TRANSFER_SAVE_DEFSV 0x00000002 50 * to the current C stack pointer. Its property is that it changes with each call
17#define TRANSFER_SAVE_ERRSV 0x00000004 51 * and should be unique. */
52#define dSTACKLEVEL void *stacklevel = &stacklevel
18 53
19#define TRANSFER_SAVE_ALL -1 54#define IN_DESTRUCT (PL_main_cv == Nullcv)
55
56#define labs(l) ((l) >= 0 ? (l) : -(l))
57
58#include "CoroAPI.h"
59
60static struct CoroAPI coroapi;
61
62/* this is actually not only the c stack but also c registers etc... */
63typedef struct {
64 int refcnt; /* pointer reference counter */
65 int usecnt; /* shared by how many coroutines */
66 int gencnt; /* generation counter */
67
68 coro_context cctx;
69
70 void *sptr;
71 long ssize; /* positive == mmap, otherwise malloc */
72} coro_stack;
20 73
21struct coro { 74struct coro {
75 /* the top-level JMPENV for each coroutine, needed to catch dies. */
76 JMPENV start_env;
77
78 /* the optional C context */
79 coro_stack *stack;
80 void *cursp;
81 int gencnt;
82
22 /* optionally saved, might be zero */ 83 /* optionally saved, might be zero */
23 AV *defav; 84 AV *defav;
24 SV *defsv; 85 SV *defsv;
25 SV *errsv; 86 SV *errsv;
26 87
27 /* saved global state not related to stacks */ 88 /* saved global state not related to stacks */
28 U8 dowarn; 89 U8 dowarn;
90 I32 in_eval;
29 91
30 /* the stacks and related info (callchain etc..) */ 92 /* the stacks and related info (callchain etc..) */
31 PERL_SI *curstackinfo; 93 PERL_SI *curstackinfo;
32 AV *curstack; 94 AV *curstack;
33 AV *mainstack; 95 AV *mainstack;
34 SV **stack_sp; 96 SV **stack_sp;
35 OP *op; 97 OP *op;
36 SV **curpad; 98 SV **curpad;
99 AV *comppad;
37 SV **stack_base; 100 SV **stack_base;
38 SV **stack_max; 101 SV **stack_max;
39 SV **tmps_stack; 102 SV **tmps_stack;
40 I32 tmps_floor; 103 I32 tmps_floor;
41 I32 tmps_ix; 104 I32 tmps_ix;
51 I32 savestack_max; 114 I32 savestack_max;
52 OP **retstack; 115 OP **retstack;
53 I32 retstack_ix; 116 I32 retstack_ix;
54 I32 retstack_max; 117 I32 retstack_max;
55 COP *curcop; 118 COP *curcop;
119 JMPENV *top_env;
56 120
57 /* data associated with this coroutine (initial args) */ 121 /* data associated with this coroutine (initial args) */
58 AV *args; 122 AV *args;
59}; 123};
60 124
61typedef struct coro *Coro__State; 125typedef struct coro *Coro__State;
62typedef struct coro *Coro__State_or_hashref; 126typedef struct coro *Coro__State_or_hashref;
63 127
64static AV *main_mainstack; /* used to differentiate between $main and others */ 128static AV *main_mainstack; /* used to differentiate between $main and others */
65 129static HV *coro_state_stash;
130static SV *ucoro_state_sv;
131static U32 ucoro_state_hash;
66static HV *padlist_cache; 132static HV *padlist_cache;
133static SV *coro_mortal; /* will be freed after next transfer */
67 134
68/* mostly copied from op.c:cv_clone2 */ 135/* mostly copied from op.c:cv_clone2 */
69STATIC AV * 136STATIC AV *
70clone_padlist (AV *protopadlist) 137clone_padlist (AV *protopadlist)
71{ 138{
158 225
159 return newpadlist; 226 return newpadlist;
160} 227}
161 228
162#ifdef MAY_FLUSH 229#ifdef MAY_FLUSH
163STATIC AV * 230STATIC void
164free_padlist (AV *padlist) 231free_padlist (AV *padlist)
165{ 232{
166 /* may be during global destruction */ 233 /* may be during global destruction */
167 if (SvREFCNT(padlist)) 234 if (SvREFCNT(padlist))
168 { 235 {
233#endif 300#endif
234 301
235#define SB do { 302#define SB do {
236#define SE } while (0) 303#define SE } while (0)
237 304
238#define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE 305#define LOAD(state) load_state(aTHX_ (state));
239#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE 306#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
240 307
241#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 308#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
242 309
243static void 310static void
244load_state(pTHX_ Coro__State c) 311load_state(pTHX_ Coro__State c)
245{ 312{
246 PL_dowarn = c->dowarn; 313 PL_dowarn = c->dowarn;
314 PL_in_eval = c->in_eval;
247 315
248 PL_curstackinfo = c->curstackinfo; 316 PL_curstackinfo = c->curstackinfo;
249 PL_curstack = c->curstack; 317 PL_curstack = c->curstack;
250 PL_mainstack = c->mainstack; 318 PL_mainstack = c->mainstack;
251 PL_stack_sp = c->stack_sp; 319 PL_stack_sp = c->stack_sp;
252 PL_op = c->op; 320 PL_op = c->op;
253 PL_curpad = c->curpad; 321 PL_curpad = c->curpad;
322 PL_comppad = c->comppad;
254 PL_stack_base = c->stack_base; 323 PL_stack_base = c->stack_base;
255 PL_stack_max = c->stack_max; 324 PL_stack_max = c->stack_max;
256 PL_tmps_stack = c->tmps_stack; 325 PL_tmps_stack = c->tmps_stack;
257 PL_tmps_floor = c->tmps_floor; 326 PL_tmps_floor = c->tmps_floor;
258 PL_tmps_ix = c->tmps_ix; 327 PL_tmps_ix = c->tmps_ix;
268 PL_savestack_max = c->savestack_max; 337 PL_savestack_max = c->savestack_max;
269 PL_retstack = c->retstack; 338 PL_retstack = c->retstack;
270 PL_retstack_ix = c->retstack_ix; 339 PL_retstack_ix = c->retstack_ix;
271 PL_retstack_max = c->retstack_max; 340 PL_retstack_max = c->retstack_max;
272 PL_curcop = c->curcop; 341 PL_curcop = c->curcop;
342 PL_top_env = c->top_env;
273 343
274 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 344 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
275 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 345 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
276 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 346 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
277 347
316 386
317 PUSHs (Nullsv); 387 PUSHs (Nullsv);
318 /* this loop was inspired by pp_caller */ 388 /* this loop was inspired by pp_caller */
319 for (;;) 389 for (;;)
320 { 390 {
321 do 391 while (cxix >= 0)
322 { 392 {
323 PERL_CONTEXT *cx = &ccstk[cxix--]; 393 PERL_CONTEXT *cx = &ccstk[cxix--];
324 394
325 if (CxTYPE(cx) == CXt_SUB) 395 if (CxTYPE(cx) == CXt_SUB)
326 { 396 {
345 PUSHs ((SV *)cv); 415 PUSHs ((SV *)cv);
346 416
347 get_padlist (cv); /* this is a monster */ 417 get_padlist (cv); /* this is a monster */
348 } 418 }
349 } 419 }
420#ifdef CXt_FORMAT
350 else if (CxTYPE(cx) == CXt_FORMAT) 421 else if (CxTYPE(cx) == CXt_FORMAT)
351 { 422 {
352 /* I never used formats, so how should I know how these are implemented? */ 423 /* I never used formats, so how should I know how these are implemented? */
353 /* my bold guess is as a simple, plain sub... */ 424 /* my bold guess is as a simple, plain sub... */
354 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); 425 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
355 } 426 }
427#endif
356 } 428 }
357 while (cxix >= 0);
358 429
359 if (top_si->si_type == PERLSI_MAIN) 430 if (top_si->si_type == PERLSI_MAIN)
360 break; 431 break;
361 432
362 top_si = top_si->si_prev; 433 top_si = top_si->si_prev;
369 440
370 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 441 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
371 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 442 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
372 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 443 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
373 444
374 /* I have not the slightest idea of why av_reify is necessary */
375 /* but if it's missing the defav contents magically get replaced sometimes */
376 if (c->defav)
377 av_reify (c->defav);
378
379 c->dowarn = PL_dowarn; 445 c->dowarn = PL_dowarn;
446 c->in_eval = PL_in_eval;
380 447
381 c->curstackinfo = PL_curstackinfo; 448 c->curstackinfo = PL_curstackinfo;
382 c->curstack = PL_curstack; 449 c->curstack = PL_curstack;
383 c->mainstack = PL_mainstack; 450 c->mainstack = PL_mainstack;
384 c->stack_sp = PL_stack_sp; 451 c->stack_sp = PL_stack_sp;
385 c->op = PL_op; 452 c->op = PL_op;
386 c->curpad = PL_curpad; 453 c->curpad = PL_curpad;
454 c->comppad = PL_comppad;
387 c->stack_base = PL_stack_base; 455 c->stack_base = PL_stack_base;
388 c->stack_max = PL_stack_max; 456 c->stack_max = PL_stack_max;
389 c->tmps_stack = PL_tmps_stack; 457 c->tmps_stack = PL_tmps_stack;
390 c->tmps_floor = PL_tmps_floor; 458 c->tmps_floor = PL_tmps_floor;
391 c->tmps_ix = PL_tmps_ix; 459 c->tmps_ix = PL_tmps_ix;
401 c->savestack_max = PL_savestack_max; 469 c->savestack_max = PL_savestack_max;
402 c->retstack = PL_retstack; 470 c->retstack = PL_retstack;
403 c->retstack_ix = PL_retstack_ix; 471 c->retstack_ix = PL_retstack_ix;
404 c->retstack_max = PL_retstack_max; 472 c->retstack_max = PL_retstack_max;
405 c->curcop = PL_curcop; 473 c->curcop = PL_curcop;
474 c->top_env = PL_top_env;
475}
476
477/*
478 * allocate various perl stacks. This is an exact copy
479 * of perl.c:init_stacks, except that it uses less memory
480 * on the assumption that coroutines do not usually need
481 * a lot of stackspace.
482 */
483STATIC void
484coro_init_stacks (pTHX)
485{
486 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
487 PL_curstackinfo->si_type = PERLSI_MAIN;
488 PL_curstack = PL_curstackinfo->si_stack;
489 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
490
491 PL_stack_base = AvARRAY(PL_curstack);
492 PL_stack_sp = PL_stack_base;
493 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
494
495 New(50,PL_tmps_stack,96,SV*);
496 PL_tmps_floor = -1;
497 PL_tmps_ix = -1;
498 PL_tmps_max = 96;
499
500 New(54,PL_markstack,16,I32);
501 PL_markstack_ptr = PL_markstack;
502 PL_markstack_max = PL_markstack + 16;
503
504#ifdef SET_MARK_OFFSET
505 SET_MARK_OFFSET;
506#endif
507
508 New(54,PL_scopestack,16,I32);
509 PL_scopestack_ix = 0;
510 PL_scopestack_max = 16;
511
512 New(54,PL_savestack,96,ANY);
513 PL_savestack_ix = 0;
514 PL_savestack_max = 96;
515
516 New(54,PL_retstack,8,OP*);
517 PL_retstack_ix = 0;
518 PL_retstack_max = 8;
406} 519}
407 520
408/* 521/*
409 * destroy the stacks, the callchain etc... 522 * destroy the stacks, the callchain etc...
410 * still there is a memleak of 128 bytes...
411 */ 523 */
412STATIC void 524STATIC void
413destroy_stacks(pTHX) 525destroy_stacks(pTHX)
414{ 526{
527 if (!IN_DESTRUCT)
528 {
415 /* is this ugly, I ask? */ 529 /* is this ugly, I ask? */
416 while (PL_scopestack_ix) 530 while (PL_scopestack_ix)
417 LEAVE; 531 LEAVE;
418 532
419 /* sure it is, but more important: is it correct?? :/ */ 533 /* sure it is, but more important: is it correct?? :/ */
420 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ 534 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
421 FREETMPS; 535 FREETMPS;
536 }
422 537
423 while (PL_curstackinfo->si_next) 538 while (PL_curstackinfo->si_next)
424 PL_curstackinfo = PL_curstackinfo->si_next; 539 PL_curstackinfo = PL_curstackinfo->si_next;
425 540
426 while (PL_curstackinfo) 541 while (PL_curstackinfo)
431 dSP; 546 dSP;
432 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 547 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
433 PUTBACK; /* possibly superfluous */ 548 PUTBACK; /* possibly superfluous */
434 } 549 }
435 550
551 if (!IN_DESTRUCT)
552 {
436 dounwind(-1); 553 dounwind(-1);
437
438 SvREFCNT_dec(PL_curstackinfo->si_stack); 554 SvREFCNT_dec(PL_curstackinfo->si_stack);
555 }
556
439 Safefree(PL_curstackinfo->si_cxstack); 557 Safefree(PL_curstackinfo->si_cxstack);
440 Safefree(PL_curstackinfo); 558 Safefree(PL_curstackinfo);
441 PL_curstackinfo = p; 559 PL_curstackinfo = p;
442 } 560 }
443 561
446 Safefree(PL_scopestack); 564 Safefree(PL_scopestack);
447 Safefree(PL_savestack); 565 Safefree(PL_savestack);
448 Safefree(PL_retstack); 566 Safefree(PL_retstack);
449} 567}
450 568
569static void
570allocate_stack (Coro__State ctx, int alloc)
571{
572 coro_stack *stack;
573
574 New (0, stack, 1, coro_stack);
575
576 stack->refcnt = 1;
577 stack->usecnt = 1;
578 stack->gencnt = ctx->gencnt = 0;
579 if (alloc)
580 {
581#if HAVE_MMAP
582 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
583 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
584 if (stack->sptr == (void *)-1)
585#endif
586 {
587 /*FIXME*//*D*//* reasonable stack size! */
588 stack->ssize = -4096 * sizeof (long);
589 New (0, stack->sptr, 4096, long);
590 }
591 }
592 else
593 stack->sptr = 0;
594
595 ctx->stack = stack;
596}
597
598static void
599deallocate_stack (Coro__State ctx)
600{
601 coro_stack *stack = ctx->stack;
602
603 ctx->stack = 0;
604
605 if (stack)
606 {
607 if (!--stack->refcnt)
608 {
609#ifdef HAVE_MMAP
610 if (stack->ssize > 0 && stack->sptr)
611 munmap (stack->sptr, stack->ssize);
612 else
613#endif
614 Safefree (stack->sptr);
615
616 Safefree (stack);
617 }
618 else if (ctx->gencnt == stack->gencnt)
619 --stack->usecnt;
620 }
621}
622
623static void
624setup_coro (void *arg)
625{
626 /*
627 * emulate part of the perl startup here.
628 */
629 dSP;
630 Coro__State ctx = (Coro__State)arg;
631 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
632
633 coro_init_stacks (aTHX);
634 /*PL_curcop = 0;*/
635 /*PL_in_eval = PL_in_eval;*/ /* inherit */
636 SvREFCNT_dec (GvAV (PL_defgv));
637 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
638
639 SPAGAIN;
640
641 if (ctx->stack)
642 {
643 ctx->cursp = 0;
644
645 PUSHMARK(SP);
646 PUTBACK;
647 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
648
649 if (SvTRUE (ERRSV))
650 croak (NULL);
651 else
652 croak ("FATAL: CCTXT coroutine returned!");
653 }
654 else
655 {
656 UNOP myop;
657
658 PL_op = (OP *)&myop;
659
660 Zero(&myop, 1, UNOP);
661 myop.op_next = Nullop;
662 myop.op_flags = OPf_WANT_VOID;
663
664 PUSHMARK(SP);
665 XPUSHs (sub_init);
666 /*
667 * the next line is slightly wrong, as PL_op->op_next
668 * is actually being executed so we skip the first op.
669 * that doesn't matter, though, since it is only
670 * pp_nextstate and we never return...
671 * ah yes, and I don't care anyways ;)
672 */
673 PUTBACK;
674 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
675 SPAGAIN;
676
677 ENTER; /* necessary e.g. for dounwind */
678 }
679}
680
681static void
682continue_coro (void *arg)
683{
684 /*
685 * this is a _very_ stripped down perl interpreter ;)
686 */
687 Coro__State ctx = (Coro__State)arg;
688 JMPENV coro_start_env;
689
690 PL_top_env = &ctx->start_env;
691
692 ctx->cursp = 0;
693 PL_op = PL_op->op_next;
694 CALLRUNOPS(aTHX);
695
696 abort ();
697}
698
451STATIC void 699STATIC void
452transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 700transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
453{ 701{
454 dSP; 702 dSTACKLEVEL;
703 static struct coro *xnext;
455 704
456 if (prev != next) 705 if (prev != next)
457 { 706 {
458 /* 707 xnext = next;
459 * this could be done in newprocess which would lead to 708
460 * extremely elegant and fast (just SAVE/LOAD)
461 * code here, but lazy allocation of stacks has also
462 * some virtues and the overhead of the if() is nil.
463 */
464 if (next->mainstack) 709 if (next->mainstack)
465 { 710 {
466 SAVE (prev, flags); 711 SAVE (prev, flags);
467 LOAD (next); 712 LOAD (next);
713
468 /* mark this state as in-use */ 714 /* mark this state as in-use */
469 next->mainstack = 0; 715 next->mainstack = 0;
470 next->tmps_ix = -2; 716 next->tmps_ix = -2;
717
718 /* stacklevel changed? if yes, grab the stack for us! */
719 if (flags & TRANSFER_SAVE_CCTXT)
720 {
721 if (!prev->stack)
722 allocate_stack (prev, 0);
723 else if (prev->cursp != stacklevel
724 && prev->stack->usecnt > 1)
725 {
726 prev->gencnt = ++prev->stack->gencnt;
727 prev->stack->usecnt = 1;
728 }
729
730 /* has our stack been invalidated? */
731 if (next->stack && next->stack->gencnt != next->gencnt)
732 {
733 deallocate_stack (next);
734 allocate_stack (next, 1);
735 coro_create (&(next->stack->cctx),
736 continue_coro, (void *)next,
737 next->stack->sptr, labs (next->stack->ssize));
738 }
739
740 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
741 /* don't add any code here */
742 }
743
471 } 744 }
472 else if (next->tmps_ix == -2) 745 else if (next->tmps_ix == -2)
473 {
474 croak ("tried to transfer to running coroutine"); 746 croak ("tried to transfer to running coroutine");
475 }
476 else 747 else
477 { 748 {
478 /*
479 * emulate part of the perl startup here.
480 */
481 UNOP myop;
482
483 SAVE (prev, -1); /* first get rid of the old state */ 749 SAVE (prev, -1); /* first get rid of the old state */
484 750
485 init_stacks (); /* from perl.c */ 751 if (flags & TRANSFER_SAVE_CCTXT)
486 SPAGAIN;
487
488 PL_op = (OP *)&myop;
489 /*PL_curcop = 0;*/
490 SvREFCNT_dec (GvAV (PL_defgv));
491 GvAV (PL_defgv) = next->args;
492
493 Zero(&myop, 1, UNOP);
494 myop.op_next = Nullop;
495 myop.op_flags = OPf_WANT_VOID;
496
497 PUSHMARK(SP);
498 XPUSHs ((SV*)get_cv(SUB_INIT, TRUE));
499 /*
500 * the next line is slightly wrong, as PL_op->op_next
501 * is actually being executed so we skip the first op.
502 * that doesn't matter, though, since it is only
503 * pp_nextstate and we never return...
504 * ah yes, and I don't care anyways ;)
505 */ 752 {
506 PUTBACK; 753 if (!prev->stack)
507 PL_op = pp_entersub(aTHX); 754 allocate_stack (prev, 0);
508 SPAGAIN;
509 755
510 ENTER; /* necessary e.g. for dounwind */ 756 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
757 {
758 PL_top_env = &next->start_env;
759
760 setup_coro (next);
761
762 prev->stack->refcnt++;
763 prev->stack->usecnt++;
764 next->stack = prev->stack;
765 next->gencnt = prev->gencnt;
766 }
767 else
768 {
769 assert (!next->stack);
770 allocate_stack (next, 1);
771 coro_create (&(next->stack->cctx),
772 setup_coro, (void *)next,
773 next->stack->sptr, labs (next->stack->ssize));
774 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
775 /* don't add any code here */
776 }
777 }
778 else
779 setup_coro (next);
511 } 780 }
781
782 /*
783 * xnext is now either prev or next, depending on wether
784 * we switched the c stack or not. that's why I use a global
785 * variable, that should become thread-specific at one point.
786 */
787 xnext->cursp = stacklevel;
512 } 788 }
789
790 if (coro_mortal)
791 {
792 SvREFCNT_dec (coro_mortal);
793 coro_mortal = 0;
794 }
795}
796
797#define SV_CORO(sv,func) \
798 do { \
799 if (SvROK (sv)) \
800 sv = SvRV (sv); \
801 \
802 if (SvTYPE(sv) == SVt_PVHV) \
803 { \
804 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
805 \
806 if (!he) \
807 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
808 \
809 (sv) = SvRV (HeVAL(he)); \
810 } \
811 \
812 /* must also be changed inside Coro::Cont::yield */ \
813 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \
814 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
815 \
816 } while(0)
817
818#define SvSTATE(sv) (struct coro *)SvIV (sv)
819
820static void
821api_transfer(pTHX_ SV *prev, SV *next, int flags)
822{
823 SV_CORO (prev, "Coro::transfer");
824 SV_CORO (next, "Coro::transfer");
825
826 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags);
827}
828
829/** Coro ********************************************************************/
830
831#define PRIO_MAX 3
832#define PRIO_HIGH 1
833#define PRIO_NORMAL 0
834#define PRIO_LOW -1
835#define PRIO_IDLE -3
836#define PRIO_MIN -4
837
838/* for Coro.pm */
839static GV *coro_current, *coro_idle;
840static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
841static int coro_nready;
842
843static void
844coro_enq (SV *sv)
845{
846 if (SvTYPE (sv) == SVt_PVHV)
847 {
848 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
849 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
850
851 prio = prio > PRIO_MAX ? PRIO_MAX
852 : prio < PRIO_MIN ? PRIO_MIN
853 : prio;
854
855 av_push (coro_ready [prio - PRIO_MIN], sv);
856 coro_nready++;
857
858 return;
859 }
860
861 croak ("Coro::ready tried to enqueue something that is not a coroutine");
862}
863
864static SV *
865coro_deq (int min_prio)
866{
867 int prio = PRIO_MAX - PRIO_MIN;
868
869 min_prio -= PRIO_MIN;
870 if (min_prio < 0)
871 min_prio = 0;
872
873 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
874 if (av_len (coro_ready[prio]) >= 0)
875 {
876 coro_nready--;
877 return av_shift (coro_ready[prio]);
878 }
879
880 return 0;
881}
882
883static void
884api_ready (SV *coro)
885{
886 if (SvROK (coro))
887 coro = SvRV (coro);
888
889 coro_enq (SvREFCNT_inc (coro));
890}
891
892static void
893api_schedule (void)
894{
895 SV *prev, *next;
896
897 prev = SvRV (GvSV (coro_current));
898 next = coro_deq (PRIO_MIN);
899
900 if (!next)
901 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
902
903 /* free this only after the transfer */
904 coro_mortal = prev;
905 SV_CORO (prev, "Coro::schedule");
906
907 SvRV (GvSV (coro_current)) = next;
908
909 SV_CORO (next, "Coro::schedule");
910
911 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
912 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
913}
914
915static void
916api_cede (void)
917{
918 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
919
920 api_schedule ();
513} 921}
514 922
515MODULE = Coro::State PACKAGE = Coro::State 923MODULE = Coro::State PACKAGE = Coro::State
516 924
517PROTOTYPES: ENABLE 925PROTOTYPES: ENABLE
518 926
519BOOT: 927BOOT:
520{ /* {} necessary for stoopid perl-5.6.x */ 928{ /* {} necessary for stoopid perl-5.6.x */
929 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
930 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
521 HV * stash = gv_stashpvn("Coro::State", 10, TRUE); 931 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
522 932
523 newCONSTSUB (stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 933 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
524 newCONSTSUB (stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 934 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
525 newCONSTSUB (stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 935 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
936 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
526 937
527 if (!padlist_cache) 938 if (!padlist_cache)
528 padlist_cache = newHV (); 939 padlist_cache = newHV ();
529 940
530 main_mainstack = PL_mainstack; 941 main_mainstack = PL_mainstack;
942
943 coroapi.ver = CORO_API_VERSION;
944 coroapi.transfer = api_transfer;
531} 945}
532 946
533Coro::State 947Coro::State
534_newprocess(args) 948_newprocess(args)
535 SV * args 949 SV * args
538 Coro__State coro; 952 Coro__State coro;
539 953
540 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 954 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
541 croak ("Coro::State::_newprocess expects an arrayref"); 955 croak ("Coro::State::_newprocess expects an arrayref");
542 956
543 New (0, coro, 1, struct coro); 957 Newz (0, coro, 1, struct coro);
544 958
959 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
545 coro->mainstack = 0; /* actual work is done inside transfer */ 960 coro->mainstack = 0; /* actual work is done inside transfer */
546 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 961 coro->stack = 0;
962
963 /* same as JMPENV_BOOTSTRAP */
964 /* we might be able to recycle start_env, but safe is safe */
965 //Zero(&coro->start_env, 1, JMPENV);
966 coro->start_env.je_ret = -1;
967 coro->start_env.je_mustcatch = TRUE;
547 968
548 RETVAL = coro; 969 RETVAL = coro;
549 OUTPUT: 970 OUTPUT:
550 RETVAL 971 RETVAL
551 972
552void 973void
553transfer(prev, next, flags = TRANSFER_SAVE_ALL) 974transfer(prev, next, flags)
554 Coro::State_or_hashref prev 975 SV *prev
555 Coro::State_or_hashref next 976 SV *next
556 int flags 977 int flags
557 PROTOTYPE: @ 978 PROTOTYPE: @
558 CODE: 979 CODE:
559 980 PUTBACK;
981 SV_CORO (next, "Coro::transfer");
982 SV_CORO (prev, "Coro::transfer");
560 transfer (aTHX_ prev, next, flags); 983 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
984 SPAGAIN;
561 985
562void 986void
563DESTROY(coro) 987DESTROY(coro)
564 Coro::State coro 988 Coro::State coro
565 CODE: 989 CODE:
566 990
567 if (coro->mainstack && coro->mainstack != main_mainstack) 991 if (coro->mainstack && coro->mainstack != main_mainstack)
568 { 992 {
569 struct coro temp; 993 struct coro temp;
570 994
995 PUTBACK;
571 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 996 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
572 LOAD(aTHX_ coro); 997 LOAD(aTHX_ coro);
998 SPAGAIN;
573 999
574 destroy_stacks (); 1000 destroy_stacks (aTHX);
575 1001
576 LOAD((&temp)); /* this will get rid of defsv etc.. */ 1002 LOAD((&temp)); /* this will get rid of defsv etc.. */
1003 SPAGAIN;
1004
1005 coro->mainstack = 0;
577 } 1006 }
578 1007
1008 deallocate_stack (coro);
1009 SvREFCNT_dec (coro->args);
579 Safefree (coro); 1010 Safefree (coro);
580
581 /*
582 * there is one problematic case left (remember _recurse?)
583 * consider the case when we
584 *
585 * 1. start a coroutine
586 * 2. inside it descend into some xs functions
587 * 3. xs function calls a callback
588 * 4. callback switches to $main
589 * 5. $main ends - we will end inside the xs function
590 * 6. xs function returns and perl executes - what?
591 *
592 * to avoid this case we recurse in this function
593 * and simply call my_exit(0), skipping other xs functions
594 */
595
596#if 0
597void
598_recurse()
599 CODE:
600 LEAVE;
601 PL_stack_sp = PL_stack_base + ax - 1;
602 PL_op = PL_op->op_next;
603 CALLRUNOPS(aTHX);
604 printf ("my_exit\n");
605 my_exit (0);
606
607#endif
608 1011
609void 1012void
610flush() 1013flush()
611 CODE: 1014 CODE:
612#ifdef MAY_FLUSH 1015#ifdef MAY_FLUSH
613 flush_padlist_cache (); 1016 flush_padlist_cache ();
614#endif 1017#endif
615 1018
1019void
1020_exit(code)
1021 int code
1022 PROTOTYPE: $
1023 CODE:
1024#if defined(__GLIBC__) || _POSIX_C_SOURCE
1025 _exit (code);
1026#else
1027 signal (SIGTERM, SIG_DFL);
1028 raise (SIGTERM);
1029 exit (code);
1030#endif
1031
616MODULE = Coro::State PACKAGE = Coro::Cont 1032MODULE = Coro::State PACKAGE = Coro::Cont
617 1033
618# this is dirty (do you hear me?) and should be in it's own .xs 1034# this is slightly dirty (should expose a c-level api)
619 1035
620void 1036void
621result(...) 1037yield(...)
622 PROTOTYPE: @ 1038 PROTOTYPE: @
623 CODE: 1039 CODE:
624 static SV *returnstk; 1040 static SV *returnstk;
625 SV *sv; 1041 SV *sv;
626 AV *defav = GvAV (PL_defgv); 1042 AV *defav = GvAV (PL_defgv);
627 struct coro *prev, *next; 1043 struct coro *prev, *next;
628 1044
629 if (!returnstk) 1045 if (!returnstk)
630 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1046 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
631 1047
632 /* set up @_ -- ugly */ 1048 /* set up @_ -- ugly */
633 av_clear (defav); 1049 av_clear (defav);
634 av_fill (defav, items - 1); 1050 av_fill (defav, items - 1);
635 while (items--) 1051 while (items--)
638 mg_get (returnstk); /* isn't documentation wrong for mg_get? */ 1054 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
639 sv = av_pop ((AV *)SvRV (returnstk)); 1055 sv = av_pop ((AV *)SvRV (returnstk));
640 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); 1056 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
641 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1057 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
642 SvREFCNT_dec (sv); 1058 SvREFCNT_dec (sv);
1059
643 transfer(prev, next, 0); 1060 transfer(aTHX_ prev, next, 0);
644 1061
1062MODULE = Coro::State PACKAGE = Coro
1063
1064# this is slightly dirty (should expose a c-level api)
1065
1066BOOT:
1067{
1068 int i;
1069 HV *stash = gv_stashpv ("Coro", TRUE);
1070
1071 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
1072 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1073 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1074 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
1075 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1076 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
1077
1078 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1079 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1080
1081 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1082 coro_ready[i] = newAV ();
1083
1084 {
1085 SV *sv = perl_get_sv("Coro::API", 1);
1086
1087 coroapi.schedule = api_schedule;
1088 coroapi.cede = api_cede;
1089 coroapi.ready = api_ready;
1090 coroapi.nready = &coro_nready;
1091 coroapi.current = coro_current;
1092
1093 GCoroAPI = &coroapi;
1094 sv_setiv(sv, (IV)&coroapi);
1095 SvREADONLY_on(sv);
1096 }
1097}
1098
1099void
1100ready(self)
1101 SV * self
1102 PROTOTYPE: $
1103 CODE:
1104 api_ready (self);
1105
1106int
1107nready(...)
1108 PROTOTYPE:
1109 CODE:
1110 RETVAL = coro_nready;
1111 OUTPUT:
1112 RETVAL
1113
1114void
1115schedule(...)
1116 PROTOTYPE:
1117 CODE:
1118 api_schedule ();
1119
1120void
1121cede(...)
1122 PROTOTYPE:
1123 CODE:
1124 api_cede ();
1125

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines