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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines