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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines