ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.8 by root, Thu Jul 19 04:13:22 2001 UTC vs.
Revision 1.131 by root, Fri Dec 29 11:37:49 2006 UTC

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

Diff Legend

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