ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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