ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.30 by root, Sat Aug 25 22:19:05 2001 UTC vs.
Revision 1.131 by root, Fri Dec 29 11:37:49 2006 UTC

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

Diff Legend

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