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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines