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 | #include "patchlevel.h" |
|
|
6 | |
|
|
7 | #if PATCHLEVEL < 6 |
|
|
8 | # ifndef PL_ppaddr |
|
|
9 | # define PL_ppaddr ppaddr |
|
|
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 |
|
|
27 | |
5 | #include "libcoro/coro.c" |
28 | #include "libcoro/coro.c" |
6 | |
29 | |
7 | #include <signal.h> |
30 | #include <signal.h> |
8 | |
31 | |
9 | #ifdef HAVE_MMAP |
32 | #ifdef HAVE_MMAP |
10 | # include <unistd.h> |
33 | # include <unistd.h> |
11 | # include <sys/mman.h> |
34 | # include <sys/mman.h> |
12 | # ifndef MAP_ANON |
|
|
13 | # ifdef MAP_ANONYMOUS |
35 | # ifndef MAP_ANONYMOUS |
14 | # define MAP_ANON MAP_ANONYMOUS |
36 | # ifdef MAP_ANON |
|
|
37 | # define MAP_ANONYMOUS MAP_ANON |
15 | # else |
38 | # else |
16 | # undef HAVE_MMAP |
39 | # undef HAVE_MMAP |
17 | # endif |
40 | # endif |
18 | # endif |
41 | # endif |
19 | #endif |
42 | #endif |
20 | |
43 | |
21 | #define MAY_FLUSH /* increases codesize */ |
|
|
22 | |
|
|
23 | #define SUB_INIT "Coro::State::initialize" |
44 | #define SUB_INIT "Coro::State::initialize" |
24 | #define UCORO_STATE "_coro_state" |
45 | #define UCORO_STATE "_coro_state" |
25 | |
46 | |
26 | /* The next macro should delcare a variable stacklevel that contains and approximation |
47 | /* The next macro should declare a variable stacklevel that contains and approximation |
27 | * to the current C stack pointer. Its property is that it changes with each call |
48 | * to the current C stack pointer. Its property is that it changes with each call |
28 | * and should be unique. */ |
49 | * and should be unique. */ |
29 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
50 | #define dSTACKLEVEL void *stacklevel = &stacklevel |
|
|
51 | |
|
|
52 | #define IN_DESTRUCT (PL_main_cv == Nullcv) |
30 | |
53 | |
31 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
54 | #define labs(l) ((l) >= 0 ? (l) : -(l)) |
32 | |
55 | |
33 | #include "CoroAPI.h" |
56 | #include "CoroAPI.h" |
34 | |
57 | |
… | |
… | |
45 | void *sptr; |
68 | void *sptr; |
46 | long ssize; /* positive == mmap, otherwise malloc */ |
69 | long ssize; /* positive == mmap, otherwise malloc */ |
47 | } coro_stack; |
70 | } coro_stack; |
48 | |
71 | |
49 | struct coro { |
72 | struct coro { |
|
|
73 | /* the top-level JMPENV for each coroutine, needed to catch dies. */ |
|
|
74 | JMPENV start_env; |
|
|
75 | |
50 | /* the optional C context */ |
76 | /* the optional C context */ |
51 | coro_stack *stack; |
77 | coro_stack *stack; |
52 | void *cursp; |
78 | void *cursp; |
53 | int gencnt; |
79 | int gencnt; |
54 | |
80 | |
… | |
… | |
66 | AV *curstack; |
92 | AV *curstack; |
67 | AV *mainstack; |
93 | AV *mainstack; |
68 | SV **stack_sp; |
94 | SV **stack_sp; |
69 | OP *op; |
95 | OP *op; |
70 | SV **curpad; |
96 | SV **curpad; |
|
|
97 | AV *comppad; |
71 | SV **stack_base; |
98 | SV **stack_base; |
72 | SV **stack_max; |
99 | SV **stack_max; |
73 | SV **tmps_stack; |
100 | SV **tmps_stack; |
74 | I32 tmps_floor; |
101 | I32 tmps_floor; |
75 | I32 tmps_ix; |
102 | I32 tmps_ix; |
… | |
… | |
99 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
126 | static AV *main_mainstack; /* used to differentiate between $main and others */ |
100 | static HV *coro_state_stash; |
127 | static HV *coro_state_stash; |
101 | static SV *ucoro_state_sv; |
128 | static SV *ucoro_state_sv; |
102 | static U32 ucoro_state_hash; |
129 | static U32 ucoro_state_hash; |
103 | static HV *padlist_cache; |
130 | static HV *padlist_cache; |
|
|
131 | static SV *coro_mortal; /* will be freed after next transfer */ |
104 | |
132 | |
105 | /* mostly copied from op.c:cv_clone2 */ |
133 | /* mostly copied from op.c:cv_clone2 */ |
106 | STATIC AV * |
134 | STATIC AV * |
107 | clone_padlist (AV *protopadlist) |
135 | clone_padlist (AV *protopadlist) |
108 | { |
136 | { |
… | |
… | |
154 | sv = (SV *) newAV (); |
182 | sv = (SV *) newAV (); |
155 | else if (*name == '%') |
183 | else if (*name == '%') |
156 | sv = (SV *) newHV (); |
184 | sv = (SV *) newHV (); |
157 | else |
185 | else |
158 | sv = NEWSV (0, 0); |
186 | sv = NEWSV (0, 0); |
|
|
187 | #ifdef SvPADBUSY |
159 | if (!SvPADBUSY (sv)) |
188 | if (!SvPADBUSY (sv)) |
|
|
189 | #endif |
160 | SvPADMY_on (sv); |
190 | SvPADMY_on (sv); |
161 | npad[ix] = sv; |
191 | npad[ix] = sv; |
162 | } |
192 | } |
163 | } |
193 | } |
164 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
194 | else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix])) |
… | |
… | |
194 | #endif |
224 | #endif |
195 | |
225 | |
196 | return newpadlist; |
226 | return newpadlist; |
197 | } |
227 | } |
198 | |
228 | |
199 | #ifdef MAY_FLUSH |
229 | STATIC void |
200 | STATIC AV * |
|
|
201 | free_padlist (AV *padlist) |
230 | free_padlist (AV *padlist) |
202 | { |
231 | { |
203 | /* may be during global destruction */ |
232 | /* may be during global destruction */ |
204 | if (SvREFCNT(padlist)) |
233 | if (SvREFCNT (padlist)) |
205 | { |
234 | { |
206 | I32 i = AvFILLp(padlist); |
235 | I32 i = AvFILLp (padlist); |
207 | while (i >= 0) |
236 | while (i >= 0) |
208 | { |
237 | { |
209 | SV **svp = av_fetch(padlist, i--, FALSE); |
238 | SV **svp = av_fetch (padlist, i--, FALSE); |
210 | SV *sv = svp ? *svp : Nullsv; |
|
|
211 | if (sv) |
239 | if (svp) |
|
|
240 | { |
|
|
241 | SV *sv; |
|
|
242 | while (&PL_sv_undef != (sv = av_pop ((AV *)*svp))) |
212 | SvREFCNT_dec(sv); |
243 | SvREFCNT_dec (sv); |
|
|
244 | |
|
|
245 | SvREFCNT_dec (*svp); |
|
|
246 | } |
213 | } |
247 | } |
214 | |
248 | |
215 | SvREFCNT_dec((SV*)padlist); |
249 | SvREFCNT_dec ((SV*)padlist); |
216 | } |
250 | } |
217 | } |
251 | } |
218 | #endif |
252 | |
|
|
253 | STATIC int |
|
|
254 | coro_cv_free (SV *sv, MAGIC *mg) |
|
|
255 | { |
|
|
256 | AV *padlist; |
|
|
257 | AV *av = (AV *)mg->mg_obj; |
|
|
258 | |
|
|
259 | /* casting is fun. */ |
|
|
260 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
261 | free_padlist (padlist); |
|
|
262 | } |
|
|
263 | |
|
|
264 | #define PERL_MAGIC_coro PERL_MAGIC_ext |
|
|
265 | |
|
|
266 | static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free}; |
219 | |
267 | |
220 | /* the next two functions merely cache the padlists */ |
268 | /* the next two functions merely cache the padlists */ |
221 | STATIC void |
269 | STATIC void |
222 | get_padlist (CV *cv) |
270 | get_padlist (CV *cv) |
223 | { |
271 | { |
224 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0); |
272 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
225 | |
273 | |
226 | if (he && AvFILLp ((AV *)*he) >= 0) |
274 | if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0) |
227 | CvPADLIST (cv) = (AV *)av_pop ((AV *)*he); |
275 | CvPADLIST (cv) = (AV *)av_pop ((AV *)mg->mg_obj); |
228 | else |
276 | else |
229 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
277 | CvPADLIST (cv) = clone_padlist (CvPADLIST (cv)); |
230 | } |
278 | } |
231 | |
279 | |
232 | STATIC void |
280 | STATIC void |
233 | put_padlist (CV *cv) |
281 | put_padlist (CV *cv) |
234 | { |
282 | { |
235 | SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1); |
283 | MAGIC *mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
236 | |
284 | |
237 | if (SvTYPE (*he) != SVt_PVAV) |
285 | if (!mg) |
238 | { |
286 | { |
239 | SvREFCNT_dec (*he); |
287 | sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0); |
|
|
288 | mg = mg_find ((SV *)cv, PERL_MAGIC_coro); |
|
|
289 | mg->mg_virtual = &vtbl_coro; |
240 | *he = (SV *)newAV (); |
290 | mg->mg_obj = (SV *)newAV (); |
241 | } |
291 | } |
242 | |
292 | |
243 | av_push ((AV *)*he, (SV *)CvPADLIST (cv)); |
293 | av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv)); |
244 | } |
294 | } |
245 | |
|
|
246 | #ifdef MAY_FLUSH |
|
|
247 | STATIC void |
|
|
248 | flush_padlist_cache () |
|
|
249 | { |
|
|
250 | HV *hv = padlist_cache; |
|
|
251 | padlist_cache = newHV (); |
|
|
252 | |
|
|
253 | if (hv_iterinit (hv)) |
|
|
254 | { |
|
|
255 | HE *he; |
|
|
256 | AV *padlist; |
|
|
257 | |
|
|
258 | while (!!(he = hv_iternext (hv))) |
|
|
259 | { |
|
|
260 | AV *av = (AV *)HeVAL(he); |
|
|
261 | |
|
|
262 | /* casting is fun. */ |
|
|
263 | while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av))) |
|
|
264 | free_padlist (padlist); |
|
|
265 | } |
|
|
266 | } |
|
|
267 | |
|
|
268 | SvREFCNT_dec (hv); |
|
|
269 | } |
|
|
270 | #endif |
|
|
271 | |
295 | |
272 | #define SB do { |
296 | #define SB do { |
273 | #define SE } while (0) |
297 | #define SE } while (0) |
274 | |
298 | |
275 | #define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE |
299 | #define LOAD(state) load_state(aTHX_ (state)); |
276 | #define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE |
300 | #define SAVE(state,flags) save_state(aTHX_ (state),(flags)); |
277 | |
301 | |
278 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE |
302 | #define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE |
279 | |
303 | |
280 | static void |
304 | static void |
281 | load_state(pTHX_ Coro__State c) |
305 | load_state(pTHX_ Coro__State c) |
282 | { |
306 | { |
283 | PL_dowarn = c->dowarn; |
307 | PL_dowarn = c->dowarn; |
… | |
… | |
287 | PL_curstack = c->curstack; |
311 | PL_curstack = c->curstack; |
288 | PL_mainstack = c->mainstack; |
312 | PL_mainstack = c->mainstack; |
289 | PL_stack_sp = c->stack_sp; |
313 | PL_stack_sp = c->stack_sp; |
290 | PL_op = c->op; |
314 | PL_op = c->op; |
291 | PL_curpad = c->curpad; |
315 | PL_curpad = c->curpad; |
|
|
316 | PL_comppad = c->comppad; |
292 | PL_stack_base = c->stack_base; |
317 | PL_stack_base = c->stack_base; |
293 | PL_stack_max = c->stack_max; |
318 | PL_stack_max = c->stack_max; |
294 | PL_tmps_stack = c->tmps_stack; |
319 | PL_tmps_stack = c->tmps_stack; |
295 | PL_tmps_floor = c->tmps_floor; |
320 | PL_tmps_floor = c->tmps_floor; |
296 | PL_tmps_ix = c->tmps_ix; |
321 | PL_tmps_ix = c->tmps_ix; |
… | |
… | |
355 | |
380 | |
356 | PUSHs (Nullsv); |
381 | PUSHs (Nullsv); |
357 | /* this loop was inspired by pp_caller */ |
382 | /* this loop was inspired by pp_caller */ |
358 | for (;;) |
383 | for (;;) |
359 | { |
384 | { |
360 | do |
385 | while (cxix >= 0) |
361 | { |
386 | { |
362 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
387 | PERL_CONTEXT *cx = &ccstk[cxix--]; |
363 | |
388 | |
364 | if (CxTYPE(cx) == CXt_SUB) |
389 | if (CxTYPE(cx) == CXt_SUB) |
365 | { |
390 | { |
… | |
… | |
384 | PUSHs ((SV *)cv); |
409 | PUSHs ((SV *)cv); |
385 | |
410 | |
386 | get_padlist (cv); /* this is a monster */ |
411 | get_padlist (cv); /* this is a monster */ |
387 | } |
412 | } |
388 | } |
413 | } |
|
|
414 | #ifdef CXt_FORMAT |
389 | else if (CxTYPE(cx) == CXt_FORMAT) |
415 | else if (CxTYPE(cx) == CXt_FORMAT) |
390 | { |
416 | { |
391 | /* I never used formats, so how should I know how these are implemented? */ |
417 | /* I never used formats, so how should I know how these are implemented? */ |
392 | /* my bold guess is as a simple, plain sub... */ |
418 | /* my bold guess is as a simple, plain sub... */ |
393 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
419 | croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats"); |
394 | } |
420 | } |
|
|
421 | #endif |
395 | } |
422 | } |
396 | while (cxix >= 0); |
|
|
397 | |
423 | |
398 | if (top_si->si_type == PERLSI_MAIN) |
424 | if (top_si->si_type == PERLSI_MAIN) |
399 | break; |
425 | break; |
400 | |
426 | |
401 | top_si = top_si->si_prev; |
427 | top_si = top_si->si_prev; |
… | |
… | |
407 | } |
433 | } |
408 | |
434 | |
409 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
435 | c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0; |
410 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
436 | c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; |
411 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
437 | c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0; |
412 | |
|
|
413 | /* I have not the slightest idea of why av_reify is necessary */ |
|
|
414 | /* but if it's missing the defav contents magically get replaced sometimes */ |
|
|
415 | if (c->defav) |
|
|
416 | av_reify (c->defav); |
|
|
417 | |
438 | |
418 | c->dowarn = PL_dowarn; |
439 | c->dowarn = PL_dowarn; |
419 | c->in_eval = PL_in_eval; |
440 | c->in_eval = PL_in_eval; |
420 | |
441 | |
421 | c->curstackinfo = PL_curstackinfo; |
442 | c->curstackinfo = PL_curstackinfo; |
422 | c->curstack = PL_curstack; |
443 | c->curstack = PL_curstack; |
423 | c->mainstack = PL_mainstack; |
444 | c->mainstack = PL_mainstack; |
424 | c->stack_sp = PL_stack_sp; |
445 | c->stack_sp = PL_stack_sp; |
425 | c->op = PL_op; |
446 | c->op = PL_op; |
426 | c->curpad = PL_curpad; |
447 | c->curpad = PL_curpad; |
|
|
448 | c->comppad = PL_comppad; |
427 | c->stack_base = PL_stack_base; |
449 | c->stack_base = PL_stack_base; |
428 | c->stack_max = PL_stack_max; |
450 | c->stack_max = PL_stack_max; |
429 | c->tmps_stack = PL_tmps_stack; |
451 | c->tmps_stack = PL_tmps_stack; |
430 | c->tmps_floor = PL_tmps_floor; |
452 | c->tmps_floor = PL_tmps_floor; |
431 | c->tmps_ix = PL_tmps_ix; |
453 | c->tmps_ix = PL_tmps_ix; |
… | |
… | |
471 | |
493 | |
472 | New(54,PL_markstack,16,I32); |
494 | New(54,PL_markstack,16,I32); |
473 | PL_markstack_ptr = PL_markstack; |
495 | PL_markstack_ptr = PL_markstack; |
474 | PL_markstack_max = PL_markstack + 16; |
496 | PL_markstack_max = PL_markstack + 16; |
475 | |
497 | |
|
|
498 | #ifdef SET_MARK_OFFSET |
476 | SET_MARK_OFFSET; |
499 | SET_MARK_OFFSET; |
|
|
500 | #endif |
477 | |
501 | |
478 | New(54,PL_scopestack,16,I32); |
502 | New(54,PL_scopestack,16,I32); |
479 | PL_scopestack_ix = 0; |
503 | PL_scopestack_ix = 0; |
480 | PL_scopestack_max = 16; |
504 | PL_scopestack_max = 16; |
481 | |
505 | |
… | |
… | |
488 | PL_retstack_max = 8; |
512 | PL_retstack_max = 8; |
489 | } |
513 | } |
490 | |
514 | |
491 | /* |
515 | /* |
492 | * destroy the stacks, the callchain etc... |
516 | * destroy the stacks, the callchain etc... |
493 | * still there is a memleak of 128 bytes... |
|
|
494 | */ |
517 | */ |
495 | STATIC void |
518 | STATIC void |
496 | destroy_stacks(pTHX) |
519 | destroy_stacks(pTHX) |
497 | { |
520 | { |
|
|
521 | if (!IN_DESTRUCT) |
|
|
522 | { |
498 | /* is this ugly, I ask? */ |
523 | /* is this ugly, I ask? */ |
499 | while (PL_scopestack_ix) |
524 | while (PL_scopestack_ix) |
500 | LEAVE; |
525 | LEAVE; |
501 | |
526 | |
502 | /* sure it is, but more important: is it correct?? :/ */ |
527 | /* sure it is, but more important: is it correct?? :/ */ |
503 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
528 | while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */ |
504 | FREETMPS; |
529 | FREETMPS; |
|
|
530 | } |
505 | |
531 | |
506 | while (PL_curstackinfo->si_next) |
532 | while (PL_curstackinfo->si_next) |
507 | PL_curstackinfo = PL_curstackinfo->si_next; |
533 | PL_curstackinfo = PL_curstackinfo->si_next; |
508 | |
534 | |
509 | while (PL_curstackinfo) |
535 | while (PL_curstackinfo) |
… | |
… | |
514 | dSP; |
540 | dSP; |
515 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
541 | SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack); |
516 | PUTBACK; /* possibly superfluous */ |
542 | PUTBACK; /* possibly superfluous */ |
517 | } |
543 | } |
518 | |
544 | |
|
|
545 | if (!IN_DESTRUCT) |
|
|
546 | { |
519 | dounwind(-1); |
547 | dounwind(-1); |
520 | |
|
|
521 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
548 | SvREFCNT_dec(PL_curstackinfo->si_stack); |
|
|
549 | } |
|
|
550 | |
522 | Safefree(PL_curstackinfo->si_cxstack); |
551 | Safefree(PL_curstackinfo->si_cxstack); |
523 | Safefree(PL_curstackinfo); |
552 | Safefree(PL_curstackinfo); |
524 | PL_curstackinfo = p; |
553 | PL_curstackinfo = p; |
525 | } |
554 | } |
526 | |
555 | |
… | |
… | |
541 | stack->refcnt = 1; |
570 | stack->refcnt = 1; |
542 | stack->usecnt = 1; |
571 | stack->usecnt = 1; |
543 | stack->gencnt = ctx->gencnt = 0; |
572 | stack->gencnt = ctx->gencnt = 0; |
544 | if (alloc) |
573 | if (alloc) |
545 | { |
574 | { |
546 | #ifdef HAVE_MMAP |
575 | #if HAVE_MMAP |
547 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
576 | stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */ |
548 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0); |
577 | stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0); |
549 | if (stack->sptr == (void *)-1) |
578 | if (stack->sptr == (void *)-1) |
550 | #endif |
579 | #endif |
551 | { |
580 | { |
552 | /*FIXME*//*D*//* reasonable stack size! */ |
581 | /*FIXME*//*D*//* reasonable stack size! */ |
553 | stack->ssize = -4096 * sizeof (long); |
582 | stack->ssize = -4096 * sizeof (long); |
… | |
… | |
573 | { |
602 | { |
574 | #ifdef HAVE_MMAP |
603 | #ifdef HAVE_MMAP |
575 | if (stack->ssize > 0 && stack->sptr) |
604 | if (stack->ssize > 0 && stack->sptr) |
576 | munmap (stack->sptr, stack->ssize); |
605 | munmap (stack->sptr, stack->ssize); |
577 | else |
606 | else |
578 | #else |
607 | #endif |
579 | Safefree (stack->sptr); |
608 | Safefree (stack->sptr); |
580 | #endif |
609 | |
581 | Safefree (stack); |
610 | Safefree (stack); |
582 | } |
611 | } |
583 | else if (ctx->gencnt == stack->gencnt) |
612 | else if (ctx->gencnt == stack->gencnt) |
584 | --stack->usecnt; |
613 | --stack->usecnt; |
585 | } |
614 | } |
… | |
… | |
597 | |
626 | |
598 | coro_init_stacks (aTHX); |
627 | coro_init_stacks (aTHX); |
599 | /*PL_curcop = 0;*/ |
628 | /*PL_curcop = 0;*/ |
600 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
629 | /*PL_in_eval = PL_in_eval;*/ /* inherit */ |
601 | SvREFCNT_dec (GvAV (PL_defgv)); |
630 | SvREFCNT_dec (GvAV (PL_defgv)); |
602 | GvAV (PL_defgv) = ctx->args; |
631 | GvAV (PL_defgv) = ctx->args; ctx->args = 0; |
603 | |
632 | |
604 | SPAGAIN; |
633 | SPAGAIN; |
605 | |
634 | |
606 | if (ctx->stack) |
635 | if (ctx->stack) |
607 | { |
636 | { |
… | |
… | |
634 | * that doesn't matter, though, since it is only |
663 | * that doesn't matter, though, since it is only |
635 | * pp_nextstate and we never return... |
664 | * pp_nextstate and we never return... |
636 | * ah yes, and I don't care anyways ;) |
665 | * ah yes, and I don't care anyways ;) |
637 | */ |
666 | */ |
638 | PUTBACK; |
667 | PUTBACK; |
639 | PL_op = pp_entersub(); |
668 | PL_op = PL_ppaddr[OP_ENTERSUB](aTHX); |
640 | SPAGAIN; |
669 | SPAGAIN; |
641 | |
670 | |
642 | ENTER; /* necessary e.g. for dounwind */ |
671 | ENTER; /* necessary e.g. for dounwind */ |
643 | } |
672 | } |
644 | } |
673 | } |
… | |
… | |
648 | { |
677 | { |
649 | /* |
678 | /* |
650 | * this is a _very_ stripped down perl interpreter ;) |
679 | * this is a _very_ stripped down perl interpreter ;) |
651 | */ |
680 | */ |
652 | Coro__State ctx = (Coro__State)arg; |
681 | Coro__State ctx = (Coro__State)arg; |
|
|
682 | JMPENV coro_start_env; |
653 | |
683 | |
654 | /*FIXME*//* must set up top_env here */ |
684 | PL_top_env = &ctx->start_env; |
|
|
685 | |
655 | ctx->cursp = 0; |
686 | ctx->cursp = 0; |
656 | PL_op = PL_op->op_next; |
687 | PL_op = PL_op->op_next; |
657 | CALLRUNOPS(aTHX); |
688 | CALLRUNOPS(aTHX); |
658 | |
689 | |
659 | abort (); |
690 | abort (); |
660 | } |
691 | } |
661 | |
692 | |
662 | STATIC void |
693 | STATIC void |
663 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
694 | transfer(pTHX_ struct coro *prev, struct coro *next, int flags) |
664 | { |
695 | { |
665 | dSP; |
|
|
666 | dSTACKLEVEL; |
696 | dSTACKLEVEL; |
|
|
697 | static struct coro *xnext; |
667 | |
698 | |
668 | if (prev != next) |
699 | if (prev != next) |
669 | { |
700 | { |
|
|
701 | xnext = next; |
|
|
702 | |
670 | if (next->mainstack) |
703 | if (next->mainstack) |
671 | { |
704 | { |
672 | SAVE (prev, flags); |
705 | SAVE (prev, flags); |
673 | LOAD (next); |
706 | LOAD (next); |
674 | |
707 | |
… | |
… | |
697 | continue_coro, (void *)next, |
730 | continue_coro, (void *)next, |
698 | next->stack->sptr, labs (next->stack->ssize)); |
731 | next->stack->sptr, labs (next->stack->ssize)); |
699 | } |
732 | } |
700 | |
733 | |
701 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
734 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
735 | /* don't add any code here */ |
702 | } |
736 | } |
703 | |
737 | |
704 | } |
738 | } |
705 | else if (next->tmps_ix == -2) |
739 | else if (next->tmps_ix == -2) |
706 | croak ("tried to transfer to running coroutine"); |
740 | croak ("tried to transfer to running coroutine"); |
… | |
… | |
713 | if (!prev->stack) |
747 | if (!prev->stack) |
714 | allocate_stack (prev, 0); |
748 | allocate_stack (prev, 0); |
715 | |
749 | |
716 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
750 | if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK) |
717 | { |
751 | { |
|
|
752 | PL_top_env = &next->start_env; |
|
|
753 | |
718 | setup_coro (next); |
754 | setup_coro (next); |
719 | |
755 | |
720 | prev->stack->refcnt++; |
756 | prev->stack->refcnt++; |
721 | prev->stack->usecnt++; |
757 | prev->stack->usecnt++; |
722 | next->stack = prev->stack; |
758 | next->stack = prev->stack; |
723 | next->gencnt = prev->gencnt; |
759 | next->gencnt = prev->gencnt; |
724 | } |
760 | } |
725 | else |
761 | else |
726 | { |
762 | { |
|
|
763 | assert (!next->stack); |
727 | allocate_stack (next, 1); |
764 | allocate_stack (next, 1); |
728 | coro_create (&(next->stack->cctx), |
765 | coro_create (&(next->stack->cctx), |
729 | setup_coro, (void *)next, |
766 | setup_coro, (void *)next, |
730 | next->stack->sptr, labs (next->stack->ssize)); |
767 | next->stack->sptr, labs (next->stack->ssize)); |
731 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
768 | coro_transfer (&(prev->stack->cctx), &(next->stack->cctx)); |
|
|
769 | /* don't add any code here */ |
732 | } |
770 | } |
733 | } |
771 | } |
734 | else |
772 | else |
735 | setup_coro (next); |
773 | setup_coro (next); |
736 | } |
774 | } |
|
|
775 | |
|
|
776 | /* |
|
|
777 | * xnext is now either prev or next, depending on wether |
|
|
778 | * we switched the c stack or not. that's why I use a global |
|
|
779 | * variable, that should become thread-specific at one point. |
|
|
780 | */ |
|
|
781 | xnext->cursp = stacklevel; |
737 | } |
782 | } |
738 | |
783 | |
739 | next->cursp = stacklevel; |
784 | if (coro_mortal) |
740 | } |
|
|
741 | |
|
|
742 | static struct coro * |
|
|
743 | sv_to_coro (SV *arg, const char *funcname, const char *varname) |
|
|
744 | { |
|
|
745 | if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV) |
|
|
746 | { |
785 | { |
747 | HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash); |
786 | SvREFCNT_dec (coro_mortal); |
748 | |
787 | coro_mortal = 0; |
749 | if (!he) |
|
|
750 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname); |
|
|
751 | |
|
|
752 | arg = HeVAL(he); |
|
|
753 | } |
788 | } |
754 | |
789 | } |
|
|
790 | |
|
|
791 | #define SV_CORO(sv,func) \ |
|
|
792 | do { \ |
|
|
793 | if (SvROK (sv)) \ |
|
|
794 | sv = SvRV (sv); \ |
|
|
795 | \ |
|
|
796 | if (SvTYPE(sv) == SVt_PVHV) \ |
|
|
797 | { \ |
|
|
798 | HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \ |
|
|
799 | \ |
|
|
800 | if (!he) \ |
|
|
801 | croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \ |
|
|
802 | \ |
|
|
803 | (sv) = SvRV (HeVAL(he)); \ |
|
|
804 | } \ |
|
|
805 | \ |
755 | /* must also be changed inside Coro::Cont::yield */ |
806 | /* must also be changed inside Coro::Cont::yield */ \ |
756 | if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash) |
807 | if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \ |
757 | return (struct coro *) SvIV((SV*)SvRV(arg)); |
|
|
758 | else |
|
|
759 | croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname); |
808 | croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \ |
760 | } |
809 | \ |
|
|
810 | } while(0) |
|
|
811 | |
|
|
812 | #define SvSTATE(sv) (struct coro *)SvIV (sv) |
761 | |
813 | |
762 | static void |
814 | static void |
763 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
815 | api_transfer(pTHX_ SV *prev, SV *next, int flags) |
764 | { |
816 | { |
765 | transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"), |
817 | SV_CORO (prev, "Coro::transfer"); |
766 | sv_to_coro (next, "Coro::transfer", "next"), |
818 | SV_CORO (next, "Coro::transfer"); |
767 | flags); |
819 | |
|
|
820 | transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); |
768 | } |
821 | } |
769 | |
822 | |
770 | /** Coro ********************************************************************/ |
823 | /** Coro ********************************************************************/ |
771 | |
824 | |
772 | #define PRIO_MAX 3 |
825 | #define PRIO_MAX 3 |
… | |
… | |
777 | #define PRIO_MIN -4 |
830 | #define PRIO_MIN -4 |
778 | |
831 | |
779 | /* for Coro.pm */ |
832 | /* for Coro.pm */ |
780 | static GV *coro_current, *coro_idle; |
833 | static GV *coro_current, *coro_idle; |
781 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
834 | static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; |
|
|
835 | static int coro_nready; |
782 | |
836 | |
783 | static void |
837 | static void |
784 | coro_enq (SV *sv) |
838 | coro_enq (SV *sv) |
785 | { |
839 | { |
786 | if (SvROK (sv)) |
840 | if (SvTYPE (sv) == SVt_PVHV) |
787 | { |
841 | { |
788 | SV *hv = SvRV (sv); |
|
|
789 | if (SvTYPE (hv) == SVt_PVHV) |
|
|
790 | { |
|
|
791 | SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); |
842 | SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0); |
792 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
843 | int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; |
793 | |
844 | |
794 | prio = prio > PRIO_MAX ? PRIO_MAX |
845 | prio = prio > PRIO_MAX ? PRIO_MAX |
795 | : prio < PRIO_MIN ? PRIO_MIN |
846 | : prio < PRIO_MIN ? PRIO_MIN |
796 | : prio; |
847 | : prio; |
797 | |
848 | |
798 | av_push (coro_ready [prio - PRIO_MIN], sv); |
849 | av_push (coro_ready [prio - PRIO_MIN], sv); |
|
|
850 | coro_nready++; |
799 | |
851 | |
800 | return; |
852 | return; |
801 | } |
|
|
802 | } |
853 | } |
803 | |
854 | |
804 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
855 | croak ("Coro::ready tried to enqueue something that is not a coroutine"); |
805 | } |
856 | } |
806 | |
857 | |
… | |
… | |
813 | if (min_prio < 0) |
864 | if (min_prio < 0) |
814 | min_prio = 0; |
865 | min_prio = 0; |
815 | |
866 | |
816 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
867 | for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) |
817 | if (av_len (coro_ready[prio]) >= 0) |
868 | if (av_len (coro_ready[prio]) >= 0) |
|
|
869 | { |
|
|
870 | coro_nready--; |
818 | return av_shift (coro_ready[prio]); |
871 | return av_shift (coro_ready[prio]); |
|
|
872 | } |
819 | |
873 | |
820 | return 0; |
874 | return 0; |
821 | } |
875 | } |
822 | |
876 | |
823 | static void |
877 | static void |
824 | api_ready (SV *coro) |
878 | api_ready (SV *coro) |
825 | { |
879 | { |
|
|
880 | if (SvROK (coro)) |
|
|
881 | coro = SvRV (coro); |
|
|
882 | |
826 | coro_enq (SvREFCNT_inc (coro)); |
883 | coro_enq (SvREFCNT_inc (coro)); |
827 | } |
884 | } |
828 | |
885 | |
829 | static void |
886 | static void |
830 | api_schedule (int cede) |
887 | api_schedule (void) |
831 | { |
888 | { |
832 | SV *prev, *next; |
889 | SV *prev, *next; |
833 | |
890 | |
834 | prev = GvSV (coro_current); |
891 | prev = SvRV (GvSV (coro_current)); |
835 | |
|
|
836 | if (cede) |
|
|
837 | coro_enq (SvREFCNT_inc (prev)); |
|
|
838 | |
|
|
839 | next = coro_deq (PRIO_MIN); |
892 | next = coro_deq (PRIO_MIN); |
840 | |
893 | |
841 | if (!next) |
894 | if (!next) |
842 | next = SvREFCNT_inc (GvSV (coro_idle)); |
895 | next = SvREFCNT_inc (SvRV (GvSV (coro_idle))); |
843 | |
896 | |
844 | GvSV (coro_current) = SvREFCNT_inc (next); |
897 | /* free this only after the transfer */ |
845 | transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"), |
898 | coro_mortal = prev; |
846 | sv_to_coro (next, "Coro::schedule", "next coroutine"), |
899 | SV_CORO (prev, "Coro::schedule"); |
|
|
900 | |
|
|
901 | SvRV (GvSV (coro_current)) = next; |
|
|
902 | |
|
|
903 | SV_CORO (next, "Coro::schedule"); |
|
|
904 | |
|
|
905 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), |
847 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
906 | TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); |
848 | SvREFCNT_dec (next); |
907 | } |
849 | SvREFCNT_dec (prev); |
908 | |
|
|
909 | static void |
|
|
910 | api_cede (void) |
|
|
911 | { |
|
|
912 | coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); |
|
|
913 | |
|
|
914 | api_schedule (); |
850 | } |
915 | } |
851 | |
916 | |
852 | MODULE = Coro::State PACKAGE = Coro::State |
917 | MODULE = Coro::State PACKAGE = Coro::State |
853 | |
918 | |
854 | PROTOTYPES: ENABLE |
919 | PROTOTYPES: ENABLE |
… | |
… | |
867 | if (!padlist_cache) |
932 | if (!padlist_cache) |
868 | padlist_cache = newHV (); |
933 | padlist_cache = newHV (); |
869 | |
934 | |
870 | main_mainstack = PL_mainstack; |
935 | main_mainstack = PL_mainstack; |
871 | |
936 | |
872 | { |
|
|
873 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
874 | |
|
|
875 | coroapi.ver = CORO_API_VERSION - 1; |
937 | coroapi.ver = CORO_API_VERSION; |
876 | coroapi.transfer = api_transfer; |
938 | coroapi.transfer = api_transfer; |
877 | coroapi.schedule = api_schedule; |
|
|
878 | coroapi.ready = api_ready; |
|
|
879 | |
|
|
880 | GCoroAPI = &coroapi; |
|
|
881 | sv_setiv(sv, (IV)&coroapi); |
|
|
882 | SvREADONLY_on(sv); |
|
|
883 | } |
|
|
884 | } |
939 | } |
885 | |
940 | |
886 | Coro::State |
941 | Coro::State |
887 | _newprocess(args) |
942 | _newprocess(args) |
888 | SV * args |
943 | SV * args |
… | |
… | |
891 | Coro__State coro; |
946 | Coro__State coro; |
892 | |
947 | |
893 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
948 | if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV) |
894 | croak ("Coro::State::_newprocess expects an arrayref"); |
949 | croak ("Coro::State::_newprocess expects an arrayref"); |
895 | |
950 | |
896 | New (0, coro, 1, struct coro); |
951 | Newz (0, coro, 1, struct coro); |
897 | |
952 | |
898 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
953 | coro->args = (AV *)SvREFCNT_inc (SvRV (args)); |
899 | coro->mainstack = 0; /* actual work is done inside transfer */ |
954 | coro->mainstack = 0; /* actual work is done inside transfer */ |
900 | coro->stack = 0; |
955 | coro->stack = 0; |
901 | |
956 | |
|
|
957 | /* same as JMPENV_BOOTSTRAP */ |
|
|
958 | /* we might be able to recycle start_env, but safe is safe */ |
|
|
959 | //Zero(&coro->start_env, 1, JMPENV); |
|
|
960 | coro->start_env.je_ret = -1; |
|
|
961 | coro->start_env.je_mustcatch = TRUE; |
|
|
962 | |
902 | RETVAL = coro; |
963 | RETVAL = coro; |
903 | OUTPUT: |
964 | OUTPUT: |
904 | RETVAL |
965 | RETVAL |
905 | |
966 | |
906 | void |
967 | void |
907 | transfer(prev, next, flags) |
968 | transfer(prev, next, flags) |
908 | Coro::State_or_hashref prev |
969 | SV *prev |
909 | Coro::State_or_hashref next |
970 | SV *next |
910 | int flags |
971 | int flags |
911 | PROTOTYPE: @ |
972 | PROTOTYPE: @ |
912 | CODE: |
973 | CODE: |
913 | PUTBACK; |
974 | PUTBACK; |
|
|
975 | SV_CORO (next, "Coro::transfer"); |
|
|
976 | SV_CORO (prev, "Coro::transfer"); |
914 | transfer (aTHX_ prev, next, flags); |
977 | transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); |
915 | SPAGAIN; |
978 | SPAGAIN; |
916 | |
979 | |
917 | void |
980 | void |
918 | DESTROY(coro) |
981 | DESTROY(coro) |
919 | Coro::State coro |
982 | Coro::State coro |
… | |
… | |
921 | |
984 | |
922 | if (coro->mainstack && coro->mainstack != main_mainstack) |
985 | if (coro->mainstack && coro->mainstack != main_mainstack) |
923 | { |
986 | { |
924 | struct coro temp; |
987 | struct coro temp; |
925 | |
988 | |
|
|
989 | PUTBACK; |
926 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
990 | SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL); |
927 | LOAD(aTHX_ coro); |
991 | LOAD(aTHX_ coro); |
|
|
992 | SPAGAIN; |
928 | |
993 | |
929 | destroy_stacks (aTHX); |
994 | destroy_stacks (aTHX); |
930 | |
995 | |
931 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
996 | LOAD((&temp)); /* this will get rid of defsv etc.. */ |
|
|
997 | SPAGAIN; |
932 | |
998 | |
933 | coro->mainstack = 0; |
999 | coro->mainstack = 0; |
934 | } |
1000 | } |
935 | |
1001 | |
936 | deallocate_stack (coro); |
1002 | deallocate_stack (coro); |
937 | |
1003 | SvREFCNT_dec (coro->args); |
938 | Safefree (coro); |
1004 | Safefree (coro); |
939 | |
|
|
940 | void |
|
|
941 | flush() |
|
|
942 | CODE: |
|
|
943 | #ifdef MAY_FLUSH |
|
|
944 | flush_padlist_cache (); |
|
|
945 | #endif |
|
|
946 | |
1005 | |
947 | void |
1006 | void |
948 | _exit(code) |
1007 | _exit(code) |
949 | int code |
1008 | int code |
950 | PROTOTYPE: $ |
1009 | PROTOTYPE: $ |
… | |
… | |
969 | SV *sv; |
1028 | SV *sv; |
970 | AV *defav = GvAV (PL_defgv); |
1029 | AV *defav = GvAV (PL_defgv); |
971 | struct coro *prev, *next; |
1030 | struct coro *prev, *next; |
972 | |
1031 | |
973 | if (!returnstk) |
1032 | if (!returnstk) |
974 | returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE)); |
1033 | returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE)); |
975 | |
1034 | |
976 | /* set up @_ -- ugly */ |
1035 | /* set up @_ -- ugly */ |
977 | av_clear (defav); |
1036 | av_clear (defav); |
978 | av_fill (defav, items - 1); |
1037 | av_fill (defav, items - 1); |
979 | while (items--) |
1038 | while (items--) |
… | |
… | |
1006 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
1065 | coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); |
1007 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
1066 | coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); |
1008 | |
1067 | |
1009 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1068 | for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) |
1010 | coro_ready[i] = newAV (); |
1069 | coro_ready[i] = newAV (); |
|
|
1070 | |
|
|
1071 | { |
|
|
1072 | SV *sv = perl_get_sv("Coro::API", 1); |
|
|
1073 | |
|
|
1074 | coroapi.schedule = api_schedule; |
|
|
1075 | coroapi.cede = api_cede; |
|
|
1076 | coroapi.ready = api_ready; |
|
|
1077 | coroapi.nready = &coro_nready; |
|
|
1078 | coroapi.current = coro_current; |
|
|
1079 | |
|
|
1080 | GCoroAPI = &coroapi; |
|
|
1081 | sv_setiv(sv, (IV)&coroapi); |
|
|
1082 | SvREADONLY_on(sv); |
|
|
1083 | } |
1011 | } |
1084 | } |
|
|
1085 | |
|
|
1086 | #if !PERL_MICRO |
1012 | |
1087 | |
1013 | void |
1088 | void |
1014 | ready(self) |
1089 | ready(self) |
1015 | SV * self |
1090 | SV * self |
|
|
1091 | PROTOTYPE: $ |
1016 | CODE: |
1092 | CODE: |
1017 | api_ready (self); |
1093 | api_ready (self); |
1018 | |
1094 | |
|
|
1095 | #endif |
|
|
1096 | |
|
|
1097 | int |
|
|
1098 | nready(...) |
|
|
1099 | PROTOTYPE: |
|
|
1100 | CODE: |
|
|
1101 | RETVAL = coro_nready; |
|
|
1102 | OUTPUT: |
|
|
1103 | RETVAL |
|
|
1104 | |
1019 | void |
1105 | void |
1020 | schedule(...) |
1106 | schedule(...) |
1021 | ALIAS: |
1107 | PROTOTYPE: |
1022 | cede = 1 |
|
|
1023 | CODE: |
1108 | CODE: |
1024 | api_schedule (ix); |
1109 | api_schedule (); |
1025 | |
1110 | |
|
|
1111 | void |
|
|
1112 | cede(...) |
|
|
1113 | PROTOTYPE: |
|
|
1114 | CODE: |
|
|
1115 | api_cede (); |
|
|
1116 | |