ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
Revision: 1.56
Committed: Thu Apr 1 02:41:05 2004 UTC (20 years, 1 month ago) by pcg
Branch: MAIN
Changes since 1.55: +29 -20 lines
Log Message:
*** empty log message ***

File Contents

# Content
1 #define PERL_NO_GET_CONTEXT
2
3 #include "EXTERN.h"
4 #include "perl.h"
5 #include "XSUB.h"
6
7 #include "patchlevel.h"
8
9 #if PATCHLEVEL < 6
10 # ifndef PL_ppaddr
11 # define PL_ppaddr ppaddr
12 # endif
13 # ifndef call_sv
14 # define call_sv perl_call_sv
15 # endif
16 # ifndef get_sv
17 # define get_sv perl_get_sv
18 # endif
19 # ifndef get_cv
20 # define get_cv perl_get_cv
21 # endif
22 # ifndef IS_PADGV
23 # define IS_PADGV(v) 0
24 # endif
25 # ifndef IS_PADCONST
26 # define IS_PADCONST(v) 0
27 # endif
28 #endif
29
30 #include "libcoro/coro.c"
31
32 #include <signal.h>
33
34 #ifdef HAVE_MMAP
35 # include <unistd.h>
36 # include <sys/mman.h>
37 # ifndef MAP_ANONYMOUS
38 # ifdef MAP_ANON
39 # define MAP_ANONYMOUS MAP_ANON
40 # else
41 # undef HAVE_MMAP
42 # endif
43 # endif
44 #endif
45
46 #define SUB_INIT "Coro::State::initialize"
47 #define UCORO_STATE "_coro_state"
48
49 /* The next macro should declare a variable stacklevel that contains and approximation
50 * to the current C stack pointer. Its property is that it changes with each call
51 * and should be unique. */
52 #define dSTACKLEVEL void *stacklevel = &stacklevel
53
54 #define IN_DESTRUCT (PL_main_cv == Nullcv)
55
56 #define labs(l) ((l) >= 0 ? (l) : -(l))
57
58 #include "CoroAPI.h"
59
60 #ifdef USE_ITHREADS
61 static perl_mutex coro_mutex;
62 # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
63 # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
64 #else
65 # define LOCK 0
66 # define UNLOCK 0
67 #endif
68
69 static struct CoroAPI coroapi;
70 static AV *main_mainstack; /* used to differentiate between $main and others */
71 static HV *coro_state_stash;
72 static SV *ucoro_state_sv;
73 static U32 ucoro_state_hash;
74 static __thread SV *coro_mortal; /* will be freed after next transfer */
75
76 /* this is actually not only the c stack but also c registers etc... */
77 typedef struct {
78 int refcnt; /* pointer reference counter */
79 int usecnt; /* shared by how many coroutines */
80 int gencnt; /* generation counter */
81
82 coro_context cctx;
83
84 void *sptr;
85 long ssize; /* positive == mmap, otherwise malloc */
86 } coro_stack;
87
88 struct coro {
89 /* the top-level JMPENV for each coroutine, needed to catch dies. */
90 JMPENV start_env;
91
92 /* the optional C context */
93 coro_stack *stack;
94 void *cursp;
95 int gencnt;
96
97 /* optionally saved, might be zero */
98 AV *defav;
99 SV *defsv;
100 SV *errsv;
101
102 /* saved global state not related to stacks */
103 U8 dowarn;
104 I32 in_eval;
105
106 /* the stacks and related info (callchain etc..) */
107 PERL_SI *curstackinfo;
108 AV *curstack;
109 AV *mainstack;
110 SV **stack_sp;
111 OP *op;
112 SV **curpad;
113 AV *comppad;
114 SV **stack_base;
115 SV **stack_max;
116 SV **tmps_stack;
117 I32 tmps_floor;
118 I32 tmps_ix;
119 I32 tmps_max;
120 I32 *markstack;
121 I32 *markstack_ptr;
122 I32 *markstack_max;
123 I32 *scopestack;
124 I32 scopestack_ix;
125 I32 scopestack_max;
126 ANY *savestack;
127 I32 savestack_ix;
128 I32 savestack_max;
129 OP **retstack;
130 I32 retstack_ix;
131 I32 retstack_max;
132 COP *curcop;
133 JMPENV *top_env;
134
135 /* data associated with this coroutine (initial args) */
136 AV *args;
137 };
138
139 typedef struct coro *Coro__State;
140 typedef struct coro *Coro__State_or_hashref;
141
142 /* mostly copied from op.c:cv_clone2 */
143 STATIC AV *
144 clone_padlist (pTHX_ AV *protopadlist)
145 {
146 AV *av;
147 I32 ix;
148 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
149 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
150 SV **pname = AvARRAY (protopad_name);
151 SV **ppad = AvARRAY (protopad);
152 I32 fname = AvFILLp (protopad_name);
153 I32 fpad = AvFILLp (protopad);
154 AV *newpadlist, *newpad_name, *newpad;
155 SV **npad;
156
157 newpad_name = newAV ();
158 for (ix = fname; ix >= 0; ix--)
159 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
160
161 newpad = newAV ();
162 av_fill (newpad, AvFILLp (protopad));
163 npad = AvARRAY (newpad);
164
165 newpadlist = newAV ();
166 AvREAL_off (newpadlist);
167 av_store (newpadlist, 0, (SV *) newpad_name);
168 av_store (newpadlist, 1, (SV *) newpad);
169
170 av = newAV (); /* will be @_ */
171 av_extend (av, 0);
172 av_store (newpad, 0, (SV *) av);
173 AvFLAGS (av) = AVf_REIFY;
174
175 for (ix = fpad; ix > 0; ix--)
176 {
177 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
178
179 if (namesv && namesv != &PL_sv_undef)
180 {
181 char *name = SvPVX (namesv); /* XXX */
182
183 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
184 { /* lexical from outside? */
185 npad[ix] = SvREFCNT_inc (ppad[ix]);
186 }
187 else
188 { /* our own lexical */
189 SV *sv;
190 if (*name == '&')
191 sv = SvREFCNT_inc (ppad[ix]);
192 else if (*name == '@')
193 sv = (SV *) newAV ();
194 else if (*name == '%')
195 sv = (SV *) newHV ();
196 else
197 sv = NEWSV (0, 0);
198
199 #ifdef SvPADBUSY
200 if (!SvPADBUSY (sv))
201 #endif
202 SvPADMY_on (sv);
203
204 npad[ix] = sv;
205 }
206 }
207 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
208 {
209 npad[ix] = SvREFCNT_inc (ppad[ix]);
210 }
211 else
212 {
213 SV *sv = NEWSV (0, 0);
214 SvPADTMP_on (sv);
215 npad[ix] = sv;
216 }
217 }
218
219 #if 0 /* return -ENOTUNDERSTOOD */
220 /* Now that vars are all in place, clone nested closures. */
221
222 for (ix = fpad; ix > 0; ix--) {
223 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
224 if (namesv
225 && namesv != &PL_sv_undef
226 && !(SvFLAGS(namesv) & SVf_FAKE)
227 && *SvPVX(namesv) == '&'
228 && CvCLONE(ppad[ix]))
229 {
230 CV *kid = cv_clone((CV*)ppad[ix]);
231 SvREFCNT_dec(ppad[ix]);
232 CvCLONE_on(kid);
233 SvPADMY_on(kid);
234 npad[ix] = (SV*)kid;
235 }
236 }
237 #endif
238
239 return newpadlist;
240 }
241
242 STATIC void
243 free_padlist (pTHX_ AV *padlist)
244 {
245 /* may be during global destruction */
246 if (SvREFCNT (padlist))
247 {
248 I32 i = AvFILLp (padlist);
249 while (i >= 0)
250 {
251 SV **svp = av_fetch (padlist, i--, FALSE);
252 if (svp)
253 {
254 SV *sv;
255 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
256 SvREFCNT_dec (sv);
257
258 SvREFCNT_dec (*svp);
259 }
260 }
261
262 SvREFCNT_dec ((SV*)padlist);
263 }
264 }
265
266 STATIC int
267 coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
268 {
269 AV *padlist;
270 AV *av = (AV *)mg->mg_obj;
271
272 /* casting is fun. */
273 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
274 free_padlist (aTHX_ padlist);
275 }
276
277 #define PERL_MAGIC_coro PERL_MAGIC_ext
278
279 static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
280
281 /* the next two functions merely cache the padlists */
282 STATIC void
283 get_padlist (pTHX_ CV *cv)
284 {
285 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
286
287 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
288 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
289 else
290 CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv));
291 }
292
293 STATIC void
294 put_padlist (pTHX_ CV *cv)
295 {
296 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
297
298 if (!mg)
299 {
300 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
301 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
302 mg->mg_virtual = &vtbl_coro;
303 mg->mg_obj = (SV *)newAV ();
304 }
305
306 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
307 }
308
309 #define SB do {
310 #define SE } while (0)
311
312 #define LOAD(state) load_state(aTHX_ (state));
313 #define SAVE(state,flags) save_state(aTHX_ (state),(flags));
314
315 #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
316
317 static void
318 load_state(pTHX_ Coro__State c)
319 {
320 PL_dowarn = c->dowarn;
321 PL_in_eval = c->in_eval;
322
323 PL_curstackinfo = c->curstackinfo;
324 PL_curstack = c->curstack;
325 PL_mainstack = c->mainstack;
326 PL_stack_sp = c->stack_sp;
327 PL_op = c->op;
328 PL_curpad = c->curpad;
329 PL_comppad = c->comppad;
330 PL_stack_base = c->stack_base;
331 PL_stack_max = c->stack_max;
332 PL_tmps_stack = c->tmps_stack;
333 PL_tmps_floor = c->tmps_floor;
334 PL_tmps_ix = c->tmps_ix;
335 PL_tmps_max = c->tmps_max;
336 PL_markstack = c->markstack;
337 PL_markstack_ptr = c->markstack_ptr;
338 PL_markstack_max = c->markstack_max;
339 PL_scopestack = c->scopestack;
340 PL_scopestack_ix = c->scopestack_ix;
341 PL_scopestack_max = c->scopestack_max;
342 PL_savestack = c->savestack;
343 PL_savestack_ix = c->savestack_ix;
344 PL_savestack_max = c->savestack_max;
345 PL_retstack = c->retstack;
346 PL_retstack_ix = c->retstack_ix;
347 PL_retstack_max = c->retstack_max;
348 PL_curcop = c->curcop;
349 PL_top_env = c->top_env;
350
351 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
352 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
353 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
354
355 {
356 dSP;
357 CV *cv;
358
359 /* now do the ugly restore mess */
360 while ((cv = (CV *)POPs))
361 {
362 AV *padlist = (AV *)POPs;
363
364 if (padlist)
365 {
366 put_padlist (aTHX_ cv); /* mark this padlist as available */
367 CvPADLIST(cv) = padlist;
368 }
369
370 ++CvDEPTH(cv);
371 }
372
373 PUTBACK;
374 }
375 }
376
377 static void
378 save_state(pTHX_ Coro__State c, int flags)
379 {
380 {
381 dSP;
382 I32 cxix = cxstack_ix;
383 PERL_CONTEXT *ccstk = cxstack;
384 PERL_SI *top_si = PL_curstackinfo;
385
386 /*
387 * the worst thing you can imagine happens first - we have to save
388 * (and reinitialize) all cv's in the whole callchain :(
389 */
390
391 PUSHs (Nullsv);
392 /* this loop was inspired by pp_caller */
393 for (;;)
394 {
395 while (cxix >= 0)
396 {
397 PERL_CONTEXT *cx = &ccstk[cxix--];
398
399 if (CxTYPE(cx) == CXt_SUB)
400 {
401 CV *cv = cx->blk_sub.cv;
402 if (CvDEPTH(cv))
403 {
404 EXTEND (SP, CvDEPTH(cv)*2);
405
406 while (--CvDEPTH(cv))
407 {
408 /* this tells the restore code to increment CvDEPTH */
409 PUSHs (Nullsv);
410 PUSHs ((SV *)cv);
411 }
412
413 PUSHs ((SV *)CvPADLIST(cv));
414 PUSHs ((SV *)cv);
415
416 get_padlist (aTHX_ cv); /* this is a monster */
417 }
418 }
419 #ifdef CXt_FORMAT
420 else if (CxTYPE(cx) == CXt_FORMAT)
421 {
422 /* I never used formats, so how should I know how these are implemented? */
423 /* my bold guess is as a simple, plain sub... */
424 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
425 }
426 #endif
427 }
428
429 if (top_si->si_type == PERLSI_MAIN)
430 break;
431
432 top_si = top_si->si_prev;
433 ccstk = top_si->si_cxstack;
434 cxix = top_si->si_cxix;
435 }
436
437 PUTBACK;
438 }
439
440 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
441 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
442 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
443
444 c->dowarn = PL_dowarn;
445 c->in_eval = PL_in_eval;
446
447 c->curstackinfo = PL_curstackinfo;
448 c->curstack = PL_curstack;
449 c->mainstack = PL_mainstack;
450 c->stack_sp = PL_stack_sp;
451 c->op = PL_op;
452 c->curpad = PL_curpad;
453 c->comppad = PL_comppad;
454 c->stack_base = PL_stack_base;
455 c->stack_max = PL_stack_max;
456 c->tmps_stack = PL_tmps_stack;
457 c->tmps_floor = PL_tmps_floor;
458 c->tmps_ix = PL_tmps_ix;
459 c->tmps_max = PL_tmps_max;
460 c->markstack = PL_markstack;
461 c->markstack_ptr = PL_markstack_ptr;
462 c->markstack_max = PL_markstack_max;
463 c->scopestack = PL_scopestack;
464 c->scopestack_ix = PL_scopestack_ix;
465 c->scopestack_max = PL_scopestack_max;
466 c->savestack = PL_savestack;
467 c->savestack_ix = PL_savestack_ix;
468 c->savestack_max = PL_savestack_max;
469 c->retstack = PL_retstack;
470 c->retstack_ix = PL_retstack_ix;
471 c->retstack_max = PL_retstack_max;
472 c->curcop = PL_curcop;
473 c->top_env = PL_top_env;
474 }
475
476 /*
477 * allocate various perl stacks. This is an exact copy
478 * of perl.c:init_stacks, except that it uses less memory
479 * on the (sometimes correct) assumption that coroutines do
480 * not usually need a lot of stackspace.
481 */
482 STATIC void
483 coro_init_stacks (pTHX)
484 {
485 LOCK;
486
487 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
488 PL_curstackinfo->si_type = PERLSI_MAIN;
489 PL_curstack = PL_curstackinfo->si_stack;
490 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
491
492 PL_stack_base = AvARRAY(PL_curstack);
493 PL_stack_sp = PL_stack_base;
494 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
495
496 New(50,PL_tmps_stack,96,SV*);
497 PL_tmps_floor = -1;
498 PL_tmps_ix = -1;
499 PL_tmps_max = 96;
500
501 New(54,PL_markstack,16,I32);
502 PL_markstack_ptr = PL_markstack;
503 PL_markstack_max = PL_markstack + 16;
504
505 #ifdef SET_MARK_OFFSET
506 SET_MARK_OFFSET;
507 #endif
508
509 New(54,PL_scopestack,16,I32);
510 PL_scopestack_ix = 0;
511 PL_scopestack_max = 16;
512
513 New(54,PL_savestack,96,ANY);
514 PL_savestack_ix = 0;
515 PL_savestack_max = 96;
516
517 New(54,PL_retstack,8,OP*);
518 PL_retstack_ix = 0;
519 PL_retstack_max = 8;
520
521 UNLOCK;
522 }
523
524 /*
525 * destroy the stacks, the callchain etc...
526 */
527 STATIC void
528 destroy_stacks(pTHX)
529 {
530 if (!IN_DESTRUCT)
531 {
532 /* is this ugly, I ask? */
533 LEAVE_SCOPE (0);
534
535 /* sure it is, but more important: is it correct?? :/ */
536 FREETMPS;
537 }
538
539 while (PL_curstackinfo->si_next)
540 PL_curstackinfo = PL_curstackinfo->si_next;
541
542 while (PL_curstackinfo)
543 {
544 PERL_SI *p = PL_curstackinfo->si_prev;
545
546 {
547 dSP;
548 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
549 PUTBACK; /* possibly superfluous */
550 }
551
552 if (!IN_DESTRUCT)
553 {
554 dounwind(-1);
555 SvREFCNT_dec(PL_curstackinfo->si_stack);
556 }
557
558 Safefree(PL_curstackinfo->si_cxstack);
559 Safefree(PL_curstackinfo);
560 PL_curstackinfo = p;
561 }
562
563 Safefree(PL_tmps_stack);
564 Safefree(PL_markstack);
565 Safefree(PL_scopestack);
566 Safefree(PL_savestack);
567 Safefree(PL_retstack);
568 }
569
570 static void
571 allocate_stack (Coro__State ctx, int alloc)
572 {
573 coro_stack *stack;
574
575 New (0, stack, 1, coro_stack);
576
577 stack->refcnt = 1;
578 stack->usecnt = 1;
579 stack->gencnt = ctx->gencnt = 0;
580
581 if (alloc)
582 {
583 #if HAVE_MMAP
584 stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */
585 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
586 if (stack->sptr == (void *)-1)
587 #endif
588 {
589 /*FIXME*//*D*//* reasonable stack size! */
590 stack->ssize = - (8192 * sizeof (long));
591 New (0, stack->sptr, 8192, long);
592 }
593 }
594 else
595 stack->sptr = 0;
596
597 ctx->stack = stack;
598 }
599
600 static void
601 deallocate_stack (Coro__State ctx)
602 {
603 coro_stack *stack = ctx->stack;
604
605 ctx->stack = 0;
606
607 if (stack)
608 {
609 if (!--stack->refcnt)
610 {
611 #ifdef HAVE_MMAP
612 if (stack->ssize > 0 && stack->sptr)
613 munmap (stack->sptr, stack->ssize);
614 else
615 #endif
616 Safefree (stack->sptr);
617
618 Safefree (stack);
619 }
620 else if (ctx->gencnt == stack->gencnt)
621 --stack->usecnt;
622 }
623 }
624
625 static void
626 setup_coro (void *arg)
627 {
628 /*
629 * emulate part of the perl startup here.
630 */
631 dTHX;
632 dSP;
633 Coro__State ctx = (Coro__State)arg;
634 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
635
636 coro_init_stacks (aTHX);
637 /*PL_curcop = 0;*/
638 /*PL_in_eval = PL_in_eval;*/ /* inherit */
639 SvREFCNT_dec (GvAV (PL_defgv));
640 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
641
642 SPAGAIN;
643
644 if (ctx->stack)
645 {
646 ctx->cursp = 0;
647
648 PUSHMARK(SP);
649 PUTBACK;
650 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
651
652 if (SvTRUE (ERRSV))
653 croak (NULL);
654 else
655 croak ("FATAL: CCTXT coroutine returned!");
656 }
657 else
658 {
659 UNOP myop;
660
661 PL_op = (OP *)&myop;
662
663 Zero(&myop, 1, UNOP);
664 myop.op_next = Nullop;
665 myop.op_flags = OPf_WANT_VOID;
666
667 PUSHMARK(SP);
668 XPUSHs (sub_init);
669 /*
670 * the next line is slightly wrong, as PL_op->op_next
671 * is actually being executed so we skip the first op.
672 * that doesn't matter, though, since it is only
673 * pp_nextstate and we never return...
674 * ah yes, and I don't care anyways ;)
675 */
676 PUTBACK;
677 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
678 SPAGAIN;
679
680 ENTER; /* necessary e.g. for dounwind */
681 }
682 }
683
684 static void
685 continue_coro (void *arg)
686 {
687 /*
688 * this is a _very_ stripped down perl interpreter ;)
689 */
690 dTHX;
691 Coro__State ctx = (Coro__State)arg;
692 JMPENV coro_start_env;
693
694 PL_top_env = &ctx->start_env;
695
696 ctx->cursp = 0;
697 PL_op = PL_op->op_next;
698 CALLRUNOPS(aTHX);
699
700 abort ();
701 }
702
703 STATIC void
704 transfer (pTHX_ struct coro *prev, struct coro *next, int flags)
705 {
706 dSTACKLEVEL;
707
708 if (prev != next)
709 {
710 if (next->mainstack)
711 {
712 LOCK;
713 SAVE (prev, flags);
714 LOAD (next);
715 UNLOCK;
716
717 /* mark this state as in-use */
718 next->mainstack = 0;
719 next->tmps_ix = -2;
720
721 /* stacklevel changed? if yes, grab the stack for us! */
722 if (flags & TRANSFER_SAVE_CCTXT)
723 {
724 if (!prev->stack)
725 allocate_stack (prev, 0);
726 else if (prev->cursp != stacklevel
727 && prev->stack->usecnt > 1)
728 {
729 prev->gencnt = ++prev->stack->gencnt;
730 prev->stack->usecnt = 1;
731 }
732
733 /* has our stack been invalidated? */
734 if (next->stack && next->stack->gencnt != next->gencnt)
735 {
736 deallocate_stack (next);
737 allocate_stack (next, 1);
738 coro_create (&(next->stack->cctx),
739 continue_coro, (void *)next,
740 next->stack->sptr, labs (next->stack->ssize));
741 }
742
743 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
744 prev->cursp = stacklevel;
745 /* don't add any code here */
746 }
747 else
748 next->cursp = stacklevel;
749 }
750 else if (next->tmps_ix == -2)
751 croak ("tried to transfer to running coroutine");
752 else
753 {
754 LOCK;
755 SAVE (prev, -1); /* first get rid of the old state */
756 UNLOCK;
757
758 if (flags & TRANSFER_SAVE_CCTXT)
759 {
760 if (!prev->stack)
761 allocate_stack (prev, 0);
762
763 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
764 {
765 PL_top_env = &next->start_env;
766
767 setup_coro (next);
768 next->cursp = stacklevel;
769
770 prev->stack->refcnt++;
771 prev->stack->usecnt++;
772 next->stack = prev->stack;
773 next->gencnt = prev->gencnt;
774 }
775 else
776 {
777 assert (!next->stack);
778 allocate_stack (next, 1);
779 coro_create (&(next->stack->cctx),
780 setup_coro, (void *)next,
781 next->stack->sptr, labs (next->stack->ssize));
782 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
783 prev->cursp = stacklevel;
784 /* don't add any code here */
785 }
786 }
787 else
788 {
789 setup_coro (next);
790 next->cursp = stacklevel;
791 }
792 }
793 }
794
795 LOCK;
796 if (coro_mortal)
797 {
798 SvREFCNT_dec (coro_mortal);
799 coro_mortal = 0;
800 }
801 UNLOCK;
802 }
803
804 #define SV_CORO(sv,func) \
805 do { \
806 if (SvROK (sv)) \
807 sv = SvRV (sv); \
808 \
809 if (SvTYPE (sv) == SVt_PVHV) \
810 { \
811 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
812 \
813 if (!he) \
814 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
815 \
816 (sv) = SvRV (HeVAL(he)); \
817 } \
818 \
819 /* must also be changed inside Coro::Cont::yield */ \
820 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
821 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
822 \
823 } while(0)
824
825 #define SvSTATE(sv) (struct coro *)SvIV (sv)
826
827 static void
828 api_transfer(pTHX_ SV *prev, SV *next, int flags)
829 {
830 SV_CORO (prev, "Coro::transfer");
831 SV_CORO (next, "Coro::transfer");
832
833 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
834 }
835
836 /** Coro ********************************************************************/
837
838 #define PRIO_MAX 3
839 #define PRIO_HIGH 1
840 #define PRIO_NORMAL 0
841 #define PRIO_LOW -1
842 #define PRIO_IDLE -3
843 #define PRIO_MIN -4
844
845 /* for Coro.pm */
846 static GV *coro_current, *coro_idle;
847 static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
848 static int coro_nready;
849
850 static void
851 coro_enq (pTHX_ SV *sv)
852 {
853 if (SvTYPE (sv) == SVt_PVHV)
854 {
855 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
856 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
857
858 prio = prio > PRIO_MAX ? PRIO_MAX
859 : prio < PRIO_MIN ? PRIO_MIN
860 : prio;
861
862 av_push (coro_ready [prio - PRIO_MIN], sv);
863 coro_nready++;
864
865 return;
866 }
867
868 croak ("Coro::ready tried to enqueue something that is not a coroutine");
869 }
870
871 static SV *
872 coro_deq (pTHX_ int min_prio)
873 {
874 int prio = PRIO_MAX - PRIO_MIN;
875
876 min_prio -= PRIO_MIN;
877 if (min_prio < 0)
878 min_prio = 0;
879
880 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
881 if (av_len (coro_ready[prio]) >= 0)
882 {
883 coro_nready--;
884 return av_shift (coro_ready[prio]);
885 }
886
887 return 0;
888 }
889
890 static void
891 api_ready (SV *coro)
892 {
893 dTHX;
894
895 if (SvROK (coro))
896 coro = SvRV (coro);
897
898 LOCK;
899 coro_enq (aTHX_ SvREFCNT_inc (coro));
900 UNLOCK;
901 }
902
903 static void
904 api_schedule (void)
905 {
906 dTHX;
907
908 SV *prev, *next;
909
910 LOCK;
911
912 prev = SvRV (GvSV (coro_current));
913 next = coro_deq (aTHX_ PRIO_MIN);
914
915 if (!next)
916 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
917
918 /* free this only after the transfer */
919 coro_mortal = prev;
920 SV_CORO (prev, "Coro::schedule");
921
922 SvRV (GvSV (coro_current)) = next;
923
924 SV_CORO (next, "Coro::schedule");
925
926 UNLOCK;
927
928 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
929 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
930 }
931
932 static void
933 api_cede (void)
934 {
935 dTHX;
936
937 LOCK;
938 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
939 UNLOCK;
940
941 api_schedule ();
942 }
943
944 MODULE = Coro::State PACKAGE = Coro::State
945
946 PROTOTYPES: ENABLE
947
948 BOOT:
949 { /* {} necessary for stoopid perl-5.6.x */
950 #ifdef USE_ITHREADS
951 MUTEX_INIT (&coro_mutex);
952 #endif
953
954 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
955 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
956 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
957
958 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
959 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
960 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
961 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
962
963 main_mainstack = PL_mainstack;
964
965 coroapi.ver = CORO_API_VERSION;
966 coroapi.transfer = api_transfer;
967 }
968
969 Coro::State
970 _newprocess(args)
971 SV * args
972 PROTOTYPE: $
973 CODE:
974 Coro__State coro;
975
976 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
977 croak ("Coro::State::_newprocess expects an arrayref");
978
979 Newz (0, coro, 1, struct coro);
980
981 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
982 coro->mainstack = 0; /* actual work is done inside transfer */
983 coro->stack = 0;
984
985 /* same as JMPENV_BOOTSTRAP */
986 /* we might be able to recycle start_env, but safe is safe */
987 //Zero(&coro->start_env, 1, JMPENV);
988 coro->start_env.je_ret = -1;
989 coro->start_env.je_mustcatch = TRUE;
990
991 RETVAL = coro;
992 OUTPUT:
993 RETVAL
994
995 void
996 transfer(prev, next, flags)
997 SV *prev
998 SV *next
999 int flags
1000 PROTOTYPE: @
1001 CODE:
1002 PUTBACK;
1003 SV_CORO (next, "Coro::transfer");
1004 SV_CORO (prev, "Coro::transfer");
1005 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
1006 SPAGAIN;
1007
1008 void
1009 DESTROY(coro)
1010 Coro::State coro
1011 CODE:
1012
1013 if (coro->mainstack && coro->mainstack != main_mainstack)
1014 {
1015 struct coro temp;
1016
1017 PUTBACK;
1018 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
1019 LOAD(aTHX_ coro);
1020 SPAGAIN;
1021
1022 destroy_stacks (aTHX);
1023
1024 LOAD((&temp)); /* this will get rid of defsv etc.. */
1025 SPAGAIN;
1026
1027 coro->mainstack = 0;
1028 }
1029
1030 deallocate_stack (coro);
1031 SvREFCNT_dec (coro->args);
1032 Safefree (coro);
1033
1034 void
1035 _exit(code)
1036 int code
1037 PROTOTYPE: $
1038 CODE:
1039 _exit (code);
1040
1041 MODULE = Coro::State PACKAGE = Coro::Cont
1042
1043 # this is slightly dirty (should expose a c-level api)
1044
1045 void
1046 yield(...)
1047 PROTOTYPE: @
1048 CODE:
1049 static SV *returnstk;
1050 SV *sv;
1051 AV *defav = GvAV (PL_defgv);
1052 struct coro *prev, *next;
1053
1054 if (!returnstk)
1055 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
1056
1057 /* set up @_ -- ugly */
1058 av_clear (defav);
1059 av_fill (defav, items - 1);
1060 while (items--)
1061 av_store (defav, items, SvREFCNT_inc (ST(items)));
1062
1063 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1064 sv = av_pop ((AV *)SvRV (returnstk));
1065 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1066 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1067 SvREFCNT_dec (sv);
1068
1069 transfer(aTHX_ prev, next, 0);
1070
1071 MODULE = Coro::State PACKAGE = Coro
1072
1073 # this is slightly dirty (should expose a c-level api)
1074
1075 BOOT:
1076 {
1077 int i;
1078 HV *stash = gv_stashpv ("Coro", TRUE);
1079
1080 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
1081 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1082 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1083 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
1084 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1085 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
1086
1087 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1088 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1089
1090 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1091 coro_ready[i] = newAV ();
1092
1093 {
1094 SV *sv = perl_get_sv("Coro::API", 1);
1095
1096 coroapi.schedule = api_schedule;
1097 coroapi.cede = api_cede;
1098 coroapi.ready = api_ready;
1099 coroapi.nready = &coro_nready;
1100 coroapi.current = coro_current;
1101
1102 GCoroAPI = &coroapi;
1103 sv_setiv(sv, (IV)&coroapi);
1104 SvREADONLY_on(sv);
1105 }
1106 }
1107
1108 #if !PERL_MICRO
1109
1110 void
1111 ready(self)
1112 SV * self
1113 PROTOTYPE: $
1114 CODE:
1115 api_ready (self);
1116
1117 #endif
1118
1119 int
1120 nready(...)
1121 PROTOTYPE:
1122 CODE:
1123 RETVAL = coro_nready;
1124 OUTPUT:
1125 RETVAL
1126
1127 void
1128 schedule(...)
1129 PROTOTYPE:
1130 CODE:
1131 api_schedule ();
1132
1133 void
1134 cede(...)
1135 PROTOTYPE:
1136 CODE:
1137 api_cede ();
1138