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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines