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