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.19 by root, Sun Jul 29 01:11:41 2001 UTC vs.
Revision 1.52 by pcg, Sun Nov 30 22:49:25 2003 UTC

1#include "EXTERN.h" 1#include "EXTERN.h"
2#include "perl.h" 2#include "perl.h"
3#include "XSUB.h" 3#include "XSUB.h"
4 4
5#include "patchlevel.h"
6
7#if PATCHLEVEL < 6
8# ifndef PL_ppaddr
9# define PL_ppaddr ppaddr
10# endif
11# ifndef call_sv
12# define call_sv perl_call_sv
13# endif
14# ifndef get_sv
15# define get_sv perl_get_sv
16# endif
17# ifndef get_cv
18# define get_cv perl_get_cv
19# endif
20# ifndef IS_PADGV
21# define IS_PADGV(v) 0
22# endif
23# ifndef IS_PADCONST
24# define IS_PADCONST(v) 0
25# endif
26#endif
27
5#include "libcoro/coro.c" 28#include "libcoro/coro.c"
29
30#include <signal.h>
6 31
7#ifdef HAVE_MMAP 32#ifdef HAVE_MMAP
8# include <unistd.h> 33# include <unistd.h>
9# include <sys/mman.h> 34# include <sys/mman.h>
10# ifndef MAP_ANON
11# ifdef MAP_ANONYMOUS 35# ifndef MAP_ANONYMOUS
12# define MAP_ANON MAP_ANONYMOUS 36# ifdef MAP_ANON
37# define MAP_ANONYMOUS MAP_ANON
13# else 38# else
14# undef HAVE_MMAP 39# undef HAVE_MMAP
15# endif 40# endif
16# endif 41# endif
17#endif 42#endif
18 43
19#define MAY_FLUSH /* increases codesize */
20
21/* perl-related */
22#define TRANSFER_SAVE_DEFAV 0x00000001
23#define TRANSFER_SAVE_DEFSV 0x00000002
24#define TRANSFER_SAVE_ERRSV 0x00000004
25/* c-related */
26#define TRANSFER_SAVE_CCTXT 0x00000008
27#ifdef CORO_LAZY_STACK
28# define TRANSFER_LAZY_STACK 0x00000010
29#else
30# define TRANSFER_LAZY_STACK 0x00000000
31#endif
32
33#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \
34 |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT)
35
36#define SUB_INIT "Coro::State::initialize" 44#define SUB_INIT "Coro::State::initialize"
37#define UCORO_STATE "_coro_state" 45#define UCORO_STATE "_coro_state"
38 46
39/* The next macro should delcare a variable stacklevel that contains and approximation 47/* The next macro should declare a variable stacklevel that contains and approximation
40 * to the current C stack pointer. It's property is that it changes with each call 48 * to the current C stack pointer. Its property is that it changes with each call
41 * and should be unique. */ 49 * and should be unique. */
42#define dSTACKLEVEL void *stacklevel = &stacklevel 50#define dSTACKLEVEL void *stacklevel = &stacklevel
43 51
52#define IN_DESTRUCT (PL_main_cv == Nullcv)
53
44#define labs(l) ((l) >= 0 ? (l) : -(l)) 54#define labs(l) ((l) >= 0 ? (l) : -(l))
55
56#include "CoroAPI.h"
57
58static struct CoroAPI coroapi;
45 59
46/* this is actually not only the c stack but also c registers etc... */ 60/* this is actually not only the c stack but also c registers etc... */
47typedef struct { 61typedef struct {
48 int refcnt; /* pointer reference counter */ 62 int refcnt; /* pointer reference counter */
49 int usecnt; /* shared by how many coroutines */ 63 int usecnt; /* shared by how many coroutines */
54 void *sptr; 68 void *sptr;
55 long ssize; /* positive == mmap, otherwise malloc */ 69 long ssize; /* positive == mmap, otherwise malloc */
56} coro_stack; 70} coro_stack;
57 71
58struct coro { 72struct coro {
73 /* the top-level JMPENV for each coroutine, needed to catch dies. */
74 JMPENV start_env;
75
59 /* the optional C context */ 76 /* the optional C context */
60 coro_stack *stack; 77 coro_stack *stack;
61 void *cursp; 78 void *cursp;
62 int gencnt; 79 int gencnt;
63 80
75 AV *curstack; 92 AV *curstack;
76 AV *mainstack; 93 AV *mainstack;
77 SV **stack_sp; 94 SV **stack_sp;
78 OP *op; 95 OP *op;
79 SV **curpad; 96 SV **curpad;
97 AV *comppad;
80 SV **stack_base; 98 SV **stack_base;
81 SV **stack_max; 99 SV **stack_max;
82 SV **tmps_stack; 100 SV **tmps_stack;
83 I32 tmps_floor; 101 I32 tmps_floor;
84 I32 tmps_ix; 102 I32 tmps_ix;
108static AV *main_mainstack; /* used to differentiate between $main and others */ 126static AV *main_mainstack; /* used to differentiate between $main and others */
109static HV *coro_state_stash; 127static HV *coro_state_stash;
110static SV *ucoro_state_sv; 128static SV *ucoro_state_sv;
111static U32 ucoro_state_hash; 129static U32 ucoro_state_hash;
112static HV *padlist_cache; 130static HV *padlist_cache;
131static SV *coro_mortal; /* will be freed after next transfer */
113 132
114/* mostly copied from op.c:cv_clone2 */ 133/* mostly copied from op.c:cv_clone2 */
115STATIC AV * 134STATIC AV *
116clone_padlist (AV *protopadlist) 135clone_padlist (AV *protopadlist)
117{ 136{
163 sv = (SV *) newAV (); 182 sv = (SV *) newAV ();
164 else if (*name == '%') 183 else if (*name == '%')
165 sv = (SV *) newHV (); 184 sv = (SV *) newHV ();
166 else 185 else
167 sv = NEWSV (0, 0); 186 sv = NEWSV (0, 0);
187#ifdef SvPADBUSY
168 if (!SvPADBUSY (sv)) 188 if (!SvPADBUSY (sv))
189#endif
169 SvPADMY_on (sv); 190 SvPADMY_on (sv);
170 npad[ix] = sv; 191 npad[ix] = sv;
171 } 192 }
172 } 193 }
173 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 194 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
203#endif 224#endif
204 225
205 return newpadlist; 226 return newpadlist;
206} 227}
207 228
208#ifdef MAY_FLUSH 229STATIC void
209STATIC AV *
210free_padlist (AV *padlist) 230free_padlist (AV *padlist)
211{ 231{
212 /* may be during global destruction */ 232 /* may be during global destruction */
213 if (SvREFCNT(padlist)) 233 if (SvREFCNT (padlist))
214 { 234 {
215 I32 i = AvFILLp(padlist); 235 I32 i = AvFILLp (padlist);
216 while (i >= 0) 236 while (i >= 0)
217 { 237 {
218 SV **svp = av_fetch(padlist, i--, FALSE); 238 SV **svp = av_fetch (padlist, i--, FALSE);
219 SV *sv = svp ? *svp : Nullsv;
220 if (sv) 239 if (svp)
240 {
241 SV *sv;
242 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
221 SvREFCNT_dec(sv); 243 SvREFCNT_dec (sv);
244
245 SvREFCNT_dec (*svp);
246 }
222 } 247 }
223 248
224 SvREFCNT_dec((SV*)padlist); 249 SvREFCNT_dec ((SV*)padlist);
225 } 250 }
226} 251}
227#endif 252
253STATIC int
254coro_cv_free (SV *sv, MAGIC *mg)
255{
256 AV *padlist;
257 AV *av = (AV *)mg->mg_obj;
258
259 /* casting is fun. */
260 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
261 free_padlist (padlist);
262}
263
264#define PERL_MAGIC_coro PERL_MAGIC_ext
265
266static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
228 267
229/* the next two functions merely cache the padlists */ 268/* the next two functions merely cache the padlists */
230STATIC void 269STATIC void
231get_padlist (CV *cv) 270get_padlist (CV *cv)
232{ 271{
233 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); 272 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
234 273
235 if (he && AvFILLp ((AV *)*he) >= 0) 274 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
236 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); 275 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
237 else 276 else
238 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 277 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
239} 278}
240 279
241STATIC void 280STATIC void
242put_padlist (CV *cv) 281put_padlist (CV *cv)
243{ 282{
244 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); 283 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
245 284
246 if (SvTYPE (*he) != SVt_PVAV) 285 if (!mg)
247 { 286 {
248 SvREFCNT_dec (*he); 287 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
288 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
289 mg->mg_virtual = &vtbl_coro;
249 *he = (SV *)newAV (); 290 mg->mg_obj = (SV *)newAV ();
250 } 291 }
251 292
252 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 293 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
253} 294}
254
255#ifdef MAY_FLUSH
256STATIC void
257flush_padlist_cache ()
258{
259 HV *hv = padlist_cache;
260 padlist_cache = newHV ();
261
262 if (hv_iterinit (hv))
263 {
264 HE *he;
265 AV *padlist;
266
267 while (!!(he = hv_iternext (hv)))
268 {
269 AV *av = (AV *)HeVAL(he);
270
271 /* casting is fun. */
272 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
273 free_padlist (padlist);
274 }
275 }
276
277 SvREFCNT_dec (hv);
278}
279#endif
280 295
281#define SB do { 296#define SB do {
282#define SE } while (0) 297#define SE } while (0)
283 298
284#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE 299#define LOAD(state) load_state(aTHX_ (state));
285#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE 300#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
286 301
287#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 302#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
288 303
289static void 304static void
290load_state(pTHX_ Coro__State c) 305load_state(pTHX_ Coro__State c)
291{ 306{
292 PL_dowarn = c->dowarn; 307 PL_dowarn = c->dowarn;
296 PL_curstack = c->curstack; 311 PL_curstack = c->curstack;
297 PL_mainstack = c->mainstack; 312 PL_mainstack = c->mainstack;
298 PL_stack_sp = c->stack_sp; 313 PL_stack_sp = c->stack_sp;
299 PL_op = c->op; 314 PL_op = c->op;
300 PL_curpad = c->curpad; 315 PL_curpad = c->curpad;
316 PL_comppad = c->comppad;
301 PL_stack_base = c->stack_base; 317 PL_stack_base = c->stack_base;
302 PL_stack_max = c->stack_max; 318 PL_stack_max = c->stack_max;
303 PL_tmps_stack = c->tmps_stack; 319 PL_tmps_stack = c->tmps_stack;
304 PL_tmps_floor = c->tmps_floor; 320 PL_tmps_floor = c->tmps_floor;
305 PL_tmps_ix = c->tmps_ix; 321 PL_tmps_ix = c->tmps_ix;
364 380
365 PUSHs (Nullsv); 381 PUSHs (Nullsv);
366 /* this loop was inspired by pp_caller */ 382 /* this loop was inspired by pp_caller */
367 for (;;) 383 for (;;)
368 { 384 {
369 do 385 while (cxix >= 0)
370 { 386 {
371 PERL_CONTEXT *cx = &ccstk[cxix--]; 387 PERL_CONTEXT *cx = &ccstk[cxix--];
372 388
373 if (CxTYPE(cx) == CXt_SUB) 389 if (CxTYPE(cx) == CXt_SUB)
374 { 390 {
393 PUSHs ((SV *)cv); 409 PUSHs ((SV *)cv);
394 410
395 get_padlist (cv); /* this is a monster */ 411 get_padlist (cv); /* this is a monster */
396 } 412 }
397 } 413 }
414#ifdef CXt_FORMAT
398 else if (CxTYPE(cx) == CXt_FORMAT) 415 else if (CxTYPE(cx) == CXt_FORMAT)
399 { 416 {
400 /* I never used formats, so how should I know how these are implemented? */ 417 /* I never used formats, so how should I know how these are implemented? */
401 /* my bold guess is as a simple, plain sub... */ 418 /* my bold guess is as a simple, plain sub... */
402 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); 419 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
403 } 420 }
421#endif
404 } 422 }
405 while (cxix >= 0);
406 423
407 if (top_si->si_type == PERLSI_MAIN) 424 if (top_si->si_type == PERLSI_MAIN)
408 break; 425 break;
409 426
410 top_si = top_si->si_prev; 427 top_si = top_si->si_prev;
416 } 433 }
417 434
418 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 435 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
419 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 436 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
420 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 437 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
421
422 /* I have not the slightest idea of why av_reify is necessary */
423 /* but if it's missing the defav contents magically get replaced sometimes */
424 if (c->defav)
425 av_reify (c->defav);
426 438
427 c->dowarn = PL_dowarn; 439 c->dowarn = PL_dowarn;
428 c->in_eval = PL_in_eval; 440 c->in_eval = PL_in_eval;
429 441
430 c->curstackinfo = PL_curstackinfo; 442 c->curstackinfo = PL_curstackinfo;
431 c->curstack = PL_curstack; 443 c->curstack = PL_curstack;
432 c->mainstack = PL_mainstack; 444 c->mainstack = PL_mainstack;
433 c->stack_sp = PL_stack_sp; 445 c->stack_sp = PL_stack_sp;
434 c->op = PL_op; 446 c->op = PL_op;
435 c->curpad = PL_curpad; 447 c->curpad = PL_curpad;
448 c->comppad = PL_comppad;
436 c->stack_base = PL_stack_base; 449 c->stack_base = PL_stack_base;
437 c->stack_max = PL_stack_max; 450 c->stack_max = PL_stack_max;
438 c->tmps_stack = PL_tmps_stack; 451 c->tmps_stack = PL_tmps_stack;
439 c->tmps_floor = PL_tmps_floor; 452 c->tmps_floor = PL_tmps_floor;
440 c->tmps_ix = PL_tmps_ix; 453 c->tmps_ix = PL_tmps_ix;
456} 469}
457 470
458/* 471/*
459 * allocate various perl stacks. This is an exact copy 472 * allocate various perl stacks. This is an exact copy
460 * of perl.c:init_stacks, except that it uses less memory 473 * of perl.c:init_stacks, except that it uses less memory
461 * on the assumption that coroutines do not usually need 474 * on the (sometimes correct) assumption that coroutines do
462 * a lot of stackspace. 475 * not usually need a lot of stackspace.
463 */ 476 */
464STATIC void 477STATIC void
465coro_init_stacks (pTHX) 478coro_init_stacks (pTHX)
466{ 479{
467 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 480 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
480 493
481 New(54,PL_markstack,16,I32); 494 New(54,PL_markstack,16,I32);
482 PL_markstack_ptr = PL_markstack; 495 PL_markstack_ptr = PL_markstack;
483 PL_markstack_max = PL_markstack + 16; 496 PL_markstack_max = PL_markstack + 16;
484 497
498#ifdef SET_MARK_OFFSET
485 SET_MARK_OFFSET; 499 SET_MARK_OFFSET;
500#endif
486 501
487 New(54,PL_scopestack,16,I32); 502 New(54,PL_scopestack,16,I32);
488 PL_scopestack_ix = 0; 503 PL_scopestack_ix = 0;
489 PL_scopestack_max = 16; 504 PL_scopestack_max = 16;
490 505
497 PL_retstack_max = 8; 512 PL_retstack_max = 8;
498} 513}
499 514
500/* 515/*
501 * destroy the stacks, the callchain etc... 516 * destroy the stacks, the callchain etc...
502 * still there is a memleak of 128 bytes...
503 */ 517 */
504STATIC void 518STATIC void
505destroy_stacks(pTHX) 519destroy_stacks(pTHX)
506{ 520{
521 if (!IN_DESTRUCT)
522 {
507 /* is this ugly, I ask? */ 523 /* is this ugly, I ask? */
508 while (PL_scopestack_ix) 524 LEAVE_SCOPE (0);
509 LEAVE;
510 525
511 /* sure it is, but more important: is it correct?? :/ */ 526 /* sure it is, but more important: is it correct?? :/ */
512 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
513 FREETMPS; 527 FREETMPS;
528 }
514 529
515 while (PL_curstackinfo->si_next) 530 while (PL_curstackinfo->si_next)
516 PL_curstackinfo = PL_curstackinfo->si_next; 531 PL_curstackinfo = PL_curstackinfo->si_next;
517 532
518 while (PL_curstackinfo) 533 while (PL_curstackinfo)
523 dSP; 538 dSP;
524 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 539 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
525 PUTBACK; /* possibly superfluous */ 540 PUTBACK; /* possibly superfluous */
526 } 541 }
527 542
543 if (!IN_DESTRUCT)
544 {
528 dounwind(-1); 545 dounwind(-1);
529
530 SvREFCNT_dec(PL_curstackinfo->si_stack); 546 SvREFCNT_dec(PL_curstackinfo->si_stack);
547 }
548
531 Safefree(PL_curstackinfo->si_cxstack); 549 Safefree(PL_curstackinfo->si_cxstack);
532 Safefree(PL_curstackinfo); 550 Safefree(PL_curstackinfo);
533 PL_curstackinfo = p; 551 PL_curstackinfo = p;
534 } 552 }
535 553
550 stack->refcnt = 1; 568 stack->refcnt = 1;
551 stack->usecnt = 1; 569 stack->usecnt = 1;
552 stack->gencnt = ctx->gencnt = 0; 570 stack->gencnt = ctx->gencnt = 0;
553 if (alloc) 571 if (alloc)
554 { 572 {
555#ifdef HAVE_MMAP 573#if HAVE_MMAP
556 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ 574 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
557 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); 575 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
558 if (stack->sptr == (void *)-1) 576 if (stack->sptr == (void *)-1)
559#endif 577#endif
560 { 578 {
561 /*FIXME*//*D*//* reasonable stack size! */ 579 /*FIXME*//*D*//* reasonable stack size! */
562 stack->ssize = -4096 * sizeof (long); 580 stack->ssize = - (16384 * sizeof (long));
563 New (0, stack->sptr, 4096, long); 581 New (0, stack->sptr, 16384, long);
564 } 582 }
565 } 583 }
566 else 584 else
567 stack->sptr = 0; 585 stack->sptr = 0;
568 586
582 { 600 {
583#ifdef HAVE_MMAP 601#ifdef HAVE_MMAP
584 if (stack->ssize > 0 && stack->sptr) 602 if (stack->ssize > 0 && stack->sptr)
585 munmap (stack->sptr, stack->ssize); 603 munmap (stack->sptr, stack->ssize);
586 else 604 else
587#else 605#endif
588 Safefree (stack->sptr); 606 Safefree (stack->sptr);
589#endif 607
590 Safefree (stack); 608 Safefree (stack);
591 } 609 }
592 else if (ctx->gencnt == stack->gencnt) 610 else if (ctx->gencnt == stack->gencnt)
593 --stack->usecnt; 611 --stack->usecnt;
594 } 612 }
600 /* 618 /*
601 * emulate part of the perl startup here. 619 * emulate part of the perl startup here.
602 */ 620 */
603 dSP; 621 dSP;
604 Coro__State ctx = (Coro__State)arg; 622 Coro__State ctx = (Coro__State)arg;
605 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 623 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
606 624
607 coro_init_stacks (aTHX); 625 coro_init_stacks (aTHX);
608 /*PL_curcop = 0;*/ 626 /*PL_curcop = 0;*/
609 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 627 /*PL_in_eval = PL_in_eval;*/ /* inherit */
610 SvREFCNT_dec (GvAV (PL_defgv)); 628 SvREFCNT_dec (GvAV (PL_defgv));
611 GvAV (PL_defgv) = ctx->args; 629 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
612 630
613 SPAGAIN; 631 SPAGAIN;
614 632
615 if (ctx->stack) 633 if (ctx->stack)
616 { 634 {
643 * that doesn't matter, though, since it is only 661 * that doesn't matter, though, since it is only
644 * pp_nextstate and we never return... 662 * pp_nextstate and we never return...
645 * ah yes, and I don't care anyways ;) 663 * ah yes, and I don't care anyways ;)
646 */ 664 */
647 PUTBACK; 665 PUTBACK;
648 PL_op = pp_entersub(); 666 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
649 SPAGAIN; 667 SPAGAIN;
650 668
651 ENTER; /* necessary e.g. for dounwind */ 669 ENTER; /* necessary e.g. for dounwind */
652 } 670 }
653} 671}
657{ 675{
658 /* 676 /*
659 * this is a _very_ stripped down perl interpreter ;) 677 * this is a _very_ stripped down perl interpreter ;)
660 */ 678 */
661 Coro__State ctx = (Coro__State)arg; 679 Coro__State ctx = (Coro__State)arg;
680 JMPENV coro_start_env;
662 681
663 /*FIXME*//* must set up top_env here */ 682 PL_top_env = &ctx->start_env;
683
664 ctx->cursp = 0; 684 ctx->cursp = 0;
665 PL_op = PL_op->op_next; 685 PL_op = PL_op->op_next;
666 CALLRUNOPS(aTHX); 686 CALLRUNOPS(aTHX);
667 687
668 abort (); 688 abort ();
669} 689}
670 690
671STATIC void 691STATIC void
672transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 692transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
673{ 693{
674 dSP;
675 dSTACKLEVEL; 694 dSTACKLEVEL;
695 static struct coro *xnext;
676 696
677 if (prev != next) 697 if (prev != next)
678 { 698 {
699 xnext = next;
700
679 if (next->mainstack) 701 if (next->mainstack)
680 { 702 {
681 SAVE (prev, flags); 703 SAVE (prev, flags);
682 LOAD (next); 704 LOAD (next);
683 705
706 continue_coro, (void *)next, 728 continue_coro, (void *)next,
707 next->stack->sptr, labs (next->stack->ssize)); 729 next->stack->sptr, labs (next->stack->ssize));
708 } 730 }
709 731
710 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 732 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
733 /* don't add any code here */
711 } 734 }
712 735
713 } 736 }
714 else if (next->tmps_ix == -2) 737 else if (next->tmps_ix == -2)
715 croak ("tried to transfer to running coroutine"); 738 croak ("tried to transfer to running coroutine");
722 if (!prev->stack) 745 if (!prev->stack)
723 allocate_stack (prev, 0); 746 allocate_stack (prev, 0);
724 747
725 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) 748 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
726 { 749 {
750 PL_top_env = &next->start_env;
751
727 setup_coro (next); 752 setup_coro (next);
728 753
729 prev->stack->refcnt++; 754 prev->stack->refcnt++;
730 prev->stack->usecnt++; 755 prev->stack->usecnt++;
731 next->stack = prev->stack; 756 next->stack = prev->stack;
732 next->gencnt = prev->gencnt; 757 next->gencnt = prev->gencnt;
733 } 758 }
734 else 759 else
735 { 760 {
761 assert (!next->stack);
736 allocate_stack (next, 1); 762 allocate_stack (next, 1);
737 coro_create (&(next->stack->cctx), 763 coro_create (&(next->stack->cctx),
738 setup_coro, (void *)next, 764 setup_coro, (void *)next,
739 next->stack->sptr, labs (next->stack->ssize)); 765 next->stack->sptr, labs (next->stack->ssize));
740 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 766 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
767 /* don't add any code here */
741 } 768 }
742 } 769 }
743 else 770 else
744 setup_coro (next); 771 setup_coro (next);
745 } 772 }
773
774 /*
775 * xnext is now either prev or next, depending on wether
776 * we switched the c stack or not. that's why I use a global
777 * variable, that should become thread-specific at one point.
778 */
779 xnext->cursp = stacklevel;
746 } 780 }
747 781
748 next->cursp = stacklevel; 782 if (coro_mortal)
783 {
784 SvREFCNT_dec (coro_mortal);
785 coro_mortal = 0;
786 }
787}
788
789#define SV_CORO(sv,func) \
790 do { \
791 if (SvROK (sv)) \
792 sv = SvRV (sv); \
793 \
794 if (SvTYPE(sv) == SVt_PVHV) \
795 { \
796 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
797 \
798 if (!he) \
799 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
800 \
801 (sv) = SvRV (HeVAL(he)); \
802 } \
803 \
804 /* must also be changed inside Coro::Cont::yield */ \
805 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \
806 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
807 \
808 } while(0)
809
810#define SvSTATE(sv) (struct coro *)SvIV (sv)
811
812static void
813api_transfer(pTHX_ SV *prev, SV *next, int flags)
814{
815 SV_CORO (prev, "Coro::transfer");
816 SV_CORO (next, "Coro::transfer");
817
818 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags);
819}
820
821/** Coro ********************************************************************/
822
823#define PRIO_MAX 3
824#define PRIO_HIGH 1
825#define PRIO_NORMAL 0
826#define PRIO_LOW -1
827#define PRIO_IDLE -3
828#define PRIO_MIN -4
829
830/* for Coro.pm */
831static GV *coro_current, *coro_idle;
832static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
833static int coro_nready;
834
835static void
836coro_enq (SV *sv)
837{
838 if (SvTYPE (sv) == SVt_PVHV)
839 {
840 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
841 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
842
843 prio = prio > PRIO_MAX ? PRIO_MAX
844 : prio < PRIO_MIN ? PRIO_MIN
845 : prio;
846
847 av_push (coro_ready [prio - PRIO_MIN], sv);
848 coro_nready++;
849
850 return;
851 }
852
853 croak ("Coro::ready tried to enqueue something that is not a coroutine");
854}
855
856static SV *
857coro_deq (int min_prio)
858{
859 int prio = PRIO_MAX - PRIO_MIN;
860
861 min_prio -= PRIO_MIN;
862 if (min_prio < 0)
863 min_prio = 0;
864
865 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
866 if (av_len (coro_ready[prio]) >= 0)
867 {
868 coro_nready--;
869 return av_shift (coro_ready[prio]);
870 }
871
872 return 0;
873}
874
875static void
876api_ready (SV *coro)
877{
878 if (SvROK (coro))
879 coro = SvRV (coro);
880
881 coro_enq (SvREFCNT_inc (coro));
882}
883
884static void
885api_schedule (void)
886{
887 SV *prev, *next;
888
889 prev = SvRV (GvSV (coro_current));
890 next = coro_deq (PRIO_MIN);
891
892 if (!next)
893 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
894
895 /* free this only after the transfer */
896 coro_mortal = prev;
897 SV_CORO (prev, "Coro::schedule");
898
899 SvRV (GvSV (coro_current)) = next;
900
901 SV_CORO (next, "Coro::schedule");
902
903 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
904 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
905}
906
907static void
908api_cede (void)
909{
910 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
911
912 api_schedule ();
749} 913}
750 914
751MODULE = Coro::State PACKAGE = Coro::State 915MODULE = Coro::State PACKAGE = Coro::State
752 916
753PROTOTYPES: ENABLE 917PROTOTYPES: ENABLE
765 929
766 if (!padlist_cache) 930 if (!padlist_cache)
767 padlist_cache = newHV (); 931 padlist_cache = newHV ();
768 932
769 main_mainstack = PL_mainstack; 933 main_mainstack = PL_mainstack;
934
935 coroapi.ver = CORO_API_VERSION;
936 coroapi.transfer = api_transfer;
770} 937}
771 938
772Coro::State 939Coro::State
773_newprocess(args) 940_newprocess(args)
774 SV * args 941 SV * args
777 Coro__State coro; 944 Coro__State coro;
778 945
779 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 946 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
780 croak ("Coro::State::_newprocess expects an arrayref"); 947 croak ("Coro::State::_newprocess expects an arrayref");
781 948
782 New (0, coro, 1, struct coro); 949 Newz (0, coro, 1, struct coro);
783 950
784 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 951 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
785 coro->mainstack = 0; /* actual work is done inside transfer */ 952 coro->mainstack = 0; /* actual work is done inside transfer */
786 coro->stack = 0; 953 coro->stack = 0;
787 954
955 /* same as JMPENV_BOOTSTRAP */
956 /* we might be able to recycle start_env, but safe is safe */
957 //Zero(&coro->start_env, 1, JMPENV);
958 coro->start_env.je_ret = -1;
959 coro->start_env.je_mustcatch = TRUE;
960
788 RETVAL = coro; 961 RETVAL = coro;
789 OUTPUT: 962 OUTPUT:
790 RETVAL 963 RETVAL
791 964
792void 965void
793transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) 966transfer(prev, next, flags)
794 Coro::State_or_hashref prev 967 SV *prev
795 Coro::State_or_hashref next 968 SV *next
796 int flags 969 int flags
797 PROTOTYPE: @ 970 PROTOTYPE: @
798 CODE: 971 CODE:
972 PUTBACK;
973 SV_CORO (next, "Coro::transfer");
974 SV_CORO (prev, "Coro::transfer");
799 transfer (aTHX_ prev, next, flags); 975 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
976 SPAGAIN;
800 977
801void 978void
802DESTROY(coro) 979DESTROY(coro)
803 Coro::State coro 980 Coro::State coro
804 CODE: 981 CODE:
805 982
806 if (coro->mainstack && coro->mainstack != main_mainstack) 983 if (coro->mainstack && coro->mainstack != main_mainstack)
807 { 984 {
808 struct coro temp; 985 struct coro temp;
809 986
987 PUTBACK;
810 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 988 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
811 LOAD(aTHX_ coro); 989 LOAD(aTHX_ coro);
990 SPAGAIN;
812 991
813 destroy_stacks (aTHX); 992 destroy_stacks (aTHX);
814 993
815 LOAD((&temp)); /* this will get rid of defsv etc.. */ 994 LOAD((&temp)); /* this will get rid of defsv etc.. */
995 SPAGAIN;
816 996
817 coro->mainstack = 0; 997 coro->mainstack = 0;
818 } 998 }
819 999
820 deallocate_stack (coro); 1000 deallocate_stack (coro);
821 1001 SvREFCNT_dec (coro->args);
822 Safefree (coro); 1002 Safefree (coro);
823 1003
824void 1004void
825flush() 1005_exit(code)
1006 int code
1007 PROTOTYPE: $
826 CODE: 1008 CODE:
827#ifdef MAY_FLUSH 1009 _exit (code);
828 flush_padlist_cache ();
829#endif
830 1010
831MODULE = Coro::State PACKAGE = Coro::Cont 1011MODULE = Coro::State PACKAGE = Coro::Cont
832 1012
833# this is slightly dirty 1013# this is slightly dirty (should expose a c-level api)
834 1014
835void 1015void
836yield(...) 1016yield(...)
837 PROTOTYPE: @ 1017 PROTOTYPE: @
838 CODE: 1018 CODE:
840 SV *sv; 1020 SV *sv;
841 AV *defav = GvAV (PL_defgv); 1021 AV *defav = GvAV (PL_defgv);
842 struct coro *prev, *next; 1022 struct coro *prev, *next;
843 1023
844 if (!returnstk) 1024 if (!returnstk)
845 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1025 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
846 1026
847 /* set up @_ -- ugly */ 1027 /* set up @_ -- ugly */
848 av_clear (defav); 1028 av_clear (defav);
849 av_fill (defav, items - 1); 1029 av_fill (defav, items - 1);
850 while (items--) 1030 while (items--)
856 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1036 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
857 SvREFCNT_dec (sv); 1037 SvREFCNT_dec (sv);
858 1038
859 transfer(aTHX_ prev, next, 0); 1039 transfer(aTHX_ prev, next, 0);
860 1040
1041MODULE = Coro::State PACKAGE = Coro
1042
1043# this is slightly dirty (should expose a c-level api)
1044
1045BOOT:
1046{
1047 int i;
1048 HV *stash = gv_stashpv ("Coro", TRUE);
1049
1050 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
1051 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1052 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1053 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
1054 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1055 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
1056
1057 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1058 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1059
1060 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1061 coro_ready[i] = newAV ();
1062
1063 {
1064 SV *sv = perl_get_sv("Coro::API", 1);
1065
1066 coroapi.schedule = api_schedule;
1067 coroapi.cede = api_cede;
1068 coroapi.ready = api_ready;
1069 coroapi.nready = &coro_nready;
1070 coroapi.current = coro_current;
1071
1072 GCoroAPI = &coroapi;
1073 sv_setiv(sv, (IV)&coroapi);
1074 SvREADONLY_on(sv);
1075 }
1076}
1077
1078#if !PERL_MICRO
1079
1080void
1081ready(self)
1082 SV * self
1083 PROTOTYPE: $
1084 CODE:
1085 api_ready (self);
1086
1087#endif
1088
1089int
1090nready(...)
1091 PROTOTYPE:
1092 CODE:
1093 RETVAL = coro_nready;
1094 OUTPUT:
1095 RETVAL
1096
1097void
1098schedule(...)
1099 PROTOTYPE:
1100 CODE:
1101 api_schedule ();
1102
1103void
1104cede(...)
1105 PROTOTYPE:
1106 CODE:
1107 api_cede ();
1108

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines