ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.14 by root, Mon Jul 23 23:48:05 2001 UTC vs.
Revision 1.135 by root, Fri Jan 5 18:25:51 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>
		16	# ifndef MAP_ANONYMOUS
		17	# ifdef MAP_ANON
		18	# define MAP_ANONYMOUS MAP_ANON
		19	# else
		20	# undef HAVE_MMAP
		21	# endif
10	#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
		30	# endif
		31	#else
		32	# define PAGESIZE 0
		33	# define BOOT_PAGESIZE (void)0
		34	#endif
11		35
12	#define MAY_FLUSH /* increases codesize */	36	#if USE_VALGRIND
		37	# include <valgrind/valgrind.h>
		38	#endif
13		39
14	#define TRANSFER_SAVE_DEFAV 0x00000001	40	/* the maximum number of idle cctx that will be pooled */
15	#define TRANSFER_SAVE_DEFSV 0x00000002	41	#define MAX_IDLE_CCTX 8
16	#define TRANSFER_SAVE_ERRSV 0x00000004
17	#define TRANSFER_SAVE_CCTXT 0x00000008
18		42
19	#define TRANSFER_SAVE_ALL -1	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)))))
20		48
21	#define SUB_INIT "Coro::State::initialize"	49	#if !PERL_VERSION_ATLEAST (5,6,0)
22	#define UCORO_STATE "_coro_state"	50	# ifndef PL_ppaddr
		51	# define PL_ppaddr ppaddr
		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
