ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.48 by pcg, Sat Nov 15 03:53:37 2003 UTC vs.
Revision 1.148 by root, Fri Apr 13 12:56:55 2007 UTC

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

Diff Legend

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