ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.19 by root, Sun Jul 29 01:11:41 2001 UTC vs.
Revision 1.134 by root, Thu Jan 4 23:49:27 2007 UTC

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

Diff Legend

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