ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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