ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.22 by root, Sat Aug 11 23:10:56 2001 UTC vs.
Revision 1.93 by root, Sun Nov 26 03:22:50 2006 UTC

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

Diff Legend

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