ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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