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.52 by pcg, Sun Nov 30 22:49:25 2003 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines