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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines