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

Diff Legend

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