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.1 by root, Sat Jul 14 22:14:21 2001 UTC vs.
Revision 1.94 by root, Sun Nov 26 17:14:15 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
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 <stdio.h>
33#include <errno.h>
34
35#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
36# undef STACKGUARD
37#endif
38
39#ifndef STACKGUARD
40# define STACKGUARD 0
41#endif
42
43#ifdef HAVE_MMAP
44# include <unistd.h>
45# include <sys/mman.h>
46# ifndef MAP_ANONYMOUS
47# ifdef MAP_ANON
48# define MAP_ANONYMOUS MAP_ANON
49# else
50# undef HAVE_MMAP
51# endif
52# endif
53# include <limits.h>
54# ifndef PAGESIZE
55# define PAGESIZE pagesize
56# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
57static long pagesize;
58# else
59# define BOOT_PAGESIZE
60# endif
61#endif
62
63/* The next macro should declare a variable stacklevel that contains and approximation
64 * to the current C stack pointer. Its property is that it changes with each call
65 * and should be unique. */
66#define dSTACKLEVEL int stacklevel
67#define STACKLEVEL ((void *)&stacklevel)
68
69#define IN_DESTRUCT (PL_main_cv == Nullcv)
70
71#include "CoroAPI.h"
72
73#define TRANSFER_SET_STACKLEVEL 0x8bfbfbfb /* magic cookie */
74
75#ifdef USE_ITHREADS
76static perl_mutex coro_mutex;
77# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
78# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
79#else
80# define LOCK (void)0
81# define UNLOCK (void)0
82#endif
83
84static struct CoroAPI coroapi;
85static AV *main_mainstack; /* used to differentiate between $main and others */
86static HV *coro_state_stash, *coro_stash;
87static SV *coro_mortal; /* will be freed after next transfer */
88
89/* this is a structure representing a c-level coroutine */
90typedef struct coro_stack {
91 struct coro_stack *next;
92
93 /* the stack */
94 void *sptr;
95 long ssize; /* positive == mmap, otherwise malloc */
96
97 /* cpu state */
98 void *idle_sp; /* original stacklevel when coroutine was created */
99 JMPENV *top_env;
100 coro_context cctx;
101} coro_stack;
102
103/* the (fake) coro_stack representing the main program */
104static coro_stack *main_stack;
105
106/* this is a structure representing a perl-level coroutine */
5struct coro { 107struct coro {
108 /* the c coroutine allocated to this perl coroutine, if any */
109 coro_stack *stack;
110
111 /* data associated with this coroutine (initial args) */
112 AV *args;
113 int refcnt;
114
115 /* optionally saved, might be zero */
116 AV *defav;
117 SV *defsv;
118 SV *errsv;
119
120 /* saved global state not related to stacks */
6 U8 dowarn; 121 U8 dowarn;
7 122 I32 in_eval;
123
124 /* the stacks and related info (callchain etc..) */
8 PERL_SI *curstackinfo; 125 PERL_SI *curstackinfo;
9 AV *curstack; 126 AV *curstack;
10 AV *mainstack; 127 AV *mainstack;
11 SV **stack_sp; 128 SV **stack_sp;
12 OP *op; 129 OP *op;
13 SV **curpad; 130 SV **curpad;
131 AV *comppad;
132 CV *compcv;
14 SV **stack_base; 133 SV **stack_base;
15 SV **stack_max; 134 SV **stack_max;
16 SV **tmps_stack; 135 SV **tmps_stack;
17 I32 tmps_floor; 136 I32 tmps_floor;
18 I32 tmps_ix; 137 I32 tmps_ix;
27 I32 savestack_ix; 146 I32 savestack_ix;
28 I32 savestack_max; 147 I32 savestack_max;
29 OP **retstack; 148 OP **retstack;
30 I32 retstack_ix; 149 I32 retstack_ix;
31 I32 retstack_max; 150 I32 retstack_max;
151 PMOP *curpm;
32 COP *curcop; 152 COP *curcop;
33 153
34 SV *proc; 154 /* coro process data */
155 int prio;
35}; 156};
36 157
37typedef struct coro *Coro__State; 158typedef struct coro *Coro__State;
38typedef struct coro *Coro__State_or_hashref; 159typedef struct coro *Coro__State_or_hashref;
39 160
40#define SAVE(c) \ 161static AV *
162coro_clone_padlist (pTHX_ CV *cv)
163{
164 AV *padlist = CvPADLIST (cv);
165 AV *newpadlist, *newpad;
166
167 newpadlist = newAV ();
168 AvREAL_off (newpadlist);
169#if PERL_VERSION < 9
170 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
171#else
172 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
173#endif
174 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
175 --AvFILLp (padlist);
176
177 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
178 av_store (newpadlist, 1, (SV *)newpad);
179
180 return newpadlist;
181}
182
183static void
184free_padlist (pTHX_ AV *padlist)
185{
186 /* may be during global destruction */
187 if (SvREFCNT (padlist))
188 {
189 I32 i = AvFILLp (padlist);
190 while (i >= 0)
191 {
192 SV **svp = av_fetch (padlist, i--, FALSE);
193 if (svp)
194 {
195 SV *sv;
196 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
197 SvREFCNT_dec (sv);
198
199 SvREFCNT_dec (*svp);
200 }
201 }
202
203 SvREFCNT_dec ((SV*)padlist);
204 }
205}
206
207static int
208coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
209{
210 AV *padlist;
211 AV *av = (AV *)mg->mg_obj;
212
213 /* casting is fun. */
214 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
215 free_padlist (aTHX_ padlist);
216
217 SvREFCNT_dec (av);
218
219 return 0;
220}
221
222#define PERL_MAGIC_coro PERL_MAGIC_ext
223
224static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
225
226/* the next two functions merely cache the padlists */
227static void
228get_padlist (pTHX_ CV *cv)
229{
230 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
231
232 if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
233 CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj);
234 else
235 {
236#if 0
237 /* this should work - but it doesn't :( */
238 CV *cp = Perl_cv_clone (aTHX_ cv);
239 CvPADLIST (cv) = CvPADLIST (cp);
240 CvPADLIST (cp) = 0;
241 SvREFCNT_dec (cp);
242#else
243 CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
244#endif
245 }
246}
247
248static void
249put_padlist (pTHX_ CV *cv)
250{
251 MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
252
253 if (!mg)
254 {
255 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
256 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
257 mg->mg_virtual = &vtbl_coro;
258 mg->mg_obj = (SV *)newAV ();
259 }
260
261 av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
262}
263
264#define SB do {
265#define SE } while (0)
266
267#define LOAD(state) load_state(aTHX_ (state));
268#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
269
270#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
271
272static void
273load_state(pTHX_ Coro__State c)
274{
275 PL_dowarn = c->dowarn;
276 PL_in_eval = c->in_eval;
277
278 PL_curstackinfo = c->curstackinfo;
279 PL_curstack = c->curstack;
280 PL_mainstack = c->mainstack;
281 PL_stack_sp = c->stack_sp;
282 PL_op = c->op;
283 PL_curpad = c->curpad;
284 PL_comppad = c->comppad;
285 PL_compcv = c->compcv;
286 PL_stack_base = c->stack_base;
287 PL_stack_max = c->stack_max;
288 PL_tmps_stack = c->tmps_stack;
289 PL_tmps_floor = c->tmps_floor;
290 PL_tmps_ix = c->tmps_ix;
291 PL_tmps_max = c->tmps_max;
292 PL_markstack = c->markstack;
293 PL_markstack_ptr = c->markstack_ptr;
294 PL_markstack_max = c->markstack_max;
295 PL_scopestack = c->scopestack;
296 PL_scopestack_ix = c->scopestack_ix;
297 PL_scopestack_max = c->scopestack_max;
298 PL_savestack = c->savestack;
299 PL_savestack_ix = c->savestack_ix;
300 PL_savestack_max = c->savestack_max;
301#if PERL_VERSION < 9
302 PL_retstack = c->retstack;
303 PL_retstack_ix = c->retstack_ix;
304 PL_retstack_max = c->retstack_max;
305#endif
306 PL_curpm = c->curpm;
307 PL_curcop = c->curcop;
308
309 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
310 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
311 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
312
313 {
314 dSP;
315 CV *cv;
316
317 /* now do the ugly restore mess */
318 while ((cv = (CV *)POPs))
319 {
320 AV *padlist = (AV *)POPs;
321
322 if (padlist)
323 {
324 put_padlist (aTHX_ cv); /* mark this padlist as available */
325 CvPADLIST(cv) = padlist;
326 }
327
328 ++CvDEPTH(cv);
329 }
330
331 PUTBACK;
332 }
333}
334
335static void
336save_state(pTHX_ Coro__State c, int flags)
337{
338 {
339 dSP;
340 I32 cxix = cxstack_ix;
341 PERL_CONTEXT *ccstk = cxstack;
342 PERL_SI *top_si = PL_curstackinfo;
343
344 /*
345 * the worst thing you can imagine happens first - we have to save
346 * (and reinitialize) all cv's in the whole callchain :(
347 */
348
349 PUSHs (Nullsv);
350 /* this loop was inspired by pp_caller */
351 for (;;)
352 {
353 while (cxix >= 0)
354 {
355 PERL_CONTEXT *cx = &ccstk[cxix--];
356
357 if (CxTYPE(cx) == CXt_SUB)
358 {
359 CV *cv = cx->blk_sub.cv;
360 if (CvDEPTH(cv))
361 {
362 EXTEND (SP, CvDEPTH(cv)*2);
363
364 while (--CvDEPTH(cv))
365 {
366 /* this tells the restore code to increment CvDEPTH */
367 PUSHs (Nullsv);
368 PUSHs ((SV *)cv);
369 }
370
371 PUSHs ((SV *)CvPADLIST(cv));
372 PUSHs ((SV *)cv);
373
374 get_padlist (aTHX_ cv);
375 }
376 }
377#ifdef CXt_FORMAT
378 else if (CxTYPE(cx) == CXt_FORMAT)
379 {
380 /* I never used formats, so how should I know how these are implemented? */
381 /* my bold guess is as a simple, plain sub... */
382 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
383 }
384#endif
385 }
386
387 if (top_si->si_type == PERLSI_MAIN)
388 break;
389
390 top_si = top_si->si_prev;
391 ccstk = top_si->si_cxstack;
392 cxix = top_si->si_cxix;
393 }
394
395 PUTBACK;
396 }
397
398 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
399 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
400 c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
401
41 c->dowarn = PL_dowarn; \ 402 c->dowarn = PL_dowarn;
403 c->in_eval = PL_in_eval;
404
42 c->curstackinfo = PL_curstackinfo; \ 405 c->curstackinfo = PL_curstackinfo;
43 c->curstack = PL_curstack; \ 406 c->curstack = PL_curstack;
44 c->mainstack = PL_mainstack; \ 407 c->mainstack = PL_mainstack;
45 c->stack_sp = PL_stack_sp; \ 408 c->stack_sp = PL_stack_sp;
46 c->op = PL_op; \ 409 c->op = PL_op;
47 c->curpad = PL_curpad; \ 410 c->curpad = PL_curpad;
411 c->comppad = PL_comppad;
412 c->compcv = PL_compcv;
48 c->stack_base = PL_stack_base; \ 413 c->stack_base = PL_stack_base;
49 c->stack_max = PL_stack_max; \ 414 c->stack_max = PL_stack_max;
50 c->tmps_stack = PL_tmps_stack; \ 415 c->tmps_stack = PL_tmps_stack;
51 c->tmps_floor = PL_tmps_floor; \ 416 c->tmps_floor = PL_tmps_floor;
52 c->tmps_ix = PL_tmps_ix; \ 417 c->tmps_ix = PL_tmps_ix;
53 c->tmps_max = PL_tmps_max; \ 418 c->tmps_max = PL_tmps_max;
54 c->markstack = PL_markstack; \ 419 c->markstack = PL_markstack;
55 c->markstack_ptr = PL_markstack_ptr; \ 420 c->markstack_ptr = PL_markstack_ptr;
56 c->markstack_max = PL_markstack_max; \ 421 c->markstack_max = PL_markstack_max;
57 c->scopestack = PL_scopestack; \ 422 c->scopestack = PL_scopestack;
58 c->scopestack_ix = PL_scopestack_ix; \ 423 c->scopestack_ix = PL_scopestack_ix;
59 c->scopestack_max = PL_scopestack_max;\ 424 c->scopestack_max = PL_scopestack_max;
60 c->savestack = PL_savestack; \ 425 c->savestack = PL_savestack;
61 c->savestack_ix = PL_savestack_ix; \ 426 c->savestack_ix = PL_savestack_ix;
62 c->savestack_max = PL_savestack_max; \ 427 c->savestack_max = PL_savestack_max;
428#if PERL_VERSION < 9
63 c->retstack = PL_retstack; \ 429 c->retstack = PL_retstack;
64 c->retstack_ix = PL_retstack_ix; \ 430 c->retstack_ix = PL_retstack_ix;
65 c->retstack_max = PL_retstack_max; \ 431 c->retstack_max = PL_retstack_max;
432#endif
433 c->curpm = PL_curpm;
66 c->curcop = PL_curcop; 434 c->curcop = PL_curcop;
435}
67 436
68#define LOAD(c) \ 437/*
69 PL_dowarn = c->dowarn; \ 438 * allocate various perl stacks. This is an exact copy
70 PL_curstackinfo = c->curstackinfo; \ 439 * of perl.c:init_stacks, except that it uses less memory
71 PL_curstack = c->curstack; \ 440 * on the (sometimes correct) assumption that coroutines do
72 PL_mainstack = c->mainstack; \ 441 * not usually need a lot of stackspace.
73 PL_stack_sp = c->stack_sp; \ 442 */
74 PL_op = c->op; \ 443static void
75 PL_curpad = c->curpad; \ 444coro_init_stacks (pTHX)
76 PL_stack_base = c->stack_base; \
77 PL_stack_max = c->stack_max; \
78 PL_tmps_stack = c->tmps_stack; \
79 PL_tmps_floor = c->tmps_floor; \
80 PL_tmps_ix = c->tmps_ix; \
81 PL_tmps_max = c->tmps_max; \
82 PL_markstack = c->markstack; \
83 PL_markstack_ptr = c->markstack_ptr; \
84 PL_markstack_max = c->markstack_max; \
85 PL_scopestack = c->scopestack; \
86 PL_scopestack_ix = c->scopestack_ix; \
87 PL_scopestack_max = c->scopestack_max;\
88 PL_savestack = c->savestack; \
89 PL_savestack_ix = c->savestack_ix; \
90 PL_savestack_max = c->savestack_max; \
91 PL_retstack = c->retstack; \
92 PL_retstack_ix = c->retstack_ix; \
93 PL_retstack_max = c->retstack_max; \
94 PL_curcop = c->curcop;
95
96/* this is an EXACT copy of S_nuke_stacks in perl.c, which is unfortunately static */
97STATIC void
98S_nuke_stacks(pTHX)
99{ 445{
100 while (PL_curstackinfo->si_next) 446 LOCK;
447
448 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
449 PL_curstackinfo->si_type = PERLSI_MAIN;
101 PL_curstackinfo = PL_curstackinfo->si_next; 450 PL_curstack = PL_curstackinfo->si_stack;
102 while (PL_curstackinfo) { 451 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
103 PERL_SI *p = PL_curstackinfo->si_prev; 452
104 /* curstackinfo->si_stack got nuked by sv_free_arenas() */ 453 PL_stack_base = AvARRAY(PL_curstack);
105 Safefree(PL_curstackinfo->si_cxstack); 454 PL_stack_sp = PL_stack_base;
106 Safefree(PL_curstackinfo); 455 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
107 PL_curstackinfo = p; 456
457 New(50,PL_tmps_stack,96,SV*);
458 PL_tmps_floor = -1;
459 PL_tmps_ix = -1;
460 PL_tmps_max = 96;
461
462 New(54,PL_markstack,16,I32);
463 PL_markstack_ptr = PL_markstack;
464 PL_markstack_max = PL_markstack + 16;
465
466#ifdef SET_MARK_OFFSET
467 SET_MARK_OFFSET;
468#endif
469
470 New(54,PL_scopestack,16,I32);
471 PL_scopestack_ix = 0;
472 PL_scopestack_max = 16;
473
474 New(54,PL_savestack,96,ANY);
475 PL_savestack_ix = 0;
476 PL_savestack_max = 96;
477
478#if PERL_VERSION < 9
479 New(54,PL_retstack,8,OP*);
480 PL_retstack_ix = 0;
481 PL_retstack_max = 8;
482#endif
483
484 UNLOCK;
485}
486
487/*
488 * destroy the stacks, the callchain etc...
489 */
490static void
491destroy_stacks(pTHX)
492{
493 if (!IN_DESTRUCT)
494 {
495 /* is this ugly, I ask? */
496 LEAVE_SCOPE (0);
497
498 /* sure it is, but more important: is it correct?? :/ */
499 FREETMPS;
500
501 /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
108 } 502 }
503
504 while (PL_curstackinfo->si_next)
505 PL_curstackinfo = PL_curstackinfo->si_next;
506
507 while (PL_curstackinfo)
508 {
509 PERL_SI *p = PL_curstackinfo->si_prev;
510
511 { /*D*//*remove*/
512 dSP;
513 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
514 PUTBACK; /* possibly superfluous */
515 }
516
517 if (!IN_DESTRUCT)
518 {
519 dounwind (-1);/*D*//*remove*/
520 SvREFCNT_dec (PL_curstackinfo->si_stack);
521 }
522
523 Safefree (PL_curstackinfo->si_cxstack);
524 Safefree (PL_curstackinfo);
525 PL_curstackinfo = p;
526 }
527
109 Safefree(PL_tmps_stack); 528 Safefree (PL_tmps_stack);
110 Safefree(PL_markstack); 529 Safefree (PL_markstack);
111 Safefree(PL_scopestack); 530 Safefree (PL_scopestack);
112 Safefree(PL_savestack); 531 Safefree (PL_savestack);
532#if PERL_VERSION < 9
113 Safefree(PL_retstack); 533 Safefree (PL_retstack);
534#endif
114} 535}
115 536
537static void
538setup_coro (struct coro *coro)
539{
540 /*
541 * emulate part of the perl startup here.
542 */
543 dTHX;
544 dSP;
545 UNOP myop;
546 SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
547
548 coro_init_stacks (aTHX);
549 /*PL_curcop = 0;*/
550 /*PL_in_eval = PL_in_eval;*/ /* inherit */
551 SvREFCNT_dec (GvAV (PL_defgv));
552 GvAV (PL_defgv) = coro->args; coro->args = 0;
553
554 SPAGAIN;
555
556 Zero (&myop, 1, UNOP);
557 myop.op_next = Nullop;
558 myop.op_flags = OPf_WANT_VOID;
559
560 PL_op = (OP *)&myop;
561
562 PUSHMARK(SP);
563 XPUSHs (sub_init);
564 PUTBACK;
565 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
566 SPAGAIN;
567
568 ENTER; /* necessary e.g. for dounwind */
569}
570
571static void
572free_coro_mortal ()
573{
574 if (coro_mortal)
575 {
576 SvREFCNT_dec (coro_mortal);
577 coro_mortal = 0;
578 }
579}
580
581static void
582coro_run (void *arg)
583{
584 /*
585 * this is a _very_ stripped down perl interpreter ;)
586 */
587 dTHX;
588 int ret;
589
590 UNLOCK;
591
592 PL_top_env = &PL_start_env;
593
594 sv_setiv (get_sv ("Coro::State::cctx_stack", FALSE), PTR2IV ((coro_stack *)arg));
595 sv_setiv (get_sv ("Coro::State::cctx_restartop", FALSE), PTR2IV (PL_op));
596
597 /* continue at cctx_init, without entersub */
598 PL_restartop = CvSTART (get_cv ("Coro::State::cctx_init", FALSE));
599
600 /* somebody will hit me for both perl_run and PL_restartop */
601 ret = perl_run (aTHX_ PERL_GET_CONTEXT);
602 printf ("ret %d\n", ret);//D
603
604 fputs ("FATAL: C coroutine fell over the edge of the world, aborting.\n", stderr);
605 abort ();
606}
607
608static coro_stack *
609stack_new ()
610{
611 coro_stack *stack;
612
613 New (0, stack, 1, coro_stack);
614
615#if HAVE_MMAP
616
617 stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
618 /* mmap suppsedly does allocate-on-write for us */
619 stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
620
621 if (stack->sptr == (void *)-1)
622 {
623 perror ("FATAL: unable to mmap stack for coroutine");
624 _exit (EXIT_FAILURE);
625 }
626
627# if STACKGUARD
628 mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
629# endif
630
631#else
632
633 stack->ssize = STACKSIZE * (long)sizeof (long);
634 New (0, stack->sptr, STACKSIZE, long);
635
636 if (!stack->sptr)
637 {
638 perror (stderr, "FATAL: unable to malloc stack for coroutine");
639 _exit (EXIT_FAILURE);
640 }
641
642#endif
643
644 coro_create (&stack->cctx, coro_run, (void *)stack, stack->sptr, stack->ssize);
645
646 return stack;
647}
648
649static void
650stack_free (coro_stack *stack)
651{
652 if (!stack || stack == main_stack)
653 return;
654
655#if HAVE_MMAP
656 munmap (stack->sptr, stack->ssize);
657#else
658 Safefree (stack->sptr);
659#endif
660
661 Safefree (stack);
662}
663
664static coro_stack *stack_first;
665
666static coro_stack *
667stack_get ()
668{
669 coro_stack *stack;
670
671 if (stack_first)
672 {
673 stack = stack_first;
674 stack_first = stack->next;
675 }
676 else
677 {
678 stack = stack_new ();
679 PL_op = PL_op->op_next;
680 }
681
682 return stack;
683}
684
685static void
686stack_put (coro_stack *stack)
687{
688 stack->next = stack_first;
689 stack_first = stack;
690}
691
692/* never call directly, always through the coro_state_transfer global variable */
693static void
694transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags)
695{
696 dSTACKLEVEL;
697
698 /* sometimes transfer is only called to set idle_sp */
699 if (flags == TRANSFER_SET_STACKLEVEL)
700 ((coro_stack *)prev)->idle_sp = STACKLEVEL;
701 else if (prev != next)
702 {
703 coro_stack *prev__stack;
704
705 LOCK;
706
707 if (next->mainstack)
708 {
709 /* coroutine already started */
710 SAVE (prev, flags);
711 LOAD (next);
712 }
713 else
714 {
715 /* need to start coroutine */
716 /* first get rid of the old state */
717 SAVE (prev, -1);
718 /* setup coroutine call */
719 setup_coro (next);
720 /* need a stack */
721 next->stack = 0;
722 }
723
724 prev__stack = prev->stack;
725
726 /* possibly "free" the stack */
727 if (prev__stack->idle_sp == STACKLEVEL)
728 {
729 stack_put (prev__stack);
730 prev->stack = 0;
731 }
732
733 if (!next->stack)
734 next->stack = stack_get ();
735
736 if (prev__stack != next->stack)
737 {
738 prev__stack->top_env = PL_top_env;
739 PL_top_env = next->stack->top_env;
740 printf ("stacksw %p %p\n", prev__stack->idle_sp, next->stack->idle_sp);//D
741 coro_transfer (&prev__stack->cctx, &next->stack->cctx);
742 }
743
744 free_coro_mortal ();
745
746 UNLOCK;
747 }
748}
749
750/* use this function pointer to call the above function */
751/* this is done to increase chances of the compiler not inlining the call */
752/* not static to make it even harder for the compiler (and theoretically impossible in most cases */
753void (*coro_state_transfer)(pTHX_ struct coro *prev, struct coro *next, int flags) = transfer_impl;
754
755struct transfer_args
756{
757 struct coro *prev, *next;
758 int flags;
759};
760
761#define TRANSFER(ta) coro_state_transfer ((ta).prev, (ta).next, (ta).flags)
762
763static void
764coro_state_destroy (struct coro *coro)
765{
766 if (coro->refcnt--)
767 return;
768
769 if (coro->mainstack && coro->mainstack != main_mainstack)
770 {
771 struct coro temp;
772
773 SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
774 LOAD (aTHX_ coro);
775
776 destroy_stacks (aTHX);
777
778 LOAD ((&temp)); /* this will get rid of defsv etc.. */
779
780 coro->mainstack = 0;
781 }
782
783 stack_free (coro->stack);
784 SvREFCNT_dec (coro->args);
785 Safefree (coro);
786}
787
788static int
789coro_state_clear (SV *sv, MAGIC *mg)
790{
791 struct coro *coro = (struct coro *)mg->mg_ptr;
792 mg->mg_ptr = 0;
793
794 coro_state_destroy (coro);
795
796 return 0;
797}
798
799static int
800coro_state_dup (MAGIC *mg, CLONE_PARAMS *params)
801{
802 struct coro *coro = (struct coro *)mg->mg_ptr;
803
804 ++coro->refcnt;
805
806 return 0;
807}
808
809static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 };
810
811static struct coro *
812SvSTATE (SV *coro)
813{
814 HV *stash;
815 MAGIC *mg;
816
817 if (SvROK (coro))
818 coro = SvRV (coro);
819
820 stash = SvSTASH (coro);
821 if (stash != coro_stash && stash != coro_state_stash)
822 {
823 /* very slow, but rare, check */
824 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
825 croak ("Coro::State object required");
826 }
827
828 mg = SvMAGIC (coro);
829 assert (mg->mg_type == PERL_MAGIC_ext);
830 return (struct coro *)mg->mg_ptr;
831}
832
833static void
834prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev, SV *next, int flags)
835{
836 ta->prev = SvSTATE (prev);
837 ta->next = SvSTATE (next);
838 ta->flags = flags;
839}
840
841static void
842api_transfer (SV *prev, SV *next, int flags)
843{
844 dTHX;
845 struct transfer_args ta;
846
847 prepare_transfer (aTHX_ &ta, prev, next, flags);
848 TRANSFER (ta);
849}
850
851/** Coro ********************************************************************/
852
853#define PRIO_MAX 3
854#define PRIO_HIGH 1
855#define PRIO_NORMAL 0
856#define PRIO_LOW -1
857#define PRIO_IDLE -3
858#define PRIO_MIN -4
859
860/* for Coro.pm */
861static GV *coro_current, *coro_idle;
862static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
863static int coro_nready;
864
865static void
866coro_enq (pTHX_ SV *sv)
867{
868 int prio;
869
870 if (SvTYPE (sv) != SVt_PVHV)
871 croak ("Coro::ready tried to enqueue something that is not a coroutine");
872
873 prio = SvSTATE (sv)->prio;
874
875 av_push (coro_ready [prio - PRIO_MIN], sv);
876 coro_nready++;
877}
878
879static SV *
880coro_deq (pTHX_ int min_prio)
881{
882 int prio = PRIO_MAX - PRIO_MIN;
883
884 min_prio -= PRIO_MIN;
885 if (min_prio < 0)
886 min_prio = 0;
887
888 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
889 if (AvFILLp (coro_ready [prio]) >= 0)
890 {
891 coro_nready--;
892 return av_shift (coro_ready [prio]);
893 }
894
895 return 0;
896}
897
898static void
899api_ready (SV *coro)
900{
901 dTHX;
902
903 if (SvROK (coro))
904 coro = SvRV (coro);
905
906 LOCK;
907 coro_enq (aTHX_ SvREFCNT_inc (coro));
908 UNLOCK;
909}
910
911static void
912prepare_schedule (aTHX_ struct transfer_args *ta)
913{
914 SV *current, *prev, *next;
915
916 LOCK;
917
918 current = GvSV (coro_current);
919
920 for (;;)
921 {
922 LOCK;
923
924 next = coro_deq (aTHX_ PRIO_MIN);
925
926 if (next)
927 break;
928
929 UNLOCK;
930
931 {
932 dSP;
933
934 ENTER;
935 SAVETMPS;
936
937 PUSHMARK (SP);
938 PUTBACK;
939 call_sv (GvSV (coro_idle), G_DISCARD);
940
941 FREETMPS;
942 LEAVE;
943 }
944 }
945
946 prev = SvRV (current);
947 SvRV (current) = next;
948
949 /* free this only after the transfer */
950 free_coro_mortal ();
951 coro_mortal = prev;
952
953 ta->prev = SvSTATE (prev);
954 ta->next = SvSTATE (next);
955 ta->flags = TRANSFER_SAVE_ALL;
956
957 UNLOCK;
958}
959
960static void
961prepare_cede (aTHX_ struct transfer_args *ta)
962{
963 LOCK;
964 coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
965 UNLOCK;
966
967 prepare_schedule (ta);
968}
969
970static void
971api_schedule (void)
972{
973 dTHX;
974 struct transfer_args ta;
975
976 prepare_schedule (&ta);
977 TRANSFER (ta);
978}
979
980static void
981api_cede (void)
982{
983 dTHX;
984 struct transfer_args ta;
985
986 prepare_cede (&ta);
987 TRANSFER (ta);
988}
989
116MODULE = Coro::State PACKAGE = Coro::State 990MODULE = Coro::State PACKAGE = Coro::State
117 991
118PROTOTYPES: ENABLE 992PROTOTYPES: DISABLE
119 993
120Coro::State 994BOOT:
121newprocess(proc) 995{
122 SV * proc 996#ifdef USE_ITHREADS
123 PROTOTYPE: & 997 MUTEX_INIT (&coro_mutex);
998#endif
999 BOOT_PAGESIZE;
1000
1001 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
1002
1003 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
1004 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
1005 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
1006
1007 main_mainstack = PL_mainstack;
1008
1009 coroapi.ver = CORO_API_VERSION;
1010 coroapi.transfer = api_transfer;
1011
1012 Newz (0, main_stack, 1, coro_stack);
1013 main_stack->idle_sp = (void *)-1;
1014
1015 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
1016}
1017
1018SV *
1019new (char *klass, ...)
124 CODE: 1020 CODE:
125 Coro__State coro; 1021{
126 1022 struct coro *coro;
1023 HV *hv;
1024 int i;
1025
127 New (0, coro, 1, struct coro); 1026 Newz (0, coro, 1, struct coro);
1027 coro->args = newAV ();
128 1028
1029 hv = newHV ();
1030 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
1031 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1032
1033 for (i = 1; i < items; i++)
1034 av_push (coro->args, newSVsv (ST (i)));
1035
1036 coro->stack = main_stack;
129 coro->mainstack = 0; /* actual work is done inside transfer */ 1037 /*coro->mainstack = 0; *//*actual work is done inside transfer */
130 coro->proc = SvREFCNT_inc (proc); 1038 /*coro->stack = 0;*/
131 1039}
132 RETVAL = coro;
133 OUTPUT: 1040 OUTPUT:
134 RETVAL 1041 RETVAL
135 1042
136void 1043void
137transfer(prev,next) 1044_set_stacklevel (...)
138 Coro::State_or_hashref prev 1045 ALIAS:
139 Coro::State_or_hashref next 1046 Coro::State::transfer = 1
1047 Coro::schedule = 2
1048 Coro::cede = 3
1049 Coro::Cont::yield = 4
140 CODE: 1050 CODE:
1051{
1052 struct transfer_args ta;
141 1053
142 PUTBACK; 1054 switch (ix)
143 SAVE (prev);
144
145 /*
146 * this could be done in newprocess which would to
147 * extremely elegant and fast (just PUTBACK/SAVE/LOAD/SPAGAIN)
148 * code here, but lazy allocation of stacks has also
149 * some virtues and the overhead of the if() is nil.
150 */
151 if (next->mainstack)
152 { 1055 {
153 LOAD (next); 1056 case 0:
154 next->mainstack = 0; /* unnecessary but much cleaner */ 1057 ta.prev = (struct coro *)INT2PTR (coro_stack *, SvIV (ST (0)));
155 SPAGAIN; 1058 ta.next = 0;
1059 ta.flags = TRANSFER_SET_STACKLEVEL;
1060 break;
1061
1062 case 1:
1063 if (items != 3)
1064 croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
1065
1066 prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
1067 break;
1068
1069 case 2:
1070 prepare_schedule (&ta);
1071 break;
1072
1073 case 3:
1074 prepare_cede (&ta);
1075 break;
1076
1077 case 4:
1078 {
1079 SV *yieldstack;
1080 SV *sv;
1081 AV *defav = GvAV (PL_defgv);
1082
1083 yieldstack = *hv_fetch (
1084 (HV *)SvRV (GvSV (coro_current)),
1085 "yieldstack", sizeof ("yieldstack") - 1,
1086 0
1087 );
1088
1089 /* set up @_ -- ugly */
1090 av_clear (defav);
1091 av_fill (defav, items - 1);
1092 while (items--)
1093 av_store (defav, items, SvREFCNT_inc (ST(items)));
1094
1095 sv = av_pop ((AV *)SvRV (yieldstack));
1096 ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
1097 ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
1098 ta.flags = 0;
1099 SvREFCNT_dec (sv);
1100 }
1101 break;
1102
156 } 1103 }
1104
1105 TRANSFER (ta);
1106}
1107
1108void
1109_clone_state_from (SV *dst, SV *src)
1110 CODE:
1111{
1112 struct coro *coro_src = SvSTATE (src);
1113
1114 sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1115
1116 ++coro_src->refcnt;
1117 sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
1118}
1119
1120void
1121_nonlocal_goto (IV nextop)
1122 CODE:
1123 /* uuh, somebody will kill me again for this */
1124 PL_op->op_next = INT2PTR (OP *, nextop);
1125
1126void
1127_exit (code)
1128 int code
1129 PROTOTYPE: $
1130 CODE:
1131 _exit (code);
1132
1133MODULE = Coro::State PACKAGE = Coro
1134
1135BOOT:
1136{
1137 int i;
1138
1139 coro_stash = gv_stashpv ("Coro", TRUE);
1140
1141 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1142 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1143 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1144 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1145 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1146 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1147
1148 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1149 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1150
1151 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1152 coro_ready[i] = newAV ();
1153
157 else 1154 {
1155 SV *sv = perl_get_sv("Coro::API", 1);
1156
1157 coroapi.schedule = api_schedule;
1158 coroapi.cede = api_cede;
1159 coroapi.ready = api_ready;
1160 coroapi.nready = &coro_nready;
1161 coroapi.current = coro_current;
1162
1163 GCoroAPI = &coroapi;
1164 sv_setiv (sv, (IV)&coroapi);
1165 SvREADONLY_on (sv);
1166 }
1167}
1168
1169int
1170prio (Coro::State coro, int newprio = 0)
1171 ALIAS:
1172 nice = 1
1173 CODE:
1174{
1175 RETVAL = coro->prio;
1176
1177 if (items > 1)
158 { 1178 {
159 /*
160 * emulate part of the perl startup here.
161 */
162 UNOP myop;
163
164 init_stacks ();
165 PL_op = (OP *)&myop;
166 /*PL_curcop = 0;*/
167
168 SPAGAIN;
169 Zero(&myop, 1, UNOP);
170 myop.op_next = Nullop;
171 myop.op_flags = OPf_WANT_VOID;
172
173 EXTEND (SP,1);
174 PUSHs (next->proc);
175 1179 if (ix)
176 PUTBACK; 1180 newprio += coro->prio;
177 /*
178 * the next line is slightly wrong, as PL_op->op_next
179 * is actually being executed so we skip the first op
180 * that doens't matter, though, since it is only
181 * pp_nextstate and we never return...
182 */
183 PL_op = Perl_pp_entersub(aTHX);
184 SPAGAIN;
185 1181
186 ENTER; 1182 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1183 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1184
1185 coro->prio = newprio;
187 } 1186 }
1187}
188 1188
189void 1189void
190DESTROY(coro) 1190ready (SV *self)
191 Coro::State coro 1191 PROTOTYPE: $
1192 CODE:
1193 api_ready (self);
1194
1195int
1196nready (...)
1197 PROTOTYPE:
192 CODE: 1198 CODE:
1199 RETVAL = coro_nready;
1200 OUTPUT:
1201 RETVAL
193 1202
194 if (coro->mainstack) 1203MODULE = Coro::State PACKAGE = Coro::AIO
195 {
196 struct coro temp;
197 1204
198 PUTBACK; 1205SV *
199 SAVE((&temp)); 1206_get_state ()
200 LOAD(coro); 1207 CODE:
1208{
1209 struct {
1210 int errorno;
1211 int laststype;
1212 int laststatval;
1213 Stat_t statcache;
1214 } data;
201 1215
202 S_nuke_stacks (); 1216 data.errorno = errno;
1217 data.laststype = PL_laststype;
1218 data.laststatval = PL_laststatval;
1219 data.statcache = PL_statcache;
203 1220
204 LOAD((&temp)); 1221 RETVAL = newSVpvn ((char *)&data, sizeof data);
205 SPAGAIN; 1222}
206 } 1223 OUTPUT:
1224 RETVAL
207 1225
208 SvREFCNT_dec (coro->proc); 1226void
209 Safefree (coro); 1227_set_state (char *data_)
1228 PROTOTYPE: $
1229 CODE:
1230{
1231 struct {
1232 int errorno;
1233 int laststype;
1234 int laststatval;
1235 Stat_t statcache;
1236 } *data = (void *)data_;
210 1237
211 1238 errno = data->errorno;
1239 PL_laststype = data->laststype;
1240 PL_laststatval = data->laststatval;
1241 PL_statcache = data->statcache;
1242}

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines