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.99 by root, Sun Nov 26 23:53:20 2006 UTC vs.
Revision 1.139 by root, Sun Jan 14 21:13:41 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines