ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.22 by root, Sat Aug 11 23:10:56 2001 UTC vs.
Revision 1.147 by root, Mon Mar 19 15:50:48 2007 UTC

1#include "libcoro/coro.c"
2
3#define PERL_NO_GET_CONTEXT
4
1#include "EXTERN.h" 5#include "EXTERN.h"
2#include "perl.h" 6#include "perl.h"
3#include "XSUB.h" 7#include "XSUB.h"
4 8
5#include "libcoro/coro.c" 9#include "patchlevel.h"
6 10
7#include <signal.h> 11#include <stdio.h>
12#include <errno.h>
13#include <assert.h>
8 14
9#ifdef HAVE_MMAP 15#ifdef HAVE_MMAP
10# include <unistd.h> 16# include <unistd.h>
11# include <sys/mman.h> 17# include <sys/mman.h>
12# ifndef MAP_ANON
13# ifdef MAP_ANONYMOUS 18# ifndef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS 19# ifdef MAP_ANON
20# define MAP_ANONYMOUS MAP_ANON
15# else 21# else
16# undef HAVE_MMAP 22# undef HAVE_MMAP
17# endif 23# endif
18# endif 24# endif
25# include <limits.h>
26# ifndef PAGESIZE
27# define PAGESIZE pagesize
28# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
29static long pagesize;
30# else
31# define BOOT_PAGESIZE (void)0
19#endif 32# endif
20
21#define MAY_FLUSH /* increases codesize */
22
23/* perl-related */
24#define TRANSFER_SAVE_DEFAV 0x00000001
25#define TRANSFER_SAVE_DEFSV 0x00000002
26#define TRANSFER_SAVE_ERRSV 0x00000004
27/* c-related */
28#define TRANSFER_SAVE_CCTXT 0x00000008
29#ifdef CORO_LAZY_STACK
30# define TRANSFER_LAZY_STACK 0x00000010
31#else 33#else
32# define TRANSFER_LAZY_STACK 0x00000000 34# define PAGESIZE 0
35# define BOOT_PAGESIZE (void)0
36#endif
37
38#if CORO_USE_VALGRIND
39# include <valgrind/valgrind.h>
40# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
41#else
42# define REGISTER_STACK(cctx,start,end)
43#endif
44
45/* the maximum number of idle cctx that will be pooled */
46#define MAX_IDLE_CCTX 8
47
48#define PERL_VERSION_ATLEAST(a,b,c) \
49 (PERL_REVISION > (a) \
50 || (PERL_REVISION == (a) \
51 && (PERL_VERSION > (b) \
52 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
53
54#if !PERL_VERSION_ATLEAST (5,6,0)
55# ifndef PL_ppaddr
56# define PL_ppaddr ppaddr
33#endif 57# endif
58# ifndef call_sv
59# define call_sv perl_call_sv
60# endif
61# ifndef get_sv
62# define get_sv perl_get_sv
63# endif
64# ifndef get_cv
65# define get_cv perl_get_cv
66# endif
67# ifndef IS_PADGV
68# define IS_PADGV(v) 0
69# endif
70# ifndef IS_PADCONST
71# define IS_PADCONST(v) 0
72# endif
73#endif
34 74
35#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \ 75/* 5.8.7 */
36 |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT) 76#ifndef SvRV_set
77# define SvRV_set(s,v) SvRV(s) = (v)
78#endif
37 79
38#define SUB_INIT "Coro::State::initialize" 80#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
39#define UCORO_STATE "_coro_state" 81# undef CORO_STACKGUARD
82#endif
40 83
84#ifndef CORO_STACKGUARD
85# define CORO_STACKGUARD 0
86#endif
87
88/* prefer perl internal functions over our own? */
89#ifndef CORO_PREFER_PERL_FUNCTIONS
90# define CORO_PREFER_PERL_FUNCTIONS 0
91#endif
92
41/* The next macro should delcare a variable stacklevel that contains and approximation 93/* The next macro should declare a variable stacklevel that contains and approximation
42 * to the current C stack pointer. It's property is that it changes with each call 94 * to the current C stack pointer. Its property is that it changes with each call
43 * and should be unique. */ 95 * and should be unique. */
96#define dSTACKLEVEL int stacklevel
44#define dSTACKLEVEL void *stacklevel = &stacklevel 97#define STACKLEVEL ((void *)&stacklevel)
45 98
46#define labs(l) ((l) >= 0 ? (l) : -(l)) 99#define IN_DESTRUCT (PL_main_cv == Nullcv)
47 100
48/* this is actually not only the c stack but also c registers etc... */ 101#if __GNUC__ >= 3
102# define attribute(x) __attribute__(x)
103# define BARRIER __asm__ __volatile__ ("" : : : "memory")
104#else
105# define attribute(x)
106# define BARRIER
107#endif
108
109#define NOINLINE attribute ((noinline))
110
111#include "CoroAPI.h"
112
113#ifdef USE_ITHREADS
114static perl_mutex coro_mutex;
115# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
116# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
117#else
118# define LOCK (void)0
119# define UNLOCK (void)0
120#endif
121
122/* helper storage struct for Coro::AIO */
123struct io_state
124{
125 int errorno;
126 I32 laststype;
127 int laststatval;
128 Stat_t statcache;
129};
130
131static size_t coro_stacksize = CORO_STACKSIZE;
132static struct CoroAPI coroapi;
133static AV *main_mainstack; /* used to differentiate between $main and others */
134static HV *coro_state_stash, *coro_stash;
135static SV *coro_mortal; /* will be freed after next transfer */
136
137static struct coro_cctx *cctx_first;
138static int cctx_count, cctx_idle;
139
140/* this is a structure representing a c-level coroutine */
49typedef struct { 141typedef struct coro_cctx {
50 int refcnt; /* pointer reference counter */ 142 struct coro_cctx *next;
51 int usecnt; /* shared by how many coroutines */
52 int gencnt; /* generation counter */
53 143
144 /* the stack */
145 void *sptr;
146 size_t ssize;
147
148 /* cpu state */
149 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
150 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
151 JMPENV *top_env;
54 coro_context cctx; 152 coro_context cctx;
55 153
56 void *sptr; 154#if CORO_USE_VALGRIND
57 long ssize; /* positive == mmap, otherwise malloc */ 155 int valgrind_id;
58} coro_stack; 156#endif
157 char inuse, mapped;
158} coro_cctx;
59 159
160enum {
161 CF_RUNNING = 0x0001, /* coroutine is running */
162 CF_READY = 0x0002, /* coroutine is ready */
163 CF_NEW = 0x0004, /* has never been switched to */
164 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
165};
166
167/* this is a structure representing a perl-level coroutine */
60struct coro { 168struct coro {
61 /* the optional C context */ 169 /* the c coroutine allocated to this perl coroutine, if any */
62 coro_stack *stack; 170 coro_cctx *cctx;
63 void *cursp;
64 int gencnt;
65
66 /* optionally saved, might be zero */
67 AV *defav;
68 SV *defsv;
69 SV *errsv;
70
71 /* saved global state not related to stacks */
72 U8 dowarn;
73 I32 in_eval;
74
75 /* the stacks and related info (callchain etc..) */
76 PERL_SI *curstackinfo;
77 AV *curstack;
78 AV *mainstack;
79 SV **stack_sp;
80 OP *op;
81 SV **curpad;
82 SV **stack_base;
83 SV **stack_max;
84 SV **tmps_stack;
85 I32 tmps_floor;
86 I32 tmps_ix;
87 I32 tmps_max;
88 I32 *markstack;
89 I32 *markstack_ptr;
90 I32 *markstack_max;
91 I32 *scopestack;
92 I32 scopestack_ix;
93 I32 scopestack_max;
94 ANY *savestack;
95 I32 savestack_ix;
96 I32 savestack_max;
97 OP **retstack;
98 I32 retstack_ix;
99 I32 retstack_max;
100 COP *curcop;
101 JMPENV *top_env;
102 171
103 /* data associated with this coroutine (initial args) */ 172 /* data associated with this coroutine (initial args) */
104 AV *args; 173 AV *args;
174 int refcnt;
175 int save; /* CORO_SAVE flags */
176 int flags; /* CF_ flags */
177
178 /* optionally saved, might be zero */
179 AV *defav; /* @_ */
180 SV *defsv; /* $_ */
181 SV *errsv; /* $@ */
182 GV *deffh; /* default filehandle */
183 SV *irssv; /* $/ */
184 SV *irssv_sv; /* real $/ cache */
185
186#define VAR(name,type) type name;
187# include "state.h"
188#undef VAR
189
190 /* coro process data */
191 int prio;
105}; 192};
106 193
107typedef struct coro *Coro__State; 194typedef struct coro *Coro__State;
108typedef struct coro *Coro__State_or_hashref; 195typedef struct coro *Coro__State_or_hashref;
109
110static AV *main_mainstack; /* used to differentiate between $main and others */
111static HV *coro_state_stash;
112static SV *ucoro_state_sv;
113static U32 ucoro_state_hash;
114static HV *padlist_cache;
115
116/* mostly copied from op.c:cv_clone2 */
117STATIC AV *
118clone_padlist (AV *protopadlist)
119{
120 AV *av;
121 I32 ix;
122 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
123 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
124 SV **pname = AvARRAY (protopad_name);
125 SV **ppad = AvARRAY (protopad);
126 I32 fname = AvFILLp (protopad_name);
127 I32 fpad = AvFILLp (protopad);
128 AV *newpadlist, *newpad_name, *newpad;
129 SV **npad;
130
131 newpad_name = newAV ();
132 for (ix = fname; ix >= 0; ix--)
133 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
134
135 newpad = newAV ();
136 av_fill (newpad, AvFILLp (protopad));
137 npad = AvARRAY (newpad);
138
139 newpadlist = newAV ();
140 AvREAL_off (newpadlist);
141 av_store (newpadlist, 0, (SV *) newpad_name);
142 av_store (newpadlist, 1, (SV *) newpad);
143
144 av = newAV (); /* will be @_ */
145 av_extend (av, 0);
146 av_store (newpad, 0, (SV *) av);
147 AvFLAGS (av) = AVf_REIFY;
148
149 for (ix = fpad; ix > 0; ix--)
150 {
151 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
152 if (namesv && namesv != &PL_sv_undef)
153 {
154 char *name = SvPVX (namesv); /* XXX */
155 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
156 { /* lexical from outside? */
157 npad[ix] = SvREFCNT_inc (ppad[ix]);
158 }
159 else
160 { /* our own lexical */
161 SV *sv;
162 if (*name == '&')
163 sv = SvREFCNT_inc (ppad[ix]);
164 else if (*name == '@')
165 sv = (SV *) newAV ();
166 else if (*name == '%')
167 sv = (SV *) newHV ();
168 else
169 sv = NEWSV (0, 0);
170 if (!SvPADBUSY (sv))
171 SvPADMY_on (sv);
172 npad[ix] = sv;
173 }
174 }
175 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
176 {
177 npad[ix] = SvREFCNT_inc (ppad[ix]);
178 }
179 else
180 {
181 SV *sv = NEWSV (0, 0);
182 SvPADTMP_on (sv);
183 npad[ix] = sv;
184 }
185 }
186
187#if 0 /* return -ENOTUNDERSTOOD */
188 /* Now that vars are all in place, clone nested closures. */
189
190 for (ix = fpad; ix > 0; ix--) {
191 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
192 if (namesv
193 && namesv != &PL_sv_undef
194 && !(SvFLAGS(namesv) & SVf_FAKE)
195 && *SvPVX(namesv) == '&'
196 && CvCLONE(ppad[ix]))
197 {
198 CV *kid = cv_clone((CV*)ppad[ix]);
199 SvREFCNT_dec(ppad[ix]);
200 CvCLONE_on(kid);
201 SvPADMY_on(kid);
202 npad[ix] = (SV*)kid;
203 }
204 }
205#endif
206
207 return newpadlist;
208}
209
210#ifdef MAY_FLUSH
211STATIC AV *
212free_padlist (AV *padlist)
213{
214 /* may be during global destruction */
215 if (SvREFCNT(padlist))
216 {
217 I32 i = AvFILLp(padlist);
218 while (i >= 0)
219 {
220 SV **svp = av_fetch(padlist, i--, FALSE);
221 SV *sv = svp ? *svp : Nullsv;
222 if (sv)
223 SvREFCNT_dec(sv);
224 }
225
226 SvREFCNT_dec((SV*)padlist);
227 }
228}
229#endif
230
231/* the next two functions merely cache the padlists */
232STATIC void
233get_padlist (CV *cv)
234{
235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
236
237 if (he && AvFILLp ((AV *)*he) >= 0)
238 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
239 else
240 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
241}
242
243STATIC void
244put_padlist (CV *cv)
245{
246 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
247
248 if (SvTYPE (*he) != SVt_PVAV)
249 {
250 SvREFCNT_dec (*he);
251 *he = (SV *)newAV ();
252 }
253
254 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
255}
256
257#ifdef MAY_FLUSH
258STATIC void
259flush_padlist_cache ()
260{
261 HV *hv = padlist_cache;
262 padlist_cache = newHV ();
263
264 if (hv_iterinit (hv))
265 {
266 HE *he;
267 AV *padlist;
268
269 while (!!(he = hv_iternext (hv)))
270 {
271 AV *av = (AV *)HeVAL(he);
272
273 /* casting is fun. */
274 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
275 free_padlist (padlist);
276 }
277 }
278
279 SvREFCNT_dec (hv);
280}
281#endif
282
283#define SB do {
284#define SE } while (0)
285
286#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
287#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
288
289#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
290
291static void
292load_state(pTHX_ Coro__State c)
293{
294 PL_dowarn = c->dowarn;
295 PL_in_eval = c->in_eval;
296
297 PL_curstackinfo = c->curstackinfo;
298 PL_curstack = c->curstack;
299 PL_mainstack = c->mainstack;
300 PL_stack_sp = c->stack_sp;
301 PL_op = c->op;
302 PL_curpad = c->curpad;
303 PL_stack_base = c->stack_base;
304 PL_stack_max = c->stack_max;
305 PL_tmps_stack = c->tmps_stack;
306 PL_tmps_floor = c->tmps_floor;
307 PL_tmps_ix = c->tmps_ix;
308 PL_tmps_max = c->tmps_max;
309 PL_markstack = c->markstack;
310 PL_markstack_ptr = c->markstack_ptr;
311 PL_markstack_max = c->markstack_max;
312 PL_scopestack = c->scopestack;
313 PL_scopestack_ix = c->scopestack_ix;
314 PL_scopestack_max = c->scopestack_max;
315 PL_savestack = c->savestack;
316 PL_savestack_ix = c->savestack_ix;
317 PL_savestack_max = c->savestack_max;
318 PL_retstack = c->retstack;
319 PL_retstack_ix = c->retstack_ix;
320 PL_retstack_max = c->retstack_max;
321 PL_curcop = c->curcop;
322 PL_top_env = c->top_env;
323
324 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
325 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
326 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
327
328 {
329 dSP;
330 CV *cv;
331
332 /* now do the ugly restore mess */
333 while ((cv = (CV *)POPs))
334 {
335 AV *padlist = (AV *)POPs;
336
337 if (padlist)
338 {
339 put_padlist (cv); /* mark this padlist as available */
340 CvPADLIST(cv) = padlist;
341#ifdef USE_THREADS
342 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
343#endif
344 }
345
346 ++CvDEPTH(cv);
347 }
348
349 PUTBACK;
350 }
351}
352
353static void
354save_state(pTHX_ Coro__State c, int flags)
355{
356 {
357 dSP;
358 I32 cxix = cxstack_ix;
359 PERL_CONTEXT *ccstk = cxstack;
360 PERL_SI *top_si = PL_curstackinfo;
361
362 /*
363 * the worst thing you can imagine happens first - we have to save
364 * (and reinitialize) all cv's in the whole callchain :(
365 */
366
367 PUSHs (Nullsv);
368 /* this loop was inspired by pp_caller */
369 for (;;)
370 {
371 do
372 {
373 PERL_CONTEXT *cx = &ccstk[cxix--];
374
375 if (CxTYPE(cx) == CXt_SUB)
376 {
377 CV *cv = cx->blk_sub.cv;
378 if (CvDEPTH(cv))
379 {
380#ifdef USE_THREADS
381 /*XPUSHs ((SV *)CvOWNER(cv));*/
382 /*CvOWNER(cv) = 0;*/
383 /*error must unlock this cv etc.. etc...*/
384#endif
385 EXTEND (SP, CvDEPTH(cv)*2);
386
387 while (--CvDEPTH(cv))
388 {
389 /* this tells the restore code to increment CvDEPTH */
390 PUSHs (Nullsv);
391 PUSHs ((SV *)cv);
392 }
393
394 PUSHs ((SV *)CvPADLIST(cv));
395 PUSHs ((SV *)cv);
396
397 get_padlist (cv); /* this is a monster */
398 }
399 }
400 else if (CxTYPE(cx) == CXt_FORMAT)
401 {
402 /* I never used formats, so how should I know how these are implemented? */
403 /* my bold guess is as a simple, plain sub... */
404 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
405 }
406 }
407 while (cxix >= 0);
408
409 if (top_si->si_type == PERLSI_MAIN)
410 break;
411
412 top_si = top_si->si_prev;
413 ccstk = top_si->si_cxstack;
414 cxix = top_si->si_cxix;
415 }
416
417 PUTBACK;
418 }
419
420 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
421 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
422 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
423
424 /* I have not the slightest idea of why av_reify is necessary */
425 /* but if it's missing the defav contents magically get replaced sometimes */
426 if (c->defav)
427 av_reify (c->defav);
428
429 c->dowarn = PL_dowarn;
430 c->in_eval = PL_in_eval;
431
432 c->curstackinfo = PL_curstackinfo;
433 c->curstack = PL_curstack;
434 c->mainstack = PL_mainstack;
435 c->stack_sp = PL_stack_sp;
436 c->op = PL_op;
437 c->curpad = PL_curpad;
438 c->stack_base = PL_stack_base;
439 c->stack_max = PL_stack_max;
440 c->tmps_stack = PL_tmps_stack;
441 c->tmps_floor = PL_tmps_floor;
442 c->tmps_ix = PL_tmps_ix;
443 c->tmps_max = PL_tmps_max;
444 c->markstack = PL_markstack;
445 c->markstack_ptr = PL_markstack_ptr;
446 c->markstack_max = PL_markstack_max;
447 c->scopestack = PL_scopestack;
448 c->scopestack_ix = PL_scopestack_ix;
449 c->scopestack_max = PL_scopestack_max;
450 c->savestack = PL_savestack;
451 c->savestack_ix = PL_savestack_ix;
452 c->savestack_max = PL_savestack_max;
453 c->retstack = PL_retstack;
454 c->retstack_ix = PL_retstack_ix;
455 c->retstack_max = PL_retstack_max;
456 c->curcop = PL_curcop;
457 c->top_env = PL_top_env;
458}
459
460/*
461 * allocate various perl stacks. This is an exact copy
462 * of perl.c:init_stacks, except that it uses less memory
463 * on the assumption that coroutines do not usually need
464 * a lot of stackspace.
465 */
466STATIC void
467coro_init_stacks (pTHX)
468{
469 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
470 PL_curstackinfo->si_type = PERLSI_MAIN;
471 PL_curstack = PL_curstackinfo->si_stack;
472 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
473
474 PL_stack_base = AvARRAY(PL_curstack);
475 PL_stack_sp = PL_stack_base;
476 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
477
478 New(50,PL_tmps_stack,96,SV*);
479 PL_tmps_floor = -1;
480 PL_tmps_ix = -1;
481 PL_tmps_max = 96;
482
483 New(54,PL_markstack,16,I32);
484 PL_markstack_ptr = PL_markstack;
485 PL_markstack_max = PL_markstack + 16;
486
487 SET_MARK_OFFSET;
488
489 New(54,PL_scopestack,16,I32);
490 PL_scopestack_ix = 0;
491 PL_scopestack_max = 16;
492
493 New(54,PL_savestack,96,ANY);
494 PL_savestack_ix = 0;
495 PL_savestack_max = 96;
496
497 New(54,PL_retstack,8,OP*);
498 PL_retstack_ix = 0;
499 PL_retstack_max = 8;
500}
501
502/*
503 * destroy the stacks, the callchain etc...
504 * still there is a memleak of 128 bytes...
505 */
506STATIC void
507destroy_stacks(pTHX)
508{
509 /* is this ugly, I ask? */
510 while (PL_scopestack_ix)
511 LEAVE;
512
513 /* sure it is, but more important: is it correct?? :/ */
514 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
515 FREETMPS;
516
517 while (PL_curstackinfo->si_next)
518 PL_curstackinfo = PL_curstackinfo->si_next;
519
520 while (PL_curstackinfo)
521 {
522 PERL_SI *p = PL_curstackinfo->si_prev;
523
524 {
525 dSP;
526 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
527 PUTBACK; /* possibly superfluous */
528 }
529
530 dounwind(-1);
531
532 SvREFCNT_dec(PL_curstackinfo->si_stack);
533 Safefree(PL_curstackinfo->si_cxstack);
534 Safefree(PL_curstackinfo);
535 PL_curstackinfo = p;
536 }
537
538 Safefree(PL_tmps_stack);
539 Safefree(PL_markstack);
540 Safefree(PL_scopestack);
541 Safefree(PL_savestack);
542 Safefree(PL_retstack);
543}
544
545static void
546allocate_stack (Coro__State ctx, int alloc)
547{
548 coro_stack *stack;
549
550 New (0, stack, 1, coro_stack);
551
552 stack->refcnt = 1;
553 stack->usecnt = 1;
554 stack->gencnt = ctx->gencnt = 0;
555 if (alloc)
556 {
557#ifdef HAVE_MMAP
558 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
559 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
560 if (stack->sptr == (void *)-1)
561#endif
562 {
563 /*FIXME*//*D*//* reasonable stack size! */
564 stack->ssize = -4096 * sizeof (long);
565 New (0, stack->sptr, 4096, long);
566 }
567 }
568 else
569 stack->sptr = 0;
570
571 ctx->stack = stack;
572}
573
574static void
575deallocate_stack (Coro__State ctx)
576{
577 coro_stack *stack = ctx->stack;
578
579 ctx->stack = 0;
580
581 if (stack)
582 {
583 if (!--stack->refcnt)
584 {
585#ifdef HAVE_MMAP
586 if (stack->ssize > 0 && stack->sptr)
587 munmap (stack->sptr, stack->ssize);
588 else
589#else
590 Safefree (stack->sptr);
591#endif
592 Safefree (stack);
593 }
594 else if (ctx->gencnt == stack->gencnt)
595 --stack->usecnt;
596 }
597}
598
599static void
600setup_coro (void *arg)
601{
602 /*
603 * emulate part of the perl startup here.
604 */
605 dSP;
606 Coro__State ctx = (Coro__State)arg;
607 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
608
609 coro_init_stacks (aTHX);
610 /*PL_curcop = 0;*/
611 /*PL_in_eval = PL_in_eval;*/ /* inherit */
612 SvREFCNT_dec (GvAV (PL_defgv));
613 GvAV (PL_defgv) = ctx->args;
614
615 SPAGAIN;
616
617 if (ctx->stack)
618 {
619 ctx->cursp = 0;
620
621 PUSHMARK(SP);
622 PUTBACK;
623 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
624
625 if (SvTRUE (ERRSV))
626 croak (NULL);
627 else
628 croak ("FATAL: CCTXT coroutine returned!");
629 }
630 else
631 {
632 UNOP myop;
633
634 PL_op = (OP *)&myop;
635
636 Zero(&myop, 1, UNOP);
637 myop.op_next = Nullop;
638 myop.op_flags = OPf_WANT_VOID;
639
640 PUSHMARK(SP);
641 XPUSHs (sub_init);
642 /*
643 * the next line is slightly wrong, as PL_op->op_next
644 * is actually being executed so we skip the first op.
645 * that doesn't matter, though, since it is only
646 * pp_nextstate and we never return...
647 * ah yes, and I don't care anyways ;)
648 */
649 PUTBACK;
650 PL_op = pp_entersub();
651 SPAGAIN;
652
653 ENTER; /* necessary e.g. for dounwind */
654 }
655}
656
657static void
658continue_coro (void *arg)
659{
660 /*
661 * this is a _very_ stripped down perl interpreter ;)
662 */
663 Coro__State ctx = (Coro__State)arg;
664
665 /*FIXME*//* must set up top_env here */
666 ctx->cursp = 0;
667 PL_op = PL_op->op_next;
668 CALLRUNOPS(aTHX);
669
670 abort ();
671}
672
673STATIC void
674transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
675{
676 dSP;
677 dSTACKLEVEL;
678
679 if (prev != next)
680 {
681 if (next->mainstack)
682 {
683 SAVE (prev, flags);
684 LOAD (next);
685
686 /* mark this state as in-use */
687 next->mainstack = 0;
688 next->tmps_ix = -2;
689
690 /* stacklevel changed? if yes, grab the stack for us! */
691 if (flags & TRANSFER_SAVE_CCTXT)
692 {
693 if (!prev->stack)
694 allocate_stack (prev, 0);
695 else if (prev->cursp != stacklevel
696 && prev->stack->usecnt > 1)
697 {
698 prev->gencnt = ++prev->stack->gencnt;
699 prev->stack->usecnt = 1;
700 }
701
702 /* has our stack been invalidated? */
703 if (next->stack && next->stack->gencnt != next->gencnt)
704 {
705 deallocate_stack (next);
706 allocate_stack (next, 1);
707 coro_create (&(next->stack->cctx),
708 continue_coro, (void *)next,
709 next->stack->sptr, labs (next->stack->ssize));
710 }
711
712 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
713 }
714
715 }
716 else if (next->tmps_ix == -2)
717 croak ("tried to transfer to running coroutine");
718 else
719 {
720 SAVE (prev, -1); /* first get rid of the old state */
721
722 if (flags & TRANSFER_SAVE_CCTXT)
723 {
724 if (!prev->stack)
725 allocate_stack (prev, 0);
726
727 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
728 {
729 setup_coro (next);
730
731 prev->stack->refcnt++;
732 prev->stack->usecnt++;
733 next->stack = prev->stack;
734 next->gencnt = prev->gencnt;
735 }
736 else
737 {
738 allocate_stack (next, 1);
739 coro_create (&(next->stack->cctx),
740 setup_coro, (void *)next,
741 next->stack->sptr, labs (next->stack->ssize));
742 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
743 }
744 }
745 else
746 setup_coro (next);
747 }
748 }
749
750 next->cursp = stacklevel;
751}
752
753static struct coro *
754sv_to_coro (SV *arg, const char *funcname, const char *varname)
755{
756 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
757 {
758 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
759
760 if (!he)
761 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
762
763 arg = HeVAL(he);
764 }
765
766 /* must also be changed inside Coro::Cont::yield */
767 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
768 return (struct coro *) SvIV((SV*)SvRV(arg));
769 else
770 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
771}
772 196
773/** Coro ********************************************************************/ 197/** Coro ********************************************************************/
774 198
775#define PRIO_MAX 3 199#define PRIO_MAX 3
776#define PRIO_HIGH 1 200#define PRIO_HIGH 1
… …
778#define PRIO_LOW -1 202#define PRIO_LOW -1
779#define PRIO_IDLE -3 203#define PRIO_IDLE -3
780#define PRIO_MIN -4 204#define PRIO_MIN -4
781 205
782/* for Coro.pm */ 206/* for Coro.pm */
783static GV *coro_current, *coro_idle; 207static SV *coro_current;
784static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 208static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
209static int coro_nready;
785 210
786static void 211/** lowlevel stuff **********************************************************/
787coro_enq (SV *sv) 212
213static AV *
214coro_clone_padlist (pTHX_ CV *cv)
788{ 215{
789 if (SvROK (sv)) 216 AV *padlist = CvPADLIST (cv);
217 AV *newpadlist, *newpad;
218
219 newpadlist = newAV ();
220 AvREAL_off (newpadlist);
221#if PERL_VERSION_ATLEAST (5,9,0)
222 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
223#else
224 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
225#endif
226 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
227 --AvFILLp (padlist);
228
229 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
230 av_store (newpadlist, 1, (SV *)newpad);
231
232 return newpadlist;
233}
234
235static void
236free_padlist (pTHX_ AV *padlist)
237{
238 /* may be during global destruction */
239 if (SvREFCNT (padlist))
790 { 240 {
791 SV *hv = SvRV (sv); 241 I32 i = AvFILLp (padlist);
792 if (SvTYPE (hv) == SVt_PVHV) 242 while (i >= 0)
793 { 243 {
794 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); 244 SV **svp = av_fetch (padlist, i--, FALSE);
795 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; 245 if (svp)
246 {
247 SV *sv;
248 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
249 SvREFCNT_dec (sv);
796 250
797 prio = prio > PRIO_MAX ? PRIO_MAX 251 SvREFCNT_dec (*svp);
798 : prio < PRIO_MIN ? PRIO_MIN 252 }
799 : prio;
800
801 av_push (coro_ready [prio - PRIO_MIN], sv);
802
803 return;
804 } 253 }
254
255 SvREFCNT_dec ((SV*)padlist);
256 }
257}
258
259static int
260coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
261{
262 AV *padlist;
263 AV *av = (AV *)mg->mg_obj;
264
265 /* casting is fun. */
266 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
267 free_padlist (aTHX_ padlist);
268
269 SvREFCNT_dec (av);
270
271 return 0;
272}
273
274#define PERL_MAGIC_coro PERL_MAGIC_ext
275
276static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
277
278#define CORO_MAGIC(cv) \
279 SvMAGIC (cv) \
280 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
281 ? SvMAGIC (cv) \
282 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
283 : 0
284
285/* the next two functions merely cache the padlists */
286static void
287get_padlist (pTHX_ CV *cv)
288{
289 MAGIC *mg = CORO_MAGIC (cv);
290 AV *av;
291
292 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
293 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
294 else
295 {
296#if CORO_PREFER_PERL_FUNCTIONS
297 /* this is probably cleaner, but also slower? */
298 CV *cp = Perl_cv_clone (cv);
299 CvPADLIST (cv) = CvPADLIST (cp);
300 CvPADLIST (cp) = 0;
301 SvREFCNT_dec (cp);
302#else
303 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
304#endif
805 } 305 }
306}
806 307
807 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 308static void
309put_padlist (pTHX_ CV *cv)
310{
311 MAGIC *mg = CORO_MAGIC (cv);
312 AV *av;
313
314 if (!mg)
315 {
316 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
317 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
318 mg->mg_virtual = &vtbl_coro;
319 mg->mg_obj = (SV *)newAV ();
320 }
321
322 av = (AV *)mg->mg_obj;
323
324 if (AvFILLp (av) >= AvMAX (av))
325 av_extend (av, AvMAX (av) + 1);
326
327 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
328}
329
330/** load & save, init *******************************************************/
331
332#define SB do {
333#define SE } while (0)
334
335#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
336
337static void
338load_perl (pTHX_ Coro__State c)
339{
340#define VAR(name,type) PL_ ## name = c->name;
341# include "state.h"
342#undef VAR
343
344 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
345 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
346 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
347 if (c->deffh) REPLACE_SV (PL_defoutgv , c->deffh);
348
349 if (c->irssv)
350 {
351 if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
352 {
353 SvREFCNT_dec (c->irssv);
354 c->irssv = 0;
355 }
356 else
357 {
358 REPLACE_SV (PL_rs, c->irssv);
359 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
360 sv_setsv (c->irssv_sv, PL_rs);
361 }
362 }
363
364 {
365 dSP;
366 CV *cv;
367
368 /* now do the ugly restore mess */
369 while ((cv = (CV *)POPs))
370 {
371 put_padlist (aTHX_ cv); /* mark this padlist as available */
372 CvDEPTH (cv) = PTR2IV (POPs);
373 CvPADLIST (cv) = (AV *)POPs;
374 }
375
376 PUTBACK;
377 }
378 assert (!PL_comppad || AvARRAY (PL_comppad));//D
379}
380
381static void
382save_perl (pTHX_ Coro__State c)
383{
384 assert (!PL_comppad || AvARRAY (PL_comppad));//D
385 {
386 dSP;
387 I32 cxix = cxstack_ix;
388 PERL_CONTEXT *ccstk = cxstack;
389 PERL_SI *top_si = PL_curstackinfo;
390
391 /*
392 * the worst thing you can imagine happens first - we have to save
393 * (and reinitialize) all cv's in the whole callchain :(
394 */
395
396 EXTEND (SP, 3 + 1);
397 PUSHs (Nullsv);
398 /* this loop was inspired by pp_caller */
399 for (;;)
400 {
401 while (cxix >= 0)
402 {
403 PERL_CONTEXT *cx = &ccstk[cxix--];
404
405 if (CxTYPE (cx) == CXt_SUB)
406 {
407 CV *cv = cx->blk_sub.cv;
408
409 if (CvDEPTH (cv))
410 {
411 EXTEND (SP, 3);
412 PUSHs ((SV *)CvPADLIST (cv));
413 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
414 PUSHs ((SV *)cv);
415
416 CvDEPTH (cv) = 0;
417 get_padlist (aTHX_ cv);
418 }
419 }
420 }
421
422 if (top_si->si_type == PERLSI_MAIN)
423 break;
424
425 top_si = top_si->si_prev;
426 ccstk = top_si->si_cxstack;
427 cxix = top_si->si_cxix;
428 }
429
430 PUTBACK;
431 }
432
433 c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
434 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
435 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
436 c->deffh = c->save & CORO_SAVE_DEFFH ? (GV *)SvREFCNT_inc (PL_defoutgv) : 0;
437 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
438
439#define VAR(name,type)c->name = PL_ ## name;
440# include "state.h"
441#undef VAR
442}
443
444/*
445 * allocate various perl stacks. This is an exact copy
446 * of perl.c:init_stacks, except that it uses less memory
447 * on the (sometimes correct) assumption that coroutines do
448 * not usually need a lot of stackspace.
449 */
450#if CORO_PREFER_PERL_FUNCTIONS
451# define coro_init_stacks init_stacks
452#else
453static void
454coro_init_stacks (pTHX)
455{
456 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
457 PL_curstackinfo->si_type = PERLSI_MAIN;
458 PL_curstack = PL_curstackinfo->si_stack;
459 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
460
461 PL_stack_base = AvARRAY(PL_curstack);
462 PL_stack_sp = PL_stack_base;
463 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
464
465 New(50,PL_tmps_stack,128,SV*);
466 PL_tmps_floor = -1;
467 PL_tmps_ix = -1;
468 PL_tmps_max = 128;
469
470 New(54,PL_markstack,32,I32);
471 PL_markstack_ptr = PL_markstack;
472 PL_markstack_max = PL_markstack + 32;
473
474#ifdef SET_MARK_OFFSET
475 SET_MARK_OFFSET;
476#endif
477
478 New(54,PL_scopestack,32,I32);
479 PL_scopestack_ix = 0;
480 PL_scopestack_max = 32;
481
482 New(54,PL_savestack,64,ANY);
483 PL_savestack_ix = 0;
484 PL_savestack_max = 64;
485
486#if !PERL_VERSION_ATLEAST (5,9,0)
487 New(54,PL_retstack,16,OP*);
488 PL_retstack_ix = 0;
489 PL_retstack_max = 16;
490#endif
491}
492#endif
493
494/*
495 * destroy the stacks, the callchain etc...
496 */
497static void
498coro_destroy_stacks (pTHX)
499{
500 if (!IN_DESTRUCT)
501 {
502 /* restore all saved variables and stuff */
503 LEAVE_SCOPE (0);
504 assert (PL_tmps_floor == -1);
505
506 /* free all temporaries */
507 FREETMPS;
508 assert (PL_tmps_ix == -1);
509
510 /* unwind all extra stacks */
511 POPSTACK_TO (PL_mainstack);
512
513 /* unwind main stack */
514 dounwind (-1);
515 }
516
517 while (PL_curstackinfo->si_next)
518 PL_curstackinfo = PL_curstackinfo->si_next;
519
520 while (PL_curstackinfo)
521 {
522 PERL_SI *p = PL_curstackinfo->si_prev;
523
524 if (!IN_DESTRUCT)
525 SvREFCNT_dec (PL_curstackinfo->si_stack);
526
527 Safefree (PL_curstackinfo->si_cxstack);
528 Safefree (PL_curstackinfo);
529 PL_curstackinfo = p;
530 }
531
532 Safefree (PL_tmps_stack);
533 Safefree (PL_markstack);
534 Safefree (PL_scopestack);
535 Safefree (PL_savestack);
536#if !PERL_VERSION_ATLEAST (5,9,0)
537 Safefree (PL_retstack);
538#endif
539}
540
541/** coroutine stack handling ************************************************/
542
543static void
544setup_coro (pTHX_ struct coro *coro)
545{
546 /*
547 * emulate part of the perl startup here.
548 */
549 coro_init_stacks (aTHX);
550
551 PL_curcop = &PL_compiling;
552 PL_in_eval = EVAL_NULL;
553 PL_comppad = 0;
554 PL_curpm = 0;
555 PL_localizing = 0;
556 PL_dirty = 0;
557 PL_restartop = 0;
558
559 {
560 dSP;
561 LOGOP myop;
562
563 SvREFCNT_dec (GvAV (PL_defgv));
564 GvAV (PL_defgv) = coro->args; coro->args = 0;
565
566 Zero (&myop, 1, LOGOP);
567 myop.op_next = Nullop;
568 myop.op_flags = OPf_WANT_VOID;
569
570 PUSHMARK (SP);
571 XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE));
572 PUTBACK;
573 PL_op = (OP *)&myop;
574 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
575 SPAGAIN;
576 }
577
578 ENTER; /* necessary e.g. for dounwind */
579}
580
581static void
582free_coro_mortal (pTHX)
583{
584 if (coro_mortal)
585 {
586 SvREFCNT_dec (coro_mortal);
587 coro_mortal = 0;
588 }
589}
590
591/* inject a fake call to Coro::State::_cctx_init into the execution */
592static void NOINLINE
593prepare_cctx (pTHX_ coro_cctx *cctx)
594{
595 dSP;
596 LOGOP myop;
597
598 Zero (&myop, 1, LOGOP);
599 myop.op_next = PL_op;
600 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
601
602 PUSHMARK (SP);
603 EXTEND (SP, 2);
604 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
605 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
606 PUTBACK;
607 PL_op = (OP *)&myop;
608 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
609 SPAGAIN;
610}
611
612static void
613coro_run (void *arg)
614{
615 dTHX;
616
617 /* coro_run is the alternative tail of transfer(), so unlock here. */
618 UNLOCK;
619
620 /*
621 * this is a _very_ stripped down perl interpreter ;)
622 */
623 PL_top_env = &PL_start_env;
624
625 /* inject call to cctx_init */
626 prepare_cctx (aTHX_ (coro_cctx *)arg);
627
628 /* somebody will hit me for both perl_run and PL_restartop */
629 PL_restartop = PL_op;
630 perl_run (PL_curinterp);
631
632 fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr);
633 abort ();
634}
635
636static coro_cctx *
637cctx_new ()
638{
639 coro_cctx *cctx;
640 void *stack_start;
641 size_t stack_size;
642
643 ++cctx_count;
644
645 Newz (0, cctx, 1, coro_cctx);
646
647#if HAVE_MMAP
648
649 cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
650 /* mmap supposedly does allocate-on-write for us */
651 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
652
653 if (cctx->sptr != (void *)-1)
654 {
655# if CORO_STACKGUARD
656 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
657# endif
658 stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
659 stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
660 cctx->mapped = 1;
661 }
662 else
663#endif
664 {
665 cctx->ssize = coro_stacksize * (long)sizeof (long);
666 New (0, cctx->sptr, coro_stacksize, long);
667
668 if (!cctx->sptr)
669 {
670 perror ("FATAL: unable to allocate stack for coroutine");
671 _exit (EXIT_FAILURE);
672 }
673
674 stack_start = cctx->sptr;
675 stack_size = cctx->ssize;
676 }
677
678 REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
679 coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size);
680
681 return cctx;
682}
683
684static void
685cctx_destroy (coro_cctx *cctx)
686{
687 if (!cctx)
688 return;
689
690 --cctx_count;
691
692#if CORO_USE_VALGRIND
693 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
694#endif
695
696#if HAVE_MMAP
697 if (cctx->mapped)
698 munmap (cctx->sptr, cctx->ssize);
699 else
700#endif
701 Safefree (cctx->sptr);
702
703 Safefree (cctx);
704}
705
706static coro_cctx *
707cctx_get (pTHX)
708{
709 while (cctx_first)
710 {
711 coro_cctx *cctx = cctx_first;
712 cctx_first = cctx->next;
713 --cctx_idle;
714
715 if (cctx->ssize >= coro_stacksize)
716 return cctx;
717
718 cctx_destroy (cctx);
719 }
720
721 PL_op = PL_op->op_next;
722 return cctx_new ();
723}
724
725static void
726cctx_put (coro_cctx *cctx)
727{
728 /* free another cctx if overlimit */
729 if (cctx_idle >= MAX_IDLE_CCTX)
730 {
731 coro_cctx *first = cctx_first;
732 cctx_first = first->next;
733 --cctx_idle;
734
735 assert (!first->inuse);
736 cctx_destroy (first);
737 }
738
739 ++cctx_idle;
740 cctx->next = cctx_first;
741 cctx_first = cctx;
742}
743
744/** coroutine switching *****************************************************/
745
746/* never call directly, always through the coro_state_transfer global variable */
747static void NOINLINE
748transfer (pTHX_ struct coro *prev, struct coro *next)
749{
750 dSTACKLEVEL;
751
752 /* sometimes transfer is only called to set idle_sp */
753 if (!next)
754 {
755 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
756 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
757 }
758 else if (prev != next)
759 {
760 coro_cctx *prev__cctx;
761
762 if (prev->flags & CF_NEW)
763 {
764 /* create a new empty context */
765 Newz (0, prev->cctx, 1, coro_cctx);
766 prev->cctx->inuse = 1;
767 prev->flags &= ~CF_NEW;
768 prev->flags |= CF_RUNNING;
769 }
770
771 /*TODO: must not croak here */
772 if (!prev->flags & CF_RUNNING)
773 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
774
775 if (next->flags & CF_RUNNING)
776 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
777
778 if (next->flags & CF_DESTROYED)
779 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
780
781 prev->flags &= ~CF_RUNNING;
782 next->flags |= CF_RUNNING;
783
784 LOCK;
785
786 if (next->flags & CF_NEW)
787 {
788 /* need to start coroutine */
789 next->flags &= ~CF_NEW;
790 /* first get rid of the old state */
791 save_perl (aTHX_ prev);
792 /* setup coroutine call */
793 setup_coro (aTHX_ next);
794 /* need a new stack */
795 assert (!next->cctx);
796 }
797 else
798 {
799 /* coroutine already started */
800 save_perl (aTHX_ prev);
801 load_perl (aTHX_ next);
802 }
803
804 prev__cctx = prev->cctx;
805
806 /* possibly "free" the cctx */
807 if (prev__cctx->idle_sp == STACKLEVEL)
808 {
809 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
810 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
811
812 prev->cctx = 0;
813
814 cctx_put (prev__cctx);
815 prev__cctx->inuse = 0;
816 }
817
818 if (!next->cctx)
819 {
820 next->cctx = cctx_get (aTHX);
821 assert (!next->cctx->inuse);
822 next->cctx->inuse = 1;
823 }
824
825 if (prev__cctx != next->cctx)
826 {
827 prev__cctx->top_env = PL_top_env;
828 PL_top_env = next->cctx->top_env;
829 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
830 }
831
832 free_coro_mortal (aTHX);
833 UNLOCK;
834 }
835}
836
837struct transfer_args
838{
839 struct coro *prev, *next;
840};
841
842#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
843
844/** high level stuff ********************************************************/
845
846static int
847coro_state_destroy (pTHX_ struct coro *coro)
848{
849 if (coro->flags & CF_DESTROYED)
850 return 0;
851
852 coro->flags |= CF_DESTROYED;
853
854 if (coro->flags & CF_READY)
855 {
856 /* reduce nready, as destroying a ready coro effectively unreadies it */
857 /* alternative: look through all ready queues and remove the coro */
858 LOCK;
859 --coro_nready;
860 UNLOCK;
861 }
862 else
863 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
864
865 if (coro->mainstack && coro->mainstack != main_mainstack)
866 {
867 struct coro temp;
868
869 assert (!(coro->flags & CF_RUNNING));
870
871 Zero (&temp, 1, struct coro);
872 temp.save = CORO_SAVE_DEF;
873
874 if (coro->flags & CF_RUNNING)
875 croak ("FATAL: tried to destroy currently running coroutine");
876
877 save_perl (aTHX_ &temp);
878 load_perl (aTHX_ coro);
879
880 coro_destroy_stacks (aTHX);
881
882 load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */
883
884 coro->mainstack = 0;
885 }
886
887 cctx_destroy (coro->cctx);
888 SvREFCNT_dec (coro->args);
889
890 return 1;
891}
892
893static int
894coro_state_free (pTHX_ SV *sv, MAGIC *mg)
895{
896 struct coro *coro = (struct coro *)mg->mg_ptr;
897 mg->mg_ptr = 0;
898
899 if (--coro->refcnt < 0)
900 {
901 coro_state_destroy (aTHX_ coro);
902 Safefree (coro);
903 }
904
905 return 0;
906}
907
908static int
909coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
910{
911 struct coro *coro = (struct coro *)mg->mg_ptr;
912
913 ++coro->refcnt;
914
915 return 0;
916}
917
918static MGVTBL coro_state_vtbl = {
919 0, 0, 0, 0,
920 coro_state_free,
921 0,
922#ifdef MGf_DUP
923 coro_state_dup,
924#else
925# define MGf_DUP 0
926#endif
927};
928
929static struct coro *
930SvSTATE_ (pTHX_ SV *coro)
931{
932 HV *stash;
933 MAGIC *mg;
934
935 if (SvROK (coro))
936 coro = SvRV (coro);
937
938 stash = SvSTASH (coro);
939 if (stash != coro_stash && stash != coro_state_stash)
940 {
941 /* very slow, but rare, check */
942 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
943 croak ("Coro::State object required");
944 }
945
946 mg = CORO_MAGIC (coro);
947 return (struct coro *)mg->mg_ptr;
948}
949
950#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
951
952static void
953prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv)
954{
955 ta->prev = SvSTATE (prev_sv);
956 ta->next = SvSTATE (next_sv);
957}
958
959static void
960api_transfer (SV *prev_sv, SV *next_sv)
961{
962 dTHX;
963 struct transfer_args ta;
964
965 prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
966 TRANSFER (ta);
967}
968
969static int
970api_save (SV *coro_sv, int new_save)
971{
972 dTHX;
973 struct coro *coro = SvSTATE (coro_sv);
974 int old_save = coro->save;
975
976 if (new_save >= 0)
977 coro->save = new_save;
978
979 return old_save;
980}
981
982/** Coro ********************************************************************/
983
984static void
985coro_enq (pTHX_ SV *coro_sv)
986{
987 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
808} 988}
809 989
810static SV * 990static SV *
811coro_deq (int min_prio) 991coro_deq (pTHX_ int min_prio)
812{ 992{
813 int prio = PRIO_MAX - PRIO_MIN; 993 int prio = PRIO_MAX - PRIO_MIN;
814 994
815 min_prio -= PRIO_MIN; 995 min_prio -= PRIO_MIN;
816 if (min_prio < 0) 996 if (min_prio < 0)
817 min_prio = 0; 997 min_prio = 0;
818 998
819 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 999 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
820 if (av_len (coro_ready[prio]) >= 0) 1000 if (AvFILLp (coro_ready [prio]) >= 0)
821 return av_shift (coro_ready[prio]); 1001 return av_shift (coro_ready [prio]);
822 1002
823 return 0; 1003 return 0;
824} 1004}
825 1005
1006static int
1007api_ready (SV *coro_sv)
1008{
1009 dTHX;
1010 struct coro *coro;
1011
1012 if (SvROK (coro_sv))
1013 coro_sv = SvRV (coro_sv);
1014
1015 coro = SvSTATE (coro_sv);
1016
1017 if (coro->flags & CF_READY)
1018 return 0;
1019
1020 coro->flags |= CF_READY;
1021
1022 LOCK;
1023 coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
1024 ++coro_nready;
1025 UNLOCK;
1026
1027 return 1;
1028}
1029
1030static int
1031api_is_ready (SV *coro_sv)
1032{
1033 dTHX;
1034 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1035}
1036
1037static void
1038prepare_schedule (pTHX_ struct transfer_args *ta)
1039{
1040 SV *prev_sv, *next_sv;
1041
1042 for (;;)
1043 {
1044 LOCK;
1045 next_sv = coro_deq (aTHX_ PRIO_MIN);
1046
1047 /* nothing to schedule: call the idle handler */
1048 if (!next_sv)
1049 {
1050 dSP;
1051 UNLOCK;
1052
1053 ENTER;
1054 SAVETMPS;
1055
1056 PUSHMARK (SP);
1057 PUTBACK;
1058 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1059
1060 FREETMPS;
1061 LEAVE;
1062 continue;
1063 }
1064
1065 ta->next = SvSTATE (next_sv);
1066
1067 /* cannot transfer to destroyed coros, skip and look for next */
1068 if (ta->next->flags & CF_DESTROYED)
1069 {
1070 UNLOCK;
1071 SvREFCNT_dec (next_sv);
1072 /* coro_nready is already taken care of by destroy */
1073 continue;
1074 }
1075
1076 --coro_nready;
1077 UNLOCK;
1078 break;
1079 }
1080
1081 /* free this only after the transfer */
1082 prev_sv = SvRV (coro_current);
1083 SvRV_set (coro_current, next_sv);
1084 ta->prev = SvSTATE (prev_sv);
1085
1086 assert (ta->next->flags & CF_READY);
1087 ta->next->flags &= ~CF_READY;
1088
1089 LOCK;
1090 free_coro_mortal (aTHX);
1091 coro_mortal = prev_sv;
1092 UNLOCK;
1093}
1094
1095static void
1096prepare_cede (pTHX_ struct transfer_args *ta)
1097{
1098 api_ready (coro_current);
1099 prepare_schedule (aTHX_ ta);
1100}
1101
1102static int
1103prepare_cede_notself (pTHX_ struct transfer_args *ta)
1104{
1105 if (coro_nready)
1106 {
1107 SV *prev = SvRV (coro_current);
1108 prepare_schedule (aTHX_ ta);
1109 api_ready (prev);
1110 return 1;
1111 }
1112 else
1113 return 0;
1114}
1115
1116static void
1117api_schedule (void)
1118{
1119 dTHX;
1120 struct transfer_args ta;
1121
1122 prepare_schedule (aTHX_ &ta);
1123 TRANSFER (ta);
1124}
1125
1126static int
1127api_cede (void)
1128{
1129 dTHX;
1130 struct transfer_args ta;
1131
1132 prepare_cede (aTHX_ &ta);
1133
1134 if (ta.prev != ta.next)
1135 {
1136 TRANSFER (ta);
1137 return 1;
1138 }
1139 else
1140 return 0;
1141}
1142
1143static int
1144api_cede_notself (void)
1145{
1146 dTHX;
1147 struct transfer_args ta;
1148
1149 if (prepare_cede_notself (aTHX_ &ta))
1150 {
1151 TRANSFER (ta);
1152 return 1;
1153 }
1154 else
1155 return 0;
1156}
1157
826MODULE = Coro::State PACKAGE = Coro::State 1158MODULE = Coro::State PACKAGE = Coro::State
827 1159
828PROTOTYPES: ENABLE 1160PROTOTYPES: DISABLE
829 1161
830BOOT: 1162BOOT:
831{ /* {} necessary for stoopid perl-5.6.x */ 1163{
832 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1164#ifdef USE_ITHREADS
833 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1165 MUTEX_INIT (&coro_mutex);
1166#endif
1167 BOOT_PAGESIZE;
1168
834 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1169 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
835 1170
836 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1171 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
837 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1172 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
838 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1173 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1174 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
1175 newCONSTSUB (coro_state_stash, "SAVE_DEFFH", newSViv (CORO_SAVE_DEFFH));
839 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1176 newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF));
840 1177 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
841 if (!padlist_cache)
842 padlist_cache = newHV ();
843 1178
844 main_mainstack = PL_mainstack; 1179 main_mainstack = PL_mainstack;
845}
846 1180
847Coro::State 1181 coroapi.ver = CORO_API_VERSION;
848_newprocess(args) 1182 coroapi.transfer = api_transfer;
849 SV * args 1183
850 PROTOTYPE: $ 1184 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1185}
1186
1187SV *
1188new (char *klass, ...)
851 CODE: 1189 CODE:
852 Coro__State coro; 1190{
1191 struct coro *coro;
1192 HV *hv;
1193 int i;
853 1194
854 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
855 croak ("Coro::State::_newprocess expects an arrayref");
856
857 New (0, coro, 1, struct coro); 1195 Newz (0, coro, 1, struct coro);
1196 coro->args = newAV ();
1197 coro->save = CORO_SAVE_DEF;
1198 coro->flags = CF_NEW;
858 1199
859 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1200 hv = newHV ();
860 coro->mainstack = 0; /* actual work is done inside transfer */ 1201 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
861 coro->stack = 0; 1202 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
862 1203
863 RETVAL = coro; 1204 for (i = 1; i < items; i++)
1205 av_push (coro->args, newSVsv (ST (i)));
1206}
864 OUTPUT: 1207 OUTPUT:
865 RETVAL 1208 RETVAL
866 1209
1210int
1211save (SV *coro, int new_save = -1)
1212 CODE:
1213 RETVAL = api_save (coro, new_save);
1214 OUTPUT:
1215 RETVAL
1216
1217int
1218save_also (SV *coro_sv, int save_also)
1219 CODE:
1220{
1221 struct coro *coro = SvSTATE (coro_sv);
1222 RETVAL = coro->save;
1223 coro->save |= save_also;
1224}
1225 OUTPUT:
1226 RETVAL
1227
867void 1228void
868transfer(prev, next, flags) 1229_set_stacklevel (...)
869 Coro::State_or_hashref prev 1230 ALIAS:
870 Coro::State_or_hashref next 1231 Coro::State::transfer = 1
871 int flags 1232 Coro::schedule = 2
872 PROTOTYPE: @ 1233 Coro::cede = 3
1234 Coro::cede_notself = 4
873 CODE: 1235 CODE:
874 PUTBACK; 1236{
875 transfer (aTHX_ prev, next, flags); 1237 struct transfer_args ta;
876 SPAGAIN; 1238
1239 switch (ix)
1240 {
1241 case 0:
1242 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1243 ta.next = 0;
1244 break;
1245
1246 case 1:
1247 if (items != 2)
1248 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1249
1250 prepare_transfer (aTHX_ &ta, ST (0), ST (1));
1251 break;
1252
1253 case 2:
1254 prepare_schedule (aTHX_ &ta);
1255 break;
1256
1257 case 3:
1258 prepare_cede (aTHX_ &ta);
1259 break;
1260
1261 case 4:
1262 if (!prepare_cede_notself (aTHX_ &ta))
1263 XSRETURN_EMPTY;
1264
1265 break;
1266 }
1267
1268 BARRIER;
1269 TRANSFER (ta);
1270
1271 if (GIMME_V != G_VOID && ta.next != ta.prev)
1272 XSRETURN_YES;
1273}
1274
1275bool
1276_destroy (SV *coro_sv)
1277 CODE:
1278 RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
1279 OUTPUT:
1280 RETVAL
877 1281
878void 1282void
879DESTROY(coro)
880 Coro::State coro
881 CODE:
882
883 if (coro->mainstack && coro->mainstack != main_mainstack)
884 {
885 struct coro temp;
886
887 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
888 LOAD(aTHX_ coro);
889
890 destroy_stacks (aTHX);
891
892 LOAD((&temp)); /* this will get rid of defsv etc.. */
893
894 coro->mainstack = 0;
895 }
896
897 deallocate_stack (coro);
898
899 Safefree (coro);
900
901void
902flush()
903 CODE:
904#ifdef MAY_FLUSH
905 flush_padlist_cache ();
906#endif
907
908void
909_exit(code) 1283_exit (code)
910 int code 1284 int code
911 PROTOTYPE: $ 1285 PROTOTYPE: $
912 CODE: 1286 CODE:
913#if defined(__GLIBC__) || _POSIX_C_SOURCE
914 _exit (code); 1287 _exit (code);
915#else
916 signal (SIGTERM, SIG_DFL);
917 raise (SIGTERM);
918 exit (code);
919#endif
920 1288
921MODULE = Coro::State PACKAGE = Coro::Cont 1289int
1290cctx_stacksize (int new_stacksize = 0)
1291 CODE:
1292 RETVAL = coro_stacksize;
1293 if (new_stacksize)
1294 coro_stacksize = new_stacksize;
1295 OUTPUT:
1296 RETVAL
922 1297
923# this is slightly dirty (should expose a c-level api) 1298int
1299cctx_count ()
1300 CODE:
1301 RETVAL = cctx_count;
1302 OUTPUT:
1303 RETVAL
924 1304
925void 1305int
926yield(...) 1306cctx_idle ()
927 PROTOTYPE: @ 1307 CODE:
928 CODE: 1308 RETVAL = cctx_idle;
929 static SV *returnstk; 1309 OUTPUT:
930 SV *sv; 1310 RETVAL
931 AV *defav = GvAV (PL_defgv);
932 struct coro *prev, *next;
933
934 if (!returnstk)
935 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
936
937 /* set up @_ -- ugly */
938 av_clear (defav);
939 av_fill (defav, items - 1);
940 while (items--)
941 av_store (defav, items, SvREFCNT_inc (ST(items)));
942
943 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
944 sv = av_pop ((AV *)SvRV (returnstk));
945 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
946 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
947 SvREFCNT_dec (sv);
948
949 transfer(aTHX_ prev, next, 0);
950 1311
951MODULE = Coro::State PACKAGE = Coro 1312MODULE = Coro::State PACKAGE = Coro
952 1313
953# this is slightly dirty (should expose a c-level api)
954
955BOOT: 1314BOOT:
956{ 1315{
957 int i; 1316 int i;
1317
958 HV *stash = gv_stashpv ("Coro", TRUE); 1318 coro_stash = gv_stashpv ("Coro", TRUE);
959 1319
960 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1320 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
961 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1321 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
962 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1322 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
963 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1323 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
964 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1324 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
965 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1325 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
966 1326
967 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1327 coro_current = get_sv ("Coro::current", FALSE);
968 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1328 SvREADONLY_on (coro_current);
969 1329
970 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1330 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
971 coro_ready[i] = newAV (); 1331 coro_ready[i] = newAV ();
1332
1333 {
1334 SV *sv = perl_get_sv("Coro::API", 1);
1335
1336 coroapi.schedule = api_schedule;
1337 coroapi.save = api_save;
1338 coroapi.cede = api_cede;
1339 coroapi.cede_notself = api_cede_notself;
1340 coroapi.ready = api_ready;
1341 coroapi.is_ready = api_is_ready;
1342 coroapi.nready = &coro_nready;
1343 coroapi.current = coro_current;
1344
1345 GCoroAPI = &coroapi;
1346 sv_setiv (sv, (IV)&coroapi);
1347 SvREADONLY_on (sv);
1348 }
972} 1349}
973 1350
974void 1351void
975ready(self) 1352_set_current (SV *current)
976 SV * self 1353 PROTOTYPE: $
977 CODE: 1354 CODE:
978 coro_enq (SvREFCNT_inc (self)); 1355 SvREFCNT_dec (SvRV (coro_current));
1356 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1357
1358int
1359prio (Coro::State coro, int newprio = 0)
1360 ALIAS:
1361 nice = 1
1362 CODE:
1363{
1364 RETVAL = coro->prio;
1365
1366 if (items > 1)
1367 {
1368 if (ix)
1369 newprio = coro->prio - newprio;
1370
1371 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1372 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1373
1374 coro->prio = newprio;
1375 }
1376}
1377 OUTPUT:
1378 RETVAL
1379
1380SV *
1381ready (SV *self)
1382 PROTOTYPE: $
1383 CODE:
1384 RETVAL = boolSV (api_ready (self));
1385 OUTPUT:
1386 RETVAL
1387
1388SV *
1389is_ready (SV *self)
1390 PROTOTYPE: $
1391 CODE:
1392 RETVAL = boolSV (api_is_ready (self));
1393 OUTPUT:
1394 RETVAL
1395
1396int
1397nready (...)
1398 PROTOTYPE:
1399 CODE:
1400 RETVAL = coro_nready;
1401 OUTPUT:
1402 RETVAL
1403
1404MODULE = Coro::State PACKAGE = Coro::AIO
1405
1406SV *
1407_get_state ()
1408 CODE:
1409{
1410 struct io_state *data;
1411
1412 RETVAL = newSV (sizeof (struct io_state));
1413 data = (struct io_state *)SvPVX (RETVAL);
1414 SvCUR_set (RETVAL, sizeof (struct io_state));
1415 SvPOK_only (RETVAL);
1416
1417 data->errorno = errno;
1418 data->laststype = PL_laststype;
1419 data->laststatval = PL_laststatval;
1420 data->statcache = PL_statcache;
1421}
1422 OUTPUT:
1423 RETVAL
979 1424
980void 1425void
981schedule(...) 1426_set_state (char *data_)
982 ALIAS: 1427 PROTOTYPE: $
983 cede = 1
984 CODE: 1428 CODE:
985 SV *prev, *next; 1429{
1430 struct io_state *data = (void *)data_;
986 1431
987 prev = GvSV (coro_current); 1432 errno = data->errorno;
1433 PL_laststype = data->laststype;
1434 PL_laststatval = data->laststatval;
1435 PL_statcache = data->statcache;
1436}
988 1437
989 if (ix)
990 coro_enq (SvREFCNT_inc (prev));
991
992 next = coro_deq (PRIO_MIN);
993
994 if (!next)
995 next = SvREFCNT_inc (GvSV (coro_idle));
996
997 GvSV (coro_current) = SvREFCNT_inc (next);
998 transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"),
999 sv_to_coro (next, "Coro::schedule", "next coroutine"),
1000 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
1001 SvREFCNT_dec (next);
1002 SvREFCNT_dec (prev);
1003

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines