ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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