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