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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines