ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
Revision: 1.51
Committed: Sun Nov 30 17:03:48 2003 UTC (20 years, 5 months ago) by pcg
Branch: MAIN
Changes since 1.50: +2 -2 lines
Log Message:
*** empty log message ***

File Contents

# Content
1 #include "EXTERN.h"
2 #include "perl.h"
3 #include "XSUB.h"
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
28 #include "libcoro/coro.c"
29
30 #include <signal.h>
31
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
58 static struct CoroAPI coroapi;
59
60 /* this is actually not only the c stack but also c registers etc... */
61 typedef 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
72 struct 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
81 /* optionally saved, might be zero */
82 AV *defav;
83 SV *defsv;
84 SV *errsv;
85
86 /* saved global state not related to stacks */
87 U8 dowarn;
88 I32 in_eval;
89
90 /* the stacks and related info (callchain etc..) */
91 PERL_SI *curstackinfo;
92 AV *curstack;
93 AV *mainstack;
94 SV **stack_sp;
95 OP *op;
96 SV **curpad;
97 AV *comppad;
98 SV **stack_base;
99 SV **stack_max;
100 SV **tmps_stack;
101 I32 tmps_floor;
102 I32 tmps_ix;
103 I32 tmps_max;
104 I32 *markstack;
105 I32 *markstack_ptr;
106 I32 *markstack_max;
107 I32 *scopestack;
108 I32 scopestack_ix;
109 I32 scopestack_max;
110 ANY *savestack;
111 I32 savestack_ix;
112 I32 savestack_max;
113 OP **retstack;
114 I32 retstack_ix;
115 I32 retstack_max;
116 COP *curcop;
117 JMPENV *top_env;
118
119 /* data associated with this coroutine (initial args) */
120 AV *args;
121 };
122
123 typedef struct coro *Coro__State;
124 typedef struct coro *Coro__State_or_hashref;
125
126 static AV *main_mainstack; /* used to differentiate between $main and others */
127 static HV *coro_state_stash;
128 static SV *ucoro_state_sv;
129 static U32 ucoro_state_hash;
130 static HV *padlist_cache;
131 static SV *coro_mortal; /* will be freed after next transfer */
132
133 /* mostly copied from op.c:cv_clone2 */
134 STATIC AV *
135 clone_padlist (AV *protopadlist)
136 {
137 AV *av;
138 I32 ix;
139 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
140 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
141 SV **pname = AvARRAY (protopad_name);
142 SV **ppad = AvARRAY (protopad);
143 I32 fname = AvFILLp (protopad_name);
144 I32 fpad = AvFILLp (protopad);
145 AV *newpadlist, *newpad_name, *newpad;
146 SV **npad;
147
148 newpad_name = newAV ();
149 for (ix = fname; ix >= 0; ix--)
150 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
151
152 newpad = newAV ();
153 av_fill (newpad, AvFILLp (protopad));
154 npad = AvARRAY (newpad);
155
156 newpadlist = newAV ();
157 AvREAL_off (newpadlist);
158 av_store (newpadlist, 0, (SV *) newpad_name);
159 av_store (newpadlist, 1, (SV *) newpad);
160
161 av = newAV (); /* will be @_ */
162 av_extend (av, 0);
163 av_store (newpad, 0, (SV *) av);
164 AvFLAGS (av) = AVf_REIFY;
165
166 for (ix = fpad; ix > 0; ix--)
167 {
168 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
169 if (namesv && namesv != &PL_sv_undef)
170 {
171 char *name = SvPVX (namesv); /* XXX */
172 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
173 { /* lexical from outside? */
174 npad[ix] = SvREFCNT_inc (ppad[ix]);
175 }
176 else
177 { /* our own lexical */
178 SV *sv;
179 if (*name == '&')
180 sv = SvREFCNT_inc (ppad[ix]);
181 else if (*name == '@')
182 sv = (SV *) newAV ();
183 else if (*name == '%')
184 sv = (SV *) newHV ();
185 else
186 sv = NEWSV (0, 0);
187 #ifdef SvPADBUSY
188 if (!SvPADBUSY (sv))
189 #endif
190 SvPADMY_on (sv);
191 npad[ix] = sv;
192 }
193 }
194 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
195 {
196 npad[ix] = SvREFCNT_inc (ppad[ix]);
197 }
198 else
199 {
200 SV *sv = NEWSV (0, 0);
201 SvPADTMP_on (sv);
202 npad[ix] = sv;
203 }
204 }
205
206 #if 0 /* return -ENOTUNDERSTOOD */
207 /* Now that vars are all in place, clone nested closures. */
208
209 for (ix = fpad; ix > 0; ix--) {
210 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
211 if (namesv
212 && namesv != &PL_sv_undef
213 && !(SvFLAGS(namesv) & SVf_FAKE)
214 && *SvPVX(namesv) == '&'
215 && CvCLONE(ppad[ix]))
216 {
217 CV *kid = cv_clone((CV*)ppad[ix]);
218 SvREFCNT_dec(ppad[ix]);
219 CvCLONE_on(kid);
220 SvPADMY_on(kid);
221 npad[ix] = (SV*)kid;
222 }
223 }
224 #endif
225
226 return newpadlist;
227 }
228
229 STATIC void
230 free_padlist (AV *padlist)
231 {
232 /* may be during global destruction */
233 if (SvREFCNT (padlist))
234 {
235 I32 i = AvFILLp (padlist);
236 while (i >= 0)
237 {
238 SV **svp = av_fetch (padlist, i--, FALSE);
239 if (svp)
240 {
241 SV *sv;
242 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
243 SvREFCNT_dec (sv);
244
245 SvREFCNT_dec (*svp);
246 }
247 }
248
249 SvREFCNT_dec ((SV*)padlist);
250 }
251 }
252
253 STATIC int
254 coro_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
266 static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
267
268 /* the next two functions merely cache the padlists */
269 STATIC void
270 get_padlist (CV *cv)
271 {
272 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
273
274 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
275 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
276 else
277 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
278 }
279
280 STATIC void
281 put_padlist (CV *cv)
282 {
283 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
284
285 if (!mg)
286 {
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;
290 mg->mg_obj = (SV *)newAV ();
291 }
292
293 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
294 }
295
296 #define SB do {
297 #define SE } while (0)
298
299 #define LOAD(state) load_state(aTHX_ (state));
300 #define SAVE(state,flags) save_state(aTHX_ (state),(flags));
301
302 #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
303
304 static void
305 load_state(pTHX_ Coro__State c)
306 {
307 PL_dowarn = c->dowarn;
308 PL_in_eval = c->in_eval;
309
310 PL_curstackinfo = c->curstackinfo;
311 PL_curstack = c->curstack;
312 PL_mainstack = c->mainstack;
313 PL_stack_sp = c->stack_sp;
314 PL_op = c->op;
315 PL_curpad = c->curpad;
316 PL_comppad = c->comppad;
317 PL_stack_base = c->stack_base;
318 PL_stack_max = c->stack_max;
319 PL_tmps_stack = c->tmps_stack;
320 PL_tmps_floor = c->tmps_floor;
321 PL_tmps_ix = c->tmps_ix;
322 PL_tmps_max = c->tmps_max;
323 PL_markstack = c->markstack;
324 PL_markstack_ptr = c->markstack_ptr;
325 PL_markstack_max = c->markstack_max;
326 PL_scopestack = c->scopestack;
327 PL_scopestack_ix = c->scopestack_ix;
328 PL_scopestack_max = c->scopestack_max;
329 PL_savestack = c->savestack;
330 PL_savestack_ix = c->savestack_ix;
331 PL_savestack_max = c->savestack_max;
332 PL_retstack = c->retstack;
333 PL_retstack_ix = c->retstack_ix;
334 PL_retstack_max = c->retstack_max;
335 PL_curcop = c->curcop;
336 PL_top_env = c->top_env;
337
338 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
339 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
340 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
341
342 {
343 dSP;
344 CV *cv;
345
346 /* now do the ugly restore mess */
347 while ((cv = (CV *)POPs))
348 {
349 AV *padlist = (AV *)POPs;
350
351 if (padlist)
352 {
353 put_padlist (cv); /* mark this padlist as available */
354 CvPADLIST(cv) = padlist;
355 #ifdef USE_THREADS
356 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
357 #endif
358 }
359
360 ++CvDEPTH(cv);
361 }
362
363 PUTBACK;
364 }
365 }
366
367 static void
368 save_state(pTHX_ Coro__State c, int flags)
369 {
370 {
371 dSP;
372 I32 cxix = cxstack_ix;
373 PERL_CONTEXT *ccstk = cxstack;
374 PERL_SI *top_si = PL_curstackinfo;
375
376 /*
377 * the worst thing you can imagine happens first - we have to save
378 * (and reinitialize) all cv's in the whole callchain :(
379 */
380
381 PUSHs (Nullsv);
382 /* this loop was inspired by pp_caller */
383 for (;;)
384 {
385 while (cxix >= 0)
386 {
387 PERL_CONTEXT *cx = &ccstk[cxix--];
388
389 if (CxTYPE(cx) == CXt_SUB)
390 {
391 CV *cv = cx->blk_sub.cv;
392 if (CvDEPTH(cv))
393 {
394 #ifdef USE_THREADS
395 /*XPUSHs ((SV *)CvOWNER(cv));*/
396 /*CvOWNER(cv) = 0;*/
397 /*error must unlock this cv etc.. etc...*/
398 #endif
399 EXTEND (SP, CvDEPTH(cv)*2);
400
401 while (--CvDEPTH(cv))
402 {
403 /* this tells the restore code to increment CvDEPTH */
404 PUSHs (Nullsv);
405 PUSHs ((SV *)cv);
406 }
407
408 PUSHs ((SV *)CvPADLIST(cv));
409 PUSHs ((SV *)cv);
410
411 get_padlist (cv); /* this is a monster */
412 }
413 }
414 #ifdef CXt_FORMAT
415 else if (CxTYPE(cx) == CXt_FORMAT)
416 {
417 /* I never used formats, so how should I know how these are implemented? */
418 /* my bold guess is as a simple, plain sub... */
419 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
420 }
421 #endif
422 }
423
424 if (top_si->si_type == PERLSI_MAIN)
425 break;
426
427 top_si = top_si->si_prev;
428 ccstk = top_si->si_cxstack;
429 cxix = top_si->si_cxix;
430 }
431
432 PUTBACK;
433 }
434
435 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
436 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
437 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
438
439 c->dowarn = PL_dowarn;
440 c->in_eval = PL_in_eval;
441
442 c->curstackinfo = PL_curstackinfo;
443 c->curstack = PL_curstack;
444 c->mainstack = PL_mainstack;
445 c->stack_sp = PL_stack_sp;
446 c->op = PL_op;
447 c->curpad = PL_curpad;
448 c->comppad = PL_comppad;
449 c->stack_base = PL_stack_base;
450 c->stack_max = PL_stack_max;
451 c->tmps_stack = PL_tmps_stack;
452 c->tmps_floor = PL_tmps_floor;
453 c->tmps_ix = PL_tmps_ix;
454 c->tmps_max = PL_tmps_max;
455 c->markstack = PL_markstack;
456 c->markstack_ptr = PL_markstack_ptr;
457 c->markstack_max = PL_markstack_max;
458 c->scopestack = PL_scopestack;
459 c->scopestack_ix = PL_scopestack_ix;
460 c->scopestack_max = PL_scopestack_max;
461 c->savestack = PL_savestack;
462 c->savestack_ix = PL_savestack_ix;
463 c->savestack_max = PL_savestack_max;
464 c->retstack = PL_retstack;
465 c->retstack_ix = PL_retstack_ix;
466 c->retstack_max = PL_retstack_max;
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 assumption that coroutines do not usually need
475 * a lot of stackspace.
476 */
477 STATIC void
478 coro_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;
513 }
514
515 /*
516 * destroy the stacks, the callchain etc...
517 */
518 STATIC void
519 destroy_stacks(pTHX)
520 {
521 if (!IN_DESTRUCT)
522 {
523 /* is this ugly, I ask? */
524 while (PL_scopestack_ix)
525 LEAVE;
526
527 /* sure it is, but more important: is it correct?? :/ */
528 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
529 FREETMPS;
530 }
531
532 while (PL_curstackinfo->si_next)
533 PL_curstackinfo = PL_curstackinfo->si_next;
534
535 while (PL_curstackinfo)
536 {
537 PERL_SI *p = PL_curstackinfo->si_prev;
538
539 {
540 dSP;
541 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
542 PUTBACK; /* possibly superfluous */
543 }
544
545 if (!IN_DESTRUCT)
546 {
547 dounwind(-1);
548 SvREFCNT_dec(PL_curstackinfo->si_stack);
549 }
550
551 Safefree(PL_curstackinfo->si_cxstack);
552 Safefree(PL_curstackinfo);
553 PL_curstackinfo = p;
554 }
555
556 Safefree(PL_tmps_stack);
557 Safefree(PL_markstack);
558 Safefree(PL_scopestack);
559 Safefree(PL_savestack);
560 Safefree(PL_retstack);
561 }
562
563 static void
564 allocate_stack (Coro__State ctx, int alloc)
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 {
575 #if HAVE_MMAP
576 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
577 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
578 if (stack->sptr == (void *)-1)
579 #endif
580 {
581 /*FIXME*//*D*//* reasonable stack size! */
582 stack->ssize = - (16384 * sizeof (long));
583 New (0, stack->sptr, 16384, long);
584 }
585 }
586 else
587 stack->sptr = 0;
588
589 ctx->stack = stack;
590 }
591
592 static void
593 deallocate_stack (Coro__State ctx)
594 {
595 coro_stack *stack = ctx->stack;
596
597 ctx->stack = 0;
598
599 if (stack)
600 {
601 if (!--stack->refcnt)
602 {
603 #ifdef HAVE_MMAP
604 if (stack->ssize > 0 && stack->sptr)
605 munmap (stack->sptr, stack->ssize);
606 else
607 #endif
608 Safefree (stack->sptr);
609
610 Safefree (stack);
611 }
612 else if (ctx->gencnt == stack->gencnt)
613 --stack->usecnt;
614 }
615 }
616
617 static void
618 setup_coro (void *arg)
619 {
620 /*
621 * emulate part of the perl startup here.
622 */
623 dSP;
624 Coro__State ctx = (Coro__State)arg;
625 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
626
627 coro_init_stacks (aTHX);
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
633 SPAGAIN;
634
635 if (ctx->stack)
636 {
637 ctx->cursp = 0;
638
639 PUSHMARK(SP);
640 PUTBACK;
641 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
642
643 if (SvTRUE (ERRSV))
644 croak (NULL);
645 else
646 croak ("FATAL: CCTXT coroutine returned!");
647 }
648 else
649 {
650 UNOP myop;
651
652 PL_op = (OP *)&myop;
653
654 Zero(&myop, 1, UNOP);
655 myop.op_next = Nullop;
656 myop.op_flags = OPf_WANT_VOID;
657
658 PUSHMARK(SP);
659 XPUSHs (sub_init);
660 /*
661 * the next line is slightly wrong, as PL_op->op_next
662 * is actually being executed so we skip the first op.
663 * that doesn't matter, though, since it is only
664 * pp_nextstate and we never return...
665 * ah yes, and I don't care anyways ;)
666 */
667 PUTBACK;
668 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
669 SPAGAIN;
670
671 ENTER; /* necessary e.g. for dounwind */
672 }
673 }
674
675 static void
676 continue_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
693 STATIC void
694 transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
695 {
696 dSTACKLEVEL;
697 static struct coro *xnext;
698
699 if (prev != next)
700 {
701 xnext = next;
702
703 if (next->mainstack)
704 {
705 SAVE (prev, flags);
706 LOAD (next);
707
708 /* mark this state as in-use */
709 next->mainstack = 0;
710 next->tmps_ix = -2;
711
712 /* stacklevel changed? if yes, grab the stack for us! */
713 if (flags & TRANSFER_SAVE_CCTXT)
714 {
715 if (!prev->stack)
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 }
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
734 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
735 /* don't add any code here */
736 }
737
738 }
739 else if (next->tmps_ix == -2)
740 croak ("tried to transfer to running coroutine");
741 else
742 {
743 SAVE (prev, -1); /* first get rid of the old state */
744
745 if (flags & TRANSFER_SAVE_CCTXT)
746 {
747 if (!prev->stack)
748 allocate_stack (prev, 0);
749
750 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
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);
764 allocate_stack (next, 1);
765 coro_create (&(next->stack->cctx),
766 setup_coro, (void *)next,
767 next->stack->sptr, labs (next->stack->ssize));
768 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
769 /* don't add any code here */
770 }
771 }
772 else
773 setup_coro (next);
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;
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
814 static void
815 api_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 */
833 static GV *coro_current, *coro_idle;
834 static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
835 static int coro_nready;
836
837 static void
838 coro_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
858 static SV *
859 coro_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
877 static void
878 api_ready (SV *coro)
879 {
880 if (SvROK (coro))
881 coro = SvRV (coro);
882
883 coro_enq (SvREFCNT_inc (coro));
884 }
885
886 static void
887 api_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
909 static void
910 api_cede (void)
911 {
912 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
913
914 api_schedule ();
915 }
916
917 MODULE = Coro::State PACKAGE = Coro::State
918
919 PROTOTYPES: ENABLE
920
921 BOOT:
922 { /* {} necessary for stoopid perl-5.6.x */
923 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
924 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
925 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
926
927 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
928 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
929 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
930 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
931
932 if (!padlist_cache)
933 padlist_cache = newHV ();
934
935 main_mainstack = PL_mainstack;
936
937 coroapi.ver = CORO_API_VERSION;
938 coroapi.transfer = api_transfer;
939 }
940
941 Coro::State
942 _newprocess(args)
943 SV * args
944 PROTOTYPE: $
945 CODE:
946 Coro__State coro;
947
948 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
949 croak ("Coro::State::_newprocess expects an arrayref");
950
951 Newz (0, coro, 1, struct coro);
952
953 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
954 coro->mainstack = 0; /* actual work is done inside transfer */
955 coro->stack = 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;
962
963 RETVAL = coro;
964 OUTPUT:
965 RETVAL
966
967 void
968 transfer(prev, next, flags)
969 SV *prev
970 SV *next
971 int flags
972 PROTOTYPE: @
973 CODE:
974 PUTBACK;
975 SV_CORO (next, "Coro::transfer");
976 SV_CORO (prev, "Coro::transfer");
977 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
978 SPAGAIN;
979
980 void
981 DESTROY(coro)
982 Coro::State coro
983 CODE:
984
985 if (coro->mainstack && coro->mainstack != main_mainstack)
986 {
987 struct coro temp;
988
989 PUTBACK;
990 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
991 LOAD(aTHX_ coro);
992 SPAGAIN;
993
994 destroy_stacks (aTHX);
995
996 LOAD((&temp)); /* this will get rid of defsv etc.. */
997 SPAGAIN;
998
999 coro->mainstack = 0;
1000 }
1001
1002 deallocate_stack (coro);
1003 SvREFCNT_dec (coro->args);
1004 Safefree (coro);
1005
1006 void
1007 _exit(code)
1008 int code
1009 PROTOTYPE: $
1010 CODE:
1011 #if defined(__GLIBC__) || _POSIX_C_SOURCE
1012 _exit (code);
1013 #else
1014 signal (SIGTERM, SIG_DFL);
1015 raise (SIGTERM);
1016 exit (code);
1017 #endif
1018
1019 MODULE = Coro::State PACKAGE = Coro::Cont
1020
1021 # this is slightly dirty (should expose a c-level api)
1022
1023 void
1024 yield(...)
1025 PROTOTYPE: @
1026 CODE:
1027 static SV *returnstk;
1028 SV *sv;
1029 AV *defav = GvAV (PL_defgv);
1030 struct coro *prev, *next;
1031
1032 if (!returnstk)
1033 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
1034
1035 /* set up @_ -- ugly */
1036 av_clear (defav);
1037 av_fill (defav, items - 1);
1038 while (items--)
1039 av_store (defav, items, SvREFCNT_inc (ST(items)));
1040
1041 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1042 sv = av_pop ((AV *)SvRV (returnstk));
1043 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1044 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1045 SvREFCNT_dec (sv);
1046
1047 transfer(aTHX_ prev, next, 0);
1048
1049 MODULE = Coro::State PACKAGE = Coro
1050
1051 # this is slightly dirty (should expose a c-level api)
1052
1053 BOOT:
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
1088 void
1089 ready(self)
1090 SV * self
1091 PROTOTYPE: $
1092 CODE:
1093 api_ready (self);
1094
1095 #endif
1096
1097 int
1098 nready(...)
1099 PROTOTYPE:
1100 CODE:
1101 RETVAL = coro_nready;
1102 OUTPUT:
1103 RETVAL
1104
1105 void
1106 schedule(...)
1107 PROTOTYPE:
1108 CODE:
1109 api_schedule ();
1110
1111 void
1112 cede(...)
1113 PROTOTYPE:
1114 CODE:
1115 api_cede ();
1116