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.2 by root, Sun Jul 15 02:35:52 2001 UTC vs.
Revision 1.16 by root, Wed Jul 25 04:26:55 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#include "libcoro/coro.c"
6
7#ifdef HAVE_MMAP
8# include <unistd.h>
9# include <sys/mman.h>
10# ifndef MAP_ANON
11# ifdef MAP_ANONYMOUS
12# define MAP_ANON MAP_ANONYMOUS
13# else
14# undef HAVE_MMAP
15# endif
16# endif
17#endif
18
19#define MAY_FLUSH /* increases codesize */
20
21/* perl-related */
22#define TRANSFER_SAVE_DEFAV 0x00000001
23#define TRANSFER_SAVE_DEFSV 0x00000002
24#define TRANSFER_SAVE_ERRSV 0x00000004
25/* c-related */
26#define TRANSFER_SAVE_CCTXT 0x00000008
27#ifdef CORO_LAZY_STACK
28# define TRANSFER_LAZY_STACK 0x00000010
29#else
30# define TRANSFER_LAZY_STACK 0x00000000
31#endif
32
33#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV|TRANSFER_SAVE_DEFSV \
34 |TRANSFER_SAVE_ERRSV|TRANSFER_SAVE_CCTXT)
35
36#define SUB_INIT "Coro::State::initialize"
37#define UCORO_STATE "_coro_state"
38
39/* The next macro should delcare a variable stacklevel that contains and approximation
40 * to the current C stack pointer. It's property is that it changes with each call
41 * and should be unique. */
42#define dSTACKLEVEL void *stacklevel = &stacklevel
43
44#define labs(l) ((l) >= 0 ? (l) : -(l))
45
46/* this is actually not only the c stack but also c registers etc... */
47typedef struct {
48 int refcnt; /* pointer reference counter */
49 int usecnt; /* shared by how many coroutines */
50 int gencnt; /* generation counter */
51
52 coro_context cctx;
53
54 void *sptr;
55 long ssize; /* positive == mmap, otherwise malloc */
56} coro_stack;
57
58static coro_stack main_stack = { 1, 0, 0 };
59
5struct coro { 60struct coro {
61 /* the optional C context */
62 coro_stack *stack;
63 void *cursp;
64 int gencnt;
65
66 /* optionally saved, might be zero */
67 AV *defav;
68 SV *defsv;
69 SV *errsv;
70
71 /* saved global state not related to stacks */
6 U8 dowarn; 72 U8 dowarn;
7 73
74 /* the stacks and related info (callchain etc..) */
8 PERL_SI *curstackinfo; 75 PERL_SI *curstackinfo;
9 AV *curstack; 76 AV *curstack;
10 AV *mainstack; 77 AV *mainstack;
11 SV **stack_sp; 78 SV **stack_sp;
12 OP *op; 79 OP *op;
… …
28 I32 savestack_max; 95 I32 savestack_max;
29 OP **retstack; 96 OP **retstack;
30 I32 retstack_ix; 97 I32 retstack_ix;
31 I32 retstack_max; 98 I32 retstack_max;
32 COP *curcop; 99 COP *curcop;
100 JMPENV start_env;
101 JMPENV *top_env;
33 102
34 AV *defav; 103 /* data associated with this coroutine (initial args) */
35 104 AV *args;
36 SV *proc;
37}; 105};
38 106
39typedef struct coro *Coro__State; 107typedef struct coro *Coro__State;
40typedef struct coro *Coro__State_or_hashref; 108typedef struct coro *Coro__State_or_hashref;
41 109
42#define SAVE(c) \ 110static AV *main_mainstack; /* used to differentiate between $main and others */
43 c->dowarn = PL_dowarn; \ 111static HV *coro_state_stash;
44 c->curstackinfo = PL_curstackinfo; \ 112static SV *ucoro_state_sv;
45 c->curstack = PL_curstack; \ 113static U32 ucoro_state_hash;
46 c->mainstack = PL_mainstack; \ 114static HV *padlist_cache;
47 c->stack_sp = PL_stack_sp; \
48 c->op = PL_op; \
49 c->curpad = PL_curpad; \
50 c->stack_base = PL_stack_base; \
51 c->stack_max = PL_stack_max; \
52 c->tmps_stack = PL_tmps_stack; \
53 c->tmps_floor = PL_tmps_floor; \
54 c->tmps_ix = PL_tmps_ix; \
55 c->tmps_max = PL_tmps_max; \
56 c->markstack = PL_markstack; \
57 c->markstack_ptr = PL_markstack_ptr; \
58 c->markstack_max = PL_markstack_max; \
59 c->scopestack = PL_scopestack; \
60 c->scopestack_ix = PL_scopestack_ix; \
61 c->scopestack_max = PL_scopestack_max;\
62 c->savestack = PL_savestack; \
63 c->savestack_ix = PL_savestack_ix; \
64 c->savestack_max = PL_savestack_max; \
65 c->retstack = PL_retstack; \
66 c->retstack_ix = PL_retstack_ix; \
67 c->retstack_max = PL_retstack_max; \
68 c->curcop = PL_curcop; \
69 c->defav = GvAV (PL_defgv);
70 115
71#define LOAD(c) \ 116/* mostly copied from op.c:cv_clone2 */
72 PL_dowarn = c->dowarn; \ 117STATIC AV *
73 PL_curstackinfo = c->curstackinfo; \ 118clone_padlist (AV *protopadlist)
74 PL_curstack = c->curstack; \ 119{
75 PL_mainstack = c->mainstack; \ 120 AV *av;
76 PL_stack_sp = c->stack_sp; \ 121 I32 ix;
77 PL_op = c->op; \ 122 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
78 PL_curpad = c->curpad; \ 123 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
79 PL_stack_base = c->stack_base; \ 124 SV **pname = AvARRAY (protopad_name);
80 PL_stack_max = c->stack_max; \ 125 SV **ppad = AvARRAY (protopad);
81 PL_tmps_stack = c->tmps_stack; \ 126 I32 fname = AvFILLp (protopad_name);
82 PL_tmps_floor = c->tmps_floor; \ 127 I32 fpad = AvFILLp (protopad);
83 PL_tmps_ix = c->tmps_ix; \ 128 AV *newpadlist, *newpad_name, *newpad;
84 PL_tmps_max = c->tmps_max; \ 129 SV **npad;
85 PL_markstack = c->markstack; \
86 PL_markstack_ptr = c->markstack_ptr; \
87 PL_markstack_max = c->markstack_max; \
88 PL_scopestack = c->scopestack; \
89 PL_scopestack_ix = c->scopestack_ix; \
90 PL_scopestack_max = c->scopestack_max;\
91 PL_savestack = c->savestack; \
92 PL_savestack_ix = c->savestack_ix; \
93 PL_savestack_max = c->savestack_max; \
94 PL_retstack = c->retstack; \
95 PL_retstack_ix = c->retstack_ix; \
96 PL_retstack_max = c->retstack_max; \
97 PL_curcop = c->curcop; \
98 GvAV (PL_defgv) = c->defav;
99 130
100/* this is an EXACT copy of S_nuke_stacks in perl.c, which is unfortunately static */ 131 newpad_name = newAV ();
132 for (ix = fname; ix >= 0; ix--)
133 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
134
135 newpad = newAV ();
136 av_fill (newpad, AvFILLp (protopad));
137 npad = AvARRAY (newpad);
138
139 newpadlist = newAV ();
140 AvREAL_off (newpadlist);
141 av_store (newpadlist, 0, (SV *) newpad_name);
142 av_store (newpadlist, 1, (SV *) newpad);
143
144 av = newAV (); /* will be @_ */
145 av_extend (av, 0);
146 av_store (newpad, 0, (SV *) av);
147 AvFLAGS (av) = AVf_REIFY;
148
149 for (ix = fpad; ix > 0; ix--)
150 {
151 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
152 if (namesv && namesv != &PL_sv_undef)
153 {
154 char *name = SvPVX (namesv); /* XXX */
155 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
156 { /* lexical from outside? */
157 npad[ix] = SvREFCNT_inc (ppad[ix]);
158 }
159 else
160 { /* our own lexical */
161 SV *sv;
162 if (*name == '&')
163 sv = SvREFCNT_inc (ppad[ix]);
164 else if (*name == '@')
165 sv = (SV *) newAV ();
166 else if (*name == '%')
167 sv = (SV *) newHV ();
168 else
169 sv = NEWSV (0, 0);
170 if (!SvPADBUSY (sv))
171 SvPADMY_on (sv);
172 npad[ix] = sv;
173 }
174 }
175 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
176 {
177 npad[ix] = SvREFCNT_inc (ppad[ix]);
178 }
179 else
180 {
181 SV *sv = NEWSV (0, 0);
182 SvPADTMP_on (sv);
183 npad[ix] = sv;
184 }
185 }
186
187#if 0 /* return -ENOTUNDERSTOOD */
188 /* Now that vars are all in place, clone nested closures. */
189
190 for (ix = fpad; ix > 0; ix--) {
191 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
192 if (namesv
193 && namesv != &PL_sv_undef
194 && !(SvFLAGS(namesv) & SVf_FAKE)
195 && *SvPVX(namesv) == '&'
196 && CvCLONE(ppad[ix]))
197 {
198 CV *kid = cv_clone((CV*)ppad[ix]);
199 SvREFCNT_dec(ppad[ix]);
200 CvCLONE_on(kid);
201 SvPADMY_on(kid);
202 npad[ix] = (SV*)kid;
203 }
204 }
205#endif
206
207 return newpadlist;
208}
209
210#ifdef MAY_FLUSH
211STATIC AV *
212free_padlist (AV *padlist)
213{
214 /* may be during global destruction */
215 if (SvREFCNT(padlist))
216 {
217 I32 i = AvFILLp(padlist);
218 while (i >= 0)
219 {
220 SV **svp = av_fetch(padlist, i--, FALSE);
221 SV *sv = svp ? *svp : Nullsv;
222 if (sv)
223 SvREFCNT_dec(sv);
224 }
225
226 SvREFCNT_dec((SV*)padlist);
227 }
228}
229#endif
230
231/* the next two functions merely cache the padlists */
101STATIC void 232STATIC void
102S_nuke_stacks(pTHX) 233get_padlist (CV *cv)
103{ 234{
104 while (PL_curstackinfo->si_next) 235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
105 PL_curstackinfo = PL_curstackinfo->si_next; 236
106 while (PL_curstackinfo) { 237 if (he && AvFILLp ((AV *)*he) >= 0)
107 PERL_SI *p = PL_curstackinfo->si_prev; 238 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
108 /* curstackinfo->si_stack got nuked by sv_free_arenas() */ 239 else
109 Safefree(PL_curstackinfo->si_cxstack); 240 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
110 Safefree(PL_curstackinfo); 241}
111 PL_curstackinfo = p; 242
243STATIC void
244put_padlist (CV *cv)
245{
246 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
247
248 if (SvTYPE (*he) != SVt_PVAV)
249 {
250 SvREFCNT_dec (*he);
251 *he = (SV *)newAV ();
112 } 252 }
253
254 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
255}
256
257#ifdef MAY_FLUSH
258STATIC void
259flush_padlist_cache ()
260{
261 HV *hv = padlist_cache;
262 padlist_cache = newHV ();
263
264 if (hv_iterinit (hv))
265 {
266 HE *he;
267 AV *padlist;
268
269 while (!!(he = hv_iternext (hv)))
270 {
271 AV *av = (AV *)HeVAL(he);
272
273 /* casting is fun. */
274 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
275 free_padlist (padlist);
276 }
277 }
278
279 SvREFCNT_dec (hv);
280}
281#endif
282
283#define SB do {
284#define SE } while (0)
285
286#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
287#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
288
289#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
290
291static void
292load_state(pTHX_ Coro__State c)
293{
294 PL_dowarn = c->dowarn;
295
296 PL_curstackinfo = c->curstackinfo;
297 PL_curstack = c->curstack;
298 PL_mainstack = c->mainstack;
299 PL_stack_sp = c->stack_sp;
300 PL_op = c->op;
301 PL_curpad = c->curpad;
302 PL_stack_base = c->stack_base;
303 PL_stack_max = c->stack_max;
304 PL_tmps_stack = c->tmps_stack;
305 PL_tmps_floor = c->tmps_floor;
306 PL_tmps_ix = c->tmps_ix;
307 PL_tmps_max = c->tmps_max;
308 PL_markstack = c->markstack;
309 PL_markstack_ptr = c->markstack_ptr;
310 PL_markstack_max = c->markstack_max;
311 PL_scopestack = c->scopestack;
312 PL_scopestack_ix = c->scopestack_ix;
313 PL_scopestack_max = c->scopestack_max;
314 PL_savestack = c->savestack;
315 PL_savestack_ix = c->savestack_ix;
316 PL_savestack_max = c->savestack_max;
317 PL_retstack = c->retstack;
318 PL_retstack_ix = c->retstack_ix;
319 PL_retstack_max = c->retstack_max;
320 PL_curcop = c->curcop;
321 PL_start_env = c->start_env;
322 PL_top_env = c->top_env;
323
324 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
325 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
326 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
327
328 {
329 dSP;
330 CV *cv;
331
332 /* now do the ugly restore mess */
333 while ((cv = (CV *)POPs))
334 {
335 AV *padlist = (AV *)POPs;
336
337 if (padlist)
338 {
339 put_padlist (cv); /* mark this padlist as available */
340 CvPADLIST(cv) = padlist;
341#ifdef USE_THREADS
342 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
343#endif
344 }
345
346 ++CvDEPTH(cv);
347 }
348
349 PUTBACK;
350 }
351}
352
353static void
354save_state(pTHX_ Coro__State c, int flags)
355{
356 {
357 dSP;
358 I32 cxix = cxstack_ix;
359 PERL_CONTEXT *ccstk = cxstack;
360 PERL_SI *top_si = PL_curstackinfo;
361
362 /*
363 * the worst thing you can imagine happens first - we have to save
364 * (and reinitialize) all cv's in the whole callchain :(
365 */
366
367 PUSHs (Nullsv);
368 /* this loop was inspired by pp_caller */
369 for (;;)
370 {
371 do
372 {
373 PERL_CONTEXT *cx = &ccstk[cxix--];
374
375 if (CxTYPE(cx) == CXt_SUB)
376 {
377 CV *cv = cx->blk_sub.cv;
378 if (CvDEPTH(cv))
379 {
380#ifdef USE_THREADS
381 /*XPUSHs ((SV *)CvOWNER(cv));*/
382 /*CvOWNER(cv) = 0;*/
383 /*error must unlock this cv etc.. etc...*/
384#endif
385 EXTEND (SP, CvDEPTH(cv)*2);
386
387 while (--CvDEPTH(cv))
388 {
389 /* this tells the restore code to increment CvDEPTH */
390 PUSHs (Nullsv);
391 PUSHs ((SV *)cv);
392 }
393
394 PUSHs ((SV *)CvPADLIST(cv));
395 PUSHs ((SV *)cv);
396
397 get_padlist (cv); /* this is a monster */
398 }
399 }
400 else if (CxTYPE(cx) == CXt_FORMAT)
401 {
402 /* I never used formats, so how should I know how these are implemented? */
403 /* my bold guess is as a simple, plain sub... */
404 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
405 }
406 }
407 while (cxix >= 0);
408
409 if (top_si->si_type == PERLSI_MAIN)
410 break;
411
412 top_si = top_si->si_prev;
413 ccstk = top_si->si_cxstack;
414 cxix = top_si->si_cxix;
415 }
416
417 PUTBACK;
418 }
419
420 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
421 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
422 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
423
424 /* I have not the slightest idea of why av_reify is necessary */
425 /* but if it's missing the defav contents magically get replaced sometimes */
426 if (c->defav)
427 av_reify (c->defav);
428
429 c->dowarn = PL_dowarn;
430
431 c->curstackinfo = PL_curstackinfo;
432 c->curstack = PL_curstack;
433 c->mainstack = PL_mainstack;
434 c->stack_sp = PL_stack_sp;
435 c->op = PL_op;
436 c->curpad = PL_curpad;
437 c->stack_base = PL_stack_base;
438 c->stack_max = PL_stack_max;
439 c->tmps_stack = PL_tmps_stack;
440 c->tmps_floor = PL_tmps_floor;
441 c->tmps_ix = PL_tmps_ix;
442 c->tmps_max = PL_tmps_max;
443 c->markstack = PL_markstack;
444 c->markstack_ptr = PL_markstack_ptr;
445 c->markstack_max = PL_markstack_max;
446 c->scopestack = PL_scopestack;
447 c->scopestack_ix = PL_scopestack_ix;
448 c->scopestack_max = PL_scopestack_max;
449 c->savestack = PL_savestack;
450 c->savestack_ix = PL_savestack_ix;
451 c->savestack_max = PL_savestack_max;
452 c->retstack = PL_retstack;
453 c->retstack_ix = PL_retstack_ix;
454 c->retstack_max = PL_retstack_max;
455 c->curcop = PL_curcop;
456 c->start_env = PL_start_env;
457 c->top_env = PL_top_env;
458}
459
460/*
461 * allocate various perl stacks. This is an exact copy
462 * of perl.c:init_stacks, except that it uses less memory
463 * on the assumption that coroutines do not usually need
464 * a lot of stackspace.
465 */
466STATIC void
467coro_init_stacks (pTHX)
468{
469 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
470 PL_curstackinfo->si_type = PERLSI_MAIN;
471 PL_curstack = PL_curstackinfo->si_stack;
472 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
473
474 PL_stack_base = AvARRAY(PL_curstack);
475 PL_stack_sp = PL_stack_base;
476 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
477
478 New(50,PL_tmps_stack,96,SV*);
479 PL_tmps_floor = -1;
480 PL_tmps_ix = -1;
481 PL_tmps_max = 96;
482
483 New(54,PL_markstack,16,I32);
484 PL_markstack_ptr = PL_markstack;
485 PL_markstack_max = PL_markstack + 16;
486
487 SET_MARK_OFFSET;
488
489 New(54,PL_scopestack,16,I32);
490 PL_scopestack_ix = 0;
491 PL_scopestack_max = 16;
492
493 New(54,PL_savestack,96,ANY);
494 PL_savestack_ix = 0;
495 PL_savestack_max = 96;
496
497 New(54,PL_retstack,8,OP*);
498 PL_retstack_ix = 0;
499 PL_retstack_max = 8;
500}
501
502/*
503 * destroy the stacks, the callchain etc...
504 * still there is a memleak of 128 bytes...
505 */
506STATIC void
507destroy_stacks(pTHX)
508{
509 /* is this ugly, I ask? */
510 while (PL_scopestack_ix)
511 LEAVE;
512
513 /* sure it is, but more important: is it correct?? :/ */
514 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
515 FREETMPS;
516
517 while (PL_curstackinfo->si_next)
518 PL_curstackinfo = PL_curstackinfo->si_next;
519
520 while (PL_curstackinfo)
521 {
522 PERL_SI *p = PL_curstackinfo->si_prev;
523
524 {
525 dSP;
526 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
527 PUTBACK; /* possibly superfluous */
528 }
529
530 dounwind(-1);
531
532 SvREFCNT_dec(PL_curstackinfo->si_stack);
533 Safefree(PL_curstackinfo->si_cxstack);
534 Safefree(PL_curstackinfo);
535 PL_curstackinfo = p;
536 }
537
113 Safefree(PL_tmps_stack); 538 Safefree(PL_tmps_stack);
114 Safefree(PL_markstack); 539 Safefree(PL_markstack);
115 Safefree(PL_scopestack); 540 Safefree(PL_scopestack);
116 Safefree(PL_savestack); 541 Safefree(PL_savestack);
117 Safefree(PL_retstack); 542 Safefree(PL_retstack);
118} 543}
119 544
545static void
546allocate_stack (Coro__State ctx, int alloc)
547{
548 coro_stack *stack;
549
550 New (0, stack, 1, coro_stack);
551
552 stack->refcnt = 1;
553 stack->usecnt = 1;
554 stack->gencnt = ctx->gencnt = 0;
555 if (alloc)
556 {
557#ifdef HAVE_MMAP
558 stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write */
559 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
560 if (stack->sptr == (void *)-1)
561#endif
562 {
563 /*FIXME*//*D*//* reasonable stack size! */
564 stack->ssize = -4096 * sizeof (long);
565 New (0, stack->sptr, 4096, long);
566 }
567 }
568 else
569 stack->sptr = 0;
570
571 ctx->stack = stack;
572}
573
574static void
575deallocate_stack (Coro__State ctx)
576{
577 coro_stack *stack = ctx->stack;
578
579 ctx->stack = 0;
580
581 if (stack)
582 {
583 if (!--stack->refcnt)
584 {
585#ifdef HAVE_MMAP
586 if (stack->ssize > 0 && stack->sptr)
587 munmap (stack->sptr, stack->ssize);
588 else
589#else
590 Safefree (stack->sptr);
591#endif
592 Safefree (stack);
593 }
594 else if (ctx->gencnt == stack->gencnt)
595 --stack->usecnt;
596 }
597}
598
599static void
600setup_coro (void *arg)
601{
602 /*
603 * emulate part of the perl startup here.
604 */
605 dSP;
606 Coro__State ctx = (Coro__State)arg;
607 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
608
609 coro_init_stacks (aTHX);
610 JMPENV_BOOTSTRAP;
611 SPAGAIN;
612
613 /*PL_curcop = 0;*/
614 SvREFCNT_dec (GvAV (PL_defgv));
615 GvAV (PL_defgv) = ctx->args;
616
617 if (ctx->stack)
618 {
619 ctx->cursp = 0;
620
621 PUSHMARK(SP);
622 PUTBACK;
623 (void) call_sv (sub_init, G_VOID|G_NOARGS);
624 croak ("FATAL: CCTXT coroutine returned!");
625 }
626 else
627 {
628 UNOP myop;
629
630 PL_op = (OP *)&myop;
631
632 Zero(&myop, 1, UNOP);
633 myop.op_next = Nullop;
634 myop.op_flags = OPf_WANT_VOID;
635
636 PUSHMARK(SP);
637 XPUSHs (sub_init);
638 /*
639 * the next line is slightly wrong, as PL_op->op_next
640 * is actually being executed so we skip the first op.
641 * that doesn't matter, though, since it is only
642 * pp_nextstate and we never return...
643 * ah yes, and I don't care anyways ;)
644 */
645 PUTBACK;
646 PL_op = pp_entersub();
647 SPAGAIN;
648
649 ENTER; /* necessary e.g. for dounwind */
650 }
651}
652
653static void
654continue_coro (void *arg)
655{
656 /*
657 * this is a _very_ stripped down perl interpreter ;)
658 */
659 Coro__State ctx = (Coro__State)arg;
660
661 ctx->cursp = 0;
662 PL_op = PL_op->op_next;
663 CALLRUNOPS(aTHX);
664 /*NORETURN*/
665 abort ();
666}
667
668STATIC void
669transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
670{
671 dSP;
672 dSTACKLEVEL;
673
674 if (prev != next)
675 {
676 if (next->mainstack)
677 {
678 SAVE (prev, flags);
679 LOAD (next);
680
681 /* mark this state as in-use */
682 next->mainstack = 0;
683 next->tmps_ix = -2;
684
685 /* stacklevel changed? if yes, grab the stack for us! */
686 if (flags & TRANSFER_SAVE_CCTXT)
687 {
688 if (!prev->stack)
689 allocate_stack (prev, 0);
690 else if (prev->cursp != stacklevel
691 && prev->stack->usecnt > 1)
692 {
693 prev->gencnt = ++prev->stack->gencnt;
694 prev->stack->usecnt = 1;
695 }
696
697 /* has our stack been invalidated? */
698 if (next->stack && next->stack->gencnt != next->gencnt)
699 {
700 deallocate_stack (next);
701 allocate_stack (next, 1);
702 coro_create (&(next->stack->cctx),
703 continue_coro, (void *)next,
704 next->stack->sptr, labs (next->stack->ssize));
705 }
706
707 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
708 }
709
710 }
711 else if (next->tmps_ix == -2)
712 croak ("tried to transfer to running coroutine");
713 else
714 {
715 SAVE (prev, -1); /* first get rid of the old state */
716
717 if (flags & TRANSFER_SAVE_CCTXT)
718 {
719 if (!prev->stack)
720 allocate_stack (prev, 0);
721
722 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
723 {
724 setup_coro (next);
725
726 prev->stack->refcnt++;
727 prev->stack->usecnt++;
728 next->stack = prev->stack;
729 next->gencnt = prev->gencnt;
730 }
731 else
732 {
733 allocate_stack (next, 1);
734 coro_create (&(next->stack->cctx),
735 setup_coro, (void *)next,
736 next->stack->sptr, labs (next->stack->ssize));
737 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
738 }
739 }
740 else
741 setup_coro (next);
742 }
743 }
744
745 next->cursp = stacklevel;
746}
747
120MODULE = Coro::State PACKAGE = Coro::State 748MODULE = Coro::State PACKAGE = Coro::State
121 749
122PROTOTYPES: ENABLE 750PROTOTYPES: ENABLE
123 751
752BOOT:
753{ /* {} necessary for stoopid perl-5.6.x */
754 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
755 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
756 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
757
758 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
759 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
760 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
761 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
762
763 if (!padlist_cache)
764 padlist_cache = newHV ();
765
766 main_mainstack = PL_mainstack;
767}
768
124Coro::State 769Coro::State
125newprocess(proc) 770_newprocess(args)
126 SV * proc 771 SV * args
127 PROTOTYPE: & 772 PROTOTYPE: $
128 CODE: 773 CODE:
129 Coro__State coro; 774 Coro__State coro;
775
776 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
777 croak ("Coro::State::_newprocess expects an arrayref");
130 778
131 New (0, coro, 1, struct coro); 779 New (0, coro, 1, struct coro);
132 780
781 coro->args = (AV *)SvREFCNT_inc (SvRV (args));
133 coro->mainstack = 0; /* actual work is done inside transfer */ 782 coro->mainstack = 0; /* actual work is done inside transfer */
134 coro->proc = SvREFCNT_inc (proc); 783 coro->stack = 0;
135 784
136 RETVAL = coro; 785 RETVAL = coro;
137 OUTPUT: 786 OUTPUT:
138 RETVAL 787 RETVAL
139 788
140void 789void
141transfer(prev,next) 790transfer(prev, next, flags = TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK)
142 Coro::State_or_hashref prev 791 Coro::State_or_hashref prev
143 Coro::State_or_hashref next 792 Coro::State_or_hashref next
793 int flags
794 PROTOTYPE: @
144 CODE: 795 CODE:
145 796 transfer (aTHX_ prev, next, flags);
146 if (prev != next)
147 {
148 PUTBACK;
149 SAVE (prev);
150
151 /*
152 * this could be done in newprocess which would to
153 * extremely elegant and fast (just PUTBACK/SAVE/LOAD/SPAGAIN)
154 * code here, but lazy allocation of stacks has also
155 * some virtues and the overhead of the if() is nil.
156 */
157 if (next->mainstack)
158 {
159 LOAD (next);
160 next->mainstack = 0; /* unnecessary but much cleaner */
161 SPAGAIN;
162 }
163 else
164 {
165 /*
166 * emulate part of the perl startup here.
167 */
168 UNOP myop;
169
170 init_stacks ();
171 PL_op = (OP *)&myop;
172 /*PL_curcop = 0;*/
173 GvAV (PL_defgv) = newAV ();
174
175 SPAGAIN;
176 Zero(&myop, 1, UNOP);
177 myop.op_next = Nullop;
178 myop.op_flags = OPf_WANT_VOID;
179
180 EXTEND (SP,1);
181 PUSHs (next->proc);
182
183 PUTBACK;
184 /*
185 * the next line is slightly wrong, as PL_op->op_next
186 * is actually being executed so we skip the first op
187 * that doens't matter, though, since it is only
188 * pp_nextstate and we never return...
189 */
190 PL_op = Perl_pp_entersub(aTHX);
191 SPAGAIN;
192
193 ENTER;
194 }
195 }
196 797
197void 798void
198DESTROY(coro) 799DESTROY(coro)
199 Coro::State coro 800 Coro::State coro
200 CODE: 801 CODE:
201 802
202 if (coro->mainstack) 803 if (coro->mainstack && coro->mainstack != main_mainstack)
203 { 804 {
204 struct coro temp; 805 struct coro temp;
205 806
206 PUTBACK; 807 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
207 SAVE((&temp));
208 LOAD(coro); 808 LOAD(aTHX_ coro);
209 809
210 S_nuke_stacks (); 810 destroy_stacks (aTHX);
211 SvREFCNT_dec ((SV *)GvAV (PL_defgv));
212 811
213 LOAD((&temp)); 812 LOAD((&temp)); /* this will get rid of defsv etc.. */
214 SPAGAIN; 813
814 coro->mainstack = 0;
215 } 815 }
216 816
217 SvREFCNT_dec (coro->proc); 817 deallocate_stack (coro);
818
218 Safefree (coro); 819 Safefree (coro);
219 820
821void
822flush()
823 CODE:
824#ifdef MAY_FLUSH
825 flush_padlist_cache ();
826#endif
220 827
828MODULE = Coro::State PACKAGE = Coro::Cont
829
830# this is slightly dirty
831
832void
833yield(...)
834 PROTOTYPE: @
835 CODE:
836 static SV *returnstk;
837 SV *sv;
838 AV *defav = GvAV (PL_defgv);
839 struct coro *prev, *next;
840
841 if (!returnstk)
842 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
843
844 /* set up @_ -- ugly */
845 av_clear (defav);
846 av_fill (defav, items - 1);
847 while (items--)
848 av_store (defav, items, SvREFCNT_inc (ST(items)));
849
850 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
851 sv = av_pop ((AV *)SvRV (returnstk));
852 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
853 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
854 SvREFCNT_dec (sv);
855
856 transfer(aTHX_ prev, next, 0);
857

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines