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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines