ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.18 by root, Thu Jul 26 03:46:15 2001 UTC vs.
Revision 1.121 by root, Sat Dec 2 20:40:25 2006 UTC

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

Diff Legend

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