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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.44 by root, Sat Mar 22 18:50:32 2003 UTC vs. Revision 1.140 by root, Sat Jan 20 19:52:15 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.44 by root, Sat Mar 22 18:50:32 2003 UTC vs.
Revision 1.140 by root, Sat Jan 20 19:52:15 2007 UTC