ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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