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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines