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.29 by root, Sat Aug 25 21:40:34 2001 UTC vs.
Revision 1.209 by root, Wed Oct 10 02:58:17 2007 UTC

1#include "libcoro/coro.c"
2
3#define PERL_NO_GET_CONTEXT
4#define PERL_EXT
5
1#include "EXTERN.h" 6#include "EXTERN.h"
2#include "perl.h" 7#include "perl.h"
3#include "XSUB.h" 8#include "XSUB.h"
4 9
5#include "libcoro/coro.c" 10#include "patchlevel.h"
6 11
7#include <signal.h> 12#include <stdio.h>
13#include <errno.h>
14#include <assert.h>
15#include <inttypes.h> /* portable stdint.h */
8 16
9#ifdef HAVE_MMAP 17#ifdef HAVE_MMAP
10# include <unistd.h> 18# include <unistd.h>
11# include <sys/mman.h> 19# include <sys/mman.h>
12# ifndef MAP_ANON
13# ifdef MAP_ANONYMOUS 20# ifndef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS 21# ifdef MAP_ANON
22# define MAP_ANONYMOUS MAP_ANON
15# else 23# else
16# undef HAVE_MMAP 24# undef HAVE_MMAP
17# endif 25# endif
18# endif 26# endif
27# include <limits.h>
28# ifndef PAGESIZE
29# define PAGESIZE pagesize
30# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
31static long pagesize;
32# else
33# define BOOT_PAGESIZE (void)0
19#endif 34# endif
35#else
36# define PAGESIZE 0
37# define BOOT_PAGESIZE (void)0
38#endif
20 39
21#define MAY_FLUSH /* increases codesize and is rarely used */ 40#if CORO_USE_VALGRIND
41# include <valgrind/valgrind.h>
42# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
43#else
44# define REGISTER_STACK(cctx,start,end)
45#endif
22 46
23#define SUB_INIT "Coro::State::initialize" 47/* the maximum number of idle cctx that will be pooled */
24#define UCORO_STATE "_coro_state" 48#define MAX_IDLE_CCTX 8
25 49
26/* The next macro should declare a variable stacklevel that contains and approximation 50#define PERL_VERSION_ATLEAST(a,b,c) \
27 * to the current C stack pointer. Its property is that it changes with each call 51 (PERL_REVISION > (a) \
28 * and should be unique. */ 52 || (PERL_REVISION == (a) \
53 && (PERL_VERSION > (b) \
54 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
55
56#if !PERL_VERSION_ATLEAST (5,6,0)
57# ifndef PL_ppaddr
58# define PL_ppaddr ppaddr
59# endif
60# ifndef call_sv
61# define call_sv perl_call_sv
62# endif
63# ifndef get_sv
64# define get_sv perl_get_sv
65# endif
66# ifndef get_cv
67# define get_cv perl_get_cv
68# endif
69# ifndef IS_PADGV
70# define IS_PADGV(v) 0
71# endif
72# ifndef IS_PADCONST
73# define IS_PADCONST(v) 0
74# endif
75#endif
76
77/* 5.8.7 */
78#ifndef SvRV_set
79# define SvRV_set(s,v) SvRV(s) = (v)
80#endif
81
82/* 5.8.8 */
83#ifndef GV_NOTQUAL
84# define GV_NOTQUAL 0
85#endif
86#ifndef newSV
87# define newSV(l) NEWSV(0,l)
88#endif
89
90#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
91# undef CORO_STACKGUARD
92#endif
93
94#ifndef CORO_STACKGUARD
95# define CORO_STACKGUARD 0
96#endif
97
98/* prefer perl internal functions over our own? */
99#ifndef CORO_PREFER_PERL_FUNCTIONS
100# define CORO_PREFER_PERL_FUNCTIONS 0
101#endif
102
103/* The next macros try to return the current stack pointer, in an as
104 * portable way as possible. */
105#define dSTACKLEVEL volatile char stacklevel
29#define dSTACKLEVEL void *stacklevel = &stacklevel 106#define STACKLEVEL ((void *)&stacklevel)
30 107
31#define labs(l) ((l) >= 0 ? (l) : -(l)) 108#define IN_DESTRUCT (PL_main_cv == Nullcv)
109
110#if __GNUC__ >= 3
111# define attribute(x) __attribute__(x)
112# define BARRIER __asm__ __volatile__ ("" : : : "memory")
113# define expect(expr,value) __builtin_expect ((expr),(value))
114#else
115# define attribute(x)
116# define BARRIER
117# define expect(expr,value) (expr)
118#endif
119
120#define expect_false(expr) expect ((expr) != 0, 0)
121#define expect_true(expr) expect ((expr) != 0, 1)
122
123#define NOINLINE attribute ((noinline))
32 124
33#include "CoroAPI.h" 125#include "CoroAPI.h"
34 126
127#ifdef USE_ITHREADS
128static perl_mutex coro_mutex;
129# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
130# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
131#else
132# define LOCK (void)0
133# define UNLOCK (void)0
134#endif
135
136#define strpair(const) const, sizeof (const) - 1
137
138/* helper storage struct for Coro::AIO */
139struct io_state
140{
141 int errorno;
142 I32 laststype;
143 int laststatval;
144 Stat_t statcache;
145};
146
147static size_t coro_stacksize = CORO_STACKSIZE;
35static struct CoroAPI coroapi; 148static struct CoroAPI coroapi;
149static AV *main_mainstack; /* used to differentiate between $main and others */
150static JMPENV *main_top_env;
151static HV *coro_state_stash, *coro_stash;
152static SV *coro_mortal; /* will be freed after next transfer */
36 153
37/* this is actually not only the c stack but also c registers etc... */ 154static GV *irsgv; /* $/ */
155static GV *stdoutgv; /* *STDOUT */
156
157static HV *hv_sig; /* %SIG */
158static SV *sv_diehook;
159static SV *sv_warnhook;
160
161/* async_pool helper stuff */
162static SV *sv_pool_rss;
163static SV *sv_pool_size;
164static AV *av_async_pool;
165
166static struct coro_cctx *cctx_first[3]; /* index by GIMME_V type, void, scalar, array */
167static int cctx_count, cctx_idle[3];
168
169enum {
170 CC_MAPPED = 0x01,
171 CC_NOREUSE = 0x02, /* throw this away after tracing */
172 CC_TRACE = 0x04,
173 CC_TRACE_SUB = 0x08, /* trace sub calls */
174 CC_TRACE_LINE = 0x10, /* trace each statement */
175 CC_TRACE_ALL = CC_TRACE_SUB | CC_TRACE_LINE,
176};
177
178/* this is a structure representing a c-level coroutine */
179typedef struct coro_cctx {
180 struct coro_cctx *next;
181
182 /* the stack */
183 void *sptr;
184 size_t ssize;
185
186 /* cpu state */
187 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
188 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
189 JMPENV *top_env;
190 coro_context cctx;
191
192#if CORO_USE_VALGRIND
193 int valgrind_id;
194#endif
195 unsigned char flags;
196} coro_cctx;
197
198enum {
199 CF_RUNNING = 0x0001, /* coroutine is running */
200 CF_READY = 0x0002, /* coroutine is ready */
201 CF_NEW = 0x0004, /* has never been switched to */
202 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
203};
204
205/* the structure where most of the perl state is stored, overlaid on the cxstack */
38typedef struct { 206typedef struct {
39 int refcnt; /* pointer reference counter */ 207 SV *defsv;
40 int usecnt; /* shared by how many coroutines */ 208 AV *defav;
41 int gencnt; /* generation counter */ 209 SV *errsv;
210 SV *irsgv;
211#define VAR(name,type) type name;
212# include "state.h"
213#undef VAR
214} perl_slots;
42 215
43 coro_context cctx; 216#define SLOT_COUNT ((sizeof (perl_slots) + sizeof (PERL_CONTEXT) - 1) / sizeof (PERL_CONTEXT))
44 217
45 void *sptr; 218/* this is a structure representing a perl-level coroutine */
46 long ssize; /* positive == mmap, otherwise malloc */
47} coro_stack;
48
49struct coro { 219struct coro {
50 /* the optional C context */ 220 /* the c coroutine allocated to this perl coroutine, if any */
51 coro_stack *stack; 221 coro_cctx *cctx;
52 void *cursp; 222 int gimme;
53 int gencnt;
54 223
55 /* optionally saved, might be zero */ 224 /* process data */
56 AV *defav;
57 SV *defsv;
58 SV *errsv;
59
60 /* saved global state not related to stacks */
61 U8 dowarn;
62 I32 in_eval;
63
64 /* the stacks and related info (callchain etc..) */
65 PERL_SI *curstackinfo;
66 AV *curstack;
67 AV *mainstack; 225 AV *mainstack;
68 SV **stack_sp; 226 perl_slots *slot; /* basically the saved sp */
69 OP *op;
70 SV **curpad;
71 SV **stack_base;
72 SV **stack_max;
73 SV **tmps_stack;
74 I32 tmps_floor;
75 I32 tmps_ix;
76 I32 tmps_max;
77 I32 *markstack;
78 I32 *markstack_ptr;
79 I32 *markstack_max;
80 I32 *scopestack;
81 I32 scopestack_ix;
82 I32 scopestack_max;
83 ANY *savestack;
84 I32 savestack_ix;
85 I32 savestack_max;
86 OP **retstack;
87 I32 retstack_ix;
88 I32 retstack_max;
89 COP *curcop;
90 JMPENV *top_env;
91 227
92 /* data associated with this coroutine (initial args) */ 228 AV *args; /* data associated with this coroutine (initial args) */
93 AV *args; 229 int refcnt; /* coroutines are refcounted, yes */
230 int flags; /* CF_ flags */
231 HV *hv; /* the perl hash associated with this coro, if any */
232
233 /* statistics */
234 int usecount; /* number of transfers to this coro */
235
236 /* coro process data */
237 int prio;
238 SV *throw; /* exception to be thrown */
239
240 /* async_pool */
241 SV *saved_deffh;
242
243 /* linked list */
244 struct coro *next, *prev;
94}; 245};
95 246
96typedef struct coro *Coro__State; 247typedef struct coro *Coro__State;
97typedef struct coro *Coro__State_or_hashref; 248typedef struct coro *Coro__State_or_hashref;
98
99static AV *main_mainstack; /* used to differentiate between $main and others */
100static HV *coro_state_stash;
101static SV *ucoro_state_sv;
102static U32 ucoro_state_hash;
103static HV *padlist_cache;
104
105/* mostly copied from op.c:cv_clone2 */
106STATIC AV *
107clone_padlist (AV *protopadlist)
108{
109 AV *av;
110 I32 ix;
111 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
112 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
113 SV **pname = AvARRAY (protopad_name);
114 SV **ppad = AvARRAY (protopad);
115 I32 fname = AvFILLp (protopad_name);
116 I32 fpad = AvFILLp (protopad);
117 AV *newpadlist, *newpad_name, *newpad;
118 SV **npad;
119
120 newpad_name = newAV ();
121 for (ix = fname; ix >= 0; ix--)
122 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
123
124 newpad = newAV ();
125 av_fill (newpad, AvFILLp (protopad));
126 npad = AvARRAY (newpad);
127
128 newpadlist = newAV ();
129 AvREAL_off (newpadlist);
130 av_store (newpadlist, 0, (SV *) newpad_name);
131 av_store (newpadlist, 1, (SV *) newpad);
132
133 av = newAV (); /* will be @_ */
134 av_extend (av, 0);
135 av_store (newpad, 0, (SV *) av);
136 AvFLAGS (av) = AVf_REIFY;
137
138 for (ix = fpad; ix > 0; ix--)
139 {
140 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
141 if (namesv && namesv != &PL_sv_undef)
142 {
143 char *name = SvPVX (namesv); /* XXX */
144 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
145 { /* lexical from outside? */
146 npad[ix] = SvREFCNT_inc (ppad[ix]);
147 }
148 else
149 { /* our own lexical */
150 SV *sv;
151 if (*name == '&')
152 sv = SvREFCNT_inc (ppad[ix]);
153 else if (*name == '@')
154 sv = (SV *) newAV ();
155 else if (*name == '%')
156 sv = (SV *) newHV ();
157 else
158 sv = NEWSV (0, 0);
159 if (!SvPADBUSY (sv))
160 SvPADMY_on (sv);
161 npad[ix] = sv;
162 }
163 }
164 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
165 {
166 npad[ix] = SvREFCNT_inc (ppad[ix]);
167 }
168 else
169 {
170 SV *sv = NEWSV (0, 0);
171 SvPADTMP_on (sv);
172 npad[ix] = sv;
173 }
174 }
175
176#if 0 /* return -ENOTUNDERSTOOD */
177 /* Now that vars are all in place, clone nested closures. */
178
179 for (ix = fpad; ix > 0; ix--) {
180 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
181 if (namesv
182 && namesv != &PL_sv_undef
183 && !(SvFLAGS(namesv) & SVf_FAKE)
184 && *SvPVX(namesv) == '&'
185 && CvCLONE(ppad[ix]))
186 {
187 CV *kid = cv_clone((CV*)ppad[ix]);
188 SvREFCNT_dec(ppad[ix]);
189 CvCLONE_on(kid);
190 SvPADMY_on(kid);
191 npad[ix] = (SV*)kid;
192 }
193 }
194#endif
195
196 return newpadlist;
197}
198
199#ifdef MAY_FLUSH
200STATIC void
201free_padlist (AV *padlist)
202{
203 /* may be during global destruction */
204 if (SvREFCNT(padlist))
205 {
206 I32 i = AvFILLp(padlist);
207 while (i >= 0)
208 {
209 SV **svp = av_fetch(padlist, i--, FALSE);
210 SV *sv = svp ? *svp : Nullsv;
211 if (sv)
212 SvREFCNT_dec(sv);
213 }
214
215 SvREFCNT_dec((SV*)padlist);
216 }
217}
218#endif
219
220/* the next two functions merely cache the padlists */
221STATIC void
222get_padlist (CV *cv)
223{
224 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
225
226 if (he && AvFILLp ((AV *)*he) >= 0)
227 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
228 else
229 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
230}
231
232STATIC void
233put_padlist (CV *cv)
234{
235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
236
237 if (SvTYPE (*he) != SVt_PVAV)
238 {
239 SvREFCNT_dec (*he);
240 *he = (SV *)newAV ();
241 }
242
243 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
244}
245
246#ifdef MAY_FLUSH
247STATIC void
248flush_padlist_cache ()
249{
250 HV *hv = padlist_cache;
251 padlist_cache = newHV ();
252
253 if (hv_iterinit (hv))
254 {
255 HE *he;
256 AV *padlist;
257
258 while (!!(he = hv_iternext (hv)))
259 {
260 AV *av = (AV *)HeVAL(he);
261
262 /* casting is fun. */
263 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
264 free_padlist (padlist);
265 }
266 }
267
268 SvREFCNT_dec (hv);
269}
270#endif
271
272#define SB do {
273#define SE } while (0)
274
275#define LOAD(state) load_state(aTHX_ (state));
276#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
277
278#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
279
280static void
281load_state(pTHX_ Coro__State c)
282{
283 PL_dowarn = c->dowarn;
284 PL_in_eval = c->in_eval;
285
286 PL_curstackinfo = c->curstackinfo;
287 PL_curstack = c->curstack;
288 PL_mainstack = c->mainstack;
289 PL_stack_sp = c->stack_sp;
290 PL_op = c->op;
291 PL_curpad = c->curpad;
292 PL_stack_base = c->stack_base;
293 PL_stack_max = c->stack_max;
294 PL_tmps_stack = c->tmps_stack;
295 PL_tmps_floor = c->tmps_floor;
296 PL_tmps_ix = c->tmps_ix;
297 PL_tmps_max = c->tmps_max;
298 PL_markstack = c->markstack;
299 PL_markstack_ptr = c->markstack_ptr;
300 PL_markstack_max = c->markstack_max;
301 PL_scopestack = c->scopestack;
302 PL_scopestack_ix = c->scopestack_ix;
303 PL_scopestack_max = c->scopestack_max;
304 PL_savestack = c->savestack;
305 PL_savestack_ix = c->savestack_ix;
306 PL_savestack_max = c->savestack_max;
307 PL_retstack = c->retstack;
308 PL_retstack_ix = c->retstack_ix;
309 PL_retstack_max = c->retstack_max;
310 PL_curcop = c->curcop;
311 PL_top_env = c->top_env;
312
313 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
315 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
316
317 {
318 dSP;
319 CV *cv;
320
321 /* now do the ugly restore mess */
322 while ((cv = (CV *)POPs))
323 {
324 AV *padlist = (AV *)POPs;
325
326 if (padlist)
327 {
328 put_padlist (cv); /* mark this padlist as available */
329 CvPADLIST(cv) = padlist;
330#ifdef USE_THREADS
331 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
332#endif
333 }
334
335 ++CvDEPTH(cv);
336 }
337
338 PUTBACK;
339 }
340}
341
342static void
343save_state(pTHX_ Coro__State c, int flags)
344{
345 {
346 dSP;
347 I32 cxix = cxstack_ix;
348 PERL_CONTEXT *ccstk = cxstack;
349 PERL_SI *top_si = PL_curstackinfo;
350
351 /*
352 * the worst thing you can imagine happens first - we have to save
353 * (and reinitialize) all cv's in the whole callchain :(
354 */
355
356 PUSHs (Nullsv);
357 /* this loop was inspired by pp_caller */
358 for (;;)
359 {
360 do
361 {
362 PERL_CONTEXT *cx = &ccstk[cxix--];
363
364 if (CxTYPE(cx) == CXt_SUB)
365 {
366 CV *cv = cx->blk_sub.cv;
367 if (CvDEPTH(cv))
368 {
369#ifdef USE_THREADS
370 /*XPUSHs ((SV *)CvOWNER(cv));*/
371 /*CvOWNER(cv) = 0;*/
372 /*error must unlock this cv etc.. etc...*/
373#endif
374 EXTEND (SP, CvDEPTH(cv)*2);
375
376 while (--CvDEPTH(cv))
377 {
378 /* this tells the restore code to increment CvDEPTH */
379 PUSHs (Nullsv);
380 PUSHs ((SV *)cv);
381 }
382
383 PUSHs ((SV *)CvPADLIST(cv));
384 PUSHs ((SV *)cv);
385
386 get_padlist (cv); /* this is a monster */
387 }
388 }
389 else if (CxTYPE(cx) == CXt_FORMAT)
390 {
391 /* I never used formats, so how should I know how these are implemented? */
392 /* my bold guess is as a simple, plain sub... */
393 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
394 }
395 }
396 while (cxix >= 0);
397
398 if (top_si->si_type == PERLSI_MAIN)
399 break;
400
401 top_si = top_si->si_prev;
402 ccstk = top_si->si_cxstack;
403 cxix = top_si->si_cxix;
404 }
405
406 PUTBACK;
407 }
408
409 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
410 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
411 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
412
413 c->dowarn = PL_dowarn;
414 c->in_eval = PL_in_eval;
415
416 c->curstackinfo = PL_curstackinfo;
417 c->curstack = PL_curstack;
418 c->mainstack = PL_mainstack;
419 c->stack_sp = PL_stack_sp;
420 c->op = PL_op;
421 c->curpad = PL_curpad;
422 c->stack_base = PL_stack_base;
423 c->stack_max = PL_stack_max;
424 c->tmps_stack = PL_tmps_stack;
425 c->tmps_floor = PL_tmps_floor;
426 c->tmps_ix = PL_tmps_ix;
427 c->tmps_max = PL_tmps_max;
428 c->markstack = PL_markstack;
429 c->markstack_ptr = PL_markstack_ptr;
430 c->markstack_max = PL_markstack_max;
431 c->scopestack = PL_scopestack;
432 c->scopestack_ix = PL_scopestack_ix;
433 c->scopestack_max = PL_scopestack_max;
434 c->savestack = PL_savestack;
435 c->savestack_ix = PL_savestack_ix;
436 c->savestack_max = PL_savestack_max;
437 c->retstack = PL_retstack;
438 c->retstack_ix = PL_retstack_ix;
439 c->retstack_max = PL_retstack_max;
440 c->curcop = PL_curcop;
441 c->top_env = PL_top_env;
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 assumption that coroutines do not usually need
448 * a lot of stackspace.
449 */
450STATIC void
451coro_init_stacks (pTHX)
452{
453 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
454 PL_curstackinfo->si_type = PERLSI_MAIN;
455 PL_curstack = PL_curstackinfo->si_stack;
456 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
457
458 PL_stack_base = AvARRAY(PL_curstack);
459 PL_stack_sp = PL_stack_base;
460 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
461
462 New(50,PL_tmps_stack,96,SV*);
463 PL_tmps_floor = -1;
464 PL_tmps_ix = -1;
465 PL_tmps_max = 96;
466
467 New(54,PL_markstack,16,I32);
468 PL_markstack_ptr = PL_markstack;
469 PL_markstack_max = PL_markstack + 16;
470
471 SET_MARK_OFFSET;
472
473 New(54,PL_scopestack,16,I32);
474 PL_scopestack_ix = 0;
475 PL_scopestack_max = 16;
476
477 New(54,PL_savestack,96,ANY);
478 PL_savestack_ix = 0;
479 PL_savestack_max = 96;
480
481 New(54,PL_retstack,8,OP*);
482 PL_retstack_ix = 0;
483 PL_retstack_max = 8;
484}
485
486/*
487 * destroy the stacks, the callchain etc...
488 * still there is a memleak of 128 bytes...
489 */
490STATIC void
491destroy_stacks(pTHX)
492{
493 /* is this ugly, I ask? */
494 while (PL_scopestack_ix)
495 LEAVE;
496
497 /* sure it is, but more important: is it correct?? :/ */
498 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
499 FREETMPS;
500
501 while (PL_curstackinfo->si_next)
502 PL_curstackinfo = PL_curstackinfo->si_next;
503
504 while (PL_curstackinfo)
505 {
506 PERL_SI *p = PL_curstackinfo->si_prev;
507
508 {
509 dSP;
510 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
511 PUTBACK; /* possibly superfluous */
512 }
513
514 if (PL_main_cv != Nullcv) /* don't during destruction. hack? */
515 dounwind(-1);
516
517 SvREFCNT_dec(PL_curstackinfo->si_stack);
518 Safefree(PL_curstackinfo->si_cxstack);
519 Safefree(PL_curstackinfo);
520 PL_curstackinfo = p;
521 }
522
523 Safefree(PL_tmps_stack);
524 Safefree(PL_markstack);
525 Safefree(PL_scopestack);
526 Safefree(PL_savestack);
527 Safefree(PL_retstack);
528}
529
530static void
531allocate_stack (Coro__State ctx, int alloc)
532{
533 coro_stack *stack;
534
535 New (0, stack, 1, coro_stack);
536
537 stack->refcnt = 1;
538 stack->usecnt = 1;
539 stack->gencnt = ctx->gencnt = 0;
540 if (alloc)
541 {
542#ifdef HAVE_MMAP
543 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
544 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
545 if (stack->sptr == (void *)-1)
546#endif
547 {
548 /*FIXME*//*D*//* reasonable stack size! */
549 stack->ssize = -4096 * sizeof (long);
550 New (0, stack->sptr, 4096, long);
551 }
552 }
553 else
554 stack->sptr = 0;
555
556 ctx->stack = stack;
557}
558
559static void
560deallocate_stack (Coro__State ctx)
561{
562 coro_stack *stack = ctx->stack;
563
564 ctx->stack = 0;
565
566 if (stack)
567 {
568 if (!--stack->refcnt)
569 {
570#ifdef HAVE_MMAP
571 if (stack->ssize > 0 && stack->sptr)
572 munmap (stack->sptr, stack->ssize);
573 else
574#else
575 Safefree (stack->sptr);
576#endif
577 Safefree (stack);
578 }
579 else if (ctx->gencnt == stack->gencnt)
580 --stack->usecnt;
581 }
582}
583
584static void
585setup_coro (void *arg)
586{
587 /*
588 * emulate part of the perl startup here.
589 */
590 dSP;
591 Coro__State ctx = (Coro__State)arg;
592 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
593
594 coro_init_stacks (aTHX);
595 /*PL_curcop = 0;*/
596 /*PL_in_eval = PL_in_eval;*/ /* inherit */
597 SvREFCNT_dec (GvAV (PL_defgv));
598 GvAV (PL_defgv) = ctx->args;
599
600 SPAGAIN;
601
602 if (ctx->stack)
603 {
604 ctx->cursp = 0;
605
606 PUSHMARK(SP);
607 PUTBACK;
608 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
609
610 if (SvTRUE (ERRSV))
611 croak (NULL);
612 else
613 croak ("FATAL: CCTXT coroutine returned!");
614 }
615 else
616 {
617 UNOP myop;
618
619 PL_op = (OP *)&myop;
620
621 Zero(&myop, 1, UNOP);
622 myop.op_next = Nullop;
623 myop.op_flags = OPf_WANT_VOID;
624
625 PUSHMARK(SP);
626 XPUSHs (sub_init);
627 /*
628 * the next line is slightly wrong, as PL_op->op_next
629 * is actually being executed so we skip the first op.
630 * that doesn't matter, though, since it is only
631 * pp_nextstate and we never return...
632 * ah yes, and I don't care anyways ;)
633 */
634 PUTBACK;
635 PL_op = pp_entersub();
636 SPAGAIN;
637
638 ENTER; /* necessary e.g. for dounwind */
639 }
640}
641
642static void
643continue_coro (void *arg)
644{
645 /*
646 * this is a _very_ stripped down perl interpreter ;)
647 */
648 Coro__State ctx = (Coro__State)arg;
649
650 /*FIXME*//* must set up top_env here */
651 ctx->cursp = 0;
652 PL_op = PL_op->op_next;
653 CALLRUNOPS(aTHX);
654
655 abort ();
656}
657
658STATIC void
659transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
660{
661 dSTACKLEVEL;
662 static struct coro *xnext;
663
664 if (prev != next)
665 {
666 xnext = next;
667
668 if (next->mainstack)
669 {
670 SAVE (prev, flags);
671 LOAD (next);
672
673 /* mark this state as in-use */
674 next->mainstack = 0;
675 next->tmps_ix = -2;
676
677 /* stacklevel changed? if yes, grab the stack for us! */
678 if (flags & TRANSFER_SAVE_CCTXT)
679 {
680 if (!prev->stack)
681 allocate_stack (prev, 0);
682 else if (prev->cursp != stacklevel
683 && prev->stack->usecnt > 1)
684 {
685 prev->gencnt = ++prev->stack->gencnt;
686 prev->stack->usecnt = 1;
687 }
688
689 /* has our stack been invalidated? */
690 if (next->stack && next->stack->gencnt != next->gencnt)
691 {
692 deallocate_stack (next);
693 allocate_stack (next, 1);
694 coro_create (&(next->stack->cctx),
695 continue_coro, (void *)next,
696 next->stack->sptr, labs (next->stack->ssize));
697 }
698
699 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
700 /* don't add any code here */
701 }
702
703 }
704 else if (next->tmps_ix == -2)
705 croak ("tried to transfer to running coroutine");
706 else
707 {
708 SAVE (prev, -1); /* first get rid of the old state */
709
710 if (flags & TRANSFER_SAVE_CCTXT)
711 {
712 if (!prev->stack)
713 allocate_stack (prev, 0);
714
715 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
716 {
717 setup_coro (next);
718
719 prev->stack->refcnt++;
720 prev->stack->usecnt++;
721 next->stack = prev->stack;
722 next->gencnt = prev->gencnt;
723 }
724 else
725 {
726 allocate_stack (next, 1);
727 coro_create (&(next->stack->cctx),
728 setup_coro, (void *)next,
729 next->stack->sptr, labs (next->stack->ssize));
730 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
731 /* don't add any code here */
732 }
733 }
734 else
735 setup_coro (next);
736 }
737 }
738
739 /*
740 * xnext is now either prev or next, depending on wether
741 * we switched the c stack or not. that's why i use a global
742 * variable, that should become thread-specific at one point.
743 */
744 xnext->cursp = stacklevel;
745}
746
747static struct coro *
748sv_to_coro (SV *arg, const char *funcname, const char *varname)
749{
750 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
751 {
752 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
753
754 if (!he)
755 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
756
757 arg = HeVAL(he);
758 }
759
760 /* must also be changed inside Coro::Cont::yield */
761 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
762 return (struct coro *) SvIV((SV*)SvRV(arg));
763
764 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
765 /*NORETURN*/
766}
767
768static void
769api_transfer(pTHX_ SV *prev, SV *next, int flags)
770{
771 transfer(aTHX_
772 sv_to_coro (prev, "Coro::transfer", "prev"),
773 sv_to_coro (next, "Coro::transfer", "next"),
774 flags);
775}
776 249
777/** Coro ********************************************************************/ 250/** Coro ********************************************************************/
778 251
779#define PRIO_MAX 3 252#define PRIO_MAX 3
780#define PRIO_HIGH 1 253#define PRIO_HIGH 1
782#define PRIO_LOW -1 255#define PRIO_LOW -1
783#define PRIO_IDLE -3 256#define PRIO_IDLE -3
784#define PRIO_MIN -4 257#define PRIO_MIN -4
785 258
786/* for Coro.pm */ 259/* for Coro.pm */
787static GV *coro_current, *coro_idle; 260static SV *coro_current;
788static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 261static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
789static int coro_nready; 262static int coro_nready;
263static struct coro *coro_first;
264
265/** lowlevel stuff **********************************************************/
266
267static SV *
268coro_get_sv (const char *name, int create)
269{
270#if PERL_VERSION_ATLEAST (5,9,0)
271 /* silence stupid and wrong 5.10 warning that I am unable to switch off */
272 get_sv (name, create);
273#endif
274 return get_sv (name, create);
275}
276
277static AV *
278coro_get_av (const char *name, int create)
279{
280#if PERL_VERSION_ATLEAST (5,9,0)
281 /* silence stupid and wrong 5.10 warning that I am unable to switch off */
282 get_av (name, create);
283#endif
284 return get_av (name, create);
285}
286
287static HV *
288coro_get_hv (const char *name, int create)
289{
290#if PERL_VERSION_ATLEAST (5,9,0)
291 /* silence stupid and wrong 5.10 warning that I am unable to switch off */
292 get_hv (name, create);
293#endif
294 return get_hv (name, create);
295}
296
297static AV *
298coro_clone_padlist (pTHX_ CV *cv)
299{
300 AV *padlist = CvPADLIST (cv);
301 AV *newpadlist, *newpad;
302
303 newpadlist = newAV ();
304 AvREAL_off (newpadlist);
305#if PERL_VERSION_ATLEAST (5,9,0)
306 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
307#else
308 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
309#endif
310 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
311 --AvFILLp (padlist);
312
313 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
314 av_store (newpadlist, 1, (SV *)newpad);
315
316 return newpadlist;
317}
790 318
791static void 319static void
792coro_enq (SV *sv) 320free_padlist (pTHX_ AV *padlist)
793{ 321{
794 if (SvROK (sv)) 322 /* may be during global destruction */
323 if (SvREFCNT (padlist))
795 { 324 {
796 SV *hv = SvRV (sv); 325 I32 i = AvFILLp (padlist);
797 if (SvTYPE (hv) == SVt_PVHV) 326 while (i >= 0)
798 { 327 {
799 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); 328 SV **svp = av_fetch (padlist, i--, FALSE);
800 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; 329 if (svp)
330 {
331 SV *sv;
332 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
333 SvREFCNT_dec (sv);
801 334
802 prio = prio > PRIO_MAX ? PRIO_MAX 335 SvREFCNT_dec (*svp);
803 : prio < PRIO_MIN ? PRIO_MIN 336 }
804 : prio;
805
806 av_push (coro_ready [prio - PRIO_MIN], sv);
807 coro_nready++;
808
809 return;
810 } 337 }
338
339 SvREFCNT_dec ((SV*)padlist);
340 }
341}
342
343static int
344coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
345{
346 AV *padlist;
347 AV *av = (AV *)mg->mg_obj;
348
349 /* casting is fun. */
350 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
351 free_padlist (aTHX_ padlist);
352
353 SvREFCNT_dec (av);
354
355 return 0;
356}
357
358#define PERL_MAGIC_coro PERL_MAGIC_ext
359
360static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
361
362#define CORO_MAGIC(cv) \
363 SvMAGIC (cv) \
364 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
365 ? SvMAGIC (cv) \
366 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
367 : 0
368
369static struct coro *
370SvSTATE_ (pTHX_ SV *coro)
371{
372 HV *stash;
373 MAGIC *mg;
374
375 if (SvROK (coro))
376 coro = SvRV (coro);
377
378 if (expect_false (SvTYPE (coro) != SVt_PVHV))
379 croak ("Coro::State object required");
380
381 stash = SvSTASH (coro);
382 if (expect_false (stash != coro_stash && stash != coro_state_stash))
383 {
384 /* very slow, but rare, check */
385 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
386 croak ("Coro::State object required");
387 }
388
389 mg = CORO_MAGIC (coro);
390 return (struct coro *)mg->mg_ptr;
391}
392
393#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
394
395/* the next two functions merely cache the padlists */
396static void
397get_padlist (pTHX_ CV *cv)
398{
399 MAGIC *mg = CORO_MAGIC (cv);
400 AV *av;
401
402 if (expect_true (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0))
403 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
404 else
405 {
406#if CORO_PREFER_PERL_FUNCTIONS
407 /* this is probably cleaner, but also slower? */
408 CV *cp = Perl_cv_clone (cv);
409 CvPADLIST (cv) = CvPADLIST (cp);
410 CvPADLIST (cp) = 0;
411 SvREFCNT_dec (cp);
412#else
413 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
414#endif
811 } 415 }
416}
812 417
813 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 418static void
419put_padlist (pTHX_ CV *cv)
420{
421 MAGIC *mg = CORO_MAGIC (cv);
422 AV *av;
423
424 if (expect_false (!mg))
425 {
426 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
427 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
428 mg->mg_virtual = &vtbl_coro;
429 mg->mg_obj = (SV *)newAV ();
430 }
431
432 av = (AV *)mg->mg_obj;
433
434 if (expect_false (AvFILLp (av) >= AvMAX (av)))
435 av_extend (av, AvMAX (av) + 1);
436
437 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
438}
439
440/** load & save, init *******************************************************/
441
442static void
443load_perl (pTHX_ Coro__State c)
444{
445 perl_slots *slot = c->slot;
446 c->slot = 0;
447
448 PL_mainstack = c->mainstack;
449
450 GvSV (PL_defgv) = slot->defsv;
451 GvAV (PL_defgv) = slot->defav;
452 GvSV (PL_errgv) = slot->errsv;
453 GvSV (irsgv) = slot->irsgv;
454
455 #define VAR(name,type) PL_ ## name = slot->name;
456 # include "state.h"
457 #undef VAR
458
459 /*hv_store (hv_sig, strpair ("__DIE__" ), SvREFCNT_inc (sv_diehook ), 0);*/
460 /*hv_store (hv_sig, strpair ("__WARN__"), SvREFCNT_inc (sv_warnhook), 0);*/
461
462 {
463 dSP;
464
465 CV *cv;
466
467 /* now do the ugly restore mess */
468 while (expect_true (cv = (CV *)POPs))
469 {
470 put_padlist (aTHX_ cv); /* mark this padlist as available */
471 CvDEPTH (cv) = PTR2IV (POPs);
472 CvPADLIST (cv) = (AV *)POPs;
473 }
474
475 PUTBACK;
476 }
477}
478
479static void
480save_perl (pTHX_ Coro__State c)
481{
482 {
483 dSP;
484 I32 cxix = cxstack_ix;
485 PERL_CONTEXT *ccstk = cxstack;
486 PERL_SI *top_si = PL_curstackinfo;
487
488 /*
489 * the worst thing you can imagine happens first - we have to save
490 * (and reinitialize) all cv's in the whole callchain :(
491 */
492
493 XPUSHs (Nullsv);
494 /* this loop was inspired by pp_caller */
495 for (;;)
496 {
497 while (expect_true (cxix >= 0))
498 {
499 PERL_CONTEXT *cx = &ccstk[cxix--];
500
501 if (expect_true (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT))
502 {
503 CV *cv = cx->blk_sub.cv;
504
505 if (expect_true (CvDEPTH (cv)))
506 {
507 EXTEND (SP, 3);
508 PUSHs ((SV *)CvPADLIST (cv));
509 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
510 PUSHs ((SV *)cv);
511
512 CvDEPTH (cv) = 0;
513 get_padlist (aTHX_ cv);
514 }
515 }
516 }
517
518 if (expect_true (top_si->si_type == PERLSI_MAIN))
519 break;
520
521 top_si = top_si->si_prev;
522 ccstk = top_si->si_cxstack;
523 cxix = top_si->si_cxix;
524 }
525
526 PUTBACK;
527 }
528
529 /* allocate some space on the context stack for our purposes */
530 /* we manually unroll here, as usually 2 slots is enough */
531 if (SLOT_COUNT >= 1) CXINC;
532 if (SLOT_COUNT >= 2) CXINC;
533 if (SLOT_COUNT >= 3) CXINC;
534 {
535 int i;
536 for (i = 3; i < SLOT_COUNT; ++i)
537 CXINC;
538 }
539 cxstack_ix -= SLOT_COUNT; /* undo allocation */
540
541 c->mainstack = PL_mainstack;
542
543 {
544 perl_slots *slot = c->slot = (perl_slots *)(cxstack + cxstack_ix + 1);
545
546 slot->defav = GvAV (PL_defgv);
547 slot->defsv = DEFSV;
548 slot->errsv = ERRSV;
549 slot->irsgv = GvSV (irsgv);
550
551 #define VAR(name,type) slot->name = PL_ ## name;
552 # include "state.h"
553 #undef VAR
554 }
555}
556
557/*
558 * allocate various perl stacks. This is an exact copy
559 * of perl.c:init_stacks, except that it uses less memory
560 * on the (sometimes correct) assumption that coroutines do
561 * not usually need a lot of stackspace.
562 */
563#if CORO_PREFER_PERL_FUNCTIONS
564# define coro_init_stacks init_stacks
565#else
566static void
567coro_init_stacks (pTHX)
568{
569 PL_curstackinfo = new_stackinfo(32, 8);
570 PL_curstackinfo->si_type = PERLSI_MAIN;
571 PL_curstack = PL_curstackinfo->si_stack;
572 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
573
574 PL_stack_base = AvARRAY(PL_curstack);
575 PL_stack_sp = PL_stack_base;
576 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
577
578 New(50,PL_tmps_stack,32,SV*);
579 PL_tmps_floor = -1;
580 PL_tmps_ix = -1;
581 PL_tmps_max = 32;
582
583 New(54,PL_markstack,16,I32);
584 PL_markstack_ptr = PL_markstack;
585 PL_markstack_max = PL_markstack + 16;
586
587#ifdef SET_MARK_OFFSET
588 SET_MARK_OFFSET;
589#endif
590
591 New(54,PL_scopestack,8,I32);
592 PL_scopestack_ix = 0;
593 PL_scopestack_max = 8;
594
595 New(54,PL_savestack,24,ANY);
596 PL_savestack_ix = 0;
597 PL_savestack_max = 24;
598
599#if !PERL_VERSION_ATLEAST (5,9,0)
600 New(54,PL_retstack,4,OP*);
601 PL_retstack_ix = 0;
602 PL_retstack_max = 4;
603#endif
604}
605#endif
606
607/*
608 * destroy the stacks, the callchain etc...
609 */
610static void
611coro_destroy_stacks (pTHX)
612{
613 while (PL_curstackinfo->si_next)
614 PL_curstackinfo = PL_curstackinfo->si_next;
615
616 while (PL_curstackinfo)
617 {
618 PERL_SI *p = PL_curstackinfo->si_prev;
619
620 if (!IN_DESTRUCT)
621 SvREFCNT_dec (PL_curstackinfo->si_stack);
622
623 Safefree (PL_curstackinfo->si_cxstack);
624 Safefree (PL_curstackinfo);
625 PL_curstackinfo = p;
626 }
627
628 Safefree (PL_tmps_stack);
629 Safefree (PL_markstack);
630 Safefree (PL_scopestack);
631 Safefree (PL_savestack);
632#if !PERL_VERSION_ATLEAST (5,9,0)
633 Safefree (PL_retstack);
634#endif
635}
636
637static size_t
638coro_rss (pTHX_ struct coro *coro)
639{
640 size_t rss = sizeof (*coro);
641
642 if (coro->mainstack)
643 {
644 perl_slots tmp_slot;
645 perl_slots *slot;
646
647 if (coro->flags & CF_RUNNING)
648 {
649 slot = &tmp_slot;
650
651 #define VAR(name,type) slot->name = PL_ ## name;
652 # include "state.h"
653 #undef VAR
654 }
655 else
656 slot = coro->slot;
657
658 rss += sizeof (slot->curstackinfo);
659 rss += (slot->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT);
660 rss += sizeof (SV) + sizeof (struct xpvav) + (1 + AvMAX (slot->curstack)) * sizeof (SV *);
661 rss += slot->tmps_max * sizeof (SV *);
662 rss += (slot->markstack_max - slot->markstack_ptr) * sizeof (I32);
663 rss += slot->scopestack_max * sizeof (I32);
664 rss += slot->savestack_max * sizeof (ANY);
665
666#if !PERL_VERSION_ATLEAST (5,9,0)
667 rss += slot->retstack_max * sizeof (OP *);
668#endif
669 }
670
671 return rss;
672}
673
674/** coroutine stack handling ************************************************/
675
676static void
677coro_setup (pTHX_ struct coro *coro)
678{
679 /*
680 * emulate part of the perl startup here.
681 */
682 coro_init_stacks (aTHX);
683
684 PL_runops = RUNOPS_DEFAULT;
685 PL_curcop = &PL_compiling;
686 PL_in_eval = EVAL_NULL;
687 PL_comppad = 0;
688 PL_curpm = 0;
689 PL_curpad = 0;
690 PL_localizing = 0;
691 PL_dirty = 0;
692 PL_restartop = 0;
693 PL_diehook = 0; hv_store (hv_sig, strpair ("__DIE__" ), SvREFCNT_inc (sv_diehook ), 0);
694 PL_warnhook = 0; hv_store (hv_sig, strpair ("__WARN__"), SvREFCNT_inc (sv_warnhook), 0);
695
696 GvSV (PL_defgv) = newSV (0);
697 GvAV (PL_defgv) = coro->args; coro->args = 0;
698 GvSV (PL_errgv) = newSV (0);
699 GvSV (irsgv) = newSVpvn ("\n", 1); sv_magic (GvSV (irsgv), (SV *)irsgv, PERL_MAGIC_sv, "/", 0);
700 PL_rs = newSVsv (GvSV (irsgv));
701 PL_defoutgv = (GV *)SvREFCNT_inc (stdoutgv);
702
703 {
704 dSP;
705 LOGOP myop;
706
707 Zero (&myop, 1, LOGOP);
708 myop.op_next = Nullop;
709 myop.op_flags = OPf_WANT_VOID;
710
711 PUSHMARK (SP);
712 XPUSHs (sv_2mortal (av_shift (GvAV (PL_defgv))));
713 PUTBACK;
714 PL_op = (OP *)&myop;
715 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
716 SPAGAIN;
717
718 /*
719 * now its very tricky. the "tail" of the next transfer might end up
720 * either in a new cctx, or an existing one.
721 * in case of an existing one we have to take care of whatever
722 * entersub and transfer do to the perl stack.
723 */
724 ENTER;
725 EXTEND (SP, 4);
726 PUSHs ((SV *)0); /* items */
727 PUSHs ((SV *)0); /* ix, set_stacklevel */
728 PUSHs ((SV *)(sp - PL_stack_base + 1)); /* ax */
729 PUSHs ((SV *)0); /* again */
730 PUTBACK;
731 }
732}
733
734static void
735coro_destroy (pTHX_ struct coro *coro)
736{
737 if (!IN_DESTRUCT)
738 {
739 /* restore all saved variables and stuff */
740 LEAVE_SCOPE (0);
741 assert (PL_tmps_floor == -1);
742
743 /* free all temporaries */
744 FREETMPS;
745 assert (PL_tmps_ix == -1);
746
747 /* unwind all extra stacks */
748 POPSTACK_TO (PL_mainstack);
749
750 /* unwind main stack */
751 dounwind (-1);
752 }
753
754 SvREFCNT_dec (GvSV (PL_defgv));
755 SvREFCNT_dec (GvAV (PL_defgv));
756 SvREFCNT_dec (GvSV (PL_errgv));
757 SvREFCNT_dec (PL_defoutgv);
758 SvREFCNT_dec (PL_rs);
759 SvREFCNT_dec (GvSV (irsgv));
760
761 SvREFCNT_dec (PL_diehook);
762 SvREFCNT_dec (PL_warnhook);
763
764 SvREFCNT_dec (coro->saved_deffh);
765 SvREFCNT_dec (coro->throw);
766
767 coro_destroy_stacks (aTHX);
768}
769
770static void
771free_coro_mortal (pTHX)
772{
773 if (expect_true (coro_mortal))
774 {
775 SvREFCNT_dec (coro_mortal);
776 coro_mortal = 0;
777 }
778}
779
780static int
781runops_trace (pTHX)
782{
783 COP *oldcop = 0;
784 int oldcxix = -2;
785 struct coro *coro = SvSTATE (coro_current); /* trace cctx is tied to specific coro */
786 coro_cctx *cctx = coro->cctx;
787
788 while ((PL_op = CALL_FPTR (PL_op->op_ppaddr) (aTHX)))
789 {
790 PERL_ASYNC_CHECK ();
791
792 if (cctx->flags & CC_TRACE_ALL)
793 {
794 if (PL_op->op_type == OP_LEAVESUB && cctx->flags & CC_TRACE_SUB)
795 {
796 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
797 SV **bot, **top;
798 AV *av = newAV (); /* return values */
799 SV **cb;
800 dSP;
801
802 GV *gv = CvGV (cx->blk_sub.cv);
803 SV *fullname = sv_2mortal (newSV (0));
804 if (isGV (gv))
805 gv_efullname3 (fullname, gv, 0);
806
807 bot = PL_stack_base + cx->blk_oldsp + 1;
808 top = cx->blk_gimme == G_ARRAY ? SP + 1
809 : cx->blk_gimme == G_SCALAR ? bot + 1
810 : bot;
811
812 av_extend (av, top - bot);
813 while (bot < top)
814 av_push (av, SvREFCNT_inc (*bot++));
815
816 PL_runops = RUNOPS_DEFAULT;
817 ENTER;
818 SAVETMPS;
819 EXTEND (SP, 3);
820 PUSHMARK (SP);
821 PUSHs (&PL_sv_no);
822 PUSHs (fullname);
823 PUSHs (sv_2mortal (newRV_noinc ((SV *)av)));
824 PUTBACK;
825 cb = hv_fetch ((HV *)SvRV (coro_current), strpair ("_trace_sub_cb"), 0);
826 if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
827 SPAGAIN;
828 FREETMPS;
829 LEAVE;
830 PL_runops = runops_trace;
831 }
832
833 if (oldcop != PL_curcop)
834 {
835 oldcop = PL_curcop;
836
837 if (PL_curcop != &PL_compiling)
838 {
839 SV **cb;
840
841 if (oldcxix != cxstack_ix && cctx->flags & CC_TRACE_SUB)
842 {
843 PERL_CONTEXT *cx = &cxstack[cxstack_ix];
844
845 if (CxTYPE (cx) == CXt_SUB && oldcxix < cxstack_ix)
846 {
847 runops_proc_t old_runops = PL_runops;
848 dSP;
849 GV *gv = CvGV (cx->blk_sub.cv);
850 SV *fullname = sv_2mortal (newSV (0));
851
852 if (isGV (gv))
853 gv_efullname3 (fullname, gv, 0);
854
855 PL_runops = RUNOPS_DEFAULT;
856 ENTER;
857 SAVETMPS;
858 EXTEND (SP, 3);
859 PUSHMARK (SP);
860 PUSHs (&PL_sv_yes);
861 PUSHs (fullname);
862 PUSHs (cx->blk_sub.hasargs ? sv_2mortal (newRV_inc ((SV *)cx->blk_sub.argarray)) : &PL_sv_undef);
863 PUTBACK;
864 cb = hv_fetch ((HV *)SvRV (coro_current), strpair ("_trace_sub_cb"), 0);
865 if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
866 SPAGAIN;
867 FREETMPS;
868 LEAVE;
869 PL_runops = runops_trace;
870 }
871
872 oldcxix = cxstack_ix;
873 }
874
875 if (cctx->flags & CC_TRACE_LINE)
876 {
877 dSP;
878
879 PL_runops = RUNOPS_DEFAULT;
880 ENTER;
881 SAVETMPS;
882 EXTEND (SP, 3);
883 PL_runops = RUNOPS_DEFAULT;
884 PUSHMARK (SP);
885 PUSHs (sv_2mortal (newSVpv (OutCopFILE (oldcop), 0)));
886 PUSHs (sv_2mortal (newSViv (CopLINE (oldcop))));
887 PUTBACK;
888 cb = hv_fetch ((HV *)SvRV (coro_current), strpair ("_trace_line_cb"), 0);
889 if (cb) call_sv (*cb, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
890 SPAGAIN;
891 FREETMPS;
892 LEAVE;
893 PL_runops = runops_trace;
894 }
895 }
896 }
897 }
898 }
899
900 TAINT_NOT;
901 return 0;
902}
903
904/* inject a fake call to Coro::State::_cctx_init into the execution */
905/* _cctx_init should be careful, as it could be called at almost any time */
906/* during execution of a perl program */
907static void NOINLINE
908cctx_prepare (pTHX_ coro_cctx *cctx)
909{
910 dSP;
911 LOGOP myop;
912
913 PL_top_env = &PL_start_env;
914
915 if (cctx->flags & CC_TRACE)
916 PL_runops = runops_trace;
917
918 Zero (&myop, 1, LOGOP);
919 myop.op_next = PL_op;
920 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
921
922 PUSHMARK (SP);
923 EXTEND (SP, 2);
924 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
925 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
926 PUTBACK;
927 PL_op = (OP *)&myop;
928 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
929 SPAGAIN;
930}
931
932/*
933 * this is a _very_ stripped down perl interpreter ;)
934 */
935static void
936cctx_run (void *arg)
937{
938 dTHX;
939
940 /* cctx_run is the alternative tail of transfer(), so unlock here. */
941 UNLOCK;
942
943 /* we now skip the entersub that lead to transfer() */
944 PL_op = PL_op->op_next;
945
946 /* inject a fake subroutine call to cctx_init */
947 cctx_prepare (aTHX_ (coro_cctx *)arg);
948
949 /* somebody or something will hit me for both perl_run and PL_restartop */
950 PL_restartop = PL_op;
951 perl_run (PL_curinterp);
952
953 /*
954 * If perl-run returns we assume exit() was being called or the coro
955 * fell off the end, which seems to be the only valid (non-bug)
956 * reason for perl_run to return. We try to exit by jumping to the
957 * bootstrap-time "top" top_env, as we cannot restore the "main"
958 * coroutine as Coro has no such concept
959 */
960 PL_top_env = main_top_env;
961 JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */
962}
963
964static coro_cctx *
965cctx_new ()
966{
967 coro_cctx *cctx;
968 void *stack_start;
969 size_t stack_size;
970
971 ++cctx_count;
972
973 Newz (0, cctx, 1, coro_cctx);
974
975#if HAVE_MMAP
976 cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
977 /* mmap supposedly does allocate-on-write for us */
978 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
979
980 if (cctx->sptr != (void *)-1)
981 {
982# if CORO_STACKGUARD
983 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
984# endif
985 stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
986 stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
987 cctx->flags |= CC_MAPPED;
988 }
989 else
990#endif
991 {
992 cctx->ssize = coro_stacksize * (long)sizeof (long);
993 New (0, cctx->sptr, coro_stacksize, long);
994
995 if (!cctx->sptr)
996 {
997 perror ("FATAL: unable to allocate stack for coroutine");
998 _exit (EXIT_FAILURE);
999 }
1000
1001 stack_start = cctx->sptr;
1002 stack_size = cctx->ssize;
1003 }
1004
1005 REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
1006 coro_create (&cctx->cctx, cctx_run, (void *)cctx, stack_start, stack_size);
1007
1008 return cctx;
1009}
1010
1011static void
1012cctx_destroy (coro_cctx *cctx)
1013{
1014 if (!cctx)
1015 return;
1016
1017 --cctx_count;
1018
1019#if CORO_USE_VALGRIND
1020 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
1021#endif
1022
1023#if HAVE_MMAP
1024 if (cctx->flags & CC_MAPPED)
1025 munmap (cctx->sptr, cctx->ssize);
1026 else
1027#endif
1028 Safefree (cctx->sptr);
1029
1030 Safefree (cctx);
1031}
1032
1033/* wether this cctx should be destructed */
1034#define CCTX_EXPIRED(cctx) ((cctx)->ssize < coro_stacksize || ((cctx)->flags & CC_NOREUSE))
1035
1036static coro_cctx *
1037cctx_get (pTHX_ int gimme)
1038{
1039 while (expect_true (cctx_first[gimme]))
1040 {
1041 coro_cctx *cctx = cctx_first[gimme];
1042 cctx_first[gimme] = cctx->next;
1043 --cctx_idle[gimme];
1044
1045 if (expect_true (!CCTX_EXPIRED (cctx)))
1046 return cctx;
1047
1048 cctx_destroy (cctx);
1049 }
1050
1051 assert (!gimme);
1052 return cctx_new ();
1053}
1054
1055static void
1056cctx_put (coro_cctx *cctx, int gimme)
1057{
1058 /* free another cctx if overlimit */
1059 if (expect_false (cctx_idle[gimme] >= MAX_IDLE_CCTX))
1060 {
1061 coro_cctx *first = cctx_first[gimme];
1062 cctx_first[gimme] = first->next;
1063 --cctx_idle[gimme];
1064
1065 cctx_destroy (first);
1066 }
1067
1068 ++cctx_idle[gimme];
1069 cctx->next = cctx_first[gimme];
1070 cctx_first[gimme] = cctx;
1071}
1072
1073/** coroutine switching *****************************************************/
1074
1075static void
1076transfer_check (pTHX_ struct coro *prev, struct coro *next)
1077{
1078 if (expect_true (prev != next))
1079 {
1080 if (expect_false (!(prev->flags & (CF_RUNNING | CF_NEW))))
1081 croak ("Coro::State::transfer called with non-running/new prev Coro::State, but can only transfer from running or new states");
1082
1083 if (expect_false (next->flags & CF_RUNNING))
1084 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
1085
1086 if (expect_false (next->flags & CF_DESTROYED))
1087 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
1088
1089 if (
1090#if PERL_VERSION_ATLEAST (5,9,0)
1091 expect_false (PL_parser)
1092#else
1093 expect_false (PL_lex_state != LEX_NOTPARSING)
1094#endif
1095 )
1096 croak ("Coro::State::transfer called while parsing, but this is not supported");
1097 }
1098}
1099
1100/* always use the TRANSFER macro */
1101static void NOINLINE
1102transfer (pTHX_ struct coro *prev, struct coro *next)
1103{
1104 dSTACKLEVEL;
1105
1106 /* sometimes transfer is only called to set idle_sp */
1107 if (expect_false (!next))
1108 {
1109 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
1110 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
1111 }
1112 else if (expect_true (prev != next))
1113 {
1114 coro_cctx *prev__cctx;
1115
1116 if (expect_false (prev->flags & CF_NEW))
1117 {
1118 /* create a new empty context */
1119 Newz (0, prev->cctx, 1, coro_cctx);
1120 prev->flags &= ~CF_NEW;
1121 prev->flags |= CF_RUNNING;
1122 }
1123
1124 prev->flags &= ~CF_RUNNING;
1125 next->flags |= CF_RUNNING;
1126
1127 LOCK;
1128
1129 if (expect_false (next->flags & CF_NEW))
1130 {
1131 /* need to start coroutine */
1132 next->flags &= ~CF_NEW;
1133 /* first get rid of the old state */
1134 save_perl (aTHX_ prev);
1135 /* setup coroutine call */
1136 coro_setup (aTHX_ next);
1137 }
1138 else
1139 {
1140 /* coroutine already started */
1141 save_perl (aTHX_ prev);
1142 load_perl (aTHX_ next);
1143 }
1144
1145 prev__cctx = prev->cctx;
1146
1147 /* possibly "free" the cctx */
1148 if (expect_true (prev__cctx->idle_sp == STACKLEVEL && !(prev__cctx->flags & CC_TRACE)))
1149 {
1150 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
1151 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
1152
1153 prev->cctx = 0;
1154
1155 /* if the cctx is about to be destroyed we need to make sure we won't see it in cctx_get */
1156 /* without this the next cctx_get might destroy the prev__cctx while still in use */
1157 if (expect_false (CCTX_EXPIRED (prev__cctx)))
1158 if (!next->cctx)
1159 next->cctx = cctx_get (aTHX_ next->gimme);
1160
1161 cctx_put (prev__cctx, prev->gimme);
1162 }
1163
1164 ++next->usecount;
1165
1166 if (expect_true (!next->cctx))
1167 next->cctx = cctx_get (aTHX_ next->gimme);
1168
1169 if (expect_false (prev__cctx != next->cctx))
1170 {
1171 prev__cctx->top_env = PL_top_env;
1172 PL_top_env = next->cctx->top_env;
1173 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
1174 }
1175
1176 free_coro_mortal (aTHX);
1177 UNLOCK;
1178
1179 if (expect_false (prev->throw || next->throw))
1180 {
1181 struct coro *coro = SvSTATE (coro_current);
1182
1183 if (coro->throw)
1184 {
1185 SV *exception = coro->throw;
1186 coro->throw = 0;
1187 sv_setsv (ERRSV, exception);
1188 croak (0);
1189 }
1190 }
1191 }
1192}
1193
1194struct transfer_args
1195{
1196 struct coro *prev, *next;
1197};
1198
1199#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
1200#define TRANSFER_CHECK(ta) transfer_check (aTHX_ (ta).prev, (ta).next)
1201
1202/** high level stuff ********************************************************/
1203
1204static int
1205coro_state_destroy (pTHX_ struct coro *coro)
1206{
1207 if (coro->flags & CF_DESTROYED)
1208 return 0;
1209
1210 coro->flags |= CF_DESTROYED;
1211
1212 if (coro->flags & CF_READY)
1213 {
1214 /* reduce nready, as destroying a ready coro effectively unreadies it */
1215 /* alternative: look through all ready queues and remove the coro */
1216 LOCK;
1217 --coro_nready;
1218 UNLOCK;
1219 }
1220 else
1221 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
1222
1223 if (coro->mainstack && coro->mainstack != main_mainstack)
1224 {
1225 struct coro temp;
1226
1227 if (coro->flags & CF_RUNNING)
1228 croak ("FATAL: tried to destroy currently running coroutine");
1229
1230 save_perl (aTHX_ &temp);
1231 load_perl (aTHX_ coro);
1232
1233 coro_destroy (aTHX_ coro);
1234
1235 load_perl (aTHX_ &temp);
1236
1237 coro->slot = 0;
1238 }
1239
1240 cctx_destroy (coro->cctx);
1241 SvREFCNT_dec (coro->args);
1242
1243 if (coro->next) coro->next->prev = coro->prev;
1244 if (coro->prev) coro->prev->next = coro->next;
1245 if (coro == coro_first) coro_first = coro->next;
1246
1247 return 1;
1248}
1249
1250static int
1251coro_state_free (pTHX_ SV *sv, MAGIC *mg)
1252{
1253 struct coro *coro = (struct coro *)mg->mg_ptr;
1254 mg->mg_ptr = 0;
1255
1256 coro->hv = 0;
1257
1258 if (--coro->refcnt < 0)
1259 {
1260 coro_state_destroy (aTHX_ coro);
1261 Safefree (coro);
1262 }
1263
1264 return 0;
1265}
1266
1267static int
1268coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
1269{
1270 struct coro *coro = (struct coro *)mg->mg_ptr;
1271
1272 ++coro->refcnt;
1273
1274 return 0;
1275}
1276
1277static MGVTBL coro_state_vtbl = {
1278 0, 0, 0, 0,
1279 coro_state_free,
1280 0,
1281#ifdef MGf_DUP
1282 coro_state_dup,
1283#else
1284# define MGf_DUP 0
1285#endif
1286};
1287
1288static void
1289prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv)
1290{
1291 ta->prev = SvSTATE (prev_sv);
1292 ta->next = SvSTATE (next_sv);
1293 TRANSFER_CHECK (*ta);
1294}
1295
1296static void
1297api_transfer (SV *prev_sv, SV *next_sv)
1298{
1299 dTHX;
1300 struct transfer_args ta;
1301
1302 prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
1303 TRANSFER (ta);
1304}
1305
1306/** Coro ********************************************************************/
1307
1308static void
1309coro_enq (pTHX_ SV *coro_sv)
1310{
1311 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
814} 1312}
815 1313
816static SV * 1314static SV *
817coro_deq (int min_prio) 1315coro_deq (pTHX_ int min_prio)
818{ 1316{
819 int prio = PRIO_MAX - PRIO_MIN; 1317 int prio = PRIO_MAX - PRIO_MIN;
820 1318
821 min_prio -= PRIO_MIN; 1319 min_prio -= PRIO_MIN;
822 if (min_prio < 0) 1320 if (min_prio < 0)
823 min_prio = 0; 1321 min_prio = 0;
824 1322
825 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 1323 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
826 if (av_len (coro_ready[prio]) >= 0) 1324 if (AvFILLp (coro_ready [prio]) >= 0)
827 {
828 coro_nready--;
829 return av_shift (coro_ready[prio]); 1325 return av_shift (coro_ready [prio]);
830 }
831 1326
832 return 0; 1327 return 0;
833} 1328}
834 1329
1330static int
1331api_ready (SV *coro_sv)
1332{
1333 dTHX;
1334 struct coro *coro;
1335
1336 if (SvROK (coro_sv))
1337 coro_sv = SvRV (coro_sv);
1338
1339 coro = SvSTATE (coro_sv);
1340
1341 if (coro->flags & CF_READY)
1342 return 0;
1343
1344 coro->flags |= CF_READY;
1345
1346 LOCK;
1347 coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
1348 ++coro_nready;
1349 UNLOCK;
1350
1351 return 1;
1352}
1353
1354static int
1355api_is_ready (SV *coro_sv)
1356{
1357 dTHX;
1358 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1359}
1360
835static void 1361static void
836api_ready (SV *coro) 1362prepare_schedule (pTHX_ struct transfer_args *ta)
837{ 1363{
838 coro_enq (SvREFCNT_inc (coro)); 1364 SV *prev_sv, *next_sv;
1365
1366 for (;;)
1367 {
1368 LOCK;
1369 next_sv = coro_deq (aTHX_ PRIO_MIN);
1370
1371 /* nothing to schedule: call the idle handler */
1372 if (expect_false (!next_sv))
1373 {
1374 dSP;
1375 UNLOCK;
1376
1377 ENTER;
1378 SAVETMPS;
1379
1380 PUSHMARK (SP);
1381 PUTBACK;
1382 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1383
1384 FREETMPS;
1385 LEAVE;
1386 continue;
1387 }
1388
1389 ta->next = SvSTATE (next_sv);
1390
1391 /* cannot transfer to destroyed coros, skip and look for next */
1392 if (expect_false (ta->next->flags & CF_DESTROYED))
1393 {
1394 UNLOCK;
1395 SvREFCNT_dec (next_sv);
1396 /* coro_nready is already taken care of by destroy */
1397 continue;
1398 }
1399
1400 --coro_nready;
1401 UNLOCK;
1402 break;
1403 }
1404
1405 /* free this only after the transfer */
1406 prev_sv = SvRV (coro_current);
1407 ta->prev = SvSTATE (prev_sv);
1408 TRANSFER_CHECK (*ta);
1409 assert (ta->next->flags & CF_READY);
1410 ta->next->flags &= ~CF_READY;
1411 SvRV_set (coro_current, next_sv);
1412
1413 LOCK;
1414 free_coro_mortal (aTHX);
1415 coro_mortal = prev_sv;
1416 UNLOCK;
839} 1417}
840 1418
841static void 1419static void
842api_schedule (int cede) 1420prepare_cede (pTHX_ struct transfer_args *ta)
843{ 1421{
844 SV *prev, *next; 1422 api_ready (coro_current);
1423 prepare_schedule (aTHX_ ta);
1424}
845 1425
1426static int
1427prepare_cede_notself (pTHX_ struct transfer_args *ta)
1428{
1429 if (coro_nready)
1430 {
846 prev = GvSV (coro_current); 1431 SV *prev = SvRV (coro_current);
847 1432 prepare_schedule (aTHX_ ta);
848 if (cede) 1433 api_ready (prev);
849 coro_enq (SvREFCNT_inc (prev)); 1434 return 1;
850 1435 }
851 next = coro_deq (PRIO_MIN); 1436 else
852 1437 return 0;
853 if (!next)
854 next = SvREFCNT_inc (GvSV (coro_idle));
855
856 GvSV (coro_current) = SvREFCNT_inc (next);
857 transfer (aTHX_
858 sv_to_coro (prev, "Coro::schedule", "current coroutine"),
859 sv_to_coro (next, "Coro::schedule", "next coroutine"),
860 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
861 SvREFCNT_dec (next);
862 SvREFCNT_dec (prev);
863} 1438}
864 1439
1440static void
1441api_schedule (void)
1442{
1443 dTHX;
1444 struct transfer_args ta;
1445
1446 prepare_schedule (aTHX_ &ta);
1447 TRANSFER (ta);
1448}
1449
1450static int
1451api_cede (void)
1452{
1453 dTHX;
1454 struct transfer_args ta;
1455
1456 prepare_cede (aTHX_ &ta);
1457
1458 if (expect_true (ta.prev != ta.next))
1459 {
1460 TRANSFER (ta);
1461 return 1;
1462 }
1463 else
1464 return 0;
1465}
1466
1467static int
1468api_cede_notself (void)
1469{
1470 dTHX;
1471 struct transfer_args ta;
1472
1473 if (prepare_cede_notself (aTHX_ &ta))
1474 {
1475 TRANSFER (ta);
1476 return 1;
1477 }
1478 else
1479 return 0;
1480}
1481
1482static void
1483api_trace (SV *coro_sv, int flags)
1484{
1485 dTHX;
1486 struct coro *coro = SvSTATE (coro_sv);
1487
1488 if (flags & CC_TRACE)
1489 {
1490 if (!coro->cctx)
1491 coro->cctx = cctx_new ();
1492 else if (!(coro->cctx->flags & CC_TRACE))
1493 croak ("cannot enable tracing on coroutine with custom stack");
1494
1495 coro->cctx->flags |= CC_NOREUSE | (flags & (CC_TRACE | CC_TRACE_ALL));
1496 }
1497 else if (coro->cctx && coro->cctx->flags & CC_TRACE)
1498 {
1499 coro->cctx->flags &= ~(CC_TRACE | CC_TRACE_ALL);
1500
1501 if (coro->flags & CF_RUNNING)
1502 PL_runops = RUNOPS_DEFAULT;
1503 else
1504 coro->slot->runops = RUNOPS_DEFAULT;
1505 }
1506}
1507
865MODULE = Coro::State PACKAGE = Coro::State 1508MODULE = Coro::State PACKAGE = Coro::State PREFIX = api_
866 1509
867PROTOTYPES: ENABLE 1510PROTOTYPES: DISABLE
868 1511
869BOOT: 1512BOOT:
870{ /* {} necessary for stoopid perl-5.6.x */ 1513{
871 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1514#ifdef USE_ITHREADS
872 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1515 MUTEX_INIT (&coro_mutex);
1516#endif
1517 BOOT_PAGESIZE;
1518
1519 irsgv = gv_fetchpv ("/" , GV_ADD|GV_NOTQUAL, SVt_PV);
1520 stdoutgv = gv_fetchpv ("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVIO);
1521
1522 hv_sig = coro_get_hv ("SIG", TRUE);
1523 sv_diehook = coro_get_sv ("Coro::State::DIEHOOK" , TRUE);
1524 sv_warnhook = coro_get_sv ("Coro::State::WARNHOOK", TRUE);
1525
1526 if (!PL_diehook ) hv_store (hv_sig, strpair ("__DIE__" ), SvREFCNT_inc (sv_diehook ), 0);
1527 if (!PL_warnhook) hv_store (hv_sig, strpair ("__WARN__"), SvREFCNT_inc (sv_warnhook), 0);
1528
873 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1529 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
874 1530
875 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1531 newCONSTSUB (coro_state_stash, "CC_TRACE" , newSViv (CC_TRACE));
876 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1532 newCONSTSUB (coro_state_stash, "CC_TRACE_SUB" , newSViv (CC_TRACE_SUB));
877 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1533 newCONSTSUB (coro_state_stash, "CC_TRACE_LINE", newSViv (CC_TRACE_LINE));
878 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1534 newCONSTSUB (coro_state_stash, "CC_TRACE_ALL" , newSViv (CC_TRACE_ALL));
879
880 if (!padlist_cache)
881 padlist_cache = newHV ();
882 1535
883 main_mainstack = PL_mainstack; 1536 main_mainstack = PL_mainstack;
1537 main_top_env = PL_top_env;
1538
1539 while (main_top_env->je_prev)
1540 main_top_env = main_top_env->je_prev;
884 1541
885 coroapi.ver = CORO_API_VERSION; 1542 coroapi.ver = CORO_API_VERSION;
886 coroapi.transfer = api_transfer; 1543 coroapi.transfer = api_transfer;
887}
888 1544
889Coro::State 1545 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
890_newprocess(args) 1546}
891 SV * args 1547
892 PROTOTYPE: $ 1548SV *
1549new (char *klass, ...)
893 CODE: 1550 CODE:
894 Coro__State coro; 1551{
1552 struct coro *coro;
1553 HV *hv;
1554 int i;
895 1555
896 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
897 croak ("Coro::State::_newprocess expects an arrayref");
898
899 New (0, coro, 1, struct coro); 1556 Newz (0, coro, 1, struct coro);
1557 coro->args = newAV ();
1558 coro->flags = CF_NEW;
900 1559
901 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1560 if (coro_first) coro_first->prev = coro;
902 coro->mainstack = 0; /* actual work is done inside transfer */ 1561 coro->next = coro_first;
903 coro->stack = 0; 1562 coro_first = coro;
904 1563
905 RETVAL = coro; 1564 coro->hv = hv = newHV ();
1565 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
1566 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1567
1568 av_extend (coro->args, items - 1);
1569 for (i = 1; i < items; i++)
1570 av_push (coro->args, newSVsv (ST (i)));
1571}
906 OUTPUT: 1572 OUTPUT:
907 RETVAL 1573 RETVAL
908 1574
1575# these not obviously related functions are all rolled into the same xs
1576# function to increase chances that they all will call transfer with the same
1577# stack offset
909void 1578void
910transfer(prev, next, flags) 1579_set_stacklevel (...)
911 Coro::State_or_hashref prev 1580 ALIAS:
912 Coro::State_or_hashref next 1581 Coro::State::transfer = 1
913 int flags 1582 Coro::schedule = 2
914 PROTOTYPE: @ 1583 Coro::cede = 3
1584 Coro::cede_notself = 4
1585 Coro::Event::next = 5
1586 Coro::Event::next_cancel = 6
915 CODE: 1587 PPCODE:
1588{
1589 struct transfer_args ta;
1590 int again = 0;
1591
1592 do
1593 {
1594 switch (ix)
1595 {
1596 case 0:
1597 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1598 ta.next = 0;
1599 break;
1600
1601 case 1:
1602 if (items != 2)
1603 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1604
1605 prepare_transfer (aTHX_ &ta, ST(0), ST(1));
1606 break;
1607
1608 case 2:
1609 prepare_schedule (aTHX_ &ta);
1610 break;
1611
1612 case 3:
1613 prepare_cede (aTHX_ &ta);
1614 break;
1615
1616 case 4:
1617 if (!prepare_cede_notself (aTHX_ &ta))
1618 XSRETURN_EMPTY;
1619
1620 break;
1621
1622 case 5:
1623 case 6:
1624 if (items != 1)
1625 croak ("Coro::Event::next (watcher) expects one argument, not %d", items);
1626
1627 {
1628 SV *ev = coroapi.coro_event_next (ST (0), ix == 6, GIMME_V != G_VOID);
1629
1630 if (ev)
1631 {
1632 if (GIMME_V != G_VOID)
1633 {
1634 XPUSHs (ev);
1635 XSRETURN (1);
1636 }
1637 else
1638 XSRETURN_EMPTY;
1639 }
1640 }
1641
1642 prepare_schedule (aTHX_ &ta);
1643 again = 1;
1644 break;
1645 }
1646
1647 /* our caller, entersub, caches *only* this value */
1648 ta.prev->gimme = GIMME_V == G_VOID ? 0
1649 : GIMME_V == G_SCALAR ? 1
1650 : 2;
1651
1652 /* we need to save all local variables, as we might execute a different coroutine when transfer returns */
1653 sp += 2; /* save args */
1654 EXTEND (SP, 4);
1655 PUSHs ((SV *)(intptr_t)items);
1656 PUSHs ((SV *)(intptr_t)ix);
1657 PUSHs ((SV *)(intptr_t)ax);
1658 PUSHs ((SV *)(intptr_t)again);
916 PUTBACK; 1659 PUTBACK;
917 transfer (aTHX_ prev, next, flags); 1660 BARRIER;
1661 TRANSFER (ta);
1662 BARRIER;
918 SPAGAIN; 1663 SPAGAIN;
1664 again = (intptr_t)POPs;
1665 ax = (intptr_t)POPs;
1666 ix = (intptr_t)POPs;
1667 items = (intptr_t)POPs;
1668 sp -= 2; /* restore args */
1669 }
1670 while (again);
1671
1672 if (expect_false (GIMME_V != G_VOID && ta.next != ta.prev))
1673 XSRETURN_YES;
1674
1675 XSRETURN_EMPTY; /* not understood why this is necessary, likely some stack handling bug */
1676}
1677
1678bool
1679_destroy (SV *coro_sv)
1680 CODE:
1681 RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
1682 OUTPUT:
1683 RETVAL
919 1684
920void 1685void
921DESTROY(coro)
922 Coro::State coro
923 CODE:
924
925 if (coro->mainstack && coro->mainstack != main_mainstack)
926 {
927 struct coro temp;
928
929 PUTBACK;
930 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
931 LOAD(aTHX_ coro);
932 SPAGAIN;
933
934 destroy_stacks (aTHX);
935
936 LOAD((&temp)); /* this will get rid of defsv etc.. */
937 SPAGAIN;
938
939 coro->mainstack = 0;
940 }
941
942 deallocate_stack (coro);
943
944 Safefree (coro);
945
946void
947flush()
948 CODE:
949#ifdef MAY_FLUSH
950 flush_padlist_cache ();
951#endif
952
953void
954_exit(code) 1686_exit (code)
955 int code 1687 int code
956 PROTOTYPE: $ 1688 PROTOTYPE: $
957 CODE: 1689 CODE:
958#if defined(__GLIBC__) || _POSIX_C_SOURCE
959 _exit (code); 1690 _exit (code);
960#else
961 signal (SIGTERM, SIG_DFL);
962 raise (SIGTERM);
963 exit (code);
964#endif
965 1691
966MODULE = Coro::State PACKAGE = Coro::Cont 1692int
1693cctx_stacksize (int new_stacksize = 0)
1694 CODE:
1695 RETVAL = coro_stacksize;
1696 if (new_stacksize)
1697 coro_stacksize = new_stacksize;
1698 OUTPUT:
1699 RETVAL
967 1700
968# this is slightly dirty (should expose a c-level api) 1701int
1702cctx_count ()
1703 CODE:
1704 RETVAL = cctx_count;
1705 OUTPUT:
1706 RETVAL
1707
1708int
1709cctx_idle ()
1710 CODE:
1711 RETVAL = cctx_idle[0] + cctx_idle[1] + cctx_idle[2];
1712 OUTPUT:
1713 RETVAL
969 1714
970void 1715void
971yield(...) 1716list ()
972 PROTOTYPE: @ 1717 PPCODE:
1718{
1719 struct coro *coro;
1720 for (coro = coro_first; coro; coro = coro->next)
1721 if (coro->hv)
1722 XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv)));
1723}
1724
1725void
1726call (Coro::State coro, SV *coderef)
1727 ALIAS:
1728 eval = 1
1729 CODE:
1730{
1731 if (coro->mainstack)
1732 {
1733 struct coro temp;
1734
1735 if (!(coro->flags & CF_RUNNING))
1736 {
1737 save_perl (aTHX_ &temp);
1738 load_perl (aTHX_ coro);
1739 }
1740
1741 {
1742 dSP;
1743 ENTER;
1744 SAVETMPS;
1745 PUTBACK;
1746 PUSHSTACK;
1747 PUSHMARK (SP);
1748
1749 if (ix)
1750 eval_sv (coderef, 0);
1751 else
1752 call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
1753
1754 POPSTACK;
1755 FREETMPS;
1756 LEAVE;
1757 }
1758
1759 if (!(coro->flags & CF_RUNNING))
1760 {
1761 save_perl (aTHX_ coro);
1762 load_perl (aTHX_ &temp);
1763 }
1764 }
1765}
1766
1767SV *
1768is_ready (Coro::State coro)
1769 PROTOTYPE: $
1770 ALIAS:
1771 is_ready = CF_READY
1772 is_running = CF_RUNNING
1773 is_new = CF_NEW
1774 is_destroyed = CF_DESTROYED
1775 CODE:
1776 RETVAL = boolSV (coro->flags & ix);
1777 OUTPUT:
1778 RETVAL
1779
1780void
1781api_trace (SV *coro, int flags = CC_TRACE | CC_TRACE_SUB)
1782
1783SV *
1784has_stack (Coro::State coro)
1785 PROTOTYPE: $
1786 CODE:
1787 RETVAL = boolSV (!!coro->cctx);
1788 OUTPUT:
1789 RETVAL
1790
1791int
1792is_traced (Coro::State coro)
1793 PROTOTYPE: $
1794 CODE:
1795 RETVAL = (coro->cctx ? coro->cctx->flags : 0) & CC_TRACE_ALL;
1796 OUTPUT:
1797 RETVAL
1798
1799IV
1800rss (Coro::State coro)
1801 PROTOTYPE: $
1802 ALIAS:
1803 usecount = 1
973 CODE: 1804 CODE:
974 static SV *returnstk; 1805 switch (ix)
975 SV *sv; 1806 {
976 AV *defav = GvAV (PL_defgv); 1807 case 0: RETVAL = coro_rss (aTHX_ coro); break;
977 struct coro *prev, *next; 1808 case 1: RETVAL = coro->usecount; break;
1809 }
1810 OUTPUT:
1811 RETVAL
978 1812
979 if (!returnstk)
980 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
981
982 /* set up @_ -- ugly */
983 av_clear (defav);
984 av_fill (defav, items - 1);
985 while (items--)
986 av_store (defav, items, SvREFCNT_inc (ST(items)));
987
988 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
989 sv = av_pop ((AV *)SvRV (returnstk));
990 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
991 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
992 SvREFCNT_dec (sv);
993
994 transfer(aTHX_ prev, next, 0);
995 1813
996MODULE = Coro::State PACKAGE = Coro 1814MODULE = Coro::State PACKAGE = Coro
997 1815
998# this is slightly dirty (should expose a c-level api)
999
1000BOOT: 1816BOOT:
1001{ 1817{
1002 int i; 1818 int i;
1819
1820 sv_pool_rss = coro_get_sv ("Coro::POOL_RSS" , TRUE);
1821 sv_pool_size = coro_get_sv ("Coro::POOL_SIZE" , TRUE);
1822 av_async_pool = coro_get_av ("Coro::async_pool", TRUE);
1823
1824 coro_current = coro_get_sv ("Coro::current", FALSE);
1825 SvREADONLY_on (coro_current);
1826
1003 HV *stash = gv_stashpv ("Coro", TRUE); 1827 coro_stash = gv_stashpv ("Coro", TRUE);
1004 1828
1005 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1829 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1006 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1830 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1007 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1831 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1008 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1832 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1009 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1833 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1010 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1834 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1011
1012 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1013 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1014 1835
1015 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1836 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1016 coro_ready[i] = newAV (); 1837 coro_ready[i] = newAV ();
1017 1838
1018 { 1839 {
1019 SV *sv = perl_get_sv("Coro::API", 1); 1840 SV *sv = perl_get_sv ("Coro::API", TRUE);
1841 perl_get_sv ("Coro::API", TRUE); /* silence 5.10 warning */
1020 1842
1021 coroapi.schedule = api_schedule; 1843 coroapi.schedule = api_schedule;
1844 coroapi.cede = api_cede;
1845 coroapi.cede_notself = api_cede_notself;
1022 coroapi.ready = api_ready; 1846 coroapi.ready = api_ready;
1847 coroapi.is_ready = api_is_ready;
1023 coroapi.nready = &coro_nready; 1848 coroapi.nready = &coro_nready;
1024 coroapi.current = coro_current; 1849 coroapi.current = coro_current;
1025 1850
1026 GCoroAPI = &coroapi; 1851 GCoroAPI = &coroapi;
1027 sv_setiv(sv, (IV)&coroapi); 1852 sv_setiv (sv, (IV)&coroapi);
1028 SvREADONLY_on(sv); 1853 SvREADONLY_on (sv);
1029 } 1854 }
1030} 1855}
1031 1856
1032void 1857void
1033ready(self) 1858_set_current (SV *current)
1034 SV * self 1859 PROTOTYPE: $
1035 CODE: 1860 CODE:
1036 api_ready (self); 1861 SvREFCNT_dec (SvRV (coro_current));
1862 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1037 1863
1038int 1864int
1865prio (Coro::State coro, int newprio = 0)
1866 ALIAS:
1867 nice = 1
1868 CODE:
1869{
1870 RETVAL = coro->prio;
1871
1872 if (items > 1)
1873 {
1874 if (ix)
1875 newprio = coro->prio - newprio;
1876
1877 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1878 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1879
1880 coro->prio = newprio;
1881 }
1882}
1883 OUTPUT:
1884 RETVAL
1885
1886SV *
1887ready (SV *self)
1888 PROTOTYPE: $
1889 CODE:
1890 RETVAL = boolSV (api_ready (self));
1891 OUTPUT:
1892 RETVAL
1893
1894int
1039nready(...) 1895nready (...)
1040 PROTOTYPE: 1896 PROTOTYPE:
1041 CODE: 1897 CODE:
1042 RETVAL = coro_nready; 1898 RETVAL = coro_nready;
1043 OUTPUT: 1899 OUTPUT:
1044 RETVAL 1900 RETVAL
1045 1901
1046void 1902void
1047schedule(...) 1903throw (Coro::State self, SV *throw = &PL_sv_undef)
1048 PROTOTYPE: 1904 PROTOTYPE: $;$
1049 ALIAS: 1905 CODE:
1050 cede = 1 1906 SvREFCNT_dec (self->throw);
1907 self->throw = SvOK (throw) ? newSVsv (throw) : 0;
1908
1909# for async_pool speedup
1910void
1911_pool_1 (SV *cb)
1051 CODE: 1912 CODE:
1052 api_schedule (ix); 1913{
1914 struct coro *coro = SvSTATE (coro_current);
1915 HV *hv = (HV *)SvRV (coro_current);
1916 AV *defav = GvAV (PL_defgv);
1917 SV *invoke = hv_delete (hv, strpair ("_invoke"), 0);
1918 AV *invoke_av;
1919 int i, len;
1053 1920
1921 if (!invoke)
1922 croak ("\3async_pool terminate\2\n");
1923
1924 SvREFCNT_dec (coro->saved_deffh);
1925 coro->saved_deffh = SvREFCNT_inc ((SV *)PL_defoutgv);
1926
1927 hv_store (hv, "desc", sizeof ("desc") - 1,
1928 newSVpvn (strpair ("[async_pool]")), 0);
1929
1930 invoke_av = (AV *)SvRV (invoke);
1931 len = av_len (invoke_av);
1932
1933 sv_setsv (cb, AvARRAY (invoke_av)[0]);
1934
1935 if (len > 0)
1936 {
1937 av_fill (defav, len - 1);
1938 for (i = 0; i < len; ++i)
1939 av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1]));
1940 }
1941
1942 SvREFCNT_dec (invoke);
1943}
1944
1945void
1946_pool_2 (SV *cb)
1947 CODE:
1948{
1949 struct coro *coro = SvSTATE (coro_current);
1950
1951 sv_setsv (cb, &PL_sv_undef);
1952
1953 SvREFCNT_dec ((SV *)PL_defoutgv); PL_defoutgv = (GV *)coro->saved_deffh;
1954 coro->saved_deffh = 0;
1955
1956 if (coro_rss (aTHX_ coro) > SvIV (sv_pool_rss)
1957 || av_len (av_async_pool) + 1 >= SvIV (sv_pool_size))
1958 croak ("\3async_pool terminate\2\n");
1959
1960 av_clear (GvAV (PL_defgv));
1961 hv_store ((HV *)SvRV (coro_current), strpair ("desc"),
1962 newSVpvn (strpair ("[async_pool idle]")), 0);
1963
1964 coro->prio = 0;
1965
1966 if (coro->cctx && (coro->cctx->flags & CC_TRACE))
1967 api_trace (coro_current, 0);
1968
1969 av_push (av_async_pool, newSVsv (coro_current));
1970}
1971
1972
1973MODULE = Coro::State PACKAGE = Coro::AIO
1974
1975SV *
1976_get_state ()
1977 CODE:
1978{
1979 struct io_state *data;
1980
1981 RETVAL = newSV (sizeof (struct io_state));
1982 data = (struct io_state *)SvPVX (RETVAL);
1983 SvCUR_set (RETVAL, sizeof (struct io_state));
1984 SvPOK_only (RETVAL);
1985
1986 data->errorno = errno;
1987 data->laststype = PL_laststype;
1988 data->laststatval = PL_laststatval;
1989 data->statcache = PL_statcache;
1990}
1991 OUTPUT:
1992 RETVAL
1993
1994void
1995_set_state (char *data_)
1996 PROTOTYPE: $
1997 CODE:
1998{
1999 struct io_state *data = (void *)data_;
2000
2001 errno = data->errorno;
2002 PL_laststype = data->laststype;
2003 PL_laststatval = data->laststatval;
2004 PL_statcache = data->statcache;
2005}
2006

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines