… | |
… | |
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 | #endif |
|
|
39 | |
|
|
40 | /* the maximum number of idle cctx that will be pooled */ |
|
|
41 | #define MAX_IDLE_CCTX 8 |
|
|
42 | |
|
|
43 | #define PERL_VERSION_ATLEAST(a,b,c) \ |
|
|
44 | (PERL_REVISION > (a) \ |
|
|
45 | || (PERL_REVISION == (a) \ |
|
|
46 | && (PERL_VERSION > (b) \ |
|
|
47 | || (PERL_VERSION == (b) && PERLSUBVERSION >= (c))))) |
|
|
48 | |
|
|
49 | #if !PERL_VERSION_ATLEAST (5,6,0) |
|
|
50 | # ifndef PL_ppaddr |
|
|
51 | # define PL_ppaddr ppaddr |
|
|
52 | # endif |
|
|
53 | # ifndef call_sv |
|
|
54 | # define call_sv perl_call_sv |
|
|
55 | # endif |
|
|
56 | # ifndef get_sv |
|
|
57 | # define get_sv perl_get_sv |
|
|
58 | # endif |
|
|
59 | # ifndef get_cv |
|
|
60 | # define get_cv perl_get_cv |
|
|
61 | # endif |
|
|
62 | # ifndef IS_PADGV |
|
|
63 | # define IS_PADGV(v) 0 |
|
|
64 | # endif |
|
|
65 | # ifndef IS_PADCONST |
|
|
66 | # define IS_PADCONST(v) 0 |
|
|
67 | # endif |
|
|
68 | #endif |
|
|
69 | |
|
|
70 | /* 5.8.7 */ |
|
|
71 | #ifndef SvRV_set |
|
|
72 | # define SvRV_set(s,v) SvRV(s) = (v) |
|
|
73 | #endif |
|
|
74 | |
|
|
75 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
76 | # undef STACKGUARD |
|
|
77 | #endif |
|
|
78 | |
|
|
79 | #ifndef STACKGUARD |
|
|
80 | # define STACKGUARD 0 |
|
|
81 | #endif |
|
|
82 | |
|
|
83 | /* prefer perl internal functions over our own? */ |
|
|
84 | #ifndef PREFER_PERL_FUNCTIONS |
|
|
85 | # define PREFER_PERL_FUNCTIONS 0 |
|
|
86 | #endif |
|
|
87 | |
83 | /* The next macro should declare a variable stacklevel that contains and approximation |
88 | /* 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 |
89 | * to the current C stack pointer. Its property is that it changes with each call |
85 | * and should be unique. */ |
90 | * and should be unique. */ |
86 | #define dSTACKLEVEL int stacklevel |
91 | #define dSTACKLEVEL int stacklevel |
87 | #define STACKLEVEL ((void *)&stacklevel) |
92 | #define STACKLEVEL ((void *)&stacklevel) |
88 | |
93 | |
89 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
94 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
90 | |
95 | |
91 | #if __GNUC__ >= 3 |
96 | #if __GNUC__ >= 3 |
92 | # define attribute(x) __attribute__(x) |
97 | # define attribute(x) __attribute__(x) |
|
|
98 | # define BARRIER __asm__ __volatile__ ("" : : : "memory") |
93 | #else |
99 | #else |
94 | # define attribute(x) |
100 | # define attribute(x) |
|
|
101 | # define BARRIER |
95 | #endif |
102 | #endif |
96 | |
103 | |
97 | #define NOINLINE attribute ((noinline)) |
104 | #define NOINLINE attribute ((noinline)) |
98 | |
105 | |
99 | #include "CoroAPI.h" |
106 | #include "CoroAPI.h" |
… | |
… | |
105 | #else |
112 | #else |
106 | # define LOCK (void)0 |
113 | # define LOCK (void)0 |
107 | # define UNLOCK (void)0 |
114 | # define UNLOCK (void)0 |
108 | #endif |
115 | #endif |
109 | |
116 | |
|
|
117 | /* helper storage struct for Coro::AIO */ |
110 | struct io_state |
118 | struct io_state |
111 | { |
119 | { |
112 | int errorno; |
120 | int errorno; |
113 | I32 laststype; |
121 | I32 laststype; |
114 | int laststatval; |
122 | int laststatval; |
… | |
… | |
130 | /* the stack */ |
138 | /* the stack */ |
131 | void *sptr; |
139 | void *sptr; |
132 | long ssize; /* positive == mmap, otherwise malloc */ |
140 | long ssize; /* positive == mmap, otherwise malloc */ |
133 | |
141 | |
134 | /* cpu state */ |
142 | /* cpu state */ |
135 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
143 | void *idle_sp; /* sp of top-level transfer/schedule/cede call */ |
|
|
144 | JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */ |
136 | JMPENV *top_env; |
145 | JMPENV *top_env; |
137 | coro_context cctx; |
146 | coro_context cctx; |
138 | |
147 | |
139 | int inuse; |
148 | int inuse; |
140 | |
149 | |
… | |
… | |
142 | int valgrind_id; |
151 | int valgrind_id; |
143 | #endif |
152 | #endif |
144 | } coro_cctx; |
153 | } coro_cctx; |
145 | |
154 | |
146 | enum { |
155 | enum { |
147 | CF_RUNNING = 0x0001, /* coroutine is running */ |
156 | CF_RUNNING = 0x0001, /* coroutine is running */ |
148 | CF_READY = 0x0002, /* coroutine is ready */ |
157 | CF_READY = 0x0002, /* coroutine is ready */ |
149 | CF_NEW = 0x0004, /* ahs never been switched to */ |
158 | CF_NEW = 0x0004, /* has never been switched to */ |
|
|
159 | CF_DESTROYED = 0x0008, /* coroutine data has been freed */ |
150 | }; |
160 | }; |
151 | |
161 | |
152 | /* this is a structure representing a perl-level coroutine */ |
162 | /* this is a structure representing a perl-level coroutine */ |
153 | struct coro { |
163 | struct coro { |
154 | /* the c coroutine allocated to this perl coroutine, if any */ |
164 | /* the c coroutine allocated to this perl coroutine, if any */ |
… | |
… | |
176 | }; |
186 | }; |
177 | |
187 | |
178 | typedef struct coro *Coro__State; |
188 | typedef struct coro *Coro__State; |
179 | typedef struct coro *Coro__State_or_hashref; |
189 | typedef struct coro *Coro__State_or_hashref; |
180 | |
190 | |
|
|
191 | /** Coro ********************************************************************/ |
|
|
192 | |
|
|
193 | #define PRIO_MAX 3 |
|
|
194 | #define PRIO_HIGH 1 |
|
|
195 | #define PRIO_NORMAL 0 |
|
|
196 | #define PRIO_LOW -1 |
|
|
197 | #define PRIO_IDLE -3 |
|
|
198 | #define PRIO_MIN -4 |
|
|
199 | |
|
|
200 | /* for Coro.pm */ |
|
|
201 | static SV *coro_current; |
|
|
202 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
|
|
203 | static int coro_nready; |
|
|
204 | |
|
|
205 | /** lowlevel stuff **********************************************************/ |
|
|
206 | |
181 | static AV * |
207 | static AV * |
182 | coro_clone_padlist (CV *cv) |
208 | coro_clone_padlist (CV *cv) |
183 | { |
209 | { |
184 | AV *padlist = CvPADLIST (cv); |
210 | AV *padlist = CvPADLIST (cv); |
185 | AV *newpadlist, *newpad; |
211 | AV *newpadlist, *newpad; |
… | |
… | |
259 | |
285 | |
260 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
286 | if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0) |
261 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
287 | CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--]; |
262 | else |
288 | else |
263 | { |
289 | { |
264 | #if 0 |
290 | #if PREFER_PERL_FUNCTIONS |
265 | /* this is probably cleaner, but also slower? */ |
291 | /* this is probably cleaner, but also slower? */ |
266 | CV *cp = Perl_cv_clone (cv); |
292 | CV *cp = Perl_cv_clone (cv); |
267 | CvPADLIST (cv) = CvPADLIST (cp); |
293 | CvPADLIST (cv) = CvPADLIST (cp); |
268 | CvPADLIST (cp) = 0; |
294 | CvPADLIST (cp) = 0; |
269 | SvREFCNT_dec (cp); |
295 | SvREFCNT_dec (cp); |
… | |
… | |
292 | if (AvFILLp (av) >= AvMAX (av)) |
318 | if (AvFILLp (av) >= AvMAX (av)) |
293 | av_extend (av, AvMAX (av) + 1); |
319 | av_extend (av, AvMAX (av) + 1); |
294 | |
320 | |
295 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
321 | AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv); |
296 | } |
322 | } |
|
|
323 | |
|
|
324 | /** load & save, init *******************************************************/ |
297 | |
325 | |
298 | #define SB do { |
326 | #define SB do { |
299 | #define SE } while (0) |
327 | #define SE } while (0) |
300 | |
328 | |
301 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
329 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE |
… | |
… | |
350 | /* |
378 | /* |
351 | * the worst thing you can imagine happens first - we have to save |
379 | * the worst thing you can imagine happens first - we have to save |
352 | * (and reinitialize) all cv's in the whole callchain :( |
380 | * (and reinitialize) all cv's in the whole callchain :( |
353 | */ |
381 | */ |
354 | |
382 | |
|
|
383 | EXTEND (SP, 3 + 1); |
355 | PUSHs (Nullsv); |
384 | PUSHs (Nullsv); |
356 | /* this loop was inspired by pp_caller */ |
385 | /* this loop was inspired by pp_caller */ |
357 | for (;;) |
386 | for (;;) |
358 | { |
387 | { |
359 | while (cxix >= 0) |
388 | while (cxix >= 0) |
… | |
… | |
365 | CV *cv = cx->blk_sub.cv; |
394 | CV *cv = cx->blk_sub.cv; |
366 | |
395 | |
367 | if (CvDEPTH (cv)) |
396 | if (CvDEPTH (cv)) |
368 | { |
397 | { |
369 | EXTEND (SP, 3); |
398 | EXTEND (SP, 3); |
370 | |
|
|
371 | PUSHs ((SV *)CvPADLIST (cv)); |
399 | PUSHs ((SV *)CvPADLIST (cv)); |
372 | PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
400 | PUSHs (INT2PTR (SV *, CvDEPTH (cv))); |
373 | PUSHs ((SV *)cv); |
401 | PUSHs ((SV *)cv); |
374 | |
402 | |
375 | CvDEPTH (cv) = 0; |
403 | CvDEPTH (cv) = 0; |
376 | get_padlist (cv); |
404 | get_padlist (cv); |
377 | } |
405 | } |
378 | } |
406 | } |
379 | #ifdef CXt_FORMAT |
|
|
380 | else if (CxTYPE (cx) == CXt_FORMAT) |
|
|
381 | { |
|
|
382 | /* I never used formats, so how should I know how these are implemented? */ |
|
|
383 | /* my bold guess is as a simple, plain sub... */ |
|
|
384 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
|
|
385 | } |
|
|
386 | #endif |
|
|
387 | } |
407 | } |
388 | |
408 | |
389 | if (top_si->si_type == PERLSI_MAIN) |
409 | if (top_si->si_type == PERLSI_MAIN) |
390 | break; |
410 | break; |
391 | |
411 | |
… | |
… | |
411 | * allocate various perl stacks. This is an exact copy |
431 | * allocate various perl stacks. This is an exact copy |
412 | * of perl.c:init_stacks, except that it uses less memory |
432 | * of perl.c:init_stacks, except that it uses less memory |
413 | * on the (sometimes correct) assumption that coroutines do |
433 | * on the (sometimes correct) assumption that coroutines do |
414 | * not usually need a lot of stackspace. |
434 | * not usually need a lot of stackspace. |
415 | */ |
435 | */ |
|
|
436 | #if PREFER_PERL_FUNCTIONS |
|
|
437 | # define coro_init_stacks init_stacks |
|
|
438 | #else |
416 | static void |
439 | static void |
417 | coro_init_stacks () |
440 | coro_init_stacks () |
418 | { |
441 | { |
419 | PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT)); |
442 | PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT)); |
420 | PL_curstackinfo->si_type = PERLSI_MAIN; |
443 | PL_curstackinfo->si_type = PERLSI_MAIN; |
… | |
… | |
450 | New(54,PL_retstack,16,OP*); |
473 | New(54,PL_retstack,16,OP*); |
451 | PL_retstack_ix = 0; |
474 | PL_retstack_ix = 0; |
452 | PL_retstack_max = 16; |
475 | PL_retstack_max = 16; |
453 | #endif |
476 | #endif |
454 | } |
477 | } |
|
|
478 | #endif |
455 | |
479 | |
456 | /* |
480 | /* |
457 | * destroy the stacks, the callchain etc... |
481 | * destroy the stacks, the callchain etc... |
458 | */ |
482 | */ |
459 | static void |
483 | static void |
460 | coro_destroy_stacks () |
484 | coro_destroy_stacks () |
461 | { |
485 | { |
462 | if (!IN_DESTRUCT) |
486 | if (!IN_DESTRUCT) |
463 | { |
487 | { |
464 | /* is this ugly, I ask? */ |
488 | /* restore all saved variables and stuff */ |
465 | LEAVE_SCOPE (0); |
489 | LEAVE_SCOPE (0); |
|
|
490 | assert (PL_tmps_floor == -1); |
466 | |
491 | |
467 | /* sure it is, but more important: is it correct?? :/ */ |
492 | /* free all temporaries */ |
468 | FREETMPS; |
493 | FREETMPS; |
|
|
494 | assert (PL_tmps_ix == -1); |
469 | |
495 | |
|
|
496 | /* unwind all extra stacks */ |
470 | /*POPSTACK_TO (PL_mainstack);*//*D*//*use*/ |
497 | POPSTACK_TO (PL_mainstack); |
|
|
498 | |
|
|
499 | /* unwind main stack */ |
|
|
500 | dounwind (-1); |
471 | } |
501 | } |
472 | |
502 | |
473 | while (PL_curstackinfo->si_next) |
503 | while (PL_curstackinfo->si_next) |
474 | PL_curstackinfo = PL_curstackinfo->si_next; |
504 | PL_curstackinfo = PL_curstackinfo->si_next; |
475 | |
505 | |
476 | while (PL_curstackinfo) |
506 | while (PL_curstackinfo) |
477 | { |
507 | { |
478 | PERL_SI *p = PL_curstackinfo->si_prev; |
508 | PERL_SI *p = PL_curstackinfo->si_prev; |
479 | |
509 | |
480 | { /*D*//*remove*/ |
|
|
481 | dSP; |
|
|
482 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
|
|
483 | PUTBACK; /* possibly superfluous */ |
|
|
484 | } |
|
|
485 | |
|
|
486 | if (!IN_DESTRUCT) |
510 | if (!IN_DESTRUCT) |
487 | { |
|
|
488 | dounwind (-1);/*D*//*remove*/ |
|
|
489 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
511 | SvREFCNT_dec (PL_curstackinfo->si_stack); |
490 | } |
|
|
491 | |
512 | |
492 | Safefree (PL_curstackinfo->si_cxstack); |
513 | Safefree (PL_curstackinfo->si_cxstack); |
493 | Safefree (PL_curstackinfo); |
514 | Safefree (PL_curstackinfo); |
494 | PL_curstackinfo = p; |
515 | PL_curstackinfo = p; |
495 | } |
516 | } |
… | |
… | |
500 | Safefree (PL_savestack); |
521 | Safefree (PL_savestack); |
501 | #if !PERL_VERSION_ATLEAST (5,9,0) |
522 | #if !PERL_VERSION_ATLEAST (5,9,0) |
502 | Safefree (PL_retstack); |
523 | Safefree (PL_retstack); |
503 | #endif |
524 | #endif |
504 | } |
525 | } |
|
|
526 | |
|
|
527 | /** coroutine stack handling ************************************************/ |
505 | |
528 | |
506 | static void |
529 | static void |
507 | setup_coro (struct coro *coro) |
530 | setup_coro (struct coro *coro) |
508 | { |
531 | { |
509 | /* |
532 | /* |
… | |
… | |
702 | ++cctx_idle; |
725 | ++cctx_idle; |
703 | cctx->next = cctx_first; |
726 | cctx->next = cctx_first; |
704 | cctx_first = cctx; |
727 | cctx_first = cctx; |
705 | } |
728 | } |
706 | |
729 | |
|
|
730 | /** coroutine switching *****************************************************/ |
|
|
731 | |
707 | /* never call directly, always through the coro_state_transfer global variable */ |
732 | /* never call directly, always through the coro_state_transfer global variable */ |
708 | static void NOINLINE |
733 | static void NOINLINE |
709 | transfer (struct coro *prev, struct coro *next) |
734 | transfer (struct coro *prev, struct coro *next) |
710 | { |
735 | { |
711 | dSTACKLEVEL; |
736 | dSTACKLEVEL; |
712 | |
737 | |
713 | /* sometimes transfer is only called to set idle_sp */ |
738 | /* sometimes transfer is only called to set idle_sp */ |
714 | if (!next) |
739 | if (!next) |
715 | { |
740 | { |
716 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
741 | ((coro_cctx *)prev)->idle_sp = STACKLEVEL; |
717 | assert (((coro_cctx *)prev)->top_env = PL_top_env); /* just for the side effetc when assert is enabled */ |
742 | assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */ |
718 | } |
743 | } |
719 | else if (prev != next) |
744 | else if (prev != next) |
720 | { |
745 | { |
721 | coro_cctx *prev__cctx; |
746 | coro_cctx *prev__cctx; |
722 | |
747 | |
… | |
… | |
733 | if (!prev->flags & CF_RUNNING) |
758 | if (!prev->flags & CF_RUNNING) |
734 | croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states"); |
759 | croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states"); |
735 | |
760 | |
736 | if (next->flags & CF_RUNNING) |
761 | if (next->flags & CF_RUNNING) |
737 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
762 | croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states"); |
|
|
763 | |
|
|
764 | if (next->flags & CF_DESTROYED) |
|
|
765 | croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states"); |
738 | |
766 | |
739 | prev->flags &= ~CF_RUNNING; |
767 | prev->flags &= ~CF_RUNNING; |
740 | next->flags |= CF_RUNNING; |
768 | next->flags |= CF_RUNNING; |
741 | |
769 | |
742 | LOCK; |
770 | LOCK; |
… | |
… | |
763 | |
791 | |
764 | /* possibly "free" the cctx */ |
792 | /* possibly "free" the cctx */ |
765 | if (prev__cctx->idle_sp == STACKLEVEL) |
793 | if (prev__cctx->idle_sp == STACKLEVEL) |
766 | { |
794 | { |
767 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
795 | /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */ |
768 | assert (PL_top_env == prev__cctx->top_env); |
796 | assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te)); |
769 | |
797 | |
770 | prev->cctx = 0; |
798 | prev->cctx = 0; |
771 | |
799 | |
772 | cctx_put (prev__cctx); |
800 | cctx_put (prev__cctx); |
773 | prev__cctx->inuse = 0; |
801 | prev__cctx->inuse = 0; |
… | |
… | |
786 | PL_top_env = next->cctx->top_env; |
814 | PL_top_env = next->cctx->top_env; |
787 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
815 | coro_transfer (&prev__cctx->cctx, &next->cctx->cctx); |
788 | } |
816 | } |
789 | |
817 | |
790 | free_coro_mortal (); |
818 | free_coro_mortal (); |
791 | |
|
|
792 | UNLOCK; |
819 | UNLOCK; |
793 | } |
820 | } |
794 | } |
821 | } |
795 | |
822 | |
796 | struct transfer_args |
823 | struct transfer_args |
… | |
… | |
798 | struct coro *prev, *next; |
825 | struct coro *prev, *next; |
799 | }; |
826 | }; |
800 | |
827 | |
801 | #define TRANSFER(ta) transfer ((ta).prev, (ta).next) |
828 | #define TRANSFER(ta) transfer ((ta).prev, (ta).next) |
802 | |
829 | |
|
|
830 | /** high level stuff ********************************************************/ |
|
|
831 | |
803 | static void |
832 | static int |
804 | coro_state_destroy (struct coro *coro) |
833 | coro_state_destroy (struct coro *coro) |
805 | { |
834 | { |
806 | if (coro->refcnt--) |
835 | if (coro->flags & CF_DESTROYED) |
807 | return; |
836 | return 0; |
|
|
837 | |
|
|
838 | coro->flags |= CF_DESTROYED; |
|
|
839 | |
|
|
840 | if (coro->flags & CF_READY) |
|
|
841 | { |
|
|
842 | /* reduce nready, as destroying a ready coro effectively unreadies it */ |
|
|
843 | /* alternative: look through all ready queues and remove the coro */ |
|
|
844 | LOCK; |
|
|
845 | --coro_nready; |
|
|
846 | UNLOCK; |
|
|
847 | } |
|
|
848 | else |
|
|
849 | coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */ |
808 | |
850 | |
809 | if (coro->mainstack && coro->mainstack != main_mainstack) |
851 | if (coro->mainstack && coro->mainstack != main_mainstack) |
810 | { |
852 | { |
811 | struct coro temp; |
853 | struct coro temp; |
|
|
854 | |
|
|
855 | assert (!(coro->flags & CF_RUNNING)); |
|
|
856 | |
812 | Zero (&temp, 1, struct coro); |
857 | Zero (&temp, 1, struct coro); |
813 | temp.save = CORO_SAVE_ALL; |
858 | temp.save = CORO_SAVE_ALL; |
814 | |
859 | |
815 | if (coro->flags & CF_RUNNING) |
860 | if (coro->flags & CF_RUNNING) |
816 | croak ("FATAL: tried to destroy currently running coroutine"); |
861 | croak ("FATAL: tried to destroy currently running coroutine"); |
… | |
… | |
825 | coro->mainstack = 0; |
870 | coro->mainstack = 0; |
826 | } |
871 | } |
827 | |
872 | |
828 | cctx_destroy (coro->cctx); |
873 | cctx_destroy (coro->cctx); |
829 | SvREFCNT_dec (coro->args); |
874 | SvREFCNT_dec (coro->args); |
830 | Safefree (coro); |
875 | |
|
|
876 | return 1; |
831 | } |
877 | } |
832 | |
878 | |
833 | static int |
879 | static int |
834 | coro_state_clear (pTHX_ SV *sv, MAGIC *mg) |
880 | coro_state_free (pTHX_ SV *sv, MAGIC *mg) |
835 | { |
881 | { |
836 | struct coro *coro = (struct coro *)mg->mg_ptr; |
882 | struct coro *coro = (struct coro *)mg->mg_ptr; |
837 | mg->mg_ptr = 0; |
883 | mg->mg_ptr = 0; |
838 | |
884 | |
|
|
885 | if (--coro->refcnt < 0) |
|
|
886 | { |
839 | coro_state_destroy (coro); |
887 | coro_state_destroy (coro); |
|
|
888 | Safefree (coro); |
|
|
889 | } |
840 | |
890 | |
841 | return 0; |
891 | return 0; |
842 | } |
892 | } |
843 | |
893 | |
844 | static int |
894 | static int |
… | |
… | |
851 | return 0; |
901 | return 0; |
852 | } |
902 | } |
853 | |
903 | |
854 | static MGVTBL coro_state_vtbl = { |
904 | static MGVTBL coro_state_vtbl = { |
855 | 0, 0, 0, 0, |
905 | 0, 0, 0, 0, |
856 | coro_state_clear, |
906 | coro_state_free, |
857 | 0, |
907 | 0, |
858 | #ifdef MGf_DUP |
908 | #ifdef MGf_DUP |
859 | coro_state_dup, |
909 | coro_state_dup, |
860 | #else |
910 | #else |
861 | # define MGf_DUP 0 |
911 | # define MGf_DUP 0 |
… | |
… | |
912 | return old_save; |
962 | return old_save; |
913 | } |
963 | } |
914 | |
964 | |
915 | /** Coro ********************************************************************/ |
965 | /** Coro ********************************************************************/ |
916 | |
966 | |
917 | #define PRIO_MAX 3 |
|
|
918 | #define PRIO_HIGH 1 |
|
|
919 | #define PRIO_NORMAL 0 |
|
|
920 | #define PRIO_LOW -1 |
|
|
921 | #define PRIO_IDLE -3 |
|
|
922 | #define PRIO_MIN -4 |
|
|
923 | |
|
|
924 | /* for Coro.pm */ |
|
|
925 | static SV *coro_current; |
|
|
926 | static AV *coro_ready [PRIO_MAX-PRIO_MIN+1]; |
|
|
927 | static int coro_nready; |
|
|
928 | |
|
|
929 | static void |
967 | static void |
930 | coro_enq (SV *coro_sv) |
968 | coro_enq (SV *coro_sv) |
931 | { |
969 | { |
932 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
970 | av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv); |
933 | coro_nready++; |
|
|
934 | } |
971 | } |
935 | |
972 | |
936 | static SV * |
973 | static SV * |
937 | coro_deq (int min_prio) |
974 | coro_deq (int min_prio) |
938 | { |
975 | { |
… | |
… | |
942 | if (min_prio < 0) |
979 | if (min_prio < 0) |
943 | min_prio = 0; |
980 | min_prio = 0; |
944 | |
981 | |
945 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
982 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
946 | if (AvFILLp (coro_ready [prio]) >= 0) |
983 | if (AvFILLp (coro_ready [prio]) >= 0) |
947 | { |
|
|
948 | coro_nready--; |
|
|
949 | return av_shift (coro_ready [prio]); |
984 | return av_shift (coro_ready [prio]); |
950 | } |
|
|
951 | |
985 | |
952 | return 0; |
986 | return 0; |
953 | } |
987 | } |
954 | |
988 | |
955 | static int |
989 | static int |
… | |
… | |
963 | coro = SvSTATE (coro_sv); |
997 | coro = SvSTATE (coro_sv); |
964 | |
998 | |
965 | if (coro->flags & CF_READY) |
999 | if (coro->flags & CF_READY) |
966 | return 0; |
1000 | return 0; |
967 | |
1001 | |
968 | #if 0 /* this is actually harmless */ |
|
|
969 | if (coro->flags & CF_RUNNING) |
|
|
970 | croak ("Coro::ready called on currently running coroutine"); |
|
|
971 | #endif |
|
|
972 | |
|
|
973 | coro->flags |= CF_READY; |
1002 | coro->flags |= CF_READY; |
974 | |
1003 | |
975 | LOCK; |
1004 | LOCK; |
976 | coro_enq (SvREFCNT_inc (coro_sv)); |
1005 | coro_enq (SvREFCNT_inc (coro_sv)); |
|
|
1006 | ++coro_nready; |
977 | UNLOCK; |
1007 | UNLOCK; |
978 | |
1008 | |
979 | return 1; |
1009 | return 1; |
980 | } |
1010 | } |
981 | |
1011 | |
982 | static int |
1012 | static int |
983 | api_is_ready (SV *coro_sv) |
1013 | api_is_ready (SV *coro_sv) |
984 | { |
1014 | { |
985 | return !!SvSTATE (coro_sv)->flags & CF_READY; |
1015 | return !!(SvSTATE (coro_sv)->flags & CF_READY); |
986 | } |
1016 | } |
987 | |
1017 | |
988 | static void |
1018 | static void |
989 | prepare_schedule (struct transfer_args *ta) |
1019 | prepare_schedule (struct transfer_args *ta) |
990 | { |
1020 | { |
991 | SV *prev, *next; |
1021 | SV *prev_sv, *next_sv; |
992 | |
1022 | |
993 | for (;;) |
1023 | for (;;) |
994 | { |
1024 | { |
995 | LOCK; |
1025 | LOCK; |
996 | next = coro_deq (PRIO_MIN); |
1026 | next_sv = coro_deq (PRIO_MIN); |
|
|
1027 | |
|
|
1028 | /* nothing to schedule: call the idle handler */ |
|
|
1029 | if (!next_sv) |
|
|
1030 | { |
|
|
1031 | dSP; |
|
|
1032 | UNLOCK; |
|
|
1033 | |
|
|
1034 | ENTER; |
|
|
1035 | SAVETMPS; |
|
|
1036 | |
|
|
1037 | PUSHMARK (SP); |
|
|
1038 | PUTBACK; |
|
|
1039 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1040 | |
|
|
1041 | FREETMPS; |
|
|
1042 | LEAVE; |
|
|
1043 | continue; |
|
|
1044 | } |
|
|
1045 | |
|
|
1046 | ta->next = SvSTATE (next_sv); |
|
|
1047 | |
|
|
1048 | /* cannot transfer to destroyed coros, skip and look for next */ |
|
|
1049 | if (ta->next->flags & CF_DESTROYED) |
|
|
1050 | { |
|
|
1051 | UNLOCK; |
|
|
1052 | SvREFCNT_dec (next_sv); |
|
|
1053 | /* coro_nready is already taken care of by destroy */ |
|
|
1054 | continue; |
|
|
1055 | } |
|
|
1056 | |
|
|
1057 | --coro_nready; |
997 | UNLOCK; |
1058 | UNLOCK; |
998 | |
|
|
999 | if (next) |
|
|
1000 | break; |
1059 | break; |
1001 | |
|
|
1002 | { |
|
|
1003 | dSP; |
|
|
1004 | |
|
|
1005 | ENTER; |
|
|
1006 | SAVETMPS; |
|
|
1007 | |
|
|
1008 | PUSHMARK (SP); |
|
|
1009 | PUTBACK; |
|
|
1010 | call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD); |
|
|
1011 | |
|
|
1012 | FREETMPS; |
|
|
1013 | LEAVE; |
|
|
1014 | } |
1060 | } |
1015 | } |
|
|
1016 | |
|
|
1017 | prev = SvRV (coro_current); |
|
|
1018 | SvRV_set (coro_current, next); |
|
|
1019 | |
1061 | |
1020 | /* free this only after the transfer */ |
1062 | /* free this only after the transfer */ |
|
|
1063 | prev_sv = SvRV (coro_current); |
|
|
1064 | SvRV_set (coro_current, next_sv); |
|
|
1065 | ta->prev = SvSTATE (prev_sv); |
|
|
1066 | |
|
|
1067 | assert (ta->next->flags & CF_READY); |
|
|
1068 | ta->next->flags &= ~CF_READY; |
|
|
1069 | |
1021 | LOCK; |
1070 | LOCK; |
1022 | free_coro_mortal (); |
1071 | free_coro_mortal (); |
|
|
1072 | coro_mortal = prev_sv; |
1023 | UNLOCK; |
1073 | UNLOCK; |
1024 | coro_mortal = prev; |
|
|
1025 | |
|
|
1026 | assert (!SvROK(prev));//D |
|
|
1027 | assert (!SvROK(next));//D |
|
|
1028 | |
|
|
1029 | ta->prev = SvSTATE (prev); |
|
|
1030 | ta->next = SvSTATE (next); |
|
|
1031 | |
|
|
1032 | assert (ta->next->flags & CF_READY); |
|
|
1033 | ta->next->flags &= ~CF_READY; |
|
|
1034 | } |
1074 | } |
1035 | |
1075 | |
1036 | static void |
1076 | static void |
1037 | prepare_cede (struct transfer_args *ta) |
1077 | prepare_cede (struct transfer_args *ta) |
1038 | { |
1078 | { |
1039 | api_ready (coro_current); |
1079 | api_ready (coro_current); |
1040 | |
|
|
1041 | prepare_schedule (ta); |
1080 | prepare_schedule (ta); |
|
|
1081 | } |
|
|
1082 | |
|
|
1083 | static int |
|
|
1084 | prepare_cede_notself (struct transfer_args *ta) |
|
|
1085 | { |
|
|
1086 | if (coro_nready) |
|
|
1087 | { |
|
|
1088 | SV *prev = SvRV (coro_current); |
|
|
1089 | prepare_schedule (ta); |
|
|
1090 | api_ready (prev); |
|
|
1091 | return 1; |
|
|
1092 | } |
|
|
1093 | else |
|
|
1094 | return 0; |
1042 | } |
1095 | } |
1043 | |
1096 | |
1044 | static void |
1097 | static void |
1045 | api_schedule (void) |
1098 | api_schedule (void) |
1046 | { |
1099 | { |
… | |
… | |
1048 | |
1101 | |
1049 | prepare_schedule (&ta); |
1102 | prepare_schedule (&ta); |
1050 | TRANSFER (ta); |
1103 | TRANSFER (ta); |
1051 | } |
1104 | } |
1052 | |
1105 | |
1053 | static void |
1106 | static int |
1054 | api_cede (void) |
1107 | api_cede (void) |
1055 | { |
1108 | { |
1056 | struct transfer_args ta; |
1109 | struct transfer_args ta; |
1057 | |
1110 | |
1058 | prepare_cede (&ta); |
1111 | prepare_cede (&ta); |
|
|
1112 | |
|
|
1113 | if (ta.prev != ta.next) |
|
|
1114 | { |
1059 | TRANSFER (ta); |
1115 | TRANSFER (ta); |
|
|
1116 | return 1; |
|
|
1117 | } |
|
|
1118 | else |
|
|
1119 | return 0; |
|
|
1120 | } |
|
|
1121 | |
|
|
1122 | static int |
|
|
1123 | api_cede_notself (void) |
|
|
1124 | { |
|
|
1125 | struct transfer_args ta; |
|
|
1126 | |
|
|
1127 | if (prepare_cede_notself (&ta)) |
|
|
1128 | { |
|
|
1129 | TRANSFER (ta); |
|
|
1130 | return 1; |
|
|
1131 | } |
|
|
1132 | else |
|
|
1133 | return 0; |
1060 | } |
1134 | } |
1061 | |
1135 | |
1062 | MODULE = Coro::State PACKAGE = Coro::State |
1136 | MODULE = Coro::State PACKAGE = Coro::State |
1063 | |
1137 | |
1064 | PROTOTYPES: DISABLE |
1138 | PROTOTYPES: DISABLE |
… | |
… | |
1120 | _set_stacklevel (...) |
1194 | _set_stacklevel (...) |
1121 | ALIAS: |
1195 | ALIAS: |
1122 | Coro::State::transfer = 1 |
1196 | Coro::State::transfer = 1 |
1123 | Coro::schedule = 2 |
1197 | Coro::schedule = 2 |
1124 | Coro::cede = 3 |
1198 | Coro::cede = 3 |
|
|
1199 | Coro::cede_notself = 4 |
1125 | CODE: |
1200 | CODE: |
1126 | { |
1201 | { |
1127 | struct transfer_args ta; |
1202 | struct transfer_args ta; |
1128 | |
1203 | |
1129 | switch (ix) |
1204 | switch (ix) |
… | |
… | |
1145 | break; |
1220 | break; |
1146 | |
1221 | |
1147 | case 3: |
1222 | case 3: |
1148 | prepare_cede (&ta); |
1223 | prepare_cede (&ta); |
1149 | break; |
1224 | break; |
|
|
1225 | |
|
|
1226 | case 4: |
|
|
1227 | if (!prepare_cede_notself (&ta)) |
|
|
1228 | XSRETURN_EMPTY; |
|
|
1229 | |
|
|
1230 | break; |
1150 | } |
1231 | } |
1151 | |
1232 | |
|
|
1233 | BARRIER; |
1152 | TRANSFER (ta); |
1234 | TRANSFER (ta); |
1153 | } |
|
|
1154 | |
1235 | |
1155 | void |
1236 | if (GIMME_V != G_VOID && ta.next != ta.prev) |
1156 | _clone_state_from (SV *dst, SV *src) |
1237 | XSRETURN_YES; |
|
|
1238 | } |
|
|
1239 | |
|
|
1240 | bool |
|
|
1241 | _destroy (SV *coro_sv) |
1157 | CODE: |
1242 | CODE: |
1158 | { |
1243 | RETVAL = coro_state_destroy (SvSTATE (coro_sv)); |
1159 | struct coro *coro_src = SvSTATE (src); |
1244 | OUTPUT: |
1160 | |
1245 | RETVAL |
1161 | sv_unmagic (SvRV (dst), PERL_MAGIC_ext); |
|
|
1162 | |
|
|
1163 | ++coro_src->refcnt; |
|
|
1164 | sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP; |
|
|
1165 | } |
|
|
1166 | |
1246 | |
1167 | void |
1247 | void |
1168 | _exit (code) |
1248 | _exit (code) |
1169 | int code |
1249 | int code |
1170 | PROTOTYPE: $ |
1250 | PROTOTYPE: $ |
… | |
… | |
1207 | coro_ready[i] = newAV (); |
1287 | coro_ready[i] = newAV (); |
1208 | |
1288 | |
1209 | { |
1289 | { |
1210 | SV *sv = perl_get_sv("Coro::API", 1); |
1290 | SV *sv = perl_get_sv("Coro::API", 1); |
1211 | |
1291 | |
1212 | coroapi.schedule = api_schedule; |
1292 | coroapi.schedule = api_schedule; |
1213 | coroapi.save = api_save; |
1293 | coroapi.save = api_save; |
1214 | coroapi.cede = api_cede; |
1294 | coroapi.cede = api_cede; |
|
|
1295 | coroapi.cede_notself = api_cede_notself; |
1215 | coroapi.ready = api_ready; |
1296 | coroapi.ready = api_ready; |
1216 | coroapi.is_ready = api_is_ready; |
1297 | coroapi.is_ready = api_is_ready; |
1217 | coroapi.nready = &coro_nready; |
1298 | coroapi.nready = &coro_nready; |
1218 | coroapi.current = coro_current; |
1299 | coroapi.current = coro_current; |
1219 | |
1300 | |
1220 | GCoroAPI = &coroapi; |
1301 | GCoroAPI = &coroapi; |
1221 | sv_setiv (sv, (IV)&coroapi); |
1302 | sv_setiv (sv, (IV)&coroapi); |
1222 | SvREADONLY_on (sv); |
1303 | SvREADONLY_on (sv); |
1223 | } |
1304 | } |
… | |
… | |
1239 | RETVAL = coro->prio; |
1320 | RETVAL = coro->prio; |
1240 | |
1321 | |
1241 | if (items > 1) |
1322 | if (items > 1) |
1242 | { |
1323 | { |
1243 | if (ix) |
1324 | if (ix) |
1244 | newprio += coro->prio; |
1325 | newprio = coro->prio - newprio; |
1245 | |
1326 | |
1246 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
1327 | if (newprio < PRIO_MIN) newprio = PRIO_MIN; |
1247 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
1328 | if (newprio > PRIO_MAX) newprio = PRIO_MAX; |
1248 | |
1329 | |
1249 | coro->prio = newprio; |
1330 | coro->prio = newprio; |
1250 | } |
1331 | } |
1251 | } |
1332 | } |
|
|
1333 | OUTPUT: |
|
|
1334 | RETVAL |
1252 | |
1335 | |
1253 | SV * |
1336 | SV * |
1254 | ready (SV *self) |
1337 | ready (SV *self) |
1255 | PROTOTYPE: $ |
1338 | PROTOTYPE: $ |
1256 | CODE: |
1339 | CODE: |