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

Diff Legend

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