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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.19 by root, Sun Jul 29 01:11:41 2001 UTC vs. Revision 1.80 by root, Thu Nov 2 20:00:00 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.19 by root, Sun Jul 29 01:11:41 2001 UTC vs.
Revision 1.80 by root, Thu Nov 2 20:00:00 2006 UTC