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.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.152 by root, Thu Sep 20 12:02:25 2007 UTC

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

Diff Legend

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