23		69
		70	/* 5.8.7 */
		71	#ifndef SvRV_set
		72	# define SvRV_set(s,v) SvRV(s) = (v)
		73	#endif
		74
		75	#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
		76	# undef STACKGUARD
		77	#endif
		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
		88	/* The next macro should declare a variable stacklevel that contains and approximation
		89	* to the current C stack pointer. Its property is that it changes with each call
		90	* and should be unique. */
		91	#define dSTACKLEVEL int stacklevel
		92	#define STACKLEVEL ((void *)&stacklevel)
		93
		94	#define IN_DESTRUCT (PL_main_cv == Nullcv)
		95
		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 */
		134	typedef struct coro_cctx {
		135	struct coro_cctx *next;
		136
		137	/* the stack */
		138	void *sptr;
		139	long ssize; /* positive == mmap, otherwise malloc */
		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 */
24	struct coro {	162	struct coro {
25	/* the optional C context */	163	/* the c coroutine allocated to this perl coroutine, if any */
26	coro_context cctx;	164	coro_cctx *cctx;
27	void *sptr;
28	long ssize;
29
30	/* optionally saved, might be zero */
31	AV *defav;
32	SV *defsv;
33	SV *errsv;
34
35	/* saved global state not related to stacks */
36	U8 dowarn;
37
38	/* the stacks and related info (callchain etc..) */
39	PERL_SI *curstackinfo;
40	AV *curstack;
41	AV *mainstack;
42	SV **stack_sp;
43	OP *op;
44	SV **curpad;
45	SV **stack_base;
46	SV **stack_max;
47	SV **tmps_stack;
48	I32 tmps_floor;
49	I32 tmps_ix;
50	I32 tmps_max;
51	I32 *markstack;
52	I32 *markstack_ptr;
53	I32 *markstack_max;
54	I32 *scopestack;
55	I32 scopestack_ix;
56	I32 scopestack_max;
57	ANY *savestack;
58	I32 savestack_ix;
59	I32 savestack_max;
60	OP **retstack;
61	I32 retstack_ix;
62	I32 retstack_max;
63	COP *curcop;
64	JMPENV start_env;
65	JMPENV *top_env;
66		165
67	/* data associated with this coroutine (initial args) */	166	/* data associated with this coroutine (initial args) */
68	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;
69	};	185	};
70		186
71	typedef struct coro *Coro__State;	187	typedef struct coro *Coro__State;
72	typedef struct coro *Coro__State_or_hashref;	188	typedef struct coro *Coro__State_or_hashref;
73		189
74	static AV *main_mainstack; /* used to differentiate between $main and others */	190	static AV *
75	static HV *coro_state_stash;	191	coro_clone_padlist (CV *cv)
76	static SV *ucoro_state_sv;
77	static U32 ucoro_state_hash;
78	static HV *padlist_cache;
79
80	/* mostly copied from op.c:cv_clone2 */
81	STATIC AV *
82	clone_padlist (AV *protopadlist)
83	{	192	{
84	AV *av;	193	AV *padlist = CvPADLIST (cv);
85	I32 ix;
86	AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
87	AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
88	SV **pname = AvARRAY (protopad_name);
89	SV **ppad = AvARRAY (protopad);
90	I32 fname = AvFILLp (protopad_name);
91	I32 fpad = AvFILLp (protopad);
92	AV *newpadlist, *newpad_name, *newpad;	194	AV *newpadlist, *newpad;
93	SV **npad;
94
95	newpad_name = newAV ();
96	for (ix = fname; ix >= 0; ix--)
97	av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
98
99	newpad = newAV ();
100	av_fill (newpad, AvFILLp (protopad));
101	npad = AvARRAY (newpad);
102		195
103	newpadlist = newAV ();	196	newpadlist = newAV ();
104	AvREAL_off (newpadlist);	197	AvREAL_off (newpadlist);
105	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)));
106	av_store (newpadlist, 1, (SV *) newpad);	207	av_store (newpadlist, 1, (SV *)newpad);
107		208
108	av = newAV (); /* will be @_ */	209	return newpadlist;
109	av_extend (av, 0);	210	}
110	av_store (newpad, 0, (SV *) av);
111	AvFLAGS (av) = AVf_REIFY;
112		211
113	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))
114	{	217	{
115	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;	218	I32 i = AvFILLp (padlist);
116	if (namesv && namesv != &PL_sv_undef)	219	while (i >= 0)
117	{	220	{
118	char *name = SvPVX (namesv); /* XXX */	221	SV **svp = av_fetch (padlist, i--, FALSE);
119	if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')	222	if (svp)
120	{ /* lexical from outside? */
121	npad[ix] = SvREFCNT_inc (ppad[ix]);
122	}	223	{
123	else
124	{ /* our own lexical */
125	SV *sv;	224	SV *sv;
126	if (*name == '&')	225	while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
127	sv = SvREFCNT_inc (ppad[ix]);	226	SvREFCNT_dec (sv);
128	else if (*name == '@')	227
129	sv = (SV *) newAV ();	228	SvREFCNT_dec (*svp);
130	else if (*name == '%')
131	sv = (SV *) newHV ();
132	else
133	sv = NEWSV (0, 0);
134	if (!SvPADBUSY (sv))
135	SvPADMY_on (sv);
136	npad[ix] = sv;
137	}	229	}
138	}	230	}
139	else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
140	{
141	npad[ix] = SvREFCNT_inc (ppad[ix]);
142	}
143	else
144	{
145	SV *sv = NEWSV (0, 0);
146	SvPADTMP_on (sv);
147	npad[ix] = sv;
148	}
149	}
150		231
151	#if 0 /* return -ENOTUNDERSTOOD */
152	/* Now that vars are all in place, clone nested closures. */
153
154	for (ix = fpad; ix > 0; ix--) {
155	SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
156	if (namesv
157	&& namesv != &PL_sv_undef
158	&& !(SvFLAGS(namesv) & SVf_FAKE)
159	&& *SvPVX(namesv) == '&'
160	&& CvCLONE(ppad[ix]))
161	{
162	CV *kid = cv_clone((CV*)ppad[ix]);
163	SvREFCNT_dec(ppad[ix]);
164	CvCLONE_on(kid);
165	SvPADMY_on(kid);
166	npad[ix] = (SV*)kid;
167	}
168	}
169	#endif
170
171	return newpadlist;
172	}
173
174	#ifdef MAY_FLUSH
175	STATIC AV *
176	free_padlist (AV *padlist)
177	{
178	/* may be during global destruction */
179	if (SvREFCNT(padlist))
180	{
181	I32 i = AvFILLp(padlist);
182	while (i >= 0)
183	{
184	SV **svp = av_fetch(padlist, i--, FALSE);
185	SV *sv = svp ? *svp : Nullsv;
186	if (sv)
187	SvREFCNT_dec(sv);
188	}
189
190	SvREFCNT_dec((SV*)padlist);	232	SvREFCNT_dec ((SV*)padlist);
191	}	233	}
192	}	234	}
193	#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
194		261
195	/* the next two functions merely cache the padlists */	262	/* the next two functions merely cache the padlists */
196	STATIC void	263	static void
197	get_padlist (CV *cv)	264	get_padlist (CV *cv)
198	{	265	{
199	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);	266	MAGIC *mg = CORO_MAGIC (cv);
		267	AV *av;
200		268
201	if (he && AvFILLp ((AV *)*he) >= 0)	269	if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
202	CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);	270	CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
203	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
204	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));	280	CvPADLIST (cv) = coro_clone_padlist (cv);
		281	#endif
		282	}
205	}	283	}
206		284
207	STATIC void	285	static void
208	put_padlist (CV *cv)	286	put_padlist (CV *cv)
209	{	287	{
210	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);	288	MAGIC *mg = CORO_MAGIC (cv);
		289	AV *av;
211		290
212	if (SvTYPE (*he) != SVt_PVAV)	291	if (!mg)
213	{
214	SvREFCNT_dec (*he);
215	*he = (SV *)newAV ();
216	}	292	{
217		293	sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
218	av_push ((AV *)*he, (SV *)CvPADLIST (cv));	294	mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
219	}	295	mg->mg_virtual = &vtbl_coro;
220		296	mg->mg_obj = (SV *)newAV ();
221	#ifdef MAY_FLUSH
222	STATIC void
223	flush_padlist_cache ()
224	{
225	HV *hv = padlist_cache;
226	padlist_cache = newHV ();
227
228	if (hv_iterinit (hv))
229	{	297	}
230	HE *he;
231	AV *padlist;
232		298
233	while (!!(he = hv_iternext (hv)))	299	av = (AV *)mg->mg_obj;
234	{
235	AV *av = (AV *)HeVAL(he);
236		300
237	/* casting is fun. */	301	if (AvFILLp (av) >= AvMAX (av))
238	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))	302	av_extend (av, AvMAX (av) + 1);
239	free_padlist (padlist);
240	}
241	}
242		303
243	SvREFCNT_dec (hv);	304	AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
244	}	305	}
245	#endif
246		306
247	#define SB do {	307	#define SB do {
248	#define SE } while (0)	308	#define SE } while (0)
249		309
250	#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
251	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
252
253	#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
254		311
255	static void	312	static void
256	load_state(pTHX_ Coro__State c)	313	load_perl (Coro__State c)
257	{	314	{
258	PL_dowarn = c->dowarn;	315	#define VAR(name,type) PL_ ## name = c->name;
259		316	# include "state.h"
260	PL_curstackinfo = c->curstackinfo;	317	#undef VAR
261	PL_curstack = c->curstack;
262	PL_mainstack = c->mainstack;
263	PL_stack_sp = c->stack_sp;
264	PL_op = c->op;
265	PL_curpad = c->curpad;
266	PL_stack_base = c->stack_base;
267	PL_stack_max = c->stack_max;
268	PL_tmps_stack = c->tmps_stack;
269	PL_tmps_floor = c->tmps_floor;
270	PL_tmps_ix = c->tmps_ix;
271	PL_tmps_max = c->tmps_max;
272	PL_markstack = c->markstack;
273	PL_markstack_ptr = c->markstack_ptr;
274	PL_markstack_max = c->markstack_max;
275	PL_scopestack = c->scopestack;
276	PL_scopestack_ix = c->scopestack_ix;
277	PL_scopestack_max = c->scopestack_max;
278	PL_savestack = c->savestack;
279	PL_savestack_ix = c->savestack_ix;
280	PL_savestack_max = c->savestack_max;
281	PL_retstack = c->retstack;
282	PL_retstack_ix = c->retstack_ix;
283	PL_retstack_max = c->retstack_max;
284	PL_curcop = c->curcop;
285	PL_start_env = c->start_env;
286	PL_top_env = c->top_env;
287		318
288	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	319	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
289	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	320	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
290	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	}
291		333
292	{	334	{
293	dSP;	335	dSP;
294	CV *cv;	336	CV *cv;
295		337
296	/* now do the ugly restore mess */	338	/* now do the ugly restore mess */
297	while ((cv = (CV *)POPs))	339	while ((cv = (CV *)POPs))
298	{	340	{
299	AV *padlist = (AV *)POPs;
300
301	if (padlist)
302	{
303	put_padlist (cv); /* mark this padlist as available */	341	put_padlist (cv); /* mark this padlist as available */
304	CvPADLIST(cv) = padlist;	342	CvDEPTH (cv) = PTR2IV (POPs);
305	#ifdef USE_THREADS	343	CvPADLIST (cv) = (AV *)POPs;
306	/*CvOWNER(cv) = (struct perl_thread *)POPs;*/
307	#endif
308	}
309
310	++CvDEPTH(cv);
311	}	344	}
312		345
313	PUTBACK;	346	PUTBACK;
314	}	347	}
315	}	348	}
316		349
317	static void	350	static void
318	save_state(pTHX_ Coro__State c, int flags)	351	save_perl (Coro__State c)
319	{	352	{
320	{	353	{
321	dSP;	354	dSP;
322	I32 cxix = cxstack_ix;	355	I32 cxix = cxstack_ix;
323	PERL_CONTEXT *ccstk = cxstack;	356	PERL_CONTEXT *ccstk = cxstack;
…		…
326	/*	359	/*
327	* 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
328	* (and reinitialize) all cv's in the whole callchain :(	361	* (and reinitialize) all cv's in the whole callchain :(
329	*/	362	*/
330		363
		364	EXTEND (SP, 3 + 1);
331	PUSHs (Nullsv);	365	PUSHs (Nullsv);
332	/* this loop was inspired by pp_caller */	366	/* this loop was inspired by pp_caller */
333	for (;;)	367	for (;;)
334	{	368	{
335	do	369	while (cxix >= 0)
336	{	370	{
337	PERL_CONTEXT *cx = &ccstk[cxix--];	371	PERL_CONTEXT *cx = &ccstk[cxix--];
338		372
339	if (CxTYPE(cx) == CXt_SUB)	373	if (CxTYPE (cx) == CXt_SUB)
340	{	374	{
341	CV *cv = cx->blk_sub.cv;	375	CV *cv = cx->blk_sub.cv;
		376
342	if (CvDEPTH(cv))	377	if (CvDEPTH (cv))
343	{	378	{
344	#ifdef USE_THREADS
345	/*XPUSHs ((SV *)CvOWNER(cv));*/
346	/*CvOWNER(cv) = 0;*/
347	/*error must unlock this cv etc.. etc...*/
348	#endif
349	EXTEND (SP, CvDEPTH(cv)*2);	379	EXTEND (SP, 3);
350
351	while (--CvDEPTH(cv))
352	{
353	/* this tells the restore code to increment CvDEPTH */
354	PUSHs (Nullsv);
355	PUSHs ((SV *)cv);
356	}
357
358	PUSHs ((SV *)CvPADLIST(cv));	380	PUSHs ((SV *)CvPADLIST (cv));
		381	PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
359	PUSHs ((SV *)cv);	382	PUSHs ((SV *)cv);
360		383
		384	CvDEPTH (cv) = 0;
361	get_padlist (cv); /* this is a monster */	385	get_padlist (cv);
362	}	386	}
363	}	387	}
364	else if (CxTYPE(cx) == CXt_FORMAT)
365	{
366	/* I never used formats, so how should I know how these are implemented? */
367	/* my bold guess is as a simple, plain sub... */
368	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
369	}
370	}	388	}
371	while (cxix >= 0);
372		389
373	if (top_si->si_type == PERLSI_MAIN)	390	if (top_si->si_type == PERLSI_MAIN)
374	break;	391	break;
375		392
376	top_si = top_si->si_prev;	393	top_si = top_si->si_prev;
…		…
379	}	396	}
380		397
381	PUTBACK;	398	PUTBACK;
382	}	399	}
383		400
384	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;
385	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	402	c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
386	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;
387		405
388	/* I have not the slightest idea of why av_reify is necessary */	406	#define VAR(name,type)c->name = PL_ ## name;
389	/* but if it's missing the defav contents magically get replaced sometimes */	407	# include "state.h"
390	if (c->defav)	408	#undef VAR
391	av_reify (c->defav);
392
393	c->dowarn = PL_dowarn;
394
395	c->curstackinfo = PL_curstackinfo;
396	c->curstack = PL_curstack;
397	c->mainstack = PL_mainstack;
398	c->stack_sp = PL_stack_sp;
399	c->op = PL_op;
400	c->curpad = PL_curpad;
401	c->stack_base = PL_stack_base;
402	c->stack_max = PL_stack_max;
403	c->tmps_stack = PL_tmps_stack;
404	c->tmps_floor = PL_tmps_floor;
405	c->tmps_ix = PL_tmps_ix;
406	c->tmps_max = PL_tmps_max;
407	c->markstack = PL_markstack;
408	c->markstack_ptr = PL_markstack_ptr;
409	c->markstack_max = PL_markstack_max;
410	c->scopestack = PL_scopestack;
411	c->scopestack_ix = PL_scopestack_ix;
412	c->scopestack_max = PL_scopestack_max;
413	c->savestack = PL_savestack;
414	c->savestack_ix = PL_savestack_ix;
415	c->savestack_max = PL_savestack_max;
416	c->retstack = PL_retstack;
417	c->retstack_ix = PL_retstack_ix;
418	c->retstack_max = PL_retstack_max;
419	c->curcop = PL_curcop;
420	c->start_env = PL_start_env;
421	c->top_env = PL_top_env;
422	}	409	}
423		410
424	/*	411	/*
425	* allocate various perl stacks. This is an exact copy	412	* allocate various perl stacks. This is an exact copy
426	* of perl.c:init_stacks, except that it uses less memory	413	* of perl.c:init_stacks, except that it uses less memory
427	* on the assumption that coroutines do not usually need	414	* on the (sometimes correct) assumption that coroutines do
428	* a lot of stackspace.	415	* not usually need a lot of stackspace.
429	*/	416	*/
430	STATIC void	417	#if PREFER_PERL_FUNCTIONS
		418	# define coro_init_stacks init_stacks
		419	#else
		420	static void
431	coro_init_stacks (pTHX)	421	coro_init_stacks ()
432	{	422	{
433	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);	423	PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
434	PL_curstackinfo->si_type = PERLSI_MAIN;	424	PL_curstackinfo->si_type = PERLSI_MAIN;
435	PL_curstack = PL_curstackinfo->si_stack;	425	PL_curstack = PL_curstackinfo->si_stack;
436	PL_mainstack = PL_curstack; /* remember in case we switch stacks */	426	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
437		427
438	PL_stack_base = AvARRAY(PL_curstack);	428	PL_stack_base = AvARRAY(PL_curstack);
439	PL_stack_sp = PL_stack_base;	429	PL_stack_sp = PL_stack_base;
440	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);	430	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
441		431
442	New(50,PL_tmps_stack,64,SV*);	432	New(50,PL_tmps_stack,128,SV*);
443	PL_tmps_floor = -1;	433	PL_tmps_floor = -1;
444	PL_tmps_ix = -1;	434	PL_tmps_ix = -1;
445	PL_tmps_max = 64;	435	PL_tmps_max = 128;
446		436
447	New(54,PL_markstack,12,I32);	437	New(54,PL_markstack,32,I32);
448	PL_markstack_ptr = PL_markstack;	438	PL_markstack_ptr = PL_markstack;
449	PL_markstack_max = PL_markstack + 12;	439	PL_markstack_max = PL_markstack + 32;
450		440
		441	#ifdef SET_MARK_OFFSET
451	SET_MARK_OFFSET;	442	SET_MARK_OFFSET;
		443	#endif
452		444
453	New(54,PL_scopestack,12,I32);	445	New(54,PL_scopestack,32,I32);
454	PL_scopestack_ix = 0;	446	PL_scopestack_ix = 0;
455	PL_scopestack_max = 12;	447	PL_scopestack_max = 32;
456		448
457	New(54,PL_savestack,64,ANY);	449	New(54,PL_savestack,64,ANY);
458	PL_savestack_ix = 0;	450	PL_savestack_ix = 0;
459	PL_savestack_max = 64;	451	PL_savestack_max = 64;
460		452
		453	#if !PERL_VERSION_ATLEAST (5,9,0)
461	New(54,PL_retstack,8,OP*);	454	New(54,PL_retstack,16,OP*);
462	PL_retstack_ix = 0;	455	PL_retstack_ix = 0;
463	PL_retstack_max = 8;	456	PL_retstack_max = 16;
		457	#endif
464	}	458	}
		459	#endif
465		460
466	/*	461	/*
467	* destroy the stacks, the callchain etc...	462	* destroy the stacks, the callchain etc...
468	* still there is a memleak of 128 bytes...
469	*/	463	*/
470	STATIC void	464	static void
471	destroy_stacks(pTHX)	465	coro_destroy_stacks ()
472	{	466	{
473	/* is this ugly, I ask? */	467	if (!IN_DESTRUCT)
474	while (PL_scopestack_ix)	468	{
475	LEAVE;	469	/* restore all saved variables and stuff */
		470	LEAVE_SCOPE (0);
		471	assert (PL_tmps_floor == -1);
476		472
477	/* sure it is, but more important: is it correct?? :/ */	473	/* free all temporaries */
478	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
479	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	}
480		483
481	while (PL_curstackinfo->si_next)	484	while (PL_curstackinfo->si_next)
482	PL_curstackinfo = PL_curstackinfo->si_next;	485	PL_curstackinfo = PL_curstackinfo->si_next;
483		486
484	while (PL_curstackinfo)	487	while (PL_curstackinfo)
485	{	488	{
486	PERL_SI *p = PL_curstackinfo->si_prev;	489	PERL_SI *p = PL_curstackinfo->si_prev;
487		490
488	{	491	if (!IN_DESTRUCT)
489	dSP;
490	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
491	PUTBACK; /* possibly superfluous */
492	}
493
494	dounwind(-1);
495
496	SvREFCNT_dec(PL_curstackinfo->si_stack);	492	SvREFCNT_dec (PL_curstackinfo->si_stack);
		493
497	Safefree(PL_curstackinfo->si_cxstack);	494	Safefree (PL_curstackinfo->si_cxstack);
498	Safefree(PL_curstackinfo);	495	Safefree (PL_curstackinfo);
499	PL_curstackinfo = p;	496	PL_curstackinfo = p;
500	}	497	}
501		498
502	Safefree(PL_tmps_stack);	499	Safefree (PL_tmps_stack);
503	Safefree(PL_markstack);	500	Safefree (PL_markstack);
504	Safefree(PL_scopestack);	501	Safefree (PL_scopestack);
505	Safefree(PL_savestack);	502	Safefree (PL_savestack);
		503	#if !PERL_VERSION_ATLEAST (5,9,0)
506	Safefree(PL_retstack);	504	Safefree (PL_retstack);
507	}
508
509	static void
510	allocate_stack (Coro__State ctx)
511	{
512	#ifdef HAVE_MMAP
513	ctx->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-use */
514	ctx->sptr = mmap (0, ctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
515	if (ctx->sptr == (void *)-1)
516	#endif	505	#endif
517	{
518	/*FIXME*//*D*//* reasonable stack size! */
519	ctx->ssize = 4096 * sizeof (long);
520	New (0, ctx->sptr, 4096, long);
521	}
522	}	506	}
523		507
524	static void	508	static void
525	deallocate_stack (Coro__State ctx)	509	setup_coro (struct coro *coro)
526	{
527	#ifdef HAVE_MMAP
528	munmap (ctx->sptr, ctx->ssize);
529	#else
530	Safefree (ctx->sptr);
531	#endif
532	}
533
534	/* might go away together with optional SAVE_CCTXT */
535	static void
536	setup_coro (void *arg)
537	{	510	{
538	/*	511	/*
539	* emulate part of the perl startup here.	512	* emulate part of the perl startup here.
540	*/	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	{
541	dSP;	560	dSP;
542	Coro__State ctx = (Coro__State)arg;	561	LOGOP myop;
543	SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
544		562
545	coro_init_stacks (aTHX);	563	Zero (&myop, 1, LOGOP);
546	JMPENV_BOOTSTRAP;	564	myop.op_next = PL_op;
		565	myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
		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);
547	SPAGAIN;	574	SPAGAIN;
		575	}
548		576
549	/*PL_curcop = 0;*/	577	static void
550	SvREFCNT_dec (GvAV (PL_defgv));	578	coro_run (void *arg)
551	GvAV (PL_defgv) = ctx->args;	579	{
		580	/* coro_run is the alternative tail of transfer(), so unlock here. */
		581	UNLOCK;
552		582
		583	/*
		584	* this is a _very_ stripped down perl interpreter ;)
		585	*/
		586	PL_top_env = &PL_start_env;
		587
		588	/* inject call to cctx_init */
		589	prepare_cctx ((coro_cctx *)arg);
		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);
		596	abort ();
		597	}
		598
		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
553	if (ctx->sptr)	629	if (!cctx->sptr)
		630	{
		631	perror ("FATAL: unable to malloc stack for coroutine");
		632	_exit (EXIT_FAILURE);
554	{	633	}
555	PUSHMARK(SP);	634
556	PUTBACK;	635	#endif
557	(void) call_sv (sub_init, G_VOID|G_NOARGS);	636
558	croak ("FATAL: CCTXT coroutine returned!");	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;
559	}	680	}
560	else	681	else
561	{	682	{
562	UNOP myop;	683	cctx = cctx_new ();
563		684	PL_op = PL_op->op_next;
564	PL_op = (OP *)&myop;
565
566	Zero(&myop, 1, UNOP);
567	myop.op_next = Nullop;
568	myop.op_flags = OPf_WANT_VOID;
569
570	PUSHMARK(SP);
571	XPUSHs (sub_init);
572	/*
573	* the next line is slightly wrong, as PL_op->op_next
574	* is actually being executed so we skip the first op.
575	* that doesn't matter, though, since it is only
576	* pp_nextstate and we never return...
577	* ah yes, and I don't care anyways ;)
578	*/
579	PUTBACK;
580	PL_op = pp_entersub();
581	SPAGAIN;
582
583	ENTER; /* necessary e.g. for dounwind */
584	}	685	}
585	}
586		686
587	STATIC void	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
588	transfer(pTHX_ struct coro *prev, struct coro *next, int flags)	711	transfer (struct coro *prev, struct coro *next)
589	{	712	{
590	dSP;	713	dSTACKLEVEL;
591		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	}
592	if (prev != next)	721	else if (prev != next)
593	{	722	{
594	/*	723	coro_cctx *prev__cctx;
595	* this could be done in newprocess which would lead to	724
596	* extremely elegant and fast (basically just SAVE/LOAD)	725	if (prev->flags & CF_NEW)
597	* code here, but lazy allocation of stacks has also
598	* some virtues and the overhead of the if() is nil.
599	*/
600	if (next->mainstack)
601	{	726	{
602	SAVE (prev, flags);	727	/* create a new empty context */
603	LOAD (next);	728	Newz (0, prev->cctx, 1, coro_cctx);
604		729	prev->cctx->inuse = 1;
605	/* mark this state as in-use */	730	prev->flags &= ~CF_NEW;
606	next->mainstack = 0;	731	prev->flags |= CF_RUNNING;
607	next->tmps_ix = -2;
608
609	if (flags & TRANSFER_SAVE_CCTXT)
610	{
611	if (!next->ssize)
612	croak ("destination coroutine has no CCTXT (%p, %d)", next->sptr, next->ssize);
613
614	if (!prev->ssize)
615	prev->ssize = 1; /* mark cctx as valid ;) */
616
617	coro_transfer (&(prev->cctx), &(next->cctx));
618	}
619
620	}	732	}
621	else if (next->tmps_ix == -2)	733
622	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	}
623	else	760	else
624	{	761	{
625	SAVE (prev, -1); /* first get rid of the old state */	762	/* coroutine already started */
626		763	save_perl (prev);
627	if (flags & TRANSFER_SAVE_CCTXT)	764	load_perl (next);
628	{
629	if (!next->ssize)
630	{
631	allocate_stack (next);
632	coro_create (&(next->cctx),
633	setup_coro, (void *)next,
634	next->sptr, next->ssize);
635	}
636
637	if (!prev->ssize)
638	prev->ssize = 1; /* mark cctx as valid ;) */
639
640	coro_transfer (&(prev->cctx), &(next->cctx));
641	}
642	else
643	setup_coro (next);
644	}	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]);
645	}	963	}
		964
		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;
646	}	1108	}
647		1109
648	MODULE = Coro::State PACKAGE = Coro::State	1110	MODULE = Coro::State PACKAGE = Coro::State
649		1111
650	PROTOTYPES: ENABLE	1112	PROTOTYPES: DISABLE
651		1113
652	BOOT:	1114	BOOT:
653	{ /* {} necessary for stoopid perl-5.6.x */	1115	{
654	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);	1116	#ifdef USE_ITHREADS
655	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);	1117	MUTEX_INIT (&coro_mutex);
		1118	#endif
		1119	BOOT_PAGESIZE;
		1120
656	coro_state_stash = gv_stashpv ("Coro::State", TRUE);	1121	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
657		1122
658	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	1123	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
659	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	1124	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
660	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));
661	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));	1127	newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
662
663	if (!padlist_cache)
664	padlist_cache = newHV ();
665		1128
666	main_mainstack = PL_mainstack;	1129	main_mainstack = PL_mainstack;
667	}
668		1130
669	Coro::State	1131	coroapi.ver = CORO_API_VERSION;
670	_newprocess(args)	1132	coroapi.transfer = api_transfer;
671	SV * args	1133
672	PROTOTYPE: $	1134	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
		1135	}
		1136
		1137	SV *
		1138	new (char *klass, ...)
673	CODE:	1139	CODE:
674	Coro__State coro;	1140	{
		1141	struct coro *coro;
		1142	HV *hv;
		1143	int i;
675		1144
676	if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
677	croak ("Coro::State::_newprocess expects an arrayref");
678
679	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;
680		1149
681	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	1150	hv = newHV ();
682	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;
683	coro->sptr = 0;	1152	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
684	coro->ssize = 0;
685		1153
686	RETVAL = coro;	1154	for (i = 1; i < items; i++)
		1155	av_push (coro->args, newSVsv (ST (i)));
		1156	}
687	OUTPUT:	1157	OUTPUT:
688	RETVAL	1158	RETVAL
689		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
690	void	1167	void
691	transfer(prev, next, flags = TRANSFER_SAVE_ALL)	1168	_set_stacklevel (...)
692	Coro::State_or_hashref prev	1169	ALIAS:
693	Coro::State_or_hashref next	1170	Coro::State::transfer = 1
694	int flags	1171	Coro::schedule = 2
695	PROTOTYPE: @	1172	Coro::cede = 3
		1173	Coro::cede_notself = 4
696	CODE:	1174	CODE:
697	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	if (GIMME_V != G_VOID && ta.next != ta.prev)
		1211	XSRETURN_YES;
		1212	}
		1213
		1214	bool
		1215	_destroy (SV *coro_sv)
		1216	CODE:
		1217	RETVAL = coro_state_destroy (SvSTATE (coro_sv));
		1218	OUTPUT:
		1219	RETVAL
