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.73 by root, Sat Feb 4 06:01:13 2006 UTC vs.
Revision 1.158 by root, Fri Sep 21 02:23:48 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines