ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.32 by root, Sun Aug 26 17:01:54 2001 UTC vs.
Revision 1.101 by root, Mon Nov 27 00:08:18 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,8,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	destroy_stacks()
491	{	497	{
492	int destruct = PL_main_cv != Nullcv;	498	if (!IN_DESTRUCT)
493
494	if (destruct)
495	{	499	{
496	/* is this ugly, I ask? */	500	/* is this ugly, I ask? */
497	while (PL_scopestack_ix)	501	LEAVE_SCOPE (0);
498	LEAVE;
499		502
500	/* sure it is, but more important: is it correct?? :/ */	503	/* sure it is, but more important: is it correct?? :/ */
501	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
502	FREETMPS;	504	FREETMPS;
		505
		506	/*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
503	}	507	}
504		508
505	while (PL_curstackinfo->si_next)	509	while (PL_curstackinfo->si_next)
506	PL_curstackinfo = PL_curstackinfo->si_next;	510	PL_curstackinfo = PL_curstackinfo->si_next;
507		511
508	while (PL_curstackinfo)	512	while (PL_curstackinfo)
509	{	513	{
510	PERL_SI *p = PL_curstackinfo->si_prev;	514	PERL_SI *p = PL_curstackinfo->si_prev;
511		515
512	{	516	{ /*D*//*remove*/
513	dSP;	517	dSP;
514	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	518	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
515	PUTBACK; /* possibly superfluous */	519	PUTBACK; /* possibly superfluous */
516	}	520	}
517		521
518	if (destruct)	522	if (!IN_DESTRUCT)
519	{	523	{
520	dounwind(-1);	524	dounwind (-1);/*D*//*remove*/
521	SvREFCNT_dec(PL_curstackinfo->si_stack);	525	SvREFCNT_dec (PL_curstackinfo->si_stack);
522	}	526	}
523		527
524	Safefree(PL_curstackinfo->si_cxstack);	528	Safefree (PL_curstackinfo->si_cxstack);
525	Safefree(PL_curstackinfo);	529	Safefree (PL_curstackinfo);
526	PL_curstackinfo = p;	530	PL_curstackinfo = p;
527	}	531	}
528		532
529	Safefree(PL_tmps_stack);	533	Safefree (PL_tmps_stack);
530	Safefree(PL_markstack);	534	Safefree (PL_markstack);
531	Safefree(PL_scopestack);	535	Safefree (PL_scopestack);
532	Safefree(PL_savestack);	536	Safefree (PL_savestack);
		537	#if !PERL_VERSION_ATLEAST (5,9,0)
533	Safefree(PL_retstack);	538	Safefree (PL_retstack);
534	}
535
536	static void
537	allocate_stack (Coro__State ctx, int alloc)
538	{
539	coro_stack *stack;
540
541	New (0, stack, 1, coro_stack);
542
543	stack->refcnt = 1;
544	stack->usecnt = 1;
545	stack->gencnt = ctx->gencnt = 0;
546	if (alloc)
547	{
548	#ifdef HAVE_MMAP
549	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
550	stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
551	if (stack->sptr == (void *)-1)
552	#endif	539	#endif
553	{
554	/*FIXME*//*D*//* reasonable stack size! */
555	stack->ssize = -4096 * sizeof (long);
556	New (0, stack->sptr, 4096, long);
557	}
558	}
559	else
560	stack->sptr = 0;
561
562	ctx->stack = stack;
563	}	540	}
564		541
565	static void	542	static void
566	deallocate_stack (Coro__State ctx)	543	setup_coro (struct coro *coro)
567	{
568	coro_stack *stack = ctx->stack;
569
570	ctx->stack = 0;
571
572	if (stack)
573	{
574	if (!--stack->refcnt)
575	{
576	#ifdef HAVE_MMAP
577	if (stack->ssize > 0 && stack->sptr)
578	munmap (stack->sptr, stack->ssize);
579	else
580	#else
581	Safefree (stack->sptr);
582	#endif
583	Safefree (stack);
584	}
585	else if (ctx->gencnt == stack->gencnt)
586	--stack->usecnt;
587	}
588	}
589
590	static void
591	setup_coro (void *arg)
592	{	544	{
593	/*	545	/*
594	* emulate part of the perl startup here.	546	* emulate part of the perl startup here.
595	*/	547	*/
		548	dTHX;
596	dSP;	549	dSP;
597	Coro__State ctx = (Coro__State)arg;	550	UNOP myop;
598	SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);	551	SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
599		552
600	coro_init_stacks (aTHX);	553	coro_init_stacks ();
601	/*PL_curcop = 0;*/	554	/*PL_curcop = 0;*/
602	/*PL_in_eval = PL_in_eval;*/ /* inherit */	555	/*PL_in_eval = PL_in_eval;*/ /* inherit */
603	SvREFCNT_dec (GvAV (PL_defgv));	556	SvREFCNT_dec (GvAV (PL_defgv));
604	GvAV (PL_defgv) = ctx->args;	557	GvAV (PL_defgv) = coro->args; coro->args = 0;
605		558
606	SPAGAIN;	559	SPAGAIN;
607		560
608	if (ctx->stack)	561	Zero (&myop, 1, UNOP);
		562	myop.op_next = Nullop;
		563	myop.op_flags = OPf_WANT_VOID;
		564
		565	PL_op = (OP *)&myop;
		566
		567	PUSHMARK(SP);
		568	XPUSHs (sub_init);
		569	PUTBACK;
		570	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		571	SPAGAIN;
		572
		573	ENTER; /* necessary e.g. for dounwind */
		574	}
		575
		576	static void
		577	free_coro_mortal ()
		578	{
		579	if (coro_mortal)
609	{	580	{
610	ctx->cursp = 0;	581	SvREFCNT_dec (coro_mortal);
611		582	coro_mortal = 0;
612	PUSHMARK(SP);
613	PUTBACK;
614	(void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
615
616	if (SvTRUE (ERRSV))
617	croak (NULL);
618	else
619	croak ("FATAL: CCTXT coroutine returned!");
620	}	583	}
621	else	584	}
622	{	585
		586	static void NOINLINE
		587	prepare_cctx (coro_stack *cctx)
		588	{
		589	dSP;
623	UNOP myop;	590	UNOP myop;
624		591
625	PL_op = (OP *)&myop;
626
627	Zero(&myop, 1, UNOP);	592	Zero (&myop, 1, UNOP);
628	myop.op_next = Nullop;	593	myop.op_next = PL_op;
629	myop.op_flags = OPf_WANT_VOID;	594	myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
630		595
631	PUSHMARK(SP);	596	PUSHMARK(SP);
632	XPUSHs (sub_init);	597	EXTEND (SP, 2);
633	/*	598	PUSHs (newSViv (PTR2IV (cctx)));
634	* the next line is slightly wrong, as PL_op->op_next	599	PUSHs ((SV *)get_cv ("Coro::State::cctx_init", FALSE));
635	* is actually being executed so we skip the first op.
636	* that doesn't matter, though, since it is only
637	* pp_nextstate and we never return...
638	* ah yes, and I don't care anyways ;)
639	*/
640	PUTBACK;	600	PUTBACK;
641	PL_op = pp_entersub();	601	PL_restartop = PL_ppaddr[OP_ENTERSUB](aTHX);
642	SPAGAIN;	602	SPAGAIN;
643
644	ENTER; /* necessary e.g. for dounwind */
645	}
646	}	603	}
647		604
648	static void	605	static void
649	continue_coro (void *arg)	606	coro_run (void *arg)
650	{	607	{
651	/*	608	/*
652	* this is a _very_ stripped down perl interpreter ;)	609	* this is a _very_ stripped down perl interpreter ;)
653	*/	610	*/
654	Coro__State ctx = (Coro__State)arg;	611	UNLOCK;
655	JMPENV coro_start_env;
656		612
657	/* same as JMPENV_BOOTSTRAP */
658	Zero(&coro_start_env, 1, JMPENV);
659	coro_start_env.je_ret = -1;
660	coro_start_env.je_mustcatch = TRUE;
661	PL_top_env = &coro_start_env;	613	PL_top_env = &PL_start_env;
		614	prepare_cctx ((coro_stack *)arg);
662		615
663	ctx->cursp = 0;	616	/* somebody will hit me for both perl_run and PL_restartop */
664	PL_op = PL_op->op_next;	617	perl_run (PERL_GET_CONTEXT);
665	CALLRUNOPS(aTHX);
666		618
		619	fputs ("FATAL: C coroutine fell over the edge of the world, aborting.\n", stderr);
667	abort ();	620	abort ();
668	}	621	}
669		622
670	STATIC void	623	static coro_stack *
		624	stack_new ()
		625	{
		626	coro_stack *stack;
		627
		628	New (0, stack, 1, coro_stack);
		629
		630	#if HAVE_MMAP
		631
		632	stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
		633	/* mmap suppsedly does allocate-on-write for us */
		634	stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
		635
		636	if (stack->sptr == (void *)-1)
		637	{
		638	perror ("FATAL: unable to mmap stack for coroutine");
		639	_exit (EXIT_FAILURE);
		640	}
		641
		642	# if STACKGUARD
		643	mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
		644	# endif
		645
		646	#else
		647
		648	stack->ssize = STACKSIZE * (long)sizeof (long);
		649	New (0, stack->sptr, STACKSIZE, long);
		650
		651	if (!stack->sptr)
		652	{
		653	perror (stderr, "FATAL: unable to malloc stack for coroutine");
		654	_exit (EXIT_FAILURE);
		655	}
		656
		657	#endif
		658
		659	coro_create (&stack->cctx, coro_run, (void *)stack, stack->sptr, stack->ssize);
		660
		661	return stack;
		662	}
		663
		664	static void
		665	stack_free (coro_stack *stack)
		666	{
		667	if (!stack)
		668	return;
		669
		670	#if HAVE_MMAP
		671	munmap (stack->sptr, stack->ssize);
		672	#else
		673	Safefree (stack->sptr);
		674	#endif
		675
		676	Safefree (stack);
		677	}
		678
		679	static coro_stack *stack_first;
		680
		681	static coro_stack *
		682	stack_get ()
		683	{
		684	coro_stack *stack;
		685
		686	if (stack_first)
		687	{
		688	stack = stack_first;
		689	stack_first = stack->next;
		690	}
		691	else
		692	{
		693	stack = stack_new ();
		694	PL_op = PL_op->op_next;
		695	}
		696
		697	return stack;
		698	}
		699
		700	static void
		701	stack_put (coro_stack *stack)
		702	{
		703	stack->next = stack_first;
		704	stack_first = stack;
		705	}
		706
		707	/* never call directly, always through the coro_state_transfer global variable */
		708	static void NOINLINE
671	transfer(pTHX_ struct coro *prev, struct coro *next, int flags)	709	transfer (struct coro *prev, struct coro *next, int flags)
672	{	710	{
673	dSTACKLEVEL;	711	dSTACKLEVEL;
674	static struct coro *xnext;
675		712
		713	/* sometimes transfer is only called to set idle_sp */
		714	if (flags == TRANSFER_SET_STACKLEVEL)
		715	((coro_stack *)prev)->idle_sp = STACKLEVEL;
676	if (prev != next)	716	else if (prev != next)
677	{	717	{
678	xnext = next;	718	coro_stack *prev__stack;
		719
		720	LOCK;
679		721
680	if (next->mainstack)	722	if (next->mainstack)
681	{	723	{
		724	/* coroutine already started */
682	SAVE (prev, flags);	725	SAVE (prev, flags);
683	LOAD (next);	726	LOAD (next);
684
685	/* mark this state as in-use */
686	next->mainstack = 0;
687	next->tmps_ix = -2;
688
689	/* stacklevel changed? if yes, grab the stack for us! */
690	if (flags & TRANSFER_SAVE_CCTXT)
691	{
692	if (!prev->stack)
693	allocate_stack (prev, 0);
694	else if (prev->cursp != stacklevel
695	&& prev->stack->usecnt > 1)
696	{
697	prev->gencnt = ++prev->stack->gencnt;
698	prev->stack->usecnt = 1;
699	}
700
701	/* has our stack been invalidated? */
702	if (next->stack && next->stack->gencnt != next->gencnt)
703	{
704	deallocate_stack (next);
705	allocate_stack (next, 1);
706	coro_create (&(next->stack->cctx),
707	continue_coro, (void *)next,
708	next->stack->sptr, labs (next->stack->ssize));
709	}
710
711	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
712	/* don't add any code here */
713	}
714
715	}	727	}
716	else if (next->tmps_ix == -2)
717	croak ("tried to transfer to running coroutine");
718	else	728	else
719	{	729	{
		730	/* need to start coroutine */
720	SAVE (prev, -1); /* first get rid of the old state */	731	/* first get rid of the old state */
721		732	SAVE (prev, -1);
722	if (flags & TRANSFER_SAVE_CCTXT)	733	/* setup coroutine call */
723	{
724	if (!prev->stack)
725	allocate_stack (prev, 0);
726
727	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
728	{
729	setup_coro (next);
730
731	prev->stack->refcnt++;
732	prev->stack->usecnt++;
733	next->stack = prev->stack;
734	next->gencnt = prev->gencnt;
735	}
736	else
737	{
738	allocate_stack (next, 1);
739	coro_create (&(next->stack->cctx),
740	setup_coro, (void *)next,
741	next->stack->sptr, labs (next->stack->ssize));
742	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
743	/* don't add any code here */
744	}
745	}
746	else
747	setup_coro (next);	734	setup_coro (next);
		735	/* need a stack */
		736	next->stack = 0;
748	}	737	}
		738
		739	if (!prev->stack)
		740	/* create a new empty context */
		741	Newz (0, prev->stack, 1, coro_stack);
		742
		743	prev__stack = prev->stack;
		744
		745	/* possibly "free" the stack */
		746	if (prev__stack->idle_sp == STACKLEVEL)
		747	{
		748	stack_put (prev__stack);
		749	prev->stack = 0;
		750	}
		751
		752	if (!next->stack)
		753	next->stack = stack_get ();
		754
		755	if (prev__stack != next->stack)
		756	{
		757	prev__stack->top_env = PL_top_env;
		758	PL_top_env = next->stack->top_env;
		759	coro_transfer (&prev__stack->cctx, &next->stack->cctx);
		760	}
		761
		762	free_coro_mortal ();
		763
		764	UNLOCK;
749	}	765	}
750
751	/*
752	* xnext is now either prev or next, depending on wether
753	* we switched the c stack or not. that's why i use a global
754	* variable, that should become thread-specific at one point.
755	*/
756	xnext->cursp = stacklevel;
757	}	766	}
		767
		768	struct transfer_args
		769	{
		770	struct coro *prev, *next;
		771	int flags;
		772	};
		773
		774	#define TRANSFER(ta) transfer ((ta).prev, (ta).next, (ta).flags)
		775
		776	static void
		777	coro_state_destroy (struct coro *coro)
		778	{
		779	if (coro->refcnt--)
		780	return;
		781
		782	if (coro->mainstack && coro->mainstack != main_mainstack)
		783	{
		784	struct coro temp;
		785
		786	SAVE ((&temp), TRANSFER_SAVE_ALL);
		787	LOAD (coro);
		788
		789	destroy_stacks ();
		790
		791	LOAD ((&temp)); /* this will get rid of defsv etc.. */
		792
		793	coro->mainstack = 0;
		794	}
		795
		796	stack_free (coro->stack);
		797	SvREFCNT_dec (coro->args);
		798	Safefree (coro);
		799	}
		800
		801	static int
		802	coro_state_clear (pTHX_ SV *sv, MAGIC *mg)
		803	{
		804	struct coro *coro = (struct coro *)mg->mg_ptr;
		805	mg->mg_ptr = 0;
		806
		807	coro_state_destroy (coro);
		808
		809	return 0;
		810	}
		811
		812	static int
		813	coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
		814	{
		815	struct coro *coro = (struct coro *)mg->mg_ptr;
		816
		817	++coro->refcnt;
		818
		819	return 0;
		820	}
		821
		822	static MGVTBL coro_state_vtbl = {
		823	0, 0, 0, 0,
		824	coro_state_clear,
		825	0,
		826	#ifdef MGf_DUP
		827	coro_state_dup,
		828	#endif
		829	};
758		830
759	static struct coro *	831	static struct coro *
760	sv_to_coro (SV *arg, const char *funcname, const char *varname)	832	SvSTATE (SV *coro)
761	{	833	{
762	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)	834	HV *stash;
		835	MAGIC *mg;
		836
		837	if (SvROK (coro))
		838	coro = SvRV (coro);
		839
		840	stash = SvSTASH (coro);
		841	if (stash != coro_stash && stash != coro_state_stash)
763	{	842	{
764	HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);	843	/* very slow, but rare, check */
765		844	if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
766	if (!he)	845	croak ("Coro::State object required");
767	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
768
769	arg = HeVAL(he);
770	}	846	}
771
772	/* must also be changed inside Coro::Cont::yield */
773	if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
774	return (struct coro *) SvIV((SV*)SvRV(arg));
775		847
776	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);	848	mg = SvMAGIC (coro);
777	/*NORETURN*/	849	assert (mg->mg_type == PERL_MAGIC_ext);
		850	return (struct coro *)mg->mg_ptr;
778	}	851	}
779		852
780	static void	853	static void
		854	prepare_transfer (struct transfer_args *ta, SV *prev, SV *next, int flags)
		855	{
		856	ta->prev = SvSTATE (prev);
		857	ta->next = SvSTATE (next);
		858	ta->flags = flags;
		859	}
		860
		861	static void
781	api_transfer(pTHX_ SV *prev, SV *next, int flags)	862	api_transfer (SV *prev, SV *next, int flags)
782	{	863	{
783	transfer(aTHX_	864	dTHX;
784	sv_to_coro (prev, "Coro::transfer", "prev"),	865	struct transfer_args ta;
785	sv_to_coro (next, "Coro::transfer", "next"),	866
786	flags);	867	prepare_transfer (&ta, prev, next, flags);
		868	TRANSFER (ta);
787	}	869	}
788		870
789	/** Coro ********************************************************************/	871	/** Coro ********************************************************************/
790		872
791	#define PRIO_MAX 3	873	#define PRIO_MAX 3
…		…
795	#define PRIO_IDLE -3	877	#define PRIO_IDLE -3
796	#define PRIO_MIN -4	878	#define PRIO_MIN -4
797		879
798	/* for Coro.pm */	880	/* for Coro.pm */
799	static GV *coro_current, *coro_idle;	881	static GV *coro_current, *coro_idle;
800	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];	882	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
801	static int coro_nready;	883	static int coro_nready;
802		884
803	static void	885	static void
804	coro_enq (SV *sv)	886	coro_enq (SV *sv)
805	{	887	{
806	if (SvROK (sv))	888	int prio;
807	{	889
808	SV *hv = SvRV (sv);
809	if (SvTYPE (hv) == SVt_PVHV)	890	if (SvTYPE (sv) != SVt_PVHV)
810	{
811	SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);
812	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
813
814	prio = prio > PRIO_MAX ? PRIO_MAX
815	: prio < PRIO_MIN ? PRIO_MIN
816	: prio;
817
818	av_push (coro_ready [prio - PRIO_MIN], sv);
819	coro_nready++;
820
821	return;
822	}
823	}
824
825	croak ("Coro::ready tried to enqueue something that is not a coroutine");	891	croak ("Coro::ready tried to enqueue something that is not a coroutine");
		892
		893	prio = SvSTATE (sv)->prio;
		894
		895	av_push (coro_ready [prio - PRIO_MIN], sv);
		896	coro_nready++;
826	}	897	}
827		898
828	static SV *	899	static SV *
829	coro_deq (int min_prio)	900	coro_deq (int min_prio)
830	{	901	{
…		…
833	min_prio -= PRIO_MIN;	904	min_prio -= PRIO_MIN;
834	if (min_prio < 0)	905	if (min_prio < 0)
835	min_prio = 0;	906	min_prio = 0;
836		907
837	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )	908	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
838	if (av_len (coro_ready[prio]) >= 0)	909	if (AvFILLp (coro_ready [prio]) >= 0)
839	{	910	{
840	coro_nready--;	911	coro_nready--;
841	return av_shift (coro_ready[prio]);	912	return av_shift (coro_ready [prio]);
842	}	913	}
843		914
844	return 0;	915	return 0;
845	}	916	}
846		917
847	static void	918	static void
848	api_ready (SV *coro)	919	api_ready (SV *coro)
849	{	920	{
		921	dTHX;
		922
		923	if (SvROK (coro))
		924	coro = SvRV (coro);
		925
		926	LOCK;
850	coro_enq (SvREFCNT_inc (coro));	927	coro_enq (SvREFCNT_inc (coro));
		928	UNLOCK;
851	}	929	}
852		930
853	static void	931	static void
854	api_schedule (int cede)	932	prepare_schedule (struct transfer_args *ta)
855	{	933	{
856	SV *prev, *next;	934	SV *current, *prev, *next;
857		935
858	prev = GvSV (coro_current);	936	current = GvSV (coro_current);
859		937
860	if (cede)	938	for (;;)
861	coro_enq (SvREFCNT_inc (prev));	939	{
862		940	LOCK;
863	next = coro_deq (PRIO_MIN);	941	next = coro_deq (PRIO_MIN);
		942	UNLOCK;
864		943
865	if (!next)	944	if (next)
866	next = SvREFCNT_inc (GvSV (coro_idle));	945	break;
867		946
868	GvSV (coro_current) = SvREFCNT_inc (next);	947	{
869	transfer (aTHX_	948	dSP;
870	sv_to_coro (prev, "Coro::schedule", "current coroutine"),	949
871	sv_to_coro (next, "Coro::schedule", "next coroutine"),	950	ENTER;
872	TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);	951	SAVETMPS;
873	SvREFCNT_dec (next);	952
874	SvREFCNT_dec (prev);	953	PUSHMARK (SP);
		954	PUTBACK;
		955	call_sv (GvSV (coro_idle), G_DISCARD);
		956
		957	FREETMPS;
		958	LEAVE;
		959	}
		960	}
		961
		962	prev = SvRV (current);
		963	SvRV (current) = next;
		964
		965	/* free this only after the transfer */
		966	LOCK;
		967	free_coro_mortal ();
		968	UNLOCK;
		969	coro_mortal = prev;
		970
		971	ta->prev = SvSTATE (prev);
		972	ta->next = SvSTATE (next);
		973	ta->flags = TRANSFER_SAVE_ALL;
		974	}
		975
		976	static void
		977	prepare_cede (struct transfer_args *ta)
		978	{
		979	LOCK;
		980	coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
		981	UNLOCK;
		982
		983	prepare_schedule (ta);
		984	}
		985
		986	static void
		987	api_schedule (void)
		988	{
		989	dTHX;
		990	struct transfer_args ta;
		991
		992	prepare_schedule (&ta);
		993	TRANSFER (ta);
		994	}
		995
		996	static void
		997	api_cede (void)
		998	{
		999	dTHX;
		1000	struct transfer_args ta;
		1001
		1002	prepare_cede (&ta);
		1003	TRANSFER (ta);
875	}	1004	}
876		1005
877	MODULE = Coro::State PACKAGE = Coro::State	1006	MODULE = Coro::State PACKAGE = Coro::State
878		1007
879	PROTOTYPES: ENABLE	1008	PROTOTYPES: DISABLE
880		1009
881	BOOT:	1010	BOOT:
882	{ /* {} necessary for stoopid perl-5.6.x */	1011	{
883	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);	1012	#ifdef USE_ITHREADS
884	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);	1013	MUTEX_INIT (&coro_mutex);
		1014	#endif
		1015	BOOT_PAGESIZE;
		1016
885	coro_state_stash = gv_stashpv ("Coro::State", TRUE);	1017	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
886		1018
887	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	1019	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
888	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	1020	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
889	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));	1021	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
890	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
891
892	if (!padlist_cache)
893	padlist_cache = newHV ();
894		1022
895	main_mainstack = PL_mainstack;	1023	main_mainstack = PL_mainstack;
896		1024
897	coroapi.ver = CORO_API_VERSION;	1025	coroapi.ver = CORO_API_VERSION;
898	coroapi.transfer = api_transfer;	1026	coroapi.transfer = api_transfer;
899	}
900		1027
901	Coro::State	1028	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
902	_newprocess(args)	1029	}
903	SV * args	1030
904	PROTOTYPE: $	1031	SV *
		1032	new (char *klass, ...)
905	CODE:	1033	CODE:
906	Coro__State coro;	1034	{
		1035	struct coro *coro;
		1036	HV *hv;
		1037	int i;
907		1038
908	if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
909	croak ("Coro::State::_newprocess expects an arrayref");
910
911	New (0, coro, 1, struct coro);	1039	Newz (0, coro, 1, struct coro);
		1040	coro->args = newAV ();
912		1041
913	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	1042	hv = newHV ();
		1043	sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
		1044	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
		1045
		1046	for (i = 1; i < items; i++)
		1047	av_push (coro->args, newSVsv (ST (i)));
		1048
914	coro->mainstack = 0; /* actual work is done inside transfer */	1049	/*coro->mainstack = 0; *//*actual work is done inside transfer */
915	coro->stack = 0;	1050	/*coro->stack = 0;*/
916		1051	}
917	RETVAL = coro;
918	OUTPUT:	1052	OUTPUT:
919	RETVAL	1053	RETVAL
920		1054
921	void	1055	void
922	transfer(prev, next, flags)	1056	_set_stacklevel (...)
923	Coro::State_or_hashref prev	1057	ALIAS:
924	Coro::State_or_hashref next	1058	Coro::State::transfer = 1
925	int flags	1059	Coro::schedule = 2
926	PROTOTYPE: @	1060	Coro::cede = 3
		1061	Coro::Cont::yield = 4
927	CODE:	1062	CODE:
928	PUTBACK;	1063	{
929	transfer (aTHX_ prev, next, flags);	1064	struct transfer_args ta;
930	SPAGAIN;	1065
		1066	switch (ix)
		1067	{
		1068	case 0:
		1069	ta.prev = (struct coro *)INT2PTR (coro_stack *, SvIV (ST (0)));
		1070	ta.next = 0;
		1071	ta.flags = TRANSFER_SET_STACKLEVEL;
		1072	break;
		1073
		1074	case 1:
		1075	if (items != 3)
		1076	croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
		1077
		1078	prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
		1079	break;
		1080
		1081	case 2:
		1082	prepare_schedule (&ta);
		1083	break;
		1084
		1085	case 3:
		1086	prepare_cede (&ta);
		1087	break;
		1088
		1089	case 4:
		1090	{
		1091	SV *yieldstack;
		1092	SV *sv;
		1093	AV *defav = GvAV (PL_defgv);
		1094
		1095	yieldstack = *hv_fetch (
		1096	(HV *)SvRV (GvSV (coro_current)),
		1097	"yieldstack", sizeof ("yieldstack") - 1,
		1098	0
		1099	);
		1100
		1101	/* set up @_ -- ugly */
		1102	av_clear (defav);
		1103	av_fill (defav, items - 1);
		1104	while (items--)
		1105	av_store (defav, items, SvREFCNT_inc (ST(items)));
		1106
		1107	sv = av_pop ((AV *)SvRV (yieldstack));
		1108	ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
		1109	ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
		1110	ta.flags = 0;
		1111	SvREFCNT_dec (sv);
		1112	}
		1113	break;
		1114
		1115	}
		1116
		1117	TRANSFER (ta);
		1118	}
931		1119
932	void	1120	void
933	DESTROY(coro)	1121	_clone_state_from (SV *dst, SV *src)
934	Coro::State coro	1122	CODE:
935	CODE:	1123	{
		1124	struct coro *coro_src = SvSTATE (src);
936		1125
937	if (coro->mainstack && coro->mainstack != main_mainstack)	1126	sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
938	{
939	struct coro temp;
940		1127
941	PUTBACK;	1128	++coro_src->refcnt;
942	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);	1129	sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
943	LOAD(aTHX_ coro);	1130	}
944	SPAGAIN;
945
946	destroy_stacks (aTHX);
947
948	LOAD((&temp)); /* this will get rid of defsv etc.. */
949	SPAGAIN;
950
951	coro->mainstack = 0;
952	}
953
954	deallocate_stack (coro);
955
956	Safefree (coro);
957		1131
958	void	1132	void
959	flush()
960	CODE:
961	#ifdef MAY_FLUSH
962	flush_padlist_cache ();
963	#endif
964
965	void
966	_exit(code)	1133	_exit (code)
967	int code	1134	int code
968	PROTOTYPE: $	1135	PROTOTYPE: $
969	CODE:	1136	CODE:
970	#if defined(__GLIBC__) || _POSIX_C_SOURCE
971	_exit (code);	1137	_exit (code);
972	#else
973	signal (SIGTERM, SIG_DFL);
974	raise (SIGTERM);
975	exit (code);
976	#endif
977
978	MODULE = Coro::State PACKAGE = Coro::Cont
979
980	# this is slightly dirty (should expose a c-level api)
981
982	void
983	yield(...)
984	PROTOTYPE: @
985	CODE:
986	static SV *returnstk;
987	SV *sv;
988	AV *defav = GvAV (PL_defgv);
989	struct coro *prev, *next;
990
991	if (!returnstk)
992	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
993
994	/* set up @_ -- ugly */
995	av_clear (defav);
996	av_fill (defav, items - 1);
997	while (items--)
998	av_store (defav, items, SvREFCNT_inc (ST(items)));
999
1000	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
1001	sv = av_pop ((AV *)SvRV (returnstk));
1002	prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
1003	next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
1004	SvREFCNT_dec (sv);
1005
1006	transfer(aTHX_ prev, next, 0);
1007		1138
1008	MODULE = Coro::State PACKAGE = Coro	1139	MODULE = Coro::State PACKAGE = Coro
1009		1140
1010	# this is slightly dirty (should expose a c-level api)
1011
1012	BOOT:	1141	BOOT:
1013	{	1142	{
1014	int i;	1143	int i;
		1144
1015	HV *stash = gv_stashpv ("Coro", TRUE);	1145	coro_stash = gv_stashpv ("Coro", TRUE);
1016		1146
1017	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));	1147	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1018	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));	1148	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1019	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));	1149	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1020	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));	1150	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1021	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));	1151	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1022	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));	1152	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1023		1153
1024	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);	1154	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1025	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);	1155	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1026		1156
1027	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )	1157	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
…		…
1029		1159
1030	{	1160	{
1031	SV *sv = perl_get_sv("Coro::API", 1);	1161	SV *sv = perl_get_sv("Coro::API", 1);
1032		1162
1033	coroapi.schedule = api_schedule;	1163	coroapi.schedule = api_schedule;
		1164	coroapi.cede = api_cede;
1034	coroapi.ready = api_ready;	1165	coroapi.ready = api_ready;
1035	coroapi.nready = &coro_nready;	1166	coroapi.nready = &coro_nready;
1036	coroapi.current = coro_current;	1167	coroapi.current = coro_current;
1037		1168
1038	GCoroAPI = &coroapi;	1169	GCoroAPI = &coroapi;
1039	sv_setiv(sv, (IV)&coroapi);	1170	sv_setiv (sv, (IV)&coroapi);
1040	SvREADONLY_on(sv);	1171	SvREADONLY_on (sv);
1041	}	1172	}
1042	}	1173	}
1043		1174
		1175	int
		1176	prio (Coro::State coro, int newprio = 0)
		1177	ALIAS:
		1178	nice = 1
		1179	CODE:
		1180	{
		1181	RETVAL = coro->prio;
		1182
		1183	if (items > 1)
		1184	{
		1185	if (ix)
		1186	newprio += coro->prio;
		1187
		1188	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
		1189	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
		1190
		1191	coro->prio = newprio;
		1192	}
		1193	}
		1194
1044	void	1195	void
1045	ready(self)	1196	ready (SV *self)
1046	SV * self	1197	PROTOTYPE: $
1047	CODE:	1198	CODE:
1048	api_ready (self);	1199	api_ready (self);
1049		1200
1050	int	1201	int
1051	nready(...)	1202	nready (...)
1052	PROTOTYPE:	1203	PROTOTYPE:
1053	CODE:	1204	CODE:
1054	RETVAL = coro_nready;	1205	RETVAL = coro_nready;
1055	OUTPUT:	1206	OUTPUT:
1056	RETVAL	1207	RETVAL
1057		1208
		1209	MODULE = Coro::State PACKAGE = Coro::AIO
		1210
		1211	SV *
		1212	_get_state ()
		1213	CODE:
		1214	{
		1215	struct {
		1216	int errorno;
		1217	int laststype;
		1218	int laststatval;
		1219	Stat_t statcache;
		1220	} data;
		1221
		1222	data.errorno = errno;
		1223	data.laststype = PL_laststype;
		1224	data.laststatval = PL_laststatval;
		1225	data.statcache = PL_statcache;
		1226
		1227	RETVAL = newSVpvn ((char *)&data, sizeof data);
		1228	}
		1229	OUTPUT:
		1230	RETVAL
		1231
1058	void	1232	void
1059	schedule(...)	1233	_set_state (char *data_)
1060	PROTOTYPE:	1234	PROTOTYPE: $
1061	ALIAS:
1062	cede = 1
1063	CODE:	1235	CODE:
1064	api_schedule (ix);	1236	{
		1237	struct {
		1238	int errorno;
		1239	int laststype;
		1240	int laststatval;
		1241	Stat_t statcache;
		1242	} *data = (void *)data_;
1065		1243
		1244	errno = data->errorno;
		1245	PL_laststype = data->laststype;
		1246	PL_laststatval = data->laststatval;
		1247	PL_statcache = data->statcache;
		1248	}

Diff Legend

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