ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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