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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines