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.25 by root, Wed Aug 15 03:24:07 2001 UTC vs.
Revision 1.127 by root, Tue Dec 12 13:56:45 2006 UTC

1#include "libcoro/coro.c"
2
1#include "EXTERN.h" 3#include "EXTERN.h"
2#include "perl.h" 4#include "perl.h"
3#include "XSUB.h" 5#include "XSUB.h"
4 6
5#include "libcoro/coro.c" 7#include "patchlevel.h"
6 8
7#include <signal.h> 9#include <stdio.h>
10#include <errno.h>
11#include <assert.h>
8 12
9#ifdef HAVE_MMAP 13#ifdef HAVE_MMAP
10# include <unistd.h> 14# include <unistd.h>
11# include <sys/mman.h> 15# include <sys/mman.h>
12# ifndef MAP_ANON
13# ifdef MAP_ANONYMOUS 16# ifndef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS 17# ifdef MAP_ANON
18# define MAP_ANONYMOUS MAP_ANON
15# else 19# else
16# undef HAVE_MMAP 20# undef HAVE_MMAP
17# endif 21# endif
18# endif 22# endif
23# include <limits.h>
24# ifndef PAGESIZE
25# define PAGESIZE pagesize
26# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
27static long pagesize;
28# else
29# define BOOT_PAGESIZE (void)0
19#endif 30# endif
31#else
32# define PAGESIZE 0
33# define BOOT_PAGESIZE (void)0
34#endif
20 35
21#define MAY_FLUSH /* increases codesize */ 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
25 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
87
26/* The next macro should delcare a variable stacklevel that contains and approximation 88/* The next macro should declare a variable stacklevel that contains and approximation
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])) 227
165 { 228 SvREFCNT_dec ((SV*)padlist);
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 } 229 }
230}
175 231
176#if 0 /* return -ENOTUNDERSTOOD */ 232static int
177 /* 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;
178 237
179 for (ix = fpad; ix > 0; ix--) { 238 /* casting is fun. */
180 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 239 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
181 if (namesv 240 free_padlist (padlist);
182 && namesv != &PL_sv_undef 241
183 && !(SvFLAGS(namesv) & SVf_FAKE) 242 SvREFCNT_dec (av);
184 && *SvPVX(namesv) == '&' 243
185 && CvCLONE(ppad[ix])) 244 return 0;
186 { 245}
187 CV *kid = cv_clone((CV*)ppad[ix]); 246
188 SvREFCNT_dec(ppad[ix]); 247#define PERL_MAGIC_coro PERL_MAGIC_ext
189 CvCLONE_on(kid); 248
190 SvPADMY_on(kid); 249static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
191 npad[ix] = (SV*)kid; 250
192 } 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 ();
193 } 293 }
194#endif
195 294
196 return newpadlist; 295 av = (AV *)mg->mg_obj;
197}
198 296
199#ifdef MAY_FLUSH 297 if (AvFILLp (av) >= AvMAX (av))
200STATIC AV * 298 av_extend (av, AvMAX (av) + 1);
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 299
215 SvREFCNT_dec((SV*)padlist); 300 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
216 }
217} 301}
218#endif
219
220/* the next two functions merely cache the padlists */
221STATIC void
222get_padlist (CV *cv)
223{
224 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
225
226 if (he && AvFILLp ((AV *)*he) >= 0)
227 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
228 else
229 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
230}
231
232STATIC void
233put_padlist (CV *cv)
234{
235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
236
237 if (SvTYPE (*he) != SVt_PVAV)
238 {
239 SvREFCNT_dec (*he);
240 *he = (SV *)newAV ();
241 }
242
243 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
244}
245
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 {
255 HE *he;
256 AV *padlist;
257
258 while (!!(he = hv_iternext (hv)))
259 {
260 AV *av = (AV *)HeVAL(he);
261
262 /* casting is fun. */
263 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
264 free_padlist (padlist);
265 }
266 }
267
268 SvREFCNT_dec (hv);
269}
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) SB load_state(aTHX_ (state)); SPAGAIN; SE
276#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
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 /* I have not the slightest idea of why av_reify is necessary */ 402#define VAR(name,type)c->name = PL_ ## name;
414 /* but if it's missing the defav contents magically get replaced sometimes */ 403# include "state.h"
415 if (c->defav) 404#undef VAR
416 av_reify (c->defav);
417
418 c->dowarn = PL_dowarn;
419 c->in_eval = PL_in_eval;
420
421 c->curstackinfo = PL_curstackinfo;
422 c->curstack = PL_curstack;
423 c->mainstack = PL_mainstack;
424 c->stack_sp = PL_stack_sp;
425 c->op = PL_op;
426 c->curpad = PL_curpad;
427 c->stack_base = PL_stack_base;
428 c->stack_max = PL_stack_max;
429 c->tmps_stack = PL_tmps_stack;
430 c->tmps_floor = PL_tmps_floor;
431 c->tmps_ix = PL_tmps_ix;
432 c->tmps_max = PL_tmps_max;
433 c->markstack = PL_markstack;
434 c->markstack_ptr = PL_markstack_ptr;
435 c->markstack_max = PL_markstack_max;
436 c->scopestack = PL_scopestack;
437 c->scopestack_ix = PL_scopestack_ix;
438 c->scopestack_max = PL_scopestack_max;
439 c->savestack = PL_savestack;
440 c->savestack_ix = PL_savestack_ix;
441 c->savestack_max = PL_savestack_max;
442 c->retstack = PL_retstack;
443 c->retstack_ix = PL_retstack_ix;
444 c->retstack_max = PL_retstack_max;
445 c->curcop = PL_curcop;
446 c->top_env = PL_top_env;
447} 405}
448 406
449/* 407/*
450 * allocate various perl stacks. This is an exact copy 408 * allocate various perl stacks. This is an exact copy
451 * of perl.c:init_stacks, except that it uses less memory 409 * of perl.c:init_stacks, except that it uses less memory
452 * on the assumption that coroutines do not usually need 410 * on the (sometimes correct) assumption that coroutines do
453 * a lot of stackspace. 411 * not usually need a lot of stackspace.
454 */ 412 */
455STATIC void 413#if PREFER_PERL_FUNCTIONS
414# define coro_init_stacks init_stacks
415#else
416static void
456coro_init_stacks (pTHX) 417coro_init_stacks ()
457{ 418{
458 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 419 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
459 PL_curstackinfo->si_type = PERLSI_MAIN; 420 PL_curstackinfo->si_type = PERLSI_MAIN;
460 PL_curstack = PL_curstackinfo->si_stack; 421 PL_curstack = PL_curstackinfo->si_stack;
461 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 422 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
462 423
463 PL_stack_base = AvARRAY(PL_curstack); 424 PL_stack_base = AvARRAY(PL_curstack);
464 PL_stack_sp = PL_stack_base; 425 PL_stack_sp = PL_stack_base;
465 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 426 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
466 427
467 New(50,PL_tmps_stack,96,SV*); 428 New(50,PL_tmps_stack,128,SV*);
468 PL_tmps_floor = -1; 429 PL_tmps_floor = -1;
469 PL_tmps_ix = -1; 430 PL_tmps_ix = -1;
470 PL_tmps_max = 96; 431 PL_tmps_max = 128;
471 432
472 New(54,PL_markstack,16,I32); 433 New(54,PL_markstack,32,I32);
473 PL_markstack_ptr = PL_markstack; 434 PL_markstack_ptr = PL_markstack;
474 PL_markstack_max = PL_markstack + 16; 435 PL_markstack_max = PL_markstack + 32;
475 436
437#ifdef SET_MARK_OFFSET
476 SET_MARK_OFFSET; 438 SET_MARK_OFFSET;
439#endif
477 440
478 New(54,PL_scopestack,16,I32); 441 New(54,PL_scopestack,32,I32);
479 PL_scopestack_ix = 0; 442 PL_scopestack_ix = 0;
480 PL_scopestack_max = 16; 443 PL_scopestack_max = 32;
481 444
482 New(54,PL_savestack,96,ANY); 445 New(54,PL_savestack,64,ANY);
483 PL_savestack_ix = 0; 446 PL_savestack_ix = 0;
484 PL_savestack_max = 96; 447 PL_savestack_max = 64;
485 448
449#if !PERL_VERSION_ATLEAST (5,9,0)
486 New(54,PL_retstack,8,OP*); 450 New(54,PL_retstack,16,OP*);
487 PL_retstack_ix = 0; 451 PL_retstack_ix = 0;
488 PL_retstack_max = 8; 452 PL_retstack_max = 16;
453#endif
489} 454}
455#endif
490 456
491/* 457/*
492 * destroy the stacks, the callchain etc... 458 * destroy the stacks, the callchain etc...
493 * still there is a memleak of 128 bytes...
494 */ 459 */
495STATIC void 460static void
496destroy_stacks(pTHX) 461coro_destroy_stacks ()
497{ 462{
498 /* is this ugly, I ask? */ 463 if (!IN_DESTRUCT)
499 while (PL_scopestack_ix) 464 {
500 LEAVE; 465 /* restore all saved variables and stuff */
466 LEAVE_SCOPE (0);
467 assert (PL_tmps_floor == -1);
501 468
502 /* sure it is, but more important: is it correct?? :/ */ 469 /* free all temporaries */
503 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
504 FREETMPS; 470 FREETMPS;
471 assert (PL_tmps_ix == -1);
472
473 POPSTACK_TO (PL_mainstack);
474 }
505 475
506 while (PL_curstackinfo->si_next) 476 while (PL_curstackinfo->si_next)
507 PL_curstackinfo = PL_curstackinfo->si_next; 477 PL_curstackinfo = PL_curstackinfo->si_next;
508 478
509 while (PL_curstackinfo) 479 while (PL_curstackinfo)
510 { 480 {
511 PERL_SI *p = PL_curstackinfo->si_prev; 481 PERL_SI *p = PL_curstackinfo->si_prev;
512 482
513 { 483 if (!IN_DESTRUCT)
514 dSP;
515 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
516 PUTBACK; /* possibly superfluous */
517 }
518
519 if (PL_main_cv != Nullcv) /* don't during destruction. hack? */
520 dounwind(-1);
521
522 SvREFCNT_dec(PL_curstackinfo->si_stack); 484 SvREFCNT_dec (PL_curstackinfo->si_stack);
485
523 Safefree(PL_curstackinfo->si_cxstack); 486 Safefree (PL_curstackinfo->si_cxstack);
524 Safefree(PL_curstackinfo); 487 Safefree (PL_curstackinfo);
525 PL_curstackinfo = p; 488 PL_curstackinfo = p;
526 } 489 }
527 490
528 Safefree(PL_tmps_stack); 491 Safefree (PL_tmps_stack);
529 Safefree(PL_markstack); 492 Safefree (PL_markstack);
530 Safefree(PL_scopestack); 493 Safefree (PL_scopestack);
531 Safefree(PL_savestack); 494 Safefree (PL_savestack);
495#if !PERL_VERSION_ATLEAST (5,9,0)
532 Safefree(PL_retstack); 496 Safefree (PL_retstack);
533}
534
535static void
536allocate_stack (Coro__State ctx, int alloc)
537{
538 coro_stack *stack;
539
540 New (0, stack, 1, coro_stack);
541
542 stack->refcnt = 1;
543 stack->usecnt = 1;
544 stack->gencnt = ctx->gencnt = 0;
545 if (alloc)
546 {
547#ifdef HAVE_MMAP
548 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
549 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
550 if (stack->sptr == (void *)-1)
551#endif 497#endif
552 {
553 /*FIXME*//*D*//* reasonable stack size! */
554 stack->ssize = -4096 * sizeof (long);
555 New (0, stack->sptr, 4096, long);
556 }
557 }
558 else
559 stack->sptr = 0;
560
561 ctx->stack = stack;
562} 498}
563 499
564static void 500static void
565deallocate_stack (Coro__State ctx) 501setup_coro (struct coro *coro)
566{
567 coro_stack *stack = ctx->stack;
568
569 ctx->stack = 0;
570
571 if (stack)
572 {
573 if (!--stack->refcnt)
574 {
575#ifdef HAVE_MMAP
576 if (stack->ssize > 0 && stack->sptr)
577 munmap (stack->sptr, stack->ssize);
578 else
579#else
580 Safefree (stack->sptr);
581#endif
582 Safefree (stack);
583 }
584 else if (ctx->gencnt == stack->gencnt)
585 --stack->usecnt;
586 }
587}
588
589static void
590setup_coro (void *arg)
591{ 502{
592 /* 503 /*
593 * emulate part of the perl startup here. 504 * emulate part of the perl startup here.
594 */ 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{
595 dSP; 552 dSP;
596 Coro__State ctx = (Coro__State)arg; 553 LOGOP myop;
597 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
598 554
599 coro_init_stacks (aTHX); 555 Zero (&myop, 1, LOGOP);
600 /*PL_curcop = 0;*/ 556 myop.op_next = PL_op;
601 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 557 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
602 SvREFCNT_dec (GvAV (PL_defgv));
603 GvAV (PL_defgv) = ctx->args;
604 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);
605 SPAGAIN; 566 SPAGAIN;
606
607 if (ctx->stack)
608 {
609 ctx->cursp = 0;
610
611 PUSHMARK(SP);
612 PUTBACK;
613 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
614
615 if (SvTRUE (ERRSV))
616 croak (NULL);
617 else
618 croak ("FATAL: CCTXT coroutine returned!");
619 }
620 else
621 {
622 UNOP myop;
623
624 PL_op = (OP *)&myop;
625
626 Zero(&myop, 1, UNOP);
627 myop.op_next = Nullop;
628 myop.op_flags = OPf_WANT_VOID;
629
630 PUSHMARK(SP);
631 XPUSHs (sub_init);
632 /*
633 * the next line is slightly wrong, as PL_op->op_next
634 * is actually being executed so we skip the first op.
635 * that doesn't matter, though, since it is only
636 * pp_nextstate and we never return...
637 * ah yes, and I don't care anyways ;)
638 */
639 PUTBACK;
640 PL_op = pp_entersub();
641 SPAGAIN;
642
643 ENTER; /* necessary e.g. for dounwind */
644 }
645} 567}
646 568
647static void 569static void
648continue_coro (void *arg) 570coro_run (void *arg)
649{ 571{
572 /* coro_run is the alternative tail of transfer(), so unlock here. */
573 UNLOCK;
574
650 /* 575 /*
651 * this is a _very_ stripped down perl interpreter ;) 576 * this is a _very_ stripped down perl interpreter ;)
652 */ 577 */
653 Coro__State ctx = (Coro__State)arg; 578 PL_top_env = &PL_start_env;
654 579
655 /*FIXME*//* must set up top_env here */ 580 /* inject call to cctx_init */
656 ctx->cursp = 0; 581 prepare_cctx ((coro_cctx *)arg);
657 PL_op = PL_op->op_next;
658 CALLRUNOPS(aTHX);
659 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);
660 abort (); 588 abort ();
661} 589}
662 590
663STATIC 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
664transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 703transfer (struct coro *prev, struct coro *next)
665{ 704{
666 dSP;
667 dSTACKLEVEL; 705 dSTACKLEVEL;
668 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 }
669 if (prev != next) 713 else if (prev != next)
670 { 714 {
671 if (next->mainstack) 715 coro_cctx *prev__cctx;
716
717 if (prev->flags & CF_NEW)
672 { 718 {
673 SAVE (prev, flags); 719 /* create a new empty context */
674 LOAD (next); 720 Newz (0, prev->cctx, 1, coro_cctx);
675 721 prev->cctx->inuse = 1;
676 /* mark this state as in-use */ 722 prev->flags &= ~CF_NEW;
677 next->mainstack = 0; 723 prev->flags |= CF_RUNNING;
678 next->tmps_ix = -2;
679
680 /* stacklevel changed? if yes, grab the stack for us! */
681 if (flags & TRANSFER_SAVE_CCTXT)
682 {
683 if (!prev->stack)
684 allocate_stack (prev, 0);
685 else if (prev->cursp != stacklevel
686 && prev->stack->usecnt > 1)
687 {
688 prev->gencnt = ++prev->stack->gencnt;
689 prev->stack->usecnt = 1;
690 }
691
692 /* has our stack been invalidated? */
693 if (next->stack && next->stack->gencnt != next->gencnt)
694 {
695 deallocate_stack (next);
696 allocate_stack (next, 1);
697 coro_create (&(next->stack->cctx),
698 continue_coro, (void *)next,
699 next->stack->sptr, labs (next->stack->ssize));
700 }
701
702 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
703 }
704
705 } 724 }
706 else if (next->tmps_ix == -2) 725
707 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 }
708 else 749 else
709 { 750 {
710 SAVE (prev, -1); /* first get rid of the old state */ 751 /* coroutine already started */
711 752 save_perl (prev);
712 if (flags & TRANSFER_SAVE_CCTXT) 753 load_perl (next);
713 {
714 if (!prev->stack)
715 allocate_stack (prev, 0);
716
717 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
718 {
719 setup_coro (next);
720
721 prev->stack->refcnt++;
722 prev->stack->usecnt++;
723 next->stack = prev->stack;
724 next->gencnt = prev->gencnt;
725 }
726 else
727 {
728 allocate_stack (next, 1);
729 coro_create (&(next->stack->cctx),
730 setup_coro, (void *)next,
731 next->stack->sptr, labs (next->stack->ssize));
732 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
733 }
734 }
735 else
736 setup_coro (next);
737 } 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;
738 } 787 }
739
740 next->cursp = stacklevel;
741} 788}
789
790struct transfer_args
791{
792 struct coro *prev, *next;
793};
794
795#define TRANSFER(ta) transfer ((ta).prev, (ta).next)
796
797static void
798coro_state_destroy (struct coro *coro)
799{
800 if (coro->refcnt--)
801 return;
802
803 if (coro->mainstack && coro->mainstack != main_mainstack)
804 {
805 struct coro temp;
806 Zero (&temp, 1, struct coro);
807 temp.save = CORO_SAVE_ALL;
808
809 if (coro->flags & CF_RUNNING)
810 croak ("FATAL: tried to destroy currently running coroutine");
811
812 save_perl (&temp);
813 load_perl (coro);
814
815 coro_destroy_stacks ();
816
817 load_perl (&temp); /* this will get rid of defsv etc.. */
818
819 coro->mainstack = 0;
820 }
821
822 cctx_destroy (coro->cctx);
823 SvREFCNT_dec (coro->args);
824 Safefree (coro);
825}
826
827static int
828coro_state_clear (pTHX_ SV *sv, MAGIC *mg)
829{
830 struct coro *coro = (struct coro *)mg->mg_ptr;
831 mg->mg_ptr = 0;
832
833 coro_state_destroy (coro);
834
835 return 0;
836}
837
838static int
839coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
840{
841 struct coro *coro = (struct coro *)mg->mg_ptr;
842
843 ++coro->refcnt;
844
845 return 0;
846}
847
848static MGVTBL coro_state_vtbl = {
849 0, 0, 0, 0,
850 coro_state_clear,
851 0,
852#ifdef MGf_DUP
853 coro_state_dup,
854#else
855# define MGf_DUP 0
856#endif
857};
742 858
743static struct coro * 859static struct coro *
744sv_to_coro (SV *arg, const char *funcname, const char *varname) 860SvSTATE (SV *coro)
745{ 861{
746 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV) 862 HV *stash;
747 { 863 MAGIC *mg;
748 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
749 864
750 if (!he) 865 if (SvROK (coro))
751 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname); 866 coro = SvRV (coro);
752 867
753 arg = HeVAL(he); 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");
754 } 874 }
755
756 /* must also be changed inside Coro::Cont::yield */
757 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
758 return (struct coro *) SvIV((SV*)SvRV(arg));
759 else
760 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
761}
762 875
876 mg = SvMAGIC (coro);
877 assert (mg->mg_type == PERL_MAGIC_ext);
878 return (struct coro *)mg->mg_ptr;
879}
880
881static void
882prepare_transfer (struct transfer_args *ta, SV *prev_sv, SV *next_sv)
883{
884 ta->prev = SvSTATE (prev_sv);
885 ta->next = SvSTATE (next_sv);
886}
887
888static void
889api_transfer (SV *prev_sv, SV *next_sv)
890{
891 struct transfer_args ta;
892
893 prepare_transfer (&ta, prev_sv, next_sv);
894 TRANSFER (ta);
895}
896
763static void 897static int
764api_transfer(pTHX_ SV *prev, SV *next, int flags) 898api_save (SV *coro_sv, int new_save)
765{ 899{
766 transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"), 900 struct coro *coro = SvSTATE (coro_sv);
767 sv_to_coro (next, "Coro::transfer", "next"), 901 int old_save = coro->save;
768 flags); 902
903 if (new_save >= 0)
904 coro->save = new_save;
905
906 return old_save;
769} 907}
770 908
771/** Coro ********************************************************************/ 909/** Coro ********************************************************************/
772 910
773#define PRIO_MAX 3 911#define PRIO_MAX 3
776#define PRIO_LOW -1 914#define PRIO_LOW -1
777#define PRIO_IDLE -3 915#define PRIO_IDLE -3
778#define PRIO_MIN -4 916#define PRIO_MIN -4
779 917
780/* for Coro.pm */ 918/* for Coro.pm */
781static GV *coro_current, *coro_idle; 919static SV *coro_current;
782static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 920static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
783static int coro_nready; 921static int coro_nready;
784 922
785static void 923static void
786coro_enq (SV *sv) 924coro_enq (SV *coro_sv)
787{ 925{
788 if (SvROK (sv)) 926 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
789 {
790 SV *hv = SvRV (sv);
791 if (SvTYPE (hv) == SVt_PVHV)
792 {
793 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
794 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
795
796 prio = prio > PRIO_MAX ? PRIO_MAX
797 : prio < PRIO_MIN ? PRIO_MIN
798 : prio;
799
800 av_push (coro_ready [prio - PRIO_MIN], sv);
801 coro_nready++; 927 coro_nready++;
802
803 return;
804 }
805 }
806
807 croak ("Coro::ready tried to enqueue something that is not a coroutine");
808} 928}
809 929
810static SV * 930static SV *
811coro_deq (int min_prio) 931coro_deq (int min_prio)
812{ 932{
815 min_prio -= PRIO_MIN; 935 min_prio -= PRIO_MIN;
816 if (min_prio < 0) 936 if (min_prio < 0)
817 min_prio = 0; 937 min_prio = 0;
818 938
819 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 939 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
820 if (av_len (coro_ready[prio]) >= 0) 940 if (AvFILLp (coro_ready [prio]) >= 0)
821 { 941 {
822 coro_nready--; 942 coro_nready--;
823 return av_shift (coro_ready[prio]); 943 return av_shift (coro_ready [prio]);
824 } 944 }
825 945
826 return 0; 946 return 0;
827} 947}
828 948
829static void 949static int
830api_ready (SV *coro) 950api_ready (SV *coro_sv)
831{ 951{
952 struct coro *coro;
953
954 if (SvROK (coro_sv))
955 coro_sv = SvRV (coro_sv);
956
957 coro = SvSTATE (coro_sv);
958
959 if (coro->flags & CF_READY)
960 return 0;
961
962#if 0 /* this is actually harmless */
963 if (coro->flags & CF_RUNNING)
964 croak ("Coro::ready called on currently running coroutine");
965#endif
966
967 coro->flags |= CF_READY;
968
969 LOCK;
832 coro_enq (SvREFCNT_inc (coro)); 970 coro_enq (SvREFCNT_inc (coro_sv));
833} 971 UNLOCK;
834 972
973 return 1;
974}
975
835static void 976static int
836api_schedule (int cede) 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)
837{ 984{
838 SV *prev, *next; 985 SV *prev, *next;
839 986
840 prev = GvSV (coro_current); 987 for (;;)
841 988 {
842 if (cede) 989 LOCK;
843 coro_enq (SvREFCNT_inc (prev));
844
845 next = coro_deq (PRIO_MIN); 990 next = coro_deq (PRIO_MIN);
991 UNLOCK;
846 992
847 if (!next) 993 if (next)
848 next = SvREFCNT_inc (GvSV (coro_idle)); 994 break;
849 995
850 GvSV (coro_current) = SvREFCNT_inc (next); 996 {
851 transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"), 997 dSP;
852 sv_to_coro (next, "Coro::schedule", "next coroutine"), 998
853 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 999 ENTER;
854 SvREFCNT_dec (next); 1000 SAVETMPS;
855 SvREFCNT_dec (prev); 1001
1002 PUSHMARK (SP);
1003 PUTBACK;
1004 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1005
1006 FREETMPS;
1007 LEAVE;
1008 }
1009 }
1010
1011 prev = SvRV (coro_current);
1012 SvRV_set (coro_current, next);
1013
1014 /* free this only after the transfer */
1015 LOCK;
1016 free_coro_mortal ();
1017 UNLOCK;
1018 coro_mortal = prev;
1019
1020 assert (!SvROK(prev));//D
1021 assert (!SvROK(next));//D
1022
1023 ta->prev = SvSTATE (prev);
1024 ta->next = SvSTATE (next);
1025
1026 assert (ta->next->flags & CF_READY);
1027 ta->next->flags &= ~CF_READY;
1028}
1029
1030static void
1031prepare_cede (struct transfer_args *ta)
1032{
1033 api_ready (coro_current);
1034
1035 prepare_schedule (ta);
1036}
1037
1038static void
1039api_schedule (void)
1040{
1041 struct transfer_args ta;
1042
1043 prepare_schedule (&ta);
1044 TRANSFER (ta);
1045}
1046
1047static void
1048api_cede (void)
1049{
1050 struct transfer_args ta;
1051
1052 prepare_cede (&ta);
1053 TRANSFER (ta);
856} 1054}
857 1055
858MODULE = Coro::State PACKAGE = Coro::State 1056MODULE = Coro::State PACKAGE = Coro::State
859 1057
860PROTOTYPES: ENABLE 1058PROTOTYPES: DISABLE
861 1059
862BOOT: 1060BOOT:
863{ /* {} necessary for stoopid perl-5.6.x */ 1061{
864 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1062#ifdef USE_ITHREADS
865 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1063 MUTEX_INIT (&coro_mutex);
1064#endif
1065 BOOT_PAGESIZE;
1066
866 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1067 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
867 1068
868 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1069 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
869 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1070 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
870 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));
871 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1073 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
872
873 if (!padlist_cache)
874 padlist_cache = newHV ();
875 1074
876 main_mainstack = PL_mainstack; 1075 main_mainstack = PL_mainstack;
877 1076
878 {
879 SV *sv = perl_get_sv("Coro::API", 1);
880
881 coroapi.ver = CORO_API_VERSION - 1; 1077 coroapi.ver = CORO_API_VERSION;
882 coroapi.transfer = api_transfer; 1078 coroapi.transfer = api_transfer;
883 coroapi.schedule = api_schedule;
884 coroapi.ready = api_ready;
885 coroapi.nready = &coro_nready;
886 1079
887 GCoroAPI = &coroapi; 1080 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
888 sv_setiv(sv, (IV)&coroapi);
889 SvREADONLY_on(sv);
890 }
891} 1081}
892 1082
893Coro::State 1083SV *
894_newprocess(args) 1084new (char *klass, ...)
895 SV * args
896 PROTOTYPE: $
897 CODE: 1085 CODE:
898 Coro__State coro; 1086{
1087 struct coro *coro;
1088 HV *hv;
1089 int i;
899 1090
900 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
901 croak ("Coro::State::_newprocess expects an arrayref");
902
903 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;
904 1095
905 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1096 hv = newHV ();
906 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;
907 coro->stack = 0; 1098 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
908 1099
909 RETVAL = coro; 1100 for (i = 1; i < items; i++)
1101 av_push (coro->args, newSVsv (ST (i)));
1102}
910 OUTPUT: 1103 OUTPUT:
911 RETVAL 1104 RETVAL
912 1105
1106int
1107save (SV *coro, int new_save = -1)
1108 CODE:
1109 RETVAL = api_save (coro, new_save);
1110 OUTPUT:
1111 RETVAL
1112
913void 1113void
914transfer(prev, next, flags) 1114_set_stacklevel (...)
915 Coro::State_or_hashref prev 1115 ALIAS:
916 Coro::State_or_hashref next 1116 Coro::State::transfer = 1
917 int flags 1117 Coro::schedule = 2
918 PROTOTYPE: @ 1118 Coro::cede = 3
919 CODE: 1119 CODE:
920 PUTBACK; 1120{
921 transfer (aTHX_ prev, next, flags); 1121 struct transfer_args ta;
922 SPAGAIN; 1122
1123 switch (ix)
1124 {
1125 case 0:
1126 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1127 ta.next = 0;
1128 break;
1129
1130 case 1:
1131 if (items != 2)
1132 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1133
1134 prepare_transfer (&ta, ST (0), ST (1));
1135 break;
1136
1137 case 2:
1138 prepare_schedule (&ta);
1139 break;
1140
1141 case 3:
1142 prepare_cede (&ta);
1143 break;
1144 }
1145
1146 TRANSFER (ta);
1147}
923 1148
924void 1149void
925DESTROY(coro) 1150_clone_state_from (SV *dst, SV *src)
926 Coro::State coro 1151 CODE:
927 CODE: 1152{
1153 struct coro *coro_src = SvSTATE (src);
928 1154
929 if (coro->mainstack && coro->mainstack != main_mainstack) 1155 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
930 {
931 struct coro temp;
932 1156
933 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1157 ++coro_src->refcnt;
934 LOAD(aTHX_ coro); 1158 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
935 1159}
936 destroy_stacks (aTHX);
937
938 LOAD((&temp)); /* this will get rid of defsv etc.. */
939
940 coro->mainstack = 0;
941 }
942
943 deallocate_stack (coro);
944
945 Safefree (coro);
946 1160
947void 1161void
948flush()
949 CODE:
950#ifdef MAY_FLUSH
951 flush_padlist_cache ();
952#endif
953
954void
955_exit(code) 1162_exit (code)
956 int code 1163 int code
957 PROTOTYPE: $ 1164 PROTOTYPE: $
958 CODE: 1165 CODE:
959#if defined(__GLIBC__) || _POSIX_C_SOURCE
960 _exit (code); 1166 _exit (code);
961#else
962 signal (SIGTERM, SIG_DFL);
963 raise (SIGTERM);
964 exit (code);
965#endif
966 1167
967MODULE = Coro::State PACKAGE = Coro::Cont 1168int
1169cctx_count ()
1170 CODE:
1171 RETVAL = cctx_count;
1172 OUTPUT:
1173 RETVAL
968 1174
969# this is slightly dirty (should expose a c-level api) 1175int
970 1176cctx_idle ()
971void 1177 CODE:
972yield(...) 1178 RETVAL = cctx_idle;
973 PROTOTYPE: @ 1179 OUTPUT:
974 CODE: 1180 RETVAL
975 static SV *returnstk;
976 SV *sv;
977 AV *defav = GvAV (PL_defgv);
978 struct coro *prev, *next;
979
980 if (!returnstk)
981 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
982
983 /* set up @_ -- ugly */
984 av_clear (defav);
985 av_fill (defav, items - 1);
986 while (items--)
987 av_store (defav, items, SvREFCNT_inc (ST(items)));
988
989 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
990 sv = av_pop ((AV *)SvRV (returnstk));
991 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
992 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
993 SvREFCNT_dec (sv);
994
995 transfer(aTHX_ prev, next, 0);
996 1181
997MODULE = Coro::State PACKAGE = Coro 1182MODULE = Coro::State PACKAGE = Coro
998 1183
999# this is slightly dirty (should expose a c-level api)
1000
1001BOOT: 1184BOOT:
1002{ 1185{
1003 int i; 1186 int i;
1187
1004 HV *stash = gv_stashpv ("Coro", TRUE); 1188 coro_stash = gv_stashpv ("Coro", TRUE);
1005 1189
1006 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1190 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1007 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1191 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1008 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1192 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1009 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1193 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1010 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1194 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1011 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1195 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1012 1196
1013 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1197 coro_current = get_sv ("Coro::current", FALSE);
1014 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1198 SvREADONLY_on (coro_current);
1015 1199
1016 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1200 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1017 coro_ready[i] = newAV (); 1201 coro_ready[i] = newAV ();
1202
1203 {
1204 SV *sv = perl_get_sv("Coro::API", 1);
1205
1206 coroapi.schedule = api_schedule;
1207 coroapi.save = api_save;
1208 coroapi.cede = api_cede;
1209 coroapi.ready = api_ready;
1210 coroapi.is_ready = api_is_ready;
1211 coroapi.nready = &coro_nready;
1212 coroapi.current = coro_current;
1213
1214 GCoroAPI = &coroapi;
1215 sv_setiv (sv, (IV)&coroapi);
1216 SvREADONLY_on (sv);
1217 }
1018} 1218}
1019 1219
1020void 1220void
1021ready(self) 1221_set_current (SV *current)
1022 SV * self 1222 PROTOTYPE: $
1023 CODE: 1223 CODE:
1024 api_ready (self); 1224 SvREFCNT_dec (SvRV (coro_current));
1225 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1025 1226
1026int 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
1027nready(...) 1264nready (...)
1028 PROTOTYPE: 1265 PROTOTYPE:
1029 CODE: 1266 CODE:
1030 RETVAL = coro_nready; 1267 RETVAL = coro_nready;
1031 OUTPUT: 1268 OUTPUT:
1032 RETVAL 1269 RETVAL
1033 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
1034void 1292void
1035schedule(...) 1293_set_state (char *data_)
1036 PROTOTYPE: 1294 PROTOTYPE: $
1037 ALIAS:
1038 cede = 1
1039 CODE: 1295 CODE:
1040 api_schedule (ix); 1296{
1297 struct io_state *data = (void *)data_;
1041 1298
1299 errno = data->errorno;
1300 PL_laststype = data->laststype;
1301 PL_laststatval = data->laststatval;
1302 PL_statcache = data->statcache;
1303}
1304

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines