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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.15 by root, Wed Jul 25 04:14:38 2001 UTC vs. Revision 1.77 by root, Tue Oct 31 23:55:33 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.15 by root, Wed Jul 25 04:14:38 2001 UTC vs.
Revision 1.77 by root, Tue Oct 31 23:55:33 2006 UTC