… | |
… | |
4 | #include "perl.h" |
4 | #include "perl.h" |
5 | #include "XSUB.h" |
5 | #include "XSUB.h" |
6 | |
6 | |
7 | #include "patchlevel.h" |
7 | #include "patchlevel.h" |
8 | |
8 | |
9 | #if USE_VALGRIND |
|
|
10 | # include <valgrind/valgrind.h> |
|
|
11 | #endif |
|
|
12 | |
|
|
13 | /* the maximum number of idle cctx that will be pooled */ |
|
|
14 | #define MAX_IDLE_CCTX 8 |
|
|
15 | |
|
|
16 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
|
|
17 | (PERL_REVISION > (a) \ |
|
|
18 | || (PERL_REVISION == (a) \ |
|
|
19 | && (PERL_VERSION > (b) \ |
|
|
20 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
21 | |
|
|
22 | #if !PERL_VERSION_ATLEAST (5,6,0) |
|
|
23 | # ifndef PL_ppaddr |
|
|
24 | # define PL_ppaddr ppaddr |
|
|
25 | # endif |
|
|
26 | # ifndef call_sv |
|
|
27 | # define call_sv perl_call_sv |
|
|
28 | # endif |
|
|
29 | # ifndef get_sv |
|
|
30 | # define get_sv perl_get_sv |
|
|
31 | # endif |
|
|
32 | # ifndef get_cv |
|
|
33 | # define get_cv perl_get_cv |
|
|
34 | # endif |
|
|
35 | # ifndef IS_PADGV |
|
|
36 | # define IS_PADGV(v) 0 |
|
|
37 | # endif |
|
|
38 | # ifndef IS_PADCONST |
|
|
39 | # define IS_PADCONST(v) 0 |
|
|
40 | # endif |
|
|
41 | #endif |
|
|
42 | |
|
|
43 | /* 5.8.7 */ |
|
|
44 | #ifndef SvRV_set |
|
|
45 | # define SvRV_set(s,v) SvRV(s) = (v) |
|
|
46 | #endif |
|
|
47 | |
|
|
48 | #include <stdio.h> |
9 | #include <stdio.h> |
49 | #include <errno.h> |
10 | #include <errno.h> |
50 | #include <assert.h> |
11 | #include <assert.h> |
51 | |
|
|
52 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
53 | # undef STACKGUARD |
|
|
54 | #endif |
|
|
55 | |
|
|
56 | #ifndef STACKGUARD |
|
|
57 | # define STACKGUARD 0 |
|
|
58 | #endif |
|
|
59 | |
12 | |
60 | #ifdef HAVE_MMAP |
13 | #ifdef HAVE_MMAP |
61 | # include <unistd.h> |
14 | # include <unistd.h> |
62 | # include <sys/mman.h> |
15 | # include <sys/mman.h> |
63 | # ifndef MAP_ANONYMOUS |
16 | # ifndef MAP_ANONYMOUS |
… | |
… | |
78 | #else |
31 | #else |
79 | # define PAGESIZE 0 |
32 | # define PAGESIZE 0 |
80 | # define BOOT_PAGESIZE (void)0 |
33 | # define BOOT_PAGESIZE (void)0 |
81 | #endif |
34 | #endif |
82 | |
35 | |
|
|
36 | #if USE_VALGRIND |
|
|
37 | # include <valgrind/valgrind.h> |
|
|
38 | # define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end)) |
|
|
39 | #else |
|
|
40 | # define REGISTER_STACK(cctx,start,end) |
|
|
41 | #endif |
|
|
42 | |
|
|
43 | /* the maximum number of idle cctx that will be pooled */ |
|
|
44 | #define MAX_IDLE_CCTX 8 |
|
|
45 | |
|
|
46 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
|
|
47 | (PERL_REVISION > (a) \ |
|
|
48 | || (PERL_REVISION == (a) \ |
|
|
49 | && (PERL_VERSION > (b) \ |
|
|
50 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
51 | |
|
|
52 | #if !PERL_VERSION_ATLEAST (5,6,0) |
|
|
53 | # ifndef PL_ppaddr |
|
|
54 | # define PL_ppaddr ppaddr |
|
|
55 | # endif |
|
|
56 | # ifndef call_sv |
|
|
57 | # define call_sv perl_call_sv |
|
|
58 | # endif |
|
|
59 | # ifndef get_sv |
|
|
60 | # define get_sv perl_get_sv |
|
|
61 | # endif |
|
|
62 | # ifndef get_cv |
|
|
63 | # define get_cv perl_get_cv |
|
|
64 | # endif |
|
|
65 | # ifndef IS_PADGV |
|
|
66 | # define IS_PADGV(v) 0 |
|
|
67 | # endif |
|
|
68 | # ifndef IS_PADCONST |
|
|
69 | # define IS_PADCONST(v) 0 |
|
|
70 | # endif |
|
|
71 | #endif |
|
|
72 | |
|
|
73 | /* 5.8.7 */ |
|
|
74 | #ifndef SvRV_set |
|
|
75 | # define SvRV_set(s,v) SvRV(s) = (v) |
|
|
76 | #endif |
|
|
77 | |
|
|
78 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
79 | # undef STACKGUARD |
|
|
80 | #endif |
|
|
81 | |
|
|
82 | #ifndef STACKGUARD |
|
|
83 | # define STACKGUARD 0 |
|
|
84 | #endif |
|
|
85 | |
|
|
86 | /* prefer perl internal functions over our own? */ |
|
|
87 | #ifndef PREFER_PERL_FUNCTIONS |
|
|
88 | # define PREFER_PERL_FUNCTIONS 0 |
|
|
89 | #endif |
|
|
90 | |
83 | /* The next macro should declare a variable stacklevel that contains and approximation |
91 | /* The next macro should declare a variable stacklevel that contains and approximation |
84 | * to the current C stack pointer. Its property is that it changes with each call |
92 | * to the current C stack pointer. Its property is that it changes with each call |
85 | * and should be unique. */ |
93 | * and should be unique. */ |
86 | #define dSTACKLEVEL int stacklevel |
94 | #define dSTACKLEVEL int stacklevel |
87 | #define STACKLEVEL ((void *)&stacklevel) |
95 | #define STACKLEVEL ((void *)&stacklevel) |
88 | |
96 | |
89 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
97 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
90 | |
98 | |
91 | #if __GNUC__ >= 3 |
99 | #if __GNUC__ >= 3 |
92 | # define attribute(x) __attribute__(x) |
100 | # define attribute(x) __attribute__(x) |
|
|
101 | # define BARRIER __asm__ __volatile__ ("" : : : "memory") |
93 | #else |
102 | #else |
94 | # define attribute(x) |
103 | # define attribute(x) |
|
|
104 | # define BARRIER |
95 | #endif |
105 | #endif |
96 | |
106 | |
97 | #define NOINLINE attribute ((noinline)) |
107 | #define NOINLINE attribute ((noinline)) |
98 | |
108 | |
99 | #include "CoroAPI.h" |
109 | #include "CoroAPI.h" |
… | |
… | |
105 | #else |
115 | #else |
106 | # define LOCK (void)0 |
116 | # define LOCK (void)0 |
107 | # define UNLOCK (void)0 |
117 | # define UNLOCK (void)0 |
108 | #endif |
118 | #endif |
109 | |
119 | |
|
|
120 | /* helper storage struct for Coro::AIO */ |
110 | struct io_state |
121 | struct io_state |
111 | { |
122 | { |
112 | int errorno; |
123 | int errorno; |
113 | I32 laststype; |
124 | I32 laststype; |
114 | int laststatval; |
125 | int laststatval; |
… | |
… | |
127 | typedef struct coro_cctx { |
138 | typedef struct coro_cctx { |
128 | struct coro_cctx *next; |
139 | struct coro_cctx *next; |
129 | |
140 | |
130 | /* the stack */ |
141 | /* the stack */ |
131 | void *sptr; |
142 | void *sptr; |
132 | long ssize; /* positive == mmap, otherwise malloc */ |
143 | ssize_t ssize; /* positive == mmap, otherwise malloc */ |
133 | |
144 | |
134 | /* cpu state */ |
145 | /* cpu state */ |
135 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
146 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
147 | JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */ |
136 | JMPENV *top_env; |
148 | JMPENV *top_env; |
137 | coro_context cctx; |
149 | coro_context cctx; |
138 | |
150 | |
139 | int inuse; |
151 | int inuse; |
140 | |
152 | |
… | |
… | |
142 | int valgrind_id; |
154 | int valgrind_id; |
143 | #endif |
155 | #endif |
144 | } coro_cctx; |
156 | } coro_cctx; |
145 | |
157 | |
146 | enum { |
158 | enum { |
147 | CF_RUNNING = 0x0001, /* coroutine is running */ |
159 | CF_RUNNING = 0x0001, /* coroutine is running */ |
148 | CF_READY = 0x0002, /* coroutine is ready */ |
160 | CF_READY = 0x0002, /* coroutine is ready */ |
149 | CF_NEW = 0x0004, /* ahs never been switched to */ |
161 | CF_NEW = 0x0004, /* has never been switched to */ |
|
|
162 | CF_DESTROYED = 0x0008, /* coroutine data has been freed */ |
150 | }; |
163 | }; |
151 | |
164 | |
152 | /* this is a structure representing a perl-level coroutine */ |
165 | /* this is a structure representing a perl-level coroutine */ |
153 | struct coro { |
166 | struct coro { |
154 | /* the c coroutine allocated to this perl coroutine, if any */ |
167 | /* the c coroutine allocated to this perl coroutine, if any */ |
… | |
… | |
176 | }; |
189 | }; |
177 | |
190 | |
178 | typedef struct coro *Coro__State; |
191 | typedef struct coro *Coro__State; |
179 | typedef struct coro *Coro__State_or_hashref; |
192 | typedef struct coro *Coro__State_or_hashref; |
180 | |
193 | |
|
|
194 | /** Coro ********************************************************************/ |
|
|
195 | |
|
|
196 | #define PRIO_MAX 3 |
|
|
197 | #define PRIO_HIGH 1 |
|
|
198 | #define PRIO_NORMAL 0 |
|
|
199 | #define PRIO_LOW -1 |
|
|
200 | #define PRIO_IDLE -3 |
|
|
201 | #define PRIO_MIN -4 |
|
|
202 | |
|
|
203 | /* for Coro.pm */ |
|
|
204 | static SV *coro_current; |
|
|
205 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
|
|
206 | static int coro_nready; |
|
|
207 | |
|
|
208 | /** lowlevel stuff **********************************************************/ |
|
|
209 | |
181 | static AV * |
210 | static AV * |
182 | coro_clone_padlist (CV *cv) |
211 | coro_clone_padlist (CV *cv) |
183 | { |
212 | { |
184 | AV *padlist = CvPADLIST (cv); |
213 | AV *padlist = CvPADLIST (cv); |
185 | AV *newpadlist, *newpad; |
214 | AV *newpadlist, *newpad; |
… | |
… | |
259 | |
288 | |
260 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
289 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
261 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
290 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
262 | else |
291 | else |
263 | { |
292 | { |
264 | #if 0 |
293 | #if PREFER_PERL_FUNCTIONS |
265 | /* this is probably cleaner, but also slower? */ |
294 | /* this is probably cleaner, but also slower? */ |
266 | CV *cp = Perl_cv_clone (cv); |
295 | CV *cp = Perl_cv_clone (cv); |
267 | CvPADLIST (cv) = CvPADLIST (cp); |
296 | CvPADLIST (cv) = CvPADLIST (cp); |
268 | CvPADLIST (cp) = 0; |
297 | CvPADLIST (cp) = 0; |
269 | SvREFCNT_dec (cp); |
298 | SvREFCNT_dec (cp); |
… | |
… | |
292 | if (AvFILLp (av) >= AvMAX (av)) |
321 | if (AvFILLp (av) >= AvMAX (av)) |
293 | av_extend (av, AvMAX (av) + 1); |
322 | av_extend (av, AvMAX (av) + 1); |
294 | |
323 | |
295 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
324 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
296 | } |
325 | } |
|
|
326 | |
|
|
327 | /** load & save, init *******************************************************/ |
297 | |
328 | |
298 | #define SB do { |
329 | #define SB do { |
299 | #define SE } while (0) |
330 | #define SE } while (0) |
300 | |
331 | |
301 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
332 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
… | |
… | |
334 | CvPADLIST (cv) = (AV *)POPs; |
365 | CvPADLIST (cv) = (AV *)POPs; |
335 | } |
366 | } |
336 | |
367 | |
337 | PUTBACK; |
368 | PUTBACK; |
338 | } |
369 | } |
|
|
370 | assert (!PL_comppad || AvARRAY (PL_comppad));//D |
339 | } |
371 | } |
340 | |
372 | |
341 | static void |
373 | static void |
342 | save_perl (Coro__State c) |
374 | save_perl (Coro__State c) |
343 | { |
375 | { |
|
|
376 | assert (!PL_comppad || AvARRAY (PL_comppad));//D |
344 | { |
377 | { |
345 | dSP; |
378 | dSP; |
346 | I32 cxix = cxstack_ix; |
379 | I32 cxix = cxstack_ix; |
347 | PERL_CONTEXT *ccstk = cxstack; |
380 | PERL_CONTEXT *ccstk = cxstack; |
348 | PERL_SI *top_si = PL_curstackinfo; |
381 | PERL_SI *top_si = PL_curstackinfo; |
… | |
… | |
403 | * allocate various perl stacks. This is an exact copy |
436 | * allocate various perl stacks. This is an exact copy |
404 | * of perl.c:init_stacks, except that it uses less memory |
437 | * of perl.c:init_stacks, except that it uses less memory |
405 | * on the (sometimes correct) assumption that coroutines do |
438 | * on the (sometimes correct) assumption that coroutines do |
406 | * not usually need a lot of stackspace. |
439 | * not usually need a lot of stackspace. |
407 | */ |
440 | */ |
408 | #if USE_PERL_INIT_STACKS |
441 | #if PREFER_PERL_FUNCTIONS |
409 | # define coro_init_stacks init_stacks |
442 | # define coro_init_stacks init_stacks |
410 | #else |
443 | #else |
411 | |
|
|
412 | static void |
444 | static void |
413 | coro_init_stacks () |
445 | coro_init_stacks () |
414 | { |
446 | { |
415 | PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT)); |
447 | PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT)); |
416 | PL_curstackinfo->si_type = PERLSI_MAIN; |
448 | PL_curstackinfo->si_type = PERLSI_MAIN; |
… | |
… | |
446 | New(54,PL_retstack,16,OP*); |
478 | New(54,PL_retstack,16,OP*); |
447 | PL_retstack_ix = 0; |
479 | PL_retstack_ix = 0; |
448 | PL_retstack_max = 16; |
480 | PL_retstack_max = 16; |
449 | #endif |
481 | #endif |
450 | } |
482 | } |
|
|
483 | #endif |
451 | |
484 | |
452 | /* |
485 | /* |
453 | * destroy the stacks, the callchain etc... |
486 | * destroy the stacks, the callchain etc... |
454 | */ |
487 | */ |
455 | static void |
488 | static void |
… | |
… | |
463 | |
496 | |
464 | /* free all temporaries */ |
497 | /* free all temporaries */ |
465 | FREETMPS; |
498 | FREETMPS; |
466 | assert (PL_tmps_ix == -1); |
499 | assert (PL_tmps_ix == -1); |
467 | |
500 | |
|
|
501 | /* unwind all extra stacks */ |
468 | POPSTACK_TO (PL_mainstack); |
502 | POPSTACK_TO (PL_mainstack); |
|
|
503 | |
|
|
504 | /* unwind main stack */ |
|
|
505 | dounwind (-1); |
469 | } |
506 | } |
470 | |
507 | |
471 | while (PL_curstackinfo->si_next) |
508 | while (PL_curstackinfo->si_next) |
472 | PL_curstackinfo = PL_curstackinfo->si_next; |
509 | PL_curstackinfo = PL_curstackinfo->si_next; |
473 | |
510 | |
… | |
… | |
489 | Safefree (PL_savestack); |
526 | Safefree (PL_savestack); |
490 | #if !PERL_VERSION_ATLEAST (5,9,0) |
527 | #if !PERL_VERSION_ATLEAST (5,9,0) |
491 | Safefree (PL_retstack); |
528 | Safefree (PL_retstack); |
492 | #endif |
529 | #endif |
493 | } |
530 | } |
494 | #endif |
531 | |
|
|
532 | /** coroutine stack handling ************************************************/ |
495 | |
533 | |
496 | static void |
534 | static void |
497 | setup_coro (struct coro *coro) |
535 | setup_coro (struct coro *coro) |
498 | { |
536 | { |
499 | /* |
537 | /* |
… | |
… | |
502 | |
540 | |
503 | coro_init_stacks (); |
541 | coro_init_stacks (); |
504 | |
542 | |
505 | PL_curcop = &PL_compiling; |
543 | PL_curcop = &PL_compiling; |
506 | PL_in_eval = EVAL_NULL; |
544 | PL_in_eval = EVAL_NULL; |
|
|
545 | PL_comppad = 0; |
507 | PL_curpm = 0; |
546 | PL_curpm = 0; |
508 | PL_localizing = 0; |
547 | PL_localizing = 0; |
509 | PL_dirty = 0; |
548 | PL_dirty = 0; |
510 | PL_restartop = 0; |
549 | PL_restartop = 0; |
511 | |
550 | |
… | |
… | |
597 | |
636 | |
598 | cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; |
637 | cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; |
599 | /* mmap supposedly does allocate-on-write for us */ |
638 | /* mmap supposedly does allocate-on-write for us */ |
600 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
639 | cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
601 | |
640 | |
602 | if (cctx->sptr == (void *)-1) |
641 | if (cctx->sptr != (void *)-1) |
603 | { |
|
|
604 | perror ("FATAL: unable to mmap stack for coroutine"); |
|
|
605 | _exit (EXIT_FAILURE); |
|
|
606 | } |
642 | { |
607 | |
|
|
608 | # if STACKGUARD |
643 | # if STACKGUARD |
609 | mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE); |
644 | mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE); |
610 | # endif |
645 | # endif |
611 | |
646 | REGISTER_STACK ( |
612 | #else |
647 | cctx, |
613 | |
|
|
614 | cctx->ssize = STACKSIZE * (long)sizeof (long); |
|
|
615 | New (0, cctx->sptr, STACKSIZE, long); |
|
|
616 | |
|
|
617 | if (!cctx->sptr) |
|
|
618 | { |
|
|
619 | perror ("FATAL: unable to malloc stack for coroutine"); |
|
|
620 | _exit (EXIT_FAILURE); |
|
|
621 | } |
|
|
622 | |
|
|
623 | #endif |
|
|
624 | |
|
|
625 | #if USE_VALGRIND |
|
|
626 | cctx->valgrind_id = VALGRIND_STACK_REGISTER ( |
|
|
627 | STACKGUARD * PAGESIZE + (char *)cctx->sptr, |
648 | STACKGUARD * PAGESIZE + (char *)cctx->sptr, |
628 | cctx->ssize + (char *)cctx->sptr |
649 | cctx->ssize + (char *)cctx->sptr |
629 | ); |
650 | ); |
630 | #endif |
|
|
631 | |
651 | |
632 | coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize); |
652 | coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize); |
|
|
653 | } |
|
|
654 | else |
|
|
655 | #endif |
|
|
656 | { |
|
|
657 | cctx->ssize = -STACKSIZE * (long)sizeof (long); |
|
|
658 | New (0, cctx->sptr, STACKSIZE, long); |
|
|
659 | |
|
|
660 | if (!cctx->sptr) |
|
|
661 | { |
|
|
662 | perror ("FATAL: unable to allocate stack for coroutine"); |
|
|
663 | _exit (EXIT_FAILURE); |
|
|
664 | } |
|
|
665 | |
|
|
666 | REGISTER_STACK ( |
|
|
667 | cctx, |
|
|
668 | (char *)cctx->sptr, |
|
|
669 | (char *)cctx->sptr - cctx->ssize |
|
|
670 | ); |
|
|
671 | |
|
|
672 | coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, -cctx->ssize); |
|
|
673 | } |
633 | |
674 | |
634 | return cctx; |
675 | return cctx; |
635 | } |
676 | } |
636 | |
677 | |
637 | static void |
678 | static void |
… | |
… | |
645 | #if USE_VALGRIND |
686 | #if USE_VALGRIND |
646 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
687 | VALGRIND_STACK_DEREGISTER (cctx->valgrind_id); |
647 | #endif |
688 | #endif |
648 | |
689 | |
649 | #if HAVE_MMAP |
690 | #if HAVE_MMAP |
|
|
691 | if (cctx->ssize > 0) |
650 | munmap (cctx->sptr, cctx->ssize); |
692 | munmap (cctx->sptr, cctx->ssize); |
651 | #else |
693 | else |
|
|
694 | #endif |
652 | Safefree (cctx->sptr); |
695 | Safefree (cctx->sptr); |
653 | #endif |
|
|
654 | |
696 | |
655 | Safefree (cctx); |
697 | Safefree (cctx); |
656 | } |
698 | } |
657 | |
699 | |
658 | static coro_cctx * |
700 | static coro_cctx * |
… | |
… | |
692 | ++cctx_idle; |
734 | ++cctx_idle; |
693 | cctx->next = cctx_first; |
735 | cctx->next = cctx_first; |
694 | cctx_first = cctx; |
736 | cctx_first = cctx; |
695 | } |
737 | } |
696 | |
738 | |
|
|
739 | /** coroutine switching *****************************************************/ |
|
|
740 | |
697 | /* never call directly, always through the coro_state_transfer global variable */ |
741 | /* never call directly, always through the coro_state_transfer global variable */ |
698 | static void NOINLINE |
742 | static void NOINLINE |
699 | transfer (struct coro *prev, struct coro *next) |
743 | transfer (struct coro *prev, struct coro *next) |
700 | { |
744 | { |
701 | dSTACKLEVEL; |
745 | dSTACKLEVEL; |
702 | |
746 | |
703 | /* sometimes transfer is only called to set idle_sp */ |
747 | /* sometimes transfer is only called to set idle_sp */ |
704 | if (!next) |
748 | if (!next) |
705 | { |
749 | { |
706 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
750 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
707 | assert (((coro_cctx *)prev)->top_env = PL_top_env); /* just for the side effetc when assert is enabled */ |
751 | assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */ |
708 | } |
752 | } |
709 | else if (prev != next) |
753 | else if (prev != next) |
710 | { |
754 | { |
711 | coro_cctx *prev__cctx; |
755 | coro_cctx *prev__cctx; |
712 | |
756 | |
… | |
… | |
723 | if (!prev->flags & CF_RUNNING) |
767 | if (!prev->flags & CF_RUNNING) |
724 | croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states"); |
768 | croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states"); |
725 | |
769 | |
726 | if (next->flags & CF_RUNNING) |
770 | if (next->flags & CF_RUNNING) |
727 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
771 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
|
|
772 | |
|
|
773 | if (next->flags & CF_DESTROYED) |
|
|
774 | croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states"); |
728 | |
775 | |
729 | prev->flags &= ~CF_RUNNING; |
776 | prev->flags &= ~CF_RUNNING; |
730 | next->flags |= CF_RUNNING; |
777 | next->flags |= CF_RUNNING; |
731 | |
778 | |
732 | LOCK; |
779 | LOCK; |
… | |
… | |
753 | |
800 | |
754 | /* possibly "free" the cctx */ |
801 | /* possibly "free" the cctx */ |
755 | if (prev__cctx->idle_sp == STACKLEVEL) |
802 | if (prev__cctx->idle_sp == STACKLEVEL) |
756 | { |
803 | { |
757 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
804 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
758 | assert (PL_top_env == prev__cctx->top_env); |
805 | assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te)); |
759 | |
806 | |
760 | prev->cctx = 0; |
807 | prev->cctx = 0; |
761 | |
808 | |
762 | cctx_put (prev__cctx); |
809 | cctx_put (prev__cctx); |
763 | prev__cctx->inuse = 0; |
810 | prev__cctx->inuse = 0; |
… | |
… | |
776 | PL_top_env = next->cctx->top_env; |
823 | PL_top_env = next->cctx->top_env; |
777 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
824 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
778 | } |
825 | } |
779 | |
826 | |
780 | free_coro_mortal (); |
827 | free_coro_mortal (); |
781 | |
|
|
782 | UNLOCK; |
828 | UNLOCK; |
783 | } |
829 | } |
784 | } |
830 | } |
785 | |
831 | |
786 | struct transfer_args |
832 | struct transfer_args |
… | |
… | |
788 | struct coro *prev, *next; |
834 | struct coro *prev, *next; |
789 | }; |
835 | }; |
790 | |
836 | |
791 | #define TRANSFER(ta) transfer ((ta).prev, (ta).next) |
837 | #define TRANSFER(ta) transfer ((ta).prev, (ta).next) |
792 | |
838 | |
|
|
839 | /** high level stuff ********************************************************/ |
|
|
840 | |
793 | static void |
841 | static int |
794 | coro_state_destroy (struct coro *coro) |
842 | coro_state_destroy (struct coro *coro) |
795 | { |
843 | { |
796 | if (coro->refcnt--) |
844 | if (coro->flags & CF_DESTROYED) |
797 | return; |
845 | return 0; |
|
|
846 | |
|
|
847 | coro->flags |= CF_DESTROYED; |
|
|
848 | |
|
|
849 | if (coro->flags & CF_READY) |
|
|
850 | { |
|
|
851 | /* reduce nready, as destroying a ready coro effectively unreadies it */ |
|
|
852 | /* alternative: look through all ready queues and remove the coro */ |
|
|
853 | LOCK; |
|
|
854 | --coro_nready; |
|
|
855 | UNLOCK; |
|
|
856 | } |
|
|
857 | else |
|
|
858 | coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */ |
798 | |
859 | |
799 | if (coro->mainstack && coro->mainstack != main_mainstack) |
860 | if (coro->mainstack && coro->mainstack != main_mainstack) |
800 | { |
861 | { |
801 | struct coro temp; |
862 | struct coro temp; |
|
|
863 | |
|
|
864 | assert (!(coro->flags & CF_RUNNING)); |
|
|
865 | |
802 | Zero (&temp, 1, struct coro); |
866 | Zero (&temp, 1, struct coro); |
803 | temp.save = CORO_SAVE_ALL; |
867 | temp.save = CORO_SAVE_ALL; |
804 | |
868 | |
805 | if (coro->flags & CF_RUNNING) |
869 | if (coro->flags & CF_RUNNING) |
806 | croak ("FATAL: tried to destroy currently running coroutine"); |
870 | croak ("FATAL: tried to destroy currently running coroutine"); |
… | |
… | |
815 | coro->mainstack = 0; |
879 | coro->mainstack = 0; |
816 | } |
880 | } |
817 | |
881 | |
818 | cctx_destroy (coro->cctx); |
882 | cctx_destroy (coro->cctx); |
819 | SvREFCNT_dec (coro->args); |
883 | SvREFCNT_dec (coro->args); |
820 | Safefree (coro); |
884 | |
|
|
885 | return 1; |
821 | } |
886 | } |
822 | |
887 | |
823 | static int |
888 | static int |
824 | coro_state_clear (pTHX_ SV *sv, MAGIC *mg) |
889 | coro_state_free (pTHX_ SV *sv, MAGIC *mg) |
825 | { |
890 | { |
826 | struct coro *coro = (struct coro *)mg->mg_ptr; |
891 | struct coro *coro = (struct coro *)mg->mg_ptr; |
827 | mg->mg_ptr = 0; |
892 | mg->mg_ptr = 0; |
828 | |
893 | |
|
|
894 | if (--coro->refcnt < 0) |
|
|
895 | { |
829 | coro_state_destroy (coro); |
896 | coro_state_destroy (coro); |
|
|
897 | Safefree (coro); |
|
|
898 | } |
830 | |
899 | |
831 | return 0; |
900 | return 0; |
832 | } |
901 | } |
833 | |
902 | |
834 | static int |
903 | static int |
… | |
… | |
841 | return 0; |
910 | return 0; |
842 | } |
911 | } |
843 | |
912 | |
844 | static MGVTBL coro_state_vtbl = { |
913 | static MGVTBL coro_state_vtbl = { |
845 | 0, 0, 0, 0, |
914 | 0, 0, 0, 0, |
846 | coro_state_clear, |
915 | coro_state_free, |
847 | 0, |
916 | 0, |
848 | #ifdef MGf_DUP |
917 | #ifdef MGf_DUP |
849 | coro_state_dup, |
918 | coro_state_dup, |
850 | #else |
919 | #else |
851 | # define MGf_DUP 0 |
920 | # define MGf_DUP 0 |
… | |
… | |
902 | return old_save; |
971 | return old_save; |
903 | } |
972 | } |
904 | |
973 | |
905 | /** Coro ********************************************************************/ |
974 | /** Coro ********************************************************************/ |
906 | |
975 | |
907 | #define PRIO_MAX 3 |
|
|
908 | #define PRIO_HIGH 1 |
|
|
909 | #define PRIO_NORMAL 0 |
|
|
910 | #define PRIO_LOW -1 |
|
|
911 | #define PRIO_IDLE -3 |
|
|
912 | #define PRIO_MIN -4 |
|
|
913 | |
|
|
914 | /* for Coro.pm */ |
|
|
915 | static SV *coro_current; |
|
|
916 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
|
|
917 | static int coro_nready; |
|
|
918 | |
|
|
919 | static void |
976 | static void |
920 | coro_enq (SV *coro_sv) |
977 | coro_enq (SV *coro_sv) |
921 | { |
978 | { |
922 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
979 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
923 | coro_nready++; |
|
|
924 | } |
980 | } |
925 | |
981 | |
926 | static SV * |
982 | static SV * |
927 | coro_deq (int min_prio) |
983 | coro_deq (int min_prio) |
928 | { |
984 | { |
… | |
… | |
932 | if (min_prio < 0) |
988 | if (min_prio < 0) |
933 | min_prio = 0; |
989 | min_prio = 0; |
934 | |
990 | |
935 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
991 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
936 | if (AvFILLp (coro_ready [prio]) >= 0) |
992 | if (AvFILLp (coro_ready [prio]) >= 0) |
937 | { |
|
|
938 | coro_nready--; |
|
|
939 | return av_shift (coro_ready [prio]); |
993 | return av_shift (coro_ready [prio]); |
940 | } |
|
|
941 | |
994 | |
942 | return 0; |
995 | return 0; |
943 | } |
996 | } |
944 | |
997 | |
945 | static int |
998 | static int |
… | |
… | |
953 | coro = SvSTATE (coro_sv); |
1006 | coro = SvSTATE (coro_sv); |
954 | |
1007 | |
955 | if (coro->flags & CF_READY) |
1008 | if (coro->flags & CF_READY) |
956 | return 0; |
1009 | return 0; |
957 | |
1010 | |
958 | #if 0 /* this is actually harmless */ |
|
|
959 | if (coro->flags & CF_RUNNING) |
|
|
960 | croak ("Coro::ready called on currently running coroutine"); |
|
|
961 | #endif |
|
|
962 | |
|
|
963 | coro->flags |= CF_READY; |
1011 | coro->flags |= CF_READY; |
964 | |
1012 | |
965 | LOCK; |
1013 | LOCK; |
966 | coro_enq (SvREFCNT_inc (coro_sv)); |
1014 | coro_enq (SvREFCNT_inc (coro_sv)); |
|
|
1015 | ++coro_nready; |
967 | UNLOCK; |
1016 | UNLOCK; |
968 | |
1017 | |
969 | return 1; |
1018 | return 1; |
970 | } |
1019 | } |
971 | |
1020 | |
972 | static int |
1021 | static int |
973 | api_is_ready (SV *coro_sv) |
1022 | api_is_ready (SV *coro_sv) |
974 | { |
1023 | { |
975 | return !!SvSTATE (coro_sv)->flags & CF_READY; |
1024 | return !!(SvSTATE (coro_sv)->flags & CF_READY); |
976 | } |
1025 | } |
977 | |
1026 | |
978 | static void |
1027 | static void |
979 | prepare_schedule (struct transfer_args *ta) |
1028 | prepare_schedule (struct transfer_args *ta) |
980 | { |
1029 | { |
981 | SV *prev, *next; |
1030 | SV *prev_sv, *next_sv; |
982 | |
1031 | |
983 | for (;;) |
1032 | for (;;) |
984 | { |
1033 | { |
985 | LOCK; |
1034 | LOCK; |
986 | next = coro_deq (PRIO_MIN); |
1035 | next_sv = coro_deq (PRIO_MIN); |
|
|
1036 | |
|
|
1037 | /* nothing to schedule: call the idle handler */ |
|
|
1038 | if (!next_sv) |
|
|
1039 | { |
|
|
1040 | dSP; |
|
|
1041 | UNLOCK; |
|
|
1042 | |
|
|
1043 | ENTER; |
|
|
1044 | SAVETMPS; |
|
|
1045 | |
|
|
1046 | PUSHMARK (SP); |
|
|
1047 | PUTBACK; |
|
|
1048 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1049 | |
|
|
1050 | FREETMPS; |
|
|
1051 | LEAVE; |
|
|
1052 | continue; |
|
|
1053 | } |
|
|
1054 | |
|
|
1055 | ta->next = SvSTATE (next_sv); |
|
|
1056 | |
|
|
1057 | /* cannot transfer to destroyed coros, skip and look for next */ |
|
|
1058 | if (ta->next->flags & CF_DESTROYED) |
|
|
1059 | { |
|
|
1060 | UNLOCK; |
|
|
1061 | SvREFCNT_dec (next_sv); |
|
|
1062 | /* coro_nready is already taken care of by destroy */ |
|
|
1063 | continue; |
|
|
1064 | } |
|
|
1065 | |
|
|
1066 | --coro_nready; |
987 | UNLOCK; |
1067 | UNLOCK; |
988 | |
|
|
989 | if (next) |
|
|
990 | break; |
1068 | break; |
991 | |
|
|
992 | { |
|
|
993 | dSP; |
|
|
994 | |
|
|
995 | ENTER; |
|
|
996 | SAVETMPS; |
|
|
997 | |
|
|
998 | PUSHMARK (SP); |
|
|
999 | PUTBACK; |
|
|
1000 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1001 | |
|
|
1002 | FREETMPS; |
|
|
1003 | LEAVE; |
|
|
1004 | } |
1069 | } |
1005 | } |
|
|
1006 | |
|
|
1007 | prev = SvRV (coro_current); |
|
|
1008 | SvRV_set (coro_current, next); |
|
|
1009 | |
1070 | |
1010 | /* free this only after the transfer */ |
1071 | /* free this only after the transfer */ |
|
|
1072 | prev_sv = SvRV (coro_current); |
|
|
1073 | SvRV_set (coro_current, next_sv); |
|
|
1074 | ta->prev = SvSTATE (prev_sv); |
|
|
1075 | |
|
|
1076 | assert (ta->next->flags & CF_READY); |
|
|
1077 | ta->next->flags &= ~CF_READY; |
|
|
1078 | |
1011 | LOCK; |
1079 | LOCK; |
1012 | free_coro_mortal (); |
1080 | free_coro_mortal (); |
|
|
1081 | coro_mortal = prev_sv; |
1013 | UNLOCK; |
1082 | UNLOCK; |
1014 | coro_mortal = prev; |
|
|
1015 | |
|
|
1016 | assert (!SvROK(prev));//D |
|
|
1017 | assert (!SvROK(next));//D |
|
|
1018 | |
|
|
1019 | ta->prev = SvSTATE (prev); |
|
|
1020 | ta->next = SvSTATE (next); |
|
|
1021 | |
|
|
1022 | assert (ta->next->flags & CF_READY); |
|
|
1023 | ta->next->flags &= ~CF_READY; |
|
|
1024 | } |
1083 | } |
1025 | |
1084 | |
1026 | static void |
1085 | static void |
1027 | prepare_cede (struct transfer_args *ta) |
1086 | prepare_cede (struct transfer_args *ta) |
1028 | { |
1087 | { |
1029 | api_ready (coro_current); |
1088 | api_ready (coro_current); |
1030 | |
|
|
1031 | prepare_schedule (ta); |
1089 | prepare_schedule (ta); |
|
|
1090 | } |
|
|
1091 | |
|
|
1092 | static int |
|
|
1093 | prepare_cede_notself (struct transfer_args *ta) |
|
|
1094 | { |
|
|
1095 | if (coro_nready) |
|
|
1096 | { |
|
|
1097 | SV *prev = SvRV (coro_current); |
|
|
1098 | prepare_schedule (ta); |
|
|
1099 | api_ready (prev); |
|
|
1100 | return 1; |
|
|
1101 | } |
|
|
1102 | else |
|
|
1103 | return 0; |
1032 | } |
1104 | } |
1033 | |
1105 | |
1034 | static void |
1106 | static void |
1035 | api_schedule (void) |
1107 | api_schedule (void) |
1036 | { |
1108 | { |
… | |
… | |
1038 | |
1110 | |
1039 | prepare_schedule (&ta); |
1111 | prepare_schedule (&ta); |
1040 | TRANSFER (ta); |
1112 | TRANSFER (ta); |
1041 | } |
1113 | } |
1042 | |
1114 | |
1043 | static void |
1115 | static int |
1044 | api_cede (void) |
1116 | api_cede (void) |
1045 | { |
1117 | { |
1046 | struct transfer_args ta; |
1118 | struct transfer_args ta; |
1047 | |
1119 | |
1048 | prepare_cede (&ta); |
1120 | prepare_cede (&ta); |
|
|
1121 | |
|
|
1122 | if (ta.prev != ta.next) |
|
|
1123 | { |
1049 | TRANSFER (ta); |
1124 | TRANSFER (ta); |
|
|
1125 | return 1; |
|
|
1126 | } |
|
|
1127 | else |
|
|
1128 | return 0; |
|
|
1129 | } |
|
|
1130 | |
|
|
1131 | static int |
|
|
1132 | api_cede_notself (void) |
|
|
1133 | { |
|
|
1134 | struct transfer_args ta; |
|
|
1135 | |
|
|
1136 | if (prepare_cede_notself (&ta)) |
|
|
1137 | { |
|
|
1138 | TRANSFER (ta); |
|
|
1139 | return 1; |
|
|
1140 | } |
|
|
1141 | else |
|
|
1142 | return 0; |
1050 | } |
1143 | } |
1051 | |
1144 | |
1052 | MODULE = Coro::State PACKAGE = Coro::State |
1145 | MODULE = Coro::State PACKAGE = Coro::State |
1053 | |
1146 | |
1054 | PROTOTYPES: DISABLE |
1147 | PROTOTYPES: DISABLE |
… | |
… | |
1110 | _set_stacklevel (...) |
1203 | _set_stacklevel (...) |
1111 | ALIAS: |
1204 | ALIAS: |
1112 | Coro::State::transfer = 1 |
1205 | Coro::State::transfer = 1 |
1113 | Coro::schedule = 2 |
1206 | Coro::schedule = 2 |
1114 | Coro::cede = 3 |
1207 | Coro::cede = 3 |
|
|
1208 | Coro::cede_notself = 4 |
1115 | CODE: |
1209 | CODE: |
1116 | { |
1210 | { |
1117 | struct transfer_args ta; |
1211 | struct transfer_args ta; |
1118 | |
1212 | |
1119 | switch (ix) |
1213 | switch (ix) |
… | |
… | |
1135 | break; |
1229 | break; |
1136 | |
1230 | |
1137 | case 3: |
1231 | case 3: |
1138 | prepare_cede (&ta); |
1232 | prepare_cede (&ta); |
1139 | break; |
1233 | break; |
|
|
1234 | |
|
|
1235 | case 4: |
|
|
1236 | if (!prepare_cede_notself (&ta)) |
|
|
1237 | XSRETURN_EMPTY; |
|
|
1238 | |
|
|
1239 | break; |
1140 | } |
1240 | } |
1141 | |
1241 | |
|
|
1242 | BARRIER; |
1142 | TRANSFER (ta); |
1243 | TRANSFER (ta); |
1143 | } |
|
|
1144 | |
1244 | |
1145 | void |
1245 | if (GIMME_V != G_VOID && ta.next != ta.prev) |
1146 | _clone_state_from (SV *dst, SV *src) |
1246 | XSRETURN_YES; |
|
|
1247 | } |
|
|
1248 | |
|
|
1249 | bool |
|
|
1250 | _destroy (SV *coro_sv) |
1147 | CODE: |
1251 | CODE: |
1148 | { |
1252 | RETVAL = coro_state_destroy (SvSTATE (coro_sv)); |
1149 | struct coro *coro_src = SvSTATE (src); |
1253 | OUTPUT: |
1150 | |
1254 | RETVAL |
1151 | sv_unmagic (SvRV (dst), PERL_MAGIC_ext); |
|
|
1152 | |
|
|
1153 | ++coro_src->refcnt; |
|
|
1154 | sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP; |
|
|
1155 | } |
|
|
1156 | |
1255 | |
1157 | void |
1256 | void |
1158 | _exit (code) |
1257 | _exit (code) |
1159 | int code |
1258 | int code |
1160 | PROTOTYPE: $ |
1259 | PROTOTYPE: $ |
… | |
… | |
1197 | coro_ready[i] = newAV (); |
1296 | coro_ready[i] = newAV (); |
1198 | |
1297 | |
1199 | { |
1298 | { |
1200 | SV *sv = perl_get_sv("Coro::API", 1); |
1299 | SV *sv = perl_get_sv("Coro::API", 1); |
1201 | |
1300 | |
1202 | coroapi.schedule = api_schedule; |
1301 | coroapi.schedule = api_schedule; |
1203 | coroapi.save = api_save; |
1302 | coroapi.save = api_save; |
1204 | coroapi.cede = api_cede; |
1303 | coroapi.cede = api_cede; |
|
|
1304 | coroapi.cede_notself = api_cede_notself; |
1205 | coroapi.ready = api_ready; |
1305 | coroapi.ready = api_ready; |
1206 | coroapi.is_ready = api_is_ready; |
1306 | coroapi.is_ready = api_is_ready; |
1207 | coroapi.nready = &coro_nready; |
1307 | coroapi.nready = &coro_nready; |
1208 | coroapi.current = coro_current; |
1308 | coroapi.current = coro_current; |
1209 | |
1309 | |
1210 | GCoroAPI = &coroapi; |
1310 | GCoroAPI = &coroapi; |
1211 | sv_setiv (sv, (IV)&coroapi); |
1311 | sv_setiv (sv, (IV)&coroapi); |
1212 | SvREADONLY_on (sv); |
1312 | SvREADONLY_on (sv); |
1213 | } |
1313 | } |
… | |
… | |
1229 | RETVAL = coro->prio; |
1329 | RETVAL = coro->prio; |
1230 | |
1330 | |
1231 | if (items > 1) |
1331 | if (items > 1) |
1232 | { |
1332 | { |
1233 | if (ix) |
1333 | if (ix) |
1234 | newprio += coro->prio; |
1334 | newprio = coro->prio - newprio; |
1235 | |
1335 | |
1236 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
1336 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
1237 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
1337 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
1238 | |
1338 | |
1239 | coro->prio = newprio; |
1339 | coro->prio = newprio; |
1240 | } |
1340 | } |
1241 | } |
1341 | } |
|
|
1342 | OUTPUT: |
|
|
1343 | RETVAL |
1242 | |
1344 | |
1243 | SV * |
1345 | SV * |
1244 | ready (SV *self) |
1346 | ready (SV *self) |
1245 | PROTOTYPE: $ |
1347 | PROTOTYPE: $ |
1246 | CODE: |
1348 | CODE: |