ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.31 by root, Sun Aug 26 16:36:08 2001 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 "libcoro/coro.c"	7	#include "patchlevel.h"
6		8
		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)
		23	# ifndef PL_ppaddr
		24	# define PL_ppaddr ppaddr
		25	# endif
		26	# ifndef call_sv
		27	# define call_sv perl_call_sv
		28	# endif
		29	# ifndef get_sv
		30	# define get_sv perl_get_sv
		31	# endif
		32	# ifndef get_cv
		33	# define get_cv perl_get_cv
		34	# endif
		35	# ifndef IS_PADGV
		36	# define IS_PADGV(v) 0
		37	# endif
		38	# ifndef IS_PADCONST
		39	# define IS_PADCONST(v) 0
		40	# endif
		41	#endif
		42
		43	/* 5.8.7 */
		44	#ifndef SvRV_set
		45	# define SvRV_set(s,v) SvRV(s) = (v)
		46	#endif
		47
7	#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
8		59
9	#ifdef HAVE_MMAP	60	#ifdef HAVE_MMAP
10	# include <unistd.h>	61	# include <unistd.h>
11	# include <sys/mman.h>	62	# include <sys/mman.h>
12	# ifndef MAP_ANON
13	# ifdef MAP_ANONYMOUS	63	# ifndef MAP_ANONYMOUS
14	# define MAP_ANON MAP_ANONYMOUS	64	# ifdef MAP_ANON
		65	# define MAP_ANONYMOUS MAP_ANON
15	# else	66	# else
16	# undef HAVE_MMAP	67	# undef HAVE_MMAP
17	# endif	68	# endif
18	# 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
19	#endif	77	# endif
20		78	#else
21	#define MAY_FLUSH /* increases codesize and is rarely used */	79	# define PAGESIZE 0
22		80	# define BOOT_PAGESIZE (void)0
23	#define SUB_INIT "Coro::State::initialize"	81	#endif
24	#define UCORO_STATE "_coro_state"
25		82
26	/* 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
27	* 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
28	* and should be unique. */	85	* and should be unique. */
		86	#define dSTACKLEVEL int stacklevel
29	#define dSTACKLEVEL void *stacklevel = &stacklevel	87	#define STACKLEVEL ((void *)&stacklevel)
30		88
31	#define labs(l) ((l) >= 0 ? (l) : -(l))	89	#define IN_DESTRUCT (PL_main_cv == Nullcv)
		90
		91	#if __GNUC__ >= 3
		92	# define attribute(x) __attribute__(x)
		93	#else
		94	# define attribute(x)
		95	#endif
		96
		97	#define NOINLINE attribute ((noinline))
32		98
33	#include "CoroAPI.h"	99	#include "CoroAPI.h"
34		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
35	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 */
36		122
37	/* 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 */
38	typedef struct {	127	typedef struct coro_cctx {
39	int refcnt; /* pointer reference counter */	128	struct coro_cctx *next;
40	int usecnt; /* shared by how many coroutines */
41	int gencnt; /* generation counter */
42		129
43	coro_context cctx;	130	/* the stack */
44
45	void *sptr;	131	void *sptr;
46	long ssize; /* positive == mmap, otherwise malloc */	132	long ssize; /* positive == mmap, otherwise malloc */
47	} coro_stack;
48		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 */
49	struct coro {	153	struct coro {
50	/* the optional C context */	154	/* the c coroutine allocated to this perl coroutine, if any */
51	coro_stack *stack;	155	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		156
92	/* data associated with this coroutine (initial args) */	157	/* data associated with this coroutine (initial args) */
93	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;
94	};	176	};
95		177
96	typedef struct coro *Coro__State;	178	typedef struct coro *Coro__State;
97	typedef struct coro *Coro__State_or_hashref;	179	typedef struct coro *Coro__State_or_hashref;
98		180
99	static AV *main_mainstack; /* used to differentiate between $main and others */	181	static AV *
100	static HV *coro_state_stash;	182	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	{	183	{
109	AV *av;	184	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;	185	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		186
128	newpadlist = newAV ();	187	newpadlist = newAV ();
129	AvREAL_off (newpadlist);	188	AvREAL_off (newpadlist);
130	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)));
131	av_store (newpadlist, 1, (SV *) newpad);	198	av_store (newpadlist, 1, (SV *)newpad);
132		199
133	av = newAV (); /* will be @_ */	200	return newpadlist;
134	av_extend (av, 0);	201	}
135	av_store (newpad, 0, (SV *) av);
136	AvFLAGS (av) = AVf_REIFY;
137		202
138	for (ix = fpad; ix > 0; ix--)	203	static void
		204	free_padlist (AV *padlist)
		205	{
		206	/* may be during global destruction */
		207	if (SvREFCNT (padlist))
139	{	208	{
140	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;	209	I32 i = AvFILLp (padlist);
141	if (namesv && namesv != &PL_sv_undef)	210	while (i >= 0)
142	{	211	{
143	char *name = SvPVX (namesv); /* XXX */	212	SV **svp = av_fetch (padlist, i--, FALSE);
144	if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')	213	if (svp)
145	{ /* lexical from outside? */
146	npad[ix] = SvREFCNT_inc (ppad[ix]);
147	}	214	{
148	else
149	{ /* our own lexical */
150	SV *sv;	215	SV *sv;
151	if (*name == '&')	216	while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
152	sv = SvREFCNT_inc (ppad[ix]);	217	SvREFCNT_dec (sv);
153	else if (*name == '@')	218
154	sv = (SV *) newAV ();	219	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	}	220	}
163	}	221	}
164	else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))	222
165	{	223	SvREFCNT_dec ((SV*)padlist);
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	}	224	}
		225	}
175		226
176	#if 0 /* return -ENOTUNDERSTOOD */	227	static int
177	/* Now that vars are all in place, clone nested closures. */	228	coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
		229	{
		230	AV *padlist;
		231	AV *av = (AV *)mg->mg_obj;
178		232
179	for (ix = fpad; ix > 0; ix--) {	233	/* casting is fun. */
180	SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;	234	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
181	if (namesv	235	free_padlist (padlist);
182	&& namesv != &PL_sv_undef	236
183	&& !(SvFLAGS(namesv) & SVf_FAKE)	237	SvREFCNT_dec (av);
184	&& *SvPVX(namesv) == '&'	238
185	&& CvCLONE(ppad[ix]))	239	return 0;
186	{	240	}
187	CV *kid = cv_clone((CV*)ppad[ix]);	241
188	SvREFCNT_dec(ppad[ix]);	242	#define PERL_MAGIC_coro PERL_MAGIC_ext
189	CvCLONE_on(kid);	243
190	SvPADMY_on(kid);	244	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
191	npad[ix] = (SV*)kid;	245
192	}	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
		253	/* the next two functions merely cache the padlists */
		254	static void
		255	get_padlist (CV *cv)
		256	{
		257	MAGIC *mg = CORO_MAGIC (cv);
		258	AV *av;
		259
		260	if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
		261	CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
		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
		271	CvPADLIST (cv) = coro_clone_padlist (cv);
		272	#endif
		273	}
		274	}
		275
		276	static void
		277	put_padlist (CV *cv)
		278	{
		279	MAGIC *mg = CORO_MAGIC (cv);
		280	AV *av;
		281
		282	if (!mg)
		283	{
		284	sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
		285	mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
		286	mg->mg_virtual = &vtbl_coro;
		287	mg->mg_obj = (SV *)newAV ();
193	}	288	}
194	#endif
195		289
196	return newpadlist;	290	av = (AV *)mg->mg_obj;
197	}
198		291
199	#ifdef MAY_FLUSH	292	if (AvFILLp (av) >= AvMAX (av))
200	STATIC void	293	av_extend (av, AvMAX (av) + 1);
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		294
215	SvREFCNT_dec((SV*)padlist);	295	AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
216	}
217	}	296	}
218	#endif
219
220	/* the next two functions merely cache the padlists */
221	STATIC void
222	get_padlist (CV *cv)
223	{
224	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
225
226	if (he && AvFILLp ((AV *)*he) >= 0)
227	CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
228	else
229	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
230	}
231
232	STATIC void
233	put_padlist (CV *cv)
234	{
235	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
236
237	if (SvTYPE (*he) != SVt_PVAV)
238	{
239	SvREFCNT_dec (*he);
240	*he = (SV *)newAV ();
241	}
242
243	av_push ((AV *)*he, (SV *)CvPADLIST (cv));
244	}
245
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	{
255	HE *he;
256	AV *padlist;
257
258	while (!!(he = hv_iternext (hv)))
259	{
260	AV *av = (AV *)HeVAL(he);
261
262	/* casting is fun. */
263	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
264	free_padlist (padlist);
265	}
266	}
267
268	SvREFCNT_dec (hv);
269	}
270	#endif
271		297
272	#define SB do {	298	#define SB do {
273	#define SE } while (0)	299	#define SE } while (0)
274		300
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	301	#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
279		302
280	static void	303	static void
281	load_state(pTHX_ Coro__State c)	304	load_perl (Coro__State c)
282	{	305	{
283	PL_dowarn = c->dowarn;	306	#define VAR(name,type) PL_ ## name = c->name;
284	PL_in_eval = c->in_eval;	307	# include "state.h"
285		308	#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		309
313	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	310	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	311	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
315	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	}
316		324
317	{	325	{
318	dSP;	326	dSP;
319	CV *cv;	327	CV *cv;
320		328
321	/* now do the ugly restore mess */	329	/* now do the ugly restore mess */
322	while ((cv = (CV *)POPs))	330	while ((cv = (CV *)POPs))
323	{	331	{
324	AV *padlist = (AV *)POPs;
325
326	if (padlist)
327	{
328	put_padlist (cv); /* mark this padlist as available */	332	put_padlist (cv); /* mark this padlist as available */
329	CvPADLIST(cv) = padlist;	333	CvDEPTH (cv) = PTR2IV (POPs);
330	#ifdef USE_THREADS	334	CvPADLIST (cv) = (AV *)POPs;
331	/*CvOWNER(cv) = (struct perl_thread *)POPs;*/
332	#endif
333	}
334
335	++CvDEPTH(cv);
336	}	335	}
337		336
338	PUTBACK;	337	PUTBACK;
339	}	338	}
340	}	339	}
341		340
342	static void	341	static void
343	save_state(pTHX_ Coro__State c, int flags)	342	save_perl (Coro__State c)
344	{	343	{
345	{	344	{
346	dSP;	345	dSP;
347	I32 cxix = cxstack_ix;	346	I32 cxix = cxstack_ix;
348	PERL_CONTEXT *ccstk = cxstack;	347	PERL_CONTEXT *ccstk = cxstack;
…		…
351	/*	350	/*
352	* 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
353	* (and reinitialize) all cv's in the whole callchain :(	352	* (and reinitialize) all cv's in the whole callchain :(
354	*/	353	*/
355		354
		355	EXTEND (SP, 3 + 1);
356	PUSHs (Nullsv);	356	PUSHs (Nullsv);
357	/* this loop was inspired by pp_caller */	357	/* this loop was inspired by pp_caller */
358	for (;;)	358	for (;;)
359	{	359	{
360	while (cxix >= 0)	360	while (cxix >= 0)
361	{	361	{
362	PERL_CONTEXT *cx = &ccstk[cxix--];	362	PERL_CONTEXT *cx = &ccstk[cxix--];
363		363
364	if (CxTYPE(cx) == CXt_SUB)	364	if (CxTYPE (cx) == CXt_SUB)
365	{	365	{
366	CV *cv = cx->blk_sub.cv;	366	CV *cv = cx->blk_sub.cv;
		367
367	if (CvDEPTH(cv))	368	if (CvDEPTH (cv))
368	{	369	{
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);	370	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));	371	PUSHs ((SV *)CvPADLIST (cv));
		372	PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
384	PUSHs ((SV *)cv);	373	PUSHs ((SV *)cv);
385		374
		375	CvDEPTH (cv) = 0;
386	get_padlist (cv); /* this is a monster */	376	get_padlist (cv);
387	}	377	}
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	}	378	}
395	}	379	}
396		380
397	if (top_si->si_type == PERLSI_MAIN)	381	if (top_si->si_type == PERLSI_MAIN)
398	break;	382	break;
…		…
403	}	387	}
404		388
405	PUTBACK;	389	PUTBACK;
406	}	390	}
407		391
408	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;
409	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	393	c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
410	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;
411		396
412	c->dowarn = PL_dowarn;	397	#define VAR(name,type)c->name = PL_ ## name;
413	c->in_eval = PL_in_eval;	398	# include "state.h"
414		399	#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	}	400	}
442		401
443	/*	402	/*
444	* allocate various perl stacks. This is an exact copy	403	* allocate various perl stacks. This is an exact copy
445	* of perl.c:init_stacks, except that it uses less memory	404	* of perl.c:init_stacks, except that it uses less memory
446	* on the assumption that coroutines do not usually need	405	* on the (sometimes correct) assumption that coroutines do
447	* a lot of stackspace.	406	* not usually need a lot of stackspace.
448	*/	407	*/
449	STATIC void	408	#if USE_PERL_INIT_STACKS
		409	# define coro_init_stacks init_stacks
		410	#else
		411
		412	static void
