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.30 by root, Sat Aug 25 22:19:05 2001 UTC vs.
Revision 1.144 by root, Sun Mar 4 11:45:23 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines