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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.55 by pcg, Thu Apr 1 02:29:05 2004 UTC vs.
Revision 1.135 by root, Fri Jan 5 18:25:51 2007 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.55 by pcg, Thu Apr 1 02:29:05 2004 UTC vs. Revision 1.135 by root, Fri Jan 5 18:25:51 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.55 by pcg, Thu Apr 1 02:29:05 2004 UTC vs.
Revision 1.135 by root, Fri Jan 5 18:25:51 2007 UTC