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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines