ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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