… | |
… | |
28 | # define IS_PADCONST(v) 0 |
28 | # define IS_PADCONST(v) 0 |
29 | # endif |
29 | # endif |
30 | #endif |
30 | #endif |
31 | |
31 | |
32 | #include <errno.h> |
32 | #include <errno.h> |
33 | #include <signal.h> |
33 | |
|
|
34 | #if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64 |
|
|
35 | # undef STACKGUARD |
|
|
36 | #endif |
|
|
37 | |
|
|
38 | #ifndef STACKGUARD |
|
|
39 | # define STACKGUARD 0 |
|
|
40 | #endif |
34 | |
41 | |
35 | #ifdef HAVE_MMAP |
42 | #ifdef HAVE_MMAP |
36 | # include <unistd.h> |
43 | # include <unistd.h> |
37 | # include <sys/mman.h> |
44 | # include <sys/mman.h> |
38 | # ifndef MAP_ANONYMOUS |
45 | # ifndef MAP_ANONYMOUS |
39 | # ifdef MAP_ANON |
46 | # ifdef MAP_ANON |
40 | # define MAP_ANONYMOUS MAP_ANON |
47 | # define MAP_ANONYMOUS MAP_ANON |
41 | # else |
48 | # else |
42 | # undef HAVE_MMAP |
49 | # undef HAVE_MMAP |
43 | # endif |
50 | # endif |
|
|
51 | # endif |
|
|
52 | # include <limits.h> |
|
|
53 | # ifndef PAGESIZE |
|
|
54 | # define PAGESIZE pagesize |
|
|
55 | # define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE) |
|
|
56 | static long pagesize; |
|
|
57 | # else |
|
|
58 | # define BOOT_PAGESIZE |
44 | # endif |
59 | # endif |
45 | #endif |
60 | #endif |
46 | |
61 | |
47 | #define SUB_INIT "Coro::State::initialize" |
62 | #define SUB_INIT "Coro::State::initialize" |
48 | #define UCORO_STATE "_coro_state" |
63 | #define UCORO_STATE "_coro_state" |
… | |
… | |
140 | }; |
155 | }; |
141 | |
156 | |
142 | typedef struct coro *Coro__State; |
157 | typedef struct coro *Coro__State; |
143 | typedef struct coro *Coro__State_or_hashref; |
158 | typedef struct coro *Coro__State_or_hashref; |
144 | |
159 | |
145 | /* mostly copied from op.c:cv_clone2 */ |
160 | static AV * |
146 | STATIC AV * |
161 | coro_clone_padlist (pTHX_ CV *cv) |
147 | clone_padlist (pTHX_ AV *protopadlist) |
|
|
148 | { |
162 | { |
149 | AV *av; |
163 | AV *padlist = CvPADLIST (cv); |
150 | I32 ix; |
|
|
151 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
|
|
152 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
|
|
153 | SV **pname = AvARRAY (protopad_name); |
|
|
154 | SV **ppad = AvARRAY (protopad); |
|
|
155 | I32 fname = AvFILLp (protopad_name); |
|
|
156 | I32 fpad = AvFILLp (protopad); |
|
|
157 | AV *newpadlist, *newpad_name, *newpad; |
164 | AV *newpadlist, *newpad; |
158 | SV **npad; |
|
|
159 | |
|
|
160 | newpad_name = newAV (); |
|
|
161 | for (ix = fname; ix >= 0; ix--) |
|
|
162 | av_store (newpad_name, ix, SvREFCNT_inc (pname[ix])); |
|
|
163 | |
|
|
164 | newpad = newAV (); |
|
|
165 | av_fill (newpad, AvFILLp (protopad)); |
|
|
166 | npad = AvARRAY (newpad); |
|
|
167 | |
165 | |
168 | newpadlist = newAV (); |
166 | newpadlist = newAV (); |
169 | AvREAL_off (newpadlist); |
167 | AvREAL_off (newpadlist); |
170 | av_store (newpadlist, 0, (SV *) newpad_name); |
168 | #if PERL_VERSION < 9 |
|
|
169 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
170 | #else |
|
|
171 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1); |
|
|
172 | #endif |
|
|
173 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
174 | --AvFILLp (padlist); |
|
|
175 | |
|
|
176 | av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
171 | av_store (newpadlist, 1, (SV *) newpad); |
177 | av_store (newpadlist, 1, (SV *)newpad); |
172 | |
|
|
173 | av = newAV (); /* will be @_ */ |
|
|
174 | av_extend (av, 0); |
|
|
175 | av_store (newpad, 0, (SV *) av); |
|
|
176 | AvREIFY_on (av); |
|
|
177 | |
|
|
178 | for (ix = fpad; ix > 0; ix--) |
|
|
179 | { |
|
|
180 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
181 | |
|
|
182 | if (namesv && namesv != &PL_sv_undef) |
|
|
183 | { |
|
|
184 | char *name = SvPVX (namesv); /* XXX */ |
|
|
185 | |
|
|
186 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
|
|
187 | { /* lexical from outside? */ |
|
|
188 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
189 | } |
|
|
190 | else |
|
|
191 | { /* our own lexical */ |
|
|
192 | SV *sv; |
|
|
193 | if (*name == '&') |
|
|
194 | sv = SvREFCNT_inc (ppad[ix]); |
|
|
195 | else if (*name == '@') |
|
|
196 | sv = (SV *) newAV (); |
|
|
197 | else if (*name == '%') |
|
|
198 | sv = (SV *) newHV (); |
|
|
199 | else |
|
|
200 | sv = NEWSV (0, 0); |
|
|
201 | |
|
|
202 | #ifdef SvPADBUSY |
|
|
203 | if (!SvPADBUSY (sv)) |
|
|
204 | #endif |
|
|
205 | SvPADMY_on (sv); |
|
|
206 | |
|
|
207 | npad[ix] = sv; |
|
|
208 | } |
|
|
209 | } |
|
|
210 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
|
|
211 | { |
|
|
212 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
213 | } |
|
|
214 | else |
|
|
215 | { |
|
|
216 | SV *sv = NEWSV (0, 0); |
|
|
217 | SvPADTMP_on (sv); |
|
|
218 | npad[ix] = sv; |
|
|
219 | } |
|
|
220 | } |
|
|
221 | |
|
|
222 | #if 0 /* return -ENOTUNDERSTOOD */ |
|
|
223 | /* Now that vars are all in place, clone nested closures. */ |
|
|
224 | |
|
|
225 | for (ix = fpad; ix > 0; ix--) { |
|
|
226 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
227 | if (namesv |
|
|
228 | && namesv != &PL_sv_undef |
|
|
229 | && !(SvFLAGS(namesv) & SVf_FAKE) |
|
|
230 | && *SvPVX(namesv) == '&' |
|
|
231 | && CvCLONE(ppad[ix])) |
|
|
232 | { |
|
|
233 | CV *kid = cv_clone((CV*)ppad[ix]); |
|
|
234 | SvREFCNT_dec(ppad[ix]); |
|
|
235 | CvCLONE_on(kid); |
|
|
236 | SvPADMY_on(kid); |
|
|
237 | npad[ix] = (SV*)kid; |
|
|
238 | } |
|
|
239 | } |
|
|
240 | #endif |
|
|
241 | |
178 | |
242 | return newpadlist; |
179 | return newpadlist; |
243 | } |
180 | } |
244 | |
181 | |
245 | STATIC void |
182 | static void |
246 | free_padlist (pTHX_ AV *padlist) |
183 | free_padlist (pTHX_ AV *padlist) |
247 | { |
184 | { |
248 | /* may be during global destruction */ |
185 | /* may be during global destruction */ |
249 | if (SvREFCNT (padlist)) |
186 | if (SvREFCNT (padlist)) |
250 | { |
187 | { |
… | |
… | |
264 | |
201 | |
265 | SvREFCNT_dec ((SV*)padlist); |
202 | SvREFCNT_dec ((SV*)padlist); |
266 | } |
203 | } |
267 | } |
204 | } |
268 | |
205 | |
269 | STATIC int |
206 | static int |
270 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
207 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
271 | { |
208 | { |
272 | AV *padlist; |
209 | AV *padlist; |
273 | AV *av = (AV *)mg->mg_obj; |
210 | AV *av = (AV *)mg->mg_obj; |
274 | |
211 | |
275 | /* casting is fun. */ |
212 | /* casting is fun. */ |
276 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
213 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
277 | free_padlist (aTHX_ padlist); |
214 | free_padlist (aTHX_ padlist); |
278 | |
215 | |
279 | SvREFCNT_dec (av); |
216 | SvREFCNT_dec (av); |
|
|
217 | |
|
|
218 | return 0; |
280 | } |
219 | } |
281 | |
220 | |
282 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
221 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
283 | |
222 | |
284 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
223 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
285 | |
224 | |
286 | /* the next two functions merely cache the padlists */ |
225 | /* the next two functions merely cache the padlists */ |
287 | STATIC void |
226 | static void |
288 | get_padlist (pTHX_ CV *cv) |
227 | get_padlist (pTHX_ CV *cv) |
289 | { |
228 | { |
290 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
229 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
291 | |
230 | |
292 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
231 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
293 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
232 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
294 | else |
233 | else |
|
|
234 | { |
|
|
235 | #if 0 |
|
|
236 | /* this should work - but it doesn't :( */ |
|
|
237 | CV *cp = Perl_cv_clone (aTHX_ cv); |
|
|
238 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
239 | CvPADLIST (cp) = 0; |
|
|
240 | SvREFCNT_dec (cp); |
|
|
241 | #else |
295 | CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); |
242 | CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
|
|
243 | #endif |
|
|
244 | } |
296 | } |
245 | } |
297 | |
246 | |
298 | STATIC void |
247 | static void |
299 | put_padlist (pTHX_ CV *cv) |
248 | put_padlist (pTHX_ CV *cv) |
300 | { |
249 | { |
301 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
250 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
302 | |
251 | |
303 | if (!mg) |
252 | if (!mg) |
… | |
… | |
420 | } |
369 | } |
421 | |
370 | |
422 | PUSHs ((SV *)CvPADLIST(cv)); |
371 | PUSHs ((SV *)CvPADLIST(cv)); |
423 | PUSHs ((SV *)cv); |
372 | PUSHs ((SV *)cv); |
424 | |
373 | |
425 | get_padlist (aTHX_ cv); /* this is a monster */ |
374 | get_padlist (aTHX_ cv); |
426 | } |
375 | } |
427 | } |
376 | } |
428 | #ifdef CXt_FORMAT |
377 | #ifdef CXt_FORMAT |
429 | else if (CxTYPE(cx) == CXt_FORMAT) |
378 | else if (CxTYPE(cx) == CXt_FORMAT) |
430 | { |
379 | { |
… | |
… | |
490 | * allocate various perl stacks. This is an exact copy |
439 | * allocate various perl stacks. This is an exact copy |
491 | * of perl.c:init_stacks, except that it uses less memory |
440 | * of perl.c:init_stacks, except that it uses less memory |
492 | * on the (sometimes correct) assumption that coroutines do |
441 | * on the (sometimes correct) assumption that coroutines do |
493 | * not usually need a lot of stackspace. |
442 | * not usually need a lot of stackspace. |
494 | */ |
443 | */ |
495 | STATIC void |
444 | static void |
496 | coro_init_stacks (pTHX) |
445 | coro_init_stacks (pTHX) |
497 | { |
446 | { |
498 | LOCK; |
447 | LOCK; |
499 | |
448 | |
500 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
449 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
… | |
… | |
537 | } |
486 | } |
538 | |
487 | |
539 | /* |
488 | /* |
540 | * destroy the stacks, the callchain etc... |
489 | * destroy the stacks, the callchain etc... |
541 | */ |
490 | */ |
542 | STATIC void |
491 | static void |
543 | destroy_stacks(pTHX) |
492 | destroy_stacks(pTHX) |
544 | { |
493 | { |
545 | if (!IN_DESTRUCT) |
494 | if (!IN_DESTRUCT) |
546 | { |
495 | { |
547 | /* is this ugly, I ask? */ |
496 | /* is this ugly, I ask? */ |
… | |
… | |
598 | stack->gencnt = ctx->gencnt = 0; |
547 | stack->gencnt = ctx->gencnt = 0; |
599 | |
548 | |
600 | if (alloc) |
549 | if (alloc) |
601 | { |
550 | { |
602 | #if HAVE_MMAP |
551 | #if HAVE_MMAP |
603 | stack->ssize = STACKSIZE * sizeof (long); /* mmap should do allocate-on-write for us */ |
552 | stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; /* mmap should do allocate-on-write for us */ |
604 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
553 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
605 | if (stack->sptr == (void *)-1) |
554 | if (stack->sptr != (void *)-1) |
606 | #endif |
|
|
607 | { |
555 | { |
608 | /*FIXME*//*D*//* reasonable stack size! */ |
556 | # if STACKGUARD |
|
|
557 | mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE); |
|
|
558 | # endif |
|
|
559 | } |
|
|
560 | else |
|
|
561 | #endif |
|
|
562 | { |
609 | stack->ssize = - (STACKSIZE * sizeof (long)); |
563 | stack->ssize = - (STACKSIZE * (long)sizeof (long)); |
610 | New (0, stack->sptr, STACKSIZE, long); |
564 | New (0, stack->sptr, STACKSIZE, long); |
611 | } |
565 | } |
612 | } |
566 | } |
613 | else |
567 | else |
614 | stack->sptr = 0; |
568 | stack->sptr = 0; |
… | |
… | |
706 | /* |
660 | /* |
707 | * this is a _very_ stripped down perl interpreter ;) |
661 | * this is a _very_ stripped down perl interpreter ;) |
708 | */ |
662 | */ |
709 | dTHX; |
663 | dTHX; |
710 | Coro__State ctx = (Coro__State)arg; |
664 | Coro__State ctx = (Coro__State)arg; |
711 | JMPENV coro_start_env; |
|
|
712 | |
665 | |
713 | PL_top_env = &ctx->start_env; |
666 | PL_top_env = &ctx->start_env; |
714 | |
667 | |
715 | ctx->cursp = 0; |
668 | ctx->cursp = 0; |
716 | PL_op = PL_op->op_next; |
669 | PL_op = PL_op->op_next; |
717 | CALLRUNOPS(aTHX); |
670 | CALLRUNOPS(aTHX); |
718 | |
671 | |
719 | abort (); |
672 | abort (); |
720 | } |
673 | } |
721 | |
674 | |
722 | STATIC void |
675 | static void |
723 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
676 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
724 | { |
677 | { |
725 | dSTACKLEVEL; |
678 | dSTACKLEVEL; |
726 | |
679 | |
727 | if (prev != next) |
680 | if (prev != next) |
… | |
… | |
839 | if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ |
792 | if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ |
840 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
793 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
841 | \ |
794 | \ |
842 | } while(0) |
795 | } while(0) |
843 | |
796 | |
844 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
797 | #define SvSTATE(sv) INT2PTR (struct coro *, SvIV (sv)) |
845 | |
798 | |
846 | static void |
799 | static void |
847 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
800 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
848 | { |
801 | { |
849 | SV_CORO (prev, "Coro::transfer"); |
802 | SV_CORO (prev, "Coro::transfer"); |
… | |
… | |
867 | static int coro_nready; |
820 | static int coro_nready; |
868 | |
821 | |
869 | static void |
822 | static void |
870 | coro_enq (pTHX_ SV *sv) |
823 | coro_enq (pTHX_ SV *sv) |
871 | { |
824 | { |
|
|
825 | SV **xprio; |
|
|
826 | int prio; |
|
|
827 | |
872 | if (SvTYPE (sv) != SVt_PVHV) |
828 | if (SvTYPE (sv) != SVt_PVHV) |
873 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
829 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
874 | |
830 | |
875 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
831 | xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
876 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
832 | prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
877 | |
833 | |
878 | prio = prio > PRIO_MAX ? PRIO_MAX |
834 | prio = prio > PRIO_MAX ? PRIO_MAX |
879 | : prio < PRIO_MIN ? PRIO_MIN |
835 | : prio < PRIO_MIN ? PRIO_MIN |
880 | : prio; |
836 | : prio; |
881 | |
837 | |
… | |
… | |
963 | BOOT: |
919 | BOOT: |
964 | { /* {} necessary for stoopid perl-5.6.x */ |
920 | { /* {} necessary for stoopid perl-5.6.x */ |
965 | #ifdef USE_ITHREADS |
921 | #ifdef USE_ITHREADS |
966 | MUTEX_INIT (&coro_mutex); |
922 | MUTEX_INIT (&coro_mutex); |
967 | #endif |
923 | #endif |
|
|
924 | BOOT_PAGESIZE; |
968 | |
925 | |
969 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
926 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
970 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
927 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
971 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
928 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
972 | |
929 | |
… | |
… | |
1077 | av_fill (defav, items - 1); |
1034 | av_fill (defav, items - 1); |
1078 | while (items--) |
1035 | while (items--) |
1079 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
1036 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
1080 | |
1037 | |
1081 | sv = av_pop ((AV *)SvRV (yieldstack)); |
1038 | sv = av_pop ((AV *)SvRV (yieldstack)); |
1082 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
1039 | prev = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)))); |
1083 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
1040 | next = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)))); |
1084 | SvREFCNT_dec (sv); |
1041 | SvREFCNT_dec (sv); |
1085 | |
1042 | |
1086 | transfer (aTHX_ prev, next, 0); |
1043 | transfer (aTHX_ prev, next, 0); |
1087 | |
1044 | |
1088 | MODULE = Coro::State PACKAGE = Coro |
1045 | MODULE = Coro::State PACKAGE = Coro |