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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines