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.63 by root, Mon Mar 21 14:35:22 2005 UTC vs.
Revision 1.132 by root, Fri Dec 29 13:03:05 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines