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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines