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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines