ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.72 by root, Wed Feb 1 23:59:41 2006 UTC vs.
Revision 1.162 by root, Sun Sep 23 21:49:58 2007 UTC

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

Diff Legend

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