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.68 by root, Mon Dec 12 20:28:30 2005 UTC vs.
Revision 1.139 by root, Sun Jan 14 21:13:41 2007 UTC

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

Diff Legend

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