ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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