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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines