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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines