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.22 by root, Sat Aug 11 23:10:56 2001 UTC vs.
Revision 1.60 by root, Mon Aug 9 02:41:27 2004 UTC

1#define PERL_NO_GET_CONTEXT
2
1#include "EXTERN.h" 3#include "EXTERN.h"
2#include "perl.h" 4#include "perl.h"
3#include "XSUB.h" 5#include "XSUB.h"
4 6
7#include "patchlevel.h"
8
9#if PATCHLEVEL < 6
10# ifndef PL_ppaddr
11# define PL_ppaddr ppaddr
12# endif
13# ifndef call_sv
14# define call_sv perl_call_sv
15# endif
16# ifndef get_sv
17# define get_sv perl_get_sv
18# endif
19# ifndef get_cv
20# define get_cv perl_get_cv
21# endif
22# ifndef IS_PADGV
23# define IS_PADGV(v) 0
24# endif
25# ifndef IS_PADCONST
26# define IS_PADCONST(v) 0
27# endif
28#endif
29
5#include "libcoro/coro.c" 30#include "libcoro/coro.c"
6 31
7#include <signal.h> 32#include <signal.h>
8 33
9#ifdef HAVE_MMAP 34#ifdef HAVE_MMAP
10# include <unistd.h> 35# include <unistd.h>
11# include <sys/mman.h> 36# include <sys/mman.h>
12# ifndef MAP_ANON
13# ifdef MAP_ANONYMOUS 37# ifndef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS 38# ifdef MAP_ANON
39# define MAP_ANONYMOUS MAP_ANON
15# else 40# else
16# undef HAVE_MMAP 41# undef HAVE_MMAP
17# endif 42# endif
18# endif 43# endif
19#endif 44#endif
20 45
21#define MAY_FLUSH /* increases codesize */
22
23/* perl-related */
24#define TRANSFER_SAVE_DEFAV 0x00000001
25#define TRANSFER_SAVE_DEFSV 0x00000002
26#define TRANSFER_SAVE_ERRSV 0x00000004
27/* c-related */
28#define TRANSFER_SAVE_CCTXT 0x00000008
29#ifdef CORO_LAZY_STACK
30# define TRANSFER_LAZY_STACK 0x00000010
31#else
32# define TRANSFER_LAZY_STACK 0x00000000
33#endif
34
35#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \
36 |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT)
37
38#define SUB_INIT "Coro::State::initialize" 46#define SUB_INIT "Coro::State::initialize"
39#define UCORO_STATE "_coro_state" 47#define UCORO_STATE "_coro_state"
40 48
41/* The next macro should delcare a variable stacklevel that contains and approximation 49/* The next macro should declare a variable stacklevel that contains and approximation
42 * to the current C stack pointer. It's property is that it changes with each call 50 * to the current C stack pointer. Its property is that it changes with each call
43 * and should be unique. */ 51 * and should be unique. */
44#define dSTACKLEVEL void *stacklevel = &stacklevel 52#define dSTACKLEVEL void *stacklevel = &stacklevel
45 53
54#define IN_DESTRUCT (PL_main_cv == Nullcv)
55
46#define labs(l) ((l) >= 0 ? (l) : -(l)) 56#define labs(l) ((l) >= 0 ? (l) : -(l))
57
58#include "CoroAPI.h"
59
60#ifdef USE_ITHREADS
61static perl_mutex coro_mutex;
62# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
63# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
64#else
65# define LOCK 0
66# define UNLOCK 0
67#endif
68
69static struct CoroAPI coroapi;
70static AV *main_mainstack; /* used to differentiate between $main and others */
71static HV *coro_state_stash;
72static SV *ucoro_state_sv;
73static U32 ucoro_state_hash;
74static SV *coro_mortal; /* will be freed after next transfer */
47 75
48/* this is actually not only the c stack but also c registers etc... */ 76/* this is actually not only the c stack but also c registers etc... */
49typedef struct { 77typedef struct {
50 int refcnt; /* pointer reference counter */ 78 int refcnt; /* pointer reference counter */
51 int usecnt; /* shared by how many coroutines */ 79 int usecnt; /* shared by how many coroutines */
56 void *sptr; 84 void *sptr;
57 long ssize; /* positive == mmap, otherwise malloc */ 85 long ssize; /* positive == mmap, otherwise malloc */
58} coro_stack; 86} coro_stack;
59 87
60struct coro { 88struct coro {
89 /* the top-level JMPENV for each coroutine, needed to catch dies. */
90 JMPENV start_env;
91
61 /* the optional C context */ 92 /* the optional C context */
62 coro_stack *stack; 93 coro_stack *stack;
63 void *cursp; 94 void *cursp;
64 int gencnt; 95 int gencnt;
65 96
77 AV *curstack; 108 AV *curstack;
78 AV *mainstack; 109 AV *mainstack;
79 SV **stack_sp; 110 SV **stack_sp;
80 OP *op; 111 OP *op;
81 SV **curpad; 112 SV **curpad;
113 AV *comppad;
82 SV **stack_base; 114 SV **stack_base;
83 SV **stack_max; 115 SV **stack_max;
84 SV **tmps_stack; 116 SV **tmps_stack;
85 I32 tmps_floor; 117 I32 tmps_floor;
86 I32 tmps_ix; 118 I32 tmps_ix;
105}; 137};
106 138
107typedef struct coro *Coro__State; 139typedef struct coro *Coro__State;
108typedef struct coro *Coro__State_or_hashref; 140typedef struct coro *Coro__State_or_hashref;
109 141
110static AV *main_mainstack; /* used to differentiate between $main and others */
111static HV *coro_state_stash;
112static SV *ucoro_state_sv;
113static U32 ucoro_state_hash;
114static HV *padlist_cache;
115
116/* mostly copied from op.c:cv_clone2 */ 142/* mostly copied from op.c:cv_clone2 */
117STATIC AV * 143STATIC AV *
118clone_padlist (AV *protopadlist) 144clone_padlist (pTHX_ AV *protopadlist)
119{ 145{
120 AV *av; 146 AV *av;
121 I32 ix; 147 I32 ix;
122 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); 148 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
123 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); 149 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
147 AvFLAGS (av) = AVf_REIFY; 173 AvFLAGS (av) = AVf_REIFY;
148 174
149 for (ix = fpad; ix > 0; ix--) 175 for (ix = fpad; ix > 0; ix--)
150 { 176 {
151 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; 177 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
178
152 if (namesv && namesv != &PL_sv_undef) 179 if (namesv && namesv != &PL_sv_undef)
153 { 180 {
154 char *name = SvPVX (namesv); /* XXX */ 181 char *name = SvPVX (namesv); /* XXX */
182
155 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') 183 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
156 { /* lexical from outside? */ 184 { /* lexical from outside? */
157 npad[ix] = SvREFCNT_inc (ppad[ix]); 185 npad[ix] = SvREFCNT_inc (ppad[ix]);
158 } 186 }
159 else 187 else
165 sv = (SV *) newAV (); 193 sv = (SV *) newAV ();
166 else if (*name == '%') 194 else if (*name == '%')
167 sv = (SV *) newHV (); 195 sv = (SV *) newHV ();
168 else 196 else
169 sv = NEWSV (0, 0); 197 sv = NEWSV (0, 0);
198
199#ifdef SvPADBUSY
170 if (!SvPADBUSY (sv)) 200 if (!SvPADBUSY (sv))
201#endif
171 SvPADMY_on (sv); 202 SvPADMY_on (sv);
203
172 npad[ix] = sv; 204 npad[ix] = sv;
173 } 205 }
174 } 206 }
175 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) 207 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
176 { 208 {
205#endif 237#endif
206 238
207 return newpadlist; 239 return newpadlist;
208} 240}
209 241
210#ifdef MAY_FLUSH 242STATIC void
211STATIC AV *
212free_padlist (AV *padlist) 243free_padlist (pTHX_ AV *padlist)
213{ 244{
214 /* may be during global destruction */ 245 /* may be during global destruction */
215 if (SvREFCNT(padlist)) 246 if (SvREFCNT (padlist))
216 { 247 {
217 I32 i = AvFILLp(padlist); 248 I32 i = AvFILLp (padlist);
218 while (i >= 0) 249 while (i >= 0)
219 { 250 {
220 SV **svp = av_fetch(padlist, i--, FALSE); 251 SV **svp = av_fetch (padlist, i--, FALSE);
221 SV *sv = svp ? *svp : Nullsv;
222 if (sv) 252 if (svp)
253 {
254 SV *sv;
255 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
223 SvREFCNT_dec(sv); 256 SvREFCNT_dec (sv);
257
258 SvREFCNT_dec (*svp);
259 }
224 } 260 }
225 261
226 SvREFCNT_dec((SV*)padlist); 262 SvREFCNT_dec ((SV*)padlist);
227 } 263 }
228} 264}
229#endif 265
266STATIC int
267coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
268{
269 AV *padlist;
270 AV *av = (AV *)mg->mg_obj;
271
272 /* casting is fun. */
273 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
274 free_padlist (aTHX_ padlist);
275}
276
277#define PERL_MAGIC_coro PERL_MAGIC_ext
278
279static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
230 280
231/* the next two functions merely cache the padlists */ 281/* the next two functions merely cache the padlists */
232STATIC void 282STATIC void
233get_padlist (CV *cv) 283get_padlist (pTHX_ CV *cv)
234{ 284{
235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); 285 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
236 286
237 if (he && AvFILLp ((AV *)*he) >= 0) 287 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
238 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); 288 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
239 else 289 else
240 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); 290 CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv));
241} 291}
242 292
243STATIC void 293STATIC void
244put_padlist (CV *cv) 294put_padlist (pTHX_ CV *cv)
245{ 295{
246 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); 296 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
247 297
248 if (SvTYPE (*he) != SVt_PVAV) 298 if (!mg)
249 { 299 {
250 SvREFCNT_dec (*he); 300 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
301 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
302 mg->mg_virtual = &vtbl_coro;
251 *he = (SV *)newAV (); 303 mg->mg_obj = (SV *)newAV ();
252 } 304 }
253 305
254 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 306 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
255} 307}
256
257#ifdef MAY_FLUSH
258STATIC void
259flush_padlist_cache ()
260{
261 HV *hv = padlist_cache;
262 padlist_cache = newHV ();
263
264 if (hv_iterinit (hv))
265 {
266 HE *he;
267 AV *padlist;
268
269 while (!!(he = hv_iternext (hv)))
270 {
271 AV *av = (AV *)HeVAL(he);
272
273 /* casting is fun. */
274 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
275 free_padlist (padlist);
276 }
277 }
278
279 SvREFCNT_dec (hv);
280}
281#endif
282 308
283#define SB do { 309#define SB do {
284#define SE } while (0) 310#define SE } while (0)
285 311
286#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE 312#define LOAD(state) load_state(aTHX_ (state));
287#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE 313#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
288 314
289#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE 315#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
290 316
291static void 317static void
292load_state(pTHX_ Coro__State c) 318load_state(pTHX_ Coro__State c)
293{ 319{
294 PL_dowarn = c->dowarn; 320 PL_dowarn = c->dowarn;
298 PL_curstack = c->curstack; 324 PL_curstack = c->curstack;
299 PL_mainstack = c->mainstack; 325 PL_mainstack = c->mainstack;
300 PL_stack_sp = c->stack_sp; 326 PL_stack_sp = c->stack_sp;
301 PL_op = c->op; 327 PL_op = c->op;
302 PL_curpad = c->curpad; 328 PL_curpad = c->curpad;
329 PL_comppad = c->comppad;
303 PL_stack_base = c->stack_base; 330 PL_stack_base = c->stack_base;
304 PL_stack_max = c->stack_max; 331 PL_stack_max = c->stack_max;
305 PL_tmps_stack = c->tmps_stack; 332 PL_tmps_stack = c->tmps_stack;
306 PL_tmps_floor = c->tmps_floor; 333 PL_tmps_floor = c->tmps_floor;
307 PL_tmps_ix = c->tmps_ix; 334 PL_tmps_ix = c->tmps_ix;
334 { 361 {
335 AV *padlist = (AV *)POPs; 362 AV *padlist = (AV *)POPs;
336 363
337 if (padlist) 364 if (padlist)
338 { 365 {
339 put_padlist (cv); /* mark this padlist as available */ 366 put_padlist (aTHX_ cv); /* mark this padlist as available */
340 CvPADLIST(cv) = padlist; 367 CvPADLIST(cv) = padlist;
341#ifdef USE_THREADS
342 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
343#endif
344 } 368 }
345 369
346 ++CvDEPTH(cv); 370 ++CvDEPTH(cv);
347 } 371 }
348 372
366 390
367 PUSHs (Nullsv); 391 PUSHs (Nullsv);
368 /* this loop was inspired by pp_caller */ 392 /* this loop was inspired by pp_caller */
369 for (;;) 393 for (;;)
370 { 394 {
371 do 395 while (cxix >= 0)
372 { 396 {
373 PERL_CONTEXT *cx = &ccstk[cxix--]; 397 PERL_CONTEXT *cx = &ccstk[cxix--];
374 398
375 if (CxTYPE(cx) == CXt_SUB) 399 if (CxTYPE(cx) == CXt_SUB)
376 { 400 {
377 CV *cv = cx->blk_sub.cv; 401 CV *cv = cx->blk_sub.cv;
378 if (CvDEPTH(cv)) 402 if (CvDEPTH(cv))
379 { 403 {
380#ifdef USE_THREADS
381 /*XPUSHs ((SV *)CvOWNER(cv));*/
382 /*CvOWNER(cv) = 0;*/
383 /*error must unlock this cv etc.. etc...*/
384#endif
385 EXTEND (SP, CvDEPTH(cv)*2); 404 EXTEND (SP, CvDEPTH(cv)*2);
386 405
387 while (--CvDEPTH(cv)) 406 while (--CvDEPTH(cv))
388 { 407 {
389 /* this tells the restore code to increment CvDEPTH */ 408 /* this tells the restore code to increment CvDEPTH */
392 } 411 }
393 412
394 PUSHs ((SV *)CvPADLIST(cv)); 413 PUSHs ((SV *)CvPADLIST(cv));
395 PUSHs ((SV *)cv); 414 PUSHs ((SV *)cv);
396 415
397 get_padlist (cv); /* this is a monster */ 416 get_padlist (aTHX_ cv); /* this is a monster */
398 } 417 }
399 } 418 }
419#ifdef CXt_FORMAT
400 else if (CxTYPE(cx) == CXt_FORMAT) 420 else if (CxTYPE(cx) == CXt_FORMAT)
401 { 421 {
402 /* I never used formats, so how should I know how these are implemented? */ 422 /* I never used formats, so how should I know how these are implemented? */
403 /* my bold guess is as a simple, plain sub... */ 423 /* my bold guess is as a simple, plain sub... */
404 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); 424 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
405 } 425 }
426#endif
406 } 427 }
407 while (cxix >= 0);
408 428
409 if (top_si->si_type == PERLSI_MAIN) 429 if (top_si->si_type == PERLSI_MAIN)
410 break; 430 break;
411 431
412 top_si = top_si->si_prev; 432 top_si = top_si->si_prev;
418 } 438 }
419 439
420 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; 440 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
421 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 441 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
422 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; 442 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
423
424 /* I have not the slightest idea of why av_reify is necessary */
425 /* but if it's missing the defav contents magically get replaced sometimes */
426 if (c->defav)
427 av_reify (c->defav);
428 443
429 c->dowarn = PL_dowarn; 444 c->dowarn = PL_dowarn;
430 c->in_eval = PL_in_eval; 445 c->in_eval = PL_in_eval;
431 446
432 c->curstackinfo = PL_curstackinfo; 447 c->curstackinfo = PL_curstackinfo;
433 c->curstack = PL_curstack; 448 c->curstack = PL_curstack;
434 c->mainstack = PL_mainstack; 449 c->mainstack = PL_mainstack;
435 c->stack_sp = PL_stack_sp; 450 c->stack_sp = PL_stack_sp;
436 c->op = PL_op; 451 c->op = PL_op;
437 c->curpad = PL_curpad; 452 c->curpad = PL_curpad;
453 c->comppad = PL_comppad;
438 c->stack_base = PL_stack_base; 454 c->stack_base = PL_stack_base;
439 c->stack_max = PL_stack_max; 455 c->stack_max = PL_stack_max;
440 c->tmps_stack = PL_tmps_stack; 456 c->tmps_stack = PL_tmps_stack;
441 c->tmps_floor = PL_tmps_floor; 457 c->tmps_floor = PL_tmps_floor;
442 c->tmps_ix = PL_tmps_ix; 458 c->tmps_ix = PL_tmps_ix;
458} 474}
459 475
460/* 476/*
461 * allocate various perl stacks. This is an exact copy 477 * allocate various perl stacks. This is an exact copy
462 * of perl.c:init_stacks, except that it uses less memory 478 * of perl.c:init_stacks, except that it uses less memory
463 * on the assumption that coroutines do not usually need 479 * on the (sometimes correct) assumption that coroutines do
464 * a lot of stackspace. 480 * not usually need a lot of stackspace.
465 */ 481 */
466STATIC void 482STATIC void
467coro_init_stacks (pTHX) 483coro_init_stacks (pTHX)
468{ 484{
485 LOCK;
486
469 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 487 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
470 PL_curstackinfo->si_type = PERLSI_MAIN; 488 PL_curstackinfo->si_type = PERLSI_MAIN;
471 PL_curstack = PL_curstackinfo->si_stack; 489 PL_curstack = PL_curstackinfo->si_stack;
472 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 490 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
473 491
482 500
483 New(54,PL_markstack,16,I32); 501 New(54,PL_markstack,16,I32);
484 PL_markstack_ptr = PL_markstack; 502 PL_markstack_ptr = PL_markstack;
485 PL_markstack_max = PL_markstack + 16; 503 PL_markstack_max = PL_markstack + 16;
486 504
505#ifdef SET_MARK_OFFSET
487 SET_MARK_OFFSET; 506 SET_MARK_OFFSET;
507#endif
488 508
489 New(54,PL_scopestack,16,I32); 509 New(54,PL_scopestack,16,I32);
490 PL_scopestack_ix = 0; 510 PL_scopestack_ix = 0;
491 PL_scopestack_max = 16; 511 PL_scopestack_max = 16;
492 512
495 PL_savestack_max = 96; 515 PL_savestack_max = 96;
496 516
497 New(54,PL_retstack,8,OP*); 517 New(54,PL_retstack,8,OP*);
498 PL_retstack_ix = 0; 518 PL_retstack_ix = 0;
499 PL_retstack_max = 8; 519 PL_retstack_max = 8;
520
521 UNLOCK;
500} 522}
501 523
502/* 524/*
503 * destroy the stacks, the callchain etc... 525 * destroy the stacks, the callchain etc...
504 * still there is a memleak of 128 bytes...
505 */ 526 */
506STATIC void 527STATIC void
507destroy_stacks(pTHX) 528destroy_stacks(pTHX)
508{ 529{
530 if (!IN_DESTRUCT)
531 {
509 /* is this ugly, I ask? */ 532 /* is this ugly, I ask? */
510 while (PL_scopestack_ix) 533 LEAVE_SCOPE (0);
511 LEAVE;
512 534
513 /* sure it is, but more important: is it correct?? :/ */ 535 /* sure it is, but more important: is it correct?? :/ */
514 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
515 FREETMPS; 536 FREETMPS;
537
538 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
539 }
516 540
517 while (PL_curstackinfo->si_next) 541 while (PL_curstackinfo->si_next)
518 PL_curstackinfo = PL_curstackinfo->si_next; 542 PL_curstackinfo = PL_curstackinfo->si_next;
519 543
520 while (PL_curstackinfo) 544 while (PL_curstackinfo)
521 { 545 {
522 PERL_SI *p = PL_curstackinfo->si_prev; 546 PERL_SI *p = PL_curstackinfo->si_prev;
523 547
524 { 548 { /*D*//*remove*/
525 dSP; 549 dSP;
526 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); 550 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
527 PUTBACK; /* possibly superfluous */ 551 PUTBACK; /* possibly superfluous */
528 } 552 }
529 553
530 dounwind(-1); 554 if (!IN_DESTRUCT)
531 555 {
556 dounwind (-1);/*D*//*remove*/
532 SvREFCNT_dec(PL_curstackinfo->si_stack); 557 SvREFCNT_dec (PL_curstackinfo->si_stack);
558 }
559
533 Safefree(PL_curstackinfo->si_cxstack); 560 Safefree (PL_curstackinfo->si_cxstack);
534 Safefree(PL_curstackinfo); 561 Safefree (PL_curstackinfo);
535 PL_curstackinfo = p; 562 PL_curstackinfo = p;
536 } 563 }
537 564
538 Safefree(PL_tmps_stack); 565 Safefree (PL_tmps_stack);
539 Safefree(PL_markstack); 566 Safefree (PL_markstack);
540 Safefree(PL_scopestack); 567 Safefree (PL_scopestack);
541 Safefree(PL_savestack); 568 Safefree (PL_savestack);
542 Safefree(PL_retstack); 569 Safefree (PL_retstack);
543} 570}
544 571
545static void 572static void
546allocate_stack (Coro__State ctx, int alloc) 573allocate_stack (Coro__State ctx, int alloc)
547{ 574{
550 New (0, stack, 1, coro_stack); 577 New (0, stack, 1, coro_stack);
551 578
552 stack->refcnt = 1; 579 stack->refcnt = 1;
553 stack->usecnt = 1; 580 stack->usecnt = 1;
554 stack->gencnt = ctx->gencnt = 0; 581 stack->gencnt = ctx->gencnt = 0;
582
555 if (alloc) 583 if (alloc)
556 { 584 {
557#ifdef HAVE_MMAP 585#if HAVE_MMAP
558 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ 586 stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */
559 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); 587 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
560 if (stack->sptr == (void *)-1) 588 if (stack->sptr == (void *)-1)
561#endif 589#endif
562 { 590 {
563 /*FIXME*//*D*//* reasonable stack size! */ 591 /*FIXME*//*D*//* reasonable stack size! */
564 stack->ssize = -4096 * sizeof (long); 592 stack->ssize = - (8192 * sizeof (long));
565 New (0, stack->sptr, 4096, long); 593 New (0, stack->sptr, 8192, long);
566 } 594 }
567 } 595 }
568 else 596 else
569 stack->sptr = 0; 597 stack->sptr = 0;
570 598
584 { 612 {
585#ifdef HAVE_MMAP 613#ifdef HAVE_MMAP
586 if (stack->ssize > 0 && stack->sptr) 614 if (stack->ssize > 0 && stack->sptr)
587 munmap (stack->sptr, stack->ssize); 615 munmap (stack->sptr, stack->ssize);
588 else 616 else
589#else 617#endif
590 Safefree (stack->sptr); 618 Safefree (stack->sptr);
591#endif 619
592 Safefree (stack); 620 Safefree (stack);
593 } 621 }
594 else if (ctx->gencnt == stack->gencnt) 622 else if (ctx->gencnt == stack->gencnt)
595 --stack->usecnt; 623 --stack->usecnt;
596 } 624 }
600setup_coro (void *arg) 628setup_coro (void *arg)
601{ 629{
602 /* 630 /*
603 * emulate part of the perl startup here. 631 * emulate part of the perl startup here.
604 */ 632 */
633 dTHX;
605 dSP; 634 dSP;
606 Coro__State ctx = (Coro__State)arg; 635 Coro__State ctx = (Coro__State)arg;
607 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); 636 SV *sub_init = (SV *)get_cv (SUB_INIT, FALSE);
608 637
609 coro_init_stacks (aTHX); 638 coro_init_stacks (aTHX);
610 /*PL_curcop = 0;*/ 639 /*PL_curcop = 0;*/
611 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 640 /*PL_in_eval = PL_in_eval;*/ /* inherit */
612 SvREFCNT_dec (GvAV (PL_defgv)); 641 SvREFCNT_dec (GvAV (PL_defgv));
613 GvAV (PL_defgv) = ctx->args; 642 GvAV (PL_defgv) = ctx->args; ctx->args = 0;
614 643
615 SPAGAIN; 644 SPAGAIN;
616 645
617 if (ctx->stack) 646 if (ctx->stack)
618 { 647 {
645 * that doesn't matter, though, since it is only 674 * that doesn't matter, though, since it is only
646 * pp_nextstate and we never return... 675 * pp_nextstate and we never return...
647 * ah yes, and I don't care anyways ;) 676 * ah yes, and I don't care anyways ;)
648 */ 677 */
649 PUTBACK; 678 PUTBACK;
650 PL_op = pp_entersub(); 679 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
651 SPAGAIN; 680 SPAGAIN;
652 681
653 ENTER; /* necessary e.g. for dounwind */ 682 ENTER; /* necessary e.g. for dounwind */
654 } 683 }
655} 684}
658continue_coro (void *arg) 687continue_coro (void *arg)
659{ 688{
660 /* 689 /*
661 * this is a _very_ stripped down perl interpreter ;) 690 * this is a _very_ stripped down perl interpreter ;)
662 */ 691 */
692 dTHX;
663 Coro__State ctx = (Coro__State)arg; 693 Coro__State ctx = (Coro__State)arg;
694 JMPENV coro_start_env;
664 695
665 /*FIXME*//* must set up top_env here */ 696 PL_top_env = &ctx->start_env;
697
666 ctx->cursp = 0; 698 ctx->cursp = 0;
667 PL_op = PL_op->op_next; 699 PL_op = PL_op->op_next;
668 CALLRUNOPS(aTHX); 700 CALLRUNOPS(aTHX);
669 701
670 abort (); 702 abort ();
671} 703}
672 704
673STATIC void 705STATIC void
674transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 706transfer (pTHX_ struct coro *prev, struct coro *next, int flags)
675{ 707{
676 dSP;
677 dSTACKLEVEL; 708 dSTACKLEVEL;
678 709
679 if (prev != next) 710 if (prev != next)
680 { 711 {
681 if (next->mainstack) 712 if (next->mainstack)
682 { 713 {
714 LOCK;
683 SAVE (prev, flags); 715 SAVE (prev, flags);
684 LOAD (next); 716 LOAD (next);
717 UNLOCK;
685 718
686 /* mark this state as in-use */ 719 /* mark this state as in-use */
687 next->mainstack = 0; 720 next->mainstack = 0;
688 next->tmps_ix = -2; 721 next->tmps_ix = -2;
689 722
708 continue_coro, (void *)next, 741 continue_coro, (void *)next,
709 next->stack->sptr, labs (next->stack->ssize)); 742 next->stack->sptr, labs (next->stack->ssize));
710 } 743 }
711 744
712 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 745 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
746 prev->cursp = stacklevel;
747 /* don't add any code here */
713 } 748 }
714 749 else
750 next->cursp = stacklevel;
715 } 751 }
716 else if (next->tmps_ix == -2) 752 else if (next->tmps_ix == -2)
717 croak ("tried to transfer to running coroutine"); 753 croak ("tried to transfer to running coroutine");
718 else 754 else
719 { 755 {
756 LOCK;
720 SAVE (prev, -1); /* first get rid of the old state */ 757 SAVE (prev, -1); /* first get rid of the old state */
758 UNLOCK;
721 759
722 if (flags & TRANSFER_SAVE_CCTXT) 760 if (flags & TRANSFER_SAVE_CCTXT)
723 { 761 {
724 if (!prev->stack) 762 if (!prev->stack)
725 allocate_stack (prev, 0); 763 allocate_stack (prev, 0);
726 764
727 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) 765 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
728 { 766 {
767 PL_top_env = &next->start_env;
768
729 setup_coro (next); 769 setup_coro (next);
770 next->cursp = stacklevel;
730 771
731 prev->stack->refcnt++; 772 prev->stack->refcnt++;
732 prev->stack->usecnt++; 773 prev->stack->usecnt++;
733 next->stack = prev->stack; 774 next->stack = prev->stack;
734 next->gencnt = prev->gencnt; 775 next->gencnt = prev->gencnt;
735 } 776 }
736 else 777 else
737 { 778 {
779 assert (!next->stack);
738 allocate_stack (next, 1); 780 allocate_stack (next, 1);
739 coro_create (&(next->stack->cctx), 781 coro_create (&(next->stack->cctx),
740 setup_coro, (void *)next, 782 setup_coro, (void *)next,
741 next->stack->sptr, labs (next->stack->ssize)); 783 next->stack->sptr, labs (next->stack->ssize));
742 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); 784 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
785 prev->cursp = stacklevel;
786 /* don't add any code here */
743 } 787 }
744 } 788 }
745 else 789 else
790 {
746 setup_coro (next); 791 setup_coro (next);
792 next->cursp = stacklevel;
793 }
747 } 794 }
748 } 795 }
749 796
750 next->cursp = stacklevel; 797 LOCK;
751} 798 if (coro_mortal)
752
753static struct coro *
754sv_to_coro (SV *arg, const char *funcname, const char *varname)
755{
756 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
757 { 799 {
800 SvREFCNT_dec (coro_mortal);
801 coro_mortal = 0;
802 }
803 UNLOCK;
804}
805
806#define SV_CORO(sv,func) \
807 do { \
808 if (SvROK (sv)) \
809 sv = SvRV (sv); \
810 \
811 if (SvTYPE (sv) == SVt_PVHV) \
812 { \
758 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash); 813 HE *he = hv_fetch_ent ((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
759 814 \
760 if (!he) 815 if (!he) \
761 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname); 816 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
762 817 \
763 arg = HeVAL(he); 818 (sv) = SvRV (HeVAL(he)); \
764 } 819 } \
765 820 \
766 /* must also be changed inside Coro::Cont::yield */ 821 /* must also be changed inside Coro::Cont::yield */ \
767 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash) 822 if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \
768 return (struct coro *) SvIV((SV*)SvRV(arg));
769 else
770 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname); 823 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
824 \
825 } while(0)
826
827#define SvSTATE(sv) (struct coro *)SvIV (sv)
828
829static void
830api_transfer(pTHX_ SV *prev, SV *next, int flags)
831{
832 SV_CORO (prev, "Coro::transfer");
833 SV_CORO (next, "Coro::transfer");
834
835 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
771} 836}
772 837
773/** Coro ********************************************************************/ 838/** Coro ********************************************************************/
774 839
775#define PRIO_MAX 3 840#define PRIO_MAX 3
780#define PRIO_MIN -4 845#define PRIO_MIN -4
781 846
782/* for Coro.pm */ 847/* for Coro.pm */
783static GV *coro_current, *coro_idle; 848static GV *coro_current, *coro_idle;
784static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 849static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
850static int coro_nready;
785 851
786static void 852static void
787coro_enq (SV *sv) 853coro_enq (pTHX_ SV *sv)
788{ 854{
789 if (SvROK (sv)) 855 if (SvTYPE (sv) == SVt_PVHV)
790 { 856 {
791 SV *hv = SvRV (sv);
792 if (SvTYPE (hv) == SVt_PVHV)
793 {
794 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); 857 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
795 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; 858 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
796 859
797 prio = prio > PRIO_MAX ? PRIO_MAX 860 prio = prio > PRIO_MAX ? PRIO_MAX
798 : prio < PRIO_MIN ? PRIO_MIN 861 : prio < PRIO_MIN ? PRIO_MIN
799 : prio; 862 : prio;
800 863
801 av_push (coro_ready [prio - PRIO_MIN], sv); 864 av_push (coro_ready [prio - PRIO_MIN], sv);
865 coro_nready++;
802 866
803 return; 867 return;
804 }
805 } 868 }
806 869
807 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 870 croak ("Coro::ready tried to enqueue something that is not a coroutine");
808} 871}
809 872
810static SV * 873static SV *
811coro_deq (int min_prio) 874coro_deq (pTHX_ int min_prio)
812{ 875{
813 int prio = PRIO_MAX - PRIO_MIN; 876 int prio = PRIO_MAX - PRIO_MIN;
814 877
815 min_prio -= PRIO_MIN; 878 min_prio -= PRIO_MIN;
816 if (min_prio < 0) 879 if (min_prio < 0)
817 min_prio = 0; 880 min_prio = 0;
818 881
819 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 882 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
820 if (av_len (coro_ready[prio]) >= 0) 883 if (av_len (coro_ready[prio]) >= 0)
884 {
885 coro_nready--;
821 return av_shift (coro_ready[prio]); 886 return av_shift (coro_ready[prio]);
887 }
822 888
823 return 0; 889 return 0;
890}
891
892static void
893api_ready (SV *coro)
894{
895 dTHX;
896
897 if (SvROK (coro))
898 coro = SvRV (coro);
899
900 LOCK;
901 coro_enq (aTHX_ SvREFCNT_inc (coro));
902 UNLOCK;
903}
904
905static void
906api_schedule (void)
907{
908 dTHX;
909
910 SV *prev, *next;
911
912 LOCK;
913
914 prev = SvRV (GvSV (coro_current));
915 next = coro_deq (aTHX_ PRIO_MIN);
916
917 if (!next)
918 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
919
920 /* free this only after the transfer */
921 coro_mortal = prev;
922 SV_CORO (prev, "Coro::schedule");
923
924 SvRV (GvSV (coro_current)) = next;
925
926 SV_CORO (next, "Coro::schedule");
927
928 UNLOCK;
929
930 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
931 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
932}
933
934static void
935api_cede (void)
936{
937 dTHX;
938
939 LOCK;
940 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
941 UNLOCK;
942
943 api_schedule ();
824} 944}
825 945
826MODULE = Coro::State PACKAGE = Coro::State 946MODULE = Coro::State PACKAGE = Coro::State
827 947
828PROTOTYPES: ENABLE 948PROTOTYPES: ENABLE
829 949
830BOOT: 950BOOT:
831{ /* {} necessary for stoopid perl-5.6.x */ 951{ /* {} necessary for stoopid perl-5.6.x */
952#ifdef USE_ITHREADS
953 MUTEX_INIT (&coro_mutex);
954#endif
955
832 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 956 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
833 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 957 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
834 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 958 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
835 959
836 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 960 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
837 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 961 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
838 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 962 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
839 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 963 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
840 964
841 if (!padlist_cache)
842 padlist_cache = newHV ();
843
844 main_mainstack = PL_mainstack; 965 main_mainstack = PL_mainstack;
966
967 coroapi.ver = CORO_API_VERSION;
968 coroapi.transfer = api_transfer;
845} 969}
846 970
847Coro::State 971Coro::State
848_newprocess(args) 972_newprocess(args)
849 SV * args 973 SV * args
852 Coro__State coro; 976 Coro__State coro;
853 977
854 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 978 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
855 croak ("Coro::State::_newprocess expects an arrayref"); 979 croak ("Coro::State::_newprocess expects an arrayref");
856 980
857 New (0, coro, 1, struct coro); 981 Newz (0, coro, 1, struct coro);
858 982
859 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 983 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
860 coro->mainstack = 0; /* actual work is done inside transfer */ 984 /*coro->mainstack = 0; *//*actual work is done inside transfer */
861 coro->stack = 0; 985 /*coro->stack = 0;*/
986
987 /* same as JMPENV_BOOTSTRAP */
988 /* we might be able to recycle start_env, but safe is safe */
989 /*Zero(&coro->start_env, 1, JMPENV);*/
990 coro->start_env.je_ret = -1;
991 coro->start_env.je_mustcatch = TRUE;
862 992
863 RETVAL = coro; 993 RETVAL = coro;
864 OUTPUT: 994 OUTPUT:
865 RETVAL 995 RETVAL
866 996
867void 997void
868transfer(prev, next, flags) 998transfer(prev, next, flags)
869 Coro::State_or_hashref prev 999 SV *prev
870 Coro::State_or_hashref next 1000 SV *next
871 int flags 1001 int flags
872 PROTOTYPE: @ 1002 PROTOTYPE: @
873 CODE: 1003 CODE:
874 PUTBACK; 1004 PUTBACK;
1005 SV_CORO (next, "Coro::transfer");
1006 SV_CORO (prev, "Coro::transfer");
875 transfer (aTHX_ prev, next, flags); 1007 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
876 SPAGAIN; 1008 SPAGAIN;
877 1009
878void 1010void
879DESTROY(coro) 1011DESTROY(coro)
880 Coro::State coro 1012 Coro::State coro
882 1014
883 if (coro->mainstack && coro->mainstack != main_mainstack) 1015 if (coro->mainstack && coro->mainstack != main_mainstack)
884 { 1016 {
885 struct coro temp; 1017 struct coro temp;
886 1018
1019 PUTBACK;
887 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); 1020 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
888 LOAD(aTHX_ coro); 1021 LOAD (aTHX_ coro);
1022 SPAGAIN;
889 1023
890 destroy_stacks (aTHX); 1024 destroy_stacks (aTHX);
891 1025
892 LOAD((&temp)); /* this will get rid of defsv etc.. */ 1026 LOAD ((&temp)); /* this will get rid of defsv etc.. */
1027 SPAGAIN;
893 1028
894 coro->mainstack = 0; 1029 coro->mainstack = 0;
895 } 1030 }
896 1031
897 deallocate_stack (coro); 1032 deallocate_stack (coro);
898 1033 SvREFCNT_dec (coro->args);
899 Safefree (coro); 1034 Safefree (coro);
900
901void
902flush()
903 CODE:
904#ifdef MAY_FLUSH
905 flush_padlist_cache ();
906#endif
907 1035
908void 1036void
909_exit(code) 1037_exit(code)
910 int code 1038 int code
911 PROTOTYPE: $ 1039 PROTOTYPE: $
912 CODE: 1040 CODE:
913#if defined(__GLIBC__) || _POSIX_C_SOURCE
914 _exit (code); 1041 _exit (code);
915#else
916 signal (SIGTERM, SIG_DFL);
917 raise (SIGTERM);
918 exit (code);
919#endif
920 1042
921MODULE = Coro::State PACKAGE = Coro::Cont 1043MODULE = Coro::State PACKAGE = Coro::Cont
922 1044
923# this is slightly dirty (should expose a c-level api) 1045# this is slightly dirty (should expose a c-level api)
924 1046
930 SV *sv; 1052 SV *sv;
931 AV *defav = GvAV (PL_defgv); 1053 AV *defav = GvAV (PL_defgv);
932 struct coro *prev, *next; 1054 struct coro *prev, *next;
933 1055
934 if (!returnstk) 1056 if (!returnstk)
935 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); 1057 returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
936 1058
937 /* set up @_ -- ugly */ 1059 /* set up @_ -- ugly */
938 av_clear (defav); 1060 av_clear (defav);
939 av_fill (defav, items - 1); 1061 av_fill (defav, items - 1);
940 while (items--) 1062 while (items--)
941 av_store (defav, items, SvREFCNT_inc (ST(items))); 1063 av_store (defav, items, SvREFCNT_inc (ST(items)));
942 1064
943 mg_get (returnstk); /* isn't documentation wrong for mg_get? */ 1065 SvGETMAGIC (returnstk); /* isn't documentation wrong for mg_get? */
944 sv = av_pop ((AV *)SvRV (returnstk)); 1066 sv = av_pop ((AV *)SvRV (returnstk));
945 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); 1067 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
946 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); 1068 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
947 SvREFCNT_dec (sv); 1069 SvREFCNT_dec (sv);
948 1070
949 transfer(aTHX_ prev, next, 0); 1071 transfer (aTHX_ prev, next, 0);
950 1072
951MODULE = Coro::State PACKAGE = Coro 1073MODULE = Coro::State PACKAGE = Coro
952 1074
953# this is slightly dirty (should expose a c-level api) 1075# this is slightly dirty (should expose a c-level api)
954 1076
967 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1089 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
968 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1090 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
969 1091
970 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1092 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
971 coro_ready[i] = newAV (); 1093 coro_ready[i] = newAV ();
1094
1095 {
1096 SV *sv = perl_get_sv("Coro::API", 1);
1097
1098 coroapi.schedule = api_schedule;
1099 coroapi.cede = api_cede;
1100 coroapi.ready = api_ready;
1101 coroapi.nready = &coro_nready;
1102 coroapi.current = coro_current;
1103
1104 GCoroAPI = &coroapi;
1105 sv_setiv(sv, (IV)&coroapi);
1106 SvREADONLY_on(sv);
1107 }
972} 1108}
1109
1110#if !PERL_MICRO
973 1111
974void 1112void
975ready(self) 1113ready(self)
976 SV * self 1114 SV * self
1115 PROTOTYPE: $
977 CODE: 1116 CODE:
978 coro_enq (SvREFCNT_inc (self)); 1117 api_ready (self);
1118
1119#endif
1120
1121int
1122nready(...)
1123 PROTOTYPE:
1124 CODE:
1125 RETVAL = coro_nready;
1126 OUTPUT:
1127 RETVAL
979 1128
980void 1129void
981schedule(...) 1130schedule(...)
982 ALIAS: 1131 PROTOTYPE:
983 cede = 1
984 CODE: 1132 CODE:
985 SV *prev, *next; 1133 api_schedule ();
986 1134
987 prev = GvSV (coro_current); 1135void
1136cede(...)
1137 PROTOTYPE:
1138 CODE:
1139 api_cede ();
988 1140
989 if (ix)
990 coro_enq (SvREFCNT_inc (prev));
991
992 next = coro_deq (PRIO_MIN);
993
994 if (!next)
995 next = SvREFCNT_inc (GvSV (coro_idle));
996
997 GvSV (coro_current) = SvREFCNT_inc (next);
998 transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"),
999 sv_to_coro (next, "Coro::schedule", "next coroutine"),
1000 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
1001 SvREFCNT_dec (next);
1002 SvREFCNT_dec (prev);
1003

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines