ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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