450	coro_init_stacks (pTHX)	413	coro_init_stacks ()
451	{	414	{
452	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);	415	PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
453	PL_curstackinfo->si_type = PERLSI_MAIN;	416	PL_curstackinfo->si_type = PERLSI_MAIN;
454	PL_curstack = PL_curstackinfo->si_stack;	417	PL_curstack = PL_curstackinfo->si_stack;
455	PL_mainstack = PL_curstack; /* remember in case we switch stacks */	418	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
456		419
457	PL_stack_base = AvARRAY(PL_curstack);	420	PL_stack_base = AvARRAY(PL_curstack);
458	PL_stack_sp = PL_stack_base;	421	PL_stack_sp = PL_stack_base;
459	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);	422	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
460		423
461	New(50,PL_tmps_stack,96,SV*);	424	New(50,PL_tmps_stack,128,SV*);
462	PL_tmps_floor = -1;	425	PL_tmps_floor = -1;
463	PL_tmps_ix = -1;	426	PL_tmps_ix = -1;
464	PL_tmps_max = 96;	427	PL_tmps_max = 128;
465		428
466	New(54,PL_markstack,16,I32);	429	New(54,PL_markstack,32,I32);
467	PL_markstack_ptr = PL_markstack;	430	PL_markstack_ptr = PL_markstack;
468	PL_markstack_max = PL_markstack + 16;	431	PL_markstack_max = PL_markstack + 32;
469		432
		433	#ifdef SET_MARK_OFFSET
470	SET_MARK_OFFSET;	434	SET_MARK_OFFSET;
		435	#endif
471		436
472	New(54,PL_scopestack,16,I32);	437	New(54,PL_scopestack,32,I32);
473	PL_scopestack_ix = 0;	438	PL_scopestack_ix = 0;
474	PL_scopestack_max = 16;	439	PL_scopestack_max = 32;
475		440
476	New(54,PL_savestack,96,ANY);	441	New(54,PL_savestack,64,ANY);
477	PL_savestack_ix = 0;	442	PL_savestack_ix = 0;
478	PL_savestack_max = 96;	443	PL_savestack_max = 64;
479		444
		445	#if !PERL_VERSION_ATLEAST (5,9,0)
480	New(54,PL_retstack,8,OP*);	446	New(54,PL_retstack,16,OP*);
481	PL_retstack_ix = 0;	447	PL_retstack_ix = 0;
482	PL_retstack_max = 8;	448	PL_retstack_max = 16;
		449	#endif
483	}	450	}
484		451
485	/*	452	/*
486	* destroy the stacks, the callchain etc...	453	* destroy the stacks, the callchain etc...
487	* still there is a memleak of 128 bytes...
488	*/	454	*/
489	STATIC void	455	static void
490	destroy_stacks(pTHX)	456	coro_destroy_stacks ()
491	{	457	{
492	int destruct = PL_main_cv != Nullcv;	458	if (!IN_DESTRUCT)
493
494	if (destruct)
495	{	459	{
496	/* is this ugly, I ask? */	460	/* restore all saved variables and stuff */
497	while (PL_scopestack_ix)	461	LEAVE_SCOPE (0);
498	LEAVE;	462	assert (PL_tmps_floor == -1);
499		463
500	/* sure it is, but more important: is it correct?? :/ */	464	/* free all temporaries */
501	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
502	FREETMPS;	465	FREETMPS;
		466	assert (PL_tmps_ix == -1);
		467
		468	POPSTACK_TO (PL_mainstack);
503	}	469	}
504		470
505	while (PL_curstackinfo->si_next)	471	while (PL_curstackinfo->si_next)
506	PL_curstackinfo = PL_curstackinfo->si_next;	472	PL_curstackinfo = PL_curstackinfo->si_next;
507		473
508	while (PL_curstackinfo)	474	while (PL_curstackinfo)
509	{	475	{
510	PERL_SI *p = PL_curstackinfo->si_prev;	476	PERL_SI *p = PL_curstackinfo->si_prev;
511		477
512	{	478	if (!IN_DESTRUCT)
513	dSP;
514	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
515	PUTBACK; /* possibly superfluous */
516	}
517
518	if (destruct)
519	{
520	dounwind(-1);
521	SvREFCNT_dec(PL_curstackinfo->si_stack);	479	SvREFCNT_dec (PL_curstackinfo->si_stack);
522	}
523		480
524	Safefree(PL_curstackinfo->si_cxstack);	481	Safefree (PL_curstackinfo->si_cxstack);
525	Safefree(PL_curstackinfo);	482	Safefree (PL_curstackinfo);
526	PL_curstackinfo = p;	483	PL_curstackinfo = p;
527	}	484	}
528		485
529	Safefree(PL_tmps_stack);	486	Safefree (PL_tmps_stack);
530	Safefree(PL_markstack);	487	Safefree (PL_markstack);
531	Safefree(PL_scopestack);	488	Safefree (PL_scopestack);
532	Safefree(PL_savestack);	489	Safefree (PL_savestack);
		490	#if !PERL_VERSION_ATLEAST (5,9,0)
533	Safefree(PL_retstack);	491	Safefree (PL_retstack);
534	}
535
536	static void
537	allocate_stack (Coro__State ctx, int alloc)
538	{
539	coro_stack *stack;
540
541	New (0, stack, 1, coro_stack);
542
543	stack->refcnt = 1;
544	stack->usecnt = 1;
545	stack->gencnt = ctx->gencnt = 0;
546	if (alloc)
547	{
548	#ifdef HAVE_MMAP
549	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
550	stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
551	if (stack->sptr == (void *)-1)
552	#endif	492	#endif
553	{
554	/*FIXME*//*D*//* reasonable stack size! */
555	stack->ssize = -4096 * sizeof (long);
556	New (0, stack->sptr, 4096, long);
557	}
558	}
559	else
560	stack->sptr = 0;
561
562	ctx->stack = stack;
563	}	493	}
564
565	static void
566	deallocate_stack (Coro__State ctx)
567	{
568	coro_stack *stack = ctx->stack;
569
570	ctx->stack = 0;
571
572	if (stack)
573	{
574	if (!--stack->refcnt)
575	{
576	#ifdef HAVE_MMAP
577	if (stack->ssize > 0 && stack->sptr)
578	munmap (stack->sptr, stack->ssize);
579	else
580	#else
581	Safefree (stack->sptr);
582	#endif	494	#endif
583	Safefree (stack);
584	}
585	else if (ctx->gencnt == stack->gencnt)
586	--stack->usecnt;
587	}
588	}
589		495
590	static void	496	static void
591	setup_coro (void *arg)	497	setup_coro (struct coro *coro)
592	{	498	{
593	/*	499	/*
594	* emulate part of the perl startup here.	500	* emulate part of the perl startup here.
595	*/	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	{
596	dSP;	548	dSP;
597	Coro__State ctx = (Coro__State)arg;	549	LOGOP myop;
598	SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
599		550
600	coro_init_stacks (aTHX);	551	Zero (&myop, 1, LOGOP);
601	/*PL_curcop = 0;*/	552	myop.op_next = PL_op;
602	/*PL_in_eval = PL_in_eval;*/ /* inherit */	553	myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
603	SvREFCNT_dec (GvAV (PL_defgv));
604	GvAV (PL_defgv) = ctx->args;
605		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);
606	SPAGAIN;	562	SPAGAIN;
607
608	if (ctx->stack)
609	{
610	ctx->cursp = 0;
611
612	PUSHMARK(SP);
613	PUTBACK;
614	(void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
615
616	if (SvTRUE (ERRSV))
617	croak (NULL);
618	else
619	croak ("FATAL: CCTXT coroutine returned!");
620	}
621	else
622	{
623	UNOP myop;
624
625	PL_op = (OP *)&myop;
626
627	Zero(&myop, 1, UNOP);
628	myop.op_next = Nullop;
629	myop.op_flags = OPf_WANT_VOID;
630
631	PUSHMARK(SP);
632	XPUSHs (sub_init);
633	/*
634	* the next line is slightly wrong, as PL_op->op_next
635	* is actually being executed so we skip the first op.
636	* that doesn't matter, though, since it is only
637	* pp_nextstate and we never return...
638	* ah yes, and I don't care anyways ;)
639	*/
640	PUTBACK;
641	PL_op = pp_entersub();
642	SPAGAIN;
643
644	ENTER; /* necessary e.g. for dounwind */
645	}
646	}	563	}
647		564
648	static void	565	static void
649	continue_coro (void *arg)	566	coro_run (void *arg)
650	{	567	{
		568	/* coro_run is the alternative tail of transfer(), so unlock here. */
		569	UNLOCK;
		570
651	/*	571	/*
652	* this is a _very_ stripped down perl interpreter ;)	572	* this is a _very_ stripped down perl interpreter ;)
653	*/	573	*/
654	Coro__State ctx = (Coro__State)arg;	574	PL_top_env = &PL_start_env;
655		575
656	/*FIXME*//* must set up top_env here */	576	/* inject call to cctx_init */
657	ctx->cursp = 0;	577	prepare_cctx ((coro_cctx *)arg);
658	PL_op = PL_op->op_next;
659	CALLRUNOPS(aTHX);
660		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);
661	abort ();	584	abort ();
662	}	585	}
663		586
664	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
665	transfer(pTHX_ struct coro *prev, struct coro *next, int flags)	699	transfer (struct coro *prev, struct coro *next)
666	{	700	{
667	dSTACKLEVEL;	701	dSTACKLEVEL;
668	static struct coro *xnext;
669		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	}
670	if (prev != next)	709	else if (prev != next)
671	{	710	{
672	xnext = next;	711	coro_cctx *prev__cctx;
673		712
674	if (next->mainstack)	713	if (prev->flags & CF_NEW)
675	{	714	{
676	SAVE (prev, flags);	715	/* create a new empty context */
677	LOAD (next);	716	Newz (0, prev->cctx, 1, coro_cctx);
678		717	prev->cctx->inuse = 1;
679	/* mark this state as in-use */	718	prev->flags &= ~CF_NEW;
680	next->mainstack = 0;	719	prev->flags |= CF_RUNNING;
681	next->tmps_ix = -2;
682
683	/* stacklevel changed? if yes, grab the stack for us! */
684	if (flags & TRANSFER_SAVE_CCTXT)
685	{
686	if (!prev->stack)
687	allocate_stack (prev, 0);
688	else if (prev->cursp != stacklevel
689	&& prev->stack->usecnt > 1)
690	{
691	prev->gencnt = ++prev->stack->gencnt;
692	prev->stack->usecnt = 1;
693	}
694
695	/* has our stack been invalidated? */
696	if (next->stack && next->stack->gencnt != next->gencnt)
697	{
698	deallocate_stack (next);
699	allocate_stack (next, 1);
700	coro_create (&(next->stack->cctx),
701	continue_coro, (void *)next,
702	next->stack->sptr, labs (next->stack->ssize));
703	}
704
705	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
706	/* don't add any code here */
707	}
708
709	}	720	}
710	else if (next->tmps_ix == -2)	721
711	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	}
712	else	745	else
713	{	746	{
714	SAVE (prev, -1); /* first get rid of the old state */	747	/* coroutine already started */
715		748	save_perl (prev);
716	if (flags & TRANSFER_SAVE_CCTXT)	749	load_perl (next);
717	{
718	if (!prev->stack)
719	allocate_stack (prev, 0);
720
721	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
722	{
723	setup_coro (next);
724
725	prev->stack->refcnt++;
726	prev->stack->usecnt++;
727	next->stack = prev->stack;
728	next->gencnt = prev->gencnt;
729	}
730	else
731	{
732	allocate_stack (next, 1);
733	coro_create (&(next->stack->cctx),
734	setup_coro, (void *)next,
735	next->stack->sptr, labs (next->stack->ssize));
736	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
737	/* don't add any code here */
738	}
739	}
740	else
741	setup_coro (next);
742	}	750	}
		751
		752	prev__cctx = prev->cctx;
		753
		754	/* possibly "free" the cctx */
		755	if (prev__cctx->idle_sp == STACKLEVEL)
		756	{
		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;
743	}	783	}
744
745	/*
746	* xnext is now either prev or next, depending on wether
747	* we switched the c stack or not. that's why i use a global
748	* variable, that should become thread-specific at one point.
749	*/
750	xnext->cursp = stacklevel;
751	}	784	}
		785
		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)
		800	{
		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
		815	coro->mainstack = 0;
		816	}
		817
		818	cctx_destroy (coro->cctx);
		819	SvREFCNT_dec (coro->args);
		820	Safefree (coro);
		821	}
		822
		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	};
