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