698		1220
699	void	1221	void
700	DESTROY(coro)	1222	_exit (code)
701	Coro::State coro	1223	int code
		1224	PROTOTYPE: $
		1225	CODE:
		1226	_exit (code);
		1227
		1228	int
		1229	cctx_count ()
		1230	CODE:
		1231	RETVAL = cctx_count;
		1232	OUTPUT:
		1233	RETVAL
		1234
		1235	int
		1236	cctx_idle ()
		1237	CODE:
		1238	RETVAL = cctx_idle;
		1239	OUTPUT:
		1240	RETVAL
		1241
		1242	MODULE = Coro::State PACKAGE = Coro
		1243
		1244	BOOT:
		1245	{
		1246	int i;
		1247
		1248	coro_stash = gv_stashpv ("Coro", TRUE);
		1249
		1250	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
		1251	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
		1252	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
		1253	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
		1254	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
		1255	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
		1256
		1257	coro_current = get_sv ("Coro::current", FALSE);
		1258	SvREADONLY_on (coro_current);
		1259
		1260	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
		1261	coro_ready[i] = newAV ();
		1262
		1263	{
		1264	SV *sv = perl_get_sv("Coro::API", 1);
		1265
		1266	coroapi.schedule = api_schedule;
		1267	coroapi.save = api_save;
		1268	coroapi.cede = api_cede;
		1269	coroapi.cede_notself = api_cede_notself;
		1270	coroapi.ready = api_ready;
		1271	coroapi.is_ready = api_is_ready;
		1272	coroapi.nready = &coro_nready;
		1273	coroapi.current = coro_current;
		1274
		1275	GCoroAPI = &coroapi;
		1276	sv_setiv (sv, (IV)&coroapi);
		1277	SvREADONLY_on (sv);
		1278	}
		1279	}
		1280
		1281	void
		1282	_set_current (SV *current)
		1283	PROTOTYPE: $
		1284	CODE:
		1285	SvREFCNT_dec (SvRV (coro_current));
		1286	SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
		1287
		1288	int
		1289	prio (Coro::State coro, int newprio = 0)
		1290	ALIAS:
		1291	nice = 1
702	CODE:	1292	CODE:
		1293	{
		1294	RETVAL = coro->prio;
703		1295
704	if (coro->mainstack && coro->mainstack != main_mainstack)	1296	if (items > 1)
705	{	1297	{
706	struct coro temp;	1298	if (ix)
		1299	newprio = coro->prio - newprio;
707		1300
708	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);	1301	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
709	LOAD(aTHX_ coro);	1302	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
710		1303
711	destroy_stacks (aTHX);	1304	coro->prio = newprio;
712
713	LOAD((&temp)); /* this will get rid of defsv etc.. */
714
715	coro->mainstack = 0;
716	}	1305	}
		1306	}
		1307	OUTPUT:
		1308	RETVAL
717		1309
718	if (coro->sptr)	1310	SV *
719	{	1311	ready (SV *self)
720	deallocate_stack (coro);	1312	PROTOTYPE: $
721	coro->sptr = 0;	1313	CODE:
722	}	1314	RETVAL = boolSV (api_ready (self));
		1315	OUTPUT:
		1316	RETVAL
723		1317
724	Safefree (coro);	1318	SV *
		1319	is_ready (SV *self)
		1320	PROTOTYPE: $
		1321	CODE:
		1322	RETVAL = boolSV (api_is_ready (self));
		1323	OUTPUT:
		1324	RETVAL
		1325
		1326	int
		1327	nready (...)
		1328	PROTOTYPE:
		1329	CODE:
		1330	RETVAL = coro_nready;
		1331	OUTPUT:
		1332	RETVAL
		1333
		1334	MODULE = Coro::State PACKAGE = Coro::AIO
		1335
		1336	SV *
		1337	_get_state ()
		1338	CODE:
		1339	{
		1340	struct io_state *data;
		1341
		1342	RETVAL = newSV (sizeof (struct io_state));
		1343	data = (struct io_state *)SvPVX (RETVAL);
		1344	SvCUR_set (RETVAL, sizeof (struct io_state));
		1345	SvPOK_only (RETVAL);
		1346
		1347	data->errorno = errno;
		1348	data->laststype = PL_laststype;
		1349	data->laststatval = PL_laststatval;
		1350	data->statcache = PL_statcache;
		1351	}
		1352	OUTPUT:
		1353	RETVAL
725		1354
726	void	1355	void
727	flush()	1356	_set_state (char *data_)
		1357	PROTOTYPE: $
728	CODE:	1358	CODE:
729	#ifdef MAY_FLUSH	1359	{
730	flush_padlist_cache ();	1360	struct io_state *data = (void *)data_;
731	#endif
732		1361
733	MODULE = Coro::State PACKAGE = Coro::Cont	1362	errno = data->errorno;
		1363	PL_laststype = data->laststype;
		1364	PL_laststatval = data->laststatval;
		1365	PL_statcache = data->statcache;
		1366	}
734		1367
735	# this is slightly dirty
736
737	void
738	yield(...)
739	PROTOTYPE: @
740	CODE:
741	static SV *returnstk;
742	SV *sv;
743	AV *defav = GvAV (PL_defgv);
744	struct coro *prev, *next;
745
746	if (!returnstk)
747	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
748
749	/* set up @_ -- ugly */
750	av_clear (defav);
751	av_fill (defav, items - 1);
752	while (items--)
753	av_store (defav, items, SvREFCNT_inc (ST(items)));
754
755	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
756	sv = av_pop ((AV *)SvRV (returnstk));
757	prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
758	next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
759	SvREFCNT_dec (sv);
760
761	transfer(aTHX_ prev, next, 0);
762

Diff Legend

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