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.102 by root, Mon Nov 27 01:28:03 2006 UTC vs.
Revision 1.143 by root, Wed Feb 28 11:43:03 2007 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines