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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.24 by root, Tue Aug 14 14:56:22 2001 UTC vs. Revision 1.99 by root, Sun Nov 26 23:53:20 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.24 by root, Tue Aug 14 14:56:22 2001 UTC vs.
Revision 1.99 by root, Sun Nov 26 23:53:20 2006 UTC