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.11 by root, Sat Jul 21 18:21:45 2001 UTC vs.
Revision 1.147 by root, Mon Mar 19 15:50:48 2007 UTC

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

Diff Legend

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