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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines