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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines