ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.51 by pcg, Sun Nov 30 17:03:48 2003 UTC vs.
Revision 1.164 by root, Tue Sep 25 01:47:23 2007 UTC

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

Diff Legend

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