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.4 by root, Tue Jul 17 02:21:56 2001 UTC vs.
Revision 1.27 by root, Mon Aug 20 16:58:19 2001 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#if 0 5#include "libcoro/coro.c"
6# define CHK(x) (void *)0 6
7#include <signal.h>
8
9#ifdef HAVE_MMAP
10# include <unistd.h>
11# include <sys/mman.h>
12# ifndef MAP_ANON
13# ifdef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS
7#else 15# else
8# define CHK(x) if (!(x)) croak("FATAL, CHK: " #x) 16# undef HAVE_MMAP
17# endif
18# endif
9#endif 19#endif
10 20
21#define MAY_FLUSH /* increases codesize */
22
23#define SUB_INIT "Coro::State::initialize"
24#define UCORO_STATE "_coro_state"
25
26/* The next macro should delcare a variable stacklevel that contains and approximation
27 * to the current C stack pointer. Its property is that it changes with each call
28 * and should be unique. */
29#define dSTACKLEVEL void *stacklevel = &stacklevel
30
31#define labs(l) ((l) >= 0 ? (l) : -(l))
32
33#include "CoroAPI.h"
34
35static struct CoroAPI coroapi;
36
37/* this is actually not only the c stack but also c registers etc... */
38typedef struct {
39 int refcnt; /* pointer reference counter */
40 int usecnt; /* shared by how many coroutines */
41 int gencnt; /* generation counter */
42
43 coro_context cctx;
44
45 void *sptr;
46 long ssize; /* positive == mmap, otherwise malloc */
47} coro_stack;
48
11struct coro { 49struct coro {
50 /* the optional C context */
51 coro_stack *stack;
52 void *cursp;
53 int gencnt;
54
55 /* optionally saved, might be zero */
56 AV *defav;
57 SV *defsv;
58 SV *errsv;
59
60 /* saved global state not related to stacks */
12 U8 dowarn; 61 U8 dowarn;
13 AV *defav; 62 I32 in_eval;
14 63
64 /* the stacks and related info (callchain etc..) */
15 PERL_SI *curstackinfo; 65 PERL_SI *curstackinfo;
16 AV *curstack; 66 AV *curstack;
17 AV *mainstack; 67 AV *mainstack;
18 SV **stack_sp; 68 SV **stack_sp;
19 OP *op; 69 OP *op;
35 I32 savestack_max; 85 I32 savestack_max;
36 OP **retstack; 86 OP **retstack;
37 I32 retstack_ix; 87 I32 retstack_ix;
38 I32 retstack_max; 88 I32 retstack_max;
39 COP *curcop; 89 COP *curcop;
90 JMPENV *top_env;
40 91
92 /* data associated with this coroutine (initial args) */
41 AV *args; 93 AV *args;
42}; 94};
43 95
44typedef struct coro *Coro__State; 96typedef struct coro *Coro__State;
45typedef struct coro *Coro__State_or_hashref; 97typedef struct coro *Coro__State_or_hashref;
46 98
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;
47static HV *padlist_cache; 103static HV *padlist_cache;
48 104
49/* mostly copied from op.c:cv_clone2 */ 105/* mostly copied from op.c:cv_clone2 */
50STATIC AV * 106STATIC AV *
51clone_padlist (AV *protopadlist) 107clone_padlist (AV *protopadlist)
115 SvPADTMP_on (sv); 171 SvPADTMP_on (sv);
116 npad[ix] = sv; 172 npad[ix] = sv;
117 } 173 }
118 } 174 }
119 175
120#if 0 /* NONOTUNDERSTOOD */ 176#if 0 /* return -ENOTUNDERSTOOD */
121 /* Now that vars are all in place, clone nested closures. */ 177 /* Now that vars are all in place, clone nested closures. */
122 178
123 for (ix = fpad; ix > 0; ix--) { 179 for (ix = fpad; ix > 0; ix--) {
124 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; 180 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
125 if (namesv 181 if (namesv
138#endif 194#endif
139 195
140 return newpadlist; 196 return newpadlist;
141} 197}
142 198
143STATIC AV * 199#ifdef MAY_FLUSH
200STATIC void
144free_padlist (AV *padlist) 201free_padlist (AV *padlist)
145{ 202{
146 /* may be during global destruction */ 203 /* may be during global destruction */
147 if (SvREFCNT(padlist)) 204 if (SvREFCNT(padlist))
148 { 205 {
156 } 213 }
157 214
158 SvREFCNT_dec((SV*)padlist); 215 SvREFCNT_dec((SV*)padlist);
159 } 216 }
160} 217}
218#endif
161 219
162/* the next tow functions merely cache the padlists */ 220/* the next two functions merely cache the padlists */
163STATIC void 221STATIC void
164get_padlist (CV *cv) 222get_padlist (CV *cv)
165{ 223{
166 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); 224 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
167 225
183 } 241 }
184 242
185 av_push ((AV *)*he, (SV *)CvPADLIST (cv)); 243 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
186} 244}
187 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
272#define SB do {
273#define SE } while (0)
274
275#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
276#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
277
278#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
279
188static void 280static void
189SAVE(pTHX_ Coro__State c) 281load_state(pTHX_ Coro__State c)
282{
283 PL_dowarn = c->dowarn;
284 PL_in_eval = c->in_eval;
285
286 PL_curstackinfo = c->curstackinfo;
287 PL_curstack = c->curstack;
288 PL_mainstack = c->mainstack;
289 PL_stack_sp = c->stack_sp;
290 PL_op = c->op;
291 PL_curpad = c->curpad;
292 PL_stack_base = c->stack_base;
293 PL_stack_max = c->stack_max;
294 PL_tmps_stack = c->tmps_stack;
295 PL_tmps_floor = c->tmps_floor;
296 PL_tmps_ix = c->tmps_ix;
297 PL_tmps_max = c->tmps_max;
298 PL_markstack = c->markstack;
299 PL_markstack_ptr = c->markstack_ptr;
300 PL_markstack_max = c->markstack_max;
301 PL_scopestack = c->scopestack;
302 PL_scopestack_ix = c->scopestack_ix;
303 PL_scopestack_max = c->scopestack_max;
304 PL_savestack = c->savestack;
305 PL_savestack_ix = c->savestack_ix;
306 PL_savestack_max = c->savestack_max;
307 PL_retstack = c->retstack;
308 PL_retstack_ix = c->retstack_ix;
309 PL_retstack_max = c->retstack_max;
310 PL_curcop = c->curcop;
311 PL_top_env = c->top_env;
312
313 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
315 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
316
317 {
318 dSP;
319 CV *cv;
320
321 /* now do the ugly restore mess */
322 while ((cv = (CV *)POPs))
323 {
324 AV *padlist = (AV *)POPs;
325
326 if (padlist)
327 {
328 put_padlist (cv); /* mark this padlist as available */
329 CvPADLIST(cv) = padlist;
330#ifdef USE_THREADS
331 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
332#endif
333 }
334
335 ++CvDEPTH(cv);
336 }
337
338 PUTBACK;
339 }
340}
341
342static void
343save_state(pTHX_ Coro__State c, int flags)
190{ 344{
191 { 345 {
192 dSP; 346 dSP;
193 I32 cxix = cxstack_ix; 347 I32 cxix = cxstack_ix;
348 PERL_CONTEXT *ccstk = cxstack;
194 PERL_SI *top_si = PL_curstackinfo; 349 PERL_SI *top_si = PL_curstackinfo;
195 PERL_CONTEXT *ccstk = cxstack;
196 350
197 /* 351 /*
198 * the worst thing you can imagine happens first - we have to save 352 * the worst thing you can imagine happens first - we have to save
199 * (and reinitialize) all cv's in the whole callchain :( 353 * (and reinitialize) all cv's in the whole callchain :(
200 */ 354 */
201 355
202 PUSHs (Nullsv); 356 PUSHs (Nullsv);
203 /* this loop was inspired by pp_caller */ 357 /* this loop was inspired by pp_caller */
204 for (;;) 358 for (;;)
205 { 359 {
206 while (cxix >= 0) 360 do
207 { 361 {
208 PERL_CONTEXT *cx = &ccstk[cxix--]; 362 PERL_CONTEXT *cx = &ccstk[cxix--];
209 363
210 if (CxTYPE(cx) == CXt_SUB) 364 if (CxTYPE(cx) == CXt_SUB)
211 { 365 {
212 CV *cv = cx->blk_sub.cv; 366 CV *cv = cx->blk_sub.cv;
213 if (CvDEPTH(cv)) 367 if (CvDEPTH(cv))
214 { 368 {
215#ifdef USE_THREADS 369#ifdef USE_THREADS
216 XPUSHs ((SV *)CvOWNER(cv)); 370 /*XPUSHs ((SV *)CvOWNER(cv));*/
371 /*CvOWNER(cv) = 0;*/
372 /*error must unlock this cv etc.. etc...*/
217#endif 373#endif
218 EXTEND (SP, 3); 374 EXTEND (SP, CvDEPTH(cv)*2);
375
376 while (--CvDEPTH(cv))
377 {
378 /* this tells the restore code to increment CvDEPTH */
379 PUSHs (Nullsv);
219 PUSHs ((SV *)CvDEPTH(cv)); 380 PUSHs ((SV *)cv);
381 }
382
220 PUSHs ((SV *)CvPADLIST(cv)); 383 PUSHs ((SV *)CvPADLIST(cv));
221 PUSHs ((SV *)cv); 384 PUSHs ((SV *)cv);
222 385
223 get_padlist (cv); 386 get_padlist (cv); /* this is a monster */
224
225 CvDEPTH(cv) = 0;
226#ifdef USE_THREADS
227 CvOWNER(cv) = 0;
228 error must unlock this cv etc.. etc...
229 if you are here wondering about this error message then
230 the reason is that it will not work as advertised yet
231#endif
232 } 387 }
233 } 388 }
234 else if (CxTYPE(cx) == CXt_FORMAT) 389 else if (CxTYPE(cx) == CXt_FORMAT)
235 { 390 {
236 /* I never used formats, so how should I know how these are implemented? */ 391 /* I never used formats, so how should I know how these are implemented? */
237 /* my bold guess is as a simple, plain sub... */ 392 /* my bold guess is as a simple, plain sub... */
238 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); 393 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
239 } 394 }
240 } 395 }
396 while (cxix >= 0);
241 397
242 if (top_si->si_type == PERLSI_MAIN) 398 if (top_si->si_type == PERLSI_MAIN)
243 break; 399 break;
244 400
245 top_si = top_si->si_prev; 401 top_si = top_si->si_prev;
248 } 404 }
249 405
250 PUTBACK; 406 PUTBACK;
251 } 407 }
252 408
409 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
410 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
411 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
253 c->dowarn = PL_dowarn; 418 c->dowarn = PL_dowarn;
254 c->defav = GvAV (PL_defgv); 419 c->in_eval = PL_in_eval;
420
255 c->curstackinfo = PL_curstackinfo; 421 c->curstackinfo = PL_curstackinfo;
256 c->curstack = PL_curstack; 422 c->curstack = PL_curstack;
257 c->mainstack = PL_mainstack; 423 c->mainstack = PL_mainstack;
258 c->stack_sp = PL_stack_sp; 424 c->stack_sp = PL_stack_sp;
259 c->op = PL_op; 425 c->op = PL_op;
275 c->savestack_max = PL_savestack_max; 441 c->savestack_max = PL_savestack_max;
276 c->retstack = PL_retstack; 442 c->retstack = PL_retstack;
277 c->retstack_ix = PL_retstack_ix; 443 c->retstack_ix = PL_retstack_ix;
278 c->retstack_max = PL_retstack_max; 444 c->retstack_max = PL_retstack_max;
279 c->curcop = PL_curcop; 445 c->curcop = PL_curcop;
446 c->top_env = PL_top_env;
280} 447}
281 448
282static void 449/*
283LOAD(pTHX_ Coro__State c) 450 * allocate various perl stacks. This is an exact copy
451 * of perl.c:init_stacks, except that it uses less memory
452 * on the assumption that coroutines do not usually need
453 * a lot of stackspace.
454 */
455STATIC void
456coro_init_stacks (pTHX)
284{ 457{
285 PL_dowarn = c->dowarn; 458 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
286 GvAV (PL_defgv) = c->defav; 459 PL_curstackinfo->si_type = PERLSI_MAIN;
287 PL_curstackinfo = c->curstackinfo; 460 PL_curstack = PL_curstackinfo->si_stack;
288 PL_curstack = c->curstack; 461 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
289 PL_mainstack = c->mainstack; 462
463 PL_stack_base = AvARRAY(PL_curstack);
290 PL_stack_sp = c->stack_sp; 464 PL_stack_sp = PL_stack_base;
291 PL_op = c->op; 465 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
292 PL_curpad = c->curpad; 466
293 PL_stack_base = c->stack_base; 467 New(50,PL_tmps_stack,96,SV*);
294 PL_stack_max = c->stack_max; 468 PL_tmps_floor = -1;
295 PL_tmps_stack = c->tmps_stack; 469 PL_tmps_ix = -1;
296 PL_tmps_floor = c->tmps_floor; 470 PL_tmps_max = 96;
297 PL_tmps_ix = c->tmps_ix; 471
298 PL_tmps_max = c->tmps_max; 472 New(54,PL_markstack,16,I32);
299 PL_markstack = c->markstack;
300 PL_markstack_ptr = c->markstack_ptr; 473 PL_markstack_ptr = PL_markstack;
301 PL_markstack_max = c->markstack_max; 474 PL_markstack_max = PL_markstack + 16;
302 PL_scopestack = c->scopestack;
303 PL_scopestack_ix = c->scopestack_ix;
304 PL_scopestack_max = c->scopestack_max;
305 PL_savestack = c->savestack;
306 PL_savestack_ix = c->savestack_ix;
307 PL_savestack_max = c->savestack_max;
308 PL_retstack = c->retstack;
309 PL_retstack_ix = c->retstack_ix;
310 PL_retstack_max = c->retstack_max;
311 PL_curcop = c->curcop;
312 475
313 { 476 SET_MARK_OFFSET;
314 dSP;
315 CV *cv;
316 477
317 /* now do the ugly restore mess */ 478 New(54,PL_scopestack,16,I32);
318 while ((cv = (CV *)POPs)) 479 PL_scopestack_ix = 0;
319 { 480 PL_scopestack_max = 16;
320 AV *padlist = (AV *)POPs;
321 481
322 put_padlist (cv); 482 New(54,PL_savestack,96,ANY);
323 CvPADLIST(cv) = padlist; 483 PL_savestack_ix = 0;
324 CvDEPTH(cv) = (I32)POPs; 484 PL_savestack_max = 96;
325 485
326#ifdef USE_THREADS 486 New(54,PL_retstack,8,OP*);
327 CvOWNER(cv) = (struct perl_thread *)POPs; 487 PL_retstack_ix = 0;
328 error does not work either 488 PL_retstack_max = 8;
329#endif
330 }
331
332 PUTBACK;
333 }
334} 489}
335 490
336/* this is an EXACT copy of S_nuke_stacks in perl.c, which is unfortunately static */ 491/*
492 * destroy the stacks, the callchain etc...
493 * still there is a memleak of 128 bytes...
494 */
337STATIC void 495STATIC void
338destroy_stacks(pTHX) 496destroy_stacks(pTHX)
339{ 497{
340 dSP;
341
342 /* die does this while calling POPSTACK, but I just don't see why. */
343 dounwind(-1);
344
345 /* is this ugly, I ask? */ 498 /* is this ugly, I ask? */
346 while (PL_scopestack_ix) 499 while (PL_scopestack_ix)
347 LEAVE; 500 LEAVE;
348 501
502 /* 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;
505
349 while (PL_curstackinfo->si_next) 506 while (PL_curstackinfo->si_next)
350 PL_curstackinfo = PL_curstackinfo->si_next; 507 PL_curstackinfo = PL_curstackinfo->si_next;
351 508
352 while (PL_curstackinfo) 509 while (PL_curstackinfo)
353 { 510 {
354 PERL_SI *p = PL_curstackinfo->si_prev; 511 PERL_SI *p = PL_curstackinfo->si_prev;
512
513 {
514 dSP;
515 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
516 PUTBACK; /* possibly superfluous */
517 }
518
519 if (PL_main_cv != Nullcv) /* don't during destruction. hack? */
520 dounwind(-1);
355 521
356 SvREFCNT_dec(PL_curstackinfo->si_stack); 522 SvREFCNT_dec(PL_curstackinfo->si_stack);
357 Safefree(PL_curstackinfo->si_cxstack); 523 Safefree(PL_curstackinfo->si_cxstack);
358 Safefree(PL_curstackinfo); 524 Safefree(PL_curstackinfo);
359 PL_curstackinfo = p; 525 PL_curstackinfo = p;
360 } 526 }
361 527
362 if (PL_scopestack_ix != 0)
363 Perl_warner(aTHX_ WARN_INTERNAL,
364 "Unbalanced scopes: %ld more ENTERs than LEAVEs\n",
365 (long)PL_scopestack_ix);
366 if (PL_savestack_ix != 0)
367 Perl_warner(aTHX_ WARN_INTERNAL,
368 "Unbalanced saves: %ld more saves than restores\n",
369 (long)PL_savestack_ix);
370 if (PL_tmps_floor != -1)
371 Perl_warner(aTHX_ WARN_INTERNAL,"Unbalanced tmps: %ld more allocs than frees\n",
372 (long)PL_tmps_floor + 1);
373 /*
374 */
375 Safefree(PL_tmps_stack); 528 Safefree(PL_tmps_stack);
376 Safefree(PL_markstack); 529 Safefree(PL_markstack);
377 Safefree(PL_scopestack); 530 Safefree(PL_scopestack);
378 Safefree(PL_savestack); 531 Safefree(PL_savestack);
379 Safefree(PL_retstack); 532 Safefree(PL_retstack);
380} 533}
381 534
382#define SUB_INIT "Coro::State::_newcoro" 535static void
536allocate_stack (Coro__State ctx, int alloc)
537{
538 coro_stack *stack;
539
540 New (0, stack, 1, coro_stack);
541
542 stack->refcnt = 1;
543 stack->usecnt = 1;
544 stack->gencnt = ctx->gencnt = 0;
545 if (alloc)
546 {
547#ifdef HAVE_MMAP
548 stack->ssize = 128 * 1024 * 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);
550 if (stack->sptr == (void *)-1)
551#endif
552 {
553 /*FIXME*//*D*//* reasonable stack size! */
554 stack->ssize = -4096 * sizeof (long);
555 New (0, stack->sptr, 4096, long);
556 }
557 }
558 else
559 stack->sptr = 0;
560
561 ctx->stack = stack;
562}
563
564static void
565deallocate_stack (Coro__State ctx)
566{
567 coro_stack *stack = ctx->stack;
568
569 ctx->stack = 0;
570
571 if (stack)
572 {
573 if (!--stack->refcnt)
574 {
575#ifdef HAVE_MMAP
576 if (stack->ssize > 0 && stack->sptr)
577 munmap (stack->sptr, stack->ssize);
578 else
579#else
580 Safefree (stack->sptr);
581#endif
582 Safefree (stack);
583 }
584 else if (ctx->gencnt == stack->gencnt)
585 --stack->usecnt;
586 }
587}
588
589static void
590setup_coro (void *arg)
591{
592 /*
593 * emulate part of the perl startup here.
594 */
595 dSP;
596 Coro__State ctx = (Coro__State)arg;
597 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
598
599 coro_init_stacks (aTHX);
600 /*PL_curcop = 0;*/
601 /*PL_in_eval = PL_in_eval;*/ /* inherit */
602 SvREFCNT_dec (GvAV (PL_defgv));
603 GvAV (PL_defgv) = ctx->args;
604
605 SPAGAIN;
606
607 if (ctx->stack)
608 {
609 ctx->cursp = 0;
610
611 PUSHMARK(SP);
612 PUTBACK;
613 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
614
615 if (SvTRUE (ERRSV))
616 croak (NULL);
617 else
618 croak ("FATAL: CCTXT coroutine returned!");
619 }
620 else
621 {
622 UNOP myop;
623
624 PL_op = (OP *)&myop;
625
626 Zero(&myop, 1, UNOP);
627 myop.op_next = Nullop;
628 myop.op_flags = OPf_WANT_VOID;
629
630 PUSHMARK(SP);
631 XPUSHs (sub_init);
632 /*
633 * the next line is slightly wrong, as PL_op->op_next
634 * is actually being executed so we skip the first op.
635 * that doesn't matter, though, since it is only
636 * pp_nextstate and we never return...
637 * ah yes, and I don't care anyways ;)
638 */
639 PUTBACK;
640 PL_op = pp_entersub();
641 SPAGAIN;
642
643 ENTER; /* necessary e.g. for dounwind */
644 }
645}
646
647static void
648continue_coro (void *arg)
649{
650 /*
651 * this is a _very_ stripped down perl interpreter ;)
652 */
653 Coro__State ctx = (Coro__State)arg;
654
655 /*FIXME*//* must set up top_env here */
656 ctx->cursp = 0;
657 PL_op = PL_op->op_next;
658 CALLRUNOPS(aTHX);
659
660 abort ();
661}
662
663STATIC void
664transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
665{
666 dSP;
667 dSTACKLEVEL;
668
669 if (prev != next)
670 {
671 if (next->mainstack)
672 {
673 SAVE (prev, flags);
674 LOAD (next);
675
676 /* mark this state as in-use */
677 next->mainstack = 0;
678 next->tmps_ix = -2;
679
680 /* stacklevel changed? if yes, grab the stack for us! */
681 if (flags & TRANSFER_SAVE_CCTXT)
682 {
683 if (!prev->stack)
684 allocate_stack (prev, 0);
685 else if (prev->cursp != stacklevel
686 && prev->stack->usecnt > 1)
687 {
688 prev->gencnt = ++prev->stack->gencnt;
689 prev->stack->usecnt = 1;
690 }
691
692 /* has our stack been invalidated? */
693 if (next->stack && next->stack->gencnt != next->gencnt)
694 {
695 deallocate_stack (next);
696 allocate_stack (next, 1);
697 coro_create (&(next->stack->cctx),
698 continue_coro, (void *)next,
699 next->stack->sptr, labs (next->stack->ssize));
700 }
701
702 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
703 }
704
705 }
706 else if (next->tmps_ix == -2)
707 croak ("tried to transfer to running coroutine");
708 else
709 {
710 SAVE (prev, -1); /* first get rid of the old state */
711
712 if (flags & TRANSFER_SAVE_CCTXT)
713 {
714 if (!prev->stack)
715 allocate_stack (prev, 0);
716
717 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
718 {
719 setup_coro (next);
720
721 prev->stack->refcnt++;
722 prev->stack->usecnt++;
723 next->stack = prev->stack;
724 next->gencnt = prev->gencnt;
725 }
726 else
727 {
728 allocate_stack (next, 1);
729 coro_create (&(next->stack->cctx),
730 setup_coro, (void *)next,
731 next->stack->sptr, labs (next->stack->ssize));
732 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
733 }
734 }
735 else
736 setup_coro (next);
737 }
738 }
739
740 next->cursp = stacklevel;
741}
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 {
748 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
749
750 if (!he)
751 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
752
753 arg = HeVAL(he);
754 }
755
756 /* must also be changed inside Coro::Cont::yield */
757 if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
758 return (struct coro *) SvIV((SV*)SvRV(arg));
759
760 croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
761 /*NORETURN*/
762}
763
764static void
765api_transfer(pTHX_ SV *prev, SV *next, int flags)
766{
767 transfer(aTHX_
768 sv_to_coro (prev, "Coro::transfer", "prev"),
769 sv_to_coro (next, "Coro::transfer", "next"),
770 flags);
771}
772
773/** Coro ********************************************************************/
774
775#define PRIO_MAX 3
776#define PRIO_HIGH 1
777#define PRIO_NORMAL 0
778#define PRIO_LOW -1
779#define PRIO_IDLE -3
780#define PRIO_MIN -4
781
782/* for Coro.pm */
783static GV *coro_current, *coro_idle;
784static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
785static int coro_nready;
786
787static void
788coro_enq (SV *sv)
789{
790 if (SvROK (sv))
791 {
792 SV *hv = SvRV (sv);
793 if (SvTYPE (hv) == SVt_PVHV)
794 {
795 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
796 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
797
798 prio = prio > PRIO_MAX ? PRIO_MAX
799 : prio < PRIO_MIN ? PRIO_MIN
800 : prio;
801
802 av_push (coro_ready [prio - PRIO_MIN], sv);
803 coro_nready++;
804
805 return;
806 }
807 }
808
809 croak ("Coro::ready tried to enqueue something that is not a coroutine");
810}
811
812static SV *
813coro_deq (int min_prio)
814{
815 int prio = PRIO_MAX - PRIO_MIN;
816
817 min_prio -= PRIO_MIN;
818 if (min_prio < 0)
819 min_prio = 0;
820
821 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
822 if (av_len (coro_ready[prio]) >= 0)
823 {
824 coro_nready--;
825 return av_shift (coro_ready[prio]);
826 }
827
828 return 0;
829}
830
831static void
832api_ready (SV *coro)
833{
834 coro_enq (SvREFCNT_inc (coro));
835}
836
837static void
838api_schedule (int cede)
839{
840 SV *prev, *next;
841
842 prev = GvSV (coro_current);
843
844 if (cede)
845 coro_enq (SvREFCNT_inc (prev));
846
847 next = coro_deq (PRIO_MIN);
848
849 if (!next)
850 next = SvREFCNT_inc (GvSV (coro_idle));
851
852 GvSV (coro_current) = SvREFCNT_inc (next);
853 transfer (aTHX_
854 sv_to_coro (prev, "Coro::schedule", "current coroutine"),
855 sv_to_coro (next, "Coro::schedule", "next coroutine"),
856 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
857 SvREFCNT_dec (next);
858 SvREFCNT_dec (prev);
859}
383 860
384MODULE = Coro::State PACKAGE = Coro::State 861MODULE = Coro::State PACKAGE = Coro::State
385 862
386PROTOTYPES: ENABLE 863PROTOTYPES: ENABLE
387 864
388BOOT: 865BOOT:
866{ /* {} necessary for stoopid perl-5.6.x */
867 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
868 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
869 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
870
871 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
872 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
873 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
874 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
875
389 if (!padlist_cache) 876 if (!padlist_cache)
390 padlist_cache = newHV (); 877 padlist_cache = newHV ();
878
879 main_mainstack = PL_mainstack;
880
881 coroapi.ver = CORO_API_VERSION;
882 coroapi.transfer = api_transfer;
883}
391 884
392Coro::State 885Coro::State
393_newprocess(args) 886_newprocess(args)
394 SV * args 887 SV * args
395 PROTOTYPE: $ 888 PROTOTYPE: $
396 CODE: 889 CODE:
397 Coro__State coro; 890 Coro__State coro;
398 891
399 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) 892 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
400 croak ("Coro::State::newprocess expects an arrayref"); 893 croak ("Coro::State::_newprocess expects an arrayref");
401 894
402 New (0, coro, 1, struct coro); 895 New (0, coro, 1, struct coro);
403 896
897 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
404 coro->mainstack = 0; /* actual work is done inside transfer */ 898 coro->mainstack = 0; /* actual work is done inside transfer */
405 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 899 coro->stack = 0;
406 900
407 RETVAL = coro; 901 RETVAL = coro;
408 OUTPUT: 902 OUTPUT:
409 RETVAL 903 RETVAL
410 904
411void 905void
412transfer(prev,next) 906transfer(prev, next, flags)
413 Coro::State_or_hashref prev 907 Coro::State_or_hashref prev
414 Coro::State_or_hashref next 908 Coro::State_or_hashref next
909 int flags
910 PROTOTYPE: @
415 CODE: 911 CODE:
416
417 if (prev != next)
418 {
419 PUTBACK; 912 PUTBACK;
420 SAVE (aTHX_ prev); 913 transfer (aTHX_ prev, next, flags);
421
422 /*
423 * this could be done in newprocess which would lead to
424 * extremely elegant and fast (just PUTBACK/SAVE/LOAD/SPAGAIN)
425 * code here, but lazy allocation of stacks has also
426 * some virtues and the overhead of the if() is nil.
427 */
428 if (next->mainstack)
429 {
430 LOAD (aTHX_ next);
431 next->mainstack = 0; /* unnecessary but much cleaner */
432 SPAGAIN; 914 SPAGAIN;
433 }
434 else
435 {
436 /*
437 * emulate part of the perl startup here.
438 */
439 UNOP myop;
440
441 init_stacks (); /* from perl.c */
442 PL_op = (OP *)&myop;
443 /*PL_curcop = 0;*/
444 GvAV (PL_defgv) = (SV *)SvREFCNT_inc (next->args);
445
446 SPAGAIN;
447 Zero(&myop, 1, UNOP);
448 myop.op_next = Nullop;
449 myop.op_flags = OPf_WANT_VOID;
450
451 PUSHMARK(SP);
452 XPUSHs ((SV*)get_cv(SUB_INIT, TRUE));
453 PUTBACK;
454 /*
455 * the next line is slightly wrong, as PL_op->op_next
456 * is actually being executed so we skip the first op.
457 * that doesn't matter, though, since it is only
458 * pp_nextstate and we never return...
459 */
460 PL_op = Perl_pp_entersub(aTHX);
461 SPAGAIN;
462
463 ENTER;
464 }
465 }
466 915
467void 916void
468DESTROY(coro) 917DESTROY(coro)
469 Coro::State coro 918 Coro::State coro
470 CODE: 919 CODE:
471 920
472 if (coro->mainstack) 921 if (coro->mainstack && coro->mainstack != main_mainstack)
473 { 922 {
474 struct coro temp; 923 struct coro temp;
475 924
476 PUTBACK;
477 SAVE(aTHX_ (&temp)); 925 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
478 LOAD(aTHX_ coro); 926 LOAD(aTHX_ coro);
479 927
480 destroy_stacks (); 928 destroy_stacks (aTHX);
481 SvREFCNT_dec ((SV *)GvAV (PL_defgv));
482 929
483 LOAD((&temp)); 930 LOAD((&temp)); /* this will get rid of defsv etc.. */
484 SPAGAIN; 931
932 coro->mainstack = 0;
485 } 933 }
486 934
487 SvREFCNT_dec (coro->args); 935 deallocate_stack (coro);
936
488 Safefree (coro); 937 Safefree (coro);
489 938
939void
940flush()
941 CODE:
942#ifdef MAY_FLUSH
943 flush_padlist_cache ();
944#endif
490 945
946void
947_exit(code)
948 int code
949 PROTOTYPE: $
950 CODE:
951#if defined(__GLIBC__) || _POSIX_C_SOURCE
952 _exit (code);
953#else
954 signal (SIGTERM, SIG_DFL);
955 raise (SIGTERM);
956 exit (code);
957#endif
958
959MODULE = Coro::State PACKAGE = Coro::Cont
960
961# this is slightly dirty (should expose a c-level api)
962
963void
964yield(...)
965 PROTOTYPE: @
966 CODE:
967 static SV *returnstk;
968 SV *sv;
969 AV *defav = GvAV (PL_defgv);
970 struct coro *prev, *next;
971
972 if (!returnstk)
973 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
974
975 /* set up @_ -- ugly */
976 av_clear (defav);
977 av_fill (defav, items - 1);
978 while (items--)
979 av_store (defav, items, SvREFCNT_inc (ST(items)));
980
981 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
982 sv = av_pop ((AV *)SvRV (returnstk));
983 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
984 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
985 SvREFCNT_dec (sv);
986
987 transfer(aTHX_ prev, next, 0);
988
989MODULE = Coro::State PACKAGE = Coro
990
991# this is slightly dirty (should expose a c-level api)
992
993BOOT:
994{
995 int i;
996 HV *stash = gv_stashpv ("Coro", TRUE);
997
998 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
999 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1000 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1001 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
1002 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1003 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
1004
1005 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1006 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1007
1008 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1009 coro_ready[i] = newAV ();
1010
1011 {
1012 SV *sv = perl_get_sv("Coro::API", 1);
1013
1014 coroapi.schedule = api_schedule;
1015 coroapi.ready = api_ready;
1016 coroapi.nready = &coro_nready;
1017 coroapi.current = coro_current;
1018
1019 GCoroAPI = &coroapi;
1020 sv_setiv(sv, (IV)&coroapi);
1021 SvREADONLY_on(sv);
1022 }
1023}
1024
1025void
1026ready(self)
1027 SV * self
1028 CODE:
1029 api_ready (self);
1030
1031int
1032nready(...)
1033 PROTOTYPE:
1034 CODE:
1035 RETVAL = coro_nready;
1036 OUTPUT:
1037 RETVAL
1038
1039void
1040schedule(...)
1041 PROTOTYPE:
1042 ALIAS:
1043 cede = 1
1044 CODE:
1045 api_schedule (ix);
1046

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines