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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines