ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.9 by root, Sat Jul 21 02:49:09 2001 UTC vs.
Revision 1.146 by root, Sat Mar 17 19:51:57 2007 UTC

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

Diff Legend

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