ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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