[ViewVC] Diff of: cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.28 by root, Sat Aug 25 21:32:05 2001 UTC vs.
Revision 1.103 by root, Mon Nov 27 01:33:30 2006 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.28 by root, Sat Aug 25 21:32:05 2001 UTC vs. Revision 1.103 by root, Mon Nov 27 01:33:30 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.28 by root, Sat Aug 25 21:32:05 2001 UTC vs.
Revision 1.103 by root, Mon Nov 27 01:33:30 2006 UTC