ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/Coro/Coro/State.xs
(Generate patch)

Comparing Coro/Coro/State.xs (file contents):
Revision 1.23 by root, Tue Aug 14 04:33:58 2001 UTC vs.
Revision 1.145 by root, Mon Mar 12 21:40:14 2007 UTC

1#include "libcoro/coro.c"
2
1#include "EXTERN.h" 3#include "EXTERN.h"
2#include "perl.h" 4#include "perl.h"
3#include "XSUB.h" 5#include "XSUB.h"
4 6
5#include "libcoro/coro.c" 7#include "patchlevel.h"
6 8
7#include <signal.h> 9#include <stdio.h>
10#include <errno.h>
11#include <assert.h>
8 12
9#ifdef HAVE_MMAP 13#ifdef HAVE_MMAP
10# include <unistd.h> 14# include <unistd.h>
11# include <sys/mman.h> 15# include <sys/mman.h>
12# ifndef MAP_ANON
13# ifdef MAP_ANONYMOUS 16# ifndef MAP_ANONYMOUS
14# define MAP_ANON MAP_ANONYMOUS 17# ifdef MAP_ANON
18# define MAP_ANONYMOUS MAP_ANON
15# else 19# else
16# undef HAVE_MMAP 20# undef HAVE_MMAP
17# endif 21# endif
18# endif 22# endif
23# include <limits.h>
24# ifndef PAGESIZE
25# define PAGESIZE pagesize
26# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
27static long pagesize;
28# else
29# define BOOT_PAGESIZE (void)0
19#endif 30# endif
31#else
32# define PAGESIZE 0
33# define BOOT_PAGESIZE (void)0
34#endif
20 35
21#define MAY_FLUSH /* increases codesize */ 36#if CORO_USE_VALGRIND
37# include <valgrind/valgrind.h>
38# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
39#else
40# define REGISTER_STACK(cctx,start,end)
41#endif
22 42
23#define SUB_INIT "Coro::State::initialize" 43/* the maximum number of idle cctx that will be pooled */
24#define UCORO_STATE "_coro_state" 44#define MAX_IDLE_CCTX 8
25 45
46#define PERL_VERSION_ATLEAST(a,b,c) \
47 (PERL_REVISION > (a) \
48 || (PERL_REVISION == (a) \
49 && (PERL_VERSION > (b) \
50 || (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
51
52#if !PERL_VERSION_ATLEAST (5,6,0)
53# ifndef PL_ppaddr
54# define PL_ppaddr ppaddr
55# endif
56# ifndef call_sv
57# define call_sv perl_call_sv
58# endif
59# ifndef get_sv
60# define get_sv perl_get_sv
61# endif
62# ifndef get_cv
63# define get_cv perl_get_cv
64# endif
65# ifndef IS_PADGV
66# define IS_PADGV(v) 0
67# endif
68# ifndef IS_PADCONST
69# define IS_PADCONST(v) 0
70# endif
71#endif
72
73/* 5.8.7 */
74#ifndef SvRV_set
75# define SvRV_set(s,v) SvRV(s) = (v)
76#endif
77
78#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
79# undef CORO_STACKGUARD
80#endif
81
82#ifndef CORO_STACKGUARD
83# define CORO_STACKGUARD 0
84#endif
85
86/* prefer perl internal functions over our own? */
87#ifndef CORO_PREFER_PERL_FUNCTIONS
88# define CORO_PREFER_PERL_FUNCTIONS 0
89#endif
90
26/* The next macro should delcare a variable stacklevel that contains and approximation 91/* 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 92 * to the current C stack pointer. Its property is that it changes with each call
28 * and should be unique. */ 93 * and should be unique. */
94#define dSTACKLEVEL int stacklevel
29#define dSTACKLEVEL void *stacklevel = &stacklevel 95#define STACKLEVEL ((void *)&stacklevel)
30 96
31#define labs(l) ((l) >= 0 ? (l) : -(l)) 97#define IN_DESTRUCT (PL_main_cv == Nullcv)
98
99#if __GNUC__ >= 3
100# define attribute(x) __attribute__(x)
101# define BARRIER __asm__ __volatile__ ("" : : : "memory")
102#else
103# define attribute(x)
104# define BARRIER
105#endif
106
107#define NOINLINE attribute ((noinline))
32 108
33#include "CoroAPI.h" 109#include "CoroAPI.h"
34 110
111#ifdef USE_ITHREADS
112static perl_mutex coro_mutex;
113# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
114# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
115#else
116# define LOCK (void)0
117# define UNLOCK (void)0
118#endif
119
120/* helper storage struct for Coro::AIO */
121struct io_state
122{
123 int errorno;
124 I32 laststype;
125 int laststatval;
126 Stat_t statcache;
127};
128
129static size_t coro_stacksize = CORO_STACKSIZE;
35static struct CoroAPI coroapi; 130static struct CoroAPI coroapi;
131static AV *main_mainstack; /* used to differentiate between $main and others */
132static HV *coro_state_stash, *coro_stash;
133static SV *coro_mortal; /* will be freed after next transfer */
36 134
37/* this is actually not only the c stack but also c registers etc... */ 135static struct coro_cctx *cctx_first;
136static int cctx_count, cctx_idle;
137
138/* this is a structure representing a c-level coroutine */
38typedef struct { 139typedef struct coro_cctx {
39 int refcnt; /* pointer reference counter */ 140 struct coro_cctx *next;
40 int usecnt; /* shared by how many coroutines */
41 int gencnt; /* generation counter */
42 141
142 /* the stack */
143 void *sptr;
144 size_t ssize;
145
146 /* cpu state */
147 void *idle_sp; /* sp of top-level transfer/schedule/cede call */
148 JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
149 JMPENV *top_env;
43 coro_context cctx; 150 coro_context cctx;
44 151
45 void *sptr; 152#if CORO_USE_VALGRIND
46 long ssize; /* positive == mmap, otherwise malloc */ 153 int valgrind_id;
47} coro_stack; 154#endif
155 char inuse, mapped;
156} coro_cctx;
48 157
158enum {
159 CF_RUNNING = 0x0001, /* coroutine is running */
160 CF_READY = 0x0002, /* coroutine is ready */
161 CF_NEW = 0x0004, /* has never been switched to */
162 CF_DESTROYED = 0x0008, /* coroutine data has been freed */
163};
164
165/* this is a structure representing a perl-level coroutine */
49struct coro { 166struct coro {
50 /* the optional C context */ 167 /* the c coroutine allocated to this perl coroutine, if any */
51 coro_stack *stack; 168 coro_cctx *cctx;
52 void *cursp;
53 int gencnt;
54
55 /* optionally saved, might be zero */
56 AV *defav;
57 SV *defsv;
58 SV *errsv;
59
60 /* saved global state not related to stacks */
61 U8 dowarn;
62 I32 in_eval;
63
64 /* the stacks and related info (callchain etc..) */
65 PERL_SI *curstackinfo;
66 AV *curstack;
67 AV *mainstack;
68 SV **stack_sp;
69 OP *op;
70 SV **curpad;
71 SV **stack_base;
72 SV **stack_max;
73 SV **tmps_stack;
74 I32 tmps_floor;
75 I32 tmps_ix;
76 I32 tmps_max;
77 I32 *markstack;
78 I32 *markstack_ptr;
79 I32 *markstack_max;
80 I32 *scopestack;
81 I32 scopestack_ix;
82 I32 scopestack_max;
83 ANY *savestack;
84 I32 savestack_ix;
85 I32 savestack_max;
86 OP **retstack;
87 I32 retstack_ix;
88 I32 retstack_max;
89 COP *curcop;
90 JMPENV *top_env;
91 169
92 /* data associated with this coroutine (initial args) */ 170 /* data associated with this coroutine (initial args) */
93 AV *args; 171 AV *args;
172 int refcnt;
173 int save; /* CORO_SAVE flags */
174 int flags; /* CF_ flags */
175
176 /* optionally saved, might be zero */
177 AV *defav; /* @_ */
178 SV *defsv; /* $_ */
179 SV *errsv; /* $@ */
180 SV *irssv; /* $/ */
181 SV *irssv_sv; /* real $/ cache */
182
183#define VAR(name,type) type name;
184# include "state.h"
185#undef VAR
186
187 /* coro process data */
188 int prio;
94}; 189};
95 190
96typedef struct coro *Coro__State; 191typedef struct coro *Coro__State;
97typedef struct coro *Coro__State_or_hashref; 192typedef struct coro *Coro__State_or_hashref;
98
99static AV *main_mainstack; /* used to differentiate between $main and others */
100static HV *coro_state_stash;
101static SV *ucoro_state_sv;
102static U32 ucoro_state_hash;
103static HV *padlist_cache;
104
105/* mostly copied from op.c:cv_clone2 */
106STATIC AV *
107clone_padlist (AV *protopadlist)
108{
109 AV *av;
110 I32 ix;
111 AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
112 AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
113 SV **pname = AvARRAY (protopad_name);
114 SV **ppad = AvARRAY (protopad);
115 I32 fname = AvFILLp (protopad_name);
116 I32 fpad = AvFILLp (protopad);
117 AV *newpadlist, *newpad_name, *newpad;
118 SV **npad;
119
120 newpad_name = newAV ();
121 for (ix = fname; ix >= 0; ix--)
122 av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
123
124 newpad = newAV ();
125 av_fill (newpad, AvFILLp (protopad));
126 npad = AvARRAY (newpad);
127
128 newpadlist = newAV ();
129 AvREAL_off (newpadlist);
130 av_store (newpadlist, 0, (SV *) newpad_name);
131 av_store (newpadlist, 1, (SV *) newpad);
132
133 av = newAV (); /* will be @_ */
134 av_extend (av, 0);
135 av_store (newpad, 0, (SV *) av);
136 AvFLAGS (av) = AVf_REIFY;
137
138 for (ix = fpad; ix > 0; ix--)
139 {
140 SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
141 if (namesv && namesv != &PL_sv_undef)
142 {
143 char *name = SvPVX (namesv); /* XXX */
144 if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
145 { /* lexical from outside? */
146 npad[ix] = SvREFCNT_inc (ppad[ix]);
147 }
148 else
149 { /* our own lexical */
150 SV *sv;
151 if (*name == '&')
152 sv = SvREFCNT_inc (ppad[ix]);
153 else if (*name == '@')
154 sv = (SV *) newAV ();
155 else if (*name == '%')
156 sv = (SV *) newHV ();
157 else
158 sv = NEWSV (0, 0);
159 if (!SvPADBUSY (sv))
160 SvPADMY_on (sv);
161 npad[ix] = sv;
162 }
163 }
164 else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
165 {
166 npad[ix] = SvREFCNT_inc (ppad[ix]);
167 }
168 else
169 {
170 SV *sv = NEWSV (0, 0);
171 SvPADTMP_on (sv);
172 npad[ix] = sv;
173 }
174 }
175
176#if 0 /* return -ENOTUNDERSTOOD */
177 /* Now that vars are all in place, clone nested closures. */
178
179 for (ix = fpad; ix > 0; ix--) {
180 SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
181 if (namesv
182 && namesv != &PL_sv_undef
183 && !(SvFLAGS(namesv) & SVf_FAKE)
184 && *SvPVX(namesv) == '&'
185 && CvCLONE(ppad[ix]))
186 {
187 CV *kid = cv_clone((CV*)ppad[ix]);
188 SvREFCNT_dec(ppad[ix]);
189 CvCLONE_on(kid);
190 SvPADMY_on(kid);
191 npad[ix] = (SV*)kid;
192 }
193 }
194#endif
195
196 return newpadlist;
197}
198
199#ifdef MAY_FLUSH
200STATIC AV *
201free_padlist (AV *padlist)
202{
203 /* may be during global destruction */
204 if (SvREFCNT(padlist))
205 {
206 I32 i = AvFILLp(padlist);
207 while (i >= 0)
208 {
209 SV **svp = av_fetch(padlist, i--, FALSE);
210 SV *sv = svp ? *svp : Nullsv;
211 if (sv)
212 SvREFCNT_dec(sv);
213 }
214
215 SvREFCNT_dec((SV*)padlist);
216 }
217}
218#endif
219
220/* the next two functions merely cache the padlists */
221STATIC void
222get_padlist (CV *cv)
223{
224 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
225
226 if (he && AvFILLp ((AV *)*he) >= 0)
227 CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
228 else
229 CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
230}
231
232STATIC void
233put_padlist (CV *cv)
234{
235 SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
236
237 if (SvTYPE (*he) != SVt_PVAV)
238 {
239 SvREFCNT_dec (*he);
240 *he = (SV *)newAV ();
241 }
242
243 av_push ((AV *)*he, (SV *)CvPADLIST (cv));
244}
245
246#ifdef MAY_FLUSH
247STATIC void
248flush_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
272#define SB do {
273#define SE } while (0)
274
275#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
276#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
277
278#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
279
280static void
281load_state(pTHX_ Coro__State c)
282{
283 PL_dowarn = c->dowarn;
284 PL_in_eval = c->in_eval;
285
286 PL_curstackinfo = c->curstackinfo;
287 PL_curstack = c->curstack;
288 PL_mainstack = c->mainstack;
289 PL_stack_sp = c->stack_sp;
290 PL_op = c->op;
291 PL_curpad = c->curpad;
292 PL_stack_base = c->stack_base;
293 PL_stack_max = c->stack_max;
294 PL_tmps_stack = c->tmps_stack;
295 PL_tmps_floor = c->tmps_floor;
296 PL_tmps_ix = c->tmps_ix;
297 PL_tmps_max = c->tmps_max;
298 PL_markstack = c->markstack;
299 PL_markstack_ptr = c->markstack_ptr;
300 PL_markstack_max = c->markstack_max;
301 PL_scopestack = c->scopestack;
302 PL_scopestack_ix = c->scopestack_ix;
303 PL_scopestack_max = c->scopestack_max;
304 PL_savestack = c->savestack;
305 PL_savestack_ix = c->savestack_ix;
306 PL_savestack_max = c->savestack_max;
307 PL_retstack = c->retstack;
308 PL_retstack_ix = c->retstack_ix;
309 PL_retstack_max = c->retstack_max;
310 PL_curcop = c->curcop;
311 PL_top_env = c->top_env;
312
313 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
315 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
316
317 {
318 dSP;
319 CV *cv;
320
321 /* now do the ugly restore mess */
322 while ((cv = (CV *)POPs))
323 {
324 AV *padlist = (AV *)POPs;
325
326 if (padlist)
327 {
328 put_padlist (cv); /* mark this padlist as available */
329 CvPADLIST(cv) = padlist;
330#ifdef USE_THREADS
331 /*CvOWNER(cv) = (struct perl_thread *)POPs;*/
332#endif
333 }
334
335 ++CvDEPTH(cv);
336 }
337
338 PUTBACK;
339 }
340}
341
342static void
343save_state(pTHX_ Coro__State c, int flags)
344{
345 {
346 dSP;
347 I32 cxix = cxstack_ix;
348 PERL_CONTEXT *ccstk = cxstack;
349 PERL_SI *top_si = PL_curstackinfo;
350
351 /*
352 * the worst thing you can imagine happens first - we have to save
353 * (and reinitialize) all cv's in the whole callchain :(
354 */
355
356 PUSHs (Nullsv);
357 /* this loop was inspired by pp_caller */
358 for (;;)
359 {
360 do
361 {
362 PERL_CONTEXT *cx = &ccstk[cxix--];
363
364 if (CxTYPE(cx) == CXt_SUB)
365 {
366 CV *cv = cx->blk_sub.cv;
367 if (CvDEPTH(cv))
368 {
369#ifdef USE_THREADS
370 /*XPUSHs ((SV *)CvOWNER(cv));*/
371 /*CvOWNER(cv) = 0;*/
372 /*error must unlock this cv etc.. etc...*/
373#endif
374 EXTEND (SP, CvDEPTH(cv)*2);
375
376 while (--CvDEPTH(cv))
377 {
378 /* this tells the restore code to increment CvDEPTH */
379 PUSHs (Nullsv);
380 PUSHs ((SV *)cv);
381 }
382
383 PUSHs ((SV *)CvPADLIST(cv));
384 PUSHs ((SV *)cv);
385
386 get_padlist (cv); /* this is a monster */
387 }
388 }
389 else if (CxTYPE(cx) == CXt_FORMAT)
390 {
391 /* I never used formats, so how should I know how these are implemented? */
392 /* my bold guess is as a simple, plain sub... */
393 croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
394 }
395 }
396 while (cxix >= 0);
397
398 if (top_si->si_type == PERLSI_MAIN)
399 break;
400
401 top_si = top_si->si_prev;
402 ccstk = top_si->si_cxstack;
403 cxix = top_si->si_cxix;
404 }
405
406 PUTBACK;
407 }
408
409 c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
410 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
411 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
418 c->dowarn = PL_dowarn;
419 c->in_eval = PL_in_eval;
420
421 c->curstackinfo = PL_curstackinfo;
422 c->curstack = PL_curstack;
423 c->mainstack = PL_mainstack;
424 c->stack_sp = PL_stack_sp;
425 c->op = PL_op;
426 c->curpad = PL_curpad;
427 c->stack_base = PL_stack_base;
428 c->stack_max = PL_stack_max;
429 c->tmps_stack = PL_tmps_stack;
430 c->tmps_floor = PL_tmps_floor;
431 c->tmps_ix = PL_tmps_ix;
432 c->tmps_max = PL_tmps_max;
433 c->markstack = PL_markstack;
434 c->markstack_ptr = PL_markstack_ptr;
435 c->markstack_max = PL_markstack_max;
436 c->scopestack = PL_scopestack;
437 c->scopestack_ix = PL_scopestack_ix;
438 c->scopestack_max = PL_scopestack_max;
439 c->savestack = PL_savestack;
440 c->savestack_ix = PL_savestack_ix;
441 c->savestack_max = PL_savestack_max;
442 c->retstack = PL_retstack;
443 c->retstack_ix = PL_retstack_ix;
444 c->retstack_max = PL_retstack_max;
445 c->curcop = PL_curcop;
446 c->top_env = PL_top_env;
447}
448
449/*
450 * allocate various perl stacks. This is an exact copy
451 * of perl.c:init_stacks, except that it uses less memory
452 * on the assumption that coroutines do not usually need
453 * a lot of stackspace.
454 */
455STATIC void
456coro_init_stacks (pTHX)
457{
458 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
459 PL_curstackinfo->si_type = PERLSI_MAIN;
460 PL_curstack = PL_curstackinfo->si_stack;
461 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
462
463 PL_stack_base = AvARRAY(PL_curstack);
464 PL_stack_sp = PL_stack_base;
465 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
466
467 New(50,PL_tmps_stack,96,SV*);
468 PL_tmps_floor = -1;
469 PL_tmps_ix = -1;
470 PL_tmps_max = 96;
471
472 New(54,PL_markstack,16,I32);
473 PL_markstack_ptr = PL_markstack;
474 PL_markstack_max = PL_markstack + 16;
475
476 SET_MARK_OFFSET;
477
478 New(54,PL_scopestack,16,I32);
479 PL_scopestack_ix = 0;
480 PL_scopestack_max = 16;
481
482 New(54,PL_savestack,96,ANY);
483 PL_savestack_ix = 0;
484 PL_savestack_max = 96;
485
486 New(54,PL_retstack,8,OP*);
487 PL_retstack_ix = 0;
488 PL_retstack_max = 8;
489}
490
491/*
492 * destroy the stacks, the callchain etc...
493 * still there is a memleak of 128 bytes...
494 */
495STATIC void
496destroy_stacks(pTHX)
497{
498 /* is this ugly, I ask? */
499 while (PL_scopestack_ix)
500 LEAVE;
501
502 /* sure it is, but more important: is it correct?? :/ */
503 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
504 FREETMPS;
505
506 while (PL_curstackinfo->si_next)
507 PL_curstackinfo = PL_curstackinfo->si_next;
508
509 while (PL_curstackinfo)
510 {
511 PERL_SI *p = PL_curstackinfo->si_prev;
512
513 {
514 dSP;
515 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
516 PUTBACK; /* possibly superfluous */
517 }
518
519 dounwind(-1);
520
521 SvREFCNT_dec(PL_curstackinfo->si_stack);
522 Safefree(PL_curstackinfo->si_cxstack);
523 Safefree(PL_curstackinfo);
524 PL_curstackinfo = p;
525 }
526
527 Safefree(PL_tmps_stack);
528 Safefree(PL_markstack);
529 Safefree(PL_scopestack);
530 Safefree(PL_savestack);
531 Safefree(PL_retstack);
532}
533
534static void
535allocate_stack (Coro__State ctx, int alloc)
536{
537 coro_stack *stack;
538
539 New (0, stack, 1, coro_stack);
540
541 stack->refcnt = 1;
542 stack->usecnt = 1;
543 stack->gencnt = ctx->gencnt = 0;
544 if (alloc)
545 {
546#ifdef HAVE_MMAP
547 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);
549 if (stack->sptr == (void *)-1)
550#endif
551 {
552 /*FIXME*//*D*//* reasonable stack size! */
553 stack->ssize = -4096 * sizeof (long);
554 New (0, stack->sptr, 4096, long);
555 }
556 }
557 else
558 stack->sptr = 0;
559
560 ctx->stack = stack;
561}
562
563static void
564deallocate_stack (Coro__State ctx)
565{
566 coro_stack *stack = ctx->stack;
567
568 ctx->stack = 0;
569
570 if (stack)
571 {
572 if (!--stack->refcnt)
573 {
574#ifdef HAVE_MMAP
575 if (stack->ssize > 0 && stack->sptr)
576 munmap (stack->sptr, stack->ssize);
577 else
578#else
579 Safefree (stack->sptr);
580#endif
581 Safefree (stack);
582 }
583 else if (ctx->gencnt == stack->gencnt)
584 --stack->usecnt;
585 }
586}
587
588static void
589setup_coro (void *arg)
590{
591 /*
592 * emulate part of the perl startup here.
593 */
594 dSP;
595 Coro__State ctx = (Coro__State)arg;
596 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
597
598 coro_init_stacks (aTHX);
599 /*PL_curcop = 0;*/
600 /*PL_in_eval = PL_in_eval;*/ /* inherit */
601 SvREFCNT_dec (GvAV (PL_defgv));
602 GvAV (PL_defgv) = ctx->args;
603
604 SPAGAIN;
605
606 if (ctx->stack)
607 {
608 ctx->cursp = 0;
609
610 PUSHMARK(SP);
611 PUTBACK;
612 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
613
614 if (SvTRUE (ERRSV))
615 croak (NULL);
616 else
617 croak ("FATAL: CCTXT coroutine returned!");
618 }
619 else
620 {
621 UNOP myop;
622
623 PL_op = (OP *)&myop;
624
625 Zero(&myop, 1, UNOP);
626 myop.op_next = Nullop;
627 myop.op_flags = OPf_WANT_VOID;
628
629 PUSHMARK(SP);
630 XPUSHs (sub_init);
631 /*
632 * the next line is slightly wrong, as PL_op->op_next
633 * is actually being executed so we skip the first op.
634 * that doesn't matter, though, since it is only
635 * pp_nextstate and we never return...
636 * ah yes, and I don't care anyways ;)
637 */
638 PUTBACK;
639 PL_op = pp_entersub();
640 SPAGAIN;
641
642 ENTER; /* necessary e.g. for dounwind */
643 }
644}
645
646static void
647continue_coro (void *arg)
648{
649 /*
650 * this is a _very_ stripped down perl interpreter ;)
651 */
652 Coro__State ctx = (Coro__State)arg;
653
654 /*FIXME*//* must set up top_env here */
655 ctx->cursp = 0;
656 PL_op = PL_op->op_next;
657 CALLRUNOPS(aTHX);
658
659 abort ();
660}
661
662STATIC void
663transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
664{
665 dSP;
666 dSTACKLEVEL;
667
668 if (prev != next)
669 {
670 if (next->mainstack)
671 {
672 SAVE (prev, flags);
673 LOAD (next);
674
675 /* mark this state as in-use */
676 next->mainstack = 0;
677 next->tmps_ix = -2;
678
679 /* stacklevel changed? if yes, grab the stack for us! */
680 if (flags & TRANSFER_SAVE_CCTXT)
681 {
682 if (!prev->stack)
683 allocate_stack (prev, 0);
684 else if (prev->cursp != stacklevel
685 && prev->stack->usecnt > 1)
686 {
687 prev->gencnt = ++prev->stack->gencnt;
688 prev->stack->usecnt = 1;
689 }
690
691 /* has our stack been invalidated? */
692 if (next->stack && next->stack->gencnt != next->gencnt)
693 {
694 deallocate_stack (next);
695 allocate_stack (next, 1);
696 coro_create (&(next->stack->cctx),
697 continue_coro, (void *)next,
698 next->stack->sptr, labs (next->stack->ssize));
699 }
700
701 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
702 }
703
704 }
705 else if (next->tmps_ix == -2)
706 croak ("tried to transfer to running coroutine");
707 else
708 {
709 SAVE (prev, -1); /* first get rid of the old state */
710
711 if (flags & TRANSFER_SAVE_CCTXT)
712 {
713 if (!prev->stack)
714 allocate_stack (prev, 0);
715
716 if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
717 {
718 setup_coro (next);
719
720 prev->stack->refcnt++;
721 prev->stack->usecnt++;
722 next->stack = prev->stack;
723 next->gencnt = prev->gencnt;
724 }
725 else
726 {
727 allocate_stack (next, 1);
728 coro_create (&(next->stack->cctx),
729 setup_coro, (void *)next,
730 next->stack->sptr, labs (next->stack->ssize));
731 coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
732 }
733 }
734 else
735 setup_coro (next);
736 }
737 }
738
739 next->cursp = stacklevel;
740}
741
742static struct coro *
743sv_to_coro (SV *arg, const char *funcname, const char *varname)
744{
745 if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
746 {
747 HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
748
749 if (!he)
750 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
751
752 arg = HeVAL(he);
753 }
754
755 /* must also be changed inside Coro::Cont::yield */
756 if (SvROK(arg) && SvSTASH(SvRV(arg)) == 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);
760}
761
762static void
763api_transfer(pTHX_ SV *prev, SV *next, int flags)
764{
765 transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"),
766 sv_to_coro (next, "Coro::transfer", "next"),
767 flags);
768}
769 193
770/** Coro ********************************************************************/ 194/** Coro ********************************************************************/
771 195
772#define PRIO_MAX 3 196#define PRIO_MAX 3
773#define PRIO_HIGH 1 197#define PRIO_HIGH 1
… …
775#define PRIO_LOW -1 199#define PRIO_LOW -1
776#define PRIO_IDLE -3 200#define PRIO_IDLE -3
777#define PRIO_MIN -4 201#define PRIO_MIN -4
778 202
779/* for Coro.pm */ 203/* for Coro.pm */
780static GV *coro_current, *coro_idle; 204static SV *coro_current;
781static AV *coro_ready[PRIO_MAX-PRIO_MIN+1]; 205static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
206static int coro_nready;
782 207
783static void 208/** lowlevel stuff **********************************************************/
784coro_enq (SV *sv) 209
210static AV *
211coro_clone_padlist (CV *cv)
785{ 212{
786 if (SvROK (sv)) 213 AV *padlist = CvPADLIST (cv);
214 AV *newpadlist, *newpad;
215
216 newpadlist = newAV ();
217 AvREAL_off (newpadlist);
218#if PERL_VERSION_ATLEAST (5,9,0)
219 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
220#else
221 Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
222#endif
223 newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
224 --AvFILLp (padlist);
225
226 av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
227 av_store (newpadlist, 1, (SV *)newpad);
228
229 return newpadlist;
230}
231
232static void
233free_padlist (AV *padlist)
234{
235 /* may be during global destruction */
236 if (SvREFCNT (padlist))
787 { 237 {
788 SV *hv = SvRV (sv); 238 I32 i = AvFILLp (padlist);
789 if (SvTYPE (hv) == SVt_PVHV) 239 while (i >= 0)
790 { 240 {
791 SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0); 241 SV **svp = av_fetch (padlist, i--, FALSE);
792 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL; 242 if (svp)
243 {
244 SV *sv;
245 while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
246 SvREFCNT_dec (sv);
793 247
794 prio = prio > PRIO_MAX ? PRIO_MAX 248 SvREFCNT_dec (*svp);
795 : prio < PRIO_MIN ? PRIO_MIN 249 }
796 : prio;
797
798 av_push (coro_ready [prio - PRIO_MIN], sv);
799
800 return;
801 } 250 }
251
252 SvREFCNT_dec ((SV*)padlist);
253 }
254}
255
256static int
257coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
258{
259 AV *padlist;
260 AV *av = (AV *)mg->mg_obj;
261
262 /* casting is fun. */
263 while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
264 free_padlist (padlist);
265
266 SvREFCNT_dec (av);
267
268 return 0;
269}
270
271#define PERL_MAGIC_coro PERL_MAGIC_ext
272
273static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
274
275#define CORO_MAGIC(cv) \
276 SvMAGIC (cv) \
277 ? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
278 ? SvMAGIC (cv) \
279 : mg_find ((SV *)cv, PERL_MAGIC_coro) \
280 : 0
281
282/* the next two functions merely cache the padlists */
283static void
284get_padlist (CV *cv)
285{
286 MAGIC *mg = CORO_MAGIC (cv);
287 AV *av;
288
289 if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
290 CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
291 else
292 {
293#if CORO_PREFER_PERL_FUNCTIONS
294 /* this is probably cleaner, but also slower? */
295 CV *cp = Perl_cv_clone (cv);
296 CvPADLIST (cv) = CvPADLIST (cp);
297 CvPADLIST (cp) = 0;
298 SvREFCNT_dec (cp);
299#else
300 CvPADLIST (cv) = coro_clone_padlist (cv);
301#endif
802 } 302 }
303}
803 304
804 croak ("Coro::ready tried to enqueue something that is not a coroutine"); 305static void
306put_padlist (CV *cv)
307{
308 MAGIC *mg = CORO_MAGIC (cv);
309 AV *av;
310
311 if (!mg)
312 {
313 sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
314 mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
315 mg->mg_virtual = &vtbl_coro;
316 mg->mg_obj = (SV *)newAV ();
317 }
318
319 av = (AV *)mg->mg_obj;
320
321 if (AvFILLp (av) >= AvMAX (av))
322 av_extend (av, AvMAX (av) + 1);
323
324 AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
325}
326
327/** load & save, init *******************************************************/
328
329#define SB do {
330#define SE } while (0)
331
332#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
333
334static void
335load_perl (Coro__State c)
336{
337#define VAR(name,type) PL_ ## name = c->name;
338# include "state.h"
339#undef VAR
340
341 if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
342 if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
343 if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
344 if (c->irssv)
345 {
346 if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
347 SvREFCNT_dec (c->irssv);
348 else
349 {
350 REPLACE_SV (PL_rs, c->irssv);
351 if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
352 sv_setsv (c->irssv_sv, PL_rs);
353 }
354 }
355
356 {
357 dSP;
358 CV *cv;
359
360 /* now do the ugly restore mess */
361 while ((cv = (CV *)POPs))
362 {
363 put_padlist (cv); /* mark this padlist as available */
364 CvDEPTH (cv) = PTR2IV (POPs);
365 CvPADLIST (cv) = (AV *)POPs;
366 }
367
368 PUTBACK;
369 }
370 assert (!PL_comppad || AvARRAY (PL_comppad));//D
371}
372
373static void
374save_perl (Coro__State c)
375{
376 assert (!PL_comppad || AvARRAY (PL_comppad));//D
377 {
378 dSP;
379 I32 cxix = cxstack_ix;
380 PERL_CONTEXT *ccstk = cxstack;
381 PERL_SI *top_si = PL_curstackinfo;
382
383 /*
384 * the worst thing you can imagine happens first - we have to save
385 * (and reinitialize) all cv's in the whole callchain :(
386 */
387
388 EXTEND (SP, 3 + 1);
389 PUSHs (Nullsv);
390 /* this loop was inspired by pp_caller */
391 for (;;)
392 {
393 while (cxix >= 0)
394 {
395 PERL_CONTEXT *cx = &ccstk[cxix--];
396
397 if (CxTYPE (cx) == CXt_SUB)
398 {
399 CV *cv = cx->blk_sub.cv;
400
401 if (CvDEPTH (cv))
402 {
403 EXTEND (SP, 3);
404 PUSHs ((SV *)CvPADLIST (cv));
405 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
406 PUSHs ((SV *)cv);
407
408 CvDEPTH (cv) = 0;
409 get_padlist (cv);
410 }
411 }
412 }
413
414 if (top_si->si_type == PERLSI_MAIN)
415 break;
416
417 top_si = top_si->si_prev;
418 ccstk = top_si->si_cxstack;
419 cxix = top_si->si_cxix;
420 }
421
422 PUTBACK;
423 }
424
425 c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
426 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
427 c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
428 c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
429
430#define VAR(name,type)c->name = PL_ ## name;
431# include "state.h"
432#undef VAR
433}
434
435/*
436 * allocate various perl stacks. This is an exact copy
437 * of perl.c:init_stacks, except that it uses less memory
438 * on the (sometimes correct) assumption that coroutines do
439 * not usually need a lot of stackspace.
440 */
441#if CORO_PREFER_PERL_FUNCTIONS
442# define coro_init_stacks init_stacks
443#else
444static void
445coro_init_stacks ()
446{
447 PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
448 PL_curstackinfo->si_type = PERLSI_MAIN;
449 PL_curstack = PL_curstackinfo->si_stack;
450 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
451
452 PL_stack_base = AvARRAY(PL_curstack);
453 PL_stack_sp = PL_stack_base;
454 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
455
456 New(50,PL_tmps_stack,128,SV*);
457 PL_tmps_floor = -1;
458 PL_tmps_ix = -1;
459 PL_tmps_max = 128;
460
461 New(54,PL_markstack,32,I32);
462 PL_markstack_ptr = PL_markstack;
463 PL_markstack_max = PL_markstack + 32;
464
465#ifdef SET_MARK_OFFSET
466 SET_MARK_OFFSET;
467#endif
468
469 New(54,PL_scopestack,32,I32);
470 PL_scopestack_ix = 0;
471 PL_scopestack_max = 32;
472
473 New(54,PL_savestack,64,ANY);
474 PL_savestack_ix = 0;
475 PL_savestack_max = 64;
476
477#if !PERL_VERSION_ATLEAST (5,9,0)
478 New(54,PL_retstack,16,OP*);
479 PL_retstack_ix = 0;
480 PL_retstack_max = 16;
481#endif
482}
483#endif
484
485/*
486 * destroy the stacks, the callchain etc...
487 */
488static void
489coro_destroy_stacks ()
490{
491 if (!IN_DESTRUCT)
492 {
493 /* restore all saved variables and stuff */
494 LEAVE_SCOPE (0);
495 assert (PL_tmps_floor == -1);
496
497 /* free all temporaries */
498 FREETMPS;
499 assert (PL_tmps_ix == -1);
500
501 /* unwind all extra stacks */
502 POPSTACK_TO (PL_mainstack);
503
504 /* unwind main stack */
505 dounwind (-1);
506 }
507
508 while (PL_curstackinfo->si_next)
509 PL_curstackinfo = PL_curstackinfo->si_next;
510
511 while (PL_curstackinfo)
512 {
513 PERL_SI *p = PL_curstackinfo->si_prev;
514
515 if (!IN_DESTRUCT)
516 SvREFCNT_dec (PL_curstackinfo->si_stack);
517
518 Safefree (PL_curstackinfo->si_cxstack);
519 Safefree (PL_curstackinfo);
520 PL_curstackinfo = p;
521 }
522
523 Safefree (PL_tmps_stack);
524 Safefree (PL_markstack);
525 Safefree (PL_scopestack);
526 Safefree (PL_savestack);
527#if !PERL_VERSION_ATLEAST (5,9,0)
528 Safefree (PL_retstack);
529#endif
530}
531
532/** coroutine stack handling ************************************************/
533
534static void
535setup_coro (struct coro *coro)
536{
537 /*
538 * emulate part of the perl startup here.
539 */
540
541 coro_init_stacks ();
542
543 PL_curcop = &PL_compiling;
544 PL_in_eval = EVAL_NULL;
545 PL_comppad = 0;
546 PL_curpm = 0;
547 PL_localizing = 0;
548 PL_dirty = 0;
549 PL_restartop = 0;
550
551 {
552 dSP;
553 LOGOP myop;
554
555 SvREFCNT_dec (GvAV (PL_defgv));
556 GvAV (PL_defgv) = coro->args; coro->args = 0;
557
558 Zero (&myop, 1, LOGOP);
559 myop.op_next = Nullop;
560 myop.op_flags = OPf_WANT_VOID;
561
562 PUSHMARK (SP);
563 XPUSHs ((SV *)get_cv ("Coro::State::_coro_init", FALSE));
564 PUTBACK;
565 PL_op = (OP *)&myop;
566 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
567 SPAGAIN;
568 }
569
570 ENTER; /* necessary e.g. for dounwind */
571}
572
573static void
574free_coro_mortal ()
575{
576 if (coro_mortal)
577 {
578 SvREFCNT_dec (coro_mortal);
579 coro_mortal = 0;
580 }
581}
582
583/* inject a fake call to Coro::State::_cctx_init into the execution */
584static void NOINLINE
585prepare_cctx (coro_cctx *cctx)
586{
587 dSP;
588 LOGOP myop;
589
590 Zero (&myop, 1, LOGOP);
591 myop.op_next = PL_op;
592 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
593
594 PUSHMARK (SP);
595 EXTEND (SP, 2);
596 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
597 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
598 PUTBACK;
599 PL_op = (OP *)&myop;
600 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
601 SPAGAIN;
602}
603
604static void
605coro_run (void *arg)
606{
607 /* coro_run is the alternative tail of transfer(), so unlock here. */
608 UNLOCK;
609
610 /*
611 * this is a _very_ stripped down perl interpreter ;)
612 */
613 PL_top_env = &PL_start_env;
614
615 /* inject call to cctx_init */
616 prepare_cctx ((coro_cctx *)arg);
617
618 /* somebody will hit me for both perl_run and PL_restartop */
619 PL_restartop = PL_op;
620 perl_run (PL_curinterp);
621
622 fputs ("FATAL: C coroutine fell over the edge of the world, aborting. Did you call exit in a coroutine?\n", stderr);
623 abort ();
624}
625
626static coro_cctx *
627cctx_new ()
628{
629 coro_cctx *cctx;
630 void *stack_start;
631 size_t stack_size;
632
633 ++cctx_count;
634
635 Newz (0, cctx, 1, coro_cctx);
636
637#if HAVE_MMAP
638
639 cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
640 /* mmap supposedly does allocate-on-write for us */
641 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
642
643 if (cctx->sptr != (void *)-1)
644 {
645# if CORO_STACKGUARD
646 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
647# endif
648 stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
649 stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
650 cctx->mapped = 1;
651 }
652 else
653#endif
654 {
655 cctx->ssize = coro_stacksize * (long)sizeof (long);
656 New (0, cctx->sptr, coro_stacksize, long);
657
658 if (!cctx->sptr)
659 {
660 perror ("FATAL: unable to allocate stack for coroutine");
661 _exit (EXIT_FAILURE);
662 }
663
664 stack_start = cctx->sptr;
665 stack_size = cctx->ssize;
666 }
667
668 REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
669 coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size);
670
671 return cctx;
672}
673
674static void
675cctx_destroy (coro_cctx *cctx)
676{
677 if (!cctx)
678 return;
679
680 --cctx_count;
681
682#if CORO_USE_VALGRIND
683 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
684#endif
685
686#if HAVE_MMAP
687 if (cctx->mapped)
688 munmap (cctx->sptr, cctx->ssize);
689 else
690#endif
691 Safefree (cctx->sptr);
692
693 Safefree (cctx);
694}
695
696static coro_cctx *
697cctx_get ()
698{
699 while (cctx_first)
700 {
701 coro_cctx *cctx = cctx_first;
702 cctx_first = cctx->next;
703 --cctx_idle;
704
705 if (cctx->ssize >= coro_stacksize)
706 return cctx;
707
708 cctx_destroy (cctx);
709 }
710
711 PL_op = PL_op->op_next;
712 return cctx_new ();
713}
714
715static void
716cctx_put (coro_cctx *cctx)
717{
718 /* free another cctx if overlimit */
719 if (cctx_idle >= MAX_IDLE_CCTX)
720 {
721 coro_cctx *first = cctx_first;
722 cctx_first = first->next;
723 --cctx_idle;
724
725 assert (!first->inuse);
726 cctx_destroy (first);
727 }
728
729 ++cctx_idle;
730 cctx->next = cctx_first;
731 cctx_first = cctx;
732}
733
734/** coroutine switching *****************************************************/
735
736/* never call directly, always through the coro_state_transfer global variable */
737static void NOINLINE
738transfer (struct coro *prev, struct coro *next)
739{
740 dSTACKLEVEL;
741
742 /* sometimes transfer is only called to set idle_sp */
743 if (!next)
744 {
745 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
746 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
747 }
748 else if (prev != next)
749 {
750 coro_cctx *prev__cctx;
751
752 if (prev->flags & CF_NEW)
753 {
754 /* create a new empty context */
755 Newz (0, prev->cctx, 1, coro_cctx);
756 prev->cctx->inuse = 1;
757 prev->flags &= ~CF_NEW;
758 prev->flags |= CF_RUNNING;
759 }
760
761 /*TODO: must not croak here */
762 if (!prev->flags & CF_RUNNING)
763 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
764
765 if (next->flags & CF_RUNNING)
766 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
767
768 if (next->flags & CF_DESTROYED)
769 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
770
771 prev->flags &= ~CF_RUNNING;
772 next->flags |= CF_RUNNING;
773
774 LOCK;
775
776 if (next->flags & CF_NEW)
777 {
778 /* need to start coroutine */
779 next->flags &= ~CF_NEW;
780 /* first get rid of the old state */
781 save_perl (prev);
782 /* setup coroutine call */
783 setup_coro (next);
784 /* need a new stack */
785 assert (!next->cctx);
786 }
787 else
788 {
789 /* coroutine already started */
790 save_perl (prev);
791 load_perl (next);
792 }
793
794 prev__cctx = prev->cctx;
795
796 /* possibly "free" the cctx */
797 if (prev__cctx->idle_sp == STACKLEVEL)
798 {
799 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
800 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
801
802 prev->cctx = 0;
803
804 cctx_put (prev__cctx);
805 prev__cctx->inuse = 0;
806 }
807
808 if (!next->cctx)
809 {
810 next->cctx = cctx_get ();
811 assert (!next->cctx->inuse);
812 next->cctx->inuse = 1;
813 }
814
815 if (prev__cctx != next->cctx)
816 {
817 prev__cctx->top_env = PL_top_env;
818 PL_top_env = next->cctx->top_env;
819 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
820 }
821
822 free_coro_mortal ();
823 UNLOCK;
824 }
825}
826
827struct transfer_args
828{
829 struct coro *prev, *next;
830};
831
832#define TRANSFER(ta) transfer ((ta).prev, (ta).next)
833
834/** high level stuff ********************************************************/
835
836static int
837coro_state_destroy (struct coro *coro)
838{
839 if (coro->flags & CF_DESTROYED)
840 return 0;
841
842 coro->flags |= CF_DESTROYED;
843
844 if (coro->flags & CF_READY)
845 {
846 /* reduce nready, as destroying a ready coro effectively unreadies it */
847 /* alternative: look through all ready queues and remove the coro */
848 LOCK;
849 --coro_nready;
850 UNLOCK;
851 }
852 else
853 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
854
855 if (coro->mainstack && coro->mainstack != main_mainstack)
856 {
857 struct coro temp;
858
859 assert (!(coro->flags & CF_RUNNING));
860
861 Zero (&temp, 1, struct coro);
862 temp.save = CORO_SAVE_ALL;
863
864 if (coro->flags & CF_RUNNING)
865 croak ("FATAL: tried to destroy currently running coroutine");
866
867 save_perl (&temp);
868 load_perl (coro);
869
870 coro_destroy_stacks ();
871
872 load_perl (&temp); /* this will get rid of defsv etc.. */
873
874 coro->mainstack = 0;
875 }
876
877 cctx_destroy (coro->cctx);
878 SvREFCNT_dec (coro->args);
879
880 return 1;
881}
882
883static int
884coro_state_free (pTHX_ SV *sv, MAGIC *mg)
885{
886 struct coro *coro = (struct coro *)mg->mg_ptr;
887 mg->mg_ptr = 0;
888
889 if (--coro->refcnt < 0)
890 {
891 coro_state_destroy (coro);
892 Safefree (coro);
893 }
894
895 return 0;
896}
897
898static int
899coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
900{
901 struct coro *coro = (struct coro *)mg->mg_ptr;
902
903 ++coro->refcnt;
904
905 return 0;
906}
907
908static MGVTBL coro_state_vtbl = {
909 0, 0, 0, 0,
910 coro_state_free,
911 0,
912#ifdef MGf_DUP
913 coro_state_dup,
914#else
915# define MGf_DUP 0
916#endif
917};
918
919static struct coro *
920SvSTATE (SV *coro)
921{
922 HV *stash;
923 MAGIC *mg;
924
925 if (SvROK (coro))
926 coro = SvRV (coro);
927
928 stash = SvSTASH (coro);
929 if (stash != coro_stash && stash != coro_state_stash)
930 {
931 /* very slow, but rare, check */
932 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
933 croak ("Coro::State object required");
934 }
935
936 mg = CORO_MAGIC (coro);
937 return (struct coro *)mg->mg_ptr;
938}
939
940static void
941prepare_transfer (struct transfer_args *ta, SV *prev_sv, SV *next_sv)
942{
943 ta->prev = SvSTATE (prev_sv);
944 ta->next = SvSTATE (next_sv);
945}
946
947static void
948api_transfer (SV *prev_sv, SV *next_sv)
949{
950 struct transfer_args ta;
951
952 prepare_transfer (&ta, prev_sv, next_sv);
953 TRANSFER (ta);
954}
955
956static int
957api_save (SV *coro_sv, int new_save)
958{
959 struct coro *coro = SvSTATE (coro_sv);
960 int old_save = coro->save;
961
962 if (new_save >= 0)
963 coro->save = new_save;
964
965 return old_save;
966}
967
968/** Coro ********************************************************************/
969
970static void
971coro_enq (SV *coro_sv)
972{
973 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
805} 974}
806 975
807static SV * 976static SV *
808coro_deq (int min_prio) 977coro_deq (int min_prio)
809{ 978{
… …
812 min_prio -= PRIO_MIN; 981 min_prio -= PRIO_MIN;
813 if (min_prio < 0) 982 if (min_prio < 0)
814 min_prio = 0; 983 min_prio = 0;
815 984
816 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 985 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
817 if (av_len (coro_ready[prio]) >= 0) 986 if (AvFILLp (coro_ready [prio]) >= 0)
818 return av_shift (coro_ready[prio]); 987 return av_shift (coro_ready [prio]);
819 988
820 return 0; 989 return 0;
821} 990}
822 991
823static void 992static int
824api_ready (SV *coro) 993api_ready (SV *coro_sv)
825{ 994{
995 struct coro *coro;
996
997 if (SvROK (coro_sv))
998 coro_sv = SvRV (coro_sv);
999
1000 coro = SvSTATE (coro_sv);
1001
1002 if (coro->flags & CF_READY)
1003 return 0;
1004
1005 coro->flags |= CF_READY;
1006
1007 LOCK;
826 coro_enq (SvREFCNT_inc (coro)); 1008 coro_enq (SvREFCNT_inc (coro_sv));
827} 1009 ++coro_nready;
1010 UNLOCK;
828 1011
1012 return 1;
1013}
1014
829static void 1015static int
830api_schedule (int cede) 1016api_is_ready (SV *coro_sv)
831{ 1017{
1018 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1019}
1020
1021static void
1022prepare_schedule (struct transfer_args *ta)
1023{
832 SV *prev, *next; 1024 SV *prev_sv, *next_sv;
833 1025
834 prev = GvSV (coro_current); 1026 for (;;)
835 1027 {
836 if (cede) 1028 LOCK;
837 coro_enq (SvREFCNT_inc (prev));
838
839 next = coro_deq (PRIO_MIN); 1029 next_sv = coro_deq (PRIO_MIN);
840 1030
1031 /* nothing to schedule: call the idle handler */
841 if (!next) 1032 if (!next_sv)
842 next = SvREFCNT_inc (GvSV (coro_idle)); 1033 {
1034 dSP;
1035 UNLOCK;
843 1036
844 GvSV (coro_current) = SvREFCNT_inc (next); 1037 ENTER;
845 transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"), 1038 SAVETMPS;
846 sv_to_coro (next, "Coro::schedule", "next coroutine"), 1039
847 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK); 1040 PUSHMARK (SP);
1041 PUTBACK;
1042 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1043
1044 FREETMPS;
1045 LEAVE;
1046 continue;
1047 }
1048
1049 ta->next = SvSTATE (next_sv);
1050
1051 /* cannot transfer to destroyed coros, skip and look for next */
1052 if (ta->next->flags & CF_DESTROYED)
1053 {
1054 UNLOCK;
848 SvREFCNT_dec (next); 1055 SvREFCNT_dec (next_sv);
849 SvREFCNT_dec (prev); 1056 /* coro_nready is already taken care of by destroy */
1057 continue;
1058 }
1059
1060 --coro_nready;
1061 UNLOCK;
1062 break;
1063 }
1064
1065 /* free this only after the transfer */
1066 prev_sv = SvRV (coro_current);
1067 SvRV_set (coro_current, next_sv);
1068 ta->prev = SvSTATE (prev_sv);
1069
1070 assert (ta->next->flags & CF_READY);
1071 ta->next->flags &= ~CF_READY;
1072
1073 LOCK;
1074 free_coro_mortal ();
1075 coro_mortal = prev_sv;
1076 UNLOCK;
1077}
1078
1079static void
1080prepare_cede (struct transfer_args *ta)
1081{
1082 api_ready (coro_current);
1083 prepare_schedule (ta);
1084}
1085
1086static int
1087prepare_cede_notself (struct transfer_args *ta)
1088{
1089 if (coro_nready)
1090 {
1091 SV *prev = SvRV (coro_current);
1092 prepare_schedule (ta);
1093 api_ready (prev);
1094 return 1;
1095 }
1096 else
1097 return 0;
1098}
1099
1100static void
1101api_schedule (void)
1102{
1103 struct transfer_args ta;
1104
1105 prepare_schedule (&ta);
1106 TRANSFER (ta);
1107}
1108
1109static int
1110api_cede (void)
1111{
1112 struct transfer_args ta;
1113
1114 prepare_cede (&ta);
1115
1116 if (ta.prev != ta.next)
1117 {
1118 TRANSFER (ta);
1119 return 1;
1120 }
1121 else
1122 return 0;
1123}
1124
1125static int
1126api_cede_notself (void)
1127{
1128 struct transfer_args ta;
1129
1130 if (prepare_cede_notself (&ta))
1131 {
1132 TRANSFER (ta);
1133 return 1;
1134 }
1135 else
1136 return 0;
850} 1137}
851 1138
852MODULE = Coro::State PACKAGE = Coro::State 1139MODULE = Coro::State PACKAGE = Coro::State
853 1140
854PROTOTYPES: ENABLE 1141PROTOTYPES: DISABLE
855 1142
856BOOT: 1143BOOT:
857{ /* {} necessary for stoopid perl-5.6.x */ 1144{
858 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1145#ifdef USE_ITHREADS
859 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1146 MUTEX_INIT (&coro_mutex);
1147#endif
1148 BOOT_PAGESIZE;
1149
860 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1150 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
861 1151
862 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1152 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
863 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1153 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
864 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1154 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1155 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
865 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1156 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
866
867 if (!padlist_cache)
868 padlist_cache = newHV ();
869 1157
870 main_mainstack = PL_mainstack; 1158 main_mainstack = PL_mainstack;
871 1159
872 {
873 SV *sv = perl_get_sv("Coro::API", 1);
874
875 coroapi.ver = CORO_API_VERSION - 1; 1160 coroapi.ver = CORO_API_VERSION;
876 coroapi.transfer = api_transfer; 1161 coroapi.transfer = api_transfer;
877 coroapi.schedule = api_schedule;
878 coroapi.ready = api_ready;
879 1162
880 GCoroAPI = &coroapi; 1163 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
881 sv_setiv(sv, (IV)&coroapi);
882 SvREADONLY_on(sv);
883 }
884} 1164}
885 1165
886Coro::State 1166SV *
887_newprocess(args) 1167new (char *klass, ...)
888 SV * args
889 PROTOTYPE: $
890 CODE: 1168 CODE:
891 Coro__State coro; 1169{
1170 struct coro *coro;
1171 HV *hv;
1172 int i;
892 1173
893 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
894 croak ("Coro::State::_newprocess expects an arrayref");
895
896 New (0, coro, 1, struct coro); 1174 Newz (0, coro, 1, struct coro);
1175 coro->args = newAV ();
1176 coro->save = CORO_SAVE_ALL;
1177 coro->flags = CF_NEW;
897 1178
898 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1179 hv = newHV ();
899 coro->mainstack = 0; /* actual work is done inside transfer */ 1180 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
900 coro->stack = 0; 1181 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
901 1182
902 RETVAL = coro; 1183 for (i = 1; i < items; i++)
1184 av_push (coro->args, newSVsv (ST (i)));
1185}
903 OUTPUT: 1186 OUTPUT:
904 RETVAL 1187 RETVAL
905 1188
1189int
1190save (SV *coro, int new_save = -1)
1191 CODE:
1192 RETVAL = api_save (coro, new_save);
1193 OUTPUT:
1194 RETVAL
1195
906void 1196void
907transfer(prev, next, flags) 1197_set_stacklevel (...)
908 Coro::State_or_hashref prev 1198 ALIAS:
909 Coro::State_or_hashref next 1199 Coro::State::transfer = 1
910 int flags 1200 Coro::schedule = 2
911 PROTOTYPE: @ 1201 Coro::cede = 3
1202 Coro::cede_notself = 4
912 CODE: 1203 CODE:
913 PUTBACK; 1204{
914 transfer (aTHX_ prev, next, flags); 1205 struct transfer_args ta;
915 SPAGAIN; 1206
1207 switch (ix)
1208 {
1209 case 0:
1210 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1211 ta.next = 0;
1212 break;
1213
1214 case 1:
1215 if (items != 2)
1216 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1217
1218 prepare_transfer (&ta, ST (0), ST (1));
1219 break;
1220
1221 case 2:
1222 prepare_schedule (&ta);
1223 break;
1224
1225 case 3:
1226 prepare_cede (&ta);
1227 break;
1228
1229 case 4:
1230 if (!prepare_cede_notself (&ta))
1231 XSRETURN_EMPTY;
1232
1233 break;
1234 }
1235
1236 BARRIER;
1237 TRANSFER (ta);
1238
1239 if (GIMME_V != G_VOID && ta.next != ta.prev)
1240 XSRETURN_YES;
1241}
1242
1243bool
1244_destroy (SV *coro_sv)
1245 CODE:
1246 RETVAL = coro_state_destroy (SvSTATE (coro_sv));
1247 OUTPUT:
1248 RETVAL
916 1249
917void 1250void
918DESTROY(coro)
919 Coro::State coro
920 CODE:
921
922 if (coro->mainstack && coro->mainstack != main_mainstack)
923 {
924 struct coro temp;
925
926 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
927 LOAD(aTHX_ coro);
928
929 destroy_stacks (aTHX);
930
931 LOAD((&temp)); /* this will get rid of defsv etc.. */
932
933 coro->mainstack = 0;
934 }
935
936 deallocate_stack (coro);
937
938 Safefree (coro);
939
940void
941flush()
942 CODE:
943#ifdef MAY_FLUSH
944 flush_padlist_cache ();
945#endif
946
947void
948_exit(code) 1251_exit (code)
949 int code 1252 int code
950 PROTOTYPE: $ 1253 PROTOTYPE: $
951 CODE: 1254 CODE:
952#if defined(__GLIBC__) || _POSIX_C_SOURCE
953 _exit (code); 1255 _exit (code);
954#else
955 signal (SIGTERM, SIG_DFL);
956 raise (SIGTERM);
957 exit (code);
958#endif
959 1256
960MODULE = Coro::State PACKAGE = Coro::Cont 1257int
1258cctx_stacksize (int new_stacksize = 0)
1259 CODE:
1260 RETVAL = coro_stacksize;
1261 if (new_stacksize)
1262 coro_stacksize = new_stacksize;
1263 OUTPUT:
1264 RETVAL
961 1265
962# this is slightly dirty (should expose a c-level api) 1266int
1267cctx_count ()
1268 CODE:
1269 RETVAL = cctx_count;
1270 OUTPUT:
1271 RETVAL
963 1272
964void 1273int
965yield(...) 1274cctx_idle ()
966 PROTOTYPE: @ 1275 CODE:
967 CODE: 1276 RETVAL = cctx_idle;
968 static SV *returnstk; 1277 OUTPUT:
969 SV *sv; 1278 RETVAL
970 AV *defav = GvAV (PL_defgv);
971 struct coro *prev, *next;
972
973 if (!returnstk)
974 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
975
976 /* set up @_ -- ugly */
977 av_clear (defav);
978 av_fill (defav, items - 1);
979 while (items--)
980 av_store (defav, items, SvREFCNT_inc (ST(items)));
981
982 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
983 sv = av_pop ((AV *)SvRV (returnstk));
984 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
985 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
986 SvREFCNT_dec (sv);
987
988 transfer(aTHX_ prev, next, 0);
989 1279
990MODULE = Coro::State PACKAGE = Coro 1280MODULE = Coro::State PACKAGE = Coro
991 1281
992# this is slightly dirty (should expose a c-level api)
993
994BOOT: 1282BOOT:
995{ 1283{
996 int i; 1284 int i;
1285
997 HV *stash = gv_stashpv ("Coro", TRUE); 1286 coro_stash = gv_stashpv ("Coro", TRUE);
998 1287
999 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1288 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1000 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1289 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1001 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1290 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1002 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1291 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1003 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1292 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1004 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1293 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1005 1294
1006 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1295 coro_current = get_sv ("Coro::current", FALSE);
1007 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1296 SvREADONLY_on (coro_current);
1008 1297
1009 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1298 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1010 coro_ready[i] = newAV (); 1299 coro_ready[i] = newAV ();
1300
1301 {
1302 SV *sv = perl_get_sv("Coro::API", 1);
1303
1304 coroapi.schedule = api_schedule;
1305 coroapi.save = api_save;
1306 coroapi.cede = api_cede;
1307 coroapi.cede_notself = api_cede_notself;
1308 coroapi.ready = api_ready;
1309 coroapi.is_ready = api_is_ready;
1310 coroapi.nready = &coro_nready;
1311 coroapi.current = coro_current;
1312
1313 GCoroAPI = &coroapi;
1314 sv_setiv (sv, (IV)&coroapi);
1315 SvREADONLY_on (sv);
1316 }
1011} 1317}
1012 1318
1013void 1319void
1014ready(self) 1320_set_current (SV *current)
1015 SV * self 1321 PROTOTYPE: $
1016 CODE: 1322 CODE:
1017 api_ready (self); 1323 SvREFCNT_dec (SvRV (coro_current));
1324 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1325
1326int
1327prio (Coro::State coro, int newprio = 0)
1328 ALIAS:
1329 nice = 1
1330 CODE:
1331{
1332 RETVAL = coro->prio;
1333
1334 if (items > 1)
1335 {
1336 if (ix)
1337 newprio = coro->prio - newprio;
1338
1339 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1340 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1341
1342 coro->prio = newprio;
1343 }
1344}
1345 OUTPUT:
1346 RETVAL
1347
1348SV *
1349ready (SV *self)
1350 PROTOTYPE: $
1351 CODE:
1352 RETVAL = boolSV (api_ready (self));
1353 OUTPUT:
1354 RETVAL
1355
1356SV *
1357is_ready (SV *self)
1358 PROTOTYPE: $
1359 CODE:
1360 RETVAL = boolSV (api_is_ready (self));
1361 OUTPUT:
1362 RETVAL
1363
1364int
1365nready (...)
1366 PROTOTYPE:
1367 CODE:
1368 RETVAL = coro_nready;
1369 OUTPUT:
1370 RETVAL
1371
1372MODULE = Coro::State PACKAGE = Coro::AIO
1373
1374SV *
1375_get_state ()
1376 CODE:
1377{
1378 struct io_state *data;
1379
1380 RETVAL = newSV (sizeof (struct io_state));
1381 data = (struct io_state *)SvPVX (RETVAL);
1382 SvCUR_set (RETVAL, sizeof (struct io_state));
1383 SvPOK_only (RETVAL);
1384
1385 data->errorno = errno;
1386 data->laststype = PL_laststype;
1387 data->laststatval = PL_laststatval;
1388 data->statcache = PL_statcache;
1389}
1390 OUTPUT:
1391 RETVAL
1018 1392
1019void 1393void
1020schedule(...) 1394_set_state (char *data_)
1021 ALIAS: 1395 PROTOTYPE: $
1022 cede = 1
1023 CODE: 1396 CODE:
1024 api_schedule (ix); 1397{
1398 struct io_state *data = (void *)data_;
1025 1399
1400 errno = data->errorno;
1401 PL_laststype = data->laststype;
1402 PL_laststatval = data->laststatval;
1403 PL_statcache = data->statcache;
1404}
1405

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines