[ViewVC] Diff of: cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.39 by root, Sun Nov 25 20:04:05 2001 UTC vs.
Revision 1.195 by root, Sat Oct 6 00:35:41 2007 UTC

…		…
		1	#include "libcoro/coro.c"
		2
		3	#define PERL_NO_GET_CONTEXT
		4
1	#include "EXTERN.h"	5	#include "EXTERN.h"
2	#include "perl.h"	6	#include "perl.h"
3	#include "XSUB.h"	7	#include "XSUB.h"
4		8
5	#include "libcoro/coro.c"	9	#include "patchlevel.h"
6		10
7	#include <signal.h>	11	#include <stdio.h>
		12	#include <errno.h>
		13	#include <assert.h>
8		14
9	#ifdef HAVE_MMAP	15	#ifdef HAVE_MMAP
10	# include <unistd.h>	16	# include <unistd.h>
11	# include <sys/mman.h>	17	# include <sys/mman.h>
12	# ifndef MAP_ANONYMOUS	18	# ifndef MAP_ANONYMOUS
14	# define MAP_ANONYMOUS MAP_ANON	20	# define MAP_ANONYMOUS MAP_ANON
15	# else	21	# else
16	# undef HAVE_MMAP	22	# undef HAVE_MMAP
17	# endif	23	# endif
18	# endif	24	# endif
		25	# include <limits.h>
		26	# ifndef PAGESIZE
		27	# define PAGESIZE pagesize
		28	# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
		29	static long pagesize;
		30	# else
		31	# define BOOT_PAGESIZE (void)0
19	#endif	32	# endif
		33	#else
		34	# define PAGESIZE 0
		35	# define BOOT_PAGESIZE (void)0
		36	#endif
20		37
21	#define MAY_FLUSH /* increases codesize and is rarely used */	38	#if CORO_USE_VALGRIND
		39	# include <valgrind/valgrind.h>
		40	# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
		41	#else
		42	# define REGISTER_STACK(cctx,start,end)
		43	#endif
22		44
23	#define SUB_INIT "Coro::State::initialize"	45	/* the maximum number of idle cctx that will be pooled */
24	#define UCORO_STATE "_coro_state"	46	#define MAX_IDLE_CCTX 8
25		47
26	/* The next macro should declare a variable stacklevel that contains and approximation	48	#define PERL_VERSION_ATLEAST(a,b,c) \
27	* to the current C stack pointer. Its property is that it changes with each call	49	(PERL_REVISION > (a) \
28	* and should be unique. */	50	\|\| (PERL_REVISION == (a) \
		51	&& (PERL_VERSION > (b) \
		52	\|\| (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
		53
		54	#if !PERL_VERSION_ATLEAST (5,6,0)
		55	# ifndef PL_ppaddr
		56	# define PL_ppaddr ppaddr
		57	# endif
		58	# ifndef call_sv
		59	# define call_sv perl_call_sv
		60	# endif
		61	# ifndef get_sv
		62	# define get_sv perl_get_sv
		63	# endif
		64	# ifndef get_cv
		65	# define get_cv perl_get_cv
		66	# endif
		67	# ifndef IS_PADGV
		68	# define IS_PADGV(v) 0
		69	# endif
		70	# ifndef IS_PADCONST
		71	# define IS_PADCONST(v) 0
		72	# endif
		73	#endif
		74
		75	/* 5.8.7 */
		76	#ifndef SvRV_set
		77	# define SvRV_set(s,v) SvRV(s) = (v)
		78	#endif
		79
		80	/* 5.8.8 */
		81	#ifndef GV_NOTQUAL
		82	# define GV_NOTQUAL 0
		83	#endif
		84	#ifndef newSV
		85	# define newSV(l) NEWSV(0,l)
		86	#endif
		87
		88	#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
		89	# undef CORO_STACKGUARD
		90	#endif
		91
		92	#ifndef CORO_STACKGUARD
		93	# define CORO_STACKGUARD 0
		94	#endif
		95
		96	/* prefer perl internal functions over our own? */
		97	#ifndef CORO_PREFER_PERL_FUNCTIONS
		98	# define CORO_PREFER_PERL_FUNCTIONS 0
		99	#endif
		100
		101	/* The next macros try to return the current stack pointer, in an as
		102	* portable way as possible. */
		103	#define dSTACKLEVEL volatile char stacklevel
29	#define dSTACKLEVEL void *stacklevel = &stacklevel	104	#define STACKLEVEL ((void *)&stacklevel)
30		105
31	#define IN_DESTRUCT (PL_main_cv == Nullcv)	106	#define IN_DESTRUCT (PL_main_cv == Nullcv)
32		107
33	#define labs(l) ((l) >= 0 ? (l) : -(l))	108	#if __GNUC__ >= 3
		109	# define attribute(x) __attribute__(x)
		110	# define BARRIER __asm__ __volatile__ ("" : : : "memory")
		111	# define expect(expr,value) __builtin_expect ((expr),(value))
		112	#else
		113	# define attribute(x)
		114	# define BARRIER
		115	# define expect(expr,value) (expr)
		116	#endif
		117
		118	#define expect_false(expr) expect ((expr) != 0, 0)
		119	#define expect_true(expr) expect ((expr) != 0, 1)
		120
		121	#define NOINLINE attribute ((noinline))
34		122
35	#include "CoroAPI.h"	123	#include "CoroAPI.h"
36		124
		125	#ifdef USE_ITHREADS
		126	static perl_mutex coro_mutex;
		127	# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
		128	# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
		129	#else
		130	# define LOCK (void)0
		131	# define UNLOCK (void)0
		132	#endif
		133
		134	/* helper storage struct for Coro::AIO */
		135	struct io_state
		136	{
		137	int errorno;
		138	I32 laststype;
		139	int laststatval;
		140	Stat_t statcache;
		141	};
		142
		143	static size_t coro_stacksize = CORO_STACKSIZE;
37	static struct CoroAPI coroapi;	144	static struct CoroAPI coroapi;
		145	static AV main_mainstack; / used to differentiate between $main and others */
		146	static JMPENV *main_top_env;
		147	static HV coro_state_stash, coro_stash;
		148	static SV coro_mortal; / will be freed after next transfer */
38		149
39	/* this is actually not only the c stack but also c registers etc... */	150	static GV irsgv; / $/ */
		151	static GV stdoutgv; / STDOUT /
		152
		153	/* async_pool helper stuff */
		154	static SV *sv_pool_rss;
		155	static SV *sv_pool_size;
		156	static AV *av_async_pool;
		157
		158	static struct coro_cctx *cctx_first;
		159	static int cctx_count, cctx_idle;
		160
		161	enum {
		162	CC_MAPPED = 0x01,
		163	CC_NOREUSE = 0x02, /* throw this away after tracing */
		164	CC_TRACE = 0x04,
		165	CC_TRACE_SUB = 0x08, /* trace sub calls */
		166	CC_TRACE_LINE = 0x10, /* trace each statement */
		167	CC_TRACE_ALL = CC_TRACE_SUB \| CC_TRACE_LINE,
		168	};
		169
		170	/* this is a structure representing a c-level coroutine */
40	typedef struct {	171	typedef struct coro_cctx {
41	int refcnt; /* pointer reference counter */	172	struct coro_cctx *next;
42	int usecnt; /* shared by how many coroutines */
43	int gencnt; /* generation counter */
44		173
		174	/* the stack */
		175	void *sptr;
		176	size_t ssize;
		177
		178	/* cpu state */
		179	void idle_sp; / sp of top-level transfer/schedule/cede call */
		180	JMPENV idle_te; / same as idle_sp, but for top_env, TODO: remove once stable */
		181	JMPENV *top_env;
45	coro_context cctx;	182	coro_context cctx;
46		183
47	void *sptr;	184	#if CORO_USE_VALGRIND
48	long ssize; /* positive == mmap, otherwise malloc */	185	int valgrind_id;
49	} coro_stack;	186	#endif
		187	unsigned char flags;
		188	} coro_cctx;
50		189
		190	enum {
		191	CF_RUNNING = 0x0001, /* coroutine is running */
		192	CF_READY = 0x0002, /* coroutine is ready */
		193	CF_NEW = 0x0004, /* has never been switched to */
		194	CF_DESTROYED = 0x0008, /* coroutine data has been freed */
		195	};
		196
		197	/* this is a structure representing a perl-level coroutine */
51	struct coro {	198	struct coro {
52	/* the optional C context */	199	/* the c coroutine allocated to this perl coroutine, if any */
53	coro_stack *stack;	200	coro_cctx *cctx;
54	void *cursp;
55	int gencnt;
56
57	/* optionally saved, might be zero */
58	AV *defav;
59	SV *defsv;
60	SV *errsv;
61	/* TODO: PL_pmop might be nice && effortless to save. */
62
63	/* saved global state not related to stacks */
64	U8 dowarn;
65	I32 in_eval;
66
67	/* the stacks and related info (callchain etc..) */
68	PERL_SI *curstackinfo;
69	AV *curstack;
70	AV *mainstack;
71	SV **stack_sp;
72	OP *op;
73	SV **curpad;
74	SV **stack_base;
75	SV **stack_max;
76	SV **tmps_stack;
77	I32 tmps_floor;
78	I32 tmps_ix;
79	I32 tmps_max;
80	I32 *markstack;
81	I32 *markstack_ptr;
82	I32 *markstack_max;
83	I32 *scopestack;
84	I32 scopestack_ix;
85	I32 scopestack_max;
86	ANY *savestack;
87	I32 savestack_ix;
88	I32 savestack_max;
89	OP **retstack;
90	I32 retstack_ix;
91	I32 retstack_max;
92	COP *curcop;
93	JMPENV *top_env;
94		201
95	/* data associated with this coroutine (initial args) */	202	/* data associated with this coroutine (initial args) */
96	AV *args;	203	AV *args;
		204	int refcnt;
		205	int flags; /* CF_ flags */
		206
		207	/* optionally saved, might be zero */
		208	AV defav; / @_ */
		209	SV defsv; / $_ */
		210	SV errsv; / $@ */
		211	SV deffh; / default filehandle */
		212	SV irssv; / $/ */
		213	SV irssv_sv; / real $/ cache */
		214
		215	#define VAR(name,type) type name;
		216	# include "state.h"
		217	#undef VAR
		218
		219	/* statistics */
		220	int usecount; /* number of transfers to this coro */
		221
		222	/* coro process data */
		223	int prio;
		224	//SV *throw;
		225
		226	/* async_pool */
		227	SV *saved_deffh;
		228
		229	/* linked list */
		230	struct coro next, prev;
		231	HV hv; / the perl hash associated with this coro, if any */
97	};	232	};
98		233
99	typedef struct coro *Coro__State;	234	typedef struct coro *Coro__State;
100	typedef struct coro *Coro__State_or_hashref;	235	typedef struct coro *Coro__State_or_hashref;
101
102	static AV main_mainstack; / used to differentiate between $main and others */
103	static HV *coro_state_stash;
104	static SV *ucoro_state_sv;
105	static U32 ucoro_state_hash;
106	static HV *padlist_cache;
107	static SV coro_mortal; / will be freed after next transfer */
108
109	/* mostly copied from op.c:cv_clone2 */
110	STATIC AV *
111	clone_padlist (AV *protopadlist)
112	{
113	AV *av;
114	I32 ix;
115	AV protopad_name = (AV ) * av_fetch (protopadlist, 0, FALSE);
116	AV protopad = (AV ) * av_fetch (protopadlist, 1, FALSE);
117	SV **pname = AvARRAY (protopad_name);
118	SV **ppad = AvARRAY (protopad);
119	I32 fname = AvFILLp (protopad_name);
120	I32 fpad = AvFILLp (protopad);
121	AV newpadlist, newpad_name, *newpad;
122	SV **npad;
123
124	newpad_name = newAV ();
125	for (ix = fname; ix >= 0; ix--)
126	av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
127
128	newpad = newAV ();
129	av_fill (newpad, AvFILLp (protopad));
130	npad = AvARRAY (newpad);
131
132	newpadlist = newAV ();
133	AvREAL_off (newpadlist);
134	av_store (newpadlist, 0, (SV *) newpad_name);
135	av_store (newpadlist, 1, (SV *) newpad);
136
137	av = newAV (); /* will be @_ */
138	av_extend (av, 0);
139	av_store (newpad, 0, (SV *) av);
140	AvFLAGS (av) = AVf_REIFY;
141
142	for (ix = fpad; ix > 0; ix--)
143	{
144	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
145	if (namesv && namesv != &PL_sv_undef)
146	{
147	char name = SvPVX (namesv); / XXX */
148	if (SvFLAGS (namesv) & SVf_FAKE \|\| *name == '&')
149	{ /* lexical from outside? */
150	npad[ix] = SvREFCNT_inc (ppad[ix]);
151	}
152	else
153	{ /* our own lexical */
154	SV *sv;
155	if (*name == '&')
156	sv = SvREFCNT_inc (ppad[ix]);
157	else if (*name == '@')
158	sv = (SV *) newAV ();
159	else if (*name == '%')
160	sv = (SV *) newHV ();
161	else
162	sv = NEWSV (0, 0);
163	if (!SvPADBUSY (sv))
164	SvPADMY_on (sv);
165	npad[ix] = sv;
166	}
167	}
168	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))
169	{
170	npad[ix] = SvREFCNT_inc (ppad[ix]);
171	}
172	else
173	{
174	SV *sv = NEWSV (0, 0);
175	SvPADTMP_on (sv);
176	npad[ix] = sv;
177	}
178	}
179
180	#if 0 /* return -ENOTUNDERSTOOD */
181	/* Now that vars are all in place, clone nested closures. */
182
183	for (ix = fpad; ix > 0; ix--) {
184	SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
185	if (namesv
186	&& namesv != &PL_sv_undef
187	&& !(SvFLAGS(namesv) & SVf_FAKE)
188	&& *SvPVX(namesv) == '&'
189	&& CvCLONE(ppad[ix]))
190	{
191	CV kid = cv_clone((CV)ppad[ix]);
192	SvREFCNT_dec(ppad[ix]);
193	CvCLONE_on(kid);
194	SvPADMY_on(kid);
195	npad[ix] = (SV*)kid;
196	}
197	}
198	#endif
199
200	return newpadlist;
201	}
202
203	#ifdef MAY_FLUSH
204	STATIC void
205	free_padlist (AV *padlist)
206	{
207	/* may be during global destruction */
208	if (SvREFCNT(padlist))
209	{
210	I32 i = AvFILLp(padlist);
211	while (i >= 0)
212	{
213	SV **svp = av_fetch(padlist, i--, FALSE);
214	SV sv = svp ? svp : Nullsv;
215	if (sv)
216	SvREFCNT_dec(sv);
217	}
218
219	SvREFCNT_dec((SV*)padlist);
220	}
221	}
222	#endif
223
224	/* the next two functions merely cache the padlists */
225	STATIC void
226	get_padlist (CV *cv)
227	{
228	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 0);
229
230	if (he && AvFILLp ((AV )he) >= 0)
231	CvPADLIST (cv) = (AV )av_pop ((AV )*he);
232	else
233	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
234	}
235
236	STATIC void
237	put_padlist (CV *cv)
238	{
239	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 1);
240
241	if (SvTYPE (*he) != SVt_PVAV)
242	{
243	SvREFCNT_dec (*he);
244	he = (SV )newAV ();
245	}
246
247	av_push ((AV )he, (SV *)CvPADLIST (cv));
248	}
249
250	#ifdef MAY_FLUSH
251	STATIC void
252	flush_padlist_cache ()
253	{
254	HV *hv = padlist_cache;
255	padlist_cache = newHV ();
256
257	if (hv_iterinit (hv))
258	{
259	HE *he;
260	AV *padlist;
261
262	while (!!(he = hv_iternext (hv)))
263	{
264	AV av = (AV )HeVAL(he);
265
266	/* casting is fun. */
267	while (&PL_sv_undef != (SV )(padlist = (AV )av_pop (av)))
268	free_padlist (padlist);
269	}
270	}
271
272	SvREFCNT_dec (hv);
273	}
274	#endif
275
276	#define SB do {
277	#define SE } while (0)
278
279	#define LOAD(state) load_state(aTHX_ (state));
280	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
281
282	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
283
284	static void
285	load_state(pTHX_ Coro__State c)
286	{
287	PL_dowarn = c->dowarn;
288	PL_in_eval = c->in_eval;
289
290	PL_curstackinfo = c->curstackinfo;
291	PL_curstack = c->curstack;
292	PL_mainstack = c->mainstack;
293	PL_stack_sp = c->stack_sp;
294	PL_op = c->op;
295	PL_curpad = c->curpad;
296	PL_stack_base = c->stack_base;
297	PL_stack_max = c->stack_max;
298	PL_tmps_stack = c->tmps_stack;
299	PL_tmps_floor = c->tmps_floor;
300	PL_tmps_ix = c->tmps_ix;
301	PL_tmps_max = c->tmps_max;
302	PL_markstack = c->markstack;
303	PL_markstack_ptr = c->markstack_ptr;
304	PL_markstack_max = c->markstack_max;
305	PL_scopestack = c->scopestack;
306	PL_scopestack_ix = c->scopestack_ix;
307	PL_scopestack_max = c->scopestack_max;
308	PL_savestack = c->savestack;
309	PL_savestack_ix = c->savestack_ix;
310	PL_savestack_max = c->savestack_max;
311	PL_retstack = c->retstack;
312	PL_retstack_ix = c->retstack_ix;
313	PL_retstack_max = c->retstack_max;
314	PL_curcop = c->curcop;
315	PL_top_env = c->top_env;
316
317	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
318	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
319	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
320
321	{
322	dSP;
323	CV *cv;
324
325	/* now do the ugly restore mess */
326	while ((cv = (CV *)POPs))
327	{
328	AV padlist = (AV )POPs;
329
330	if (padlist)
331	{
332	put_padlist (cv); /* mark this padlist as available */
333	CvPADLIST(cv) = padlist;
334	#ifdef USE_THREADS
335	/CvOWNER(cv) = (struct perl_thread )POPs;*/
336	#endif
337	}
338
339	++CvDEPTH(cv);
340	}
341
342	PUTBACK;
343	}
344	}
345
346	static void
347	save_state(pTHX_ Coro__State c, int flags)
348	{
349	{
350	dSP;
351	I32 cxix = cxstack_ix;
352	PERL_CONTEXT *ccstk = cxstack;
353	PERL_SI *top_si = PL_curstackinfo;
354
355	/*
356	* the worst thing you can imagine happens first - we have to save
357	* (and reinitialize) all cv's in the whole callchain :(
358	*/
359
360	PUSHs (Nullsv);
361	/* this loop was inspired by pp_caller */
362	for (;;)
363	{
364	while (cxix >= 0)
365	{
366	PERL_CONTEXT *cx = &ccstk[cxix--];
367
368	if (CxTYPE(cx) == CXt_SUB)
369	{
370	CV *cv = cx->blk_sub.cv;
371	if (CvDEPTH(cv))
372	{
373	#ifdef USE_THREADS
374	/XPUSHs ((SV )CvOWNER(cv));*/
375	/CvOWNER(cv) = 0;/
376	/error must unlock this cv etc.. etc.../
377	#endif
378	EXTEND (SP, CvDEPTH(cv)*2);
379
380	while (--CvDEPTH(cv))
381	{
382	/* this tells the restore code to increment CvDEPTH */
383	PUSHs (Nullsv);
384	PUSHs ((SV *)cv);
385	}
386
387	PUSHs ((SV *)CvPADLIST(cv));
388	PUSHs ((SV *)cv);
389
390	get_padlist (cv); /* this is a monster */
391	}
392	}
393	else if (CxTYPE(cx) == CXt_FORMAT)
394	{
395	/* I never used formats, so how should I know how these are implemented? */
396	/* my bold guess is as a simple, plain sub... */
397	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
398	}
399	}
400
401	if (top_si->si_type == PERLSI_MAIN)
402	break;
403
404	top_si = top_si->si_prev;
405	ccstk = top_si->si_cxstack;
406	cxix = top_si->si_cxix;
407	}
408
409	PUTBACK;
410	}
411
412	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
413	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
414	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
415
416	c->dowarn = PL_dowarn;
417	c->in_eval = PL_in_eval;
418
419	c->curstackinfo = PL_curstackinfo;
420	c->curstack = PL_curstack;
421	c->mainstack = PL_mainstack;
422	c->stack_sp = PL_stack_sp;
423	c->op = PL_op;
424	c->curpad = PL_curpad;
425	c->stack_base = PL_stack_base;
426	c->stack_max = PL_stack_max;
427	c->tmps_stack = PL_tmps_stack;
428	c->tmps_floor = PL_tmps_floor;
429	c->tmps_ix = PL_tmps_ix;
430	c->tmps_max = PL_tmps_max;
431	c->markstack = PL_markstack;
432	c->markstack_ptr = PL_markstack_ptr;
433	c->markstack_max = PL_markstack_max;
434	c->scopestack = PL_scopestack;
435	c->scopestack_ix = PL_scopestack_ix;
436	c->scopestack_max = PL_scopestack_max;
437	c->savestack = PL_savestack;
438	c->savestack_ix = PL_savestack_ix;
439	c->savestack_max = PL_savestack_max;
440	c->retstack = PL_retstack;
441	c->retstack_ix = PL_retstack_ix;
442	c->retstack_max = PL_retstack_max;
443	c->curcop = PL_curcop;
444	c->top_env = PL_top_env;
445	}
446
447	/*
448	* allocate various perl stacks. This is an exact copy
449	* of perl.c:init_stacks, except that it uses less memory
450	* on the assumption that coroutines do not usually need
451	* a lot of stackspace.
452	*/
453	STATIC void
454	coro_init_stacks (pTHX)
455	{
456	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
457	PL_curstackinfo->si_type = PERLSI_MAIN;
458	PL_curstack = PL_curstackinfo->si_stack;
459	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
460
461	PL_stack_base = AvARRAY(PL_curstack);
462	PL_stack_sp = PL_stack_base;
463	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
464
465	New(50,PL_tmps_stack,96,SV*);
466	PL_tmps_floor = -1;
467	PL_tmps_ix = -1;
468	PL_tmps_max = 96;
469
470	New(54,PL_markstack,16,I32);
471	PL_markstack_ptr = PL_markstack;
472	PL_markstack_max = PL_markstack + 16;
473
474	SET_MARK_OFFSET;
475
476	New(54,PL_scopestack,16,I32);
477	PL_scopestack_ix = 0;
478	PL_scopestack_max = 16;
479
480	New(54,PL_savestack,96,ANY);
481	PL_savestack_ix = 0;
482	PL_savestack_max = 96;
483
484	New(54,PL_retstack,8,OP*);
485	PL_retstack_ix = 0;
486	PL_retstack_max = 8;
487	}
488
489	/*
490	* destroy the stacks, the callchain etc...
491	* still there is a memleak of 128 bytes...
492	*/
493	STATIC void
494	destroy_stacks(pTHX)
495	{
496	if (!IN_DESTRUCT)
497	{
498	/* is this ugly, I ask? */
499	while (PL_scopestack_ix)
500	LEAVE;
501
502	/* 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;
505	}
506
507	while (PL_curstackinfo->si_next)
508	PL_curstackinfo = PL_curstackinfo->si_next;
509
510	while (PL_curstackinfo)
511	{
512	PERL_SI *p = PL_curstackinfo->si_prev;
513
514	{
515	dSP;
516	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
517	PUTBACK; /* possibly superfluous */
518	}
519
520	if (!IN_DESTRUCT)
521	{
522	dounwind(-1);
523	SvREFCNT_dec(PL_curstackinfo->si_stack);
524	}
525
526	Safefree(PL_curstackinfo->si_cxstack);
527	Safefree(PL_curstackinfo);
528	PL_curstackinfo = p;
529	}
530
531	Safefree(PL_tmps_stack);
532	Safefree(PL_markstack);
533	Safefree(PL_scopestack);
534	Safefree(PL_savestack);
535	Safefree(PL_retstack);
536	}
537
538	static void
539	allocate_stack (Coro__State ctx, int alloc)
540	{
541	coro_stack *stack;
542
543	New (0, stack, 1, coro_stack);
544
545	stack->refcnt = 1;
546	stack->usecnt = 1;
547	stack->gencnt = ctx->gencnt = 0;
548	if (alloc)
549	{
550	#if HAVE_MMAP
551	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
552	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
553	if (stack->sptr == (void *)-1)
554	#endif
555	{
556	/FIXME//D//* reasonable stack size! */
557	stack->ssize = -4096 * sizeof (long);
558	New (0, stack->sptr, 4096, long);
559	}
560	}
561	else
562	stack->sptr = 0;
563
564	ctx->stack = stack;
565	}
566
567	static void
568	deallocate_stack (Coro__State ctx)
569	{
570	coro_stack *stack = ctx->stack;
571
572	ctx->stack = 0;
573
574	if (stack)
575	{
576	if (!--stack->refcnt)
577	{
578	#ifdef HAVE_MMAP
579	if (stack->ssize > 0 && stack->sptr)
580	munmap (stack->sptr, stack->ssize);
581	else
582	#else
583	Safefree (stack->sptr);
584	#endif
585	Safefree (stack);
586	}
587	else if (ctx->gencnt == stack->gencnt)
588	--stack->usecnt;
589	}
590	}
591
592	static void
593	setup_coro (void *arg)
594	{
595	/*
596	* emulate part of the perl startup here.
597	*/
598	dSP;
599	Coro__State ctx = (Coro__State)arg;
600	SV sub_init = (SV)get_cv(SUB_INIT, FALSE);
601
602	coro_init_stacks (aTHX);
603	/PL_curcop = 0;/
604	/PL_in_eval = PL_in_eval;/ /* inherit */
605	SvREFCNT_dec (GvAV (PL_defgv));
606	GvAV (PL_defgv) = ctx->args;
607
608	SPAGAIN;
609
610	if (ctx->stack)
611	{
612	ctx->cursp = 0;
613
614	PUSHMARK(SP);
615	PUTBACK;
616	(void) call_sv (sub_init, G_VOID\|G_NOARGS\|G_EVAL);
617
618	if (SvTRUE (ERRSV))
619	croak (NULL);
620	else
621	croak ("FATAL: CCTXT coroutine returned!");
622	}
623	else
624	{
625	UNOP myop;
626
627	PL_op = (OP *)&myop;
628
629	Zero(&myop, 1, UNOP);
630	myop.op_next = Nullop;
631	myop.op_flags = OPf_WANT_VOID;
632
633	PUSHMARK(SP);
634	XPUSHs (sub_init);
635	/*
636	* the next line is slightly wrong, as PL_op->op_next
637	* is actually being executed so we skip the first op.
638	* that doesn't matter, though, since it is only
639	* pp_nextstate and we never return...
640	* ah yes, and I don't care anyways ;)
641	*/
642	PUTBACK;
643	PL_op = pp_entersub();
644	SPAGAIN;
645
646	ENTER; /* necessary e.g. for dounwind */
647	}
648	}
649
650	static void
651	continue_coro (void *arg)
652	{
653	/*
654	* this is a _very_ stripped down perl interpreter ;)
655	*/
656	Coro__State ctx = (Coro__State)arg;
657	JMPENV coro_start_env;
658
659	/* same as JMPENV_BOOTSTRAP */
660	Zero(&coro_start_env, 1, JMPENV);
661	coro_start_env.je_ret = -1;
662	coro_start_env.je_mustcatch = TRUE;
663	PL_top_env = &coro_start_env;
664
665	ctx->cursp = 0;
666	PL_op = PL_op->op_next;
667	CALLRUNOPS(aTHX);
668
669	abort ();
670	}
671
672	STATIC void
673	transfer(pTHX_ struct coro prev, struct coro next, int flags)
674	{
675	dSTACKLEVEL;
676	static struct coro *xnext;
677
678	if (prev != next)
679	{
680	xnext = next;
681
682	if (next->mainstack)
683	{
684	SAVE (prev, flags);
685	LOAD (next);
686
687	/* mark this state as in-use */
688	next->mainstack = 0;
689	next->tmps_ix = -2;
690
691	/* stacklevel changed? if yes, grab the stack for us! */
692	if (flags & TRANSFER_SAVE_CCTXT)
693	{
694	if (!prev->stack)
695	allocate_stack (prev, 0);
696	else if (prev->cursp != stacklevel
697	&& prev->stack->usecnt > 1)
698	{
699	prev->gencnt = ++prev->stack->gencnt;
700	prev->stack->usecnt = 1;
701	}
702
703	/* has our stack been invalidated? */
704	if (next->stack && next->stack->gencnt != next->gencnt)
705	{
706	deallocate_stack (next);
707	allocate_stack (next, 1);
708	coro_create (&(next->stack->cctx),
709	continue_coro, (void *)next,
710	next->stack->sptr, labs (next->stack->ssize));
711	}
712
713	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
714	/* don't add any code here */
715	}
716
717	}
718	else if (next->tmps_ix == -2)
719	croak ("tried to transfer to running coroutine");
720	else
721	{
722	SAVE (prev, -1); /* first get rid of the old state */
723
724	if (flags & TRANSFER_SAVE_CCTXT)
725	{
726	if (!prev->stack)
727	allocate_stack (prev, 0);
728
729	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
730	{
731	setup_coro (next);
732
733	prev->stack->refcnt++;
734	prev->stack->usecnt++;
735	next->stack = prev->stack;
736	next->gencnt = prev->gencnt;
737	}
738	else
739	{
740	allocate_stack (next, 1);
741	coro_create (&(next->stack->cctx),
742	setup_coro, (void *)next,
743	next->stack->sptr, labs (next->stack->ssize));
744	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
745	/* don't add any code here */
746	}
747	}
748	else
749	setup_coro (next);
750	}
751
752	/*
753	* xnext is now either prev or next, depending on wether
754	* we switched the c stack or not. that's why i use a global
755	* variable, that should become thread-specific at one point.
756	*/
757	xnext->cursp = stacklevel;
758	}
759
760	if (coro_mortal)
761	{
762	SvREFCNT_dec (coro_mortal);
763	coro_mortal = 0;
764	}
765	}
766
767	#define SV_CORO(sv,func) \
768	do { \
769	if (SvROK (sv)) \
770	sv = SvRV (sv); \
771	\
772	if (SvTYPE(sv) == SVt_PVHV) \
773	{ \
774	HE he = hv_fetch_ent((HV )sv, ucoro_state_sv, 0, ucoro_state_hash); \
775	\
776	if (!he) \
777	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
778	\
779	(sv) = SvRV (HeVAL(he)); \
780	} \
781	\
782	/* must also be changed inside Coro::Cont::yield */ \
783	if (!SvOBJECT(sv) \|\| SvSTASH(sv) != coro_state_stash) \
784	croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
785	\
786	} while(0)
787
788	#define SvSTATE(sv) (struct coro *)SvIV (sv)
789
790	static void
791	api_transfer(pTHX_ SV prev, SV next, int flags)
792	{
793	SV_CORO (prev, "Coro::transfer");
794	SV_CORO (next, "Coro::transfer");
795
796	transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags);
797	}
798		236
799	/ Coro ******************************************************************/	237	/ Coro ******************************************************************/
800		238
801	#define PRIO_MAX 3	239	#define PRIO_MAX 3
802	#define PRIO_HIGH 1	240	#define PRIO_HIGH 1
…		…
804	#define PRIO_LOW -1	242	#define PRIO_LOW -1
805	#define PRIO_IDLE -3	243	#define PRIO_IDLE -3
806	#define PRIO_MIN -4	244	#define PRIO_MIN -4
807		245
808	/* for Coro.pm */	246	/* for Coro.pm */
809	static GV coro_current, coro_idle;	247	static SV *coro_current;
810	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];	248	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
811	static int coro_nready;	249	static int coro_nready;
		250	static struct coro *coro_first;
812		251
		252	/ lowlevel stuff ********************************************************/
		253
		254	static AV *
		255	coro_clone_padlist (pTHX_ CV *cv)
		256	{
		257	AV *padlist = CvPADLIST (cv);
		258	AV newpadlist, newpad;
		259
		260	newpadlist = newAV ();
		261	AvREAL_off (newpadlist);
		262	#if PERL_VERSION_ATLEAST (5,9,0)
		263	Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
		264	#else
		265	Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
		266	#endif
		267	newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
		268	--AvFILLp (padlist);
		269
		270	av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
		271	av_store (newpadlist, 1, (SV *)newpad);
		272
		273	return newpadlist;
		274	}
		275
		276	static void
		277	free_padlist (pTHX_ AV *padlist)
		278	{
		279	/* may be during global destruction */
		280	if (SvREFCNT (padlist))
		281	{
		282	I32 i = AvFILLp (padlist);
		283	while (i >= 0)
		284	{
		285	SV **svp = av_fetch (padlist, i--, FALSE);
		286	if (svp)
		287	{
		288	SV *sv;
		289	while (&PL_sv_undef != (sv = av_pop ((AV )svp)))
		290	SvREFCNT_dec (sv);
		291
		292	SvREFCNT_dec (*svp);
		293	}
		294	}
		295
		296	SvREFCNT_dec ((SV*)padlist);
		297	}
		298	}
		299
