ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
Revision: 1.45
Committed: Tue May 27 01:15:31 2003 UTC (20 years, 11 months ago) by root
Branch: MAIN
Changes since 1.44: +12 -5 lines
Log Message:
*** empty log message ***

File Contents

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