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.67 by root, Mon Dec 12 20:07:44 2005 UTC vs.
Revision 1.178 by root, Wed Oct 3 01:48:06 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines