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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines