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.61 by root, Tue Aug 10 01:56:30 2004 UTC vs.
Revision 1.135 by root, Fri Jan 5 18:25:51 2007 UTC

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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines