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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines