ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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