1 | #include "EXTERN.h" |
1 | #include "EXTERN.h" |
2 | #include "perl.h" |
2 | #include "perl.h" |
3 | #include "XSUB.h" |
3 | #include "XSUB.h" |
4 | |
4 | |
5 | #if 1 |
5 | #include "patchlevel.h" |
6 | # define CHK(x) (void *)0 |
6 | |
7 | #else |
7 | #if PATCHLEVEL < 6 |
8 | # define CHK(x) if (!(x)) croak("FATAL, CHK: " #x) |
8 | # ifndef PL_ppaddr |
|
|
9 | # define PL_ppaddr ppaddr |
9 | #endif |
10 | # endif |
|
|
11 | # ifndef call_sv |
|
|
12 | # define call_sv perl_call_sv |
|
|
13 | # endif |
|
|
14 | # ifndef get_sv |
|
|
15 | # define get_sv perl_get_sv |
|
|
16 | # endif |
|
|
17 | # ifndef get_cv |
|
|
18 | # define get_cv perl_get_cv |
|
|
19 | # endif |
|
|
20 | # ifndef IS_PADGV |
|
|
21 | # define IS_PADGV(v) 0 |
|
|
22 | # endif |
|
|
23 | # ifndef IS_PADCONST |
|
|
24 | # define IS_PADCONST(v) 0 |
|
|
25 | # endif |
|
|
26 | #endif |
10 | |
27 | |
|
|
28 | #include "libcoro/coro.c" |
|
|
29 | |
|
|
30 | #include <signal.h> |
|
|
31 | |
|
|
32 | #ifdef HAVE_MMAP |
|
|
33 | # include <unistd.h> |
|
|
34 | # include <sys/mman.h> |
|
|
35 | # ifndef MAP_ANONYMOUS |
|
|
36 | # ifdef MAP_ANON |
|
|
37 | # define MAP_ANONYMOUS MAP_ANON |
|
|
38 | # else |
|
|
39 | # undef HAVE_MMAP |
|
|
40 | # endif |
|
|
41 | # endif |
|
|
42 | #endif |
|
|
43 | |
11 | #define MAY_FLUSH /* increases codesize */ |
44 | #define MAY_FLUSH /* increases codesize and is rarely used */ |
12 | |
45 | |
13 | #define SUB_INIT "Coro::State::_newcoro" |
46 | #define SUB_INIT "Coro::State::initialize" |
|
|
47 | #define UCORO_STATE "_coro_state" |
14 | |
48 | |
15 | #define SAVE_DEFAV 0x00000001 |
49 | /* The next macro should declare a variable stacklevel that contains and approximation |
16 | #define SAVE_DEFSV 0x00000002 |
50 | * to the current C stack pointer. Its property is that it changes with each call |
17 | #define SAVE_ERRSV 0x00000004 |
51 | * and should be unique. */ |
|
|
52 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
18 | |
53 | |
19 | #define SAVE_ALL -1 |
54 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
|
|
55 | |
|
|
56 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
|
|
57 | |
|
|
58 | #include "CoroAPI.h" |
|
|
59 | |
|
|
60 | static struct CoroAPI coroapi; |
|
|
61 | |
|
|
62 | /* this is actually not only the c stack but also c registers etc... */ |
|
|
63 | typedef struct { |
|
|
64 | int refcnt; /* pointer reference counter */ |
|
|
65 | int usecnt; /* shared by how many coroutines */ |
|
|
66 | int gencnt; /* generation counter */ |
|
|
67 | |
|
|
68 | coro_context cctx; |
|
|
69 | |
|
|
70 | void *sptr; |
|
|
71 | long ssize; /* positive == mmap, otherwise malloc */ |
|
|
72 | } coro_stack; |
20 | |
73 | |
21 | struct coro { |
74 | struct coro { |
|
|
75 | /* the top-level JMPENV for each coroutine, needed to catch dies. */ |
|
|
76 | JMPENV start_env; |
|
|
77 | |
|
|
78 | /* the optional C context */ |
|
|
79 | coro_stack *stack; |
|
|
80 | void *cursp; |
|
|
81 | int gencnt; |
|
|
82 | |
22 | /* optionally saved, might be zero */ |
83 | /* optionally saved, might be zero */ |
23 | AV *defav; |
84 | AV *defav; |
24 | SV *defsv; |
85 | SV *defsv; |
25 | SV *errsv; |
86 | SV *errsv; |
26 | |
87 | |
27 | /* saved global state not related to stacks */ |
88 | /* saved global state not related to stacks */ |
28 | U8 dowarn; |
89 | U8 dowarn; |
|
|
90 | I32 in_eval; |
29 | |
91 | |
30 | /* the stacks and related info (callchain etc..) */ |
92 | /* the stacks and related info (callchain etc..) */ |
31 | PERL_SI *curstackinfo; |
93 | PERL_SI *curstackinfo; |
32 | AV *curstack; |
94 | AV *curstack; |
33 | AV *mainstack; |
95 | AV *mainstack; |
34 | SV **stack_sp; |
96 | SV **stack_sp; |
35 | OP *op; |
97 | OP *op; |
36 | SV **curpad; |
98 | SV **curpad; |
|
|
99 | AV *comppad; |
37 | SV **stack_base; |
100 | SV **stack_base; |
38 | SV **stack_max; |
101 | SV **stack_max; |
39 | SV **tmps_stack; |
102 | SV **tmps_stack; |
40 | I32 tmps_floor; |
103 | I32 tmps_floor; |
41 | I32 tmps_ix; |
104 | I32 tmps_ix; |
… | |
… | |
51 | I32 savestack_max; |
114 | I32 savestack_max; |
52 | OP **retstack; |
115 | OP **retstack; |
53 | I32 retstack_ix; |
116 | I32 retstack_ix; |
54 | I32 retstack_max; |
117 | I32 retstack_max; |
55 | COP *curcop; |
118 | COP *curcop; |
|
|
119 | JMPENV *top_env; |
56 | |
120 | |
57 | /* data associated with this coroutine (initial args) */ |
121 | /* data associated with this coroutine (initial args) */ |
58 | AV *args; |
122 | AV *args; |
59 | }; |
123 | }; |
60 | |
124 | |
61 | typedef struct coro *Coro__State; |
125 | typedef struct coro *Coro__State; |
62 | typedef struct coro *Coro__State_or_hashref; |
126 | typedef struct coro *Coro__State_or_hashref; |
63 | |
127 | |
|
|
128 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
|
|
129 | static HV *coro_state_stash; |
|
|
130 | static SV *ucoro_state_sv; |
|
|
131 | static U32 ucoro_state_hash; |
64 | static HV *padlist_cache; |
132 | static HV *padlist_cache; |
|
|
133 | static SV *coro_mortal; /* will be freed after next transfer */ |
65 | |
134 | |
66 | /* mostly copied from op.c:cv_clone2 */ |
135 | /* mostly copied from op.c:cv_clone2 */ |
67 | STATIC AV * |
136 | STATIC AV * |
68 | clone_padlist (AV *protopadlist) |
137 | clone_padlist (AV *protopadlist) |
69 | { |
138 | { |
… | |
… | |
115 | sv = (SV *) newAV (); |
184 | sv = (SV *) newAV (); |
116 | else if (*name == '%') |
185 | else if (*name == '%') |
117 | sv = (SV *) newHV (); |
186 | sv = (SV *) newHV (); |
118 | else |
187 | else |
119 | sv = NEWSV (0, 0); |
188 | sv = NEWSV (0, 0); |
|
|
189 | #ifdef SvPADBUSY |
120 | if (!SvPADBUSY (sv)) |
190 | if (!SvPADBUSY (sv)) |
|
|
191 | #endif |
121 | SvPADMY_on (sv); |
192 | SvPADMY_on (sv); |
122 | npad[ix] = sv; |
193 | npad[ix] = sv; |
123 | } |
194 | } |
124 | } |
195 | } |
125 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
196 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
… | |
… | |
156 | |
227 | |
157 | return newpadlist; |
228 | return newpadlist; |
158 | } |
229 | } |
159 | |
230 | |
160 | #ifdef MAY_FLUSH |
231 | #ifdef MAY_FLUSH |
161 | STATIC AV * |
232 | STATIC void |
162 | free_padlist (AV *padlist) |
233 | free_padlist (AV *padlist) |
163 | { |
234 | { |
164 | /* may be during global destruction */ |
235 | /* may be during global destruction */ |
165 | if (SvREFCNT(padlist)) |
236 | if (SvREFCNT(padlist)) |
166 | { |
237 | { |
… | |
… | |
231 | #endif |
302 | #endif |
232 | |
303 | |
233 | #define SB do { |
304 | #define SB do { |
234 | #define SE } while (0) |
305 | #define SE } while (0) |
235 | |
306 | |
236 | #define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE |
307 | #define LOAD(state) load_state(aTHX_ (state)); |
237 | #define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE |
308 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
238 | |
309 | |
239 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
310 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
240 | |
311 | |
241 | static void |
312 | static void |
242 | load_state(pTHX_ Coro__State c) |
313 | load_state(pTHX_ Coro__State c) |
243 | { |
314 | { |
244 | PL_dowarn = c->dowarn; |
315 | PL_dowarn = c->dowarn; |
|
|
316 | PL_in_eval = c->in_eval; |
245 | |
317 | |
246 | PL_curstackinfo = c->curstackinfo; |
318 | PL_curstackinfo = c->curstackinfo; |
247 | PL_curstack = c->curstack; |
319 | PL_curstack = c->curstack; |
248 | PL_mainstack = c->mainstack; |
320 | PL_mainstack = c->mainstack; |
249 | PL_stack_sp = c->stack_sp; |
321 | PL_stack_sp = c->stack_sp; |
250 | PL_op = c->op; |
322 | PL_op = c->op; |
251 | PL_curpad = c->curpad; |
323 | PL_curpad = c->curpad; |
|
|
324 | PL_comppad = c->comppad; |
252 | PL_stack_base = c->stack_base; |
325 | PL_stack_base = c->stack_base; |
253 | PL_stack_max = c->stack_max; |
326 | PL_stack_max = c->stack_max; |
254 | PL_tmps_stack = c->tmps_stack; |
327 | PL_tmps_stack = c->tmps_stack; |
255 | PL_tmps_floor = c->tmps_floor; |
328 | PL_tmps_floor = c->tmps_floor; |
256 | PL_tmps_ix = c->tmps_ix; |
329 | PL_tmps_ix = c->tmps_ix; |
… | |
… | |
266 | PL_savestack_max = c->savestack_max; |
339 | PL_savestack_max = c->savestack_max; |
267 | PL_retstack = c->retstack; |
340 | PL_retstack = c->retstack; |
268 | PL_retstack_ix = c->retstack_ix; |
341 | PL_retstack_ix = c->retstack_ix; |
269 | PL_retstack_max = c->retstack_max; |
342 | PL_retstack_max = c->retstack_max; |
270 | PL_curcop = c->curcop; |
343 | PL_curcop = c->curcop; |
|
|
344 | PL_top_env = c->top_env; |
271 | |
345 | |
272 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
346 | if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav); |
273 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
347 | if (c->defsv) REPLACE_SV (DEFSV , c->defsv); |
274 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
348 | if (c->errsv) REPLACE_SV (ERRSV , c->errsv); |
275 | |
349 | |
… | |
… | |
302 | save_state(pTHX_ Coro__State c, int flags) |
376 | save_state(pTHX_ Coro__State c, int flags) |
303 | { |
377 | { |
304 | { |
378 | { |
305 | dSP; |
379 | dSP; |
306 | I32 cxix = cxstack_ix; |
380 | I32 cxix = cxstack_ix; |
|
|
381 | PERL_CONTEXT *ccstk = cxstack; |
307 | PERL_SI *top_si = PL_curstackinfo; |
382 | PERL_SI *top_si = PL_curstackinfo; |
308 | PERL_CONTEXT *ccstk = cxstack; |
|
|
309 | |
383 | |
310 | /* |
384 | /* |
311 | * the worst thing you can imagine happens first - we have to save |
385 | * the worst thing you can imagine happens first - we have to save |
312 | * (and reinitialize) all cv's in the whole callchain :( |
386 | * (and reinitialize) all cv's in the whole callchain :( |
313 | */ |
387 | */ |
314 | |
388 | |
315 | PUSHs (Nullsv); |
389 | PUSHs (Nullsv); |
316 | /* this loop was inspired by pp_caller */ |
390 | /* this loop was inspired by pp_caller */ |
317 | for (;;) |
391 | for (;;) |
318 | { |
392 | { |
319 | do |
393 | while (cxix >= 0) |
320 | { |
394 | { |
321 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
395 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
322 | |
396 | |
323 | if (CxTYPE(cx) == CXt_SUB) |
397 | if (CxTYPE(cx) == CXt_SUB) |
324 | { |
398 | { |
… | |
… | |
343 | PUSHs ((SV *)cv); |
417 | PUSHs ((SV *)cv); |
344 | |
418 | |
345 | get_padlist (cv); /* this is a monster */ |
419 | get_padlist (cv); /* this is a monster */ |
346 | } |
420 | } |
347 | } |
421 | } |
|
|
422 | #ifdef CXt_FORMAT |
348 | else if (CxTYPE(cx) == CXt_FORMAT) |
423 | else if (CxTYPE(cx) == CXt_FORMAT) |
349 | { |
424 | { |
350 | /* I never used formats, so how should I know how these are implemented? */ |
425 | /* I never used formats, so how should I know how these are implemented? */ |
351 | /* my bold guess is as a simple, plain sub... */ |
426 | /* my bold guess is as a simple, plain sub... */ |
352 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
427 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
353 | } |
428 | } |
|
|
429 | #endif |
354 | } |
430 | } |
355 | while (cxix >= 0); |
|
|
356 | |
431 | |
357 | if (top_si->si_type == PERLSI_MAIN) |
432 | if (top_si->si_type == PERLSI_MAIN) |
358 | break; |
433 | break; |
359 | |
434 | |
360 | top_si = top_si->si_prev; |
435 | top_si = top_si->si_prev; |
… | |
… | |
363 | } |
438 | } |
364 | |
439 | |
365 | PUTBACK; |
440 | PUTBACK; |
366 | } |
441 | } |
367 | |
442 | |
368 | c->defav = flags & SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
443 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
369 | c->defsv = flags & SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
444 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
370 | c->errsv = flags & SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
445 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
371 | |
446 | |
372 | c->dowarn = PL_dowarn; |
447 | c->dowarn = PL_dowarn; |
|
|
448 | c->in_eval = PL_in_eval; |
373 | |
449 | |
374 | c->curstackinfo = PL_curstackinfo; |
450 | c->curstackinfo = PL_curstackinfo; |
375 | c->curstack = PL_curstack; |
451 | c->curstack = PL_curstack; |
376 | c->mainstack = PL_mainstack; |
452 | c->mainstack = PL_mainstack; |
377 | c->stack_sp = PL_stack_sp; |
453 | c->stack_sp = PL_stack_sp; |
378 | c->op = PL_op; |
454 | c->op = PL_op; |
379 | c->curpad = PL_curpad; |
455 | c->curpad = PL_curpad; |
|
|
456 | c->comppad = PL_comppad; |
380 | c->stack_base = PL_stack_base; |
457 | c->stack_base = PL_stack_base; |
381 | c->stack_max = PL_stack_max; |
458 | c->stack_max = PL_stack_max; |
382 | c->tmps_stack = PL_tmps_stack; |
459 | c->tmps_stack = PL_tmps_stack; |
383 | c->tmps_floor = PL_tmps_floor; |
460 | c->tmps_floor = PL_tmps_floor; |
384 | c->tmps_ix = PL_tmps_ix; |
461 | c->tmps_ix = PL_tmps_ix; |
… | |
… | |
394 | c->savestack_max = PL_savestack_max; |
471 | c->savestack_max = PL_savestack_max; |
395 | c->retstack = PL_retstack; |
472 | c->retstack = PL_retstack; |
396 | c->retstack_ix = PL_retstack_ix; |
473 | c->retstack_ix = PL_retstack_ix; |
397 | c->retstack_max = PL_retstack_max; |
474 | c->retstack_max = PL_retstack_max; |
398 | c->curcop = PL_curcop; |
475 | c->curcop = PL_curcop; |
|
|
476 | c->top_env = PL_top_env; |
|
|
477 | } |
|
|
478 | |
|
|
479 | /* |
|
|
480 | * allocate various perl stacks. This is an exact copy |
|
|
481 | * of perl.c:init_stacks, except that it uses less memory |
|
|
482 | * on the assumption that coroutines do not usually need |
|
|
483 | * a lot of stackspace. |
|
|
484 | */ |
|
|
485 | STATIC void |
|
|
486 | coro_init_stacks (pTHX) |
|
|
487 | { |
|
|
488 | PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); |
|
|
489 | PL_curstackinfo->si_type = PERLSI_MAIN; |
|
|
490 | PL_curstack = PL_curstackinfo->si_stack; |
|
|
491 | PL_mainstack = PL_curstack; /* remember in case we switch stacks */ |
|
|
492 | |
|
|
493 | PL_stack_base = AvARRAY(PL_curstack); |
|
|
494 | PL_stack_sp = PL_stack_base; |
|
|
495 | PL_stack_max = PL_stack_base + AvMAX(PL_curstack); |
|
|
496 | |
|
|
497 | New(50,PL_tmps_stack,96,SV*); |
|
|
498 | PL_tmps_floor = -1; |
|
|
499 | PL_tmps_ix = -1; |
|
|
500 | PL_tmps_max = 96; |
|
|
501 | |
|
|
502 | New(54,PL_markstack,16,I32); |
|
|
503 | PL_markstack_ptr = PL_markstack; |
|
|
504 | PL_markstack_max = PL_markstack + 16; |
|
|
505 | |
|
|
506 | #ifdef SET_MARK_OFFSET |
|
|
507 | SET_MARK_OFFSET; |
|
|
508 | #endif |
|
|
509 | |
|
|
510 | New(54,PL_scopestack,16,I32); |
|
|
511 | PL_scopestack_ix = 0; |
|
|
512 | PL_scopestack_max = 16; |
|
|
513 | |
|
|
514 | New(54,PL_savestack,96,ANY); |
|
|
515 | PL_savestack_ix = 0; |
|
|
516 | PL_savestack_max = 96; |
|
|
517 | |
|
|
518 | New(54,PL_retstack,8,OP*); |
|
|
519 | PL_retstack_ix = 0; |
|
|
520 | PL_retstack_max = 8; |
399 | } |
521 | } |
400 | |
522 | |
401 | /* |
523 | /* |
402 | * destroy the stacks, the callchain etc... |
524 | * destroy the stacks, the callchain etc... |
403 | * still there is a memleak of 128 bytes... |
|
|
404 | */ |
525 | */ |
405 | STATIC void |
526 | STATIC void |
406 | destroy_stacks(pTHX) |
527 | destroy_stacks(pTHX) |
407 | { |
528 | { |
|
|
529 | if (!IN_DESTRUCT) |
|
|
530 | { |
408 | /* is this ugly, I ask? */ |
531 | /* is this ugly, I ask? */ |
409 | while (PL_scopestack_ix) |
532 | while (PL_scopestack_ix) |
410 | LEAVE; |
533 | LEAVE; |
411 | |
534 | |
412 | /* sure it is, but more important: is it correct?? :/ */ |
535 | /* sure it is, but more important: is it correct?? :/ */ |
413 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
536 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
414 | FREETMPS; |
537 | FREETMPS; |
|
|
538 | } |
415 | |
539 | |
416 | while (PL_curstackinfo->si_next) |
540 | while (PL_curstackinfo->si_next) |
417 | PL_curstackinfo = PL_curstackinfo->si_next; |
541 | PL_curstackinfo = PL_curstackinfo->si_next; |
418 | |
542 | |
419 | while (PL_curstackinfo) |
543 | while (PL_curstackinfo) |
… | |
… | |
424 | dSP; |
548 | dSP; |
425 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
549 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
426 | PUTBACK; /* possibly superfluous */ |
550 | PUTBACK; /* possibly superfluous */ |
427 | } |
551 | } |
428 | |
552 | |
|
|
553 | if (!IN_DESTRUCT) |
|
|
554 | { |
429 | dounwind(-1); |
555 | dounwind(-1); |
430 | |
|
|
431 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
556 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
|
|
557 | } |
|
|
558 | |
432 | Safefree(PL_curstackinfo->si_cxstack); |
559 | Safefree(PL_curstackinfo->si_cxstack); |
433 | Safefree(PL_curstackinfo); |
560 | Safefree(PL_curstackinfo); |
434 | PL_curstackinfo = p; |
561 | PL_curstackinfo = p; |
435 | } |
562 | } |
436 | |
563 | |
… | |
… | |
439 | Safefree(PL_scopestack); |
566 | Safefree(PL_scopestack); |
440 | Safefree(PL_savestack); |
567 | Safefree(PL_savestack); |
441 | Safefree(PL_retstack); |
568 | Safefree(PL_retstack); |
442 | } |
569 | } |
443 | |
570 | |
|
|
571 | static void |
|
|
572 | allocate_stack (Coro__State ctx, int alloc) |
|
|
573 | { |
|
|
574 | coro_stack *stack; |
|
|
575 | |
|
|
576 | New (0, stack, 1, coro_stack); |
|
|
577 | |
|
|
578 | stack->refcnt = 1; |
|
|
579 | stack->usecnt = 1; |
|
|
580 | stack->gencnt = ctx->gencnt = 0; |
|
|
581 | if (alloc) |
|
|
582 | { |
|
|
583 | #if HAVE_MMAP |
|
|
584 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
|
|
585 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
|
|
586 | if (stack->sptr == (void *)-1) |
|
|
587 | #endif |
|
|
588 | { |
|
|
589 | /*FIXME*//*D*//* reasonable stack size! */ |
|
|
590 | stack->ssize = -4096 * sizeof (long); |
|
|
591 | New (0, stack->sptr, 4096, long); |
|
|
592 | } |
|
|
593 | } |
|
|
594 | else |
|
|
595 | stack->sptr = 0; |
|
|
596 | |
|
|
597 | ctx->stack = stack; |
|
|
598 | } |
|
|
599 | |
|
|
600 | static void |
|
|
601 | deallocate_stack (Coro__State ctx) |
|
|
602 | { |
|
|
603 | coro_stack *stack = ctx->stack; |
|
|
604 | |
|
|
605 | ctx->stack = 0; |
|
|
606 | |
|
|
607 | if (stack) |
|
|
608 | { |
|
|
609 | if (!--stack->refcnt) |
|
|
610 | { |
|
|
611 | #ifdef HAVE_MMAP |
|
|
612 | if (stack->ssize > 0 && stack->sptr) |
|
|
613 | munmap (stack->sptr, stack->ssize); |
|
|
614 | else |
|
|
615 | #endif |
|
|
616 | Safefree (stack->sptr); |
|
|
617 | |
|
|
618 | Safefree (stack); |
|
|
619 | } |
|
|
620 | else if (ctx->gencnt == stack->gencnt) |
|
|
621 | --stack->usecnt; |
|
|
622 | } |
|
|
623 | } |
|
|
624 | |
|
|
625 | static void |
|
|
626 | setup_coro (void *arg) |
|
|
627 | { |
|
|
628 | /* |
|
|
629 | * emulate part of the perl startup here. |
|
|
630 | */ |
|
|
631 | dSP; |
|
|
632 | Coro__State ctx = (Coro__State)arg; |
|
|
633 | SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE); |
|
|
634 | |
|
|
635 | coro_init_stacks (aTHX); |
|
|
636 | /*PL_curcop = 0;*/ |
|
|
637 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
|
|
638 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
639 | GvAV (PL_defgv) = ctx->args; ctx->args = 0; |
|
|
640 | |
|
|
641 | SPAGAIN; |
|
|
642 | |
|
|
643 | if (ctx->stack) |
|
|
644 | { |
|
|
645 | ctx->cursp = 0; |
|
|
646 | |
|
|
647 | PUSHMARK(SP); |
|
|
648 | PUTBACK; |
|
|
649 | (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL); |
|
|
650 | |
|
|
651 | if (SvTRUE (ERRSV)) |
|
|
652 | croak (NULL); |
|
|
653 | else |
|
|
654 | croak ("FATAL: CCTXT coroutine returned!"); |
|
|
655 | } |
|
|
656 | else |
|
|
657 | { |
|
|
658 | UNOP myop; |
|
|
659 | |
|
|
660 | PL_op = (OP *)&myop; |
|
|
661 | |
|
|
662 | Zero(&myop, 1, UNOP); |
|
|
663 | myop.op_next = Nullop; |
|
|
664 | myop.op_flags = OPf_WANT_VOID; |
|
|
665 | |
|
|
666 | PUSHMARK(SP); |
|
|
667 | XPUSHs (sub_init); |
|
|
668 | /* |
|
|
669 | * the next line is slightly wrong, as PL_op->op_next |
|
|
670 | * is actually being executed so we skip the first op. |
|
|
671 | * that doesn't matter, though, since it is only |
|
|
672 | * pp_nextstate and we never return... |
|
|
673 | * ah yes, and I don't care anyways ;) |
|
|
674 | */ |
|
|
675 | PUTBACK; |
|
|
676 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
|
|
677 | SPAGAIN; |
|
|
678 | |
|
|
679 | ENTER; /* necessary e.g. for dounwind */ |
|
|
680 | } |
|
|
681 | } |
|
|
682 | |
|
|
683 | static void |
|
|
684 | continue_coro (void *arg) |
|
|
685 | { |
|
|
686 | /* |
|
|
687 | * this is a _very_ stripped down perl interpreter ;) |
|
|
688 | */ |
|
|
689 | Coro__State ctx = (Coro__State)arg; |
|
|
690 | JMPENV coro_start_env; |
|
|
691 | |
|
|
692 | PL_top_env = &ctx->start_env; |
|
|
693 | |
|
|
694 | ctx->cursp = 0; |
|
|
695 | PL_op = PL_op->op_next; |
|
|
696 | CALLRUNOPS(aTHX); |
|
|
697 | |
|
|
698 | abort (); |
|
|
699 | } |
|
|
700 | |
444 | STATIC void |
701 | STATIC void |
445 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
702 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
446 | { |
703 | { |
447 | dSP; |
704 | dSTACKLEVEL; |
|
|
705 | static struct coro *xnext; |
448 | |
706 | |
449 | if (prev != next) |
707 | if (prev != next) |
450 | { |
708 | { |
451 | /* |
709 | xnext = next; |
452 | * this could be done in newprocess which would lead to |
710 | |
453 | * extremely elegant and fast (just SAVE/LOAD) |
|
|
454 | * code here, but lazy allocation of stacks has also |
|
|
455 | * some virtues and the overhead of the if() is nil. |
|
|
456 | */ |
|
|
457 | if (next->mainstack) |
711 | if (next->mainstack) |
458 | { |
712 | { |
459 | SAVE (prev, flags); |
713 | SAVE (prev, flags); |
460 | LOAD (next); |
714 | LOAD (next); |
|
|
715 | |
461 | /* mark this state as in-use */ |
716 | /* mark this state as in-use */ |
462 | next->mainstack = 0; |
717 | next->mainstack = 0; |
463 | next->tmps_ix = -2; |
718 | next->tmps_ix = -2; |
|
|
719 | |
|
|
720 | /* stacklevel changed? if yes, grab the stack for us! */ |
|
|
721 | if (flags & TRANSFER_SAVE_CCTXT) |
|
|
722 | { |
|
|
723 | if (!prev->stack) |
|
|
724 | allocate_stack (prev, 0); |
|
|
725 | else if (prev->cursp != stacklevel |
|
|
726 | && prev->stack->usecnt > 1) |
|
|
727 | { |
|
|
728 | prev->gencnt = ++prev->stack->gencnt; |
|
|
729 | prev->stack->usecnt = 1; |
|
|
730 | } |
|
|
731 | |
|
|
732 | /* has our stack been invalidated? */ |
|
|
733 | if (next->stack && next->stack->gencnt != next->gencnt) |
|
|
734 | { |
|
|
735 | deallocate_stack (next); |
|
|
736 | allocate_stack (next, 1); |
|
|
737 | coro_create (&(next->stack->cctx), |
|
|
738 | continue_coro, (void *)next, |
|
|
739 | next->stack->sptr, labs (next->stack->ssize)); |
|
|
740 | } |
|
|
741 | |
|
|
742 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
743 | /* don't add any code here */ |
|
|
744 | } |
|
|
745 | |
464 | } |
746 | } |
465 | else if (next->tmps_ix == -2) |
747 | else if (next->tmps_ix == -2) |
466 | { |
|
|
467 | croak ("tried to transfer to running coroutine"); |
748 | croak ("tried to transfer to running coroutine"); |
468 | } |
|
|
469 | else |
749 | else |
470 | { |
750 | { |
471 | /* |
|
|
472 | * emulate part of the perl startup here. |
|
|
473 | */ |
|
|
474 | UNOP myop; |
|
|
475 | |
|
|
476 | SAVE (prev, -1); /* first get rid of the old state */ |
751 | SAVE (prev, -1); /* first get rid of the old state */ |
477 | |
752 | |
478 | init_stacks (); /* from perl.c */ |
753 | if (flags & TRANSFER_SAVE_CCTXT) |
479 | SPAGAIN; |
|
|
480 | |
|
|
481 | PL_op = (OP *)&myop; |
|
|
482 | /*PL_curcop = 0;*/ |
|
|
483 | SvREFCNT_dec (GvAV (PL_defgv)); |
|
|
484 | GvAV (PL_defgv) = next->args; |
|
|
485 | |
|
|
486 | Zero(&myop, 1, UNOP); |
|
|
487 | myop.op_next = Nullop; |
|
|
488 | myop.op_flags = OPf_WANT_VOID; |
|
|
489 | |
|
|
490 | PUSHMARK(SP); |
|
|
491 | XPUSHs ((SV*)get_cv(SUB_INIT, TRUE)); |
|
|
492 | /* |
|
|
493 | * the next line is slightly wrong, as PL_op->op_next |
|
|
494 | * is actually being executed so we skip the first op. |
|
|
495 | * that doesn't matter, though, since it is only |
|
|
496 | * pp_nextstate and we never return... |
|
|
497 | * ah yes, and I don't care anyways ;) |
|
|
498 | */ |
754 | { |
499 | PUTBACK; |
755 | if (!prev->stack) |
500 | PL_op = pp_entersub(aTHX); |
756 | allocate_stack (prev, 0); |
501 | SPAGAIN; |
|
|
502 | |
757 | |
503 | ENTER; /* necessary e.g. for dounwind */ |
758 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
|
|
759 | { |
|
|
760 | PL_top_env = &next->start_env; |
|
|
761 | |
|
|
762 | setup_coro (next); |
|
|
763 | |
|
|
764 | prev->stack->refcnt++; |
|
|
765 | prev->stack->usecnt++; |
|
|
766 | next->stack = prev->stack; |
|
|
767 | next->gencnt = prev->gencnt; |
|
|
768 | } |
|
|
769 | else |
|
|
770 | { |
|
|
771 | assert (!next->stack); |
|
|
772 | allocate_stack (next, 1); |
|
|
773 | coro_create (&(next->stack->cctx), |
|
|
774 | setup_coro, (void *)next, |
|
|
775 | next->stack->sptr, labs (next->stack->ssize)); |
|
|
776 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
777 | /* don't add any code here */ |
|
|
778 | } |
|
|
779 | } |
|
|
780 | else |
|
|
781 | setup_coro (next); |
504 | } |
782 | } |
|
|
783 | |
|
|
784 | /* |
|
|
785 | * xnext is now either prev or next, depending on wether |
|
|
786 | * we switched the c stack or not. that's why I use a global |
|
|
787 | * variable, that should become thread-specific at one point. |
|
|
788 | */ |
|
|
789 | xnext->cursp = stacklevel; |
505 | } |
790 | } |
|
|
791 | |
|
|
792 | if (coro_mortal) |
|
|
793 | { |
|
|
794 | SvREFCNT_dec (coro_mortal); |
|
|
795 | coro_mortal = 0; |
|
|
796 | } |
|
|
797 | } |
|
|
798 | |
|
|
799 | #define SV_CORO(sv,func) \ |
|
|
800 | do { \ |
|
|
801 | if (SvROK (sv)) \ |
|
|
802 | sv = SvRV (sv); \ |
|
|
803 | \ |
|
|
804 | if (SvTYPE(sv) == SVt_PVHV) \ |
|
|
805 | { \ |
|
|
806 | HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ |
|
|
807 | \ |
|
|
808 | if (!he) \ |
|
|
809 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ |
|
|
810 | \ |
|
|
811 | (sv) = SvRV (HeVAL(he)); \ |
|
|
812 | } \ |
|
|
813 | \ |
|
|
814 | /* must also be changed inside Coro::Cont::yield */ \ |
|
|
815 | if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \ |
|
|
816 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
|
|
817 | \ |
|
|
818 | } while(0) |
|
|
819 | |
|
|
820 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
|
|
821 | |
|
|
822 | static void |
|
|
823 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
|
|
824 | { |
|
|
825 | SV_CORO (prev, "Coro::transfer"); |
|
|
826 | SV_CORO (next, "Coro::transfer"); |
|
|
827 | |
|
|
828 | transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); |
|
|
829 | } |
|
|
830 | |
|
|
831 | /** Coro ********************************************************************/ |
|
|
832 | |
|
|
833 | #define PRIO_MAX 3 |
|
|
834 | #define PRIO_HIGH 1 |
|
|
835 | #define PRIO_NORMAL 0 |
|
|
836 | #define PRIO_LOW -1 |
|
|
837 | #define PRIO_IDLE -3 |
|
|
838 | #define PRIO_MIN -4 |
|
|
839 | |
|
|
840 | /* for Coro.pm */ |
|
|
841 | static GV *coro_current, *coro_idle; |
|
|
842 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
|
|
843 | static int coro_nready; |
|
|
844 | |
|
|
845 | static void |
|
|
846 | coro_enq (SV *sv) |
|
|
847 | { |
|
|
848 | if (SvTYPE (sv) == SVt_PVHV) |
|
|
849 | { |
|
|
850 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
|
|
851 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
|
|
852 | |
|
|
853 | prio = prio > PRIO_MAX ? PRIO_MAX |
|
|
854 | : prio < PRIO_MIN ? PRIO_MIN |
|
|
855 | : prio; |
|
|
856 | |
|
|
857 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
858 | coro_nready++; |
|
|
859 | |
|
|
860 | return; |
|
|
861 | } |
|
|
862 | |
|
|
863 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
|
|
864 | } |
|
|
865 | |
|
|
866 | static SV * |
|
|
867 | coro_deq (int min_prio) |
|
|
868 | { |
|
|
869 | int prio = PRIO_MAX - PRIO_MIN; |
|
|
870 | |
|
|
871 | min_prio -= PRIO_MIN; |
|
|
872 | if (min_prio < 0) |
|
|
873 | min_prio = 0; |
|
|
874 | |
|
|
875 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
|
|
876 | if (av_len (coro_ready[prio]) >= 0) |
|
|
877 | { |
|
|
878 | coro_nready--; |
|
|
879 | return av_shift (coro_ready[prio]); |
|
|
880 | } |
|
|
881 | |
|
|
882 | return 0; |
|
|
883 | } |
|
|
884 | |
|
|
885 | static void |
|
|
886 | api_ready (SV *coro) |
|
|
887 | { |
|
|
888 | if (SvROK (coro)) |
|
|
889 | coro = SvRV (coro); |
|
|
890 | |
|
|
891 | coro_enq (SvREFCNT_inc (coro)); |
|
|
892 | } |
|
|
893 | |
|
|
894 | static void |
|
|
895 | api_schedule (void) |
|
|
896 | { |
|
|
897 | SV *prev, *next; |
|
|
898 | |
|
|
899 | prev = SvRV (GvSV (coro_current)); |
|
|
900 | next = coro_deq (PRIO_MIN); |
|
|
901 | |
|
|
902 | if (!next) |
|
|
903 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
|
|
904 | |
|
|
905 | /* free this only after the transfer */ |
|
|
906 | coro_mortal = prev; |
|
|
907 | SV_CORO (prev, "Coro::schedule"); |
|
|
908 | |
|
|
909 | SvRV (GvSV (coro_current)) = next; |
|
|
910 | |
|
|
911 | SV_CORO (next, "Coro::schedule"); |
|
|
912 | |
|
|
913 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), |
|
|
914 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
|
|
915 | } |
|
|
916 | |
|
|
917 | static void |
|
|
918 | api_cede (void) |
|
|
919 | { |
|
|
920 | coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
921 | |
|
|
922 | api_schedule (); |
506 | } |
923 | } |
507 | |
924 | |
508 | MODULE = Coro::State PACKAGE = Coro::State |
925 | MODULE = Coro::State PACKAGE = Coro::State |
509 | |
926 | |
510 | PROTOTYPES: ENABLE |
927 | PROTOTYPES: ENABLE |
511 | |
928 | |
512 | BOOT: |
929 | BOOT: |
|
|
930 | { /* {} necessary for stoopid perl-5.6.x */ |
|
|
931 | ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); |
|
|
932 | PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); |
513 | HV * stash = gv_stashpvn("Coro::State", 10, TRUE); |
933 | coro_state_stash = gv_stashpv ("Coro::State", TRUE); |
514 | |
934 | |
515 | newCONSTSUB (stash, "SAVE_DEFAV", newSViv (SAVE_DEFAV)); |
935 | newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); |
516 | newCONSTSUB (stash, "SAVE_DEFSV", newSViv (SAVE_DEFSV)); |
936 | newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); |
517 | newCONSTSUB (stash, "SAVE_ERRSV", newSViv (SAVE_ERRSV)); |
937 | newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); |
|
|
938 | newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); |
518 | |
939 | |
519 | if (!padlist_cache) |
940 | if (!padlist_cache) |
520 | padlist_cache = newHV (); |
941 | padlist_cache = newHV (); |
|
|
942 | |
|
|
943 | main_mainstack = PL_mainstack; |
|
|
944 | |
|
|
945 | coroapi.ver = CORO_API_VERSION; |
|
|
946 | coroapi.transfer = api_transfer; |
|
|
947 | } |
521 | |
948 | |
522 | Coro::State |
949 | Coro::State |
523 | _newprocess(args) |
950 | _newprocess(args) |
524 | SV * args |
951 | SV * args |
525 | PROTOTYPE: $ |
952 | PROTOTYPE: $ |
… | |
… | |
527 | Coro__State coro; |
954 | Coro__State coro; |
528 | |
955 | |
529 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
956 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
530 | croak ("Coro::State::_newprocess expects an arrayref"); |
957 | croak ("Coro::State::_newprocess expects an arrayref"); |
531 | |
958 | |
532 | New (0, coro, 1, struct coro); |
959 | Newz (0, coro, 1, struct coro); |
533 | |
960 | |
|
|
961 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
534 | coro->mainstack = 0; /* actual work is done inside transfer */ |
962 | coro->mainstack = 0; /* actual work is done inside transfer */ |
535 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
963 | coro->stack = 0; |
|
|
964 | |
|
|
965 | /* same as JMPENV_BOOTSTRAP */ |
|
|
966 | /* we might be able to recycle start_env, but safe is safe */ |
|
|
967 | //Zero(&coro->start_env, 1, JMPENV); |
|
|
968 | coro->start_env.je_ret = -1; |
|
|
969 | coro->start_env.je_mustcatch = TRUE; |
536 | |
970 | |
537 | RETVAL = coro; |
971 | RETVAL = coro; |
538 | OUTPUT: |
972 | OUTPUT: |
539 | RETVAL |
973 | RETVAL |
540 | |
974 | |
541 | void |
975 | void |
542 | transfer(prev, next, flags = SAVE_DEFAV) |
976 | transfer(prev, next, flags) |
543 | Coro::State_or_hashref prev |
977 | SV *prev |
544 | Coro::State_or_hashref next |
978 | SV *next |
545 | int flags |
979 | int flags |
546 | PROTOTYPE: @ |
980 | PROTOTYPE: @ |
547 | CODE: |
981 | CODE: |
548 | |
982 | PUTBACK; |
|
|
983 | SV_CORO (next, "Coro::transfer"); |
|
|
984 | SV_CORO (prev, "Coro::transfer"); |
549 | transfer (aTHX_ prev, next, flags); |
985 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
|
|
986 | SPAGAIN; |
550 | |
987 | |
551 | void |
988 | void |
552 | DESTROY(coro) |
989 | DESTROY(coro) |
553 | Coro::State coro |
990 | Coro::State coro |
554 | CODE: |
991 | CODE: |
555 | |
992 | |
556 | if (coro->mainstack) |
993 | if (coro->mainstack && coro->mainstack != main_mainstack) |
557 | { |
994 | { |
558 | struct coro temp; |
995 | struct coro temp; |
559 | |
996 | |
|
|
997 | PUTBACK; |
560 | SAVE(aTHX_ (&temp), SAVE_ALL); |
998 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
561 | LOAD(aTHX_ coro); |
999 | LOAD(aTHX_ coro); |
|
|
1000 | SPAGAIN; |
562 | |
1001 | |
563 | destroy_stacks (); |
1002 | destroy_stacks (aTHX); |
564 | |
1003 | |
565 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
1004 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
|
|
1005 | SPAGAIN; |
|
|
1006 | |
|
|
1007 | coro->mainstack = 0; |
566 | } |
1008 | } |
567 | |
1009 | |
|
|
1010 | deallocate_stack (coro); |
|
|
1011 | SvREFCNT_dec (coro->args); |
568 | Safefree (coro); |
1012 | Safefree (coro); |
569 | |
1013 | |
570 | void |
1014 | void |
571 | flush() |
1015 | flush() |
572 | CODE: |
1016 | CODE: |
573 | #ifdef MAY_FLUSH |
1017 | #ifdef MAY_FLUSH |
574 | flush_padlist_cache (); |
1018 | flush_padlist_cache (); |
575 | #endif |
1019 | #endif |
576 | |
1020 | |
|
|
1021 | void |
|
|
1022 | _exit(code) |
|
|
1023 | int code |
|
|
1024 | PROTOTYPE: $ |
|
|
1025 | CODE: |
|
|
1026 | #if defined(__GLIBC__) || _POSIX_C_SOURCE |
|
|
1027 | _exit (code); |
|
|
1028 | #else |
|
|
1029 | signal (SIGTERM, SIG_DFL); |
|
|
1030 | raise (SIGTERM); |
|
|
1031 | exit (code); |
|
|
1032 | #endif |
|
|
1033 | |
577 | MODULE = Coro::State PACKAGE = Coro::Cont |
1034 | MODULE = Coro::State PACKAGE = Coro::Cont |
578 | |
1035 | |
579 | # this is dirty and should be in it's own .xs |
1036 | # this is slightly dirty (should expose a c-level api) |
580 | |
1037 | |
581 | void |
1038 | void |
582 | result(...) |
1039 | yield(...) |
583 | PROTOTYPE: @ |
1040 | PROTOTYPE: @ |
584 | CODE: |
1041 | CODE: |
585 | static SV *returnstk; |
1042 | static SV *returnstk; |
586 | SV *sv; |
1043 | SV *sv; |
587 | AV *defav = GvAV (PL_defgv); |
1044 | AV *defav = GvAV (PL_defgv); |
588 | struct coro *prev, *next; |
1045 | struct coro *prev, *next; |
589 | |
1046 | |
590 | if (!returnstk) |
1047 | if (!returnstk) |
591 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
1048 | returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE)); |
592 | |
1049 | |
593 | /* set up @_ */ |
1050 | /* set up @_ -- ugly */ |
594 | av_clear (defav); |
1051 | av_clear (defav); |
595 | av_fill (defav, items - 1); |
1052 | av_fill (defav, items - 1); |
596 | while (items--) |
1053 | while (items--) |
597 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
1054 | av_store (defav, items, SvREFCNT_inc (ST(items))); |
598 | |
1055 | |
599 | mg_get (returnstk); /* isn't documentation wrong for mg_get? */ |
1056 | mg_get (returnstk); /* isn't documentation wrong for mg_get? */ |
600 | sv = av_pop ((AV *)SvRV (returnstk)); |
1057 | sv = av_pop ((AV *)SvRV (returnstk)); |
601 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
1058 | prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0))); |
602 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
1059 | next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0))); |
603 | SvREFCNT_dec (sv); |
1060 | SvREFCNT_dec (sv); |
|
|
1061 | |
604 | transfer(prev, next, 0); |
1062 | transfer(aTHX_ prev, next, 0); |
605 | |
1063 | |
|
|
1064 | MODULE = Coro::State PACKAGE = Coro |
|
|
1065 | |
|
|
1066 | # this is slightly dirty (should expose a c-level api) |
|
|
1067 | |
|
|
1068 | BOOT: |
|
|
1069 | { |
|
|
1070 | int i; |
|
|
1071 | HV *stash = gv_stashpv ("Coro", TRUE); |
|
|
1072 | |
|
|
1073 | newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); |
|
|
1074 | newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); |
|
|
1075 | newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); |
|
|
1076 | newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); |
|
|
1077 | newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); |
|
|
1078 | newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); |
|
|
1079 | |
|
|
1080 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
|
|
1081 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
|
|
1082 | |
|
|
1083 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
|
|
1084 | coro_ready[i] = newAV (); |
|
|
1085 | |
|
|
1086 | { |
|
|
1087 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
1088 | |
|
|
1089 | coroapi.schedule = api_schedule; |
|
|
1090 | coroapi.cede = api_cede; |
|
|
1091 | coroapi.ready = api_ready; |
|
|
1092 | coroapi.nready = &coro_nready; |
|
|
1093 | coroapi.current = coro_current; |
|
|
1094 | |
|
|
1095 | GCoroAPI = &coroapi; |
|
|
1096 | sv_setiv(sv, (IV)&coroapi); |
|
|
1097 | SvREADONLY_on(sv); |
|
|
1098 | } |
|
|
1099 | } |
|
|
1100 | |
|
|
1101 | void |
|
|
1102 | ready(self) |
|
|
1103 | SV * self |
|
|
1104 | PROTOTYPE: $ |
|
|
1105 | CODE: |
|
|
1106 | api_ready (self); |
|
|
1107 | |
|
|
1108 | int |
|
|
1109 | nready(...) |
|
|
1110 | PROTOTYPE: |
|
|
1111 | CODE: |
|
|
1112 | RETVAL = coro_nready; |
|
|
1113 | OUTPUT: |
|
|
1114 | RETVAL |
|
|
1115 | |
|
|
1116 | void |
|
|
1117 | schedule(...) |
|
|
1118 | PROTOTYPE: |
|
|
1119 | CODE: |
|
|
1120 | api_schedule (); |
|
|
1121 | |
|
|
1122 | void |
|
|
1123 | cede(...) |
|
|
1124 | PROTOTYPE: |
|
|
1125 | CODE: |
|
|
1126 | api_cede (); |
|
|
1127 | |