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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.29 by root, Sat Aug 25 21:40:34 2001 UTC vs.
Revision 1.92 by root, Sun Nov 26 02:16:19 2006 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.29 by root, Sat Aug 25 21:40:34 2001 UTC vs. Revision 1.92 by root, Sun Nov 26 02:16:19 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.29 by root, Sat Aug 25 21:40:34 2001 UTC vs.
Revision 1.92 by root, Sun Nov 26 02:16:19 2006 UTC