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.18 by root, Thu Jul 26 03:46:15 2001 UTC vs.
Revision 1.47 by pcg, Sat Nov 15 03:53:10 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#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
27
5#include "libcoro/coro.c" 28#include "libcoro/coro.c"
29
30#include <signal.h>
6 31
7#ifdef HAVE_MMAP 32#ifdef HAVE_MMAP
8# include <unistd.h> 33# include <unistd.h>
9# include <sys/mman.h> 34# include <sys/mman.h>
10# ifndef MAP_ANON
11# ifdef MAP_ANONYMOUS 35# ifndef MAP_ANONYMOUS
12# define MAP_ANON MAP_ANONYMOUS 36# ifdef MAP_ANON
37# define MAP_ANONYMOUS MAP_ANON
13# else 38# else
14# undef HAVE_MMAP 39# undef HAVE_MMAP
15# endif 40# endif
16# endif 41# endif
17#endif 42#endif
18 43
19#define MAY_FLUSH /* increases codesize */ 44#define MAY_FLUSH /* increases codesize and is rarely used */
20
21/* perl-related */
22#define TRANSFER_SAVE_DEFAV 0x00000001
23#define TRANSFER_SAVE_DEFSV 0x00000002
24#define TRANSFER_SAVE_ERRSV 0x00000004
25/* c-related */
26#define TRANSFER_SAVE_CCTXT 0x00000008
27#ifdef CORO_LAZY_STACK
28# define TRANSFER_LAZY_STACK 0x00000010
29#else
30# define TRANSFER_LAZY_STACK 0x00000000
31#endif
32
33#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \
34 |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT)
35 45
36#define SUB_INIT "Coro::State::initialize" 46#define SUB_INIT "Coro::State::initialize"
37#define UCORO_STATE "_coro_state" 47#define UCORO_STATE "_coro_state"
38 48
39/* 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
40 * 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
41 * and should be unique. */ 51 * and should be unique. */
42#define dSTACKLEVEL void *stacklevel = &stacklevel 52#define dSTACKLEVEL void *stacklevel = &stacklevel
43 53
54#define IN_DESTRUCT (PL_main_cv == Nullcv)
55
44#define labs(l) ((l) >= 0 ? (l) : -(l)) 56#define labs(l) ((l) >= 0 ? (l) : -(l))
57
58#include "CoroAPI.h"
59
60static struct CoroAPI coroapi;
45 61
46/* this is actually not only the c stack but also c registers etc... */ 62/* this is actually not only the c stack but also c registers etc... */
47typedef struct { 63typedef struct {
48 int refcnt; /* pointer reference counter */ 64 int refcnt; /* pointer reference counter */
49 int usecnt; /* shared by how many coroutines */ 65 int usecnt; /* shared by how many coroutines */
54 void *sptr; 70 void *sptr;
55 long ssize; /* positive == mmap, otherwise malloc */ 71 long ssize; /* positive == mmap, otherwise malloc */
56} coro_stack; 72} coro_stack;
57 73
58struct coro { 74struct coro {
75 /* the top-level JMPENV for each coroutine, needed to catch dies. */
76 JMPENV start_env;
77
59 /* the optional C context */ 78 /* the optional C context */
60 coro_stack *stack; 79 coro_stack *stack;
61 void *cursp; 80 void *cursp;
62 int gencnt; 81 int gencnt;
63 82
66 SV *defsv; 85 SV *defsv;
67 SV *errsv; 86 SV *errsv;
68 87
69 /* saved global state not related to stacks */ 88 /* saved global state not related to stacks */
70 U8 dowarn; 89 U8 dowarn;
90 I32 in_eval;
71 91
72 /* the stacks and related info (callchain etc..) */ 92 /* the stacks and related info (callchain etc..) */
73 PERL_SI *curstackinfo; 93 PERL_SI *curstackinfo;
74 AV *curstack; 94 AV *curstack;
75 AV *mainstack; 95 AV *mainstack;
76 SV **stack_sp; 96 SV **stack_sp;
77 OP *op; 97 OP *op;
78 SV **curpad; 98 SV **curpad;
99 AV *comppad;
79 SV **stack_base; 100 SV **stack_base;
80 SV **stack_max; 101 SV **stack_max;
81 SV **tmps_stack; 102 SV **tmps_stack;
82 I32 tmps_floor; 103 I32 tmps_floor;
83 I32 tmps_ix; 104 I32 tmps_ix;
93 I32 savestack_max; 114 I32 savestack_max;
94 OP **retstack; 115 OP **retstack;
95 I32 retstack_ix; 116 I32 retstack_ix;
96 I32 retstack_max; 117 I32 retstack_max;
97 COP *curcop; 118 COP *curcop;
98 JMPENV start_env;
99 JMPENV *top_env; 119 JMPENV *top_env;
100 120
101 /* data associated with this coroutine (initial args) */ 121 /* data associated with this coroutine (initial args) */
102 AV *args; 122 AV *args;
103}; 123};
108static AV *main_mainstack; /* used to differentiate between $main and others */ 128static AV *main_mainstack; /* used to differentiate between $main and others */
109static HV *coro_state_stash; 129static HV *coro_state_stash;
110static SV *ucoro_state_sv; 130static SV *ucoro_state_sv;
111static U32 ucoro_state_hash; 131static U32 ucoro_state_hash;
112static HV *padlist_cache; 132static HV *padlist_cache;
133static SV *coro_mortal; /* will be freed after next transfer */
113 134
114/* mostly copied from op.c:cv_clone2 */ 135/* mostly copied from op.c:cv_clone2 */
115STATIC AV * 136STATIC AV *
116clone_padlist (AV *protopadlist) 137clone_padlist (AV *protopadlist)
117{ 138{
204 225
205 return newpadlist; 226 return newpadlist;
206} 227}
207 228
208#ifdef MAY_FLUSH 229#ifdef MAY_FLUSH
209STATIC AV * 230STATIC void
210free_padlist (AV *padlist) 231free_padlist (AV *padlist)
211{ 232{
212 /* may be during global destruction */ 233 /* may be during global destruction */
213 if (SvREFCNT(padlist)) 234 if (SvREFCNT(padlist))
214 { 235 {
279#endif 300#endif
280 301
281#define SB do { 302#define SB do {
282#define SE } while (0) 303#define SE } while (0)
283 304
284#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE 305#define LOAD(state) load_state(aTHX_ (state));
285#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE 306#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
286 307
287#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
288 309
289static void 310static void
290load_state(pTHX_ Coro__State c) 311load_state(pTHX_ Coro__State c)
291{ 312{
292 PL_dowarn = c->dowarn; 313 PL_dowarn = c->dowarn;
314 PL_in_eval = c->in_eval;
293 315
294 PL_curstackinfo = c->curstackinfo; 316 PL_curstackinfo = c->curstackinfo;
295 PL_curstack = c->curstack; 317 PL_curstack = c->curstack;
296 PL_mainstack = c->mainstack; 318 PL_mainstack = c->mainstack;
297 PL_stack_sp = c->stack_sp; 319 PL_stack_sp = c->stack_sp;
298 PL_op = c->op; 320 PL_op = c->op;
299 PL_curpad = c->curpad; 321 PL_curpad = c->curpad;
322 PL_comppad = c->comppad;
300 PL_stack_base = c->stack_base; 323 PL_stack_base = c->stack_base;
301 PL_stack_max = c->stack_max; 324 PL_stack_max = c->stack_max;
302 PL_tmps_stack = c->tmps_stack; 325 PL_tmps_stack = c->tmps_stack;
303 PL_tmps_floor = c->tmps_floor; 326 PL_tmps_floor = c->tmps_floor;
304 PL_tmps_ix = c->tmps_ix; 327 PL_tmps_ix = c->tmps_ix;
314 PL_savestack_max = c->savestack_max; 337 PL_savestack_max = c->savestack_max;
315 PL_retstack = c->retstack; 338 PL_retstack = c->retstack;
316 PL_retstack_ix = c->retstack_ix; 339 PL_retstack_ix = c->retstack_ix;
317 PL_retstack_max = c->retstack_max; 340 PL_retstack_max = c->retstack_max;
318 PL_curcop = c->curcop; 341 PL_curcop = c->curcop;
319 PL_start_env = c->start_env;
320 PL_top_env = c->top_env; 342 PL_top_env = c->top_env;
321 343
322 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 344 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
323 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 345 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
324 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 346 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
364 386
365 PUSHs (Nullsv); 387 PUSHs (Nullsv);
366 /* this loop was inspired by pp_caller */ 388 /* this loop was inspired by pp_caller */
367 for (;;) 389 for (;;)
368 { 390 {
369 do 391 while (cxix >= 0)
370 { 392 {
371 PERL_CONTEXT *cx = &ccstk[cxix--]; 393 PERL_CONTEXT *cx = &ccstk[cxix--];
372 394
373 if (CxTYPE(cx) == CXt_SUB) 395 if (CxTYPE(cx) == CXt_SUB)
374 { 396 {
393 PUSHs ((SV *)cv); 415 PUSHs ((SV *)cv);
394 416
395 get_padlist (cv); /* this is a monster */ 417 get_padlist (cv); /* this is a monster */
396 } 418 }
397 } 419 }
420#ifdef CXt_FORMAT
398 else if (CxTYPE(cx) == CXt_FORMAT) 421 else if (CxTYPE(cx) == CXt_FORMAT)
399 { 422 {
400 /* 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? */
401 /* my bold guess is as a simple, plain sub... */ 424 /* my bold guess is as a simple, plain sub... */
402 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");
403 } 426 }
427#endif
404 } 428 }
405 while (cxix >= 0);
406 429
407 if (top_si->si_type == PERLSI_MAIN) 430 if (top_si->si_type == PERLSI_MAIN)
408 break; 431 break;
409 432
410 top_si = top_si->si_prev; 433 top_si = top_si->si_prev;
417 440
418 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;
419 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 442 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
420 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 443 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
421 444
422 /* I have not the slightest idea of why av_reify is necessary */
423 /* but if it's missing the defav contents magically get replaced sometimes */
424 if (c->defav)
425 av_reify (c->defav);
426
427 c->dowarn = PL_dowarn; 445 c->dowarn = PL_dowarn;
446 c->in_eval = PL_in_eval;
428 447
429 c->curstackinfo = PL_curstackinfo; 448 c->curstackinfo = PL_curstackinfo;
430 c->curstack = PL_curstack; 449 c->curstack = PL_curstack;
431 c->mainstack = PL_mainstack; 450 c->mainstack = PL_mainstack;
432 c->stack_sp = PL_stack_sp; 451 c->stack_sp = PL_stack_sp;
433 c->op = PL_op; 452 c->op = PL_op;
434 c->curpad = PL_curpad; 453 c->curpad = PL_curpad;
454 c->comppad = PL_comppad;
435 c->stack_base = PL_stack_base; 455 c->stack_base = PL_stack_base;
436 c->stack_max = PL_stack_max; 456 c->stack_max = PL_stack_max;
437 c->tmps_stack = PL_tmps_stack; 457 c->tmps_stack = PL_tmps_stack;
438 c->tmps_floor = PL_tmps_floor; 458 c->tmps_floor = PL_tmps_floor;
439 c->tmps_ix = PL_tmps_ix; 459 c->tmps_ix = PL_tmps_ix;
449 c->savestack_max = PL_savestack_max; 469 c->savestack_max = PL_savestack_max;
450 c->retstack = PL_retstack; 470 c->retstack = PL_retstack;
451 c->retstack_ix = PL_retstack_ix; 471 c->retstack_ix = PL_retstack_ix;
452 c->retstack_max = PL_retstack_max; 472 c->retstack_max = PL_retstack_max;
453 c->curcop = PL_curcop; 473 c->curcop = PL_curcop;
454 c->start_env = PL_start_env;
455 c->top_env = PL_top_env; 474 c->top_env = PL_top_env;
456} 475}
457 476
458/* 477/*
459 * allocate various perl stacks. This is an exact copy 478 * allocate various perl stacks. This is an exact copy
480 499
481 New(54,PL_markstack,16,I32); 500 New(54,PL_markstack,16,I32);
482 PL_markstack_ptr = PL_markstack; 501 PL_markstack_ptr = PL_markstack;
483 PL_markstack_max = PL_markstack + 16; 502 PL_markstack_max = PL_markstack + 16;
484 503
504#ifdef SET_MARK_OFFSET
485 SET_MARK_OFFSET; 505 SET_MARK_OFFSET;
506#endif
486 507
487 New(54,PL_scopestack,16,I32); 508 New(54,PL_scopestack,16,I32);
488 PL_scopestack_ix = 0; 509 PL_scopestack_ix = 0;
489 PL_scopestack_max = 16; 510 PL_scopestack_max = 16;
490 511
502 * still there is a memleak of 128 bytes... 523 * still there is a memleak of 128 bytes...
503 */ 524 */
504STATIC void 525STATIC void
505destroy_stacks(pTHX) 526destroy_stacks(pTHX)
506{ 527{
528 if (!IN_DESTRUCT)
529 {
507 /* is this ugly, I ask? */ 530 /* is this ugly, I ask? */
508 while (PL_scopestack_ix) 531 while (PL_scopestack_ix)
509 LEAVE; 532 LEAVE;
510 533
511 /* sure it is, but more important: is it correct?? :/ */ 534 /* sure it is, but more important: is it correct?? :/ */
512 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ 535 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
513 FREETMPS; 536 FREETMPS;
537 }
514 538
515 while (PL_curstackinfo->si_next) 539 while (PL_curstackinfo->si_next)
516 PL_curstackinfo = PL_curstackinfo->si_next; 540 PL_curstackinfo = PL_curstackinfo->si_next;
517 541
518 while (PL_curstackinfo) 542 while (PL_curstackinfo)
523 dSP; 547 dSP;
524 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 548 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
525 PUTBACK; /* possibly superfluous */ 549 PUTBACK; /* possibly superfluous */
526 } 550 }
527 551
552 if (!IN_DESTRUCT)
553 {
528 dounwind(-1); 554 dounwind(-1);
529
530 SvREFCNT_dec(PL_curstackinfo->si_stack); 555 SvREFCNT_dec(PL_curstackinfo->si_stack);
556 }
557
531 Safefree(PL_curstackinfo->si_cxstack); 558 Safefree(PL_curstackinfo->si_cxstack);
532 Safefree(PL_curstackinfo); 559 Safefree(PL_curstackinfo);
533 PL_curstackinfo = p; 560 PL_curstackinfo = p;
534 } 561 }
535 562
550 stack->refcnt = 1; 577 stack->refcnt = 1;
551 stack->usecnt = 1; 578 stack->usecnt = 1;
552 stack->gencnt = ctx->gencnt = 0; 579 stack->gencnt = ctx->gencnt = 0;
553 if (alloc) 580 if (alloc)
554 { 581 {
555#ifdef HAVE_MMAP 582#if HAVE_MMAP
556 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ 583 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
557 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); 584 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
558 if (stack->sptr == (void *)-1) 585 if (stack->sptr == (void *)-1)
559#endif 586#endif
560 { 587 {
561 /*FIXME*//*D*//* reasonable stack size! */ 588 /*FIXME*//*D*//* reasonable stack size! */
562 stack->ssize = -4096 * sizeof (long); 589 stack->ssize = -4096 * sizeof (long);
582 { 609 {
583#ifdef HAVE_MMAP 610#ifdef HAVE_MMAP
584 if (stack->ssize > 0 && stack->sptr) 611 if (stack->ssize > 0 && stack->sptr)
585 munmap (stack->sptr, stack->ssize); 612 munmap (stack->sptr, stack->ssize);
586 else 613 else
587#else 614#endif
588 Safefree (stack->sptr); 615 Safefree (stack->sptr);
589#endif 616
590 Safefree (stack); 617 Safefree (stack);
591 } 618 }
592 else if (ctx->gencnt == stack->gencnt) 619 else if (ctx->gencnt == stack->gencnt)
593 --stack->usecnt; 620 --stack->usecnt;
594 } 621 }
603 dSP; 630 dSP;
604 Coro__State ctx = (Coro__State)arg; 631 Coro__State ctx = (Coro__State)arg;
605 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 632 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
606 633
607 coro_init_stacks (aTHX); 634 coro_init_stacks (aTHX);
608 JMPENV_BOOTSTRAP; 635 /*PL_curcop = 0;*/
636 /*PL_in_eval = PL_in_eval;*/ /* inherit */
637 SvREFCNT_dec (GvAV (PL_defgv));
638 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
639
609 SPAGAIN; 640 SPAGAIN;
610
611 /*PL_curcop = 0;*/
612 SvREFCNT_dec (GvAV (PL_defgv));
613 GvAV (PL_defgv) = ctx->args;
614 641
615 if (ctx->stack) 642 if (ctx->stack)
616 { 643 {
617 ctx->cursp = 0; 644 ctx->cursp = 0;
618 645
619 PUSHMARK(SP); 646 PUSHMARK(SP);
620 PUTBACK; 647 PUTBACK;
621 (void) call_sv (sub_init, G_VOID|G_NOARGS); 648 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
649
650 if (SvTRUE (ERRSV))
651 croak (NULL);
652 else
622 croak ("FATAL: CCTXT coroutine returned!"); 653 croak ("FATAL: CCTXT coroutine returned!");
623 } 654 }
624 else 655 else
625 { 656 {
626 UNOP myop; 657 UNOP myop;
627 658
639 * that doesn't matter, though, since it is only 670 * that doesn't matter, though, since it is only
640 * pp_nextstate and we never return... 671 * pp_nextstate and we never return...
641 * ah yes, and I don't care anyways ;) 672 * ah yes, and I don't care anyways ;)
642 */ 673 */
643 PUTBACK; 674 PUTBACK;
644 PL_op = pp_entersub(); 675 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
645 SPAGAIN; 676 SPAGAIN;
646 677
647 ENTER; /* necessary e.g. for dounwind */ 678 ENTER; /* necessary e.g. for dounwind */
648 } 679 }
649} 680}
653{ 684{
654 /* 685 /*
655 * this is a _very_ stripped down perl interpreter ;) 686 * this is a _very_ stripped down perl interpreter ;)
656 */ 687 */
657 Coro__State ctx = (Coro__State)arg; 688 Coro__State ctx = (Coro__State)arg;
689 JMPENV coro_start_env;
690
691 PL_top_env = &ctx->start_env;
658 692
659 ctx->cursp = 0; 693 ctx->cursp = 0;
660 PL_op = PL_op->op_next; 694 PL_op = PL_op->op_next;
661 CALLRUNOPS(aTHX); 695 CALLRUNOPS(aTHX);
662 /*NORETURN*/ 696
663 abort (); 697 abort ();
664} 698}
665 699
666STATIC void 700STATIC void
667transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 701transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
668{ 702{
669 dSP;
670 dSTACKLEVEL; 703 dSTACKLEVEL;
704 static struct coro *xnext;
671 705
672 if (prev != next) 706 if (prev != next)
673 { 707 {
708 xnext = next;
709
674 if (next->mainstack) 710 if (next->mainstack)
675 { 711 {
676 SAVE (prev, flags); 712 SAVE (prev, flags);
677 LOAD (next); 713 LOAD (next);
678 714
701 continue_coro, (void *)next, 737 continue_coro, (void *)next,
702 next->stack->sptr, labs (next->stack->ssize)); 738 next->stack->sptr, labs (next->stack->ssize));
703 } 739 }
704 740
705 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 741 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
742 /* don't add any code here */
706 } 743 }
707 744
708 } 745 }
709 else if (next->tmps_ix == -2) 746 else if (next->tmps_ix == -2)
710 croak ("tried to transfer to running coroutine"); 747 croak ("tried to transfer to running coroutine");
717 if (!prev->stack) 754 if (!prev->stack)
718 allocate_stack (prev, 0); 755 allocate_stack (prev, 0);
719 756
720 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) 757 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
721 { 758 {
759 PL_top_env = &next->start_env;
760
722 setup_coro (next); 761 setup_coro (next);
723 762
724 prev->stack->refcnt++; 763 prev->stack->refcnt++;
725 prev->stack->usecnt++; 764 prev->stack->usecnt++;
726 next->stack = prev->stack; 765 next->stack = prev->stack;
727 next->gencnt = prev->gencnt; 766 next->gencnt = prev->gencnt;
728 } 767 }
729 else 768 else
730 { 769 {
770 assert (!next->stack);
731 allocate_stack (next, 1); 771 allocate_stack (next, 1);
732 coro_create (&(next->stack->cctx), 772 coro_create (&(next->stack->cctx),
733 setup_coro, (void *)next, 773 setup_coro, (void *)next,
734 next->stack->sptr, labs (next->stack->ssize)); 774 next->stack->sptr, labs (next->stack->ssize));
735 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 775 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
776 /* don't add any code here */
736 } 777 }
737 } 778 }
738 else 779 else
739 setup_coro (next); 780 setup_coro (next);
740 } 781 }
782
783 /*
784 * xnext is now either prev or next, depending on wether
785 * we switched the c stack or not. that's why I use a global
786 * variable, that should become thread-specific at one point.
787 */
788 xnext->cursp = stacklevel;
741 } 789 }
742 790
743 next->cursp = stacklevel; 791 if (coro_mortal)
792 {
793 SvREFCNT_dec (coro_mortal);
794 coro_mortal = 0;
795 }
796}
797
798#define SV_CORO(sv,func) \
799 do { \
800 if (SvROK (sv)) \
801 sv = SvRV (sv); \
802 \
803 if (SvTYPE(sv) == SVt_PVHV) \
804 { \
805 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
806 \
807 if (!he) \
808 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
809 \
810 (sv) = SvRV (HeVAL(he)); \
811 } \
812 \
813 /* must also be changed inside Coro::Cont::yield */ \
814 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \
815 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
816 \
817 } while(0)
818
819#define SvSTATE(sv) (struct coro *)SvIV (sv)
820
821static void
822api_transfer(pTHX_ SV *prev, SV *next, int flags)
823{
824 SV_CORO (prev, "Coro::transfer");
825 SV_CORO (next, "Coro::transfer");
826
827 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags);
828}
829
830/** Coro ********************************************************************/
831
832#define PRIO_MAX 3
833#define PRIO_HIGH 1
834#define PRIO_NORMAL 0
835#define PRIO_LOW -1
836#define PRIO_IDLE -3
837#define PRIO_MIN -4
838
839/* for Coro.pm */
840static GV *coro_current, *coro_idle;
841static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
842static int coro_nready;
843
844static void
845coro_enq (SV *sv)
846{
847 if (SvTYPE (sv) == SVt_PVHV)
848 {
849 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
850 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
851
852 prio = prio > PRIO_MAX ? PRIO_MAX
853 : prio < PRIO_MIN ? PRIO_MIN
854 : prio;
855
856 av_push (coro_ready [prio - PRIO_MIN], sv);
857 coro_nready++;
858
859 return;
860 }
861
862 croak ("Coro::ready tried to enqueue something that is not a coroutine");
863}
864
865static SV *
866coro_deq (int min_prio)
867{
868 int prio = PRIO_MAX - PRIO_MIN;
869
870 min_prio -= PRIO_MIN;
871 if (min_prio < 0)
872 min_prio = 0;
873
874 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
875 if (av_len (coro_ready[prio]) >= 0)
876 {
877 coro_nready--;
878 return av_shift (coro_ready[prio]);
879 }
880
881 return 0;
882}
883
884static void
885api_ready (SV *coro)
886{
887 if (SvROK (coro))
888 coro = SvRV (coro);
889
890 coro_enq (SvREFCNT_inc (coro));
891}
892
893static void
894api_schedule (void)
895{
896 SV *prev, *next;
897
898 prev = SvRV (GvSV (coro_current));
899 next = coro_deq (PRIO_MIN);
900
901 if (!next)
902 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
903
904 /* free this only after the transfer */
905 coro_mortal = prev;
906 SV_CORO (prev, "Coro::schedule");
907
908 SvRV (GvSV (coro_current)) = next;
909
910 SV_CORO (next, "Coro::schedule");
911
912 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
913 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
914}
915
916static void
917api_cede (void)
918{
919 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
920
921 api_schedule ();
744} 922}
745 923
746MODULE = Coro::State PACKAGE = Coro::State 924MODULE = Coro::State PACKAGE = Coro::State
747 925
748PROTOTYPES: ENABLE 926PROTOTYPES: ENABLE
760 938
761 if (!padlist_cache) 939 if (!padlist_cache)
762 padlist_cache = newHV (); 940 padlist_cache = newHV ();
763 941
764 main_mainstack = PL_mainstack; 942 main_mainstack = PL_mainstack;
943
944 coroapi.ver = CORO_API_VERSION;
945 coroapi.transfer = api_transfer;
765} 946}
766 947
767Coro::State 948Coro::State
768_newprocess(args) 949_newprocess(args)
769 SV * args 950 SV * args
772 Coro__State coro; 953 Coro__State coro;
773 954
774 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 955 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
775 croak ("Coro::State::_newprocess expects an arrayref"); 956 croak ("Coro::State::_newprocess expects an arrayref");
776 957
777 New (0, coro, 1, struct coro); 958 Newz (0, coro, 1, struct coro);
778 959
779 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 960 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
780 coro->mainstack = 0; /* actual work is done inside transfer */ 961 coro->mainstack = 0; /* actual work is done inside transfer */
781 coro->stack = 0; 962 coro->stack = 0;
782 963
964 /* same as JMPENV_BOOTSTRAP */
965 /* we might be able to recycle start_env, but safe is safe */
966 //Zero(&coro->start_env, 1, JMPENV);
967 coro->start_env.je_ret = -1;
968 coro->start_env.je_mustcatch = TRUE;
969
783 RETVAL = coro; 970 RETVAL = coro;
784 OUTPUT: 971 OUTPUT:
785 RETVAL 972 RETVAL
786 973
787void 974void
788transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) 975transfer(prev, next, flags)
789 Coro::State_or_hashref prev 976 SV *prev
790 Coro::State_or_hashref next 977 SV *next
791 int flags 978 int flags
792 PROTOTYPE: @ 979 PROTOTYPE: @
793 CODE: 980 CODE:
981 PUTBACK;
982 SV_CORO (next, "Coro::transfer");
983 SV_CORO (prev, "Coro::transfer");
794 transfer (aTHX_ prev, next, flags); 984 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
985 SPAGAIN;
795 986
796void 987void
797DESTROY(coro) 988DESTROY(coro)
798 Coro::State coro 989 Coro::State coro
799 CODE: 990 CODE:
800 991
801 if (coro->mainstack && coro->mainstack != main_mainstack) 992 if (coro->mainstack && coro->mainstack != main_mainstack)
802 { 993 {
803 struct coro temp; 994 struct coro temp;
804 995
996 PUTBACK;
805 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 997 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
806 LOAD(aTHX_ coro); 998 LOAD(aTHX_ coro);
999 SPAGAIN;
807 1000
808 destroy_stacks (aTHX); 1001 destroy_stacks (aTHX);
809 1002
810 LOAD((&temp)); /* this will get rid of defsv etc.. */ 1003 LOAD((&temp)); /* this will get rid of defsv etc.. */
1004 SPAGAIN;
811 1005
812 coro->mainstack = 0; 1006 coro->mainstack = 0;
813 } 1007 }
814 1008
815 deallocate_stack (coro); 1009 deallocate_stack (coro);
816 1010 SvREFCNT_dec (coro->args);
817 Safefree (coro); 1011 Safefree (coro);
818 1012
819void 1013void
820flush() 1014flush()
821 CODE: 1015 CODE:
822#ifdef MAY_FLUSH 1016#ifdef MAY_FLUSH
823 flush_padlist_cache (); 1017 flush_padlist_cache ();
824#endif 1018#endif
825 1019
1020void
1021_exit(code)
1022 int code
1023 PROTOTYPE: $
1024 CODE:
1025#if defined(__GLIBC__) || _POSIX_C_SOURCE
1026 _exit (code);
1027#else
1028 signal (SIGTERM, SIG_DFL);
1029 raise (SIGTERM);
1030 exit (code);
1031#endif
1032
826MODULE = Coro::State PACKAGE = Coro::Cont 1033MODULE = Coro::State PACKAGE = Coro::Cont
827 1034
828# this is slightly dirty 1035# this is slightly dirty (should expose a c-level api)
829 1036
830void 1037void
831yield(...) 1038yield(...)
832 PROTOTYPE: @ 1039 PROTOTYPE: @
833 CODE: 1040 CODE:
835 SV *sv; 1042 SV *sv;
836 AV *defav = GvAV (PL_defgv); 1043 AV *defav = GvAV (PL_defgv);
837 struct coro *prev, *next; 1044 struct coro *prev, *next;
838 1045
839 if (!returnstk) 1046 if (!returnstk)
840 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1047 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
841 1048
842 /* set up @_ -- ugly */ 1049 /* set up @_ -- ugly */
843 av_clear (defav); 1050 av_clear (defav);
844 av_fill (defav, items - 1); 1051 av_fill (defav, items - 1);
845 while (items--) 1052 while (items--)
851 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1058 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
852 SvREFCNT_dec (sv); 1059 SvREFCNT_dec (sv);
853 1060
854 transfer(aTHX_ prev, next, 0); 1061 transfer(aTHX_ prev, next, 0);
855 1062
1063MODULE = Coro::State PACKAGE = Coro
1064
1065# this is slightly dirty (should expose a c-level api)
1066
1067BOOT:
1068{
1069 int i;
1070 HV *stash = gv_stashpv ("Coro", TRUE);
1071
1072 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
1073 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1074 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1075 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
1076 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1077 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
1078
1079 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1080 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1081
1082 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1083 coro_ready[i] = newAV ();
1084
1085 {
1086 SV *sv = perl_get_sv("Coro::API", 1);
1087
1088 coroapi.schedule = api_schedule;
1089 coroapi.cede = api_cede;
1090 coroapi.ready = api_ready;
1091 coroapi.nready = &coro_nready;
1092 coroapi.current = coro_current;
1093
1094 GCoroAPI = &coroapi;
1095 sv_setiv(sv, (IV)&coroapi);
1096 SvREADONLY_on(sv);
1097 }
1098}
1099
1100void
1101ready(self)
1102 SV * self
1103 PROTOTYPE: $
1104 CODE:
1105 api_ready (self);
1106
1107int
1108nready(...)
1109 PROTOTYPE:
1110 CODE:
1111 RETVAL = coro_nready;
1112 OUTPUT:
1113 RETVAL
1114
1115void
1116schedule(...)
1117 PROTOTYPE:
1118 CODE:
1119 api_schedule ();
1120
1121void
1122cede(...)
1123 PROTOTYPE:
1124 CODE:
1125 api_cede ();
1126

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines