ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.133 by root, Thu Jan 4 20:14:19 2007 UTC

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

Diff Legend

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