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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.19 by root, Sun Jul 29 01:11:41 2001 UTC vs.
Revision 1.75 by root, Thu Oct 26 06:50:20 2006 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.19 by root, Sun Jul 29 01:11:41 2001 UTC vs. Revision 1.75 by root, Thu Oct 26 06:50:20 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.19 by root, Sun Jul 29 01:11:41 2001 UTC vs.
Revision 1.75 by root, Thu Oct 26 06:50:20 2006 UTC