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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.41 by root, Tue Nov 27 02:51:03 2001 UTC vs.
Revision 1.147 by root, Mon Mar 19 15:50:48 2007 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.41 by root, Tue Nov 27 02:51:03 2001 UTC vs. Revision 1.147 by root, Mon Mar 19 15:50:48 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.41 by root, Tue Nov 27 02:51:03 2001 UTC vs.
Revision 1.147 by root, Mon Mar 19 15:50:48 2007 UTC