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