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

Diff Legend

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