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.42 by root, Mon Dec 31 20:41:45 2001 UTC vs.
Revision 1.154 by root, Fri Sep 21 01:08:06 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
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;
106static SV *coro_mortal; /* will be freed after next transfer */
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
400 EXTEND (SP, 3 + 1);
359 PUSHs (Nullsv); 401 PUSHs (Nullsv);
360 /* this loop was inspired by pp_caller */ 402 /* this loop was inspired by pp_caller */
361 for (;;) 403 for (;;)
362 { 404 {
363 while (cxix >= 0) 405 while (cxix >= 0)
364 { 406 {
365 PERL_CONTEXT *cx = &ccstk[cxix--]; 407 PERL_CONTEXT *cx = &ccstk[cxix--];
366 408
367 if (CxTYPE(cx) == CXt_SUB) 409 if (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT)
368 { 410 {
369 CV *cv = cx->blk_sub.cv; 411 CV *cv = cx->blk_sub.cv;
412
370 if (CvDEPTH(cv)) 413 if (CvDEPTH (cv))
371 { 414 {
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); 415 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)); 416 PUSHs ((SV *)CvPADLIST (cv));
417 PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
387 PUSHs ((SV *)cv); 418 PUSHs ((SV *)cv);
388 419
389 get_padlist (cv); /* this is a monster */ 420 CvDEPTH (cv) = 0;
421 get_padlist (aTHX_ cv);
390 } 422 }
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 } 423 }
398 } 424 }
399 425
400 if (top_si->si_type == PERLSI_MAIN) 426 if (top_si->si_type == PERLSI_MAIN)
401 break; 427 break;
406 } 432 }
407 433
408 PUTBACK; 434 PUTBACK;
409 } 435 }
410 436
411 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;
412 c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0; 438 c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
413 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;
414 442
415 c->dowarn = PL_dowarn; 443#define VAR(name,type)c->name = PL_ ## name;
416 c->in_eval = PL_in_eval; 444# include "state.h"
417 445#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} 446}
445 447
446/* 448/*
447 * allocate various perl stacks. This is an exact copy 449 * allocate various perl stacks. This is an exact copy
448 * of perl.c:init_stacks, except that it uses less memory 450 * of perl.c:init_stacks, except that it uses less memory
449 * on the assumption that coroutines do not usually need 451 * on the (sometimes correct) assumption that coroutines do
450 * a lot of stackspace. 452 * not usually need a lot of stackspace.
451 */ 453 */
452STATIC void 454#if CORO_PREFER_PERL_FUNCTIONS
455# define coro_init_stacks init_stacks
456#else
457static void
453coro_init_stacks (pTHX) 458coro_init_stacks (pTHX)
454{ 459{
455 PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1); 460 PL_curstackinfo = new_stackinfo(64, 4);
456 PL_curstackinfo->si_type = PERLSI_MAIN; 461 PL_curstackinfo->si_type = PERLSI_MAIN;
457 PL_curstack = PL_curstackinfo->si_stack; 462 PL_curstack = PL_curstackinfo->si_stack;
458 PL_mainstack = PL_curstack; /* remember in case we switch stacks */ 463 PL_mainstack = PL_curstack; /* remember in case we switch stacks */
459 464
460 PL_stack_base = AvARRAY(PL_curstack); 465 PL_stack_base = AvARRAY(PL_curstack);
461 PL_stack_sp = PL_stack_base; 466 PL_stack_sp = PL_stack_base;
462 PL_stack_max = PL_stack_base + AvMAX(PL_curstack); 467 PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
463 468
464 New(50,PL_tmps_stack,96,SV*); 469 New(50,PL_tmps_stack,64,SV*);
465 PL_tmps_floor = -1; 470 PL_tmps_floor = -1;
466 PL_tmps_ix = -1; 471 PL_tmps_ix = -1;
467 PL_tmps_max = 96; 472 PL_tmps_max = 64;
468 473
469 New(54,PL_markstack,16,I32); 474 New(54,PL_markstack,16,I32);
470 PL_markstack_ptr = PL_markstack; 475 PL_markstack_ptr = PL_markstack;
471 PL_markstack_max = PL_markstack + 16; 476 PL_markstack_max = PL_markstack + 16;
472 477
478#ifdef SET_MARK_OFFSET
473 SET_MARK_OFFSET; 479 SET_MARK_OFFSET;
480#endif
474 481
475 New(54,PL_scopestack,16,I32); 482 New(54,PL_scopestack,16,I32);
476 PL_scopestack_ix = 0; 483 PL_scopestack_ix = 0;
477 PL_scopestack_max = 16; 484 PL_scopestack_max = 16;
478 485
479 New(54,PL_savestack,96,ANY); 486 New(54,PL_savestack,32,ANY);
480 PL_savestack_ix = 0; 487 PL_savestack_ix = 0;
481 PL_savestack_max = 96; 488 PL_savestack_max = 32;
482 489
490#if !PERL_VERSION_ATLEAST (5,9,0)
483 New(54,PL_retstack,8,OP*); 491 New(54,PL_retstack,8,OP*);
484 PL_retstack_ix = 0; 492 PL_retstack_ix = 0;
485 PL_retstack_max = 8; 493 PL_retstack_max = 8;
494#endif
486} 495}
496#endif
487 497
488/* 498/*
489 * destroy the stacks, the callchain etc... 499 * destroy the stacks, the callchain etc...
490 * still there is a memleak of 128 bytes...
491 */ 500 */
492STATIC void 501static void
493destroy_stacks(pTHX) 502coro_destroy_stacks (pTHX)
494{ 503{
495 if (!IN_DESTRUCT) 504 if (!IN_DESTRUCT)
496 { 505 {
497 /* is this ugly, I ask? */ 506 /* restore all saved variables and stuff */
498 while (PL_scopestack_ix) 507 LEAVE_SCOPE (0);
499 LEAVE; 508 assert (PL_tmps_floor == -1);
500 509
501 /* sure it is, but more important: is it correct?? :/ */ 510 /* free all temporaries */
502 while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
503 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);
504 } 519 }
505 520
506 while (PL_curstackinfo->si_next) 521 while (PL_curstackinfo->si_next)
507 PL_curstackinfo = PL_curstackinfo->si_next; 522 PL_curstackinfo = PL_curstackinfo->si_next;
508 523
509 while (PL_curstackinfo) 524 while (PL_curstackinfo)
510 { 525 {
511 PERL_SI *p = PL_curstackinfo->si_prev; 526 PERL_SI *p = PL_curstackinfo->si_prev;
512 527
513 {
514 dSP;
515 SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
516 PUTBACK; /* possibly superfluous */
517 }
518
519 if (!IN_DESTRUCT) 528 if (!IN_DESTRUCT)
520 {
521 dounwind(-1);
522 SvREFCNT_dec(PL_curstackinfo->si_stack); 529 SvREFCNT_dec (PL_curstackinfo->si_stack);
523 }
524 530
525 Safefree(PL_curstackinfo->si_cxstack); 531 Safefree (PL_curstackinfo->si_cxstack);
526 Safefree(PL_curstackinfo); 532 Safefree (PL_curstackinfo);
527 PL_curstackinfo = p; 533 PL_curstackinfo = p;
528 } 534 }
529 535
530 Safefree(PL_tmps_stack); 536 Safefree (PL_tmps_stack);
531 Safefree(PL_markstack); 537 Safefree (PL_markstack);
532 Safefree(PL_scopestack); 538 Safefree (PL_scopestack);
533 Safefree(PL_savestack); 539 Safefree (PL_savestack);
540#if !PERL_VERSION_ATLEAST (5,9,0)
534 Safefree(PL_retstack); 541 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 542#endif
543}
544
545static size_t
546coro_rss (struct coro *coro)
547{
548 size_t rss = sizeof (coro);
549
550 if (coro->mainstack)
551 {
552 if (coro->flags & CF_RUNNING)
554 { 553 {
555 /*FIXME*//*D*//* reasonable stack size! */ 554 #define VAR(name,type)coro->name = PL_ ## name;
556 stack->ssize = -4096 * sizeof (long); 555 # include "state.h"
557 New (0, stack->sptr, 4096, long); 556 #undef VAR
558 } 557 }
559 }
560 else
561 stack->sptr = 0;
562 558
563 ctx->stack = stack; 559 rss += sizeof (coro->curstackinfo);
564} 560 rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstackinfo->si_stack)) * sizeof (SV *);
561 rss += (coro->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT);
562 rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstack)) * sizeof (SV *);
563 rss += coro->tmps_max * sizeof (SV *);
564 rss += (coro->markstack_max - coro->markstack_ptr) * sizeof (I32);
565 rss += coro->scopestack_max * sizeof (I32);
566 rss += coro->savestack_max * sizeof (ANY);
565 567
566static void 568#if !PERL_VERSION_ATLEAST (5,9,0)
567deallocate_stack (Coro__State ctx) 569 rss += coro->retstack_max * sizeof (OP *);
568{ 570#endif
569 coro_stack *stack = ctx->stack;
570
571 ctx->stack = 0;
572
573 if (stack)
574 { 571 }
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 572
573 return rss;
574}
575
576/** coroutine stack handling ************************************************/
577
591static void 578static void
592setup_coro (void *arg) 579setup_coro (pTHX_ struct coro *coro)
593{ 580{
594 /* 581 /*
595 * emulate part of the perl startup here. 582 * emulate part of the perl startup here.
596 */ 583 */
584 coro_init_stacks (aTHX);
585
586 PL_curcop = &PL_compiling;
587 PL_in_eval = EVAL_NULL;
588 PL_comppad = 0;
589 PL_curpm = 0;
590 PL_localizing = 0;
591 PL_dirty = 0;
592 PL_restartop = 0;
593
594 {
595 dSP;
596 LOGOP myop;
597
598 SvREFCNT_dec (GvAV (PL_defgv));
599 GvAV (PL_defgv) = coro->args; coro->args = 0;
600
601 Zero (&myop, 1, LOGOP);
602 myop.op_next = Nullop;
603 myop.op_flags = OPf_WANT_VOID;
604
605 PUSHMARK (SP);
606 XPUSHs (av_shift (GvAV (PL_defgv)));
607 PUTBACK;
608 PL_op = (OP *)&myop;
609 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
610 SPAGAIN;
611 }
612
613 ENTER; /* necessary e.g. for dounwind */
614}
615
616static void
617free_coro_mortal (pTHX)
618{
619 if (coro_mortal)
620 {
621 SvREFCNT_dec (coro_mortal);
622 coro_mortal = 0;
623 }
624}
625
626/* inject a fake call to Coro::State::_cctx_init into the execution */
627/* _cctx_init should be careful, as it could be called at almost any time */
628/* during execution of a perl program */
629static void NOINLINE
630prepare_cctx (pTHX_ coro_cctx *cctx)
631{
597 dSP; 632 dSP;
598 Coro__State ctx = (Coro__State)arg; 633 LOGOP myop;
599 SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
600 634
601 coro_init_stacks (aTHX); 635 Zero (&myop, 1, LOGOP);
602 /*PL_curcop = 0;*/ 636 myop.op_next = PL_op;
603 /*PL_in_eval = PL_in_eval;*/ /* inherit */ 637 myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
604 SvREFCNT_dec (GvAV (PL_defgv));
605 GvAV (PL_defgv) = ctx->args;
606 638
639 PUSHMARK (SP);
640 EXTEND (SP, 2);
641 PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
642 PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
643 PUTBACK;
644 PL_op = (OP *)&myop;
645 PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
607 SPAGAIN; 646 SPAGAIN;
647}
608 648
609 if (ctx->stack) 649/*
610 { 650 * this is a _very_ stripped down perl interpreter ;)
611 ctx->cursp = 0; 651 */
652static void
653coro_run (void *arg)
654{
655 dTHX;
612 656
613 PUSHMARK(SP); 657 /* coro_run is the alternative tail of transfer(), so unlock here. */
614 PUTBACK; 658 UNLOCK;
615 (void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
616 659
617 if (SvTRUE (ERRSV)) 660 PL_top_env = &PL_start_env;
618 croak (NULL); 661
619 else 662 /* inject a fake subroutine call to cctx_init */
620 croak ("FATAL: CCTXT coroutine returned!"); 663 prepare_cctx (aTHX_ (coro_cctx *)arg);
664
665 /* somebody or something will hit me for both perl_run and PL_restartop */
666 PL_restartop = PL_op;
667 perl_run (PL_curinterp);
668
669 /*
670 * If perl-run returns we assume exit() was being called or the coro
671 * fell off the end, which seems to be the only valid (non-bug)
672 * reason for perl_run to return. We try to exit by jumping to the
673 * bootstrap-time "top" top_env, as we cannot restore the "main"
674 * coroutine as Coro has no such concept
675 */
676 PL_top_env = main_top_env;
677 JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */
678}
679
680static coro_cctx *
681cctx_new ()
682{
683 coro_cctx *cctx;
684 void *stack_start;
685 size_t stack_size;
686
687 ++cctx_count;
688
689 Newz (0, cctx, 1, coro_cctx);
690
691#if HAVE_MMAP
692
693 cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
694 /* mmap supposedly does allocate-on-write for us */
695 cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
696
697 if (cctx->sptr != (void *)-1)
698 {
699# if CORO_STACKGUARD
700 mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
701# endif
702 stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
703 stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
704 cctx->mapped = 1;
621 } 705 }
622 else 706 else
623 { 707#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 = PL_ppaddr[OP_ENTERSUB]();
643 SPAGAIN;
644
645 ENTER; /* necessary e.g. for dounwind */
646 } 708 {
647} 709 cctx->ssize = coro_stacksize * (long)sizeof (long);
710 New (0, cctx->sptr, coro_stacksize, long);
648 711
649static void 712 if (!cctx->sptr)
650continue_coro (void *arg) 713 {
651{ 714 perror ("FATAL: unable to allocate stack for coroutine");
652 /* 715 _exit (EXIT_FAILURE);
653 * this is a _very_ stripped down perl interpreter ;) 716 }
654 */
655 Coro__State ctx = (Coro__State)arg;
656 JMPENV coro_start_env;
657 717
658 /* same as JMPENV_BOOTSTRAP */ 718 stack_start = cctx->sptr;
659 Zero(&coro_start_env, 1, JMPENV); 719 stack_size = cctx->ssize;
660 coro_start_env.je_ret = -1; 720 }
661 coro_start_env.je_mustcatch = TRUE;
662 PL_top_env = &coro_start_env;
663 721
664 ctx->cursp = 0; 722 REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
723 coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size);
724
725 return cctx;
726}
727
728static void
729cctx_destroy (coro_cctx *cctx)
730{
731 if (!cctx)
732 return;
733
734 --cctx_count;
735
736#if CORO_USE_VALGRIND
737 VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
738#endif
739
740#if HAVE_MMAP
741 if (cctx->mapped)
742 munmap (cctx->sptr, cctx->ssize);
743 else
744#endif
745 Safefree (cctx->sptr);
746
747 Safefree (cctx);
748}
749
750static coro_cctx *
751cctx_get (pTHX)
752{
753 while (cctx_first)
754 {
755 coro_cctx *cctx = cctx_first;
756 cctx_first = cctx->next;
757 --cctx_idle;
758
759 if (cctx->ssize >= coro_stacksize)
760 return cctx;
761
762 cctx_destroy (cctx);
763 }
764
665 PL_op = PL_op->op_next; 765 PL_op = PL_op->op_next;
666 CALLRUNOPS(aTHX); 766 return cctx_new ();
667
668 abort ();
669} 767}
670 768
671STATIC void 769static void
770cctx_put (coro_cctx *cctx)
771{
772 /* free another cctx if overlimit */
773 if (cctx_idle >= MAX_IDLE_CCTX)
774 {
775 coro_cctx *first = cctx_first;
776 cctx_first = first->next;
777 --cctx_idle;
778
779 assert (!first->inuse);
780 cctx_destroy (first);
781 }
782
783 ++cctx_idle;
784 cctx->next = cctx_first;
785 cctx_first = cctx;
786}
787
788/** coroutine switching *****************************************************/
789
790/* never call directly, always through the coro_state_transfer global variable */
791static void NOINLINE
672transfer(pTHX_ struct coro *prev, struct coro *next, int flags) 792transfer (pTHX_ struct coro *prev, struct coro *next)
673{ 793{
674 dSTACKLEVEL; 794 dSTACKLEVEL;
675 static struct coro *xnext;
676 795
796 /* sometimes transfer is only called to set idle_sp */
797 if (!next)
798 {
799 ((coro_cctx *)prev)->idle_sp = STACKLEVEL;
800 assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
801 }
677 if (prev != next) 802 else if (prev != next)
678 { 803 {
679 xnext = next; 804 coro_cctx *prev__cctx;
680 805
681 if (next->mainstack) 806 if (prev->flags & CF_NEW)
682 { 807 {
683 SAVE (prev, flags); 808 /* create a new empty context */
684 LOAD (next); 809 Newz (0, prev->cctx, 1, coro_cctx);
685 810 prev->cctx->inuse = 1;
686 /* mark this state as in-use */ 811 prev->flags &= ~CF_NEW;
687 next->mainstack = 0; 812 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 } 813 }
717 else if (next->tmps_ix == -2) 814
718 croak ("tried to transfer to running coroutine"); 815 /*TODO: must not croak here */
816 if (!prev->flags & CF_RUNNING)
817 croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
818
819 if (next->flags & CF_RUNNING)
820 croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
821
822 if (next->flags & CF_DESTROYED)
823 croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
824
825 prev->flags &= ~CF_RUNNING;
826 next->flags |= CF_RUNNING;
827
828 LOCK;
829
830 if (next->flags & CF_NEW)
831 {
832 /* need to start coroutine */
833 next->flags &= ~CF_NEW;
834 /* first get rid of the old state */
835 save_perl (aTHX_ prev);
836 /* setup coroutine call */
837 setup_coro (aTHX_ next);
838 /* need a new stack */
839 assert (!next->cctx);
840 }
719 else 841 else
720 { 842 {
721 SAVE (prev, -1); /* first get rid of the old state */ 843 /* coroutine already started */
722 844 save_perl (aTHX_ prev);
723 if (flags & TRANSFER_SAVE_CCTXT) 845 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 } 846 }
750 847
751 /* 848 prev__cctx = prev->cctx;
752 * xnext is now either prev or next, depending on wether 849
753 * we switched the c stack or not. that's why I use a global 850 /* possibly "free" the cctx */
754 * variable, that should become thread-specific at one point. 851 if (prev__cctx->idle_sp == STACKLEVEL)
755 */ 852 {
756 xnext->cursp = stacklevel; 853 /* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
757 } 854 assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
758 855
759 if (coro_mortal) 856 prev->cctx = 0;
857
858 cctx_put (prev__cctx);
859 prev__cctx->inuse = 0;
860 }
861
862 if (!next->cctx)
863 {
864 next->cctx = cctx_get (aTHX);
865 assert (!next->cctx->inuse);
866 next->cctx->inuse = 1;
867 }
868
869 if (prev__cctx != next->cctx)
870 {
871 prev__cctx->top_env = PL_top_env;
872 PL_top_env = next->cctx->top_env;
873 coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
874 }
875
876 free_coro_mortal (aTHX);
877 UNLOCK;
760 { 878 }
761 SvREFCNT_dec (coro_mortal); 879}
762 coro_mortal = 0; 880
881struct transfer_args
882{
883 struct coro *prev, *next;
884};
885
886#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
887
888/** high level stuff ********************************************************/
889
890static int
891coro_state_destroy (pTHX_ struct coro *coro)
892{
893 if (coro->flags & CF_DESTROYED)
894 return 0;
895
896 coro->flags |= CF_DESTROYED;
897
898 if (coro->flags & CF_READY)
763 } 899 {
764} 900 /* reduce nready, as destroying a ready coro effectively unreadies it */
901 /* alternative: look through all ready queues and remove the coro */
902 LOCK;
903 --coro_nready;
904 UNLOCK;
905 }
906 else
907 coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
765 908
766#define SV_CORO(sv,func) \ 909 if (coro->mainstack && coro->mainstack != main_mainstack)
767 do { \ 910 {
768 if (SvROK (sv)) \ 911 struct coro temp;
769 sv = SvRV (sv); \
770 \
771 if (SvTYPE(sv) == SVt_PVHV) \
772 { \
773 HE *he = hv_fetch_ent((HV *)sv, ucoro_state_sv, 0, ucoro_state_hash); \
774 \
775 if (!he) \
776 croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
777 \
778 (sv) = SvRV (HeVAL(he)); \
779 } \
780 \
781 /* must also be changed inside Coro::Cont::yield */ \
782 if (!SvOBJECT(sv) || SvSTASH(sv) != coro_state_stash) \
783 croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
784 \
785 } while(0)
786 912
787#define SvSTATE(sv) (struct coro *)SvIV (sv) 913 assert (!(coro->flags & CF_RUNNING));
788 914
915 Zero (&temp, 1, struct coro);
916 temp.save = CORO_SAVE_ALL;
917
918 if (coro->flags & CF_RUNNING)
919 croak ("FATAL: tried to destroy currently running coroutine");
920
921 save_perl (aTHX_ &temp);
922 load_perl (aTHX_ coro);
923
924 coro_destroy_stacks (aTHX);
925
926 load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */
927
928 coro->mainstack = 0;
929 }
930
931 cctx_destroy (coro->cctx);
932 SvREFCNT_dec (coro->args);
933
934 if (coro->next) coro->next->prev = coro->prev;
935 if (coro->prev) coro->prev->next = coro->next;
936 if (coro == coro_first) coro_first = coro->next;
937
938 return 1;
939}
940
789static void 941static int
942coro_state_free (pTHX_ SV *sv, MAGIC *mg)
943{
944 struct coro *coro = (struct coro *)mg->mg_ptr;
945 mg->mg_ptr = 0;
946
947 coro->hv = 0;
948
949 if (--coro->refcnt < 0)
950 {
951 coro_state_destroy (aTHX_ coro);
952 Safefree (coro);
953 }
954
955 return 0;
956}
957
958static int
959coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
960{
961 struct coro *coro = (struct coro *)mg->mg_ptr;
962
963 ++coro->refcnt;
964
965 return 0;
966}
967
968static MGVTBL coro_state_vtbl = {
969 0, 0, 0, 0,
970 coro_state_free,
971 0,
972#ifdef MGf_DUP
973 coro_state_dup,
974#else
975# define MGf_DUP 0
976#endif
977};
978
979static struct coro *
980SvSTATE_ (pTHX_ SV *coro)
981{
982 HV *stash;
983 MAGIC *mg;
984
985 if (SvROK (coro))
986 coro = SvRV (coro);
987
988 stash = SvSTASH (coro);
989 if (stash != coro_stash && stash != coro_state_stash)
990 {
991 /* very slow, but rare, check */
992 if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
993 croak ("Coro::State object required");
994 }
995
996 mg = CORO_MAGIC (coro);
997 return (struct coro *)mg->mg_ptr;
998}
999
1000#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
1001
1002static void
1003prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv)
1004{
1005 ta->prev = SvSTATE (prev_sv);
1006 ta->next = SvSTATE (next_sv);
1007}
1008
1009static void
790api_transfer(pTHX_ SV *prev, SV *next, int flags) 1010api_transfer (SV *prev_sv, SV *next_sv)
791{ 1011{
792 SV_CORO (prev, "Coro::transfer"); 1012 dTHX;
793 SV_CORO (next, "Coro::transfer"); 1013 struct transfer_args ta;
794 1014
795 transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags); 1015 prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
1016 TRANSFER (ta);
1017}
1018
1019static int
1020api_save (SV *coro_sv, int new_save)
1021{
1022 dTHX;
1023 struct coro *coro = SvSTATE (coro_sv);
1024 int old_save = coro->save;
1025
1026 if (new_save >= 0)
1027 coro->save = new_save;
1028
1029 return old_save;
796} 1030}
797 1031
798/** Coro ********************************************************************/ 1032/** Coro ********************************************************************/
799 1033
800#define PRIO_MAX 3
801#define PRIO_HIGH 1
802#define PRIO_NORMAL 0
803#define PRIO_LOW -1
804#define PRIO_IDLE -3
805#define PRIO_MIN -4
806
807/* for Coro.pm */
808static GV *coro_current, *coro_idle;
809static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
810static int coro_nready;
811
812static void 1034static void
813coro_enq (SV *sv) 1035coro_enq (pTHX_ SV *coro_sv)
814{ 1036{
815 if (SvTYPE (sv) == SVt_PVHV)
816 {
817 SV **xprio = hv_fetch ((HV *)sv, "prio", 4, 0);
818 int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
819
820 prio = prio > PRIO_MAX ? PRIO_MAX
821 : prio < PRIO_MIN ? PRIO_MIN
822 : prio;
823
824 av_push (coro_ready [prio - PRIO_MIN], sv); 1037 av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
825 coro_nready++;
826
827 return;
828 }
829
830 croak ("Coro::ready tried to enqueue something that is not a coroutine");
831} 1038}
832 1039
833static SV * 1040static SV *
834coro_deq (int min_prio) 1041coro_deq (pTHX_ int min_prio)
835{ 1042{
836 int prio = PRIO_MAX - PRIO_MIN; 1043 int prio = PRIO_MAX - PRIO_MIN;
837 1044
838 min_prio -= PRIO_MIN; 1045 min_prio -= PRIO_MIN;
839 if (min_prio < 0) 1046 if (min_prio < 0)
840 min_prio = 0; 1047 min_prio = 0;
841 1048
842 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; ) 1049 for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
843 if (av_len (coro_ready[prio]) >= 0) 1050 if (AvFILLp (coro_ready [prio]) >= 0)
844 {
845 coro_nready--;
846 return av_shift (coro_ready[prio]); 1051 return av_shift (coro_ready [prio]);
847 }
848 1052
849 return 0; 1053 return 0;
850} 1054}
851 1055
852static void 1056static int
853api_ready (SV *coro) 1057api_ready (SV *coro_sv)
854{ 1058{
1059 dTHX;
1060 struct coro *coro;
1061
855 if (SvROK (coro)) 1062 if (SvROK (coro_sv))
856 coro = SvRV (coro); 1063 coro_sv = SvRV (coro_sv);
857 1064
1065 coro = SvSTATE (coro_sv);
1066
1067 if (coro->flags & CF_READY)
1068 return 0;
1069
1070 coro->flags |= CF_READY;
1071
1072 LOCK;
858 coro_enq (SvREFCNT_inc (coro)); 1073 coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
1074 ++coro_nready;
1075 UNLOCK;
1076
1077 return 1;
1078}
1079
1080static int
1081api_is_ready (SV *coro_sv)
1082{
1083 dTHX;
1084 return !!(SvSTATE (coro_sv)->flags & CF_READY);
1085}
1086
1087static void
1088prepare_schedule (pTHX_ struct transfer_args *ta)
1089{
1090 SV *prev_sv, *next_sv;
1091
1092 for (;;)
1093 {
1094 LOCK;
1095 next_sv = coro_deq (aTHX_ PRIO_MIN);
1096
1097 /* nothing to schedule: call the idle handler */
1098 if (!next_sv)
1099 {
1100 dSP;
1101 UNLOCK;
1102
1103 ENTER;
1104 SAVETMPS;
1105
1106 PUSHMARK (SP);
1107 PUTBACK;
1108 call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1109
1110 FREETMPS;
1111 LEAVE;
1112 continue;
1113 }
1114
1115 ta->next = SvSTATE (next_sv);
1116
1117 /* cannot transfer to destroyed coros, skip and look for next */
1118 if (ta->next->flags & CF_DESTROYED)
1119 {
1120 UNLOCK;
1121 SvREFCNT_dec (next_sv);
1122 /* coro_nready is already taken care of by destroy */
1123 continue;
1124 }
1125
1126 --coro_nready;
1127 UNLOCK;
1128 break;
1129 }
1130
1131 /* free this only after the transfer */
1132 prev_sv = SvRV (coro_current);
1133 SvRV_set (coro_current, next_sv);
1134 ta->prev = SvSTATE (prev_sv);
1135
1136 assert (ta->next->flags & CF_READY);
1137 ta->next->flags &= ~CF_READY;
1138
1139 LOCK;
1140 free_coro_mortal (aTHX);
1141 coro_mortal = prev_sv;
1142 UNLOCK;
1143}
1144
1145static void
1146prepare_cede (pTHX_ struct transfer_args *ta)
1147{
1148 api_ready (coro_current);
1149 prepare_schedule (aTHX_ ta);
1150}
1151
1152static int
1153prepare_cede_notself (pTHX_ struct transfer_args *ta)
1154{
1155 if (coro_nready)
1156 {
1157 SV *prev = SvRV (coro_current);
1158 prepare_schedule (aTHX_ ta);
1159 api_ready (prev);
1160 return 1;
1161 }
1162 else
1163 return 0;
859} 1164}
860 1165
861static void 1166static void
862api_schedule (void) 1167api_schedule (void)
863{ 1168{
864 SV *prev, *next; 1169 dTHX;
1170 struct transfer_args ta;
865 1171
866 prev = SvRV (GvSV (coro_current)); 1172 prepare_schedule (aTHX_ &ta);
867 next = coro_deq (PRIO_MIN); 1173 TRANSFER (ta);
868
869 if (!next)
870 next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
871
872 /* free this only after the transfer */
873 coro_mortal = prev;
874 SV_CORO (prev, "Coro::schedule");
875
876 SvRV (GvSV (coro_current)) = next;
877
878 SV_CORO (next, "Coro::schedule");
879
880 transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
881 TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);
882} 1174}
883 1175
884static void 1176static int
885api_cede (void) 1177api_cede (void)
886{ 1178{
887 coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current)))); 1179 dTHX;
1180 struct transfer_args ta;
888 1181
889 api_schedule (); 1182 prepare_cede (aTHX_ &ta);
1183
1184 if (ta.prev != ta.next)
1185 {
1186 TRANSFER (ta);
1187 return 1;
1188 }
1189 else
1190 return 0;
1191}
1192
1193static int
1194api_cede_notself (void)
1195{
1196 dTHX;
1197 struct transfer_args ta;
1198
1199 if (prepare_cede_notself (aTHX_ &ta))
1200 {
1201 TRANSFER (ta);
1202 return 1;
1203 }
1204 else
1205 return 0;
890} 1206}
891 1207
892MODULE = Coro::State PACKAGE = Coro::State 1208MODULE = Coro::State PACKAGE = Coro::State
893 1209
894PROTOTYPES: ENABLE 1210PROTOTYPES: DISABLE
895 1211
896BOOT: 1212BOOT:
897{ /* {} necessary for stoopid perl-5.6.x */ 1213{
898 ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1); 1214#ifdef USE_ITHREADS
899 PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1); 1215 MUTEX_INIT (&coro_mutex);
1216#endif
1217 BOOT_PAGESIZE;
1218
900 coro_state_stash = gv_stashpv ("Coro::State", TRUE); 1219 coro_state_stash = gv_stashpv ("Coro::State", TRUE);
901 1220
902 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV)); 1221 newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
903 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV)); 1222 newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
904 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV)); 1223 newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
1224 newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
1225 newCONSTSUB (coro_state_stash, "SAVE_DEFFH", newSViv (CORO_SAVE_DEFFH));
905 newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT)); 1226 newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF));
906 1227 newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
907 if (!padlist_cache)
908 padlist_cache = newHV ();
909 1228
910 main_mainstack = PL_mainstack; 1229 main_mainstack = PL_mainstack;
1230 main_top_env = PL_top_env;
1231
1232 while (main_top_env->je_prev)
1233 main_top_env = main_top_env->je_prev;
911 1234
912 coroapi.ver = CORO_API_VERSION; 1235 coroapi.ver = CORO_API_VERSION;
913 coroapi.transfer = api_transfer; 1236 coroapi.transfer = api_transfer;
914}
915 1237
916Coro::State 1238 assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
917_newprocess(args) 1239}
918 SV * args 1240
919 PROTOTYPE: $ 1241SV *
1242new (char *klass, ...)
920 CODE: 1243 CODE:
921 Coro__State coro; 1244{
1245 struct coro *coro;
1246 HV *hv;
1247 int i;
922 1248
923 if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
924 croak ("Coro::State::_newprocess expects an arrayref");
925
926 New (0, coro, 1, struct coro); 1249 Newz (0, coro, 1, struct coro);
1250 coro->args = newAV ();
1251 coro->save = CORO_SAVE_DEF;
1252 coro->flags = CF_NEW;
927 1253
928 coro->args = (AV *)SvREFCNT_inc (SvRV (args)); 1254 if (coro_first) coro_first->prev = coro;
929 coro->mainstack = 0; /* actual work is done inside transfer */ 1255 coro->next = coro_first;
930 coro->stack = 0; 1256 coro_first = coro;
931 1257
932 RETVAL = coro; 1258 coro->hv = hv = newHV ();
1259 sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
1260 RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
1261
1262 for (i = 1; i < items; i++)
1263 av_push (coro->args, newSVsv (ST (i)));
1264}
933 OUTPUT: 1265 OUTPUT:
934 RETVAL 1266 RETVAL
935 1267
1268int
1269save (SV *coro, int new_save = -1)
1270 CODE:
1271 RETVAL = api_save (coro, new_save);
1272 OUTPUT:
1273 RETVAL
1274
1275int
1276save_also (SV *coro_sv, int save_also)
1277 CODE:
1278{
1279 struct coro *coro = SvSTATE (coro_sv);
1280 RETVAL = coro->save;
1281 coro->save |= save_also;
1282}
1283 OUTPUT:
1284 RETVAL
1285
936void 1286void
937transfer(prev, next, flags) 1287_set_stacklevel (...)
938 SV *prev 1288 ALIAS:
939 SV *next 1289 Coro::State::transfer = 1
940 int flags 1290 Coro::schedule = 2
941 PROTOTYPE: @ 1291 Coro::cede = 3
1292 Coro::cede_notself = 4
942 CODE: 1293 CODE:
943 PUTBACK; 1294{
944 SV_CORO (next, "Coro::transfer"); 1295 struct transfer_args ta;
945 SV_CORO (prev, "Coro::transfer"); 1296
946 transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags); 1297 switch (ix)
947 SPAGAIN; 1298 {
1299 case 0:
1300 ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
1301 ta.next = 0;
1302 break;
1303
1304 case 1:
1305 if (items != 2)
1306 croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
1307
1308 prepare_transfer (aTHX_ &ta, ST (0), ST (1));
1309 break;
1310
1311 case 2:
1312 prepare_schedule (aTHX_ &ta);
1313 break;
1314
1315 case 3:
1316 prepare_cede (aTHX_ &ta);
1317 break;
1318
1319 case 4:
1320 if (!prepare_cede_notself (aTHX_ &ta))
1321 XSRETURN_EMPTY;
1322
1323 break;
1324 }
1325
1326 BARRIER;
1327 TRANSFER (ta);
1328
1329 if (GIMME_V != G_VOID && ta.next != ta.prev)
1330 XSRETURN_YES;
1331}
1332
1333bool
1334_destroy (SV *coro_sv)
1335 CODE:
1336 RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
1337 OUTPUT:
1338 RETVAL
948 1339
949void 1340void
950DESTROY(coro)
951 Coro::State coro
952 CODE:
953
954 if (coro->mainstack && coro->mainstack != main_mainstack)
955 {
956 struct coro temp;
957
958 PUTBACK;
959 SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
960 LOAD(aTHX_ coro);
961 SPAGAIN;
962
963 destroy_stacks (aTHX);
964
965 LOAD((&temp)); /* this will get rid of defsv etc.. */
966 SPAGAIN;
967
968 coro->mainstack = 0;
969 }
970
971 deallocate_stack (coro);
972
973 Safefree (coro);
974
975void
976flush()
977 CODE:
978#ifdef MAY_FLUSH
979 flush_padlist_cache ();
980#endif
981
982void
983_exit(code) 1341_exit (code)
984 int code 1342 int code
985 PROTOTYPE: $ 1343 PROTOTYPE: $
986 CODE: 1344 CODE:
987#if defined(__GLIBC__) || _POSIX_C_SOURCE
988 _exit (code); 1345 _exit (code);
989#else
990 signal (SIGTERM, SIG_DFL);
991 raise (SIGTERM);
992 exit (code);
993#endif
994 1346
995MODULE = Coro::State PACKAGE = Coro::Cont 1347int
1348cctx_stacksize (int new_stacksize = 0)
1349 CODE:
1350 RETVAL = coro_stacksize;
1351 if (new_stacksize)
1352 coro_stacksize = new_stacksize;
1353 OUTPUT:
1354 RETVAL
996 1355
997# this is slightly dirty (should expose a c-level api) 1356int
1357cctx_count ()
1358 CODE:
1359 RETVAL = cctx_count;
1360 OUTPUT:
1361 RETVAL
1362
1363int
1364cctx_idle ()
1365 CODE:
1366 RETVAL = cctx_idle;
1367 OUTPUT:
1368 RETVAL
998 1369
999void 1370void
1000yield(...) 1371list ()
1001 PROTOTYPE: @ 1372 PPCODE:
1373{
1374 struct coro *coro;
1375 for (coro = coro_first; coro; coro = coro->next)
1376 if (coro->hv)
1377 XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv)));
1378}
1379
1380void
1381_eval (Coro::State coro, SV *coderef)
1382 CODE:
1383{
1384 if (coro->mainstack)
1385 {
1386 struct coro temp;
1387 Zero (&temp, 1, struct coro);
1388 temp.save = CORO_SAVE_ALL;
1389
1390 if (!(coro->flags & CF_RUNNING))
1391 {
1392 save_perl (aTHX_ &temp);
1393 load_perl (aTHX_ coro);
1394 }
1395
1396 {
1397 dSP;
1398 ENTER;
1399 SAVETMPS;
1400 PUSHMARK (SP);
1401 PUTBACK;
1402 call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
1403 SPAGAIN;
1404 FREETMPS;
1405 LEAVE;
1406 PUTBACK;
1407 }
1408
1409 if (!(coro->flags & CF_RUNNING))
1410 {
1411 save_perl (aTHX_ coro);
1412 load_perl (aTHX_ &temp);
1413 }
1414 }
1415}
1416
1417SV *
1418is_ready (Coro::State coro)
1419 PROTOTYPE: $
1420 ALIAS:
1421 is_ready = CF_READY
1422 is_running = CF_RUNNING
1423 is_new = CF_NEW
1424 is_destroyed = CF_DESTROYED
1425 CODE:
1426 RETVAL = boolSV (coro->flags & ix);
1427 OUTPUT:
1428 RETVAL
1429
1430IV
1431rss (Coro::State coro)
1432 PROTOTYPE: $
1002 CODE: 1433 CODE:
1003 static SV *returnstk; 1434 RETVAL = coro_rss (coro);
1004 SV *sv; 1435 OUTPUT:
1005 AV *defav = GvAV (PL_defgv); 1436 RETVAL
1006 struct coro *prev, *next;
1007 1437
1008 if (!returnstk)
1009 returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
1010
1011 /* set up @_ -- ugly */
1012 av_clear (defav);
1013 av_fill (defav, items - 1);
1014 while (items--)
1015 av_store (defav, items, SvREFCNT_inc (ST(items)));
1016
1017 mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1018 sv = av_pop ((AV *)SvRV (returnstk));
1019 prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1020 next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1021 SvREFCNT_dec (sv);
1022
1023 transfer(aTHX_ prev, next, 0);
1024 1438
1025MODULE = Coro::State PACKAGE = Coro 1439MODULE = Coro::State PACKAGE = Coro
1026 1440
1027# this is slightly dirty (should expose a c-level api)
1028
1029BOOT: 1441BOOT:
1030{ 1442{
1031 int i; 1443 int i;
1444
1032 HV *stash = gv_stashpv ("Coro", TRUE); 1445 coro_stash = gv_stashpv ("Coro", TRUE);
1033 1446
1034 newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX)); 1447 newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1035 newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH)); 1448 newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1036 newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL)); 1449 newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1037 newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW)); 1450 newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1038 newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE)); 1451 newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1039 newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN)); 1452 newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1040 1453
1041 coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV); 1454 coro_current = get_sv ("Coro::current", FALSE);
1042 coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV); 1455 SvREADONLY_on (coro_current);
1043 1456
1044 for (i = PRIO_MAX - PRIO_MIN + 1; i--; ) 1457 for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1045 coro_ready[i] = newAV (); 1458 coro_ready[i] = newAV ();
1046 1459
1047 { 1460 {
1048 SV *sv = perl_get_sv("Coro::API", 1); 1461 SV *sv = perl_get_sv("Coro::API", 1);
1049 1462
1050 coroapi.schedule = api_schedule; 1463 coroapi.schedule = api_schedule;
1464 coroapi.save = api_save;
1051 coroapi.cede = api_cede; 1465 coroapi.cede = api_cede;
1466 coroapi.cede_notself = api_cede_notself;
1052 coroapi.ready = api_ready; 1467 coroapi.ready = api_ready;
1468 coroapi.is_ready = api_is_ready;
1053 coroapi.nready = &coro_nready; 1469 coroapi.nready = &coro_nready;
1054 coroapi.current = coro_current; 1470 coroapi.current = coro_current;
1055 1471
1056 GCoroAPI = &coroapi; 1472 GCoroAPI = &coroapi;
1057 sv_setiv(sv, (IV)&coroapi); 1473 sv_setiv (sv, (IV)&coroapi);
1058 SvREADONLY_on(sv); 1474 SvREADONLY_on (sv);
1059 } 1475 }
1060} 1476}
1061 1477
1062void 1478void
1063ready(self) 1479_set_current (SV *current)
1064 SV * self
1065 PROTOTYPE: $ 1480 PROTOTYPE: $
1066 CODE: 1481 CODE:
1067 api_ready (self); 1482 SvREFCNT_dec (SvRV (coro_current));
1483 SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1068 1484
1069int 1485int
1486prio (Coro::State coro, int newprio = 0)
1487 ALIAS:
1488 nice = 1
1489 CODE:
1490{
1491 RETVAL = coro->prio;
1492
1493 if (items > 1)
1494 {
1495 if (ix)
1496 newprio = coro->prio - newprio;
1497
1498 if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1499 if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1500
1501 coro->prio = newprio;
1502 }
1503}
1504 OUTPUT:
1505 RETVAL
1506
1507SV *
1508ready (SV *self)
1509 PROTOTYPE: $
1510 CODE:
1511 RETVAL = boolSV (api_ready (self));
1512 OUTPUT:
1513 RETVAL
1514
1515int
1070nready(...) 1516nready (...)
1071 PROTOTYPE: 1517 PROTOTYPE:
1072 CODE: 1518 CODE:
1073 RETVAL = coro_nready; 1519 RETVAL = coro_nready;
1074 OUTPUT: 1520 OUTPUT:
1075 RETVAL 1521 RETVAL
1076 1522
1523MODULE = Coro::State PACKAGE = Coro::AIO
1524
1525SV *
1526_get_state ()
1527 CODE:
1528{
1529 struct io_state *data;
1530
1531 RETVAL = newSV (sizeof (struct io_state));
1532 data = (struct io_state *)SvPVX (RETVAL);
1533 SvCUR_set (RETVAL, sizeof (struct io_state));
1534 SvPOK_only (RETVAL);
1535
1536 data->errorno = errno;
1537 data->laststype = PL_laststype;
1538 data->laststatval = PL_laststatval;
1539 data->statcache = PL_statcache;
1540}
1541 OUTPUT:
1542 RETVAL
1543
1077void 1544void
1078schedule(...) 1545_set_state (char *data_)
1079 PROTOTYPE: 1546 PROTOTYPE: $
1080 CODE: 1547 CODE:
1081 api_schedule (); 1548{
1549 struct io_state *data = (void *)data_;
1082 1550
1083void 1551 errno = data->errorno;
1084cede(...) 1552 PL_laststype = data->laststype;
1085 PROTOTYPE: 1553 PL_laststatval = data->laststatval;
1086 CODE: 1554 PL_statcache = data->statcache;
1087 api_cede (); 1555}
1088 1556

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines