ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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