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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines