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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines