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.45 by root, Tue May 27 01:15:31 2003 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_ANONYMOUS 16# ifndef MAP_ANONYMOUS
14# define MAP_ANONYMOUS 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
31#else
32# define PAGESIZE 0
33# define BOOT_PAGESIZE (void)0
34#endif
20 35
21#define MAY_FLUSH /* increases codesize and is rarely used */ 36#if USE_VALGRIND
37# include <valgrind/valgrind.h>
38#endif
22 39
23#define SUB_INIT "Coro::State::initialize" 40/* the maximum number of idle cctx that will be pooled */
24#define UCORO_STATE "_coro_state" 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
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
69
70/* 5.8.7 */
71#ifndef SvRV_set
72# define SvRV_set(s,v) SvRV(s) = (v)
73#endif
74
75#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
76# undef STACKGUARD
77#endif
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
25 87
26/* The next macro should declare a variable stacklevel that contains and approximation 88/* The next macro should declare a variable stacklevel that contains and approximation
27 * to the current C stack pointer. Its property is that it changes with each call 89 * to the current C stack pointer. Its property is that it changes with each call
28 * and should be unique. */ 90 * and should be unique. */
91#define dSTACKLEVEL int stacklevel
29#define dSTACKLEVEL void *stacklevel = &stacklevel 92#define STACKLEVEL ((void *)&stacklevel)
30 93
31#define IN_DESTRUCT (PL_main_cv == Nullcv) 94#define IN_DESTRUCT (PL_main_cv == Nullcv)
32 95
33#define labs(l) ((l) >= 0 ? (l) : -(l)) 96#if __GNUC__ >= 3
97# define attribute(x) __attribute__(x)
98#else
99# define attribute(x)
100#endif
101
102#define NOINLINE attribute ((noinline))
34 103
35#include "CoroAPI.h" 104#include "CoroAPI.h"
36 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
37static struct CoroAPI coroapi; 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 */
38 127
39/* this is actually not only the c stack but also c registers etc... */ 128static struct coro_cctx *cctx_first;
129static int cctx_count, cctx_idle;
130
131/* this is a structure representing a c-level coroutine */
40typedef struct { 132typedef struct coro_cctx {
41 int refcnt; /* pointer reference counter */ 133 struct coro_cctx *next;
42 int usecnt; /* shared by how many coroutines */
43 int gencnt; /* generation counter */
44 134
45 coro_context cctx; 135 /* the stack */
46
47 void *sptr; 136 void *sptr;
48 long ssize; /* positive == mmap, otherwise malloc */ 137 long ssize; /* positive == mmap, otherwise malloc */
49} coro_stack;
50 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 */
51struct coro { 158struct coro {
52 /* the top-level JMPENV for each coroutine, needed to catch dies. */ 159 /* the c coroutine allocated to this perl coroutine, if any */
53 JMPENV start_env; 160 coro_cctx *cctx;
54
55 /* the optional C context */
56 coro_stack *stack;
57 void *cursp;
58 int gencnt;
59
60 /* optionally saved, might be zero */
61 AV *defav;
62 SV *defsv;
63 SV *errsv;
64
65 /* saved global state not related to stacks */
66 U8 dowarn;
67 I32 in_eval;
68
69 /* the stacks and related info (callchain etc..) */
70 PERL_SI *curstackinfo;
71 AV *curstack;
72 AV *mainstack;
73 SV **stack_sp;
74 OP *op;
75 SV **curpad;
76 AV *comppad;
77 SV **stack_base;
78 SV **stack_max;
79 SV **tmps_stack;
80 I32 tmps_floor;
81 I32 tmps_ix;
82 I32 tmps_max;
83 I32 *markstack;
84 I32 *markstack_ptr;
85 I32 *markstack_max;
86 I32 *scopestack;
87 I32 scopestack_ix;
88 I32 scopestack_max;
89 ANY *savestack;
90 I32 savestack_ix;
91 I32 savestack_max;
92 OP **retstack;
93 I32 retstack_ix;
94 I32 retstack_max;
95 COP *curcop;
96 JMPENV *top_env;
97 161
98 /* data associated with this coroutine (initial args) */ 162 /* data associated with this coroutine (initial args) */
99 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;
100}; 181};
101 182
102typedef struct coro *Coro__State; 183typedef struct coro *Coro__State;
103typedef struct coro *Coro__State_or_hashref; 184typedef struct coro *Coro__State_or_hashref;
104 185
105static AV *main_mainstack; /* used to differentiate between $main and others */ 186static AV *
106static HV *coro_state_stash; 187coro_clone_padlist (CV *cv)
107static SV *ucoro_state_sv;
108static U32 ucoro_state_hash;
109static HV *padlist_cache;
110static SV *coro_mortal; /* will be freed after next transfer */
111
112/* mostly copied from op.c:cv_clone2 */
113STATIC AV *
114clone_padlist (AV *protopadlist)
115{ 188{
116 AV *av; 189 AV *padlist = CvPADLIST (cv);
117 I32 ix;
118 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
119 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
120 SV **pname = AvARRAY (protopad_name);
121 SV **ppad = AvARRAY (protopad);
122 I32 fname = AvFILLp (protopad_name);
123 I32 fpad = AvFILLp (protopad);
124 AV *newpadlist, *newpad_name, *newpad; 190 AV *newpadlist, *newpad;
125 SV **npad;
126
127 newpad_name = newAV ();
128 for (ix = fname; ix >= 0; ix--)
129 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
130
131 newpad = newAV ();
132 av_fill (newpad, AvFILLp (protopad));
133 npad = AvARRAY (newpad);
134 191
135 newpadlist = newAV (); 192 newpadlist = newAV ();
136 AvREAL_off (newpadlist); 193 AvREAL_off (newpadlist);
137 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)));
138 av_store (newpadlist, 1, (SV *) newpad); 203 av_store (newpadlist, 1, (SV *)newpad);
139 204
140 av = newAV (); /* will be @_ */ 205 return newpadlist;
141 av_extend (av, 0); 206}
142 av_store (newpad, 0, (SV *) av);
143 AvFLAGS (av) = AVf_REIFY;
144 207
145 for (ix = fpad; ix > 0; ix--) 208static void
209free_padlist (AV *padlist)
210{
211 /* may be during global destruction */
212 if (SvREFCNT (padlist))
146 { 213 {
147 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 214 I32 i = AvFILLp (padlist);
148 if (namesv && namesv != &PL_sv_undef) 215 while (i >= 0)
149 { 216 {
150 char *name = SvPVX (namesv); /* XXX */ 217 SV **svp = av_fetch (padlist, i--, FALSE);
151 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 218 if (svp)
152 { /* lexical from outside? */
153 npad[ix] = SvREFCNT_inc (ppad[ix]);
154 } 219 {
155 else
156 { /* our own lexical */
157 SV *sv; 220 SV *sv;
158 if (*name == '&') 221 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
159 sv = SvREFCNT_inc (ppad[ix]); 222 SvREFCNT_dec (sv);
160 else if (*name == '@') 223
161 sv = (SV *) newAV (); 224 SvREFCNT_dec (*svp);
162 else if (*name == '%')
163 sv = (SV *) newHV ();
164 else
165 sv = NEWSV (0, 0);
166 if (!SvPADBUSY (sv))
167 SvPADMY_on (sv);
168 npad[ix] = sv;
169 } 225 }
170 } 226 }
171 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 227
172 { 228 SvREFCNT_dec ((SV*)padlist);
173 npad[ix] = SvREFCNT_inc (ppad[ix]);
174 }
175 else
176 {
177 SV *sv = NEWSV (0, 0);
178 SvPADTMP_on (sv);
179 npad[ix] = sv;
180 }
181 } 229 }
230}
182 231
183#if 0 /* return -ENOTUNDERSTOOD */ 232static int
184 /* 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;
185 237
186 for (ix = fpad; ix > 0; ix--) { 238 /* casting is fun. */
187 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 239 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
188 if (namesv 240 free_padlist (padlist);
189 && namesv != &PL_sv_undef 241
190 && !(SvFLAGS(namesv) & SVf_FAKE) 242 SvREFCNT_dec (av);
191 && *SvPVX(namesv) == '&' 243
192 && CvCLONE(ppad[ix])) 244 return 0;
193 { 245}
194 CV *kid = cv_clone((CV*)ppad[ix]); 246
195 SvREFCNT_dec(ppad[ix]); 247#define PERL_MAGIC_coro PERL_MAGIC_ext
196 CvCLONE_on(kid); 248
197 SvPADMY_on(kid); 249static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
198 npad[ix] = (SV*)kid; 250
199 } 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 ();
200 } 293 }
201#endif
202 294
203 return newpadlist; 295 av = (AV *)mg->mg_obj;
204}
205 296
206#ifdef MAY_FLUSH 297 if (AvFILLp (av) >= AvMAX (av))
207STATIC void 298 av_extend (av, AvMAX (av) + 1);
208free_padlist (AV *padlist)
209{
210 /* may be during global destruction */
211 if (SvREFCNT(padlist))
212 {
213 I32 i = AvFILLp(padlist);
214 while (i >= 0)
215 {
216 SV **svp = av_fetch(padlist, i--, FALSE);
217 SV *sv = svp ? *svp : Nullsv;
218 if (sv)
219 SvREFCNT_dec(sv);
220 }
221 299
222 SvREFCNT_dec((SV*)padlist); 300 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
223 }
224} 301}
225#endif
226
227/* the next two functions merely cache the padlists */
228STATIC void
229get_padlist (CV *cv)
230{
231 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
232
233 if (he && AvFILLp ((AV *)*he) >= 0)
234 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
235 else
236 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
237}
238
239STATIC void
240put_padlist (CV *cv)
241{
242 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
243
244 if (SvTYPE (*he) != SVt_PVAV)
245 {
246 SvREFCNT_dec (*he);
247 *he = (SV *)newAV ();
248 }
249
250 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
251}
252
253#ifdef MAY_FLUSH
254STATIC void
255flush_padlist_cache ()
256{
257 HV *hv = padlist_cache;
258 padlist_cache = newHV ();
259
260 if (hv_iterinit (hv))
261 {
262 HE *he;
263 AV *padlist;
264
265 while (!!(he = hv_iternext (hv)))
266 {
267 AV *av = (AV *)HeVAL(he);
268
269 /* casting is fun. */
270 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
271 free_padlist (padlist);
272 }
273 }
274
275 SvREFCNT_dec (hv);
276}
277#endif
278 302
279#define SB do { 303#define SB do {
280#define SE } while (0) 304#define SE } while (0)
281 305
282#define LOAD(state) load_state(aTHX_ (state));
283#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
284
285#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
286 307
287static void 308static void
288load_state(pTHX_ Coro__State c) 309load_perl (Coro__State c)
289{ 310{
290 PL_dowarn = c->dowarn; 311#define VAR(name,type) PL_ ## name = c->name;
291 PL_in_eval = c->in_eval; 312# include "state.h"
292 313#undef VAR
293 PL_curstackinfo = c->curstackinfo;
294 PL_curstack = c->curstack;
295 PL_mainstack = c->mainstack;
296 PL_stack_sp = c->stack_sp;
297 PL_op = c->op;
298 PL_curpad = c->curpad;
299 PL_comppad = c->comppad;
300 PL_stack_base = c->stack_base;
301 PL_stack_max = c->stack_max;
302 PL_tmps_stack = c->tmps_stack;
303 PL_tmps_floor = c->tmps_floor;
304 PL_tmps_ix = c->tmps_ix;
305 PL_tmps_max = c->tmps_max;
306 PL_markstack = c->markstack;
307 PL_markstack_ptr = c->markstack_ptr;
308 PL_markstack_max = c->markstack_max;
309 PL_scopestack = c->scopestack;
310 PL_scopestack_ix = c->scopestack_ix;
311 PL_scopestack_max = c->scopestack_max;
312 PL_savestack = c->savestack;
313 PL_savestack_ix = c->savestack_ix;
314 PL_savestack_max = c->savestack_max;
315 PL_retstack = c->retstack;
316 PL_retstack_ix = c->retstack_ix;
317 PL_retstack_max = c->retstack_max;
318 PL_curcop = c->curcop;
319 PL_top_env = c->top_env;
320 314
321 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); 315 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
322 if (c->defsv) REPLACE_SV (DEFSV , c->defsv); 316 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
323 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 }
324 329
325 { 330 {
326 dSP; 331 dSP;
327 CV *cv; 332 CV *cv;
328 333
329 /* now do the ugly restore mess */ 334 /* now do the ugly restore mess */
330 while ((cv = (CV *)POPs)) 335 while ((cv = (CV *)POPs))
331 { 336 {
332 AV *padlist = (AV *)POPs;
333
334 if (padlist)
335 {
336 put_padlist (cv); /* mark this padlist as available */ 337 put_padlist (cv); /* mark this padlist as available */
337 CvPADLIST(cv) = padlist; 338 CvDEPTH (cv) = PTR2IV (POPs);
338#ifdef USE_THREADS 339 CvPADLIST (cv) = (AV *)POPs;
339 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
340#endif
341 }
342
343 ++CvDEPTH(cv);
344 } 340 }
345 341
346 PUTBACK; 342 PUTBACK;
347 } 343 }
348} 344}
349 345
350static void 346static void
351save_state(pTHX_ Coro__State c, int flags) 347save_perl (Coro__State c)
352{ 348{
353 { 349 {
354 dSP; 350 dSP;
355 I32 cxix = cxstack_ix; 351 I32 cxix = cxstack_ix;
356 PERL_CONTEXT *ccstk = cxstack; 352 PERL_CONTEXT *ccstk = cxstack;
359 /* 355 /*
360 * 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
361 * (and reinitialize) all cv's in the whole callchain :( 357 * (and reinitialize) all cv's in the whole callchain :(
362 */ 358 */
363 359
360 EXTEND (SP, 3 + 1);
364 PUSHs (Nullsv); 361 PUSHs (Nullsv);
365 /* this loop was inspired by pp_caller */ 362 /* this loop was inspired by pp_caller */
366 for (;;) 363 for (;;)
367 { 364 {
368 while (cxix >= 0) 365 while (cxix >= 0)
369 { 366 {
370 PERL_CONTEXT *cx = &ccstk[cxix--]; 367 PERL_CONTEXT *cx = &ccstk[cxix--];
371 368
372 if (CxTYPE(cx) == CXt_SUB) 369 if (CxTYPE (cx) == CXt_SUB)
373 { 370 {
374 CV *cv = cx->blk_sub.cv; 371 CV *cv = cx->blk_sub.cv;
372
375 if (CvDEPTH(cv)) 373 if (CvDEPTH (cv))
376 { 374 {
377#ifdef USE_THREADS
378 /*XPUSHs ((SV *)CvOWNER(cv));*/
379 /*CvOWNER(cv) = 0;*/
380 /*error must unlock this cv etc.. etc...*/
381#endif
382 EXTEND (SP, CvDEPTH(cv)*2); 375 EXTEND (SP, 3);
383
384 while (--CvDEPTH(cv))
385 {
386 /* this tells the restore code to increment CvDEPTH */
387 PUSHs (Nullsv);
388 PUSHs ((SV *)cv);
389 }
390
391 PUSHs ((SV *)CvPADLIST(cv)); 376 PUSHs ((SV *)CvPADLIST (cv));
377 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
392 PUSHs ((SV *)cv); 378 PUSHs ((SV *)cv);
393 379
380 CvDEPTH (cv) = 0;
394 get_padlist (cv); /* this is a monster */ 381 get_padlist (cv);
395 } 382 }
396 }
397 else if (CxTYPE(cx) == CXt_FORMAT)
398 {
399 /* I never used formats, so how should I know how these are implemented? */
400 /* my bold guess is as a simple, plain sub... */
401 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
402 } 383 }
403 } 384 }
404 385
405 if (top_si->si_type == PERLSI_MAIN) 386 if (top_si->si_type == PERLSI_MAIN)
406 break; 387 break;
411 } 392 }
412 393
413 PUTBACK; 394 PUTBACK;
414 } 395 }
415 396
416 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;
417 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 398 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
418 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;
419 401
420 c->dowarn = PL_dowarn; 402#define VAR(name,type)c->name = PL_ ## name;
421 c->in_eval = PL_in_eval; 403# include "state.h"
422 404#undef VAR
423 c->curstackinfo = PL_curstackinfo;
424 c->curstack = PL_curstack;
425 c->mainstack = PL_mainstack;
426 c->stack_sp = PL_stack_sp;
427 c->op = PL_op;
428 c->curpad = PL_curpad;
429 c->comppad = PL_comppad;
430 c->stack_base = PL_stack_base;
431 c->stack_max = PL_stack_max;
432 c->tmps_stack = PL_tmps_stack;
433 c->tmps_floor = PL_tmps_floor;
434 c->tmps_ix = PL_tmps_ix;
435 c->tmps_max = PL_tmps_max;
436 c->markstack = PL_markstack;
437 c->markstack_ptr = PL_markstack_ptr;
438 c->markstack_max = PL_markstack_max;
439 c->scopestack = PL_scopestack;
440 c->scopestack_ix = PL_scopestack_ix;
441 c->scopestack_max = PL_scopestack_max;
442 c->savestack = PL_savestack;
443 c->savestack_ix = PL_savestack_ix;
444 c->savestack_max = PL_savestack_max;
445 c->retstack = PL_retstack;
446 c->retstack_ix = PL_retstack_ix;
447 c->retstack_max = PL_retstack_max;
448 c->curcop = PL_curcop;
449 c->top_env = PL_top_env;
450} 405}
451 406
452/* 407/*
453 * allocate various perl stacks. This is an exact copy 408 * allocate various perl stacks. This is an exact copy
454 * of perl.c:init_stacks, except that it uses less memory 409 * of perl.c:init_stacks, except that it uses less memory
455 * on the assumption that coroutines do not usually need 410 * on the (sometimes correct) assumption that coroutines do
456 * a lot of stackspace. 411 * not usually need a lot of stackspace.
457 */ 412 */
458STATIC void 413#if PREFER_PERL_FUNCTIONS
414# define coro_init_stacks init_stacks
415#else
416static void
459coro_init_stacks (pTHX) 417coro_init_stacks ()
460{ 418{
461 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 419 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
462 PL_curstackinfo->si_type = PERLSI_MAIN; 420 PL_curstackinfo->si_type = PERLSI_MAIN;
463 PL_curstack = PL_curstackinfo->si_stack; 421 PL_curstack = PL_curstackinfo->si_stack;
464 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 422 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
465 423
466 PL_stack_base = AvARRAY(PL_curstack); 424 PL_stack_base = AvARRAY(PL_curstack);
467 PL_stack_sp = PL_stack_base; 425 PL_stack_sp = PL_stack_base;
468 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 426 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
469 427
470 New(50,PL_tmps_stack,96,SV*); 428 New(50,PL_tmps_stack,128,SV*);
471 PL_tmps_floor = -1; 429 PL_tmps_floor = -1;
472 PL_tmps_ix = -1; 430 PL_tmps_ix = -1;
473 PL_tmps_max = 96; 431 PL_tmps_max = 128;
474 432
475 New(54,PL_markstack,16,I32); 433 New(54,PL_markstack,32,I32);
476 PL_markstack_ptr = PL_markstack; 434 PL_markstack_ptr = PL_markstack;
477 PL_markstack_max = PL_markstack + 16; 435 PL_markstack_max = PL_markstack + 32;
478 436
437#ifdef SET_MARK_OFFSET
479 SET_MARK_OFFSET; 438 SET_MARK_OFFSET;
439#endif
480 440
481 New(54,PL_scopestack,16,I32); 441 New(54,PL_scopestack,32,I32);
482 PL_scopestack_ix = 0; 442 PL_scopestack_ix = 0;
483 PL_scopestack_max = 16; 443 PL_scopestack_max = 32;
484 444
485 New(54,PL_savestack,96,ANY); 445 New(54,PL_savestack,64,ANY);
486 PL_savestack_ix = 0; 446 PL_savestack_ix = 0;
487 PL_savestack_max = 96; 447 PL_savestack_max = 64;
488 448
449#if !PERL_VERSION_ATLEAST (5,9,0)
489 New(54,PL_retstack,8,OP*); 450 New(54,PL_retstack,16,OP*);
490 PL_retstack_ix = 0; 451 PL_retstack_ix = 0;
491 PL_retstack_max = 8; 452 PL_retstack_max = 16;
453#endif
492} 454}
455#endif
493 456
494/* 457/*
495 * destroy the stacks, the callchain etc... 458 * destroy the stacks, the callchain etc...
496 * still there is a memleak of 128 bytes...
497 */ 459 */
498STATIC void 460static void
499destroy_stacks(pTHX) 461coro_destroy_stacks ()
500{ 462{
501 if (!IN_DESTRUCT) 463 if (!IN_DESTRUCT)
502 { 464 {
503 /* is this ugly, I ask? */ 465 /* restore all saved variables and stuff */
504 while (PL_scopestack_ix) 466 LEAVE_SCOPE (0);
505 LEAVE; 467 assert (PL_tmps_floor == -1);
506 468
507 /* sure it is, but more important: is it correct?? :/ */ 469 /* free all temporaries */
508 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
509 FREETMPS; 470 FREETMPS;
471 assert (PL_tmps_ix == -1);
472
473 POPSTACK_TO (PL_mainstack);
510 } 474 }
511 475
512 while (PL_curstackinfo->si_next) 476 while (PL_curstackinfo->si_next)
513 PL_curstackinfo = PL_curstackinfo->si_next; 477 PL_curstackinfo = PL_curstackinfo->si_next;
514 478
515 while (PL_curstackinfo) 479 while (PL_curstackinfo)
516 { 480 {
517 PERL_SI *p = PL_curstackinfo->si_prev; 481 PERL_SI *p = PL_curstackinfo->si_prev;
518 482
519 {
520 dSP;
521 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
522 PUTBACK; /* possibly superfluous */
523 }
524
525 if (!IN_DESTRUCT) 483 if (!IN_DESTRUCT)
526 {
527 dounwind(-1);
528 SvREFCNT_dec(PL_curstackinfo->si_stack); 484 SvREFCNT_dec (PL_curstackinfo->si_stack);
529 }
530 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#if 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_ANONYMOUS, 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 = PL_ppaddr[OP_ENTERSUB](aTHX);
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;
662 JMPENV coro_start_env;
663
664 PL_top_env = &ctx->start_env; 578 PL_top_env = &PL_start_env;
665 579
666 ctx->cursp = 0; 580 /* inject call to cctx_init */
667 PL_op = PL_op->op_next; 581 prepare_cctx ((coro_cctx *)arg);
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 dSTACKLEVEL; 705 dSTACKLEVEL;
677 static struct coro *xnext;
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 xnext = next; 715 coro_cctx *prev__cctx;
682 716
683 if (next->mainstack) 717 if (prev->flags & CF_NEW)
684 { 718 {
685 SAVE (prev, flags); 719 /* create a new empty context */
686 LOAD (next); 720 Newz (0, prev->cctx, 1, coro_cctx);
687 721 prev->cctx->inuse = 1;
688 /* mark this state as in-use */ 722 prev->flags &= ~CF_NEW;
689 next->mainstack = 0; 723 prev->flags |= CF_RUNNING;
690 next->tmps_ix = -2;
691
692 /* stacklevel changed? if yes, grab the stack for us! */
693 if (flags & TRANSFER_SAVE_CCTXT)
694 {
695 if (!prev->stack)
696 allocate_stack (prev, 0);
697 else if (prev->cursp != stacklevel
698 && prev->stack->usecnt > 1)
699 {
700 prev->gencnt = ++prev->stack->gencnt;
701 prev->stack->usecnt = 1;
702 }
703
704 /* has our stack been invalidated? */
705 if (next->stack && next->stack->gencnt != next->gencnt)
706 {
707 deallocate_stack (next);
708 allocate_stack (next, 1);
709 coro_create (&(next->stack->cctx),
710 continue_coro, (void *)next,
711 next->stack->sptr, labs (next->stack->ssize));
712 }
713
714 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
715 /* don't add any code here */
716 }
717
718 } 724 }
719 else if (next->tmps_ix == -2) 725
720 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 }
721 else 749 else
722 { 750 {
723 SAVE (prev, -1); /* first get rid of the old state */ 751 /* coroutine already started */
724 752 save_perl (prev);
725 if (flags & TRANSFER_SAVE_CCTXT) 753 load_perl (next);
726 {
727 if (!prev->stack)
728 allocate_stack (prev, 0);
729
730 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
731 {
732 PL_top_env = &next->start_env;
733
734 setup_coro (next);
735
736 prev->stack->refcnt++;
737 prev->stack->usecnt++;
738 next->stack = prev->stack;
739 next->gencnt = prev->gencnt;
740 }
741 else
742 {
743 allocate_stack (next, 1);
744 coro_create (&(next->stack->cctx),
745 setup_coro, (void *)next,
746 next->stack->sptr, labs (next->stack->ssize));
747 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
748 /* don't add any code here */
749 }
750 }
751 else
752 setup_coro (next);
753 } 754 }
754 755
755 /* 756 prev__cctx = prev->cctx;
756 * xnext is now either prev or next, depending on wether 757
757 * we switched the c stack or not. that's why I use a global 758 /* possibly "free" the cctx */
758 * variable, that should become thread-specific at one point. 759 if (prev__cctx->idle_sp == STACKLEVEL)
759 */ 760 {
760 xnext->cursp = stacklevel; 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;
761 } 787 }
788}
762 789
763 if (coro_mortal) 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)
764 { 804 {
765 SvREFCNT_dec (coro_mortal); 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
766 coro_mortal = 0; 819 coro->mainstack = 0;
767 } 820 }
768}
769 821
770#define SV_CORO(sv,func) \ 822 cctx_destroy (coro->cctx);
771 do { \ 823 SvREFCNT_dec (coro->args);
772 if (SvROK (sv)) \ 824 Safefree (coro);
773 sv = SvRV (sv); \ 825}
774 \
775 if (SvTYPE(sv) == SVt_PVHV) \
776 { \
777 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
778 \
779 if (!he) \
780 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
781 \
782 (sv) = SvRV (HeVAL(he)); \
783 } \
784 \
785 /* must also be changed inside Coro::Cont::yield */ \
786 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \
787 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
788 \
789 } while(0)
790 826
791#define SvSTATE(sv) (struct coro *)SvIV (sv)
792
793static void 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
794api_transfer(pTHX_ SV *prev, SV *next, int flags) 889api_transfer (SV *prev_sv, SV *next_sv)
795{ 890{
796 SV_CORO (prev, "Coro::transfer"); 891 struct transfer_args ta;
797 SV_CORO (next, "Coro::transfer");
798 892
799 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); 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;
800} 907}
801 908
802/** Coro ********************************************************************/ 909/** Coro ********************************************************************/
803 910
804#define PRIO_MAX 3 911#define PRIO_MAX 3
807#define PRIO_LOW -1 914#define PRIO_LOW -1
808#define PRIO_IDLE -3 915#define PRIO_IDLE -3
809#define PRIO_MIN -4 916#define PRIO_MIN -4
810 917
811/* for Coro.pm */ 918/* for Coro.pm */
812static GV *coro_current, *coro_idle; 919static SV *coro_current;
813static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 920static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
814static int coro_nready; 921static int coro_nready;
815 922
816static void 923static void
817coro_enq (SV *sv) 924coro_enq (SV *coro_sv)
818{ 925{
819 if (SvTYPE (sv) == SVt_PVHV)
820 {
821 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
822 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
823
824 prio = prio > PRIO_MAX ? PRIO_MAX
825 : prio < PRIO_MIN ? PRIO_MIN
826 : prio;
827
828 av_push (coro_ready [prio - PRIO_MIN], sv); 926 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
829 coro_nready++; 927 coro_nready++;
830
831 return;
832 }
833
834 croak ("Coro::ready tried to enqueue something that is not a coroutine");
835} 928}
836 929
837static SV * 930static SV *
838coro_deq (int min_prio) 931coro_deq (int min_prio)
839{ 932{
842 min_prio -= PRIO_MIN; 935 min_prio -= PRIO_MIN;
843 if (min_prio < 0) 936 if (min_prio < 0)
844 min_prio = 0; 937 min_prio = 0;
845 938
846 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 939 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
847 if (av_len (coro_ready[prio]) >= 0) 940 if (AvFILLp (coro_ready [prio]) >= 0)
848 { 941 {
849 coro_nready--; 942 coro_nready--;
850 return av_shift (coro_ready[prio]); 943 return av_shift (coro_ready [prio]);
851 } 944 }
852 945
853 return 0; 946 return 0;
854} 947}
855 948
856static void 949static int
857api_ready (SV *coro) 950api_ready (SV *coro_sv)
858{ 951{
952 struct coro *coro;
953
859 if (SvROK (coro)) 954 if (SvROK (coro_sv))
860 coro = SvRV (coro); 955 coro_sv = SvRV (coro_sv);
861 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;
862 coro_enq (SvREFCNT_inc (coro)); 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);
863} 1036}
864 1037
865static void 1038static void
866api_schedule (void) 1039api_schedule (void)
867{ 1040{
868 SV *prev, *next; 1041 struct transfer_args ta;
869 1042
870 prev = SvRV (GvSV (coro_current)); 1043 prepare_schedule (&ta);
871 next = coro_deq (PRIO_MIN); 1044 TRANSFER (ta);
872
873 if (!next)
874 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
875
876 /* free this only after the transfer */
877 coro_mortal = prev;
878 SV_CORO (prev, "Coro::schedule");
879
880 SvRV (GvSV (coro_current)) = next;
881
882 SV_CORO (next, "Coro::schedule");
883
884 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
885 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
886} 1045}
887 1046
888static void 1047static void
889api_cede (void) 1048api_cede (void)
890{ 1049{
891 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); 1050 struct transfer_args ta;
892 1051
893 api_schedule (); 1052 prepare_cede (&ta);
1053 TRANSFER (ta);
894} 1054}
895 1055
896MODULE = Coro::State PACKAGE = Coro::State 1056MODULE = Coro::State PACKAGE = Coro::State
897 1057
898PROTOTYPES: ENABLE 1058PROTOTYPES: DISABLE
899 1059
900BOOT: 1060BOOT:
901{ /* {} necessary for stoopid perl-5.6.x */ 1061{
902 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1062#ifdef USE_ITHREADS
903 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1063 MUTEX_INIT (&coro_mutex);
1064#endif
1065 BOOT_PAGESIZE;
1066
904 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1067 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
905 1068
906 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1069 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
907 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1070 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
908 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));
909 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1073 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
910
911 if (!padlist_cache)
912 padlist_cache = newHV ();
913 1074
914 main_mainstack = PL_mainstack; 1075 main_mainstack = PL_mainstack;
915 1076
916 coroapi.ver = CORO_API_VERSION; 1077 coroapi.ver = CORO_API_VERSION;
917 coroapi.transfer = api_transfer; 1078 coroapi.transfer = api_transfer;
918}
919 1079
920Coro::State 1080 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
921_newprocess(args) 1081}
922 SV * args 1082
923 PROTOTYPE: $ 1083SV *
1084new (char *klass, ...)
924 CODE: 1085 CODE:
925 Coro__State coro; 1086{
1087 struct coro *coro;
1088 HV *hv;
1089 int i;
926 1090
927 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
928 croak ("Coro::State::_newprocess expects an arrayref");
929
930 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;
931 1095
932 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1096 hv = newHV ();
933 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;
934 coro->stack = 0; 1098 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
935 1099
936 /* same as JMPENV_BOOTSTRAP */ 1100 for (i = 1; i < items; i++)
937 /* we might be able to recycle start_env, but safe is safe */ 1101 av_push (coro->args, newSVsv (ST (i)));
938 Zero(&coro->start_env, 1, JMPENV); 1102}
939 coro->start_env.je_ret = -1;
940 coro->start_env.je_mustcatch = TRUE;
941
942 RETVAL = coro;
943 OUTPUT: 1103 OUTPUT:
944 RETVAL 1104 RETVAL
945 1105
1106int
1107save (SV *coro, int new_save = -1)
1108 CODE:
1109 RETVAL = api_save (coro, new_save);
1110 OUTPUT:
1111 RETVAL
1112
946void 1113void
947transfer(prev, next, flags) 1114_set_stacklevel (...)
948 SV *prev 1115 ALIAS:
949 SV *next 1116 Coro::State::transfer = 1
950 int flags 1117 Coro::schedule = 2
951 PROTOTYPE: @ 1118 Coro::cede = 3
952 CODE: 1119 CODE:
953 PUTBACK; 1120{
954 SV_CORO (next, "Coro::transfer"); 1121 struct transfer_args ta;
955 SV_CORO (prev, "Coro::transfer"); 1122
956 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1123 switch (ix)
957 SPAGAIN; 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}
958 1148
959void 1149void
960DESTROY(coro) 1150_clone_state_from (SV *dst, SV *src)
961 Coro::State coro 1151 CODE:
962 CODE: 1152{
1153 struct coro *coro_src = SvSTATE (src);
963 1154
964 if (coro->mainstack && coro->mainstack != main_mainstack) 1155 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
965 {
966 struct coro temp;
967 1156
968 PUTBACK; 1157 ++coro_src->refcnt;
969 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1158 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
970 LOAD(aTHX_ coro); 1159}
971 SPAGAIN;
972
973 destroy_stacks (aTHX);
974
975 LOAD((&temp)); /* this will get rid of defsv etc.. */
976 SPAGAIN;
977
978 coro->mainstack = 0;
979 }
980
981 deallocate_stack (coro);
982
983 Safefree (coro);
984 1160
985void 1161void
986flush()
987 CODE:
988#ifdef MAY_FLUSH
989 flush_padlist_cache ();
990#endif
991
992void
993_exit(code) 1162_exit (code)
994 int code 1163 int code
995 PROTOTYPE: $ 1164 PROTOTYPE: $
996 CODE: 1165 CODE:
997#if defined(__GLIBC__) || _POSIX_C_SOURCE
998 _exit (code); 1166 _exit (code);
999#else
1000 signal (SIGTERM, SIG_DFL);
1001 raise (SIGTERM);
1002 exit (code);
1003#endif
1004 1167
1005MODULE = Coro::State PACKAGE = Coro::Cont 1168int
1169cctx_count ()
1170 CODE:
1171 RETVAL = cctx_count;
1172 OUTPUT:
1173 RETVAL
1006 1174
1007# this is slightly dirty (should expose a c-level api) 1175int
1008 1176cctx_idle ()
1009void 1177 CODE:
1010yield(...) 1178 RETVAL = cctx_idle;
1011 PROTOTYPE: @ 1179 OUTPUT:
1012 CODE: 1180 RETVAL
1013 static SV *returnstk;
1014 SV *sv;
1015 AV *defav = GvAV (PL_defgv);
1016 struct coro *prev, *next;
1017
1018 if (!returnstk)
1019 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
1020
1021 /* set up @_ -- ugly */
1022 av_clear (defav);
1023 av_fill (defav, items - 1);
1024 while (items--)
1025 av_store (defav, items, SvREFCNT_inc (ST(items)));
1026
1027 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1028 sv = av_pop ((AV *)SvRV (returnstk));
1029 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1030 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1031 SvREFCNT_dec (sv);
1032
1033 transfer(aTHX_ prev, next, 0);
1034 1181
1035MODULE = Coro::State PACKAGE = Coro 1182MODULE = Coro::State PACKAGE = Coro
1036 1183
1037# this is slightly dirty (should expose a c-level api)
1038
1039BOOT: 1184BOOT:
1040{ 1185{
1041 int i; 1186 int i;
1187
1042 HV *stash = gv_stashpv ("Coro", TRUE); 1188 coro_stash = gv_stashpv ("Coro", TRUE);
1043 1189
1044 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1190 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1045 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1191 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1046 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1192 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1047 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1193 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1048 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1194 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1049 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1195 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1050 1196
1051 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1197 coro_current = get_sv ("Coro::current", FALSE);
1052 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1198 SvREADONLY_on (coro_current);
1053 1199
1054 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1200 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1055 coro_ready[i] = newAV (); 1201 coro_ready[i] = newAV ();
1056 1202
1057 { 1203 {
1058 SV *sv = perl_get_sv("Coro::API", 1); 1204 SV *sv = perl_get_sv("Coro::API", 1);
1059 1205
1060 coroapi.schedule = api_schedule; 1206 coroapi.schedule = api_schedule;
1207 coroapi.save = api_save;
1061 coroapi.cede = api_cede; 1208 coroapi.cede = api_cede;
1062 coroapi.ready = api_ready; 1209 coroapi.ready = api_ready;
1210 coroapi.is_ready = api_is_ready;
1063 coroapi.nready = &coro_nready; 1211 coroapi.nready = &coro_nready;
1064 coroapi.current = coro_current; 1212 coroapi.current = coro_current;
1065 1213
1066 GCoroAPI = &coroapi; 1214 GCoroAPI = &coroapi;
1067 sv_setiv(sv, (IV)&coroapi); 1215 sv_setiv (sv, (IV)&coroapi);
1068 SvREADONLY_on(sv); 1216 SvREADONLY_on (sv);
1069 } 1217 }
1070} 1218}
1071 1219
1072void 1220void
1073ready(self) 1221_set_current (SV *current)
1074 SV * self
1075 PROTOTYPE: $ 1222 PROTOTYPE: $
1076 CODE: 1223 CODE:
1077 api_ready (self); 1224 SvREFCNT_dec (SvRV (coro_current));
1225 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1078 1226
1079int 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
1080nready(...) 1264nready (...)
1081 PROTOTYPE: 1265 PROTOTYPE:
1082 CODE: 1266 CODE:
1083 RETVAL = coro_nready; 1267 RETVAL = coro_nready;
1084 OUTPUT: 1268 OUTPUT:
1085 RETVAL 1269 RETVAL
1086 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
1291
1087void 1292void
1088schedule(...) 1293_set_state (char *data_)
1089 PROTOTYPE: 1294 PROTOTYPE: $
1090 CODE: 1295 CODE:
1091 api_schedule (); 1296{
1297 struct io_state *data = (void *)data_;
1092 1298
1093void 1299 errno = data->errorno;
1094cede(...) 1300 PL_laststype = data->laststype;
1095 PROTOTYPE: 1301 PL_laststatval = data->laststatval;
1096 CODE: 1302 PL_statcache = data->statcache;
1097 api_cede (); 1303}
1098 1304

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines