ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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