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.55 by pcg, Thu Apr 1 02:29:05 2004 UTC vs.
Revision 1.149 by root, Sat Apr 14 15:06:05 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines