ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.46 by pcg, Wed Nov 5 20:02:46 2003 UTC vs.
Revision 1.93 by root, Sun Nov 26 03:22:50 2006 UTC

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

Diff Legend

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