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

Diff Legend

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