ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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