ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.17 by root, Wed Jul 25 14:01:46 2001 UTC vs.
Revision 1.101 by root, Mon Nov 27 00:08:18 2006 UTC

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

Diff Legend

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