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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.39 by root, Sun Nov 25 20:04:05 2001 UTC vs. Revision 1.144 by root, Sun Mar 4 11:45:23 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.39 by root, Sun Nov 25 20:04:05 2001 UTC vs.
Revision 1.144 by root, Sun Mar 4 11:45:23 2007 UTC