752		854
753	static struct coro *	855	static struct coro *
754	sv_to_coro (SV *arg, const char *funcname, const char *varname)	856	SvSTATE (SV *coro)
755	{	857	{
756	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)	858	HV *stash;
757	{	859	MAGIC *mg;
758	HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
759		860
760	if (!he)	861	if (SvROK (coro))
761	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);	862	coro = SvRV (coro);
762		863
763	arg = HeVAL(he);	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");
764	}	870	}
765
766	/* must also be changed inside Coro::Cont::yield */
767	if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
768	return (struct coro *) SvIV((SV*)SvRV(arg));
769		871
770	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);	872	mg = SvMAGIC (coro);
771	/*NORETURN*/	873	assert (mg->mg_type == PERL_MAGIC_ext);
		874	return (struct coro *)mg->mg_ptr;
772	}	875	}
773		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
		885	api_transfer (SV *prev_sv, SV *next_sv)
		886	{
		887	struct transfer_args ta;
		888
		889	prepare_transfer (&ta, prev_sv, next_sv);
		890	TRANSFER (ta);
		891	}
		892
774	static void	893	static int
775	api_transfer(pTHX_ SV *prev, SV *next, int flags)	894	api_save (SV *coro_sv, int new_save)
776	{	895	{
777	transfer(aTHX_	896	struct coro *coro = SvSTATE (coro_sv);
778	sv_to_coro (prev, "Coro::transfer", "prev"),	897	int old_save = coro->save;
779	sv_to_coro (next, "Coro::transfer", "next"),	898
780	flags);	899	if (new_save >= 0)
		900	coro->save = new_save;
		901
		902	return old_save;
781	}	903	}
782		904
783	/** Coro ********************************************************************/	905	/** Coro ********************************************************************/
784		906
785	#define PRIO_MAX 3	907	#define PRIO_MAX 3
…		…
788	#define PRIO_LOW -1	910	#define PRIO_LOW -1
789	#define PRIO_IDLE -3	911	#define PRIO_IDLE -3
790	#define PRIO_MIN -4	912	#define PRIO_MIN -4
791		913
792	/* for Coro.pm */	914	/* for Coro.pm */
793	static GV *coro_current, *coro_idle;	915	static SV *coro_current;
794	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];	916	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
795	static int coro_nready;	917	static int coro_nready;
796		918
797	static void	919	static void
798	coro_enq (SV *sv)	920	coro_enq (SV *coro_sv)
799	{	921	{
800	if (SvROK (sv))	922	av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
801	{
802	SV *hv = SvRV (sv);
803	if (SvTYPE (hv) == SVt_PVHV)
804	{
805	SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
806	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
807
808	prio = prio > PRIO_MAX ? PRIO_MAX
809	: prio < PRIO_MIN ? PRIO_MIN
810	: prio;
811
812	av_push (coro_ready [prio - PRIO_MIN], sv);
813	coro_nready++;	923	coro_nready++;
814
815	return;
816	}
817	}
818
819	croak ("Coro::ready tried to enqueue something that is not a coroutine");
820	}	924	}
821		925
822	static SV *	926	static SV *
823	coro_deq (int min_prio)	927	coro_deq (int min_prio)
824	{	928	{
…		…
827	min_prio -= PRIO_MIN;	931	min_prio -= PRIO_MIN;
828	if (min_prio < 0)	932	if (min_prio < 0)
829	min_prio = 0;	933	min_prio = 0;
830		934
831	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )	935	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
832	if (av_len (coro_ready[prio]) >= 0)	936	if (AvFILLp (coro_ready [prio]) >= 0)
833	{	937	{
834	coro_nready--;	938	coro_nready--;
835	return av_shift (coro_ready[prio]);	939	return av_shift (coro_ready [prio]);
836	}	940	}
837		941
838	return 0;	942	return 0;
839	}	943	}
840		944
841	static void	945	static int
842	api_ready (SV *coro)	946	api_ready (SV *coro_sv)
843	{	947	{
		948	struct coro *coro;
		949
		950	if (SvROK (coro_sv))
		951	coro_sv = SvRV (coro_sv);
		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;
844	coro_enq (SvREFCNT_inc (coro));	966	coro_enq (SvREFCNT_inc (coro_sv));
845	}	967	UNLOCK;
846		968
		969	return 1;
		970	}
		971
847	static void	972	static int
848	api_schedule (int cede)	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)
849	{	980	{
850	SV *prev, *next;	981	SV *prev, *next;
851		982
852	prev = GvSV (coro_current);	983	for (;;)
853		984	{
854	if (cede)	985	LOCK;
855	coro_enq (SvREFCNT_inc (prev));
856
857	next = coro_deq (PRIO_MIN);	986	next = coro_deq (PRIO_MIN);
		987	UNLOCK;
858		988
859	if (!next)	989	if (next)
860	next = SvREFCNT_inc (GvSV (coro_idle));	990	break;
861		991
862	GvSV (coro_current) = SvREFCNT_inc (next);	992	{
863	transfer (aTHX_	993	dSP;
864	sv_to_coro (prev, "Coro::schedule", "current coroutine"),	994
865	sv_to_coro (next, "Coro::schedule", "next coroutine"),	995	ENTER;
866	TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);	996	SAVETMPS;
867	SvREFCNT_dec (next);	997
868	SvREFCNT_dec (prev);	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);
		1032	}
		1033
		1034	static void
		1035	api_schedule (void)
		1036	{
		1037	struct transfer_args ta;
		1038
		1039	prepare_schedule (&ta);
		1040	TRANSFER (ta);
		1041	}
		1042
		1043	static void
		1044	api_cede (void)
		1045	{
		1046	struct transfer_args ta;
		1047
		1048	prepare_cede (&ta);
		1049	TRANSFER (ta);
869	}	1050	}
870		1051
871	MODULE = Coro::State PACKAGE = Coro::State	1052	MODULE = Coro::State PACKAGE = Coro::State
872		1053
873	PROTOTYPES: ENABLE	1054	PROTOTYPES: DISABLE
874		1055
875	BOOT:	1056	BOOT:
876	{ /* {} necessary for stoopid perl-5.6.x */	1057	{
877	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);	1058	#ifdef USE_ITHREADS
878	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);	1059	MUTEX_INIT (&coro_mutex);
		1060	#endif
		1061	BOOT_PAGESIZE;
		1062
879	coro_state_stash = gv_stashpv ("Coro::State", TRUE);	1063	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
880		1064
881	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	1065	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
882	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	1066	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
883	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));
884	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));	1069	newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
885
886	if (!padlist_cache)
887	padlist_cache = newHV ();
888		1070
889	main_mainstack = PL_mainstack;	1071	main_mainstack = PL_mainstack;
890		1072
891	coroapi.ver = CORO_API_VERSION;	1073	coroapi.ver = CORO_API_VERSION;
892	coroapi.transfer = api_transfer;	1074	coroapi.transfer = api_transfer;
893	}
894		1075
895	Coro::State	1076	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
896	_newprocess(args)	1077	}
897	SV * args	1078
898	PROTOTYPE: $	1079	SV *
		1080	new (char *klass, ...)
