ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.16 by root, Wed Jul 25 04:26:55 2001 UTC vs.
Revision 1.123 by root, Mon Dec 4 21:56:00 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines