ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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