ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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