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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines