… | |
… | |
27 | # ifndef IS_PADCONST |
27 | # ifndef IS_PADCONST |
28 | # define IS_PADCONST(v) 0 |
28 | # define IS_PADCONST(v) 0 |
29 | # endif |
29 | # endif |
30 | #endif |
30 | #endif |
31 | |
31 | |
32 | #include <signal.h> |
32 | #include <errno.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 |
33 | |
41 | |
34 | #ifdef HAVE_MMAP |
42 | #ifdef HAVE_MMAP |
35 | # include <unistd.h> |
43 | # include <unistd.h> |
36 | # include <sys/mman.h> |
44 | # include <sys/mman.h> |
37 | # ifndef MAP_ANONYMOUS |
45 | # ifndef MAP_ANONYMOUS |
… | |
… | |
39 | # define MAP_ANONYMOUS MAP_ANON |
47 | # define MAP_ANONYMOUS MAP_ANON |
40 | # else |
48 | # else |
41 | # undef HAVE_MMAP |
49 | # undef HAVE_MMAP |
42 | # endif |
50 | # endif |
43 | # 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 |
|
|
59 | # endif |
44 | #endif |
60 | #endif |
45 | |
61 | |
46 | #define SUB_INIT "Coro::State::initialize" |
62 | #define SUB_INIT "Coro::State::initialize" |
47 | #define UCORO_STATE "_coro_state" |
63 | #define UCORO_STATE "_coro_state" |
48 | |
64 | |
… | |
… | |
57 | |
73 | |
58 | #include "CoroAPI.h" |
74 | #include "CoroAPI.h" |
59 | |
75 | |
60 | #ifdef USE_ITHREADS |
76 | #ifdef USE_ITHREADS |
61 | static perl_mutex coro_mutex; |
77 | static perl_mutex coro_mutex; |
62 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
78 | # define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0) |
63 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
79 | # define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0) |
64 | #else |
80 | #else |
65 | # define LOCK 0 |
81 | # define LOCK (void)0 |
66 | # define UNLOCK 0 |
82 | # define UNLOCK (void)0 |
67 | #endif |
83 | #endif |
68 | |
84 | |
69 | static struct CoroAPI coroapi; |
85 | static struct CoroAPI coroapi; |
70 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
86 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
71 | static HV *coro_state_stash; |
87 | static HV *coro_state_stash; |
… | |
… | |
128 | I32 savestack_ix; |
144 | I32 savestack_ix; |
129 | I32 savestack_max; |
145 | I32 savestack_max; |
130 | OP **retstack; |
146 | OP **retstack; |
131 | I32 retstack_ix; |
147 | I32 retstack_ix; |
132 | I32 retstack_max; |
148 | I32 retstack_max; |
|
|
149 | PMOP *curpm; |
133 | COP *curcop; |
150 | COP *curcop; |
134 | JMPENV *top_env; |
151 | JMPENV *top_env; |
135 | |
152 | |
136 | /* data associated with this coroutine (initial args) */ |
153 | /* data associated with this coroutine (initial args) */ |
137 | AV *args; |
154 | AV *args; |
138 | }; |
155 | }; |
139 | |
156 | |
140 | typedef struct coro *Coro__State; |
157 | typedef struct coro *Coro__State; |
141 | typedef struct coro *Coro__State_or_hashref; |
158 | typedef struct coro *Coro__State_or_hashref; |
142 | |
159 | |
143 | /* mostly copied from op.c:cv_clone2 */ |
160 | static AV * |
144 | STATIC AV * |
161 | coro_clone_padlist (pTHX_ CV *cv) |
145 | clone_padlist (pTHX_ AV *protopadlist) |
|
|
146 | { |
162 | { |
147 | AV *av; |
163 | AV *padlist = CvPADLIST (cv); |
148 | I32 ix; |
|
|
149 | AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE); |
|
|
150 | AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE); |
|
|
151 | SV **pname = AvARRAY (protopad_name); |
|
|
152 | SV **ppad = AvARRAY (protopad); |
|
|
153 | I32 fname = AvFILLp (protopad_name); |
|
|
154 | I32 fpad = AvFILLp (protopad); |
|
|
155 | AV *newpadlist, *newpad_name, *newpad; |
164 | AV *newpadlist, *newpad; |
156 | SV **npad; |
|
|
157 | |
|
|
158 | newpad_name = newAV (); |
|
|
159 | for (ix = fname; ix >= 0; ix--) |
|
|
160 | av_store (newpad_name, ix, SvREFCNT_inc (pname[ix])); |
|
|
161 | |
|
|
162 | newpad = newAV (); |
|
|
163 | av_fill (newpad, AvFILLp (protopad)); |
|
|
164 | npad = AvARRAY (newpad); |
|
|
165 | |
165 | |
166 | newpadlist = newAV (); |
166 | newpadlist = newAV (); |
167 | AvREAL_off (newpadlist); |
167 | AvREAL_off (newpadlist); |
168 | av_store (newpadlist, 0, (SV *) newpad_name); |
168 | Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1); |
|
|
169 | newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)]; |
|
|
170 | --AvFILLp (padlist); |
|
|
171 | |
|
|
172 | av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE))); |
169 | av_store (newpadlist, 1, (SV *) newpad); |
173 | av_store (newpadlist, 1, (SV *)newpad); |
170 | |
|
|
171 | av = newAV (); /* will be @_ */ |
|
|
172 | av_extend (av, 0); |
|
|
173 | av_store (newpad, 0, (SV *) av); |
|
|
174 | AvFLAGS (av) = AVf_REIFY; |
|
|
175 | |
|
|
176 | for (ix = fpad; ix > 0; ix--) |
|
|
177 | { |
|
|
178 | SV *namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
179 | |
|
|
180 | if (namesv && namesv != &PL_sv_undef) |
|
|
181 | { |
|
|
182 | char *name = SvPVX (namesv); /* XXX */ |
|
|
183 | |
|
|
184 | if (SvFLAGS (namesv) & SVf_FAKE || *name == '&') |
|
|
185 | { /* lexical from outside? */ |
|
|
186 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
187 | } |
|
|
188 | else |
|
|
189 | { /* our own lexical */ |
|
|
190 | SV *sv; |
|
|
191 | if (*name == '&') |
|
|
192 | sv = SvREFCNT_inc (ppad[ix]); |
|
|
193 | else if (*name == '@') |
|
|
194 | sv = (SV *) newAV (); |
|
|
195 | else if (*name == '%') |
|
|
196 | sv = (SV *) newHV (); |
|
|
197 | else |
|
|
198 | sv = NEWSV (0, 0); |
|
|
199 | |
|
|
200 | #ifdef SvPADBUSY |
|
|
201 | if (!SvPADBUSY (sv)) |
|
|
202 | #endif |
|
|
203 | SvPADMY_on (sv); |
|
|
204 | |
|
|
205 | npad[ix] = sv; |
|
|
206 | } |
|
|
207 | } |
|
|
208 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
|
|
209 | { |
|
|
210 | npad[ix] = SvREFCNT_inc (ppad[ix]); |
|
|
211 | } |
|
|
212 | else |
|
|
213 | { |
|
|
214 | SV *sv = NEWSV (0, 0); |
|
|
215 | SvPADTMP_on (sv); |
|
|
216 | npad[ix] = sv; |
|
|
217 | } |
|
|
218 | } |
|
|
219 | |
|
|
220 | #if 0 /* return -ENOTUNDERSTOOD */ |
|
|
221 | /* Now that vars are all in place, clone nested closures. */ |
|
|
222 | |
|
|
223 | for (ix = fpad; ix > 0; ix--) { |
|
|
224 | SV* namesv = (ix <= fname) ? pname[ix] : Nullsv; |
|
|
225 | if (namesv |
|
|
226 | && namesv != &PL_sv_undef |
|
|
227 | && !(SvFLAGS(namesv) & SVf_FAKE) |
|
|
228 | && *SvPVX(namesv) == '&' |
|
|
229 | && CvCLONE(ppad[ix])) |
|
|
230 | { |
|
|
231 | CV *kid = cv_clone((CV*)ppad[ix]); |
|
|
232 | SvREFCNT_dec(ppad[ix]); |
|
|
233 | CvCLONE_on(kid); |
|
|
234 | SvPADMY_on(kid); |
|
|
235 | npad[ix] = (SV*)kid; |
|
|
236 | } |
|
|
237 | } |
|
|
238 | #endif |
|
|
239 | |
174 | |
240 | return newpadlist; |
175 | return newpadlist; |
241 | } |
176 | } |
242 | |
177 | |
243 | STATIC void |
178 | static void |
244 | free_padlist (pTHX_ AV *padlist) |
179 | free_padlist (pTHX_ AV *padlist) |
245 | { |
180 | { |
246 | /* may be during global destruction */ |
181 | /* may be during global destruction */ |
247 | if (SvREFCNT (padlist)) |
182 | if (SvREFCNT (padlist)) |
248 | { |
183 | { |
… | |
… | |
262 | |
197 | |
263 | SvREFCNT_dec ((SV*)padlist); |
198 | SvREFCNT_dec ((SV*)padlist); |
264 | } |
199 | } |
265 | } |
200 | } |
266 | |
201 | |
267 | STATIC int |
202 | static int |
268 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
203 | coro_cv_free (pTHX_ SV *sv, MAGIC *mg) |
269 | { |
204 | { |
270 | AV *padlist; |
205 | AV *padlist; |
271 | AV *av = (AV *)mg->mg_obj; |
206 | AV *av = (AV *)mg->mg_obj; |
272 | |
207 | |
273 | /* casting is fun. */ |
208 | /* casting is fun. */ |
274 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
209 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
275 | free_padlist (aTHX_ padlist); |
210 | free_padlist (aTHX_ padlist); |
276 | |
211 | |
277 | SvREFCNT_dec (av); |
212 | SvREFCNT_dec (av); |
|
|
213 | |
|
|
214 | return 0; |
278 | } |
215 | } |
279 | |
216 | |
280 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
217 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
281 | |
218 | |
282 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
219 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
283 | |
220 | |
284 | /* the next two functions merely cache the padlists */ |
221 | /* the next two functions merely cache the padlists */ |
285 | STATIC void |
222 | static void |
286 | get_padlist (pTHX_ CV *cv) |
223 | get_padlist (pTHX_ CV *cv) |
287 | { |
224 | { |
288 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
225 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
289 | |
226 | |
290 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
227 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
291 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
228 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
292 | else |
229 | else |
|
|
230 | { |
|
|
231 | #if 0 |
|
|
232 | /* this should work - but it doesn't :( */ |
|
|
233 | CV *cp = Perl_cv_clone (aTHX_ cv); |
|
|
234 | CvPADLIST (cv) = CvPADLIST (cp); |
|
|
235 | CvPADLIST (cp) = 0; |
|
|
236 | SvREFCNT_dec (cp); |
|
|
237 | #else |
293 | CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv)); |
238 | CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv); |
|
|
239 | #endif |
|
|
240 | } |
294 | } |
241 | } |
295 | |
242 | |
296 | STATIC void |
243 | static void |
297 | put_padlist (pTHX_ CV *cv) |
244 | put_padlist (pTHX_ CV *cv) |
298 | { |
245 | { |
299 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
246 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
300 | |
247 | |
301 | if (!mg) |
248 | if (!mg) |
… | |
… | |
344 | PL_scopestack_ix = c->scopestack_ix; |
291 | PL_scopestack_ix = c->scopestack_ix; |
345 | PL_scopestack_max = c->scopestack_max; |
292 | PL_scopestack_max = c->scopestack_max; |
346 | PL_savestack = c->savestack; |
293 | PL_savestack = c->savestack; |
347 | PL_savestack_ix = c->savestack_ix; |
294 | PL_savestack_ix = c->savestack_ix; |
348 | PL_savestack_max = c->savestack_max; |
295 | PL_savestack_max = c->savestack_max; |
|
|
296 | #if PERL_VERSION < 9 |
349 | PL_retstack = c->retstack; |
297 | PL_retstack = c->retstack; |
350 | PL_retstack_ix = c->retstack_ix; |
298 | PL_retstack_ix = c->retstack_ix; |
351 | PL_retstack_max = c->retstack_max; |
299 | PL_retstack_max = c->retstack_max; |
|
|
300 | #endif |
|
|
301 | PL_curpm = c->curpm; |
352 | PL_curcop = c->curcop; |
302 | PL_curcop = c->curcop; |
353 | PL_top_env = c->top_env; |
303 | PL_top_env = c->top_env; |
354 | |
304 | |
355 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
305 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
356 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
306 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
… | |
… | |
415 | } |
365 | } |
416 | |
366 | |
417 | PUSHs ((SV *)CvPADLIST(cv)); |
367 | PUSHs ((SV *)CvPADLIST(cv)); |
418 | PUSHs ((SV *)cv); |
368 | PUSHs ((SV *)cv); |
419 | |
369 | |
420 | get_padlist (aTHX_ cv); /* this is a monster */ |
370 | get_padlist (aTHX_ cv); |
421 | } |
371 | } |
422 | } |
372 | } |
423 | #ifdef CXt_FORMAT |
373 | #ifdef CXt_FORMAT |
424 | else if (CxTYPE(cx) == CXt_FORMAT) |
374 | else if (CxTYPE(cx) == CXt_FORMAT) |
425 | { |
375 | { |
… | |
… | |
469 | c->scopestack_ix = PL_scopestack_ix; |
419 | c->scopestack_ix = PL_scopestack_ix; |
470 | c->scopestack_max = PL_scopestack_max; |
420 | c->scopestack_max = PL_scopestack_max; |
471 | c->savestack = PL_savestack; |
421 | c->savestack = PL_savestack; |
472 | c->savestack_ix = PL_savestack_ix; |
422 | c->savestack_ix = PL_savestack_ix; |
473 | c->savestack_max = PL_savestack_max; |
423 | c->savestack_max = PL_savestack_max; |
|
|
424 | #if PERL_VERSION < 9 |
474 | c->retstack = PL_retstack; |
425 | c->retstack = PL_retstack; |
475 | c->retstack_ix = PL_retstack_ix; |
426 | c->retstack_ix = PL_retstack_ix; |
476 | c->retstack_max = PL_retstack_max; |
427 | c->retstack_max = PL_retstack_max; |
|
|
428 | #endif |
|
|
429 | c->curpm = PL_curpm; |
477 | c->curcop = PL_curcop; |
430 | c->curcop = PL_curcop; |
478 | c->top_env = PL_top_env; |
431 | c->top_env = PL_top_env; |
479 | } |
432 | } |
480 | |
433 | |
481 | /* |
434 | /* |
482 | * allocate various perl stacks. This is an exact copy |
435 | * allocate various perl stacks. This is an exact copy |
483 | * of perl.c:init_stacks, except that it uses less memory |
436 | * of perl.c:init_stacks, except that it uses less memory |
484 | * on the (sometimes correct) assumption that coroutines do |
437 | * on the (sometimes correct) assumption that coroutines do |
485 | * not usually need a lot of stackspace. |
438 | * not usually need a lot of stackspace. |
486 | */ |
439 | */ |
487 | STATIC void |
440 | static void |
488 | coro_init_stacks (pTHX) |
441 | coro_init_stacks (pTHX) |
489 | { |
442 | { |
490 | LOCK; |
443 | LOCK; |
491 | |
444 | |
492 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
445 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
… | |
… | |
517 | |
470 | |
518 | New(54,PL_savestack,96,ANY); |
471 | New(54,PL_savestack,96,ANY); |
519 | PL_savestack_ix = 0; |
472 | PL_savestack_ix = 0; |
520 | PL_savestack_max = 96; |
473 | PL_savestack_max = 96; |
521 | |
474 | |
|
|
475 | #if PERL_VERSION < 9 |
522 | New(54,PL_retstack,8,OP*); |
476 | New(54,PL_retstack,8,OP*); |
523 | PL_retstack_ix = 0; |
477 | PL_retstack_ix = 0; |
524 | PL_retstack_max = 8; |
478 | PL_retstack_max = 8; |
|
|
479 | #endif |
525 | |
480 | |
526 | UNLOCK; |
481 | UNLOCK; |
527 | } |
482 | } |
528 | |
483 | |
529 | /* |
484 | /* |
530 | * destroy the stacks, the callchain etc... |
485 | * destroy the stacks, the callchain etc... |
531 | */ |
486 | */ |
532 | STATIC void |
487 | static void |
533 | destroy_stacks(pTHX) |
488 | destroy_stacks(pTHX) |
534 | { |
489 | { |
535 | if (!IN_DESTRUCT) |
490 | if (!IN_DESTRUCT) |
536 | { |
491 | { |
537 | /* is this ugly, I ask? */ |
492 | /* is this ugly, I ask? */ |
… | |
… | |
569 | |
524 | |
570 | Safefree (PL_tmps_stack); |
525 | Safefree (PL_tmps_stack); |
571 | Safefree (PL_markstack); |
526 | Safefree (PL_markstack); |
572 | Safefree (PL_scopestack); |
527 | Safefree (PL_scopestack); |
573 | Safefree (PL_savestack); |
528 | Safefree (PL_savestack); |
|
|
529 | #if PERL_VERSION < 9 |
574 | Safefree (PL_retstack); |
530 | Safefree (PL_retstack); |
|
|
531 | #endif |
575 | } |
532 | } |
576 | |
533 | |
577 | static void |
534 | static void |
578 | allocate_stack (Coro__State ctx, int alloc) |
535 | allocate_stack (Coro__State ctx, int alloc) |
579 | { |
536 | { |
… | |
… | |
586 | stack->gencnt = ctx->gencnt = 0; |
543 | stack->gencnt = ctx->gencnt = 0; |
587 | |
544 | |
588 | if (alloc) |
545 | if (alloc) |
589 | { |
546 | { |
590 | #if HAVE_MMAP |
547 | #if HAVE_MMAP |
591 | stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */ |
548 | stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; /* mmap should do allocate-on-write for us */ |
592 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
549 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
593 | if (stack->sptr == (void *)-1) |
550 | if (stack->sptr != (void *)-1) |
594 | #endif |
|
|
595 | { |
551 | { |
596 | /*FIXME*//*D*//* reasonable stack size! */ |
552 | # if STACKGUARD |
|
|
553 | mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE); |
|
|
554 | # endif |
|
|
555 | } |
|
|
556 | else |
|
|
557 | #endif |
|
|
558 | { |
597 | stack->ssize = - (8192 * sizeof (long)); |
559 | stack->ssize = - (STACKSIZE * (long)sizeof (long)); |
598 | New (0, stack->sptr, 8192, long); |
560 | New (0, stack->sptr, STACKSIZE, long); |
599 | } |
561 | } |
600 | } |
562 | } |
601 | else |
563 | else |
602 | stack->sptr = 0; |
564 | stack->sptr = 0; |
603 | |
565 | |
… | |
… | |
694 | /* |
656 | /* |
695 | * this is a _very_ stripped down perl interpreter ;) |
657 | * this is a _very_ stripped down perl interpreter ;) |
696 | */ |
658 | */ |
697 | dTHX; |
659 | dTHX; |
698 | Coro__State ctx = (Coro__State)arg; |
660 | Coro__State ctx = (Coro__State)arg; |
699 | JMPENV coro_start_env; |
|
|
700 | |
661 | |
701 | PL_top_env = &ctx->start_env; |
662 | PL_top_env = &ctx->start_env; |
702 | |
663 | |
703 | ctx->cursp = 0; |
664 | ctx->cursp = 0; |
704 | PL_op = PL_op->op_next; |
665 | PL_op = PL_op->op_next; |
705 | CALLRUNOPS(aTHX); |
666 | CALLRUNOPS(aTHX); |
706 | |
667 | |
707 | abort (); |
668 | abort (); |
708 | } |
669 | } |
709 | |
670 | |
710 | STATIC void |
671 | static void |
711 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
672 | transfer (pTHX_ struct coro *prev, struct coro *next, int flags) |
712 | { |
673 | { |
713 | dSTACKLEVEL; |
674 | dSTACKLEVEL; |
714 | |
675 | |
715 | if (prev != next) |
676 | if (prev != next) |
… | |
… | |
827 | if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ |
788 | if (!SvOBJECT (sv) || SvSTASH (sv) != coro_state_stash) \ |
828 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
789 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
829 | \ |
790 | \ |
830 | } while(0) |
791 | } while(0) |
831 | |
792 | |
832 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
793 | #define SvSTATE(sv) INT2PTR (struct coro *, SvIV (sv)) |
833 | |
794 | |
834 | static void |
795 | static void |
835 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
796 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
836 | { |
797 | { |
837 | SV_CORO (prev, "Coro::transfer"); |
798 | SV_CORO (prev, "Coro::transfer"); |
… | |
… | |
855 | static int coro_nready; |
816 | static int coro_nready; |
856 | |
817 | |
857 | static void |
818 | static void |
858 | coro_enq (pTHX_ SV *sv) |
819 | coro_enq (pTHX_ SV *sv) |
859 | { |
820 | { |
|
|
821 | SV **xprio; |
|
|
822 | int prio; |
|
|
823 | |
860 | if (SvTYPE (sv) == SVt_PVHV) |
824 | if (SvTYPE (sv) != SVt_PVHV) |
861 | { |
|
|
862 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
863 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
864 | |
|
|
865 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
866 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
867 | : prio; |
|
|
868 | |
|
|
869 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
870 | coro_nready++; |
|
|
871 | |
|
|
872 | return; |
|
|
873 | } |
|
|
874 | |
|
|
875 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
825 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
826 | |
|
|
827 | xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
828 | prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
829 | |
|
|
830 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
831 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
832 | : prio; |
|
|
833 | |
|
|
834 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
835 | coro_nready++; |
876 | } |
836 | } |
877 | |
837 | |
878 | static SV * |
838 | static SV * |
879 | coro_deq (pTHX_ int min_prio) |
839 | coro_deq (pTHX_ int min_prio) |
880 | { |
840 | { |
… | |
… | |
955 | BOOT: |
915 | BOOT: |
956 | { /* {} necessary for stoopid perl-5.6.x */ |
916 | { /* {} necessary for stoopid perl-5.6.x */ |
957 | #ifdef USE_ITHREADS |
917 | #ifdef USE_ITHREADS |
958 | MUTEX_INIT (&coro_mutex); |
918 | MUTEX_INIT (&coro_mutex); |
959 | #endif |
919 | #endif |
|
|
920 | BOOT_PAGESIZE; |
960 | |
921 | |
961 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
922 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
962 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
923 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
963 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
924 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
964 | |
925 | |
… | |
… | |
1069 | av_fill (defav, items - 1); |
1030 | av_fill (defav, items - 1); |
1070 | while (items--) |
1031 | while (items--) |
1071 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
1032 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
1072 | |
1033 | |
1073 | sv = av_pop ((AV *)SvRV (yieldstack)); |
1034 | sv = av_pop ((AV *)SvRV (yieldstack)); |
1074 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
1035 | prev = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)))); |
1075 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
1036 | next = INT2PTR (struct coro *, SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)))); |
1076 | SvREFCNT_dec (sv); |
1037 | SvREFCNT_dec (sv); |
1077 | |
1038 | |
1078 | transfer (aTHX_ prev, next, 0); |
1039 | transfer (aTHX_ prev, next, 0); |
1079 | |
1040 | |
1080 | MODULE = Coro::State PACKAGE = Coro |
1041 | MODULE = Coro::State PACKAGE = Coro |
… | |
… | |
1143 | cede(...) |
1104 | cede(...) |
1144 | PROTOTYPE: |
1105 | PROTOTYPE: |
1145 | CODE: |
1106 | CODE: |
1146 | api_cede (); |
1107 | api_cede (); |
1147 | |
1108 | |
|
|
1109 | # and these are hacks |
|
|
1110 | SV * |
|
|
1111 | _aio_get_state () |
|
|
1112 | CODE: |
|
|
1113 | { |
|
|
1114 | struct { |
|
|
1115 | int errorno; |
|
|
1116 | int laststype; |
|
|
1117 | int laststatval; |
|
|
1118 | Stat_t statcache; |
|
|
1119 | } data; |
|
|
1120 | |
|
|
1121 | data.errorno = errno; |
|
|
1122 | data.laststype = PL_laststype; |
|
|
1123 | data.laststatval = PL_laststatval; |
|
|
1124 | data.statcache = PL_statcache; |
|
|
1125 | |
|
|
1126 | RETVAL = newSVpvn ((char *)&data, sizeof data); |
|
|
1127 | } |
|
|
1128 | OUTPUT: |
|
|
1129 | RETVAL |
|
|
1130 | |
|
|
1131 | void |
|
|
1132 | _aio_set_state (char *data_) |
|
|
1133 | PROTOTYPE: $ |
|
|
1134 | CODE: |
|
|
1135 | { |
|
|
1136 | struct { |
|
|
1137 | int errorno; |
|
|
1138 | int laststype; |
|
|
1139 | int laststatval; |
|
|
1140 | Stat_t statcache; |
|
|
1141 | } *data = (void *)data_; |
|
|
1142 | |
|
|
1143 | errno = data->errorno; |
|
|
1144 | PL_laststype = data->laststype; |
|
|
1145 | PL_laststatval = data->laststatval; |
|
|
1146 | PL_statcache = data->statcache; |
|
|
1147 | } |