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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines