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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines