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.24 by root, Tue Aug 14 14:56:22 2001 UTC vs.
Revision 1.192 by root, Fri Oct 5 21:51:40 2007 UTC

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

Diff Legend

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