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.99 by root, Sun Nov 26 23:53:20 2006 UTC vs.
Revision 1.150 by root, Wed Jun 13 21:04:48 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines