ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.79 by root, Thu Nov 2 12:29:08 2006 UTC vs.
Revision 1.144 by root, Sun Mar 4 11:45:23 2007 UTC

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

Diff Legend

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