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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.11 by root, Sat Jul 21 18:21:45 2001 UTC vs. Revision 1.67 by root, Mon Dec 12 20:07:44 2005 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.11 by root, Sat Jul 21 18:21:45 2001 UTC vs.
Revision 1.67 by root, Mon Dec 12 20:07:44 2005 UTC