ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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