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

Diff Legend

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