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.19 by root, Sun Jul 29 01:11:41 2001 UTC vs.
Revision 1.128 by root, Fri Dec 22 04:22:28 2006 UTC

1#include "libcoro/coro.c"
2
1#include "EXTERN.h" 3#include "EXTERN.h"
2#include "perl.h" 4#include "perl.h"
3#include "XSUB.h" 5#include "XSUB.h"
4 6
5#include "libcoro/coro.c" 7#include "patchlevel.h"
8
9#include <stdio.h>
10#include <errno.h>
11#include <assert.h>
6 12
7#ifdef HAVE_MMAP 13#ifdef HAVE_MMAP
8# include <unistd.h> 14# include <unistd.h>
9# include <sys/mman.h> 15# include <sys/mman.h>
10# ifndef MAP_ANON
11# ifdef MAP_ANONYMOUS 16# ifndef MAP_ANONYMOUS
12# define MAP_ANON MAP_ANONYMOUS 17# ifdef MAP_ANON
18# define MAP_ANONYMOUS MAP_ANON
13# else 19# else
14# undef HAVE_MMAP 20# undef HAVE_MMAP
15# endif 21# endif
16# endif 22# endif
23# include <limits.h>
24# ifndef PAGESIZE
25# define PAGESIZE pagesize
26# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
27static long pagesize;
28# else
29# define BOOT_PAGESIZE (void)0
17#endif 30# endif
18
19#define MAY_FLUSH /* increases codesize */
20
21/* perl-related */
22#define TRANSFER_SAVE_DEFAV 0x00000001
23#define TRANSFER_SAVE_DEFSV 0x00000002
24#define TRANSFER_SAVE_ERRSV 0x00000004
25/* c-related */
26#define TRANSFER_SAVE_CCTXT 0x00000008
27#ifdef CORO_LAZY_STACK
28# define TRANSFER_LAZY_STACK 0x00000010
29#else 31#else
30# define TRANSFER_LAZY_STACK 0x00000000 32# define PAGESIZE 0
33# define BOOT_PAGESIZE (void)0
34#endif
35
36#if USE_VALGRIND
37# include <valgrind/valgrind.h>
38#endif
39
40/* the maximum number of idle cctx that will be pooled */
41#define MAX_IDLE_CCTX 8
42
43#define PERL_VERSION_ATLEAST(a,b,c) \
44 (PERL_REVISION > (a) \
45 || (PERL_REVISION == (a) \
46 && (PERL_VERSION > (b) \
47 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
48
49#if !PERL_VERSION_ATLEAST (5,6,0)
50# ifndef PL_ppaddr
51# define PL_ppaddr ppaddr
31#endif 52# endif
53# ifndef call_sv
54# define call_sv perl_call_sv
55# endif
56# ifndef get_sv
57# define get_sv perl_get_sv
58# endif
59# ifndef get_cv
60# define get_cv perl_get_cv
61# endif
62# ifndef IS_PADGV
63# define IS_PADGV(v) 0
64# endif
65# ifndef IS_PADCONST
66# define IS_PADCONST(v) 0
67# endif
68#endif
32 69
33#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \ 70/* 5.8.7 */
34 |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT) 71#ifndef SvRV_set
72# define SvRV_set(s,v) SvRV(s) = (v)
73#endif
35 74
36#define SUB_INIT "Coro::State::initialize" 75#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
37#define UCORO_STATE "_coro_state" 76# undef STACKGUARD
77#endif
38 78
79#ifndef STACKGUARD
80# define STACKGUARD 0
81#endif
82
83/* prefer perl internal functions over our own? */
84#ifndef PREFER_PERL_FUNCTIONS
85# define PREFER_PERL_FUNCTIONS 0
86#endif
87
39/* The next macro should delcare a variable stacklevel that contains and approximation 88/* The next macro should declare a variable stacklevel that contains and approximation
40 * to the current C stack pointer. It's property is that it changes with each call 89 * to the current C stack pointer. Its property is that it changes with each call
41 * and should be unique. */ 90 * and should be unique. */
91#define dSTACKLEVEL int stacklevel
42#define dSTACKLEVEL void *stacklevel = &stacklevel 92#define STACKLEVEL ((void *)&stacklevel)
43 93
44#define labs(l) ((l) >= 0 ? (l) : -(l)) 94#define IN_DESTRUCT (PL_main_cv == Nullcv)
45 95
46/* this is actually not only the c stack but also c registers etc... */ 96#if __GNUC__ >= 3
97# define attribute(x) __attribute__(x)
98#else
99# define attribute(x)
100#endif
101
102#define NOINLINE attribute ((noinline))
103
104#include "CoroAPI.h"
105
106#ifdef USE_ITHREADS
107static perl_mutex coro_mutex;
108# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
109# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
110#else
111# define LOCK (void)0
112# define UNLOCK (void)0
113#endif
114
115struct io_state
116{
117 int errorno;
118 I32 laststype;
119 int laststatval;
120 Stat_t statcache;
121};
122
123static struct CoroAPI coroapi;
124static AV *main_mainstack; /* used to differentiate between $main and others */
125static HV *coro_state_stash, *coro_stash;
126static SV *coro_mortal; /* will be freed after next transfer */
127
128static struct coro_cctx *cctx_first;
129static int cctx_count, cctx_idle;
130
131/* this is a structure representing a c-level coroutine */
47typedef struct { 132typedef struct coro_cctx {
48 int refcnt; /* pointer reference counter */ 133 struct coro_cctx *next;
49 int usecnt; /* shared by how many coroutines */
50 int gencnt; /* generation counter */
51 134
52 coro_context cctx; 135 /* the stack */
53
54 void *sptr; 136 void *sptr;
55 long ssize; /* positive == mmap, otherwise malloc */ 137 long ssize; /* positive == mmap, otherwise malloc */
56} coro_stack;
57 138
139 /* cpu state */
140 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
141 JMPENV *top_env;
142 coro_context cctx;
143
144 int inuse;
145
146#if USE_VALGRIND
147 int valgrind_id;
148#endif
149} coro_cctx;
150
151enum {
152 CF_RUNNING = 0x0001, /* coroutine is running */
153 CF_READY = 0x0002, /* coroutine is ready */
154 CF_NEW = 0x0004, /* ahs never been switched to */
155};
156
157/* this is a structure representing a perl-level coroutine */
58struct coro { 158struct coro {
59 /* the optional C context */ 159 /* the c coroutine allocated to this perl coroutine, if any */
60 coro_stack *stack; 160 coro_cctx *cctx;
61 void *cursp;
62 int gencnt;
63
64 /* optionally saved, might be zero */
65 AV *defav;
66 SV *defsv;
67 SV *errsv;
68
69 /* saved global state not related to stacks */
70 U8 dowarn;
71 I32 in_eval;
72
73 /* the stacks and related info (callchain etc..) */
74 PERL_SI *curstackinfo;
75 AV *curstack;
76 AV *mainstack;
77 SV **stack_sp;
78 OP *op;
79 SV **curpad;
80 SV **stack_base;
81 SV **stack_max;
82 SV **tmps_stack;
83 I32 tmps_floor;
84 I32 tmps_ix;
85 I32 tmps_max;
86 I32 *markstack;
87 I32 *markstack_ptr;
88 I32 *markstack_max;
89 I32 *scopestack;
90 I32 scopestack_ix;
91 I32 scopestack_max;
92 ANY *savestack;
93 I32 savestack_ix;
94 I32 savestack_max;
95 OP **retstack;
96 I32 retstack_ix;
97 I32 retstack_max;
98 COP *curcop;
99 JMPENV *top_env;
100 161
101 /* data associated with this coroutine (initial args) */ 162 /* data associated with this coroutine (initial args) */
102 AV *args; 163 AV *args;
164 int refcnt;
165 int save; /* CORO_SAVE flags */
166 int flags; /* CF_ flags */
167
168 /* optionally saved, might be zero */
169 AV *defav; /* @_ */
170 SV *defsv; /* $_ */
171 SV *errsv; /* $@ */
172 SV *irssv; /* $/ */
173 SV *irssv_sv; /* real $/ cache */
174
175#define VAR(name,type) type name;
176# include "state.h"
177#undef VAR
178
179 /* coro process data */
180 int prio;
103}; 181};
104 182
105typedef struct coro *Coro__State; 183typedef struct coro *Coro__State;
106typedef struct coro *Coro__State_or_hashref; 184typedef struct coro *Coro__State_or_hashref;
107 185
108static AV *main_mainstack; /* used to differentiate between $main and others */ 186static AV *
109static HV *coro_state_stash; 187coro_clone_padlist (CV *cv)
110static SV *ucoro_state_sv;
111static U32 ucoro_state_hash;
112static HV *padlist_cache;
113
114/* mostly copied from op.c:cv_clone2 */
115STATIC AV *
116clone_padlist (AV *protopadlist)
117{ 188{
118 AV *av; 189 AV *padlist = CvPADLIST (cv);
119 I32 ix;
120 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
121 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
122 SV **pname = AvARRAY (protopad_name);
123 SV **ppad = AvARRAY (protopad);
124 I32 fname = AvFILLp (protopad_name);
125 I32 fpad = AvFILLp (protopad);
126 AV *newpadlist, *newpad_name, *newpad; 190 AV *newpadlist, *newpad;
127 SV **npad;
128
129 newpad_name = newAV ();
130 for (ix = fname; ix >= 0; ix--)
131 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
132
133 newpad = newAV ();
134 av_fill (newpad, AvFILLp (protopad));
135 npad = AvARRAY (newpad);
136 191
137 newpadlist = newAV (); 192 newpadlist = newAV ();
138 AvREAL_off (newpadlist); 193 AvREAL_off (newpadlist);
139 av_store (newpadlist, 0, (SV *) newpad_name); 194#if PERL_VERSION_ATLEAST (5,9,0)
195 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
196#else
197 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
198#endif
199 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
200 --AvFILLp (padlist);
201
202 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
140 av_store (newpadlist, 1, (SV *) newpad); 203 av_store (newpadlist, 1, (SV *)newpad);
141 204
142 av = newAV (); /* will be @_ */ 205 return newpadlist;
143 av_extend (av, 0); 206}
144 av_store (newpad, 0, (SV *) av);
145 AvFLAGS (av) = AVf_REIFY;
146 207
147 for (ix = fpad; ix > 0; ix--) 208static void
209free_padlist (AV *padlist)
210{
211 /* may be during global destruction */
212 if (SvREFCNT (padlist))
148 { 213 {
149 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 214 I32 i = AvFILLp (padlist);
150 if (namesv && namesv != &PL_sv_undef) 215 while (i >= 0)
151 { 216 {
152 char *name = SvPVX (namesv); /* XXX */ 217 SV **svp = av_fetch (padlist, i--, FALSE);
153 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 218 if (svp)
154 { /* lexical from outside? */
155 npad[ix] = SvREFCNT_inc (ppad[ix]);
156 } 219 {
157 else
158 { /* our own lexical */
159 SV *sv; 220 SV *sv;
160 if (*name == '&') 221 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
161 sv = SvREFCNT_inc (ppad[ix]); 222 SvREFCNT_dec (sv);
162 else if (*name == '@') 223
163 sv = (SV *) newAV (); 224 SvREFCNT_dec (*svp);
164 else if (*name == '%')
165 sv = (SV *) newHV ();
166 else
167 sv = NEWSV (0, 0);
168 if (!SvPADBUSY (sv))
169 SvPADMY_on (sv);
170 npad[ix] = sv;
171 } 225 }
172 } 226 }
173 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
174 {
175 npad[ix] = SvREFCNT_inc (ppad[ix]);
176 }
177 else
178 {
179 SV *sv = NEWSV (0, 0);
180 SvPADTMP_on (sv);
181 npad[ix] = sv;
182 }
183 }
184 227
185#if 0 /* return -ENOTUNDERSTOOD */
186 /* Now that vars are all in place, clone nested closures. */
187
188 for (ix = fpad; ix > 0; ix--) {
189 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
190 if (namesv
191 && namesv != &PL_sv_undef
192 && !(SvFLAGS(namesv) & SVf_FAKE)
193 && *SvPVX(namesv) == '&'
194 && CvCLONE(ppad[ix]))
195 {
196 CV *kid = cv_clone((CV*)ppad[ix]);
197 SvREFCNT_dec(ppad[ix]);
198 CvCLONE_on(kid);
199 SvPADMY_on(kid);
200 npad[ix] = (SV*)kid;
201 }
202 }
203#endif
204
205 return newpadlist;
206}
207
208#ifdef MAY_FLUSH
209STATIC AV *
210free_padlist (AV *padlist)
211{
212 /* may be during global destruction */
213 if (SvREFCNT(padlist))
214 {
215 I32 i = AvFILLp(padlist);
216 while (i >= 0)
217 {
218 SV **svp = av_fetch(padlist, i--, FALSE);
219 SV *sv = svp ? *svp : Nullsv;
220 if (sv)
221 SvREFCNT_dec(sv);
222 }
223
224 SvREFCNT_dec((SV*)padlist); 228 SvREFCNT_dec ((SV*)padlist);
225 } 229 }
226} 230}
227#endif 231
232static int
233coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
234{
235 AV *padlist;
236 AV *av = (AV *)mg->mg_obj;
237
238 /* casting is fun. */
239 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
240 free_padlist (padlist);
241
242 SvREFCNT_dec (av);
243
244 return 0;
245}
246
247#define PERL_MAGIC_coro PERL_MAGIC_ext
248
249static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
250
251#define CORO_MAGIC(cv) \
252 SvMAGIC (cv) \
253 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
254 ? SvMAGIC (cv) \
255 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
256 : 0
228 257
229/* the next two functions merely cache the padlists */ 258/* the next two functions merely cache the padlists */
230STATIC void 259static void
231get_padlist (CV *cv) 260get_padlist (CV *cv)
232{ 261{
233 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); 262 MAGIC *mg = CORO_MAGIC (cv);
263 AV *av;
234 264
235 if (he && AvFILLp ((AV *)*he) >= 0) 265 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
236 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); 266 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
237 else 267 else
268 {
269#if PREFER_PERL_FUNCTIONS
270 /* this is probably cleaner, but also slower? */
271 CV *cp = Perl_cv_clone (cv);
272 CvPADLIST (cv) = CvPADLIST (cp);
273 CvPADLIST (cp) = 0;
274 SvREFCNT_dec (cp);
275#else
238 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 276 CvPADLIST (cv) = coro_clone_padlist (cv);
277#endif
278 }
239} 279}
240 280
241STATIC void 281static void
242put_padlist (CV *cv) 282put_padlist (CV *cv)
243{ 283{
244 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); 284 MAGIC *mg = CORO_MAGIC (cv);
285 AV *av;
245 286
246 if (SvTYPE (*he) != SVt_PVAV) 287 if (!mg)
247 {
248 SvREFCNT_dec (*he);
249 *he = (SV *)newAV ();
250 } 288 {
251 289 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
252 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 290 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
253} 291 mg->mg_virtual = &vtbl_coro;
254 292 mg->mg_obj = (SV *)newAV ();
255#ifdef MAY_FLUSH
256STATIC void
257flush_padlist_cache ()
258{
259 HV *hv = padlist_cache;
260 padlist_cache = newHV ();
261
262 if (hv_iterinit (hv))
263 { 293 }
264 HE *he;
265 AV *padlist;
266 294
267 while (!!(he = hv_iternext (hv))) 295 av = (AV *)mg->mg_obj;
268 {
269 AV *av = (AV *)HeVAL(he);
270 296
271 /* casting is fun. */ 297 if (AvFILLp (av) >= AvMAX (av))
272 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) 298 av_extend (av, AvMAX (av) + 1);
273 free_padlist (padlist);
274 }
275 }
276 299
277 SvREFCNT_dec (hv); 300 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
278} 301}
279#endif
280 302
281#define SB do { 303#define SB do {
282#define SE } while (0) 304#define SE } while (0)
283 305
284#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
285#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
286
287#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 306#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
288 307
289static void 308static void
290load_state(pTHX_ Coro__State c) 309load_perl (Coro__State c)
291{ 310{
292 PL_dowarn = c->dowarn; 311#define VAR(name,type) PL_ ## name = c->name;
293 PL_in_eval = c->in_eval; 312# include "state.h"
294 313#undef VAR
295 PL_curstackinfo = c->curstackinfo;
296 PL_curstack = c->curstack;
297 PL_mainstack = c->mainstack;
298 PL_stack_sp = c->stack_sp;
299 PL_op = c->op;
300 PL_curpad = c->curpad;
301 PL_stack_base = c->stack_base;
302 PL_stack_max = c->stack_max;
303 PL_tmps_stack = c->tmps_stack;
304 PL_tmps_floor = c->tmps_floor;
305 PL_tmps_ix = c->tmps_ix;
306 PL_tmps_max = c->tmps_max;
307 PL_markstack = c->markstack;
308 PL_markstack_ptr = c->markstack_ptr;
309 PL_markstack_max = c->markstack_max;
310 PL_scopestack = c->scopestack;
311 PL_scopestack_ix = c->scopestack_ix;
312 PL_scopestack_max = c->scopestack_max;
313 PL_savestack = c->savestack;
314 PL_savestack_ix = c->savestack_ix;
315 PL_savestack_max = c->savestack_max;
316 PL_retstack = c->retstack;
317 PL_retstack_ix = c->retstack_ix;
318 PL_retstack_max = c->retstack_max;
319 PL_curcop = c->curcop;
320 PL_top_env = c->top_env;
321 314
322 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 315 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
323 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 316 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
324 if (c->errsv) REPLACE_SV (ERRSV , c->errsv); 317 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
318 if (c->irssv)
319 {
320 if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
321 SvREFCNT_dec (c->irssv);
322 else
323 {
324 REPLACE_SV (PL_rs, c->irssv);
325 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
326 sv_setsv (c->irssv_sv, PL_rs);
327 }
328 }
325 329
326 { 330 {
327 dSP; 331 dSP;
328 CV *cv; 332 CV *cv;
329 333
330 /* now do the ugly restore mess */ 334 /* now do the ugly restore mess */
331 while ((cv = (CV *)POPs)) 335 while ((cv = (CV *)POPs))
332 { 336 {
333 AV *padlist = (AV *)POPs;
334
335 if (padlist)
336 {
337 put_padlist (cv); /* mark this padlist as available */ 337 put_padlist (cv); /* mark this padlist as available */
338 CvPADLIST(cv) = padlist; 338 CvDEPTH (cv) = PTR2IV (POPs);
339#ifdef USE_THREADS 339 CvPADLIST (cv) = (AV *)POPs;
340 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
341#endif
342 }
343
344 ++CvDEPTH(cv);
345 } 340 }
346 341
347 PUTBACK; 342 PUTBACK;
348 } 343 }
349} 344}
350 345
351static void 346static void
352save_state(pTHX_ Coro__State c, int flags) 347save_perl (Coro__State c)
353{ 348{
354 { 349 {
355 dSP; 350 dSP;
356 I32 cxix = cxstack_ix; 351 I32 cxix = cxstack_ix;
357 PERL_CONTEXT *ccstk = cxstack; 352 PERL_CONTEXT *ccstk = cxstack;
360 /* 355 /*
361 * the worst thing you can imagine happens first - we have to save 356 * the worst thing you can imagine happens first - we have to save
362 * (and reinitialize) all cv's in the whole callchain :( 357 * (and reinitialize) all cv's in the whole callchain :(
363 */ 358 */
364 359
360 EXTEND (SP, 3 + 1);
365 PUSHs (Nullsv); 361 PUSHs (Nullsv);
366 /* this loop was inspired by pp_caller */ 362 /* this loop was inspired by pp_caller */
367 for (;;) 363 for (;;)
368 { 364 {
369 do 365 while (cxix >= 0)
370 { 366 {
371 PERL_CONTEXT *cx = &ccstk[cxix--]; 367 PERL_CONTEXT *cx = &ccstk[cxix--];
372 368
373 if (CxTYPE(cx) == CXt_SUB) 369 if (CxTYPE (cx) == CXt_SUB)
374 { 370 {
375 CV *cv = cx->blk_sub.cv; 371 CV *cv = cx->blk_sub.cv;
372
376 if (CvDEPTH(cv)) 373 if (CvDEPTH (cv))
377 { 374 {
378#ifdef USE_THREADS
379 /*XPUSHs ((SV *)CvOWNER(cv));*/
380 /*CvOWNER(cv) = 0;*/
381 /*error must unlock this cv etc.. etc...*/
382#endif
383 EXTEND (SP, CvDEPTH(cv)*2); 375 EXTEND (SP, 3);
384
385 while (--CvDEPTH(cv))
386 {
387 /* this tells the restore code to increment CvDEPTH */
388 PUSHs (Nullsv);
389 PUSHs ((SV *)cv);
390 }
391
392 PUSHs ((SV *)CvPADLIST(cv)); 376 PUSHs ((SV *)CvPADLIST (cv));
377 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
393 PUSHs ((SV *)cv); 378 PUSHs ((SV *)cv);
394 379
380 CvDEPTH (cv) = 0;
395 get_padlist (cv); /* this is a monster */ 381 get_padlist (cv);
396 } 382 }
397 } 383 }
398 else if (CxTYPE(cx) == CXt_FORMAT)
399 {
400 /* I never used formats, so how should I know how these are implemented? */
401 /* my bold guess is as a simple, plain sub... */
402 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
403 }
404 } 384 }
405 while (cxix >= 0);
406 385
407 if (top_si->si_type == PERLSI_MAIN) 386 if (top_si->si_type == PERLSI_MAIN)
408 break; 387 break;
409 388
410 top_si = top_si->si_prev; 389 top_si = top_si->si_prev;
413 } 392 }
414 393
415 PUTBACK; 394 PUTBACK;
416 } 395 }
417 396
418 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 397 c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
419 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 398 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
420 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 399 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
400 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
421 401
422 /* I have not the slightest idea of why av_reify is necessary */ 402#define VAR(name,type)c->name = PL_ ## name;
423 /* but if it's missing the defav contents magically get replaced sometimes */ 403# include "state.h"
424 if (c->defav) 404#undef VAR
425 av_reify (c->defav);
426
427 c->dowarn = PL_dowarn;
428 c->in_eval = PL_in_eval;
429
430 c->curstackinfo = PL_curstackinfo;
431 c->curstack = PL_curstack;
432 c->mainstack = PL_mainstack;
433 c->stack_sp = PL_stack_sp;
434 c->op = PL_op;
435 c->curpad = PL_curpad;
436 c->stack_base = PL_stack_base;
437 c->stack_max = PL_stack_max;
438 c->tmps_stack = PL_tmps_stack;
439 c->tmps_floor = PL_tmps_floor;
440 c->tmps_ix = PL_tmps_ix;
441 c->tmps_max = PL_tmps_max;
442 c->markstack = PL_markstack;
443 c->markstack_ptr = PL_markstack_ptr;
444 c->markstack_max = PL_markstack_max;
445 c->scopestack = PL_scopestack;
446 c->scopestack_ix = PL_scopestack_ix;
447 c->scopestack_max = PL_scopestack_max;
448 c->savestack = PL_savestack;
449 c->savestack_ix = PL_savestack_ix;
450 c->savestack_max = PL_savestack_max;
451 c->retstack = PL_retstack;
452 c->retstack_ix = PL_retstack_ix;
453 c->retstack_max = PL_retstack_max;
454 c->curcop = PL_curcop;
455 c->top_env = PL_top_env;
456} 405}
457 406
458/* 407/*
459 * allocate various perl stacks. This is an exact copy 408 * allocate various perl stacks. This is an exact copy
460 * of perl.c:init_stacks, except that it uses less memory 409 * of perl.c:init_stacks, except that it uses less memory
461 * on the assumption that coroutines do not usually need 410 * on the (sometimes correct) assumption that coroutines do
462 * a lot of stackspace. 411 * not usually need a lot of stackspace.
463 */ 412 */
464STATIC void 413#if PREFER_PERL_FUNCTIONS
414# define coro_init_stacks init_stacks
415#else
416static void
465coro_init_stacks (pTHX) 417coro_init_stacks ()
466{ 418{
467 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 419 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
468 PL_curstackinfo->si_type = PERLSI_MAIN; 420 PL_curstackinfo->si_type = PERLSI_MAIN;
469 PL_curstack = PL_curstackinfo->si_stack; 421 PL_curstack = PL_curstackinfo->si_stack;
470 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 422 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
471 423
472 PL_stack_base = AvARRAY(PL_curstack); 424 PL_stack_base = AvARRAY(PL_curstack);
473 PL_stack_sp = PL_stack_base; 425 PL_stack_sp = PL_stack_base;
474 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 426 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
475 427
476 New(50,PL_tmps_stack,96,SV*); 428 New(50,PL_tmps_stack,128,SV*);
477 PL_tmps_floor = -1; 429 PL_tmps_floor = -1;
478 PL_tmps_ix = -1; 430 PL_tmps_ix = -1;
479 PL_tmps_max = 96; 431 PL_tmps_max = 128;
480 432
481 New(54,PL_markstack,16,I32); 433 New(54,PL_markstack,32,I32);
482 PL_markstack_ptr = PL_markstack; 434 PL_markstack_ptr = PL_markstack;
483 PL_markstack_max = PL_markstack + 16; 435 PL_markstack_max = PL_markstack + 32;
484 436
437#ifdef SET_MARK_OFFSET
485 SET_MARK_OFFSET; 438 SET_MARK_OFFSET;
439#endif
486 440
487 New(54,PL_scopestack,16,I32); 441 New(54,PL_scopestack,32,I32);
488 PL_scopestack_ix = 0; 442 PL_scopestack_ix = 0;
489 PL_scopestack_max = 16; 443 PL_scopestack_max = 32;
490 444
491 New(54,PL_savestack,96,ANY); 445 New(54,PL_savestack,64,ANY);
492 PL_savestack_ix = 0; 446 PL_savestack_ix = 0;
493 PL_savestack_max = 96; 447 PL_savestack_max = 64;
494 448
449#if !PERL_VERSION_ATLEAST (5,9,0)
495 New(54,PL_retstack,8,OP*); 450 New(54,PL_retstack,16,OP*);
496 PL_retstack_ix = 0; 451 PL_retstack_ix = 0;
497 PL_retstack_max = 8; 452 PL_retstack_max = 16;
453#endif
498} 454}
455#endif
499 456
500/* 457/*
501 * destroy the stacks, the callchain etc... 458 * destroy the stacks, the callchain etc...
502 * still there is a memleak of 128 bytes...
503 */ 459 */
504STATIC void 460static void
505destroy_stacks(pTHX) 461coro_destroy_stacks ()
506{ 462{
507 /* is this ugly, I ask? */ 463 if (!IN_DESTRUCT)
508 while (PL_scopestack_ix) 464 {
509 LEAVE; 465 /* restore all saved variables and stuff */
466 LEAVE_SCOPE (0);
467 assert (PL_tmps_floor == -1);
510 468
511 /* sure it is, but more important: is it correct?? :/ */ 469 /* free all temporaries */
512 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
513 FREETMPS; 470 FREETMPS;
471 assert (PL_tmps_ix == -1);
472
473 POPSTACK_TO (PL_mainstack);
474 }
514 475
515 while (PL_curstackinfo->si_next) 476 while (PL_curstackinfo->si_next)
516 PL_curstackinfo = PL_curstackinfo->si_next; 477 PL_curstackinfo = PL_curstackinfo->si_next;
517 478
518 while (PL_curstackinfo) 479 while (PL_curstackinfo)
519 { 480 {
520 PERL_SI *p = PL_curstackinfo->si_prev; 481 PERL_SI *p = PL_curstackinfo->si_prev;
521 482
522 { 483 if (!IN_DESTRUCT)
523 dSP;
524 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
525 PUTBACK; /* possibly superfluous */
526 }
527
528 dounwind(-1);
529
530 SvREFCNT_dec(PL_curstackinfo->si_stack); 484 SvREFCNT_dec (PL_curstackinfo->si_stack);
485
531 Safefree(PL_curstackinfo->si_cxstack); 486 Safefree (PL_curstackinfo->si_cxstack);
532 Safefree(PL_curstackinfo); 487 Safefree (PL_curstackinfo);
533 PL_curstackinfo = p; 488 PL_curstackinfo = p;
534 } 489 }
535 490
536 Safefree(PL_tmps_stack); 491 Safefree (PL_tmps_stack);
537 Safefree(PL_markstack); 492 Safefree (PL_markstack);
538 Safefree(PL_scopestack); 493 Safefree (PL_scopestack);
539 Safefree(PL_savestack); 494 Safefree (PL_savestack);
495#if !PERL_VERSION_ATLEAST (5,9,0)
540 Safefree(PL_retstack); 496 Safefree (PL_retstack);
541}
542
543static void
544allocate_stack (Coro__State ctx, int alloc)
545{
546 coro_stack *stack;
547
548 New (0, stack, 1, coro_stack);
549
550 stack->refcnt = 1;
551 stack->usecnt = 1;
552 stack->gencnt = ctx->gencnt = 0;
553 if (alloc)
554 {
555#ifdef HAVE_MMAP
556 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
557 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
558 if (stack->sptr == (void *)-1)
559#endif 497#endif
560 {
561 /*FIXME*//*D*//* reasonable stack size! */
562 stack->ssize = -4096 * sizeof (long);
563 New (0, stack->sptr, 4096, long);
564 }
565 }
566 else
567 stack->sptr = 0;
568
569 ctx->stack = stack;
570} 498}
571 499
572static void 500static void
573deallocate_stack (Coro__State ctx) 501setup_coro (struct coro *coro)
574{
575 coro_stack *stack = ctx->stack;
576
577 ctx->stack = 0;
578
579 if (stack)
580 {
581 if (!--stack->refcnt)
582 {
583#ifdef HAVE_MMAP
584 if (stack->ssize > 0 && stack->sptr)
585 munmap (stack->sptr, stack->ssize);
586 else
587#else
588 Safefree (stack->sptr);
589#endif
590 Safefree (stack);
591 }
592 else if (ctx->gencnt == stack->gencnt)
593 --stack->usecnt;
594 }
595}
596
597static void
598setup_coro (void *arg)
599{ 502{
600 /* 503 /*
601 * emulate part of the perl startup here. 504 * emulate part of the perl startup here.
602 */ 505 */
506
507 coro_init_stacks ();
508
509 PL_curcop = &PL_compiling;
510 PL_in_eval = EVAL_NULL;
511 PL_curpm = 0;
512 PL_localizing = 0;
513 PL_dirty = 0;
514 PL_restartop = 0;
515
516 {
517 dSP;
518 LOGOP myop;
519
520 SvREFCNT_dec (GvAV (PL_defgv));
521 GvAV (PL_defgv) = coro->args; coro->args = 0;
522
523 Zero (&myop, 1, LOGOP);
524 myop.op_next = Nullop;
525 myop.op_flags = OPf_WANT_VOID;
526
527 PUSHMARK (SP);
528 XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE));
529 PUTBACK;
530 PL_op = (OP *)&myop;
531 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
532 SPAGAIN;
533 }
534
535 ENTER; /* necessary e.g. for dounwind */
536}
537
538static void
539free_coro_mortal ()
540{
541 if (coro_mortal)
542 {
543 SvREFCNT_dec (coro_mortal);
544 coro_mortal = 0;
545 }
546}
547
548/* inject a fake call to Coro::State::_cctx_init into the execution */
549static void NOINLINE
550prepare_cctx (coro_cctx *cctx)
551{
603 dSP; 552 dSP;
604 Coro__State ctx = (Coro__State)arg; 553 LOGOP myop;
605 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
606 554
607 coro_init_stacks (aTHX); 555 Zero (&myop, 1, LOGOP);
608 /*PL_curcop = 0;*/ 556 myop.op_next = PL_op;
609 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 557 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
610 SvREFCNT_dec (GvAV (PL_defgv));
611 GvAV (PL_defgv) = ctx->args;
612 558
559 PUSHMARK (SP);
560 EXTEND (SP, 2);
561 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
562 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
563 PUTBACK;
564 PL_op = (OP *)&myop;
565 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
613 SPAGAIN; 566 SPAGAIN;
614
615 if (ctx->stack)
616 {
617 ctx->cursp = 0;
618
619 PUSHMARK(SP);
620 PUTBACK;
621 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
622
623 if (SvTRUE (ERRSV))
624 croak (NULL);
625 else
626 croak ("FATAL: CCTXT coroutine returned!");
627 }
628 else
629 {
630 UNOP myop;
631
632 PL_op = (OP *)&myop;
633
634 Zero(&myop, 1, UNOP);
635 myop.op_next = Nullop;
636 myop.op_flags = OPf_WANT_VOID;
637
638 PUSHMARK(SP);
639 XPUSHs (sub_init);
640 /*
641 * the next line is slightly wrong, as PL_op->op_next
642 * is actually being executed so we skip the first op.
643 * that doesn't matter, though, since it is only
644 * pp_nextstate and we never return...
645 * ah yes, and I don't care anyways ;)
646 */
647 PUTBACK;
648 PL_op = pp_entersub();
649 SPAGAIN;
650
651 ENTER; /* necessary e.g. for dounwind */
652 }
653} 567}
654 568
655static void 569static void
656continue_coro (void *arg) 570coro_run (void *arg)
657{ 571{
572 /* coro_run is the alternative tail of transfer(), so unlock here. */
573 UNLOCK;
574
658 /* 575 /*
659 * this is a _very_ stripped down perl interpreter ;) 576 * this is a _very_ stripped down perl interpreter ;)
660 */ 577 */
661 Coro__State ctx = (Coro__State)arg; 578 PL_top_env = &PL_start_env;
662 579
663 /*FIXME*//* must set up top_env here */ 580 /* inject call to cctx_init */
664 ctx->cursp = 0; 581 prepare_cctx ((coro_cctx *)arg);
665 PL_op = PL_op->op_next;
666 CALLRUNOPS(aTHX);
667 582
583 /* somebody will hit me for both perl_run and PL_restartop */
584 PL_restartop = PL_op;
585 perl_run (PL_curinterp);
586
587 fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr);
668 abort (); 588 abort ();
669} 589}
670 590
671STATIC void 591static coro_cctx *
592cctx_new ()
593{
594 coro_cctx *cctx;
595
596 ++cctx_count;
597
598 Newz (0, cctx, 1, coro_cctx);
599
600#if HAVE_MMAP
601
602 cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
603 /* mmap supposedly does allocate-on-write for us */
604 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
605
606 if (cctx->sptr == (void *)-1)
607 {
608 perror ("FATAL: unable to mmap stack for coroutine");
609 _exit (EXIT_FAILURE);
610 }
611
612# if STACKGUARD
613 mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
614# endif
615
616#else
617
618 cctx->ssize = STACKSIZE * (long)sizeof (long);
619 New (0, cctx->sptr, STACKSIZE, long);
620
621 if (!cctx->sptr)
622 {
623 perror ("FATAL: unable to malloc stack for coroutine");
624 _exit (EXIT_FAILURE);
625 }
626
627#endif
628
629#if USE_VALGRIND
630 cctx->valgrind_id = VALGRIND_STACK_REGISTER (
631 STACKGUARD * PAGESIZE + (char *)cctx->sptr,
632 cctx->ssize + (char *)cctx->sptr
633 );
634#endif
635
636 coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize);
637
638 return cctx;
639}
640
641static void
642cctx_destroy (coro_cctx *cctx)
643{
644 if (!cctx)
645 return;
646
647 --cctx_count;
648
649#if USE_VALGRIND
650 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
651#endif
652
653#if HAVE_MMAP
654 munmap (cctx->sptr, cctx->ssize);
655#else
656 Safefree (cctx->sptr);
657#endif
658
659 Safefree (cctx);
660}
661
662static coro_cctx *
663cctx_get ()
664{
665 coro_cctx *cctx;
666
667 if (cctx_first)
668 {
669 cctx = cctx_first;
670 cctx_first = cctx->next;
671 --cctx_idle;
672 }
673 else
674 {
675 cctx = cctx_new ();
676 PL_op = PL_op->op_next;
677 }
678
679 return cctx;
680}
681
682static void
683cctx_put (coro_cctx *cctx)
684{
685 /* free another cctx if overlimit */
686 if (cctx_idle >= MAX_IDLE_CCTX)
687 {
688 coro_cctx *first = cctx_first;
689 cctx_first = first->next;
690 --cctx_idle;
691
692 assert (!first->inuse);
693 cctx_destroy (first);
694 }
695
696 ++cctx_idle;
697 cctx->next = cctx_first;
698 cctx_first = cctx;
699}
700
701/* never call directly, always through the coro_state_transfer global variable */
702static void NOINLINE
672transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 703transfer (struct coro *prev, struct coro *next)
673{ 704{
674 dSP;
675 dSTACKLEVEL; 705 dSTACKLEVEL;
676 706
707 /* sometimes transfer is only called to set idle_sp */
708 if (!next)
709 {
710 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
711 assert (((coro_cctx *)prev)->top_env = PL_top_env); /* just for the side effetc when assert is enabled */
712 }
677 if (prev != next) 713 else if (prev != next)
678 { 714 {
679 if (next->mainstack) 715 coro_cctx *prev__cctx;
716
717 if (prev->flags & CF_NEW)
680 { 718 {
681 SAVE (prev, flags); 719 /* create a new empty context */
682 LOAD (next); 720 Newz (0, prev->cctx, 1, coro_cctx);
683 721 prev->cctx->inuse = 1;
684 /* mark this state as in-use */ 722 prev->flags &= ~CF_NEW;
685 next->mainstack = 0; 723 prev->flags |= CF_RUNNING;
686 next->tmps_ix = -2;
687
688 /* stacklevel changed? if yes, grab the stack for us! */
689 if (flags & TRANSFER_SAVE_CCTXT)
690 {
691 if (!prev->stack)
692 allocate_stack (prev, 0);
693 else if (prev->cursp != stacklevel
694 && prev->stack->usecnt > 1)
695 {
696 prev->gencnt = ++prev->stack->gencnt;
697 prev->stack->usecnt = 1;
698 }
699
700 /* has our stack been invalidated? */
701 if (next->stack && next->stack->gencnt != next->gencnt)
702 {
703 deallocate_stack (next);
704 allocate_stack (next, 1);
705 coro_create (&(next->stack->cctx),
706 continue_coro, (void *)next,
707 next->stack->sptr, labs (next->stack->ssize));
708 }
709
710 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
711 }
712
713 } 724 }
714 else if (next->tmps_ix == -2) 725
715 croak ("tried to transfer to running coroutine"); 726 /*TODO: must not croak here */
727 if (!prev->flags & CF_RUNNING)
728 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
729
730 if (next->flags & CF_RUNNING)
731 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
732
733 prev->flags &= ~CF_RUNNING;
734 next->flags |= CF_RUNNING;
735
736 LOCK;
737
738 if (next->flags & CF_NEW)
739 {
740 /* need to start coroutine */
741 next->flags &= ~CF_NEW;
742 /* first get rid of the old state */
743 save_perl (prev);
744 /* setup coroutine call */
745 setup_coro (next);
746 /* need a new stack */
747 assert (!next->cctx);
748 }
716 else 749 else
717 { 750 {
718 SAVE (prev, -1); /* first get rid of the old state */ 751 /* coroutine already started */
719 752 save_perl (prev);
720 if (flags & TRANSFER_SAVE_CCTXT) 753 load_perl (next);
721 {
722 if (!prev->stack)
723 allocate_stack (prev, 0);
724
725 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
726 {
727 setup_coro (next);
728
729 prev->stack->refcnt++;
730 prev->stack->usecnt++;
731 next->stack = prev->stack;
732 next->gencnt = prev->gencnt;
733 }
734 else
735 {
736 allocate_stack (next, 1);
737 coro_create (&(next->stack->cctx),
738 setup_coro, (void *)next,
739 next->stack->sptr, labs (next->stack->ssize));
740 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
741 }
742 }
743 else
744 setup_coro (next);
745 } 754 }
755
756 prev__cctx = prev->cctx;
757
758 /* possibly "free" the cctx */
759 if (prev__cctx->idle_sp == STACKLEVEL)
760 {
761 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
762 assert (PL_top_env == prev__cctx->top_env);
763
764 prev->cctx = 0;
765
766 cctx_put (prev__cctx);
767 prev__cctx->inuse = 0;
768 }
769
770 if (!next->cctx)
771 {
772 next->cctx = cctx_get ();
773 assert (!next->cctx->inuse);
774 next->cctx->inuse = 1;
775 }
776
777 if (prev__cctx != next->cctx)
778 {
779 prev__cctx->top_env = PL_top_env;
780 PL_top_env = next->cctx->top_env;
781 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
782 }
783
784 free_coro_mortal ();
785
786 UNLOCK;
787 }
788}
789
790struct transfer_args
791{
792 struct coro *prev, *next;
793};
794
795#define TRANSFER(ta) transfer ((ta).prev, (ta).next)
796
797static void
798coro_state_destroy (struct coro *coro)
799{
800 if (coro->refcnt--)
801 return;
802
803 if (coro->mainstack && coro->mainstack != main_mainstack)
804 {
805 struct coro temp;
806 Zero (&temp, 1, struct coro);
807 temp.save = CORO_SAVE_ALL;
808
809 if (coro->flags & CF_RUNNING)
810 croak ("FATAL: tried to destroy currently running coroutine");
811
812 save_perl (&temp);
813 load_perl (coro);
814
815 coro_destroy_stacks ();
816
817 load_perl (&temp); /* this will get rid of defsv etc.. */
818
819 coro->mainstack = 0;
820 }
821
822 cctx_destroy (coro->cctx);
823 SvREFCNT_dec (coro->args);
824 Safefree (coro);
825}
826
827static int
828coro_state_clear (pTHX_ SV *sv, MAGIC *mg)
829{
830 struct coro *coro = (struct coro *)mg->mg_ptr;
831 mg->mg_ptr = 0;
832
833 coro_state_destroy (coro);
834
835 return 0;
836}
837
838static int
839coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
840{
841 struct coro *coro = (struct coro *)mg->mg_ptr;
842
843 ++coro->refcnt;
844
845 return 0;
846}
847
848static MGVTBL coro_state_vtbl = {
849 0, 0, 0, 0,
850 coro_state_clear,
851 0,
852#ifdef MGf_DUP
853 coro_state_dup,
854#else
855# define MGf_DUP 0
856#endif
857};
858
859static struct coro *
860SvSTATE (SV *coro)
861{
862 HV *stash;
863 MAGIC *mg;
864
865 if (SvROK (coro))
866 coro = SvRV (coro);
867
868 stash = SvSTASH (coro);
869 if (stash != coro_stash && stash != coro_state_stash)
870 {
871 /* very slow, but rare, check */
872 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
873 croak ("Coro::State object required");
874 }
875
876 mg = SvMAGIC (coro);
877 assert (mg->mg_type == PERL_MAGIC_ext);
878 return (struct coro *)mg->mg_ptr;
879}
880
881static void
882prepare_transfer (struct transfer_args *ta, SV *prev_sv, SV *next_sv)
883{
884 ta->prev = SvSTATE (prev_sv);
885 ta->next = SvSTATE (next_sv);
886}
887
888static void
889api_transfer (SV *prev_sv, SV *next_sv)
890{
891 struct transfer_args ta;
892
893 prepare_transfer (&ta, prev_sv, next_sv);
894 TRANSFER (ta);
895}
896
897static int
898api_save (SV *coro_sv, int new_save)
899{
900 struct coro *coro = SvSTATE (coro_sv);
901 int old_save = coro->save;
902
903 if (new_save >= 0)
904 coro->save = new_save;
905
906 return old_save;
907}
908
909/** Coro ********************************************************************/
910
911#define PRIO_MAX 3
912#define PRIO_HIGH 1
913#define PRIO_NORMAL 0
914#define PRIO_LOW -1
915#define PRIO_IDLE -3
916#define PRIO_MIN -4
917
918/* for Coro.pm */
919static SV *coro_current;
920static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
921static int coro_nready;
922
923static void
924coro_enq (SV *coro_sv)
925{
926 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
927 coro_nready++;
928}
929
930static SV *
931coro_deq (int min_prio)
932{
933 int prio = PRIO_MAX - PRIO_MIN;
934
935 min_prio -= PRIO_MIN;
936 if (min_prio < 0)
937 min_prio = 0;
938
939 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
940 if (AvFILLp (coro_ready [prio]) >= 0)
941 {
942 coro_nready--;
943 return av_shift (coro_ready [prio]);
746 } 944 }
747 945
748 next->cursp = stacklevel; 946 return 0;
947}
948
949static int
950api_ready (SV *coro_sv)
951{
952 struct coro *coro;
953
954 if (SvROK (coro_sv))
955 coro_sv = SvRV (coro_sv);
956
957 coro = SvSTATE (coro_sv);
958
959 if (coro->flags & CF_READY)
960 return 0;
961
962 coro->flags |= CF_READY;
963
964 LOCK;
965 coro_enq (SvREFCNT_inc (coro_sv));
966 UNLOCK;
967
968 return 1;
969}
970
971static int
972api_is_ready (SV *coro_sv)
973{
974 return !!SvSTATE (coro_sv)->flags & CF_READY;
975}
976
977static void
978prepare_schedule (struct transfer_args *ta)
979{
980 SV *prev, *next;
981
982 for (;;)
983 {
984 LOCK;
985 next = coro_deq (PRIO_MIN);
986 UNLOCK;
987
988 if (next)
989 break;
990
991 {
992 dSP;
993
994 ENTER;
995 SAVETMPS;
996
997 PUSHMARK (SP);
998 PUTBACK;
999 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1000
1001 FREETMPS;
1002 LEAVE;
1003 }
1004 }
1005
1006 prev = SvRV (coro_current);
1007 SvRV_set (coro_current, next);
1008
1009 /* free this only after the transfer */
1010 LOCK;
1011 free_coro_mortal ();
1012 UNLOCK;
1013 coro_mortal = prev;
1014
1015 assert (!SvROK(prev));//D
1016 assert (!SvROK(next));//D
1017
1018 ta->prev = SvSTATE (prev);
1019 ta->next = SvSTATE (next);
1020
1021 assert (ta->next->flags & CF_READY);
1022 ta->next->flags &= ~CF_READY;
1023}
1024
1025static void
1026prepare_cede (struct transfer_args *ta)
1027{
1028 api_ready (coro_current);
1029
1030 prepare_schedule (ta);
1031}
1032
1033static void
1034api_schedule (void)
1035{
1036 struct transfer_args ta;
1037
1038 prepare_schedule (&ta);
1039 TRANSFER (ta);
1040}
1041
1042static void
1043api_cede (void)
1044{
1045 struct transfer_args ta;
1046
1047 prepare_cede (&ta);
1048 TRANSFER (ta);
749} 1049}
750 1050
751MODULE = Coro::State PACKAGE = Coro::State 1051MODULE = Coro::State PACKAGE = Coro::State
752 1052
753PROTOTYPES: ENABLE 1053PROTOTYPES: DISABLE
754 1054
755BOOT: 1055BOOT:
756{ /* {} necessary for stoopid perl-5.6.x */ 1056{
757 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1057#ifdef USE_ITHREADS
758 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1058 MUTEX_INIT (&coro_mutex);
1059#endif
1060 BOOT_PAGESIZE;
1061
759 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1062 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
760 1063
761 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1064 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
762 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1065 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
763 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1066 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1067 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
764 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1068 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
765
766 if (!padlist_cache)
767 padlist_cache = newHV ();
768 1069
769 main_mainstack = PL_mainstack; 1070 main_mainstack = PL_mainstack;
770}
771 1071
772Coro::State 1072 coroapi.ver = CORO_API_VERSION;
773_newprocess(args) 1073 coroapi.transfer = api_transfer;
774 SV * args 1074
775 PROTOTYPE: $ 1075 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1076}
1077
1078SV *
1079new (char *klass, ...)
776 CODE: 1080 CODE:
777 Coro__State coro; 1081{
1082 struct coro *coro;
1083 HV *hv;
1084 int i;
778 1085
779 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
780 croak ("Coro::State::_newprocess expects an arrayref");
781
782 New (0, coro, 1, struct coro); 1086 Newz (0, coro, 1, struct coro);
1087 coro->args = newAV ();
1088 coro->save = CORO_SAVE_ALL;
1089 coro->flags = CF_NEW;
783 1090
784 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1091 hv = newHV ();
785 coro->mainstack = 0; /* actual work is done inside transfer */ 1092 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
786 coro->stack = 0; 1093 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
787 1094
788 RETVAL = coro; 1095 for (i = 1; i < items; i++)
1096 av_push (coro->args, newSVsv (ST (i)));
1097}
789 OUTPUT: 1098 OUTPUT:
790 RETVAL 1099 RETVAL
791 1100
1101int
1102save (SV *coro, int new_save = -1)
1103 CODE:
1104 RETVAL = api_save (coro, new_save);
1105 OUTPUT:
1106 RETVAL
1107
792void 1108void
793transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK) 1109_set_stacklevel (...)
794 Coro::State_or_hashref prev 1110 ALIAS:
795 Coro::State_or_hashref next 1111 Coro::State::transfer = 1
796 int flags 1112 Coro::schedule = 2
797 PROTOTYPE: @ 1113 Coro::cede = 3
798 CODE: 1114 CODE:
799 transfer (aTHX_ prev, next, flags); 1115{
1116 struct transfer_args ta;
1117
1118 switch (ix)
1119 {
1120 case 0:
1121 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1122 ta.next = 0;
1123 break;
1124
1125 case 1:
1126 if (items != 2)
1127 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1128
1129 prepare_transfer (&ta, ST (0), ST (1));
1130 break;
1131
1132 case 2:
1133 prepare_schedule (&ta);
1134 break;
1135
1136 case 3:
1137 prepare_cede (&ta);
1138 break;
1139 }
1140
1141 TRANSFER (ta);
1142}
800 1143
801void 1144void
802DESTROY(coro) 1145_clone_state_from (SV *dst, SV *src)
803 Coro::State coro 1146 CODE:
1147{
1148 struct coro *coro_src = SvSTATE (src);
1149
1150 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1151
1152 ++coro_src->refcnt;
1153 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
1154}
1155
1156void
1157_exit (code)
1158 int code
1159 PROTOTYPE: $
1160 CODE:
1161 _exit (code);
1162
1163int
1164cctx_count ()
1165 CODE:
1166 RETVAL = cctx_count;
1167 OUTPUT:
1168 RETVAL
1169
1170int
1171cctx_idle ()
1172 CODE:
1173 RETVAL = cctx_idle;
1174 OUTPUT:
1175 RETVAL
1176
1177MODULE = Coro::State PACKAGE = Coro
1178
1179BOOT:
1180{
1181 int i;
1182
1183 coro_stash = gv_stashpv ("Coro", TRUE);
1184
1185 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1186 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1187 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1188 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1189 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1190 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1191
1192 coro_current = get_sv ("Coro::current", FALSE);
1193 SvREADONLY_on (coro_current);
1194
1195 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1196 coro_ready[i] = newAV ();
1197
1198 {
1199 SV *sv = perl_get_sv("Coro::API", 1);
1200
1201 coroapi.schedule = api_schedule;
1202 coroapi.save = api_save;
1203 coroapi.cede = api_cede;
1204 coroapi.ready = api_ready;
1205 coroapi.is_ready = api_is_ready;
1206 coroapi.nready = &coro_nready;
1207 coroapi.current = coro_current;
1208
1209 GCoroAPI = &coroapi;
1210 sv_setiv (sv, (IV)&coroapi);
1211 SvREADONLY_on (sv);
1212 }
1213}
1214
1215void
1216_set_current (SV *current)
1217 PROTOTYPE: $
1218 CODE:
1219 SvREFCNT_dec (SvRV (coro_current));
1220 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1221
1222int
1223prio (Coro::State coro, int newprio = 0)
1224 ALIAS:
1225 nice = 1
804 CODE: 1226 CODE:
1227{
1228 RETVAL = coro->prio;
805 1229
806 if (coro->mainstack && coro->mainstack != main_mainstack) 1230 if (items > 1)
807 { 1231 {
808 struct coro temp; 1232 if (ix)
1233 newprio += coro->prio;
809 1234
810 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1235 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
811 LOAD(aTHX_ coro); 1236 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
812 1237
813 destroy_stacks (aTHX); 1238 coro->prio = newprio;
814
815 LOAD((&temp)); /* this will get rid of defsv etc.. */
816
817 coro->mainstack = 0;
818 } 1239 }
1240}
819 1241
820 deallocate_stack (coro); 1242SV *
1243ready (SV *self)
1244 PROTOTYPE: $
1245 CODE:
1246 RETVAL = boolSV (api_ready (self));
1247 OUTPUT:
1248 RETVAL
821 1249
822 Safefree (coro); 1250SV *
1251is_ready (SV *self)
1252 PROTOTYPE: $
1253 CODE:
1254 RETVAL = boolSV (api_is_ready (self));
1255 OUTPUT:
1256 RETVAL
1257
1258int
1259nready (...)
1260 PROTOTYPE:
1261 CODE:
1262 RETVAL = coro_nready;
1263 OUTPUT:
1264 RETVAL
1265
1266MODULE = Coro::State PACKAGE = Coro::AIO
1267
1268SV *
1269_get_state ()
1270 CODE:
1271{
1272 struct io_state *data;
1273
1274 RETVAL = newSV (sizeof (struct io_state));
1275 data = (struct io_state *)SvPVX (RETVAL);
1276 SvCUR_set (RETVAL, sizeof (struct io_state));
1277 SvPOK_only (RETVAL);
1278
1279 data->errorno = errno;
1280 data->laststype = PL_laststype;
1281 data->laststatval = PL_laststatval;
1282 data->statcache = PL_statcache;
1283}
1284 OUTPUT:
1285 RETVAL
823 1286
824void 1287void
825flush() 1288_set_state (char *data_)
1289 PROTOTYPE: $
826 CODE: 1290 CODE:
827#ifdef MAY_FLUSH 1291{
828 flush_padlist_cache (); 1292 struct io_state *data = (void *)data_;
829#endif
830 1293
831MODULE = Coro::State PACKAGE = Coro::Cont 1294 errno = data->errorno;
1295 PL_laststype = data->laststype;
1296 PL_laststatval = data->laststatval;
1297 PL_statcache = data->statcache;
1298}
832 1299
833# this is slightly dirty
834
835void
836yield(...)
837 PROTOTYPE: @
838 CODE:
839 static SV *returnstk;
840 SV *sv;
841 AV *defav = GvAV (PL_defgv);
842 struct coro *prev, *next;
843
844 if (!returnstk)
845 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
846
847 /* set up @_ -- ugly */
848 av_clear (defav);
849 av_fill (defav, items - 1);
850 while (items--)
851 av_store (defav, items, SvREFCNT_inc (ST(items)));
852
853 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
854 sv = av_pop ((AV *)SvRV (returnstk));
855 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
856 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
857 SvREFCNT_dec (sv);
858
859 transfer(aTHX_ prev, next, 0);
860

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines