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

Diff Legend

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