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.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#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 43
21#define SUB_INIT "Coro::State::initialize" 44#define SUB_INIT "Coro::State::initialize"
22#define UCORO_STATE "_coro_state" 45#define UCORO_STATE "_coro_state"
23 46
47/* The next macro should declare a variable stacklevel that contains and approximation
48 * to the current C stack pointer. Its property is that it changes with each call
49 * and should be unique. */
50#define dSTACKLEVEL void *stacklevel = &stacklevel
51
52#define IN_DESTRUCT (PL_main_cv == Nullcv)
53
54#define labs(l) ((l) >= 0 ? (l) : -(l))
55
56#include "CoroAPI.h"
57
58static struct CoroAPI coroapi;
59
60/* this is actually not only the c stack but also c registers etc... */
61typedef struct {
62 int refcnt; /* pointer reference counter */
63 int usecnt; /* shared by how many coroutines */
64 int gencnt; /* generation counter */
65
66 coro_context cctx;
67
68 void *sptr;
69 long ssize; /* positive == mmap, otherwise malloc */
70} coro_stack;
71
24struct coro { 72struct coro {
73 /* the top-level JMPENV for each coroutine, needed to catch dies. */
74 JMPENV start_env;
75
25 /* the optional C context */ 76 /* the optional C context */
26 coro_context cctx; 77 coro_stack *stack;
27 void *sptr; 78 void *cursp;
28 long ssize; 79 int gencnt;
29 80
30 /* optionally saved, might be zero */ 81 /* optionally saved, might be zero */
31 AV *defav; 82 AV *defav;
32 SV *defsv; 83 SV *defsv;
33 SV *errsv; 84 SV *errsv;
34 85
35 /* saved global state not related to stacks */ 86 /* saved global state not related to stacks */
36 U8 dowarn; 87 U8 dowarn;
88 I32 in_eval;
37 89
38 /* the stacks and related info (callchain etc..) */ 90 /* the stacks and related info (callchain etc..) */
39 PERL_SI *curstackinfo; 91 PERL_SI *curstackinfo;
40 AV *curstack; 92 AV *curstack;
41 AV *mainstack; 93 AV *mainstack;
42 SV **stack_sp; 94 SV **stack_sp;
43 OP *op; 95 OP *op;
44 SV **curpad; 96 SV **curpad;
97 AV *comppad;
45 SV **stack_base; 98 SV **stack_base;
46 SV **stack_max; 99 SV **stack_max;
47 SV **tmps_stack; 100 SV **tmps_stack;
48 I32 tmps_floor; 101 I32 tmps_floor;
49 I32 tmps_ix; 102 I32 tmps_ix;
59 I32 savestack_max; 112 I32 savestack_max;
60 OP **retstack; 113 OP **retstack;
61 I32 retstack_ix; 114 I32 retstack_ix;
62 I32 retstack_max; 115 I32 retstack_max;
63 COP *curcop; 116 COP *curcop;
64 JMPENV start_env;
65 JMPENV *top_env; 117 JMPENV *top_env;
66 118
67 /* data associated with this coroutine (initial args) */ 119 /* data associated with this coroutine (initial args) */
68 AV *args; 120 AV *args;
69}; 121};
74static AV *main_mainstack; /* used to differentiate between $main and others */ 126static AV *main_mainstack; /* used to differentiate between $main and others */
75static HV *coro_state_stash; 127static HV *coro_state_stash;
76static SV *ucoro_state_sv; 128static SV *ucoro_state_sv;
77static U32 ucoro_state_hash; 129static U32 ucoro_state_hash;
78static HV *padlist_cache; 130static HV *padlist_cache;
131static SV *coro_mortal; /* will be freed after next transfer */
79 132
80/* mostly copied from op.c:cv_clone2 */ 133/* mostly copied from op.c:cv_clone2 */
81STATIC AV * 134STATIC AV *
82clone_padlist (AV *protopadlist) 135clone_padlist (AV *protopadlist)
83{ 136{
129 sv = (SV *) newAV (); 182 sv = (SV *) newAV ();
130 else if (*name == '%') 183 else if (*name == '%')
131 sv = (SV *) newHV (); 184 sv = (SV *) newHV ();
132 else 185 else
133 sv = NEWSV (0, 0); 186 sv = NEWSV (0, 0);
187#ifdef SvPADBUSY
134 if (!SvPADBUSY (sv)) 188 if (!SvPADBUSY (sv))
189#endif
135 SvPADMY_on (sv); 190 SvPADMY_on (sv);
136 npad[ix] = sv; 191 npad[ix] = sv;
137 } 192 }
138 } 193 }
139 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 194 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
169#endif 224#endif
170 225
171 return newpadlist; 226 return newpadlist;
172} 227}
173 228
174#ifdef MAY_FLUSH 229STATIC void
175STATIC AV *
176free_padlist (AV *padlist) 230free_padlist (AV *padlist)
177{ 231{
178 /* may be during global destruction */ 232 /* may be during global destruction */
179 if (SvREFCNT(padlist)) 233 if (SvREFCNT (padlist))
180 { 234 {
181 I32 i = AvFILLp(padlist); 235 I32 i = AvFILLp (padlist);
182 while (i >= 0) 236 while (i >= 0)
183 { 237 {
184 SV **svp = av_fetch(padlist, i--, FALSE); 238 SV **svp = av_fetch (padlist, i--, FALSE);
185 SV *sv = svp ? *svp : Nullsv;
186 if (sv) 239 if (svp)
240 {
241 SV *sv;
242 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
187 SvREFCNT_dec(sv); 243 SvREFCNT_dec (sv);
244
245 SvREFCNT_dec (*svp);
246 }
188 } 247 }
189 248
190 SvREFCNT_dec((SV*)padlist); 249 SvREFCNT_dec ((SV*)padlist);
191 } 250 }
192} 251}
193#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};
194 267
195/* the next two functions merely cache the padlists */ 268/* the next two functions merely cache the padlists */
196STATIC void 269STATIC void
197get_padlist (CV *cv) 270get_padlist (CV *cv)
198{ 271{
199 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); 272 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
200 273
201 if (he && AvFILLp ((AV *)*he) >= 0) 274 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
202 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); 275 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
203 else 276 else
204 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 277 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
205} 278}
206 279
207STATIC void 280STATIC void
208put_padlist (CV *cv) 281put_padlist (CV *cv)
209{ 282{
210 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); 283 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
211 284
212 if (SvTYPE (*he) != SVt_PVAV) 285 if (!mg)
213 { 286 {
214 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;
215 *he = (SV *)newAV (); 290 mg->mg_obj = (SV *)newAV ();
216 } 291 }
217 292
218 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 293 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
219} 294}
220
221#ifdef MAY_FLUSH
222STATIC void
223flush_padlist_cache ()
224{
225 HV *hv = padlist_cache;
226 padlist_cache = newHV ();
227
228 if (hv_iterinit (hv))
229 {
230 HE *he;
231 AV *padlist;
232
233 while (!!(he = hv_iternext (hv)))
234 {
235 AV *av = (AV *)HeVAL(he);
236
237 /* casting is fun. */
238 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
239 free_padlist (padlist);
240 }
241 }
242
243 SvREFCNT_dec (hv);
244}
245#endif
246 295
247#define SB do { 296#define SB do {
248#define SE } while (0) 297#define SE } while (0)
249 298
250#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE 299#define LOAD(state) load_state(aTHX_ (state));
251#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE 300#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
252 301
253#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
254 303
255static void 304static void
256load_state(pTHX_ Coro__State c) 305load_state(pTHX_ Coro__State c)
257{ 306{
258 PL_dowarn = c->dowarn; 307 PL_dowarn = c->dowarn;
308 PL_in_eval = c->in_eval;
259 309
260 PL_curstackinfo = c->curstackinfo; 310 PL_curstackinfo = c->curstackinfo;
261 PL_curstack = c->curstack; 311 PL_curstack = c->curstack;
262 PL_mainstack = c->mainstack; 312 PL_mainstack = c->mainstack;
263 PL_stack_sp = c->stack_sp; 313 PL_stack_sp = c->stack_sp;
264 PL_op = c->op; 314 PL_op = c->op;
265 PL_curpad = c->curpad; 315 PL_curpad = c->curpad;
316 PL_comppad = c->comppad;
266 PL_stack_base = c->stack_base; 317 PL_stack_base = c->stack_base;
267 PL_stack_max = c->stack_max; 318 PL_stack_max = c->stack_max;
268 PL_tmps_stack = c->tmps_stack; 319 PL_tmps_stack = c->tmps_stack;
269 PL_tmps_floor = c->tmps_floor; 320 PL_tmps_floor = c->tmps_floor;
270 PL_tmps_ix = c->tmps_ix; 321 PL_tmps_ix = c->tmps_ix;
280 PL_savestack_max = c->savestack_max; 331 PL_savestack_max = c->savestack_max;
281 PL_retstack = c->retstack; 332 PL_retstack = c->retstack;
282 PL_retstack_ix = c->retstack_ix; 333 PL_retstack_ix = c->retstack_ix;
283 PL_retstack_max = c->retstack_max; 334 PL_retstack_max = c->retstack_max;
284 PL_curcop = c->curcop; 335 PL_curcop = c->curcop;
285 PL_start_env = c->start_env;
286 PL_top_env = c->top_env; 336 PL_top_env = c->top_env;
287 337
288 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 338 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
289 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 339 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
290 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 340 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
330 380
331 PUSHs (Nullsv); 381 PUSHs (Nullsv);
332 /* this loop was inspired by pp_caller */ 382 /* this loop was inspired by pp_caller */
333 for (;;) 383 for (;;)
334 { 384 {
335 do 385 while (cxix >= 0)
336 { 386 {
337 PERL_CONTEXT *cx = &ccstk[cxix--]; 387 PERL_CONTEXT *cx = &ccstk[cxix--];
338 388
339 if (CxTYPE(cx) == CXt_SUB) 389 if (CxTYPE(cx) == CXt_SUB)
340 { 390 {
359 PUSHs ((SV *)cv); 409 PUSHs ((SV *)cv);
360 410
361 get_padlist (cv); /* this is a monster */ 411 get_padlist (cv); /* this is a monster */
362 } 412 }
363 } 413 }
414#ifdef CXt_FORMAT
364 else if (CxTYPE(cx) == CXt_FORMAT) 415 else if (CxTYPE(cx) == CXt_FORMAT)
365 { 416 {
366 /* 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? */
367 /* my bold guess is as a simple, plain sub... */ 418 /* my bold guess is as a simple, plain sub... */
368 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");
369 } 420 }
421#endif
370 } 422 }
371 while (cxix >= 0);
372 423
373 if (top_si->si_type == PERLSI_MAIN) 424 if (top_si->si_type == PERLSI_MAIN)
374 break; 425 break;
375 426
376 top_si = top_si->si_prev; 427 top_si = top_si->si_prev;
383 434
384 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;
385 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 436 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
386 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 437 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
387 438
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; 439 c->dowarn = PL_dowarn;
440 c->in_eval = PL_in_eval;
394 441
395 c->curstackinfo = PL_curstackinfo; 442 c->curstackinfo = PL_curstackinfo;
396 c->curstack = PL_curstack; 443 c->curstack = PL_curstack;
397 c->mainstack = PL_mainstack; 444 c->mainstack = PL_mainstack;
398 c->stack_sp = PL_stack_sp; 445 c->stack_sp = PL_stack_sp;
399 c->op = PL_op; 446 c->op = PL_op;
400 c->curpad = PL_curpad; 447 c->curpad = PL_curpad;
448 c->comppad = PL_comppad;
401 c->stack_base = PL_stack_base; 449 c->stack_base = PL_stack_base;
402 c->stack_max = PL_stack_max; 450 c->stack_max = PL_stack_max;
403 c->tmps_stack = PL_tmps_stack; 451 c->tmps_stack = PL_tmps_stack;
404 c->tmps_floor = PL_tmps_floor; 452 c->tmps_floor = PL_tmps_floor;
405 c->tmps_ix = PL_tmps_ix; 453 c->tmps_ix = PL_tmps_ix;
415 c->savestack_max = PL_savestack_max; 463 c->savestack_max = PL_savestack_max;
416 c->retstack = PL_retstack; 464 c->retstack = PL_retstack;
417 c->retstack_ix = PL_retstack_ix; 465 c->retstack_ix = PL_retstack_ix;
418 c->retstack_max = PL_retstack_max; 466 c->retstack_max = PL_retstack_max;
419 c->curcop = PL_curcop; 467 c->curcop = PL_curcop;
420 c->start_env = PL_start_env;
421 c->top_env = PL_top_env; 468 c->top_env = PL_top_env;
422} 469}
423 470
424/* 471/*
425 * allocate various perl stacks. This is an exact copy 472 * allocate various perl stacks. This is an exact copy
437 484
438 PL_stack_base = AvARRAY(PL_curstack); 485 PL_stack_base = AvARRAY(PL_curstack);
439 PL_stack_sp = PL_stack_base; 486 PL_stack_sp = PL_stack_base;
440 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 487 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
441 488
442 New(50,PL_tmps_stack,64,SV*); 489 New(50,PL_tmps_stack,96,SV*);
443 PL_tmps_floor = -1; 490 PL_tmps_floor = -1;
444 PL_tmps_ix = -1; 491 PL_tmps_ix = -1;
445 PL_tmps_max = 64; 492 PL_tmps_max = 96;
446 493
447 New(54,PL_markstack,12,I32); 494 New(54,PL_markstack,16,I32);
448 PL_markstack_ptr = PL_markstack; 495 PL_markstack_ptr = PL_markstack;
449 PL_markstack_max = PL_markstack + 12; 496 PL_markstack_max = PL_markstack + 16;
450 497
498#ifdef SET_MARK_OFFSET
451 SET_MARK_OFFSET; 499 SET_MARK_OFFSET;
500#endif
452 501
453 New(54,PL_scopestack,12,I32); 502 New(54,PL_scopestack,16,I32);
454 PL_scopestack_ix = 0; 503 PL_scopestack_ix = 0;
455 PL_scopestack_max = 12; 504 PL_scopestack_max = 16;
456 505
457 New(54,PL_savestack,64,ANY); 506 New(54,PL_savestack,96,ANY);
458 PL_savestack_ix = 0; 507 PL_savestack_ix = 0;
459 PL_savestack_max = 64; 508 PL_savestack_max = 96;
460 509
461 New(54,PL_retstack,8,OP*); 510 New(54,PL_retstack,8,OP*);
462 PL_retstack_ix = 0; 511 PL_retstack_ix = 0;
463 PL_retstack_max = 8; 512 PL_retstack_max = 8;
464} 513}
465 514
466/* 515/*
467 * destroy the stacks, the callchain etc... 516 * destroy the stacks, the callchain etc...
468 * still there is a memleak of 128 bytes...
469 */ 517 */
470STATIC void 518STATIC void
471destroy_stacks(pTHX) 519destroy_stacks(pTHX)
472{ 520{
521 if (!IN_DESTRUCT)
522 {
473 /* is this ugly, I ask? */ 523 /* is this ugly, I ask? */
474 while (PL_scopestack_ix) 524 while (PL_scopestack_ix)
475 LEAVE; 525 LEAVE;
476 526
477 /* sure it is, but more important: is it correct?? :/ */ 527 /* sure it is, but more important: is it correct?? :/ */
478 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 */
479 FREETMPS; 529 FREETMPS;
530 }
480 531
481 while (PL_curstackinfo->si_next) 532 while (PL_curstackinfo->si_next)
482 PL_curstackinfo = PL_curstackinfo->si_next; 533 PL_curstackinfo = PL_curstackinfo->si_next;
483 534
484 while (PL_curstackinfo) 535 while (PL_curstackinfo)
489 dSP; 540 dSP;
490 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 541 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
491 PUTBACK; /* possibly superfluous */ 542 PUTBACK; /* possibly superfluous */
492 } 543 }
493 544
545 if (!IN_DESTRUCT)
546 {
494 dounwind(-1); 547 dounwind(-1);
495
496 SvREFCNT_dec(PL_curstackinfo->si_stack); 548 SvREFCNT_dec(PL_curstackinfo->si_stack);
549 }
550
497 Safefree(PL_curstackinfo->si_cxstack); 551 Safefree(PL_curstackinfo->si_cxstack);
498 Safefree(PL_curstackinfo); 552 Safefree(PL_curstackinfo);
499 PL_curstackinfo = p; 553 PL_curstackinfo = p;
500 } 554 }
501 555
505 Safefree(PL_savestack); 559 Safefree(PL_savestack);
506 Safefree(PL_retstack); 560 Safefree(PL_retstack);
507} 561}
508 562
509static void 563static void
510allocate_stack (Coro__State ctx) 564allocate_stack (Coro__State ctx, int alloc)
511{ 565{
566 coro_stack *stack;
567
568 New (0, stack, 1, coro_stack);
569
570 stack->refcnt = 1;
571 stack->usecnt = 1;
572 stack->gencnt = ctx->gencnt = 0;
573 if (alloc)
574 {
512#ifdef HAVE_MMAP 575#if HAVE_MMAP
513 ctx->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 */
514 ctx->sptr = mmap (0, ctx->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);
515 if (ctx->sptr == (void *)-1) 578 if (stack->sptr == (void *)-1)
516#endif 579#endif
517 { 580 {
518 /*FIXME*//*D*//* reasonable stack size! */ 581 /*FIXME*//*D*//* reasonable stack size! */
519 ctx->ssize = 4096 * sizeof (long); 582 stack->ssize = -4096 * sizeof (long);
520 New (0, ctx->sptr, 4096, long); 583 New (0, stack->sptr, 4096, long);
584 }
521 } 585 }
586 else
587 stack->sptr = 0;
588
589 ctx->stack = stack;
522} 590}
523 591
524static void 592static void
525deallocate_stack (Coro__State ctx) 593deallocate_stack (Coro__State ctx)
526{ 594{
595 coro_stack *stack = ctx->stack;
596
597 ctx->stack = 0;
598
599 if (stack)
600 {
601 if (!--stack->refcnt)
602 {
527#ifdef HAVE_MMAP 603#ifdef HAVE_MMAP
528 munmap (ctx->sptr, ctx->ssize); 604 if (stack->ssize > 0 && stack->sptr)
529#else 605 munmap (stack->sptr, stack->ssize);
530 Safefree (ctx->sptr); 606 else
531#endif 607#endif
532} 608 Safefree (stack->sptr);
533 609
534/* might go away together with optional SAVE_CCTXT */ 610 Safefree (stack);
611 }
612 else if (ctx->gencnt == stack->gencnt)
613 --stack->usecnt;
614 }
615}
616
535static void 617static void
536setup_coro (void *arg) 618setup_coro (void *arg)
537{ 619{
538 /* 620 /*
539 * emulate part of the perl startup here. 621 * emulate part of the perl startup here.
541 dSP; 623 dSP;
542 Coro__State ctx = (Coro__State)arg; 624 Coro__State ctx = (Coro__State)arg;
543 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 625 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
544 626
545 coro_init_stacks (aTHX); 627 coro_init_stacks (aTHX);
546 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
547 SPAGAIN; 633 SPAGAIN;
548 634
549 /*PL_curcop = 0;*/
550 SvREFCNT_dec (GvAV (PL_defgv));
551 GvAV (PL_defgv) = ctx->args;
552
553 if (ctx->sptr) 635 if (ctx->stack)
554 { 636 {
637 ctx->cursp = 0;
638
555 PUSHMARK(SP); 639 PUSHMARK(SP);
556 PUTBACK; 640 PUTBACK;
557 (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
558 croak ("FATAL: CCTXT coroutine returned!"); 646 croak ("FATAL: CCTXT coroutine returned!");
559 } 647 }
560 else 648 else
561 { 649 {
562 UNOP myop; 650 UNOP myop;
563 651
575 * that doesn't matter, though, since it is only 663 * that doesn't matter, though, since it is only
576 * pp_nextstate and we never return... 664 * pp_nextstate and we never return...
577 * ah yes, and I don't care anyways ;) 665 * ah yes, and I don't care anyways ;)
578 */ 666 */
579 PUTBACK; 667 PUTBACK;
580 PL_op = pp_entersub(); 668 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
581 SPAGAIN; 669 SPAGAIN;
582 670
583 ENTER; /* necessary e.g. for dounwind */ 671 ENTER; /* necessary e.g. for dounwind */
584 } 672 }
585} 673}
586 674
675static void
676continue_coro (void *arg)
677{
678 /*
679 * this is a _very_ stripped down perl interpreter ;)
680 */
681 Coro__State ctx = (Coro__State)arg;
682 JMPENV coro_start_env;
683
684 PL_top_env = &ctx->start_env;
685
686 ctx->cursp = 0;
687 PL_op = PL_op->op_next;
688 CALLRUNOPS(aTHX);
689
690 abort ();
691}
692
587STATIC void 693STATIC void
588transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 694transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
589{ 695{
590 dSP; 696 dSTACKLEVEL;
697 static struct coro *xnext;
591 698
592 if (prev != next) 699 if (prev != next)
593 { 700 {
594 /* 701 xnext = next;
595 * this could be done in newprocess which would lead to 702
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) 703 if (next->mainstack)
601 { 704 {
602 SAVE (prev, flags); 705 SAVE (prev, flags);
603 LOAD (next); 706 LOAD (next);
604 707
605 /* mark this state as in-use */ 708 /* mark this state as in-use */
606 next->mainstack = 0; 709 next->mainstack = 0;
607 next->tmps_ix = -2; 710 next->tmps_ix = -2;
608 711
712 /* stacklevel changed? if yes, grab the stack for us! */
609 if (flags & TRANSFER_SAVE_CCTXT) 713 if (flags & TRANSFER_SAVE_CCTXT)
610 { 714 {
611 if (!next->ssize)
612 croak ("destination coroutine has no CCTXT (%p, %d)", next->sptr, next->ssize);
613
614 if (!prev->ssize) 715 if (!prev->stack)
615 prev->ssize = 1; /* mark cctx as valid ;) */ 716 allocate_stack (prev, 0);
717 else if (prev->cursp != stacklevel
718 && prev->stack->usecnt > 1)
719 {
720 prev->gencnt = ++prev->stack->gencnt;
721 prev->stack->usecnt = 1;
722 }
616 723
724 /* has our stack been invalidated? */
725 if (next->stack && next->stack->gencnt != next->gencnt)
726 {
727 deallocate_stack (next);
728 allocate_stack (next, 1);
729 coro_create (&(next->stack->cctx),
730 continue_coro, (void *)next,
731 next->stack->sptr, labs (next->stack->ssize));
732 }
733
617 coro_transfer (&(prev->cctx), &(next->cctx)); 734 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
735 /* don't add any code here */
618 } 736 }
619 737
620 } 738 }
621 else if (next->tmps_ix == -2) 739 else if (next->tmps_ix == -2)
622 croak ("tried to transfer to running coroutine"); 740 croak ("tried to transfer to running coroutine");
624 { 742 {
625 SAVE (prev, -1); /* first get rid of the old state */ 743 SAVE (prev, -1); /* first get rid of the old state */
626 744
627 if (flags & TRANSFER_SAVE_CCTXT) 745 if (flags & TRANSFER_SAVE_CCTXT)
628 { 746 {
629 if (!next->ssize) 747 if (!prev->stack)
748 allocate_stack (prev, 0);
749
750 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
630 { 751 {
752 PL_top_env = &next->start_env;
753
754 setup_coro (next);
755
756 prev->stack->refcnt++;
757 prev->stack->usecnt++;
758 next->stack = prev->stack;
759 next->gencnt = prev->gencnt;
760 }
761 else
762 {
763 assert (!next->stack);
631 allocate_stack (next); 764 allocate_stack (next, 1);
632 coro_create (&(next->cctx), 765 coro_create (&(next->stack->cctx),
633 setup_coro, (void *)next, 766 setup_coro, (void *)next,
634 next->sptr, next->ssize); 767 next->stack->sptr, labs (next->stack->ssize));
768 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
769 /* don't add any code here */
635 } 770 }
636
637 if (!prev->ssize)
638 prev->ssize = 1; /* mark cctx as valid ;) */
639
640 coro_transfer (&(prev->cctx), &(next->cctx));
641 } 771 }
642 else 772 else
643 setup_coro (next); 773 setup_coro (next);
644 } 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;
645 } 782 }
783
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 ();
646} 915}
647 916
648MODULE = Coro::State PACKAGE = Coro::State 917MODULE = Coro::State PACKAGE = Coro::State
649 918
650PROTOTYPES: ENABLE 919PROTOTYPES: ENABLE
662 931
663 if (!padlist_cache) 932 if (!padlist_cache)
664 padlist_cache = newHV (); 933 padlist_cache = newHV ();
665 934
666 main_mainstack = PL_mainstack; 935 main_mainstack = PL_mainstack;
936
937 coroapi.ver = CORO_API_VERSION;
938 coroapi.transfer = api_transfer;
667} 939}
668 940
669Coro::State 941Coro::State
670_newprocess(args) 942_newprocess(args)
671 SV * args 943 SV * args
674 Coro__State coro; 946 Coro__State coro;
675 947
676 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 948 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
677 croak ("Coro::State::_newprocess expects an arrayref"); 949 croak ("Coro::State::_newprocess expects an arrayref");
678 950
679 New (0, coro, 1, struct coro); 951 Newz (0, coro, 1, struct coro);
680 952
681 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 953 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
682 coro->mainstack = 0; /* actual work is done inside transfer */ 954 coro->mainstack = 0; /* actual work is done inside transfer */
683 coro->sptr = 0; 955 coro->stack = 0;
684 coro->ssize = 0; 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;
685 962
686 RETVAL = coro; 963 RETVAL = coro;
687 OUTPUT: 964 OUTPUT:
688 RETVAL 965 RETVAL
689 966
690void 967void
691transfer(prev, next, flags = TRANSFER_SAVE_ALL) 968transfer(prev, next, flags)
692 Coro::State_or_hashref prev 969 SV *prev
693 Coro::State_or_hashref next 970 SV *next
694 int flags 971 int flags
695 PROTOTYPE: @ 972 PROTOTYPE: @
696 CODE: 973 CODE:
974 PUTBACK;
975 SV_CORO (next, "Coro::transfer");
976 SV_CORO (prev, "Coro::transfer");
697 transfer (aTHX_ prev, next, flags); 977 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
978 SPAGAIN;
698 979
699void 980void
700DESTROY(coro) 981DESTROY(coro)
701 Coro::State coro 982 Coro::State coro
702 CODE: 983 CODE:
703 984
704 if (coro->mainstack && coro->mainstack != main_mainstack) 985 if (coro->mainstack && coro->mainstack != main_mainstack)
705 { 986 {
706 struct coro temp; 987 struct coro temp;
707 988
989 PUTBACK;
708 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 990 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
709 LOAD(aTHX_ coro); 991 LOAD(aTHX_ coro);
992 SPAGAIN;
710 993
711 destroy_stacks (aTHX); 994 destroy_stacks (aTHX);
712 995
713 LOAD((&temp)); /* this will get rid of defsv etc.. */ 996 LOAD((&temp)); /* this will get rid of defsv etc.. */
997 SPAGAIN;
714 998
715 coro->mainstack = 0; 999 coro->mainstack = 0;
716 } 1000 }
717 1001
718 if (coro->sptr)
719 {
720 deallocate_stack (coro); 1002 deallocate_stack (coro);
721 coro->sptr = 0; 1003 SvREFCNT_dec (coro->args);
722 }
723
724 Safefree (coro); 1004 Safefree (coro);
725 1005
726void 1006void
727flush() 1007_exit(code)
1008 int code
1009 PROTOTYPE: $
728 CODE: 1010 CODE:
729#ifdef MAY_FLUSH 1011#if defined(__GLIBC__) || _POSIX_C_SOURCE
730 flush_padlist_cache (); 1012 _exit (code);
1013#else
1014 signal (SIGTERM, SIG_DFL);
1015 raise (SIGTERM);
1016 exit (code);
731#endif 1017#endif
732 1018
733MODULE = Coro::State PACKAGE = Coro::Cont 1019MODULE = Coro::State PACKAGE = Coro::Cont
734 1020
735# this is slightly dirty 1021# this is slightly dirty (should expose a c-level api)
736 1022
737void 1023void
738yield(...) 1024yield(...)
739 PROTOTYPE: @ 1025 PROTOTYPE: @
740 CODE: 1026 CODE:
742 SV *sv; 1028 SV *sv;
743 AV *defav = GvAV (PL_defgv); 1029 AV *defav = GvAV (PL_defgv);
744 struct coro *prev, *next; 1030 struct coro *prev, *next;
745 1031
746 if (!returnstk) 1032 if (!returnstk)
747 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1033 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
748 1034
749 /* set up @_ -- ugly */ 1035 /* set up @_ -- ugly */
750 av_clear (defav); 1036 av_clear (defav);
751 av_fill (defav, items - 1); 1037 av_fill (defav, items - 1);
752 while (items--) 1038 while (items--)
758 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)));
759 SvREFCNT_dec (sv); 1045 SvREFCNT_dec (sv);
760 1046
761 transfer(aTHX_ prev, next, 0); 1047 transfer(aTHX_ prev, next, 0);
762 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