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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.31 by root, Sun Aug 26 16:36:08 2001 UTC vs. Revision 1.138 by root, Sun Jan 14 20:49:45 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.31 by root, Sun Aug 26 16:36:08 2001 UTC vs.
Revision 1.138 by root, Sun Jan 14 20:49:45 2007 UTC