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

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

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.16 by root, Wed Jul 25 04:26:55 2001 UTC vs.
Revision 1.86 by root, Fri Nov 24 11:36:57 2006 UTC