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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.9 by root, Sat Jul 21 02:49:09 2001 UTC vs.
Revision 1.66 by root, Mon Dec 12 19:43:41 2005 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 <signal.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 0
		66	# define UNLOCK 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);
…		…
97	AvFLAGS (av) = AVf_REIFY;	175	AvFLAGS (av) = AVf_REIFY;
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
		281	#define PERL_MAGIC_coro PERL_MAGIC_ext
		282
		283	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
180		284
181	/* the next two functions merely cache the padlists */	285	/* the next two functions merely cache the padlists */
182	STATIC void	286	STATIC void
183	get_padlist (CV *cv)	287	get_padlist (pTHX_ CV *cv)
184	{	288	{
185	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 0);	289	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
186		290
187	if (he && AvFILLp ((AV )he) >= 0)	291	if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
188	CvPADLIST (cv) = (AV )av_pop ((AV )*he);	292	CvPADLIST (cv) = (AV )av_pop ((AV )mg->mg_obj);
189	else	293	else
190	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));	294	CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv));
191	}	295	}
192		296
193	STATIC void	297	STATIC void
194	put_padlist (CV *cv)	298	put_padlist (pTHX_ CV *cv)
195	{	299	{
196	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 1);	300	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
197		301
198	if (SvTYPE (*he) != SVt_PVAV)	302	if (!mg)
199	{	303	{
200	SvREFCNT_dec (*he);	304	sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
		305	mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
		306	mg->mg_virtual = &vtbl_coro;
201	he = (SV )newAV ();	307	mg->mg_obj = (SV *)newAV ();
202	}	308	}
203		309
204	av_push ((AV )he, (SV *)CvPADLIST (cv));	310	av_push ((AV )mg->mg_obj, (SV )CvPADLIST (cv));
205	}	311	}
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		312
233	#define SB do {	313	#define SB do {
234	#define SE } while (0)	314	#define SE } while (0)
235		315
236	#define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE	316	#define LOAD(state) load_state(aTHX_ (state));
237	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE	317	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
238		318
239	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE	319	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
240		320
241	static void	321	static void
242	load_state(pTHX_ Coro__State c)	322	load_state(pTHX_ Coro__State c)
243	{	323	{
244	PL_dowarn = c->dowarn;	324	PL_dowarn = c->dowarn;
		325	PL_in_eval = c->in_eval;
245		326
246	PL_curstackinfo = c->curstackinfo;	327	PL_curstackinfo = c->curstackinfo;
247	PL_curstack = c->curstack;	328	PL_curstack = c->curstack;
248	PL_mainstack = c->mainstack;	329	PL_mainstack = c->mainstack;
249	PL_stack_sp = c->stack_sp;	330	PL_stack_sp = c->stack_sp;
250	PL_op = c->op;	331	PL_op = c->op;
251	PL_curpad = c->curpad;	332	PL_curpad = c->curpad;
		333	PL_comppad = c->comppad;
		334	PL_compcv = c->compcv;
252	PL_stack_base = c->stack_base;	335	PL_stack_base = c->stack_base;
253	PL_stack_max = c->stack_max;	336	PL_stack_max = c->stack_max;
254	PL_tmps_stack = c->tmps_stack;	337	PL_tmps_stack = c->tmps_stack;
255	PL_tmps_floor = c->tmps_floor;	338	PL_tmps_floor = c->tmps_floor;
256	PL_tmps_ix = c->tmps_ix;	339	PL_tmps_ix = c->tmps_ix;
…		…
265	PL_savestack_ix = c->savestack_ix;	348	PL_savestack_ix = c->savestack_ix;
266	PL_savestack_max = c->savestack_max;	349	PL_savestack_max = c->savestack_max;
267	PL_retstack = c->retstack;	350	PL_retstack = c->retstack;
268	PL_retstack_ix = c->retstack_ix;	351	PL_retstack_ix = c->retstack_ix;
269	PL_retstack_max = c->retstack_max;	352	PL_retstack_max = c->retstack_max;
		353	PL_curpm = c->curpm;
270	PL_curcop = c->curcop;	354	PL_curcop = c->curcop;
		355	PL_top_env = c->top_env;
271		356
272	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	357	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
273	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	358	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
274	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);	359	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
275		360
…		…
282	{	367	{
283	AV padlist = (AV )POPs;	368	AV padlist = (AV )POPs;
284		369
285	if (padlist)	370	if (padlist)
286	{	371	{
287	put_padlist (cv); /* mark this padlist as available */	372	put_padlist (aTHX_ cv); /* mark this padlist as available */
288	CvPADLIST(cv) = padlist;	373	CvPADLIST(cv) = padlist;
289	#ifdef USE_THREADS
290	/CvOWNER(cv) = (struct perl_thread )POPs;*/
291	#endif
292	}	374	}
293		375
294	++CvDEPTH(cv);	376	++CvDEPTH(cv);
295	}	377	}
296		378
…		…
302	save_state(pTHX_ Coro__State c, int flags)	384	save_state(pTHX_ Coro__State c, int flags)
303	{	385	{
304	{	386	{
305	dSP;	387	dSP;
306	I32 cxix = cxstack_ix;	388	I32 cxix = cxstack_ix;
		389	PERL_CONTEXT *ccstk = cxstack;
307	PERL_SI *top_si = PL_curstackinfo;	390	PERL_SI *top_si = PL_curstackinfo;
308	PERL_CONTEXT *ccstk = cxstack;
309		391
310	/*	392	/*
311	* the worst thing you can imagine happens first - we have to save	393	* the worst thing you can imagine happens first - we have to save
312	* (and reinitialize) all cv's in the whole callchain :(	394	* (and reinitialize) all cv's in the whole callchain :(
313	*/	395	*/
314		396
315	PUSHs (Nullsv);	397	PUSHs (Nullsv);
316	/* this loop was inspired by pp_caller */	398	/* this loop was inspired by pp_caller */
317	for (;;)	399	for (;;)
318	{	400	{
319	do	401	while (cxix >= 0)
320	{	402	{
321	PERL_CONTEXT *cx = &ccstk[cxix--];	403	PERL_CONTEXT *cx = &ccstk[cxix--];
322		404
323	if (CxTYPE(cx) == CXt_SUB)	405	if (CxTYPE(cx) == CXt_SUB)
324	{	406	{
325	CV *cv = cx->blk_sub.cv;	407	CV *cv = cx->blk_sub.cv;
326	if (CvDEPTH(cv))	408	if (CvDEPTH(cv))
327	{	409	{
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);	410	EXTEND (SP, CvDEPTH(cv)*2);
334		411
335	while (--CvDEPTH(cv))	412	while (--CvDEPTH(cv))
336	{	413	{
337	/* this tells the restore code to increment CvDEPTH */	414	/* this tells the restore code to increment CvDEPTH */
…		…
340	}	417	}
341		418
342	PUSHs ((SV *)CvPADLIST(cv));	419	PUSHs ((SV *)CvPADLIST(cv));
343	PUSHs ((SV *)cv);	420	PUSHs ((SV *)cv);
344		421
345	get_padlist (cv); /* this is a monster */	422	get_padlist (aTHX_ cv); /* this is a monster */
346	}	423	}
347	}	424	}
		425	#ifdef CXt_FORMAT
348	else if (CxTYPE(cx) == CXt_FORMAT)	426	else if (CxTYPE(cx) == CXt_FORMAT)
349	{	427	{
350	/* I never used formats, so how should I know how these are implemented? */	428	/* I never used formats, so how should I know how these are implemented? */
351	/* my bold guess is as a simple, plain sub... */	429	/* my bold guess is as a simple, plain sub... */
352	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");	430	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
353	}	431	}
		432	#endif
354	}	433	}
355	while (cxix >= 0);
356		434
357	if (top_si->si_type == PERLSI_MAIN)	435	if (top_si->si_type == PERLSI_MAIN)
358	break;	436	break;
359		437
360	top_si = top_si->si_prev;	438	top_si = top_si->si_prev;
…		…
363	}	441	}
364		442
365	PUTBACK;	443	PUTBACK;
366	}	444	}
367		445
368	c->defav = flags & SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;	446	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
369	c->defsv = flags & SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	447	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
370	c->errsv = flags & SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;	448	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
371		449
372	c->dowarn = PL_dowarn;	450	c->dowarn = PL_dowarn;
		451	c->in_eval = PL_in_eval;
373		452
374	c->curstackinfo = PL_curstackinfo;	453	c->curstackinfo = PL_curstackinfo;
375	c->curstack = PL_curstack;	454	c->curstack = PL_curstack;
376	c->mainstack = PL_mainstack;	455	c->mainstack = PL_mainstack;
377	c->stack_sp = PL_stack_sp;	456	c->stack_sp = PL_stack_sp;
378	c->op = PL_op;	457	c->op = PL_op;
379	c->curpad = PL_curpad;	458	c->curpad = PL_curpad;
		459	c->comppad = PL_comppad;
		460	c->compcv = PL_compcv;
380	c->stack_base = PL_stack_base;	461	c->stack_base = PL_stack_base;
381	c->stack_max = PL_stack_max;	462	c->stack_max = PL_stack_max;
382	c->tmps_stack = PL_tmps_stack;	463	c->tmps_stack = PL_tmps_stack;
383	c->tmps_floor = PL_tmps_floor;	464	c->tmps_floor = PL_tmps_floor;
384	c->tmps_ix = PL_tmps_ix;	465	c->tmps_ix = PL_tmps_ix;
…		…
393	c->savestack_ix = PL_savestack_ix;	474	c->savestack_ix = PL_savestack_ix;
394	c->savestack_max = PL_savestack_max;	475	c->savestack_max = PL_savestack_max;
395	c->retstack = PL_retstack;	476	c->retstack = PL_retstack;
396	c->retstack_ix = PL_retstack_ix;	477	c->retstack_ix = PL_retstack_ix;
397	c->retstack_max = PL_retstack_max;	478	c->retstack_max = PL_retstack_max;
		479	c->curpm = PL_curpm;
398	c->curcop = PL_curcop;	480	c->curcop = PL_curcop;
		481	c->top_env = PL_top_env;
		482	}
		483
		484	/*
		485	* allocate various perl stacks. This is an exact copy
		486	* of perl.c:init_stacks, except that it uses less memory
		487	* on the (sometimes correct) assumption that coroutines do
		488	* not usually need a lot of stackspace.
		489	*/
		490	STATIC void
		491	coro_init_stacks (pTHX)
		492	{
		493	LOCK;
		494
		495	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
		496	PL_curstackinfo->si_type = PERLSI_MAIN;
		497	PL_curstack = PL_curstackinfo->si_stack;
		498	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
		499
		500	PL_stack_base = AvARRAY(PL_curstack);
		501	PL_stack_sp = PL_stack_base;
		502	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
		503
		504	New(50,PL_tmps_stack,96,SV*);
		505	PL_tmps_floor = -1;
		506	PL_tmps_ix = -1;
		507	PL_tmps_max = 96;
		508
		509	New(54,PL_markstack,16,I32);
		510	PL_markstack_ptr = PL_markstack;
		511	PL_markstack_max = PL_markstack + 16;
		512
		513	#ifdef SET_MARK_OFFSET
		514	SET_MARK_OFFSET;
		515	#endif
		516
		517	New(54,PL_scopestack,16,I32);
		518	PL_scopestack_ix = 0;
		519	PL_scopestack_max = 16;
		520
		521	New(54,PL_savestack,96,ANY);
		522	PL_savestack_ix = 0;
		523	PL_savestack_max = 96;
		524
		525	New(54,PL_retstack,8,OP*);
		526	PL_retstack_ix = 0;
		527	PL_retstack_max = 8;
		528
		529	UNLOCK;
399	}	530	}
400		531
401	/*	532	/*
402	* destroy the stacks, the callchain etc...	533	* destroy the stacks, the callchain etc...
403	* still there is a memleak of 128 bytes...
404	*/	534	*/
405	STATIC void	535	STATIC void
406	destroy_stacks(pTHX)	536	destroy_stacks(pTHX)
407	{	537	{
		538	if (!IN_DESTRUCT)
		539	{
408	/* is this ugly, I ask? */	540	/* is this ugly, I ask? */
409	while (PL_scopestack_ix)	541	LEAVE_SCOPE (0);
410	LEAVE;
411		542
412	/* sure it is, but more important: is it correct?? :/ */	543	/* 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;	544	FREETMPS;
		545
		546	/POPSTACK_TO (PL_mainstack);//D//use/
		547	}
415		548
416	while (PL_curstackinfo->si_next)	549	while (PL_curstackinfo->si_next)
417	PL_curstackinfo = PL_curstackinfo->si_next;	550	PL_curstackinfo = PL_curstackinfo->si_next;
418		551
419	while (PL_curstackinfo)	552	while (PL_curstackinfo)
420	{	553	{
421	PERL_SI *p = PL_curstackinfo->si_prev;	554	PERL_SI *p = PL_curstackinfo->si_prev;
422		555
423	{	556	{ /D//remove/
424	dSP;	557	dSP;
425	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	558	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
426	PUTBACK; /* possibly superfluous */	559	PUTBACK; /* possibly superfluous */
427	}	560	}
428		561
429	dounwind(-1);	562	if (!IN_DESTRUCT)
430		563	{
		564	dounwind (-1);/D//remove/
431	SvREFCNT_dec(PL_curstackinfo->si_stack);	565	SvREFCNT_dec (PL_curstackinfo->si_stack);
		566	}
		567
432	Safefree(PL_curstackinfo->si_cxstack);	568	Safefree (PL_curstackinfo->si_cxstack);
433	Safefree(PL_curstackinfo);	569	Safefree (PL_curstackinfo);
434	PL_curstackinfo = p;	570	PL_curstackinfo = p;
435	}	571	}
436		572
437	Safefree(PL_tmps_stack);	573	Safefree (PL_tmps_stack);
438	Safefree(PL_markstack);	574	Safefree (PL_markstack);
439	Safefree(PL_scopestack);	575	Safefree (PL_scopestack);
440	Safefree(PL_savestack);	576	Safefree (PL_savestack);
441	Safefree(PL_retstack);	577	Safefree (PL_retstack);
		578	}
		579
		580	static void
		581	allocate_stack (Coro__State ctx, int alloc)
		582	{
		583	coro_stack *stack;
		584
		585	New (0, stack, 1, coro_stack);
		586
		587	stack->refcnt = 1;
		588	stack->usecnt = 1;
		589	stack->gencnt = ctx->gencnt = 0;
		590
		591	if (alloc)
		592	{
		593	#if HAVE_MMAP
		594	stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */
		595	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
		596	if (stack->sptr == (void *)-1)
		597	#endif
		598	{
		599	/FIXME//D//* reasonable stack size! */
		600	stack->ssize = - (8192 * sizeof (long));
		601	New (0, stack->sptr, 8192, long);
		602	}
		603	}
		604	else
		605	stack->sptr = 0;
		606
		607	ctx->stack = stack;
		608	}
		609
		610	static void
		611	deallocate_stack (Coro__State ctx)
		612	{
		613	coro_stack *stack = ctx->stack;
		614
		615	ctx->stack = 0;
		616
		617	if (stack)
		618	{
		619	if (!--stack->refcnt)
		620	{
		621	#ifdef HAVE_MMAP
		622	if (stack->ssize > 0 && stack->sptr)
		623	munmap (stack->sptr, stack->ssize);
		624	else
		625	#endif
		626	Safefree (stack->sptr);
		627
		628	Safefree (stack);
		629	}
		630	else if (ctx->gencnt == stack->gencnt)
		631	--stack->usecnt;
		632	}
		633	}
		634
		635	static void
		636	setup_coro (void *arg)
		637	{
		638	/*
		639	* emulate part of the perl startup here.
		640	*/
		641	dTHX;
		642	dSP;
		643	Coro__State ctx = (Coro__State)arg;
		644	SV sub_init = (SV )get_cv (SUB_INIT, FALSE);
		645
		646	coro_init_stacks (aTHX);
		647	/PL_curcop = 0;/
		648	/PL_in_eval = PL_in_eval;/ /* inherit */
		649	SvREFCNT_dec (GvAV (PL_defgv));
		650	GvAV (PL_defgv) = ctx->args; ctx->args = 0;
		651
		652	SPAGAIN;
		653
		654	if (ctx->stack)
		655	{
		656	ctx->cursp = 0;
		657
		658	PUSHMARK(SP);
		659	PUTBACK;
		660	(void) call_sv (sub_init, G_VOID\|G_NOARGS\|G_EVAL);
		661
		662	if (SvTRUE (ERRSV))
		663	croak (NULL);
		664	else
		665	croak ("FATAL: CCTXT coroutine returned!");
		666	}
		667	else
		668	{
		669	UNOP myop;
		670
		671	PL_op = (OP *)&myop;
		672
		673	Zero(&myop, 1, UNOP);
		674	myop.op_next = Nullop;
		675	myop.op_flags = OPf_WANT_VOID;
		676
		677	PUSHMARK(SP);
		678	XPUSHs (sub_init);
		679	/*
		680	* the next line is slightly wrong, as PL_op->op_next
		681	* is actually being executed so we skip the first op.
		682	* that doesn't matter, though, since it is only
		683	* pp_nextstate and we never return...
		684	* ah yes, and I don't care anyways ;)
		685	*/
		686	PUTBACK;
		687	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		688	SPAGAIN;
		689
		690	ENTER; /* necessary e.g. for dounwind */
		691	}
		692	}
		693
		694	static void
		695	continue_coro (void *arg)
		696	{
		697	/*
		698	* this is a _very_ stripped down perl interpreter ;)
		699	*/
		700	dTHX;
		701	Coro__State ctx = (Coro__State)arg;
		702	JMPENV coro_start_env;
		703
		704	PL_top_env = &ctx->start_env;
		705
		706	ctx->cursp = 0;
		707	PL_op = PL_op->op_next;
		708	CALLRUNOPS(aTHX);
		709
		710	abort ();
442	}	711	}
443		712
444	STATIC void	713	STATIC void
445	transfer(pTHX_ struct coro prev, struct coro next, int flags)	714	transfer (pTHX_ struct coro prev, struct coro next, int flags)
446	{	715	{
447	dSP;	716	dSTACKLEVEL;
448		717
449	if (prev != next)	718	if (prev != next)
450	{	719	{
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)	720	if (next->mainstack)
458	{	721	{
		722	LOCK;
459	SAVE (prev, flags);	723	SAVE (prev, flags);
460	LOAD (next);	724	LOAD (next);
		725	UNLOCK;
		726
461	/* mark this state as in-use */	727	/* mark this state as in-use */
462	next->mainstack = 0;	728	next->mainstack = 0;
463	next->tmps_ix = -2;	729	next->tmps_ix = -2;
		730
		731	/* stacklevel changed? if yes, grab the stack for us! */
		732	if (flags & TRANSFER_SAVE_CCTXT)
		733	{
		734	if (!prev->stack)
		735	allocate_stack (prev, 0);
		736	else if (prev->cursp != stacklevel
		737	&& prev->stack->usecnt > 1)
		738	{
		739	prev->gencnt = ++prev->stack->gencnt;
		740	prev->stack->usecnt = 1;
		741	}
		742
		743	/* has our stack been invalidated? */
		744	if (next->stack && next->stack->gencnt != next->gencnt)
		745	{
		746	deallocate_stack (next);
		747	allocate_stack (next, 1);
		748	coro_create (&(next->stack->cctx),
		749	continue_coro, (void *)next,
		750	next->stack->sptr, labs (next->stack->ssize));
		751	}
		752
		753	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		754	prev->cursp = stacklevel;
		755	/* don't add any code here */
		756	}
		757	else
		758	next->cursp = stacklevel;
464	}	759	}
465	else if (next->tmps_ix == -2)	760	else if (next->tmps_ix == -2)
466	{
467	croak ("tried to transfer to running coroutine");	761	croak ("tried to transfer to running coroutine");
468	}
469	else	762	else
470	{	763	{
471	/*	764	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 */	765	SAVE (prev, -1); /* first get rid of the old state */
		766	UNLOCK;
477		767
478	init_stacks (); /* from perl.c */	768	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	*/	769	{
499	PUTBACK;	770	if (!prev->stack)
500	PL_op = pp_entersub(aTHX);	771	allocate_stack (prev, 0);
501	SPAGAIN;
502		772
503	ENTER; /* necessary e.g. for dounwind */	773	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
		774	{
		775	PL_top_env = &next->start_env;
		776
		777	setup_coro (next);
		778	next->cursp = stacklevel;
		779
		780	prev->stack->refcnt++;
		781	prev->stack->usecnt++;
		782	next->stack = prev->stack;
		783	next->gencnt = prev->gencnt;
		784	}
		785	else
		786	{
		787	assert (!next->stack);
		788	allocate_stack (next, 1);
		789	coro_create (&(next->stack->cctx),
		790	setup_coro, (void *)next,
		791	next->stack->sptr, labs (next->stack->ssize));
		792	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		793	prev->cursp = stacklevel;
		794	/* don't add any code here */
		795	}
		796	}
		797	else
		798	{
		799	setup_coro (next);
		800	next->cursp = stacklevel;
		801	}
504	}	802	}
505	}	803	}
		804
		805	LOCK;
		806	if (coro_mortal)
		807	{
		808	SvREFCNT_dec (coro_mortal);
		809	coro_mortal = 0;
		810	}
		811	UNLOCK;
		812	}
		813
		814	#define SV_CORO(sv,func) \
		815	do { \
		816	if (SvROK (sv)) \
		817	sv = SvRV (sv); \
		818	\
		819	if (SvTYPE (sv) == SVt_PVHV) \
		820	{ \
		821	HE he = hv_fetch_ent ((HV )sv, ucoro_state_sv, 0, ucoro_state_hash); \
		822	\
		823	if (!he) \
		824	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
		825	\
		826	(sv) = SvRV (HeVAL(he)); \
		827	} \
		828	\
		829	/* must also be changed inside Coro::Cont::yield */ \
		830	if (!SvOBJECT (sv) \|\| SvSTASH (sv) != coro_state_stash) \
		831	croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
		832	\
		833	} while(0)
		834
		835	#define SvSTATE(sv) (struct coro *)SvIV (sv)
		836
		837	static void
		838	api_transfer(pTHX_ SV prev, SV next, int flags)
		839	{
		840	SV_CORO (prev, "Coro::transfer");
		841	SV_CORO (next, "Coro::transfer");
		842
		843	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
		844	}
		845
		846	/ Coro ******************************************************************/
		847
		848	#define PRIO_MAX 3
		849	#define PRIO_HIGH 1
		850	#define PRIO_NORMAL 0
		851	#define PRIO_LOW -1
		852	#define PRIO_IDLE -3
		853	#define PRIO_MIN -4
		854
		855	/* for Coro.pm */
		856	static GV coro_current, coro_idle;
		857	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
		858	static int coro_nready;
		859
		860	static void
		861	coro_enq (pTHX_ SV *sv)
		862	{
		863	if (SvTYPE (sv) == SVt_PVHV)
		864	{
		865	SV *xprio = hv_fetch ((HV )sv, "prio", 4, 0);
		866	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
		867
		868	prio = prio > PRIO_MAX ? PRIO_MAX
		869	: prio < PRIO_MIN ? PRIO_MIN
		870	: prio;
		871
		872	av_push (coro_ready [prio - PRIO_MIN], sv);
		873	coro_nready++;
		874
		875	return;
		876	}
		877
		878	croak ("Coro::ready tried to enqueue something that is not a coroutine");
		879	}
		880
		881	static SV *
		882	coro_deq (pTHX_ int min_prio)
		883	{
		884	int prio = PRIO_MAX - PRIO_MIN;
		885
		886	min_prio -= PRIO_MIN;
		887	if (min_prio < 0)
		888	min_prio = 0;
		889
		890	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
		891	if (av_len (coro_ready[prio]) >= 0)
		892	{
		893	coro_nready--;
		894	return av_shift (coro_ready[prio]);
		895	}
		896
		897	return 0;
		898	}
		899
		900	static void
		901	api_ready (SV *coro)
		902	{
		903	dTHX;
		904
		905	if (SvROK (coro))
		906	coro = SvRV (coro);
		907
		908	LOCK;
		909	coro_enq (aTHX_ SvREFCNT_inc (coro));
		910	UNLOCK;
		911	}
		912
		913	static void
		914	api_schedule (void)
		915	{
		916	dTHX;
		917
		918	SV prev, next;
		919
		920	LOCK;
		921
		922	prev = SvRV (GvSV (coro_current));
		923	next = coro_deq (aTHX_ PRIO_MIN);
		924
		925	if (!next)
		926	next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
		927
		928	/* free this only after the transfer */
		929	coro_mortal = prev;
		930	SV_CORO (prev, "Coro::schedule");
		931
		932	SvRV (GvSV (coro_current)) = next;
		933
		934	SV_CORO (next, "Coro::schedule");
		935
		936	UNLOCK;
		937
		938	transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
		939	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);
		940	}
		941
		942	static void
		943	api_cede (void)
		944	{
		945	dTHX;
		946
		947	LOCK;
		948	coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
		949	UNLOCK;
		950
		951	api_schedule ();
506	}	952	}
507		953
508	MODULE = Coro::State PACKAGE = Coro::State	954	MODULE = Coro::State PACKAGE = Coro::State
509		955
510	PROTOTYPES: ENABLE	956	PROTOTYPES: ENABLE
511		957
512	BOOT:	958	BOOT:
513	{ /* {} necessary for stoopid perl-5.6.x */	959	{ /* {} necessary for stoopid perl-5.6.x */
		960	#ifdef USE_ITHREADS
		961	MUTEX_INIT (&coro_mutex);
		962	#endif
		963
		964	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
		965	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
514	HV * stash = gv_stashpvn("Coro::State", 10, TRUE);	966	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
515		967
516	newCONSTSUB (stash, "SAVE_DEFAV", newSViv (SAVE_DEFAV));	968	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
517	newCONSTSUB (stash, "SAVE_DEFSV", newSViv (SAVE_DEFSV));	969	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
518	newCONSTSUB (stash, "SAVE_ERRSV", newSViv (SAVE_ERRSV));	970	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
		971	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
519		972
520	if (!padlist_cache)	973	main_mainstack = PL_mainstack;
521	padlist_cache = newHV ();	974
		975	coroapi.ver = CORO_API_VERSION;
		976	coroapi.transfer = api_transfer;
522	}	977	}
523		978
524	Coro::State	979	Coro::State
525	_newprocess(args)	980	_newprocess(args)
526	SV * args	981	SV * args
…		…
529	Coro__State coro;	984	Coro__State coro;
530		985
531	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)	986	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
532	croak ("Coro::State::_newprocess expects an arrayref");	987	croak ("Coro::State::_newprocess expects an arrayref");
533		988
534	New (0, coro, 1, struct coro);	989	Newz (0, coro, 1, struct coro);
535		990
536	coro->mainstack = 0; /* actual work is done inside transfer */
537	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	991	coro->args = (AV *)SvREFCNT_inc (SvRV (args));
		992	/coro->mainstack = 0; //actual work is done inside transfer /
		993	/coro->stack = 0;/
		994
		995	/* same as JMPENV_BOOTSTRAP */
		996	/* we might be able to recycle start_env, but safe is safe */
		997	/Zero(&coro->start_env, 1, JMPENV);/
		998	coro->start_env.je_ret = -1;
		999	coro->start_env.je_mustcatch = TRUE;
538		1000
539	RETVAL = coro;	1001	RETVAL = coro;
540	OUTPUT:	1002	OUTPUT:
541	RETVAL	1003	RETVAL
542		1004
543	void	1005	void
544	transfer(prev, next, flags = SAVE_DEFAV)	1006	transfer(prev, next, flags)
545	Coro::State_or_hashref prev	1007	SV *prev
546	Coro::State_or_hashref next	1008	SV *next
547	int flags	1009	int flags
548	PROTOTYPE: @	1010	PROTOTYPE: @
549	CODE:	1011	CODE:
550		1012	PUTBACK;
		1013	SV_CORO (next, "Coro::transfer");
		1014	SV_CORO (prev, "Coro::transfer");
551	transfer (aTHX_ prev, next, flags);	1015	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
		1016	SPAGAIN;
552		1017
553	void	1018	void
554	DESTROY(coro)	1019	DESTROY(coro)
555	Coro::State coro	1020	Coro::State coro
556	CODE:	1021	CODE:
557		1022
558	if (coro->mainstack)	1023	if (coro->mainstack && coro->mainstack != main_mainstack)
559	{	1024	{
560	struct coro temp;	1025	struct coro temp;
561		1026
		1027	PUTBACK;
562	SAVE(aTHX_ (&temp), SAVE_ALL);	1028	SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
563	LOAD(aTHX_ coro);	1029	LOAD (aTHX_ coro);
		1030	SPAGAIN;
564		1031
565	destroy_stacks ();	1032	destroy_stacks (aTHX);
566		1033
567	LOAD((&temp)); /* this will get rid of defsv etc.. */	1034	LOAD ((&temp)); /* this will get rid of defsv etc.. */
		1035	SPAGAIN;
		1036
		1037	coro->mainstack = 0;
568	}	1038	}
569		1039
		1040	deallocate_stack (coro);
		1041	SvREFCNT_dec (coro->args);
570	Safefree (coro);	1042	Safefree (coro);
571		1043
572	void	1044	void
573	flush()	1045	_exit(code)
		1046	int code
		1047	PROTOTYPE: $
574	CODE:	1048	CODE:
575	#ifdef MAY_FLUSH	1049	_exit (code);
576	flush_padlist_cache ();
577	#endif
578		1050
579	MODULE = Coro::State PACKAGE = Coro::Cont	1051	MODULE = Coro::State PACKAGE = Coro::Cont
580		1052
581	# this is dirty and should be in it's own .xs	1053	# this is slightly dirty (should expose a c-level api)
582		1054
583	void	1055	void
584	result(...)	1056	yield(...)
585	PROTOTYPE: @	1057	PROTOTYPE: @
586	CODE:	1058	CODE:
587	static SV *returnstk;	1059	SV *yieldstack;
588	SV *sv;	1060	SV *sv;
589	AV *defav = GvAV (PL_defgv);	1061	AV *defav = GvAV (PL_defgv);
590	struct coro prev, next;	1062	struct coro prev, next;
591		1063
592	if (!returnstk)	1064	yieldstack = *hv_fetch (
593	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1065	(HV *)SvRV (GvSV (coro_current)),
		1066	"yieldstack", sizeof ("yieldstack") - 1,
		1067	0
		1068	);
594		1069
595	/* set up @_ */	1070	/* set up @_ -- ugly */
596	av_clear (defav);	1071	av_clear (defav);
597	av_fill (defav, items - 1);	1072	av_fill (defav, items - 1);
598	while (items--)	1073	while (items--)
599	av_store (defav, items, SvREFCNT_inc (ST(items)));	1074	av_store (defav, items, SvREFCNT_inc (ST(items)));
600		1075
601	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
602	sv = av_pop ((AV *)SvRV (returnstk));	1076	sv = av_pop ((AV *)SvRV (yieldstack));
603	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));	1077	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));
604	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));	1078	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));
605	SvREFCNT_dec (sv);	1079	SvREFCNT_dec (sv);
		1080
606	transfer(prev, next, 0);	1081	transfer (aTHX_ prev, next, 0);
607		1082
		1083	MODULE = Coro::State PACKAGE = Coro
		1084
		1085	# this is slightly dirty (should expose a c-level api)
		1086
		1087	BOOT:
		1088	{
		1089	int i;
		1090	HV *stash = gv_stashpv ("Coro", TRUE);
		1091
		1092	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
		1093	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
		1094	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
		1095	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
		1096	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
		1097	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
		1098
		1099	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
		1100	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
		1101
		1102	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
		1103	coro_ready[i] = newAV ();
		1104
		1105	{
		1106	SV *sv = perl_get_sv("Coro::API", 1);
		1107
		1108	coroapi.schedule = api_schedule;
		1109	coroapi.cede = api_cede;
		1110	coroapi.ready = api_ready;
		1111	coroapi.nready = &coro_nready;
		1112	coroapi.current = coro_current;
		1113
		1114	GCoroAPI = &coroapi;
		1115	sv_setiv(sv, (IV)&coroapi);
		1116	SvREADONLY_on(sv);
		1117	}
		1118	}
		1119
		1120	#if !PERL_MICRO
		1121
		1122	void
		1123	ready(self)
		1124	SV * self
		1125	PROTOTYPE: $
		1126	CODE:
		1127	api_ready (self);
		1128
		1129	#endif
		1130
		1131	int
		1132	nready(...)
		1133	PROTOTYPE:
		1134	CODE:
		1135	RETVAL = coro_nready;
		1136	OUTPUT:
		1137	RETVAL
		1138
		1139	void
		1140	schedule(...)
		1141	PROTOTYPE:
		1142	CODE:
		1143	api_schedule ();
		1144
		1145	void
		1146	cede(...)
		1147	PROTOTYPE:
		1148	CODE:
		1149	api_cede ();
		1150

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.9 by root, Sat Jul 21 02:49:09 2001 UTC vs. Revision 1.66 by root, Mon Dec 12 19:43:41 2005 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.9 by root, Sat Jul 21 02:49:09 2001 UTC vs.
Revision 1.66 by root, Mon Dec 12 19:43:41 2005 UTC