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.55 by pcg, Thu Apr 1 02:29:05 2004 UTC vs.
Revision 1.136 by root, Fri Jan 12 01:05:55 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines