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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines