ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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