ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines