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.21 by root, Sat Aug 11 19:59:19 2001 UTC vs.
Revision 1.67 by root, Mon Dec 12 20:07:44 2005 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines