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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines