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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines