ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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