[ViewVC] Diff of: cvs/Coro/Coro/State.xs

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.39 by root, Sun Nov 25 20:04:05 2001 UTC vs. Revision 1.150 by root, Wed Jun 13 21:04:48 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.39 by root, Sun Nov 25 20:04:05 2001 UTC vs.
Revision 1.150 by root, Wed Jun 13 21:04:48 2007 UTC