899	CODE:	1081	CODE:
900	Coro__State coro;	1082	{
		1083	struct coro *coro;
		1084	HV *hv;
		1085	int i;
901		1086
902	if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
903	croak ("Coro::State::_newprocess expects an arrayref");
904
905	New (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;
906		1091
907	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	1092	hv = newHV ();
908	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;
909	coro->stack = 0;	1094	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
910		1095
911	RETVAL = coro;	1096	for (i = 1; i < items; i++)
		1097	av_push (coro->args, newSVsv (ST (i)));
		1098	}
912	OUTPUT:	1099	OUTPUT:
913	RETVAL	1100	RETVAL
914		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
915	void	1109	void
916	transfer(prev, next, flags)	1110	_set_stacklevel (...)
917	Coro::State_or_hashref prev	1111	ALIAS:
918	Coro::State_or_hashref next	1112	Coro::State::transfer = 1
919	int flags	1113	Coro::schedule = 2
920	PROTOTYPE: @	1114	Coro::cede = 3
921	CODE:	1115	CODE:
922	PUTBACK;	1116	{
923	transfer (aTHX_ prev, next, flags);	1117	struct transfer_args ta;
924	SPAGAIN;	1118
		1119	switch (ix)
		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	}
925		1144
926	void	1145	void
927	DESTROY(coro)	1146	_clone_state_from (SV *dst, SV *src)
928	Coro::State coro	1147	CODE:
929	CODE:	1148	{
		1149	struct coro *coro_src = SvSTATE (src);
930		1150
931	if (coro->mainstack && coro->mainstack != main_mainstack)	1151	sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
932	{
933	struct coro temp;
934		1152
935	PUTBACK;	1153	++coro_src->refcnt;
936	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;
937	LOAD(aTHX_ coro);	1155	}
938	SPAGAIN;
939
940	destroy_stacks (aTHX);
941
942	LOAD((&temp)); /* this will get rid of defsv etc.. */
943	SPAGAIN;
944
945	coro->mainstack = 0;
946	}
947
948	deallocate_stack (coro);
949
950	Safefree (coro);
951		1156
952	void	1157	void
953	flush()
954	CODE:
955	#ifdef MAY_FLUSH
956	flush_padlist_cache ();
957	#endif
958
959	void
960	_exit(code)	1158	_exit (code)
961	int code	1159	int code
962	PROTOTYPE: $	1160	PROTOTYPE: $
963	CODE:	1161	CODE:
964	#if defined(__GLIBC__) || _POSIX_C_SOURCE
965	_exit (code);	1162	_exit (code);
966	#else
967	signal (SIGTERM, SIG_DFL);
968	raise (SIGTERM);
969	exit (code);
970	#endif
971		1163
972	MODULE = Coro::State PACKAGE = Coro::Cont	1164	int
		1165	cctx_count ()
		1166	CODE:
		1167	RETVAL = cctx_count;
		1168	OUTPUT:
		1169	RETVAL
973		1170
974	# this is slightly dirty (should expose a c-level api)	1171	int
975		1172	cctx_idle ()
976	void	1173	CODE:
977	yield(...)	1174	RETVAL = cctx_idle;
978	PROTOTYPE: @	1175	OUTPUT:
979	CODE:	1176	RETVAL
980	static SV *returnstk;
981	SV *sv;
982	AV *defav = GvAV (PL_defgv);
983	struct coro *prev, *next;
984
985	if (!returnstk)
986	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
987
988	/* set up @_ -- ugly */
989	av_clear (defav);
990	av_fill (defav, items - 1);
991	while (items--)
992	av_store (defav, items, SvREFCNT_inc (ST(items)));
993
994	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
995	sv = av_pop ((AV *)SvRV (returnstk));
996	prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
997	next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
998	SvREFCNT_dec (sv);
999
1000	transfer(aTHX_ prev, next, 0);
1001		1177
1002	MODULE = Coro::State PACKAGE = Coro	1178	MODULE = Coro::State PACKAGE = Coro
1003		1179
1004	# this is slightly dirty (should expose a c-level api)
1005
1006	BOOT:	1180	BOOT:
1007	{	1181	{
1008	int i;	1182	int i;
		1183
1009	HV *stash = gv_stashpv ("Coro", TRUE);	1184	coro_stash = gv_stashpv ("Coro", TRUE);
1010		1185
1011	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));	1186	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1012	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));	1187	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1013	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));	1188	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1014	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));	1189	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1015	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));	1190	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1016	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));	1191	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1017		1192
1018	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);	1193	coro_current = get_sv ("Coro::current", FALSE);
1019	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);	1194	SvREADONLY_on (coro_current);
1020		1195
1021	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )	1196	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1022	coro_ready[i] = newAV ();	1197	coro_ready[i] = newAV ();
1023		1198
1024	{	1199	{
1025	SV *sv = perl_get_sv("Coro::API", 1);	1200	SV *sv = perl_get_sv("Coro::API", 1);
1026		1201
1027	coroapi.schedule = api_schedule;	1202	coroapi.schedule = api_schedule;
		1203	coroapi.save = api_save;
		1204	coroapi.cede = api_cede;
1028	coroapi.ready = api_ready;	1205	coroapi.ready = api_ready;
		1206	coroapi.is_ready = api_is_ready;
1029	coroapi.nready = &coro_nready;	1207	coroapi.nready = &coro_nready;
1030	coroapi.current = coro_current;	1208	coroapi.current = coro_current;
1031		1209
1032	GCoroAPI = &coroapi;	1210	GCoroAPI = &coroapi;
1033	sv_setiv(sv, (IV)&coroapi);	1211	sv_setiv (sv, (IV)&coroapi);
1034	SvREADONLY_on(sv);	1212	SvREADONLY_on (sv);
1035	}	1213	}
1036	}	1214	}
1037		1215
1038	void	1216	void
1039	ready(self)	1217	_set_current (SV *current)
1040	SV * self	1218	PROTOTYPE: $
1041	CODE:	1219	CODE:
1042	api_ready (self);	1220	SvREFCNT_dec (SvRV (coro_current));
		1221	SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1043		1222
1044	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
1045	nready(...)	1260	nready (...)
1046	PROTOTYPE:	1261	PROTOTYPE:
1047	CODE:	1262	CODE:
1048	RETVAL = coro_nready;	1263	RETVAL = coro_nready;
1049	OUTPUT:	1264	OUTPUT:
1050	RETVAL	1265	RETVAL
1051		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
1052	void	1288	void
1053	schedule(...)	1289	_set_state (char *data_)
1054	PROTOTYPE:	1290	PROTOTYPE: $
1055	ALIAS:
1056	cede = 1
1057	CODE:	1291	CODE:
1058	api_schedule (ix);	1292	{
		1293	struct io_state *data = (void *)data_;
1059		1294
		1295	errno = data->errorno;
		1296	PL_laststype = data->laststype;
		1297	PL_laststatval = data->laststatval;
		1298	PL_statcache = data->statcache;
		1299	}
		1300

Diff Legend

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