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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines