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.44 by root, Sat Mar 22 18:50:32 2003 UTC vs.
Revision 1.125 by root, Mon Dec 11 20:54:45 2006 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines