ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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