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.7 by root, Thu Jul 19 02:45:09 2001 UTC vs.
Revision 1.53 by pcg, Sat Feb 14 12:39:41 2004 UTC

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