813	static void	300	static int
814	coro_enq (SV *sv)	301	coro_cv_free (pTHX_ SV sv, MAGIC mg)
815	{	302	{
816	if (SvTYPE (sv) == SVt_PVHV)	303	AV *padlist;
		304	AV av = (AV )mg->mg_obj;
		305
		306	/* casting is fun. */
		307	while (&PL_sv_undef != (SV )(padlist = (AV )av_pop (av)))
		308	free_padlist (aTHX_ padlist);
		309
		310	SvREFCNT_dec (av);
		311
		312	return 0;
		313	}
		314
		315	#define PERL_MAGIC_coro PERL_MAGIC_ext
		316
		317	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
		318
		319	#define CORO_MAGIC(cv) \
		320	SvMAGIC (cv) \
		321	? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
		322	? SvMAGIC (cv) \
		323	: mg_find ((SV *)cv, PERL_MAGIC_coro) \
		324	: 0
		325
		326	static struct coro *
		327	SvSTATE_ (pTHX_ SV *coro)
		328	{
		329	HV *stash;
		330	MAGIC *mg;
		331
		332	if (SvROK (coro))
		333	coro = SvRV (coro);
		334
		335	if (expect_false (SvTYPE (coro) != SVt_PVHV))
		336	croak ("Coro::State object required");
		337
		338	stash = SvSTASH (coro);
		339	if (expect_false (stash != coro_stash && stash != coro_state_stash))
		340	{
		341	/* very slow, but rare, check */
		342	if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
		343	croak ("Coro::State object required");
		344	}
		345
		346	mg = CORO_MAGIC (coro);
		347	return (struct coro *)mg->mg_ptr;
		348	}
		349
		350	#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
		351
		352	/* the next two functions merely cache the padlists */
		353	static void
		354	get_padlist (pTHX_ CV *cv)
		355	{
		356	MAGIC *mg = CORO_MAGIC (cv);
		357	AV *av;
		358
		359	if (expect_true (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0))
		360	CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
		361	else
817	{	362	{
818	SV *xprio = hv_fetch ((HV )sv, "prio", 4, 0);	363	#if CORO_PREFER_PERL_FUNCTIONS
819	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;	364	/* this is probably cleaner, but also slower? */
		365	CV *cp = Perl_cv_clone (cv);
		366	CvPADLIST (cv) = CvPADLIST (cp);
		367	CvPADLIST (cp) = 0;
		368	SvREFCNT_dec (cp);
		369	#else
		370	CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
		371	#endif
		372	}
		373	}
820		374
821	prio = prio > PRIO_MAX ? PRIO_MAX	375	static void
822	: prio < PRIO_MIN ? PRIO_MIN	376	put_padlist (pTHX_ CV *cv)
823	: prio;	377	{
		378	MAGIC *mg = CORO_MAGIC (cv);
		379	AV *av;
824		380
825	av_push (coro_ready [prio - PRIO_MIN], sv);	381	if (expect_false (!mg))
826	coro_nready++;	382	{
		383	sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
		384	mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
		385	mg->mg_virtual = &vtbl_coro;
		386	mg->mg_obj = (SV *)newAV ();
		387	}
827		388
		389	av = (AV *)mg->mg_obj;
		390
		391	if (expect_false (AvFILLp (av) >= AvMAX (av)))
		392	av_extend (av, AvMAX (av) + 1);
		393
		394	AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
		395	}
		396
		397	/ load & save, init *****************************************************/
		398
		399	static void
		400	load_perl (pTHX_ Coro__State c)
		401	{
		402	#define VAR(name,type) PL_ ## name = c->name;
		403	# include "state.h"
		404	#undef VAR
		405
		406	GvSV (PL_defgv) = c->defsv;
		407	GvAV (PL_defgv) = c->defav;
		408	GvSV (PL_errgv) = c->errsv;
		409	GvSV (irsgv) = c->irssv_sv;
		410
		411	{
		412	dSP;
		413	CV *cv;
		414
		415	/* now do the ugly restore mess */
		416	while (expect_true (cv = (CV *)POPs))
		417	{
		418	put_padlist (aTHX_ cv); /* mark this padlist as available */
		419	CvDEPTH (cv) = PTR2IV (POPs);
		420	CvPADLIST (cv) = (AV *)POPs;
		421	}
		422
		423	PUTBACK;
		424	}
		425	}
		426
		427	static void
		428	save_perl (pTHX_ Coro__State c)
		429	{
		430	{
		431	dSP;
		432	I32 cxix = cxstack_ix;
		433	PERL_CONTEXT *ccstk = cxstack;
		434	PERL_SI *top_si = PL_curstackinfo;
		435
		436	/*
		437	* the worst thing you can imagine happens first - we have to save
		438	* (and reinitialize) all cv's in the whole callchain :(
		439	*/
		440
		441	XPUSHs (Nullsv);
		442	/* this loop was inspired by pp_caller */
		443	for (;;)
		444	{
		445	while (expect_true (cxix >= 0))
		446	{
		447	PERL_CONTEXT *cx = &ccstk[cxix--];
		448
		449	if (expect_true (CxTYPE (cx) == CXt_SUB \|\| CxTYPE (cx) == CXt_FORMAT))
		450	{
		451	CV *cv = cx->blk_sub.cv;
		452
		453	if (expect_true (CvDEPTH (cv)))
		454	{
		455	EXTEND (SP, 3);
		456	PUSHs ((SV *)CvPADLIST (cv));
		457	PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
		458	PUSHs ((SV *)cv);
		459
		460	CvDEPTH (cv) = 0;
		461	get_padlist (aTHX_ cv);
		462	}
		463	}
		464	}
		465
		466	if (expect_true (top_si->si_type == PERLSI_MAIN))
		467	break;
		468
		469	top_si = top_si->si_prev;
		470	ccstk = top_si->si_cxstack;
		471	cxix = top_si->si_cxix;
		472	}
		473
		474	PUTBACK;
		475	}
		476
		477	c->defav = GvAV (PL_defgv);
		478	c->defsv = DEFSV;
		479	c->errsv = ERRSV;
		480	c->irssv_sv = GvSV (irsgv);
		481
		482	#define VAR(name,type)c->name = PL_ ## name;
		483	# include "state.h"
		484	#undef VAR
		485	}
		486
		487	/*
		488	* allocate various perl stacks. This is an exact copy
		489	* of perl.c:init_stacks, except that it uses less memory
		490	* on the (sometimes correct) assumption that coroutines do
		491	* not usually need a lot of stackspace.
		492	*/
		493	#if CORO_PREFER_PERL_FUNCTIONS
		494	# define coro_init_stacks init_stacks
		495	#else
		496	static void
		497	coro_init_stacks (pTHX)
		498	{
		499	PL_curstackinfo = new_stackinfo(64, 6);
		500	PL_curstackinfo->si_type = PERLSI_MAIN;
		501	PL_curstack = PL_curstackinfo->si_stack;
		502	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
		503
		504	PL_stack_base = AvARRAY(PL_curstack);
		505	PL_stack_sp = PL_stack_base;
		506	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
		507
		508	New(50,PL_tmps_stack,64,SV*);
		509	PL_tmps_floor = -1;
		510	PL_tmps_ix = -1;
		511	PL_tmps_max = 64;
		512
		513	New(54,PL_markstack,16,I32);
		514	PL_markstack_ptr = PL_markstack;
		515	PL_markstack_max = PL_markstack + 16;
		516
		517	#ifdef SET_MARK_OFFSET
		518	SET_MARK_OFFSET;
		519	#endif
		520
		521	New(54,PL_scopestack,16,I32);
		522	PL_scopestack_ix = 0;
		523	PL_scopestack_max = 16;
		524
		525	New(54,PL_savestack,64,ANY);
		526	PL_savestack_ix = 0;
		527	PL_savestack_max = 64;
		528
		529	#if !PERL_VERSION_ATLEAST (5,9,0)
		530	New(54,PL_retstack,4,OP*);
		531	PL_retstack_ix = 0;
		532	PL_retstack_max = 4;
		533	#endif
		534	}
		535	#endif
		536
		537	/*
		538	* destroy the stacks, the callchain etc...
		539	*/
		540	static void
		541	coro_destroy_stacks (pTHX)
		542	{
		543	while (PL_curstackinfo->si_next)
		544	PL_curstackinfo = PL_curstackinfo->si_next;
		545
		546	while (PL_curstackinfo)
		547	{
		548	PERL_SI *p = PL_curstackinfo->si_prev;
		549
		550	if (!IN_DESTRUCT)
		551	SvREFCNT_dec (PL_curstackinfo->si_stack);
		552
		553	Safefree (PL_curstackinfo->si_cxstack);
		554	Safefree (PL_curstackinfo);
		555	PL_curstackinfo = p;
		556	}
		557
		558	Safefree (PL_tmps_stack);
		559	Safefree (PL_markstack);
		560	Safefree (PL_scopestack);
		561	Safefree (PL_savestack);
		562	#if !PERL_VERSION_ATLEAST (5,9,0)
		563	Safefree (PL_retstack);
		564	#endif
		565	}
		566
		567	static size_t
		568	coro_rss (pTHX_ struct coro *coro)
		569	{
		570	size_t rss = sizeof (*coro);
		571
		572	if (coro->mainstack)
		573	{
		574	if (coro->flags & CF_RUNNING)
		575	{
		576	#define VAR(name,type)coro->name = PL_ ## name;
		577	# include "state.h"
		578	#undef VAR
		579	}
		580
		581	rss += sizeof (coro->curstackinfo);
		582	rss += sizeof (SV) + sizeof (struct xpvav) + (1 + AvFILL (coro->curstackinfo->si_stack)) * sizeof (SV *);
		583	rss += (coro->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT);
		584	rss += sizeof (SV) + sizeof (struct xpvav) + (1 + AvFILL (coro->curstack)) * sizeof (SV *);
		585	rss += coro->tmps_max * sizeof (SV *);
		586	rss += (coro->markstack_max - coro->markstack_ptr) * sizeof (I32);
		587	rss += coro->scopestack_max * sizeof (I32);
		588	rss += coro->savestack_max * sizeof (ANY);
		589
		590	#if !PERL_VERSION_ATLEAST (5,9,0)
		591	rss += coro->retstack_max * sizeof (OP *);
		592	#endif
		593	}
		594
		595	return rss;
		596	}
		597
		598	/ coroutine stack handling **********************************************/
		599
		600	static void
		601	coro_setup (pTHX_ struct coro *coro)
		602	{
		603	/*
		604	* emulate part of the perl startup here.
		605	*/
		606	coro_init_stacks (aTHX);
		607
		608	PL_runops = RUNOPS_DEFAULT;
		609	PL_curcop = &PL_compiling;
		610	PL_in_eval = EVAL_NULL;
		611	PL_comppad = 0;
		612	PL_curpm = 0;
		613	PL_curpad = 1;
		614	PL_localizing = 0;
		615	PL_dirty = 0;
		616	PL_restartop = 0;
		617
		618	GvSV (PL_defgv) = newSV (0);
		619	GvAV (PL_defgv) = coro->args; coro->args = 0;
		620	GvSV (PL_errgv) = newSV (0);
		621	GvSV (irsgv) = newSVpvn ("\n", 1); sv_magic (GvSV (irsgv), (SV *)irsgv, PERL_MAGIC_sv, "/", 0);
		622	PL_rs = newSVsv (GvSV (irsgv));
		623	PL_defoutgv = SvREFCNT_inc (stdoutgv);
		624
		625	{
		626	dSP;
		627	LOGOP myop;
		628
		629	Zero (&myop, 1, LOGOP);
		630	myop.op_next = Nullop;
		631	myop.op_flags = OPf_WANT_VOID;
		632
		633	PUSHMARK (SP);
		634	XPUSHs (sv_2mortal (av_shift (GvAV (PL_defgv))));
		635	PUTBACK;
		636	PL_op = (OP *)&myop;
		637	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		638	SPAGAIN;
		639	}
		640
		641	ENTER; /* necessary e.g. for dounwind and to balance the xsub-entersub */
		642	}
		643
		644	static void
		645	coro_destroy (pTHX_ struct coro *coro)
		646	{
		647	if (!IN_DESTRUCT)
		648	{
		649	/* restore all saved variables and stuff */
		650	LEAVE_SCOPE (0);
		651	assert (PL_tmps_floor == -1);
		652
		653	/* free all temporaries */
		654	FREETMPS;
		655	assert (PL_tmps_ix == -1);
		656
		657	/* unwind all extra stacks */
		658	POPSTACK_TO (PL_mainstack);
		659
		660	/* unwind main stack */
		661	dounwind (-1);
		662	}
		663
		664	SvREFCNT_dec (GvSV (PL_defgv));
		665	SvREFCNT_dec (GvAV (PL_defgv));
		666	SvREFCNT_dec (GvSV (PL_errgv));
		667	SvREFCNT_dec (PL_defoutgv);
		668	SvREFCNT_dec (PL_rs);
		669	SvREFCNT_dec (GvSV (irsgv));
		670
		671	SvREFCNT_dec (coro->saved_deffh);
		672	//SvREFCNT_dec (coro->throw);
		673
		674	coro_destroy_stacks (aTHX);
		675	}
		676
		677	static void
		678	free_coro_mortal (pTHX)
		679	{
		680	if (expect_true (coro_mortal))
		681	{
		682	SvREFCNT_dec (coro_mortal);
		683	coro_mortal = 0;
		684	}
		685	}
		686
		687	static int
		688	runops_trace (pTHX)
		689	{
		690	COP *oldcop = 0;
		691	int oldcxix = -2;
		692	struct coro coro = SvSTATE (coro_current); / trace cctx is tied to specific coro */
		693	coro_cctx *cctx = coro->cctx;
		694
		695	while ((PL_op = CALL_FPTR (PL_op->op_ppaddr) (aTHX)))
		696	{
		697	PERL_ASYNC_CHECK ();
		698
		699	if (cctx->flags & CC_TRACE_ALL)
		700	{
		701	if (PL_op->op_type == OP_LEAVESUB && cctx->flags & CC_TRACE_SUB)
		702	{
		703	PERL_CONTEXT *cx = &cxstack[cxstack_ix];
		704	SV bot, top;
		705	AV av = newAV (); / return values */
		706	SV **cb;
		707	dSP;
		708
		709	GV *gv = CvGV (cx->blk_sub.cv);
		710	SV *fullname = sv_2mortal (newSV (0));
		711	if (isGV (gv))
		712	gv_efullname3 (fullname, gv, 0);
		713
		714	bot = PL_stack_base + cx->blk_oldsp + 1;
		715	top = cx->blk_gimme == G_ARRAY ? SP + 1
		716	: cx->blk_gimme == G_SCALAR ? bot + 1
		717	: bot;
		718
		719	av_extend (av, top - bot);
		720	while (bot < top)
		721	av_push (av, SvREFCNT_inc (*bot++));
		722
		723	PL_runops = RUNOPS_DEFAULT;
		724	ENTER;
		725	SAVETMPS;
		726	EXTEND (SP, 3);
		727	PUSHMARK (SP);
		728	PUSHs (&PL_sv_no);
		729	PUSHs (fullname);
		730	PUSHs (sv_2mortal (newRV_noinc ((SV *)av)));
		731	PUTBACK;
		732	cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0);
		733	if (cb) call_sv (*cb, G_KEEPERR \| G_EVAL \| G_VOID \| G_DISCARD);
		734	SPAGAIN;
		735	FREETMPS;
		736	LEAVE;
		737	PL_runops = runops_trace;
		738	}
		739
		740	if (oldcop != PL_curcop)
		741	{
		742	oldcop = PL_curcop;
		743
		744	if (PL_curcop != &PL_compiling)
		745	{
		746	SV **cb;
		747
		748	if (oldcxix != cxstack_ix && cctx->flags & CC_TRACE_SUB)
		749	{
		750	PERL_CONTEXT *cx = &cxstack[cxstack_ix];
		751
		752	if (CxTYPE (cx) == CXt_SUB && oldcxix < cxstack_ix)
		753	{
		754	runops_proc_t old_runops = PL_runops;
		755	dSP;
		756	GV *gv = CvGV (cx->blk_sub.cv);
		757	SV *fullname = sv_2mortal (newSV (0));
		758
		759	if (isGV (gv))
		760	gv_efullname3 (fullname, gv, 0);
		761
		762	PL_runops = RUNOPS_DEFAULT;
		763	ENTER;
		764	SAVETMPS;
		765	EXTEND (SP, 3);
		766	PUSHMARK (SP);
		767	PUSHs (&PL_sv_yes);
		768	PUSHs (fullname);
		769	PUSHs (cx->blk_sub.hasargs ? sv_2mortal (newRV_inc ((SV *)cx->blk_sub.argarray)) : &PL_sv_undef);
		770	PUTBACK;
		771	cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_sub_cb", sizeof ("_trace_sub_cb") - 1, 0);
		772	if (cb) call_sv (*cb, G_KEEPERR \| G_EVAL \| G_VOID \| G_DISCARD);
		773	SPAGAIN;
		774	FREETMPS;
		775	LEAVE;
		776	PL_runops = runops_trace;
		777	}
		778
		779	oldcxix = cxstack_ix;
		780	}
		781
		782	if (cctx->flags & CC_TRACE_LINE)
		783	{
		784	dSP;
		785
		786	PL_runops = RUNOPS_DEFAULT;
		787	ENTER;
		788	SAVETMPS;
		789	EXTEND (SP, 3);
		790	PL_runops = RUNOPS_DEFAULT;
		791	PUSHMARK (SP);
		792	PUSHs (sv_2mortal (newSVpv (OutCopFILE (oldcop), 0)));
		793	PUSHs (sv_2mortal (newSViv (CopLINE (oldcop))));
		794	PUTBACK;
		795	cb = hv_fetch ((HV *)SvRV (coro_current), "_trace_line_cb", sizeof ("_trace_line_cb") - 1, 0);
		796	if (cb) call_sv (*cb, G_KEEPERR \| G_EVAL \| G_VOID \| G_DISCARD);
		797	SPAGAIN;
		798	FREETMPS;
		799	LEAVE;
		800	PL_runops = runops_trace;
		801	}
		802	}
		803	}
		804	}
		805	}
		806
		807	TAINT_NOT;
		808	return 0;
		809	}
		810
		811	/* inject a fake call to Coro::State::_cctx_init into the execution */
		812	/* _cctx_init should be careful, as it could be called at almost any time */
		813	/* during execution of a perl program */
		814	static void NOINLINE
		815	prepare_cctx (pTHX_ coro_cctx *cctx)
		816	{
		817	dSP;
		818	LOGOP myop;
		819
		820	PL_top_env = &PL_start_env;
		821
		822	if (cctx->flags & CC_TRACE)
		823	PL_runops = runops_trace;
		824
		825	Zero (&myop, 1, LOGOP);
		826	myop.op_next = PL_op;
		827	myop.op_flags = OPf_WANT_VOID \| OPf_STACKED;
		828
		829	PUSHMARK (SP);
		830	EXTEND (SP, 2);
		831	PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
		832	PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
		833	PUTBACK;
		834	PL_op = (OP *)&myop;
		835	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		836	SPAGAIN;
		837	}
		838
		839	/*
		840	* this is a _very_ stripped down perl interpreter ;)
		841	*/
		842	static void
		843	coro_run (void *arg)
		844	{
		845	dTHX;
		846
		847	/* coro_run is the alternative tail of transfer(), so unlock here. */
		848	UNLOCK;
		849
		850	/* we now skip the entersub that lead to transfer() */
		851	PL_op = PL_op->op_next;
		852
		853	/* inject a fake subroutine call to cctx_init */
		854	prepare_cctx (aTHX_ (coro_cctx *)arg);
		855
		856	/* somebody or something will hit me for both perl_run and PL_restartop */
		857	PL_restartop = PL_op;
		858	perl_run (PL_curinterp);
		859
		860	/*
		861	* If perl-run returns we assume exit() was being called or the coro
		862	* fell off the end, which seems to be the only valid (non-bug)
		863	* reason for perl_run to return. We try to exit by jumping to the
		864	* bootstrap-time "top" top_env, as we cannot restore the "main"
		865	* coroutine as Coro has no such concept
		866	*/
		867	PL_top_env = main_top_env;
		868	JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */
		869	}
		870
		871	static coro_cctx *
		872	cctx_new ()
		873	{
		874	coro_cctx *cctx;
		875	void *stack_start;
		876	size_t stack_size;
		877
		878	++cctx_count;
		879
		880	Newz (0, cctx, 1, coro_cctx);
		881
		882	#if HAVE_MMAP
		883
		884	cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
		885	/* mmap supposedly does allocate-on-write for us */
		886	cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
		887
		888	if (cctx->sptr != (void *)-1)
		889	{
		890	# if CORO_STACKGUARD
		891	mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
		892	# endif
		893	stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
		894	stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
		895	cctx->flags \|= CC_MAPPED;
		896	}
		897	else
		898	#endif
		899	{
		900	cctx->ssize = coro_stacksize * (long)sizeof (long);
		901	New (0, cctx->sptr, coro_stacksize, long);
		902
		903	if (!cctx->sptr)
		904	{
		905	perror ("FATAL: unable to allocate stack for coroutine");
		906	_exit (EXIT_FAILURE);
		907	}
		908
		909	stack_start = cctx->sptr;
		910	stack_size = cctx->ssize;
		911	}
		912
		913	REGISTER_STACK (cctx, (char )stack_start, (char )stack_start + stack_size);
		914	coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size);
		915
		916	return cctx;
		917	}
		918
		919	static void
		920	cctx_destroy (coro_cctx *cctx)
		921	{
		922	if (!cctx)
828	return;	923	return;
		924
		925	--cctx_count;
		926
		927	#if CORO_USE_VALGRIND
		928	VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
		929	#endif
		930
		931	#if HAVE_MMAP
		932	if (cctx->flags & CC_MAPPED)
		933	munmap (cctx->sptr, cctx->ssize);
		934	else
		935	#endif
		936	Safefree (cctx->sptr);
		937
		938	Safefree (cctx);
		939	}
		940
		941	/* wether this cctx should be destructed */
		942	#define CCTX_EXPIRED(cctx) ((cctx)->ssize < coro_stacksize \|\| ((cctx)->flags & CC_NOREUSE))
		943
		944	static coro_cctx *
		945	cctx_get (pTHX)
		946	{
		947	while (expect_true (cctx_first))
829	}	948	{
		949	coro_cctx *cctx = cctx_first;
		950	cctx_first = cctx->next;
		951	--cctx_idle;
830		952
831	croak ("Coro::ready tried to enqueue something that is not a coroutine");	953	if (expect_true (!CCTX_EXPIRED (cctx)))
		954	return cctx;
		955
		956	cctx_destroy (cctx);
		957	}
		958
		959	return cctx_new ();
		960	}
		961
		962	static void
		963	cctx_put (coro_cctx *cctx)
		964	{
		965	/* free another cctx if overlimit */
		966	if (expect_false (cctx_idle >= MAX_IDLE_CCTX))
		967	{
		968	coro_cctx *first = cctx_first;
		969	cctx_first = first->next;
		970	--cctx_idle;
		971
		972	cctx_destroy (first);
		973	}
		974
		975	++cctx_idle;
		976	cctx->next = cctx_first;
		977	cctx_first = cctx;
		978	}
		979
		980	/ coroutine switching ***************************************************/
		981
		982	static void
		983	transfer_check (pTHX_ struct coro prev, struct coro next)
		984	{
		985	if (expect_true (prev != next))
		986	{
		987	if (expect_false (!(prev->flags & (CF_RUNNING \| CF_NEW))))
		988	croak ("Coro::State::transfer called with non-running/new prev Coro::State, but can only transfer from running or new states");
		989
		990	if (expect_false (next->flags & CF_RUNNING))
		991	croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
		992
		993	if (expect_false (next->flags & CF_DESTROYED))
		994	croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
		995
		996	if (expect_false (PL_lex_state != LEX_NOTPARSING))
		997	croak ("Coro::State::transfer called while parsing, but this is not supported");
		998	}
		999	}
		1000
		1001	/* always use the TRANSFER macro */
		1002	static void NOINLINE
		1003	transfer (pTHX_ struct coro prev, struct coro next)
		1004	{
		1005	dSTACKLEVEL;
		1006
		1007	/* sometimes transfer is only called to set idle_sp */
		1008	if (expect_false (!next))
		1009	{
		1010	((coro_cctx *)prev)->idle_sp = STACKLEVEL;
		1011	assert (((coro_cctx )prev)->idle_te = PL_top_env); / just for the side-effect when asserts are enabled */
		1012	}
		1013	else if (expect_true (prev != next))
		1014	{
		1015	coro_cctx *prev__cctx;
		1016
		1017	if (expect_false (prev->flags & CF_NEW))
		1018	{
		1019	/* create a new empty context */
		1020	Newz (0, prev->cctx, 1, coro_cctx);
		1021	prev->flags &= ~CF_NEW;
		1022	prev->flags \|= CF_RUNNING;
		1023	}
		1024
		1025	prev->flags &= ~CF_RUNNING;
		1026	next->flags \|= CF_RUNNING;
		1027
		1028	LOCK;
		1029
		1030	if (expect_false (next->flags & CF_NEW))
		1031	{
		1032	/* need to start coroutine */
		1033	next->flags &= ~CF_NEW;
		1034	/* first get rid of the old state */
		1035	save_perl (aTHX_ prev);
		1036	/* setup coroutine call */
		1037	coro_setup (aTHX_ next);
		1038	}
		1039	else
		1040	{
		1041	/* coroutine already started */
		1042	save_perl (aTHX_ prev);
		1043	load_perl (aTHX_ next);
		1044	}
		1045
		1046	prev__cctx = prev->cctx;
		1047
		1048	/* possibly "free" the cctx */
		1049	if (expect_true (prev__cctx->idle_sp == STACKLEVEL && !(prev__cctx->flags & CC_TRACE)))
		1050	{
		1051	/* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
		1052	assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
		1053
		1054	prev->cctx = 0;
		1055
		1056	/* if the cctx is about to be destroyed we need to make sure we won't see it in cctx_get */
		1057	/* without this the next cctx_get might destroy the prev__cctx while still in use */
		1058	if (expect_false (CCTX_EXPIRED (prev__cctx)))
		1059	next->cctx = cctx_get (aTHX);
		1060
		1061	cctx_put (prev__cctx);
		1062	}
		1063
		1064	++next->usecount;
		1065
		1066	if (expect_true (!next->cctx))
		1067	next->cctx = cctx_get (aTHX);
		1068
		1069	if (expect_false (prev__cctx != next->cctx))
		1070	{
		1071	prev__cctx->top_env = PL_top_env;
		1072	PL_top_env = next->cctx->top_env;
		1073	coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
		1074	}
		1075
		1076	free_coro_mortal (aTHX);
		1077	UNLOCK;
		1078	}
		1079	}
		1080
		1081	struct transfer_args
		1082	{
		1083	struct coro prev, next;
		1084	};
		1085
		1086	#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
		1087	#define TRANSFER_CHECK(ta) transfer_check (aTHX_ (ta).prev, (ta).next)
		1088
		1089	/ high level stuff ******************************************************/
		1090
		1091	static int
		1092	coro_state_destroy (pTHX_ struct coro *coro)
		1093	{
		1094	if (coro->flags & CF_DESTROYED)
		1095	return 0;
		1096
		1097	coro->flags \|= CF_DESTROYED;
		1098
		1099	if (coro->flags & CF_READY)
		1100	{
		1101	/* reduce nready, as destroying a ready coro effectively unreadies it */
		1102	/* alternative: look through all ready queues and remove the coro */
		1103	LOCK;
		1104	--coro_nready;
		1105	UNLOCK;
		1106	}
		1107	else
		1108	coro->flags \|= CF_READY; /* make sure it is NOT put into the readyqueue */
		1109
		1110	if (coro->mainstack && coro->mainstack != main_mainstack)
		1111	{
		1112	struct coro temp;
		1113
		1114	if (coro->flags & CF_RUNNING)
		1115	croak ("FATAL: tried to destroy currently running coroutine");
		1116
		1117	save_perl (aTHX_ &temp);
		1118	load_perl (aTHX_ coro);
		1119
		1120	coro_destroy (aTHX_ coro);
		1121
		1122	load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */
		1123
		1124	coro->mainstack = 0;
		1125	}
		1126
		1127	cctx_destroy (coro->cctx);
		1128	SvREFCNT_dec (coro->args);
		1129
		1130	if (coro->next) coro->next->prev = coro->prev;
		1131	if (coro->prev) coro->prev->next = coro->next;
		1132	if (coro == coro_first) coro_first = coro->next;
		1133
		1134	return 1;
		1135	}
		1136
		1137	static int
		1138	coro_state_free (pTHX_ SV sv, MAGIC mg)
		1139	{
		1140	struct coro coro = (struct coro )mg->mg_ptr;
		1141	mg->mg_ptr = 0;
		1142
		1143	coro->hv = 0;
		1144
		1145	if (--coro->refcnt < 0)
		1146	{
		1147	coro_state_destroy (aTHX_ coro);
		1148	Safefree (coro);
		1149	}
		1150
		1151	return 0;
		1152	}
		1153
		1154	static int
		1155	coro_state_dup (pTHX_ MAGIC mg, CLONE_PARAMS params)
		1156	{
		1157	struct coro coro = (struct coro )mg->mg_ptr;
		1158
		1159	++coro->refcnt;
		1160
		1161	return 0;
		1162	}
		1163
		1164	static MGVTBL coro_state_vtbl = {
		1165	0, 0, 0, 0,
		1166	coro_state_free,
		1167	0,
		1168	#ifdef MGf_DUP
		1169	coro_state_dup,
		1170	#else
		1171	# define MGf_DUP 0
		1172	#endif
		1173	};
		1174
		1175	static void
		1176	prepare_transfer (pTHX_ struct transfer_args ta, SV prev_sv, SV *next_sv)
		1177	{
		1178	ta->prev = SvSTATE (prev_sv);
		1179	ta->next = SvSTATE (next_sv);
		1180	TRANSFER_CHECK (*ta);
		1181	}
		1182
		1183	static void
		1184	api_transfer (SV prev_sv, SV next_sv)
		1185	{
		1186	dTHX;
		1187	struct transfer_args ta;
		1188
		1189	prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
		1190	TRANSFER (ta);
		1191	}
		1192
		1193	/ Coro ******************************************************************/
		1194
		1195	static void
		1196	coro_enq (pTHX_ SV *coro_sv)
		1197	{
		1198	av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
832	}	1199	}
833		1200
834	static SV *	1201	static SV *
835	coro_deq (int min_prio)	1202	coro_deq (pTHX_ int min_prio)
836	{	1203	{
837	int prio = PRIO_MAX - PRIO_MIN;	1204	int prio = PRIO_MAX - PRIO_MIN;
838		1205
839	min_prio -= PRIO_MIN;	1206	min_prio -= PRIO_MIN;
840	if (min_prio < 0)	1207	if (min_prio < 0)
841	min_prio = 0;	1208	min_prio = 0;
842		1209
843	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )	1210	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
844	if (av_len (coro_ready[prio]) >= 0)	1211	if (AvFILLp (coro_ready [prio]) >= 0)
845	{
846	coro_nready--;
847	return av_shift (coro_ready[prio]);	1212	return av_shift (coro_ready [prio]);
848	}
849		1213
850	return 0;	1214	return 0;
851	}	1215	}
852		1216
853	static void	1217	static int
854	api_ready (SV *coro)	1218	api_ready (SV *coro_sv)
855	{	1219	{
		1220	dTHX;
		1221	struct coro *coro;
		1222
856	if (SvROK (coro))	1223	if (SvROK (coro_sv))
857	coro = SvRV (coro);	1224	coro_sv = SvRV (coro_sv);
858		1225
		1226	coro = SvSTATE (coro_sv);
		1227
		1228	if (coro->flags & CF_READY)
		1229	return 0;
		1230
		1231	coro->flags \|= CF_READY;
		1232
		1233	LOCK;
859	coro_enq (SvREFCNT_inc (coro));	1234	coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
		1235	++coro_nready;
		1236	UNLOCK;
		1237
		1238	return 1;
		1239	}
		1240
		1241	static int
		1242	api_is_ready (SV *coro_sv)
		1243	{
		1244	dTHX;
		1245	return !!(SvSTATE (coro_sv)->flags & CF_READY);
		1246	}
		1247
		1248	static void
		1249	prepare_schedule (pTHX_ struct transfer_args *ta)
		1250	{
		1251	SV prev_sv, next_sv;
		1252
		1253	for (;;)
		1254	{
		1255	LOCK;
		1256	next_sv = coro_deq (aTHX_ PRIO_MIN);
		1257
		1258	/* nothing to schedule: call the idle handler */
		1259	if (expect_false (!next_sv))
		1260	{
		1261	dSP;
		1262	UNLOCK;
		1263
		1264	ENTER;
		1265	SAVETMPS;
		1266
		1267	PUSHMARK (SP);
		1268	PUTBACK;
		1269	call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
		1270
		1271	FREETMPS;
		1272	LEAVE;
		1273	continue;
		1274	}
		1275
		1276	ta->next = SvSTATE (next_sv);
		1277
		1278	/* cannot transfer to destroyed coros, skip and look for next */
		1279	if (expect_false (ta->next->flags & CF_DESTROYED))
		1280	{
		1281	UNLOCK;
		1282	SvREFCNT_dec (next_sv);
		1283	/* coro_nready is already taken care of by destroy */
		1284	continue;
		1285	}
		1286
		1287	--coro_nready;
		1288	UNLOCK;
		1289	break;
		1290	}
		1291
		1292	/* free this only after the transfer */
		1293	prev_sv = SvRV (coro_current);
		1294	ta->prev = SvSTATE (prev_sv);
		1295	TRANSFER_CHECK (*ta);
		1296	assert (ta->next->flags & CF_READY);
		1297	ta->next->flags &= ~CF_READY;
		1298	SvRV_set (coro_current, next_sv);
		1299
		1300	LOCK;
		1301	free_coro_mortal (aTHX);
		1302	coro_mortal = prev_sv;
		1303	UNLOCK;
		1304	}
		1305
		1306	static void
		1307	prepare_cede (pTHX_ struct transfer_args *ta)
		1308	{
		1309	api_ready (coro_current);
		1310	prepare_schedule (aTHX_ ta);
		1311	}
		1312
		1313	static int
		1314	prepare_cede_notself (pTHX_ struct transfer_args *ta)
		1315	{
		1316	if (coro_nready)
		1317	{
		1318	SV *prev = SvRV (coro_current);
		1319	prepare_schedule (aTHX_ ta);
		1320	api_ready (prev);
		1321	return 1;
		1322	}
		1323	else
		1324	return 0;
860	}	1325	}
861		1326
862	static void	1327	static void
863	api_schedule (void)	1328	api_schedule (void)
864	{	1329	{
865	SV prev, next;	1330	dTHX;
		1331	struct transfer_args ta;
866		1332
867	prev = SvRV (GvSV (coro_current));	1333	prepare_schedule (aTHX_ &ta);
868	next = coro_deq (PRIO_MIN);	1334	TRANSFER (ta);
869
870	if (!next)
871	next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
872
873	coro_mortal = prev;
874	SV_CORO (prev, "Coro::schedule");
875
876	SvRV (GvSV (coro_current)) = next;
877
878	SV_CORO (next, "Coro::schedule");
879
880	transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
881	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);
882	}	1335	}
883		1336
884	static void	1337	static int
885	api_cede (void)	1338	api_cede (void)
886	{	1339	{
887	coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));	1340	dTHX;
		1341	struct transfer_args ta;
888		1342
889	api_schedule ();	1343	prepare_cede (aTHX_ &ta);
890	}
891		1344
		1345	if (expect_true (ta.prev != ta.next))
		1346	{
		1347	TRANSFER (ta);
		1348	return 1;
		1349	}
		1350	else
		1351	return 0;
		1352	}
		1353
		1354	static int
		1355	api_cede_notself (void)
		1356	{
		1357	dTHX;
		1358	struct transfer_args ta;
		1359
		1360	if (prepare_cede_notself (aTHX_ &ta))
		1361	{
		1362	TRANSFER (ta);
		1363	return 1;
		1364	}
		1365	else
		1366	return 0;
		1367	}
		1368
		1369	static void
		1370	api_trace (SV *coro_sv, int flags)
		1371	{
		1372	dTHX;
		1373	struct coro *coro = SvSTATE (coro_sv);
		1374
		1375	if (flags & CC_TRACE)
		1376	{
		1377	if (!coro->cctx)
		1378	coro->cctx = cctx_new ();
		1379	else if (!(coro->cctx->flags & CC_TRACE))
		1380	croak ("cannot enable tracing on coroutine with custom stack");
		1381
		1382	coro->cctx->flags \|= CC_NOREUSE \| (flags & (CC_TRACE \| CC_TRACE_ALL));
		1383	}
		1384	else if (coro->cctx && coro->cctx->flags & CC_TRACE)
		1385	{
		1386	coro->cctx->flags &= ~(CC_TRACE \| CC_TRACE_ALL);
		1387
		1388	if (coro->flags & CF_RUNNING)
		1389	PL_runops = RUNOPS_DEFAULT;
		1390	else
		1391	coro->runops = RUNOPS_DEFAULT;
		1392	}
		1393	}
		1394
892	MODULE = Coro::State PACKAGE = Coro::State	1395	MODULE = Coro::State PACKAGE = Coro::State PREFIX = api_
893		1396
894	PROTOTYPES: ENABLE	1397	PROTOTYPES: DISABLE
895		1398
896	BOOT:	1399	BOOT:
897	{ /* {} necessary for stoopid perl-5.6.x */	1400	{
898	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);	1401	#ifdef USE_ITHREADS
899	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);	1402	MUTEX_INIT (&coro_mutex);
		1403	#endif
		1404	BOOT_PAGESIZE;
		1405
		1406	irsgv = gv_fetchpv ("/" , GV_ADD\|GV_NOTQUAL, SVt_PV);
		1407	stdoutgv = gv_fetchpv ("STDOUT", GV_ADD\|GV_NOTQUAL, SVt_PVIO);
		1408
900	coro_state_stash = gv_stashpv ("Coro::State", TRUE);	1409	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
901		1410
902	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	1411	newCONSTSUB (coro_state_stash, "CC_TRACE" , newSViv (CC_TRACE));
903	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	1412	newCONSTSUB (coro_state_stash, "CC_TRACE_SUB" , newSViv (CC_TRACE_SUB));
904	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));	1413	newCONSTSUB (coro_state_stash, "CC_TRACE_LINE", newSViv (CC_TRACE_LINE));
905	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));	1414	newCONSTSUB (coro_state_stash, "CC_TRACE_ALL" , newSViv (CC_TRACE_ALL));
906
907	if (!padlist_cache)
908	padlist_cache = newHV ();
909		1415
910	main_mainstack = PL_mainstack;	1416	main_mainstack = PL_mainstack;
		1417	main_top_env = PL_top_env;
		1418
		1419	while (main_top_env->je_prev)
		1420	main_top_env = main_top_env->je_prev;
911		1421
912	coroapi.ver = CORO_API_VERSION;	1422	coroapi.ver = CORO_API_VERSION;
913	coroapi.transfer = api_transfer;	1423	coroapi.transfer = api_transfer;
914	}
915		1424
916	Coro::State	1425	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
917	_newprocess(args)	1426	}
918	SV * args	1427
919	PROTOTYPE: $	1428	SV *
		1429	new (char *klass, ...)
920	CODE:	1430	CODE:
921	Coro__State coro;	1431	{
		1432	struct coro *coro;
		1433	HV *hv;
		1434	int i;
922		1435
923	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
924	croak ("Coro::State::_newprocess expects an arrayref");
925
926	New (0, coro, 1, struct coro);	1436	Newz (0, coro, 1, struct coro);
		1437	coro->args = newAV ();
		1438	coro->flags = CF_NEW;
927		1439
928	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	1440	if (coro_first) coro_first->prev = coro;
929	coro->mainstack = 0; /* actual work is done inside transfer */	1441	coro->next = coro_first;
930	coro->stack = 0;	1442	coro_first = coro;
931		1443
932	RETVAL = coro;	1444	coro->hv = hv = newHV ();
		1445	sv_magicext ((SV )hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char )coro, 0)->mg_flags \|= MGf_DUP;
		1446	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
		1447
		1448	av_extend (coro->args, items - 1);
		1449	for (i = 1; i < items; i++)
		1450	av_push (coro->args, newSVsv (ST (i)));
		1451	}
933	OUTPUT:	1452	OUTPUT:
934	RETVAL	1453	RETVAL
935		1454
		1455	# these not obviously related functions are all rolled into the same xs
		1456	# function to increase chances that they all will call transfer with the same
		1457	# stack offset
936	void	1458	void
937	transfer(prev, next, flags)	1459	_set_stacklevel (...)
938	SV *prev	1460	ALIAS:
939	SV *next	1461	Coro::State::transfer = 1
940	int flags	1462	Coro::schedule = 2
941	PROTOTYPE: @	1463	Coro::cede = 3
		1464	Coro::cede_notself = 4
942	CODE:	1465	CODE:
943	PUTBACK;	1466	{
944	SV_CORO (next, "Coro::transfer");	1467	struct transfer_args ta;
945	SV_CORO (prev, "Coro::transfer");	1468
946	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);	1469	switch (ix)
947	SPAGAIN;	1470	{
		1471	case 0:
		1472	ta.prev = (struct coro )INT2PTR (coro_cctx , SvIV (ST (0)));
		1473	ta.next = 0;
		1474	break;
		1475
		1476	case 1:
		1477	if (items != 2)
		1478	croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
		1479
		1480	prepare_transfer (aTHX_ &ta, ST (0), ST (1));
		1481	break;
		1482
		1483	case 2:
		1484	prepare_schedule (aTHX_ &ta);
		1485	break;
		1486
		1487	case 3:
		1488	prepare_cede (aTHX_ &ta);
		1489	break;
		1490
		1491	case 4:
		1492	if (!prepare_cede_notself (aTHX_ &ta))
		1493	XSRETURN_EMPTY;
		1494
		1495	break;
		1496	}
		1497
		1498	BARRIER;
		1499	TRANSFER (ta);
		1500
		1501	if (expect_false (GIMME_V != G_VOID && ta.next != ta.prev))
		1502	XSRETURN_YES;
		1503	}
		1504
		1505	bool
		1506	_destroy (SV *coro_sv)
		1507	CODE:
		1508	RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
		1509	OUTPUT:
		1510	RETVAL
948		1511
949	void	1512	void
950	DESTROY(coro)
951	Coro::State coro
952	CODE:
953
954	if (coro->mainstack && coro->mainstack != main_mainstack)
955	{
956	struct coro temp;
957
958	PUTBACK;
959	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
960	LOAD(aTHX_ coro);
961	SPAGAIN;
962
963	destroy_stacks (aTHX);
964
965	LOAD((&temp)); /* this will get rid of defsv etc.. */
966	SPAGAIN;
967
968	coro->mainstack = 0;
969	}
970
971	deallocate_stack (coro);
972
973	Safefree (coro);
974
975	void
976	flush()
977	CODE:
978	#ifdef MAY_FLUSH
979	flush_padlist_cache ();
980	#endif
981
982	void
983	_exit(code)	1513	_exit (code)
984	int code	1514	int code
985	PROTOTYPE: $	1515	PROTOTYPE: $
986	CODE:	1516	CODE:
987	#if defined(__GLIBC__) \|\| _POSIX_C_SOURCE
988	_exit (code);	1517	_exit (code);
989	#else
990	signal (SIGTERM, SIG_DFL);
991	raise (SIGTERM);
992	exit (code);
993	#endif
994		1518
995	MODULE = Coro::State PACKAGE = Coro::Cont	1519	int
		1520	cctx_stacksize (int new_stacksize = 0)
		1521	CODE:
		1522	RETVAL = coro_stacksize;
		1523	if (new_stacksize)
		1524	coro_stacksize = new_stacksize;
		1525	OUTPUT:
		1526	RETVAL
996		1527
997	# this is slightly dirty (should expose a c-level api)	1528	int
		1529	cctx_count ()
		1530	CODE:
		1531	RETVAL = cctx_count;
		1532	OUTPUT:
		1533	RETVAL
		1534
		1535	int
		1536	cctx_idle ()
		1537	CODE:
		1538	RETVAL = cctx_idle;
		1539	OUTPUT:
		1540	RETVAL
998		1541
999	void	1542	void
1000	yield(...)	1543	list ()
1001	PROTOTYPE: @	1544	PPCODE:
		1545	{
		1546	struct coro *coro;
		1547	for (coro = coro_first; coro; coro = coro->next)
		1548	if (coro->hv)
		1549	XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv)));
		1550	}
		1551
		1552	void
		1553	call (Coro::State coro, SV *coderef)
		1554	ALIAS:
		1555	eval = 1
		1556	CODE:
		1557	{
		1558	if (coro->mainstack)
		1559	{
		1560	struct coro temp;
		1561	Zero (&temp, 1, struct coro);
		1562
		1563	if (!(coro->flags & CF_RUNNING))
		1564	{
		1565	save_perl (aTHX_ &temp);
		1566	load_perl (aTHX_ coro);
		1567	}
		1568
		1569	{
		1570	dSP;
		1571	ENTER;
		1572	SAVETMPS;
		1573	PUSHMARK (SP);
		1574	PUTBACK;
		1575	if (ix)
		1576	eval_sv (coderef, 0);
		1577	else
		1578	call_sv (coderef, G_KEEPERR \| G_EVAL \| G_VOID \| G_DISCARD);
		1579	SPAGAIN;
		1580	FREETMPS;
		1581	LEAVE;
		1582	PUTBACK;
		1583	}
		1584
		1585	if (!(coro->flags & CF_RUNNING))
		1586	{
		1587	save_perl (aTHX_ coro);
		1588	load_perl (aTHX_ &temp);
		1589	}
		1590	}
		1591	}
		1592
		1593	SV *
		1594	is_ready (Coro::State coro)
		1595	PROTOTYPE: $
		1596	ALIAS:
		1597	is_ready = CF_READY
		1598	is_running = CF_RUNNING
		1599	is_new = CF_NEW
		1600	is_destroyed = CF_DESTROYED
		1601	CODE:
		1602	RETVAL = boolSV (coro->flags & ix);
		1603	OUTPUT:
		1604	RETVAL
		1605
		1606	void
		1607	api_trace (SV *coro, int flags = CC_TRACE \| CC_TRACE_SUB)
		1608
		1609	SV *
		1610	has_stack (Coro::State coro)
		1611	PROTOTYPE: $
		1612	CODE:
		1613	RETVAL = boolSV (!!coro->cctx);
		1614	OUTPUT:
		1615	RETVAL
		1616
		1617	int
		1618	is_traced (Coro::State coro)
		1619	PROTOTYPE: $
		1620	CODE:
		1621	RETVAL = (coro->cctx ? coro->cctx->flags : 0) & CC_TRACE_ALL;
		1622	OUTPUT:
		1623	RETVAL
		1624
		1625	IV
		1626	rss (Coro::State coro)
		1627	PROTOTYPE: $
		1628	ALIAS:
		1629	usecount = 1
1002	CODE:	1630	CODE:
1003	static SV *returnstk;	1631	switch (ix)
1004	SV *sv;	1632	{
1005	AV *defav = GvAV (PL_defgv);	1633	case 0: RETVAL = coro_rss (aTHX_ coro); break;
1006	struct coro prev, next;	1634	case 1: RETVAL = coro->usecount; break;
		1635	}
		1636	OUTPUT:
		1637	RETVAL
1007		1638
1008	if (!returnstk)
1009	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
1010
1011	/* set up @_ -- ugly */
1012	av_clear (defav);
1013	av_fill (defav, items - 1);
1014	while (items--)
1015	av_store (defav, items, SvREFCNT_inc (ST(items)));
1016
1017	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1018	sv = av_pop ((AV *)SvRV (returnstk));
1019	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));
1020	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));
1021	SvREFCNT_dec (sv);
1022
1023	transfer(aTHX_ prev, next, 0);
1024		1639
1025	MODULE = Coro::State PACKAGE = Coro	1640	MODULE = Coro::State PACKAGE = Coro
1026		1641
1027	# this is slightly dirty (should expose a c-level api)
1028
1029	BOOT:	1642	BOOT:
1030	{	1643	{
1031	int i;	1644	int i;
		1645
		1646	sv_pool_rss = get_sv ("Coro::POOL_RSS" , TRUE);
		1647	sv_pool_size = get_sv ("Coro::POOL_SIZE" , TRUE);
		1648	av_async_pool = get_av ("Coro::async_pool", TRUE);
		1649
		1650	coro_current = get_sv ("Coro::current", FALSE);
		1651	SvREADONLY_on (coro_current);
		1652
1032	HV *stash = gv_stashpv ("Coro", TRUE);	1653	coro_stash = gv_stashpv ("Coro", TRUE);
1033		1654
1034	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));	1655	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1035	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));	1656	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1036	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));	1657	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1037	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));	1658	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1038	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));	1659	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1039	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));	1660	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1040
1041	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1042	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1043		1661
1044	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )	1662	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1045	coro_ready[i] = newAV ();	1663	coro_ready[i] = newAV ();
1046		1664
1047	{	1665	{
1048	SV *sv = perl_get_sv("Coro::API", 1);	1666	SV *sv = perl_get_sv("Coro::API", 1);
1049		1667
1050	coroapi.schedule = api_schedule;	1668	coroapi.schedule = api_schedule;
1051	coroapi.cede = api_cede;	1669	coroapi.cede = api_cede;
		1670	coroapi.cede_notself = api_cede_notself;
1052	coroapi.ready = api_ready;	1671	coroapi.ready = api_ready;
		1672	coroapi.is_ready = api_is_ready;
1053	coroapi.nready = &coro_nready;	1673	coroapi.nready = &coro_nready;
1054	coroapi.current = coro_current;	1674	coroapi.current = coro_current;
1055		1675
1056	GCoroAPI = &coroapi;	1676	GCoroAPI = &coroapi;
1057	sv_setiv(sv, (IV)&coroapi);	1677	sv_setiv (sv, (IV)&coroapi);
1058	SvREADONLY_on(sv);	1678	SvREADONLY_on (sv);
1059	}	1679	}
1060	}	1680	}
1061		1681
1062	void	1682	void
1063	ready(self)	1683	_set_current (SV *current)
1064	SV * self
1065	PROTOTYPE: $	1684	PROTOTYPE: $
1066	CODE:	1685	CODE:
1067	api_ready (self);	1686	SvREFCNT_dec (SvRV (coro_current));
		1687	SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1068		1688
1069	int	1689	int
		1690	prio (Coro::State coro, int newprio = 0)
		1691	ALIAS:
		1692	nice = 1
		1693	CODE:
		1694	{
		1695	RETVAL = coro->prio;
		1696
		1697	if (items > 1)
		1698	{
		1699	if (ix)
		1700	newprio = coro->prio - newprio;
		1701
		1702	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
		1703	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
		1704
		1705	coro->prio = newprio;
		1706	}
		1707	}
		1708	OUTPUT:
		1709	RETVAL
		1710
		1711	SV *
		1712	ready (SV *self)
		1713	PROTOTYPE: $
		1714	CODE:
		1715	RETVAL = boolSV (api_ready (self));
		1716	OUTPUT:
		1717	RETVAL
		1718
		1719	int
1070	nready(...)	1720	nready (...)
1071	PROTOTYPE:	1721	PROTOTYPE:
1072	CODE:	1722	CODE:
1073	RETVAL = coro_nready;	1723	RETVAL = coro_nready;
1074	OUTPUT:	1724	OUTPUT:
1075	RETVAL	1725	RETVAL
1076		1726
		1727	# for async_pool speedup
1077	void	1728	void
1078	schedule(...)	1729	_pool_1 (SV *cb)
1079	PROTOTYPE:
1080	CODE:	1730	CODE:
1081	api_schedule ();	1731	{
		1732	struct coro *coro = SvSTATE (coro_current);
		1733	HV hv = (HV )SvRV (coro_current);
		1734	AV *defav = GvAV (PL_defgv);
		1735	SV *invoke = hv_delete (hv, "_invoke", sizeof ("_invoke") - 1, 0);
		1736	AV *invoke_av;
		1737	int i, len;
		1738
		1739	if (!invoke)
		1740	croak ("\3terminate\2\n");
		1741
		1742	SvREFCNT_dec (coro->saved_deffh);
		1743	coro->saved_deffh = SvREFCNT_inc ((SV *)PL_defoutgv);
		1744
		1745	hv_store (hv, "desc", sizeof ("desc") - 1,
		1746	newSVpvn ("[async_pool]", sizeof ("[async_pool]") - 1), 0);
		1747
		1748	invoke_av = (AV *)SvRV (invoke);
		1749	len = av_len (invoke_av);
		1750
		1751	sv_setsv (cb, AvARRAY (invoke_av)[0]);
		1752
		1753	if (len > 0)
		1754	{
		1755	av_fill (defav, len - 1);
		1756	for (i = 0; i < len; ++i)
		1757	av_store (defav, i, SvREFCNT_inc (AvARRAY (invoke_av)[i + 1]));
		1758	}
		1759
		1760	SvREFCNT_dec (invoke);
		1761	}
1082		1762
1083	void	1763	void
1084	cede(...)	1764	_pool_2 (SV *cb)
1085	PROTOTYPE:
1086	CODE:	1765	CODE:
1087	api_cede ();	1766	{
		1767	struct coro *coro = SvSTATE (coro_current);
1088		1768
		1769	sv_setsv (cb, &PL_sv_undef);
		1770
		1771	SvREFCNT_dec ((SV )PL_defoutgv); PL_defoutgv = (GV )coro->saved_deffh;
		1772	coro->saved_deffh = 0;
		1773
		1774	if (coro_rss (aTHX_ coro) > SvIV (sv_pool_rss)
		1775	\|\| av_len (av_async_pool) + 1 >= SvIV (sv_pool_size))
		1776	croak ("\3terminate\2\n");
		1777
		1778	av_clear (GvAV (PL_defgv));
		1779	hv_store ((HV *)SvRV (coro_current), "desc", sizeof ("desc") - 1,
		1780	newSVpvn ("[async_pool idle]", sizeof ("[async_pool idle]") - 1), 0);
		1781
		1782	coro->prio = 0;
		1783
		1784	if (coro->cctx && (coro->cctx->flags & CC_TRACE))
		1785	api_trace (coro_current, 0);
		1786
		1787	av_push (av_async_pool, newSVsv (coro_current));
		1788	}
		1789
		1790
		1791	MODULE = Coro::State PACKAGE = Coro::AIO
		1792
		1793	SV *
		1794	_get_state ()
		1795	CODE:
		1796	{
		1797	struct io_state *data;
		1798
		1799	RETVAL = newSV (sizeof (struct io_state));
		1800	data = (struct io_state *)SvPVX (RETVAL);
		1801	SvCUR_set (RETVAL, sizeof (struct io_state));
		1802	SvPOK_only (RETVAL);
		1803
		1804	data->errorno = errno;
		1805	data->laststype = PL_laststype;
		1806	data->laststatval = PL_laststatval;
		1807	data->statcache = PL_statcache;
		1808	}
		1809	OUTPUT:
		1810	RETVAL
		1811
		1812	void
		1813	_set_state (char *data_)
		1814	PROTOTYPE: $
		1815	CODE:
		1816	{
		1817	struct io_state data = (void )data_;
		1818
		1819	errno = data->errorno;
		1820	PL_laststype = data->laststype;
		1821	PL_laststatval = data->laststatval;
		1822	PL_statcache = data->statcache;
		1823	}
		1824

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.39 by root, Sun Nov 25 20:04:05 2001 UTC vs. Revision 1.195 by root, Sat Oct 6 00:35:41 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.39 by root, Sun Nov 25 20:04:05 2001 UTC vs.
Revision 1.195 by root, Sat Oct 6 00:35:41 2007 UTC