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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines