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

Diff Legend

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