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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines