ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
Revision: 1.67
Committed: Mon Dec 12 20:07:44 2005 UTC (18 years, 5 months ago) by root
Branch: MAIN
Changes since 1.66: +7 -3 lines
Log Message:
*** empty log message ***

File Contents

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