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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines