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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.13 by root, Mon Jul 23 22:09:39 2001 UTC vs. Revision 1.85 by root, Fri Nov 24 00:32:04 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.13 by root, Mon Jul 23 22:09:39 2001 UTC vs.
Revision 1.85 by root, Fri Nov 24 00:32:04 2006 UTC