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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines