ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines