ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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