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.14 by root, Mon Jul 23 23:48:05 2001 UTC vs.
Revision 1.26 by root, Fri Aug 17 01:45:39 2001 UTC

… …
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_ANON
13# ifdef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS
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 */
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 delcare 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;
48
24struct coro { 49struct coro {
25 /* the optional C context */ 50 /* the optional C context */
26 coro_context cctx; 51 coro_stack *stack;
27 void *sptr; 52 void *cursp;
28 long ssize; 53 int gencnt;
29 54
30 /* optionally saved, might be zero */ 55 /* optionally saved, might be zero */
31 AV *defav; 56 AV *defav;
32 SV *defsv; 57 SV *defsv;
33 SV *errsv; 58 SV *errsv;
34 59
35 /* saved global state not related to stacks */ 60 /* saved global state not related to stacks */
36 U8 dowarn; 61 U8 dowarn;
62 I32 in_eval;
37 63
38 /* the stacks and related info (callchain etc..) */ 64 /* the stacks and related info (callchain etc..) */
39 PERL_SI *curstackinfo; 65 PERL_SI *curstackinfo;
40 AV *curstack; 66 AV *curstack;
41 AV *mainstack; 67 AV *mainstack;
… …
59 I32 savestack_max; 85 I32 savestack_max;
60 OP **retstack; 86 OP **retstack;
61 I32 retstack_ix; 87 I32 retstack_ix;
62 I32 retstack_max; 88 I32 retstack_max;
63 COP *curcop; 89 COP *curcop;
64 JMPENV start_env;
65 JMPENV *top_env; 90 JMPENV *top_env;
66 91
67 /* data associated with this coroutine (initial args) */ 92 /* data associated with this coroutine (initial args) */
68 AV *args; 93 AV *args;
69}; 94};
… …
254 279
255static void 280static void
256load_state(pTHX_ Coro__State c) 281load_state(pTHX_ Coro__State c)
257{ 282{
258 PL_dowarn = c->dowarn; 283 PL_dowarn = c->dowarn;
284 PL_in_eval = c->in_eval;
259 285
260 PL_curstackinfo = c->curstackinfo; 286 PL_curstackinfo = c->curstackinfo;
261 PL_curstack = c->curstack; 287 PL_curstack = c->curstack;
262 PL_mainstack = c->mainstack; 288 PL_mainstack = c->mainstack;
263 PL_stack_sp = c->stack_sp; 289 PL_stack_sp = c->stack_sp;
… …
280 PL_savestack_max = c->savestack_max; 306 PL_savestack_max = c->savestack_max;
281 PL_retstack = c->retstack; 307 PL_retstack = c->retstack;
282 PL_retstack_ix = c->retstack_ix; 308 PL_retstack_ix = c->retstack_ix;
283 PL_retstack_max = c->retstack_max; 309 PL_retstack_max = c->retstack_max;
284 PL_curcop = c->curcop; 310 PL_curcop = c->curcop;
285 PL_start_env = c->start_env;
286 PL_top_env = c->top_env; 311 PL_top_env = c->top_env;
287 312
288 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 313 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
289 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 314 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
290 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 315 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
… …
389 /* but if it's missing the defav contents magically get replaced sometimes */ 414 /* but if it's missing the defav contents magically get replaced sometimes */
390 if (c->defav) 415 if (c->defav)
391 av_reify (c->defav); 416 av_reify (c->defav);
392 417
393 c->dowarn = PL_dowarn; 418 c->dowarn = PL_dowarn;
419 c->in_eval = PL_in_eval;
394 420
395 c->curstackinfo = PL_curstackinfo; 421 c->curstackinfo = PL_curstackinfo;
396 c->curstack = PL_curstack; 422 c->curstack = PL_curstack;
397 c->mainstack = PL_mainstack; 423 c->mainstack = PL_mainstack;
398 c->stack_sp = PL_stack_sp; 424 c->stack_sp = PL_stack_sp;
… …
415 c->savestack_max = PL_savestack_max; 441 c->savestack_max = PL_savestack_max;
416 c->retstack = PL_retstack; 442 c->retstack = PL_retstack;
417 c->retstack_ix = PL_retstack_ix; 443 c->retstack_ix = PL_retstack_ix;
418 c->retstack_max = PL_retstack_max; 444 c->retstack_max = PL_retstack_max;
419 c->curcop = PL_curcop; 445 c->curcop = PL_curcop;
420 c->start_env = PL_start_env;
421 c->top_env = PL_top_env; 446 c->top_env = PL_top_env;
422} 447}
423 448
424/* 449/*
425 * allocate various perl stacks. This is an exact copy 450 * allocate various perl stacks. This is an exact copy
… …
437 462
438 PL_stack_base = AvARRAY(PL_curstack); 463 PL_stack_base = AvARRAY(PL_curstack);
439 PL_stack_sp = PL_stack_base; 464 PL_stack_sp = PL_stack_base;
440 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 465 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
441 466
442 New(50,PL_tmps_stack,64,SV*); 467 New(50,PL_tmps_stack,96,SV*);
443 PL_tmps_floor = -1; 468 PL_tmps_floor = -1;
444 PL_tmps_ix = -1; 469 PL_tmps_ix = -1;
445 PL_tmps_max = 64; 470 PL_tmps_max = 96;
446 471
447 New(54,PL_markstack,12,I32); 472 New(54,PL_markstack,16,I32);
448 PL_markstack_ptr = PL_markstack; 473 PL_markstack_ptr = PL_markstack;
449 PL_markstack_max = PL_markstack + 12; 474 PL_markstack_max = PL_markstack + 16;
450 475
451 SET_MARK_OFFSET; 476 SET_MARK_OFFSET;
452 477
453 New(54,PL_scopestack,12,I32); 478 New(54,PL_scopestack,16,I32);
454 PL_scopestack_ix = 0; 479 PL_scopestack_ix = 0;
455 PL_scopestack_max = 12; 480 PL_scopestack_max = 16;
456 481
457 New(54,PL_savestack,64,ANY); 482 New(54,PL_savestack,96,ANY);
458 PL_savestack_ix = 0; 483 PL_savestack_ix = 0;
459 PL_savestack_max = 64; 484 PL_savestack_max = 96;
460 485
461 New(54,PL_retstack,8,OP*); 486 New(54,PL_retstack,8,OP*);
462 PL_retstack_ix = 0; 487 PL_retstack_ix = 0;
463 PL_retstack_max = 8; 488 PL_retstack_max = 8;
464} 489}
… …
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 (PL_main_cv != Nullcv) /* don't during destruction. hack? */
494 dounwind(-1); 520 dounwind(-1);
495 521
496 SvREFCNT_dec(PL_curstackinfo->si_stack); 522 SvREFCNT_dec(PL_curstackinfo->si_stack);
497 Safefree(PL_curstackinfo->si_cxstack); 523 Safefree(PL_curstackinfo->si_cxstack);
498 Safefree(PL_curstackinfo); 524 Safefree(PL_curstackinfo);
499 PL_curstackinfo = p; 525 PL_curstackinfo = p;
… …
505 Safefree(PL_savestack); 531 Safefree(PL_savestack);
506 Safefree(PL_retstack); 532 Safefree(PL_retstack);
507} 533}
508 534
509static void 535static void
510allocate_stack (Coro__State ctx) 536allocate_stack (Coro__State ctx, int alloc)
511{ 537{
538 coro_stack *stack;
539
540 New (0, stack, 1, coro_stack);
541
542 stack->refcnt = 1;
543 stack->usecnt = 1;
544 stack->gencnt = ctx->gencnt = 0;
545 if (alloc)
546 {
512#ifdef HAVE_MMAP 547#ifdef HAVE_MMAP
513 ctx->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-use */ 548 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); 549 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
515 if (ctx->sptr == (void *)-1) 550 if (stack->sptr == (void *)-1)
516#endif 551#endif
517 { 552 {
518 /*FIXME*//*D*//* reasonable stack size! */ 553 /*FIXME*//*D*//* reasonable stack size! */
519 ctx->ssize = 4096 * sizeof (long); 554 stack->ssize = -4096 * sizeof (long);
520 New (0, ctx->sptr, 4096, long); 555 New (0, stack->sptr, 4096, long);
556 }
521 } 557 }
558 else
559 stack->sptr = 0;
560
561 ctx->stack = stack;
522} 562}
523 563
524static void 564static void
525deallocate_stack (Coro__State ctx) 565deallocate_stack (Coro__State ctx)
526{ 566{
567 coro_stack *stack = ctx->stack;
568
569 ctx->stack = 0;
570
571 if (stack)
572 {
573 if (!--stack->refcnt)
574 {
527#ifdef HAVE_MMAP 575#ifdef HAVE_MMAP
528 munmap (ctx->sptr, ctx->ssize); 576 if (stack->ssize > 0 && stack->sptr)
577 munmap (stack->sptr, stack->ssize);
578 else
529#else 579#else
530 Safefree (ctx->sptr); 580 Safefree (stack->sptr);
531#endif 581#endif
582 Safefree (stack);
583 }
584 else if (ctx->gencnt == stack->gencnt)
585 --stack->usecnt;
586 }
532} 587}
533 588
534/* might go away together with optional SAVE_CCTXT */
535static void 589static void
536setup_coro (void *arg) 590setup_coro (void *arg)
537{ 591{
538 /* 592 /*
539 * emulate part of the perl startup here. 593 * emulate part of the perl startup here.
… …
541 dSP; 595 dSP;
542 Coro__State ctx = (Coro__State)arg; 596 Coro__State ctx = (Coro__State)arg;
543 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 597 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
544 598
545 coro_init_stacks (aTHX); 599 coro_init_stacks (aTHX);
546 JMPENV_BOOTSTRAP;
547 SPAGAIN;
548
549 /*PL_curcop = 0;*/ 600 /*PL_curcop = 0;*/
601 /*PL_in_eval = PL_in_eval;*/ /* inherit */
550 SvREFCNT_dec (GvAV (PL_defgv)); 602 SvREFCNT_dec (GvAV (PL_defgv));
551 GvAV (PL_defgv) = ctx->args; 603 GvAV (PL_defgv) = ctx->args;
552 604
605 SPAGAIN;
606
553 if (ctx->sptr) 607 if (ctx->stack)
554 { 608 {
609 ctx->cursp = 0;
610
555 PUSHMARK(SP); 611 PUSHMARK(SP);
556 PUTBACK; 612 PUTBACK;
557 (void) call_sv (sub_init, G_VOID|G_NOARGS); 613 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
614
615 if (SvTRUE (ERRSV))
616 croak (NULL);
617 else
558 croak ("FATAL: CCTXT coroutine returned!"); 618 croak ("FATAL: CCTXT coroutine returned!");
559 } 619 }
560 else 620 else
561 { 621 {
562 UNOP myop; 622 UNOP myop;
563 623
… …
582 642
583 ENTER; /* necessary e.g. for dounwind */ 643 ENTER; /* necessary e.g. for dounwind */
584 } 644 }
585} 645}
586 646
647static void
648continue_coro (void *arg)
649{
650 /*
651 * this is a _very_ stripped down perl interpreter ;)
652 */
653 Coro__State ctx = (Coro__State)arg;
654
655 /*FIXME*//* must set up top_env here */
656 ctx->cursp = 0;
657 PL_op = PL_op->op_next;
658 CALLRUNOPS(aTHX);
659
660 abort ();
661}
662
587STATIC void 663STATIC void
588transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 664transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
589{ 665{
590 dSP; 666 dSP;
667 dSTACKLEVEL;
591 668
592 if (prev != next) 669 if (prev != next)
593 { 670 {
594 /*
595 * this could be done in newprocess which would lead to
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) 671 if (next->mainstack)
601 { 672 {
602 SAVE (prev, flags); 673 SAVE (prev, flags);
603 LOAD (next); 674 LOAD (next);
604 675
605 /* mark this state as in-use */ 676 /* mark this state as in-use */
606 next->mainstack = 0; 677 next->mainstack = 0;
607 next->tmps_ix = -2; 678 next->tmps_ix = -2;
608 679
680 /* stacklevel changed? if yes, grab the stack for us! */
609 if (flags & TRANSFER_SAVE_CCTXT) 681 if (flags & TRANSFER_SAVE_CCTXT)
610 { 682 {
611 if (!next->ssize)
612 croak ("destination coroutine has no CCTXT (%p, %d)", next->sptr, next->ssize);
613
614 if (!prev->ssize) 683 if (!prev->stack)
615 prev->ssize = 1; /* mark cctx as valid ;) */ 684 allocate_stack (prev, 0);
685 else if (prev->cursp != stacklevel
686 && prev->stack->usecnt > 1)
687 {
688 prev->gencnt = ++prev->stack->gencnt;
689 prev->stack->usecnt = 1;
690 }
616 691
692 /* has our stack been invalidated? */
693 if (next->stack && next->stack->gencnt != next->gencnt)
694 {
695 deallocate_stack (next);
696 allocate_stack (next, 1);
697 coro_create (&(next->stack->cctx),
698 continue_coro, (void *)next,
699 next->stack->sptr, labs (next->stack->ssize));
700 }
701
617 coro_transfer (&(prev->cctx), &(next->cctx)); 702 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
618 } 703 }
619 704
620 } 705 }
621 else if (next->tmps_ix == -2) 706 else if (next->tmps_ix == -2)
622 croak ("tried to transfer to running coroutine"); 707 croak ("tried to transfer to running coroutine");
… …
624 { 709 {
625 SAVE (prev, -1); /* first get rid of the old state */ 710 SAVE (prev, -1); /* first get rid of the old state */
626 711
627 if (flags & TRANSFER_SAVE_CCTXT) 712 if (flags & TRANSFER_SAVE_CCTXT)
628 { 713 {
629 if (!next->ssize) 714 if (!prev->stack)
715 allocate_stack (prev, 0);
716
717 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
630 { 718 {
719 setup_coro (next);
720
721 prev->stack->refcnt++;
722 prev->stack->usecnt++;
723 next->stack = prev->stack;
724 next->gencnt = prev->gencnt;
725 }
726 else
727 {
631 allocate_stack (next); 728 allocate_stack (next, 1);
632 coro_create (&(next->cctx), 729 coro_create (&(next->stack->cctx),
633 setup_coro, (void *)next, 730 setup_coro, (void *)next,
634 next->sptr, next->ssize); 731 next->stack->sptr, labs (next->stack->ssize));
732 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
635 } 733 }
636
637 if (!prev->ssize)
638 prev->ssize = 1; /* mark cctx as valid ;) */
639
640 coro_transfer (&(prev->cctx), &(next->cctx));
641 } 734 }
642 else 735 else
643 setup_coro (next); 736 setup_coro (next);
644 } 737 }
645 } 738 }
739
740 next->cursp = stacklevel;
741}
742
743static struct coro *
744sv_to_coro (SV *arg, const char *funcname, const char *varname)
745{
746 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
747 {
748 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
749
750 if (!he)
751 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
752
753 arg = HeVAL(he);
754 }
755
756 /* must also be changed inside Coro::Cont::yield */
757 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
758 return (struct coro *) SvIV((SV*)SvRV(arg));
759 else
760 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
761}
762
763static void
764api_transfer(pTHX_ SV *prev, SV *next, int flags)
765{
766 transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"),
767 sv_to_coro (next, "Coro::transfer", "next"),
768 flags);
769}
770
771/** Coro ********************************************************************/
772
773#define PRIO_MAX 3
774#define PRIO_HIGH 1
775#define PRIO_NORMAL 0
776#define PRIO_LOW -1
777#define PRIO_IDLE -3
778#define PRIO_MIN -4
779
780/* for Coro.pm */
781static GV *coro_current, *coro_idle;
782static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
783static int coro_nready;
784
785static void
786coro_enq (SV *sv)
787{
788 if (SvROK (sv))
789 {
790 SV *hv = SvRV (sv);
791 if (SvTYPE (hv) == SVt_PVHV)
792 {
793 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
794 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
795
796 prio = prio > PRIO_MAX ? PRIO_MAX
797 : prio < PRIO_MIN ? PRIO_MIN
798 : prio;
799
800 av_push (coro_ready [prio - PRIO_MIN], sv);
801 coro_nready++;
802
803 return;
804 }
805 }
806
807 croak ("Coro::ready tried to enqueue something that is not a coroutine");
808}
809
810static SV *
811coro_deq (int min_prio)
812{
813 int prio = PRIO_MAX - PRIO_MIN;
814
815 min_prio -= PRIO_MIN;
816 if (min_prio < 0)
817 min_prio = 0;
818
819 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
820 if (av_len (coro_ready[prio]) >= 0)
821 {
822 coro_nready--;
823 return av_shift (coro_ready[prio]);
824 }
825
826 return 0;
827}
828
829static void
830api_ready (SV *coro)
831{
832 coro_enq (SvREFCNT_inc (coro));
833}
834
835static void
836api_schedule (int cede)
837{
838 SV *prev, *next;
839
840 prev = GvSV (coro_current);
841
842 if (cede)
843 coro_enq (SvREFCNT_inc (prev));
844
845 next = coro_deq (PRIO_MIN);
846
847 if (!next)
848 next = SvREFCNT_inc (GvSV (coro_idle));
849
850 GvSV (coro_current) = SvREFCNT_inc (next);
851 transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"),
852 sv_to_coro (next, "Coro::schedule", "next coroutine"),
853 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
854 SvREFCNT_dec (next);
855 SvREFCNT_dec (prev);
646} 856}
647 857
648MODULE = Coro::State PACKAGE = Coro::State 858MODULE = Coro::State PACKAGE = Coro::State
649 859
650PROTOTYPES: ENABLE 860PROTOTYPES: ENABLE
… …
662 872
663 if (!padlist_cache) 873 if (!padlist_cache)
664 padlist_cache = newHV (); 874 padlist_cache = newHV ();
665 875
666 main_mainstack = PL_mainstack; 876 main_mainstack = PL_mainstack;
877
878 coroapi.ver = CORO_API_VERSION;
879 coroapi.transfer = api_transfer;
667} 880}
668 881
669Coro::State 882Coro::State
670_newprocess(args) 883_newprocess(args)
671 SV * args 884 SV * args
… …
678 891
679 New (0, coro, 1, struct coro); 892 New (0, coro, 1, struct coro);
680 893
681 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 894 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
682 coro->mainstack = 0; /* actual work is done inside transfer */ 895 coro->mainstack = 0; /* actual work is done inside transfer */
683 coro->sptr = 0; 896 coro->stack = 0;
684 coro->ssize = 0;
685 897
686 RETVAL = coro; 898 RETVAL = coro;
687 OUTPUT: 899 OUTPUT:
688 RETVAL 900 RETVAL
689 901
690void 902void
691transfer(prev, next, flags = TRANSFER_SAVE_ALL) 903transfer(prev, next, flags)
692 Coro::State_or_hashref prev 904 Coro::State_or_hashref prev
693 Coro::State_or_hashref next 905 Coro::State_or_hashref next
694 int flags 906 int flags
695 PROTOTYPE: @ 907 PROTOTYPE: @
696 CODE: 908 CODE:
909 PUTBACK;
697 transfer (aTHX_ prev, next, flags); 910 transfer (aTHX_ prev, next, flags);
911 SPAGAIN;
698 912
699void 913void
700DESTROY(coro) 914DESTROY(coro)
701 Coro::State coro 915 Coro::State coro
702 CODE: 916 CODE:
… …
713 LOAD((&temp)); /* this will get rid of defsv etc.. */ 927 LOAD((&temp)); /* this will get rid of defsv etc.. */
714 928
715 coro->mainstack = 0; 929 coro->mainstack = 0;
716 } 930 }
717 931
718 if (coro->sptr)
719 {
720 deallocate_stack (coro); 932 deallocate_stack (coro);
721 coro->sptr = 0;
722 }
723 933
724 Safefree (coro); 934 Safefree (coro);
725 935
726void 936void
727flush() 937flush()
728 CODE: 938 CODE:
729#ifdef MAY_FLUSH 939#ifdef MAY_FLUSH
730 flush_padlist_cache (); 940 flush_padlist_cache ();
731#endif 941#endif
732 942
943void
944_exit(code)
945 int code
946 PROTOTYPE: $
947 CODE:
948#if defined(__GLIBC__) || _POSIX_C_SOURCE
949 _exit (code);
950#else
951 signal (SIGTERM, SIG_DFL);
952 raise (SIGTERM);
953 exit (code);
954#endif
955
733MODULE = Coro::State PACKAGE = Coro::Cont 956MODULE = Coro::State PACKAGE = Coro::Cont
734 957
735# this is slightly dirty 958# this is slightly dirty (should expose a c-level api)
736 959
737void 960void
738yield(...) 961yield(...)
739 PROTOTYPE: @ 962 PROTOTYPE: @
740 CODE: 963 CODE:
… …
758 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 981 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
759 SvREFCNT_dec (sv); 982 SvREFCNT_dec (sv);
760 983
761 transfer(aTHX_ prev, next, 0); 984 transfer(aTHX_ prev, next, 0);
762 985
986MODULE = Coro::State PACKAGE = Coro
987
988# this is slightly dirty (should expose a c-level api)
989
990BOOT:
991{
992 int i;
993 HV *stash = gv_stashpv ("Coro", TRUE);
994
995 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
996 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
997 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
998 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
999 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1000 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
1001
1002 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1003 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1004
1005 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1006 coro_ready[i] = newAV ();
1007
1008 {
1009 SV *sv = perl_get_sv("Coro::API", 1);
1010
1011 coroapi.schedule = api_schedule;
1012 coroapi.ready = api_ready;
1013 coroapi.nready = &coro_nready;
1014 coroapi.current = coro_current;
1015
1016 GCoroAPI = &coroapi;
1017 sv_setiv(sv, (IV)&coroapi);
1018 SvREADONLY_on(sv);
1019 }
1020}
1021
1022void
1023ready(self)
1024 SV * self
1025 CODE:
1026 api_ready (self);
1027
1028int
1029nready(...)
1030 PROTOTYPE:
1031 CODE:
1032 RETVAL = coro_nready;
1033 OUTPUT:
1034 RETVAL
1035
1036void
1037schedule(...)
1038 PROTOTYPE:
1039 ALIAS:
1040 cede = 1
1041 CODE:
1042 api_schedule (ix);
1043

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines