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

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.84 by root, Fri Nov 24 00:31:21 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.84 by root, Fri Nov 24 00:31:21 2006 UTC