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

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.70 by root, Mon Dec 26 19:26:52 2005 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.70 by root, Mon Dec 26 19:26:52 2005 UTC