ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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