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