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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.8 by root, Thu Jul 19 04:13:22 2001 UTC vs. Revision 1.76 by root, Thu Oct 26 08:45:56 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.8 by root, Thu Jul 19 04:13:22 2001 UTC vs.
Revision 1.76 by root, Thu Oct 26 08:45:56 2006 UTC