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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.13 by root, Mon Jul 23 22:09:39 2001 UTC vs.
Revision 1.74 by root, Mon Oct 23 22:49:09 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>
		38	# ifndef MAP_ANONYMOUS
		39	# ifdef MAP_ANON
		40	# define MAP_ANONYMOUS MAP_ANON
		41	# else
		42	# undef HAVE_MMAP
		43	# endif
10	#endif	44	# endif
		45	#endif
11		46
12	#define MAY_FLUSH /* increases codesize */
13
14	#define SUB_INIT "Coro::State::initialize"	47	#define SUB_INIT "Coro::State::initialize"
		48	#define UCORO_STATE "_coro_state"
15		49
16	#define TRANSFER_SAVE_DEFAV 0x00000001	50	/* The next macro should declare a variable stacklevel that contains and approximation
17	#define TRANSFER_SAVE_DEFSV 0x00000002	51	* to the current C stack pointer. Its property is that it changes with each call
18	#define TRANSFER_SAVE_ERRSV 0x00000004	52	* and should be unique. */
19	#define TRANSFER_SAVE_CCTXT 0x00000008	53	#define dSTACKLEVEL void *stacklevel = &stacklevel
20		54
21	#define TRANSFER_SAVE_ALL -1	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)
		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 */
		76
		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 */
		82
		83	coro_context cctx;
		84
		85	void *sptr;
		86	long ssize; /* positive == mmap, otherwise malloc */
		87	} coro_stack;
22		88
23	struct coro {	89	struct coro {
		90	/* the top-level JMPENV for each coroutine, needed to catch dies. */
		91	JMPENV start_env;
		92
24	/* the optional C context */	93	/* the optional C context */
25	coro_context cctx;	94	coro_stack *stack;
26	void *sptr;	95	void *cursp;
27	long ssize;	96	int gencnt;
28		97
29	/* optionally saved, might be zero */	98	/* optionally saved, might be zero */
30	AV *defav;	99	AV *defav;
31	SV *defsv;	100	SV *defsv;
32	SV *errsv;	101	SV *errsv;
33		102
34	/* saved global state not related to stacks */	103	/* saved global state not related to stacks */
35	U8 dowarn;	104	U8 dowarn;
		105	I32 in_eval;
36		106
37	/* the stacks and related info (callchain etc..) */	107	/* the stacks and related info (callchain etc..) */
38	PERL_SI *curstackinfo;	108	PERL_SI *curstackinfo;
39	AV *curstack;	109	AV *curstack;
40	AV *mainstack;	110	AV *mainstack;
41	SV **stack_sp;	111	SV **stack_sp;
42	OP *op;	112	OP *op;
43	SV **curpad;	113	SV **curpad;
		114	AV *comppad;
		115	CV *compcv;
44	SV **stack_base;	116	SV **stack_base;
45	SV **stack_max;	117	SV **stack_max;
46	SV **tmps_stack;	118	SV **tmps_stack;
47	I32 tmps_floor;	119	I32 tmps_floor;
48	I32 tmps_ix;	120	I32 tmps_ix;
57	I32 savestack_ix;	129	I32 savestack_ix;
58	I32 savestack_max;	130	I32 savestack_max;
59	OP **retstack;	131	OP **retstack;
60	I32 retstack_ix;	132	I32 retstack_ix;
61	I32 retstack_max;	133	I32 retstack_max;
		134	PMOP *curpm;
62	COP *curcop;	135	COP *curcop;
63	JMPENV start_env;
64	JMPENV *top_env;	136	JMPENV *top_env;
65		137
66	/* data associated with this coroutine (initial args) */	138	/* data associated with this coroutine (initial args) */
67	AV *args;	139	AV *args;
68	};	140	};
69		141
70	typedef struct coro *Coro__State;	142	typedef struct coro *Coro__State;
71	typedef struct coro *Coro__State_or_hashref;	143	typedef struct coro *Coro__State_or_hashref;
72		144
73	static AV main_mainstack; / used to differentiate between $main and others */
74	static HV *coro_state_stash;
75	static HV *padlist_cache;
76
77	/* mostly copied from op.c:cv_clone2 */	145	/* mostly copied from op.c:cv_clone2 */
78	STATIC AV *	146	STATIC AV *
79	clone_padlist (AV *protopadlist)	147	clone_padlist (pTHX_ AV *protopadlist)
80	{	148	{
81	AV *av;	149	AV *av;
82	I32 ix;	150	I32 ix;
83	AV protopad_name = (AV ) * av_fetch (protopadlist, 0, FALSE);	151	AV protopad_name = (AV ) * av_fetch (protopadlist, 0, FALSE);
84	AV protopad = (AV ) * av_fetch (protopadlist, 1, FALSE);	152	AV protopad = (AV ) * av_fetch (protopadlist, 1, FALSE);
…		…
103	av_store (newpadlist, 1, (SV *) newpad);	171	av_store (newpadlist, 1, (SV *) newpad);
104		172
105	av = newAV (); /* will be @_ */	173	av = newAV (); /* will be @_ */
106	av_extend (av, 0);	174	av_extend (av, 0);
107	av_store (newpad, 0, (SV *) av);	175	av_store (newpad, 0, (SV *) av);
108	AvFLAGS (av) = AVf_REIFY;	176	AvREIFY_on (av);
109		177
110	for (ix = fpad; ix > 0; ix--)	178	for (ix = fpad; ix > 0; ix--)
111	{	179	{
112	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;	180	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
		181
113	if (namesv && namesv != &PL_sv_undef)	182	if (namesv && namesv != &PL_sv_undef)
114	{	183	{
115	char name = SvPVX (namesv); / XXX */	184	char name = SvPVX (namesv); / XXX */
		185
116	if (SvFLAGS (namesv) & SVf_FAKE \|\| *name == '&')	186	if (SvFLAGS (namesv) & SVf_FAKE \|\| *name == '&')
117	{ /* lexical from outside? */	187	{ /* lexical from outside? */
118	npad[ix] = SvREFCNT_inc (ppad[ix]);	188	npad[ix] = SvREFCNT_inc (ppad[ix]);
119	}	189	}
120	else	190	else
…		…
126	sv = (SV *) newAV ();	196	sv = (SV *) newAV ();
127	else if (*name == '%')	197	else if (*name == '%')
128	sv = (SV *) newHV ();	198	sv = (SV *) newHV ();
129	else	199	else
130	sv = NEWSV (0, 0);	200	sv = NEWSV (0, 0);
		201
		202	#ifdef SvPADBUSY
131	if (!SvPADBUSY (sv))	203	if (!SvPADBUSY (sv))
		204	#endif
132	SvPADMY_on (sv);	205	SvPADMY_on (sv);
		206
133	npad[ix] = sv;	207	npad[ix] = sv;
134	}	208	}
135	}	209	}
136	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))	210	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))
137	{	211	{
…		…
166	#endif	240	#endif
167		241
168	return newpadlist;	242	return newpadlist;
169	}	243	}
170		244
171	#ifdef MAY_FLUSH	245	STATIC void
172	STATIC AV *
173	free_padlist (AV *padlist)	246	free_padlist (pTHX_ AV *padlist)
174	{	247	{
175	/* may be during global destruction */	248	/* may be during global destruction */
176	if (SvREFCNT(padlist))	249	if (SvREFCNT (padlist))
177	{	250	{
178	I32 i = AvFILLp(padlist);	251	I32 i = AvFILLp (padlist);
179	while (i >= 0)	252	while (i >= 0)
180	{	253	{
181	SV **svp = av_fetch(padlist, i--, FALSE);	254	SV **svp = av_fetch (padlist, i--, FALSE);
182	SV sv = svp ? svp : Nullsv;
183	if (sv)	255	if (svp)
		256	{
		257	SV *sv;
		258	while (&PL_sv_undef != (sv = av_pop ((AV )svp)))
184	SvREFCNT_dec(sv);	259	SvREFCNT_dec (sv);
		260
		261	SvREFCNT_dec (*svp);
		262	}
185	}	263	}
186		264
187	SvREFCNT_dec((SV*)padlist);	265	SvREFCNT_dec ((SV*)padlist);
188	}	266	}
189	}	267	}
190	#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};
191		285
192	/* the next two functions merely cache the padlists */	286	/* the next two functions merely cache the padlists */
193	STATIC void	287	STATIC void
194	get_padlist (CV *cv)	288	get_padlist (pTHX_ CV *cv)
195	{	289	{
196	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 0);	290	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
197		291
198	if (he && AvFILLp ((AV )he) >= 0)	292	if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
199	CvPADLIST (cv) = (AV )av_pop ((AV )*he);	293	CvPADLIST (cv) = (AV )av_pop ((AV )mg->mg_obj);
200	else	294	else
201	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));	295	CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv));
202	}	296	}
203		297
204	STATIC void	298	STATIC void
205	put_padlist (CV *cv)	299	put_padlist (pTHX_ CV *cv)
206	{	300	{
207	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 1);	301	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
208		302
209	if (SvTYPE (*he) != SVt_PVAV)	303	if (!mg)
210	{	304	{
211	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;
212	he = (SV )newAV ();	308	mg->mg_obj = (SV *)newAV ();
213	}	309	}
214		310
215	av_push ((AV )he, (SV *)CvPADLIST (cv));	311	av_push ((AV )mg->mg_obj, (SV )CvPADLIST (cv));
216	}	312	}
217
218	#ifdef MAY_FLUSH
219	STATIC void
220	flush_padlist_cache ()
221	{
222	HV *hv = padlist_cache;
223	padlist_cache = newHV ();
224
225	if (hv_iterinit (hv))
226	{
227	HE *he;
228	AV *padlist;
229
230	while (!!(he = hv_iternext (hv)))
231	{
232	AV av = (AV )HeVAL(he);
233
234	/* casting is fun. */
235	while (&PL_sv_undef != (SV )(padlist = (AV )av_pop (av)))
236	free_padlist (padlist);
237	}
238	}
239
240	SvREFCNT_dec (hv);
241	}
242	#endif
243		313
244	#define SB do {	314	#define SB do {
245	#define SE } while (0)	315	#define SE } while (0)
246		316
247	#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE	317	#define LOAD(state) load_state(aTHX_ (state));
248	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE	318	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
249		319
250	#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
251		321
252	static void	322	static void
253	load_state(pTHX_ Coro__State c)	323	load_state(pTHX_ Coro__State c)
254	{	324	{
255	PL_dowarn = c->dowarn;	325	PL_dowarn = c->dowarn;
		326	PL_in_eval = c->in_eval;
256		327
257	PL_curstackinfo = c->curstackinfo;	328	PL_curstackinfo = c->curstackinfo;
258	PL_curstack = c->curstack;	329	PL_curstack = c->curstack;
259	PL_mainstack = c->mainstack;	330	PL_mainstack = c->mainstack;
260	PL_stack_sp = c->stack_sp;	331	PL_stack_sp = c->stack_sp;
261	PL_op = c->op;	332	PL_op = c->op;
262	PL_curpad = c->curpad;	333	PL_curpad = c->curpad;
		334	PL_comppad = c->comppad;
		335	PL_compcv = c->compcv;
263	PL_stack_base = c->stack_base;	336	PL_stack_base = c->stack_base;
264	PL_stack_max = c->stack_max;	337	PL_stack_max = c->stack_max;
265	PL_tmps_stack = c->tmps_stack;	338	PL_tmps_stack = c->tmps_stack;
266	PL_tmps_floor = c->tmps_floor;	339	PL_tmps_floor = c->tmps_floor;
267	PL_tmps_ix = c->tmps_ix;	340	PL_tmps_ix = c->tmps_ix;
…		…
273	PL_scopestack_ix = c->scopestack_ix;	346	PL_scopestack_ix = c->scopestack_ix;
274	PL_scopestack_max = c->scopestack_max;	347	PL_scopestack_max = c->scopestack_max;
275	PL_savestack = c->savestack;	348	PL_savestack = c->savestack;
276	PL_savestack_ix = c->savestack_ix;	349	PL_savestack_ix = c->savestack_ix;
277	PL_savestack_max = c->savestack_max;	350	PL_savestack_max = c->savestack_max;
		351	#if PERL_VERSION < 9
278	PL_retstack = c->retstack;	352	PL_retstack = c->retstack;
279	PL_retstack_ix = c->retstack_ix;	353	PL_retstack_ix = c->retstack_ix;
280	PL_retstack_max = c->retstack_max;	354	PL_retstack_max = c->retstack_max;
		355	#endif
		356	PL_curpm = c->curpm;
281	PL_curcop = c->curcop;	357	PL_curcop = c->curcop;
282	PL_start_env = c->start_env;
283	PL_top_env = c->top_env;	358	PL_top_env = c->top_env;
284		359
285	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	360	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
286	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	361	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
287	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);	362	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
…		…
295	{	370	{
296	AV padlist = (AV )POPs;	371	AV padlist = (AV )POPs;
297		372
298	if (padlist)	373	if (padlist)
299	{	374	{
300	put_padlist (cv); /* mark this padlist as available */	375	put_padlist (aTHX_ cv); /* mark this padlist as available */
301	CvPADLIST(cv) = padlist;	376	CvPADLIST(cv) = padlist;
302	#ifdef USE_THREADS
303	/CvOWNER(cv) = (struct perl_thread )POPs;*/
304	#endif
305	}	377	}
306		378
307	++CvDEPTH(cv);	379	++CvDEPTH(cv);
308	}	380	}
309		381
…		…
327		399
328	PUSHs (Nullsv);	400	PUSHs (Nullsv);
329	/* this loop was inspired by pp_caller */	401	/* this loop was inspired by pp_caller */
330	for (;;)	402	for (;;)
331	{	403	{
332	do	404	while (cxix >= 0)
333	{	405	{
334	PERL_CONTEXT *cx = &ccstk[cxix--];	406	PERL_CONTEXT *cx = &ccstk[cxix--];
335		407
336	if (CxTYPE(cx) == CXt_SUB)	408	if (CxTYPE(cx) == CXt_SUB)
337	{	409	{
338	CV *cv = cx->blk_sub.cv;	410	CV *cv = cx->blk_sub.cv;
339	if (CvDEPTH(cv))	411	if (CvDEPTH(cv))
340	{	412	{
341	#ifdef USE_THREADS
342	/XPUSHs ((SV )CvOWNER(cv));*/
343	/CvOWNER(cv) = 0;/
344	/error must unlock this cv etc.. etc.../
345	#endif
346	EXTEND (SP, CvDEPTH(cv)*2);	413	EXTEND (SP, CvDEPTH(cv)*2);
347		414
348	while (--CvDEPTH(cv))	415	while (--CvDEPTH(cv))
349	{	416	{
350	/* this tells the restore code to increment CvDEPTH */	417	/* this tells the restore code to increment CvDEPTH */
…		…
353	}	420	}
354		421
355	PUSHs ((SV *)CvPADLIST(cv));	422	PUSHs ((SV *)CvPADLIST(cv));
356	PUSHs ((SV *)cv);	423	PUSHs ((SV *)cv);
357		424
358	get_padlist (cv); /* this is a monster */	425	get_padlist (aTHX_ cv); /* this is a monster */
359	}	426	}
360	}	427	}
		428	#ifdef CXt_FORMAT
361	else if (CxTYPE(cx) == CXt_FORMAT)	429	else if (CxTYPE(cx) == CXt_FORMAT)
362	{	430	{
363	/* 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? */
364	/* my bold guess is as a simple, plain sub... */	432	/* my bold guess is as a simple, plain sub... */
365	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");
366	}	434	}
		435	#endif
367	}	436	}
368	while (cxix >= 0);
369		437
370	if (top_si->si_type == PERLSI_MAIN)	438	if (top_si->si_type == PERLSI_MAIN)
371	break;	439	break;
372		440
373	top_si = top_si->si_prev;	441	top_si = top_si->si_prev;
…		…
380		448
381	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;
382	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	450	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
383	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;	451	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
384		452
385	/* I have not the slightest idea of why av_reify is necessary */
386	/* but if it's missing the defav contents magically get replaced sometimes */
387	if (c->defav)
388	av_reify (c->defav);
389
390	c->dowarn = PL_dowarn;	453	c->dowarn = PL_dowarn;
		454	c->in_eval = PL_in_eval;
391		455
392	c->curstackinfo = PL_curstackinfo;	456	c->curstackinfo = PL_curstackinfo;
393	c->curstack = PL_curstack;	457	c->curstack = PL_curstack;
394	c->mainstack = PL_mainstack;	458	c->mainstack = PL_mainstack;
395	c->stack_sp = PL_stack_sp;	459	c->stack_sp = PL_stack_sp;
396	c->op = PL_op;	460	c->op = PL_op;
397	c->curpad = PL_curpad;	461	c->curpad = PL_curpad;
		462	c->comppad = PL_comppad;
		463	c->compcv = PL_compcv;
398	c->stack_base = PL_stack_base;	464	c->stack_base = PL_stack_base;
399	c->stack_max = PL_stack_max;	465	c->stack_max = PL_stack_max;
400	c->tmps_stack = PL_tmps_stack;	466	c->tmps_stack = PL_tmps_stack;
401	c->tmps_floor = PL_tmps_floor;	467	c->tmps_floor = PL_tmps_floor;
402	c->tmps_ix = PL_tmps_ix;	468	c->tmps_ix = PL_tmps_ix;
…		…
408	c->scopestack_ix = PL_scopestack_ix;	474	c->scopestack_ix = PL_scopestack_ix;
409	c->scopestack_max = PL_scopestack_max;	475	c->scopestack_max = PL_scopestack_max;
410	c->savestack = PL_savestack;	476	c->savestack = PL_savestack;
411	c->savestack_ix = PL_savestack_ix;	477	c->savestack_ix = PL_savestack_ix;
412	c->savestack_max = PL_savestack_max;	478	c->savestack_max = PL_savestack_max;
		479	#if PERL_VERSION < 9
413	c->retstack = PL_retstack;	480	c->retstack = PL_retstack;
414	c->retstack_ix = PL_retstack_ix;	481	c->retstack_ix = PL_retstack_ix;
415	c->retstack_max = PL_retstack_max;	482	c->retstack_max = PL_retstack_max;
		483	#endif
		484	c->curpm = PL_curpm;
416	c->curcop = PL_curcop;	485	c->curcop = PL_curcop;
417	c->start_env = PL_start_env;
418	c->top_env = PL_top_env;	486	c->top_env = PL_top_env;
419	}	487	}
420		488
421	/*	489	/*
422	* allocate various perl stacks. This is an exact copy	490	* allocate various perl stacks. This is an exact copy
423	* of perl.c:init_stacks, except that it uses less memory	491	* of perl.c:init_stacks, except that it uses less memory
424	* on the assumption that coroutines do not usually need	492	* on the (sometimes correct) assumption that coroutines do
425	* a lot of stackspace.	493	* not usually need a lot of stackspace.
426	*/	494	*/
427	STATIC void	495	STATIC void
428	coro_init_stacks (pTHX)	496	coro_init_stacks (pTHX)
429	{	497	{
		498	LOCK;
		499
430	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);	500	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
431	PL_curstackinfo->si_type = PERLSI_MAIN;	501	PL_curstackinfo->si_type = PERLSI_MAIN;
432	PL_curstack = PL_curstackinfo->si_stack;	502	PL_curstack = PL_curstackinfo->si_stack;
433	PL_mainstack = PL_curstack; /* remember in case we switch stacks */	503	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
434		504
435	PL_stack_base = AvARRAY(PL_curstack);	505	PL_stack_base = AvARRAY(PL_curstack);
436	PL_stack_sp = PL_stack_base;	506	PL_stack_sp = PL_stack_base;
437	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);	507	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
438		508
439	New(50,PL_tmps_stack,64,SV*);	509	New(50,PL_tmps_stack,96,SV*);
440	PL_tmps_floor = -1;	510	PL_tmps_floor = -1;
441	PL_tmps_ix = -1;	511	PL_tmps_ix = -1;
442	PL_tmps_max = 64;	512	PL_tmps_max = 96;
443		513
444	New(54,PL_markstack,12,I32);	514	New(54,PL_markstack,16,I32);
445	PL_markstack_ptr = PL_markstack;	515	PL_markstack_ptr = PL_markstack;
446	PL_markstack_max = PL_markstack + 12;	516	PL_markstack_max = PL_markstack + 16;
447		517
		518	#ifdef SET_MARK_OFFSET
448	SET_MARK_OFFSET;	519	SET_MARK_OFFSET;
		520	#endif
449		521
450	New(54,PL_scopestack,12,I32);	522	New(54,PL_scopestack,16,I32);
451	PL_scopestack_ix = 0;	523	PL_scopestack_ix = 0;
452	PL_scopestack_max = 12;	524	PL_scopestack_max = 16;
453		525
454	New(54,PL_savestack,64,ANY);	526	New(54,PL_savestack,96,ANY);
455	PL_savestack_ix = 0;	527	PL_savestack_ix = 0;
456	PL_savestack_max = 64;	528	PL_savestack_max = 96;
457		529
		530	#if PERL_VERSION < 9
458	New(54,PL_retstack,8,OP*);	531	New(54,PL_retstack,8,OP*);
459	PL_retstack_ix = 0;	532	PL_retstack_ix = 0;
460	PL_retstack_max = 8;	533	PL_retstack_max = 8;
		534	#endif
		535
		536	UNLOCK;
461	}	537	}
462		538
463	/*	539	/*
464	* destroy the stacks, the callchain etc...	540	* destroy the stacks, the callchain etc...
465	* still there is a memleak of 128 bytes...
466	*/	541	*/
467	STATIC void	542	STATIC void
468	destroy_stacks(pTHX)	543	destroy_stacks(pTHX)
469	{	544	{
		545	if (!IN_DESTRUCT)
		546	{
470	/* is this ugly, I ask? */	547	/* is this ugly, I ask? */
471	while (PL_scopestack_ix)	548	LEAVE_SCOPE (0);
472	LEAVE;
473		549
474	/* sure it is, but more important: is it correct?? :/ */	550	/* sure it is, but more important: is it correct?? :/ */
475	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
476	FREETMPS;	551	FREETMPS;
		552
		553	/POPSTACK_TO (PL_mainstack);//D//use/
		554	}
477		555
478	while (PL_curstackinfo->si_next)	556	while (PL_curstackinfo->si_next)
479	PL_curstackinfo = PL_curstackinfo->si_next;	557	PL_curstackinfo = PL_curstackinfo->si_next;
480		558
481	while (PL_curstackinfo)	559	while (PL_curstackinfo)
482	{	560	{
483	PERL_SI *p = PL_curstackinfo->si_prev;	561	PERL_SI *p = PL_curstackinfo->si_prev;
484		562
485	{	563	{ /D//remove/
486	dSP;	564	dSP;
487	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	565	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
488	PUTBACK; /* possibly superfluous */	566	PUTBACK; /* possibly superfluous */
489	}	567	}
490		568
491	dounwind(-1);	569	if (!IN_DESTRUCT)
492		570	{
		571	dounwind (-1);/D//remove/
493	SvREFCNT_dec(PL_curstackinfo->si_stack);	572	SvREFCNT_dec (PL_curstackinfo->si_stack);
		573	}
		574
494	Safefree(PL_curstackinfo->si_cxstack);	575	Safefree (PL_curstackinfo->si_cxstack);
495	Safefree(PL_curstackinfo);	576	Safefree (PL_curstackinfo);
496	PL_curstackinfo = p;	577	PL_curstackinfo = p;
497	}	578	}
498		579
499	Safefree(PL_tmps_stack);	580	Safefree (PL_tmps_stack);
500	Safefree(PL_markstack);	581	Safefree (PL_markstack);
501	Safefree(PL_scopestack);	582	Safefree (PL_scopestack);
502	Safefree(PL_savestack);	583	Safefree (PL_savestack);
		584	#if PERL_VERSION < 9
503	Safefree(PL_retstack);	585	Safefree (PL_retstack);
		586	#endif
504	}	587	}
505		588
506	static void	589	static void
507	allocate_stack (Coro__State ctx)	590	allocate_stack (Coro__State ctx, int alloc)
508	{	591	{
509	#ifdef HAVE_MMAP	592	coro_stack *stack;
510	ctx->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-use */	593
511	ctx->sptr = mmap (0, ctx->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANON, 0, 0);	594	New (0, stack, 1, coro_stack);
512	if (ctx->sptr == (void *)-1)	595
513	#endif	596	stack->refcnt = 1;
		597	stack->usecnt = 1;
		598	stack->gencnt = ctx->gencnt = 0;
		599
		600	if (alloc)
514	{	601	{
		602	#if HAVE_MMAP
		603	stack->ssize = STACKSIZE * sizeof (long); /* mmap should do allocate-on-write for us */
		604	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
		605	if (stack->sptr == (void *)-1)
		606	#endif
		607	{
515	/FIXME//D//* reasonable stack size! */	608	/FIXME//D//* reasonable stack size! */
516	ctx->ssize = 4096 * sizeof (long);	609	stack->ssize = - (STACKSIZE * sizeof (long));
517	New (0, ctx->sptr, 4096, long);	610	New (0, stack->sptr, STACKSIZE, long);
		611	}
518	}	612	}
		613	else
		614	stack->sptr = 0;
		615
		616	ctx->stack = stack;
519	}	617	}
520		618
521	static void	619	static void
522	deallocate_stack (Coro__State ctx)	620	deallocate_stack (Coro__State ctx)
523	{	621	{
		622	coro_stack *stack = ctx->stack;
		623
		624	ctx->stack = 0;
		625
		626	if (stack)
		627	{
		628	if (!--stack->refcnt)
		629	{
524	#ifdef HAVE_MMAP	630	#ifdef HAVE_MMAP
525	munmap (ctx->sptr, ctx->ssize);	631	if (stack->ssize > 0 && stack->sptr)
526	#else	632	munmap (stack->sptr, stack->ssize);
527	Safefree (ctx->sptr);	633	else
528	#endif	634	#endif
529	}	635	Safefree (stack->sptr);
530		636
531	/* might go away together with optional SAVE_CCTXT */	637	Safefree (stack);
		638	}
		639	else if (ctx->gencnt == stack->gencnt)
		640	--stack->usecnt;
		641	}
		642	}
		643
532	static void	644	static void
533	setup_coro (void *arg)	645	setup_coro (void *arg)
534	{	646	{
535	/*	647	/*
536	* emulate part of the perl startup here.	648	* emulate part of the perl startup here.
537	*/	649	*/
		650	dTHX;
538	dSP;	651	dSP;
539	Coro__State ctx = (Coro__State)arg;	652	Coro__State ctx = (Coro__State)arg;
540	SV sub_init = (SV)get_cv(SUB_INIT, FALSE);	653	SV sub_init = (SV )get_cv (SUB_INIT, FALSE);
541		654
542	coro_init_stacks (aTHX);	655	coro_init_stacks (aTHX);
543	JMPENV_BOOTSTRAP;	656	/PL_curcop = 0;/
		657	/PL_in_eval = PL_in_eval;/ /* inherit */
		658	SvREFCNT_dec (GvAV (PL_defgv));
		659	GvAV (PL_defgv) = ctx->args; ctx->args = 0;
		660
544	SPAGAIN;	661	SPAGAIN;
545		662
546	/PL_curcop = 0;/
547	SvREFCNT_dec (GvAV (PL_defgv));
548	GvAV (PL_defgv) = ctx->args;
549
550	if (ctx->sptr)	663	if (ctx->stack)
551	{	664	{
		665	ctx->cursp = 0;
		666
552	PUSHMARK(SP);	667	PUSHMARK(SP);
553	PUTBACK;	668	PUTBACK;
554	(void) call_sv (sub_init, G_VOID\|G_NOARGS);	669	(void) call_sv (sub_init, G_VOID\|G_NOARGS\|G_EVAL);
		670
		671	if (SvTRUE (ERRSV))
		672	croak (NULL);
		673	else
555	croak ("FATAL: CCTXT coroutine returned!");	674	croak ("FATAL: CCTXT coroutine returned!");
556	}	675	}
557	else	676	else
558	{	677	{
559	UNOP myop;	678	UNOP myop;
560		679
…		…
572	* that doesn't matter, though, since it is only	691	* that doesn't matter, though, since it is only
573	* pp_nextstate and we never return...	692	* pp_nextstate and we never return...
574	* ah yes, and I don't care anyways ;)	693	* ah yes, and I don't care anyways ;)
575	*/	694	*/
576	PUTBACK;	695	PUTBACK;
577	PL_op = pp_entersub();	696	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
578	SPAGAIN;	697	SPAGAIN;
579		698
580	ENTER; /* necessary e.g. for dounwind */	699	ENTER; /* necessary e.g. for dounwind */
581	}	700	}
582	}	701	}
583		702
		703	static void
		704	continue_coro (void *arg)
		705	{
		706	/*
		707	* this is a _very_ stripped down perl interpreter ;)
		708	*/
		709	dTHX;
		710	Coro__State ctx = (Coro__State)arg;
		711	JMPENV coro_start_env;
		712
		713	PL_top_env = &ctx->start_env;
		714
		715	ctx->cursp = 0;
		716	PL_op = PL_op->op_next;
		717	CALLRUNOPS(aTHX);
		718
		719	abort ();
		720	}
		721
584	STATIC void	722	STATIC void
585	transfer(pTHX_ struct coro prev, struct coro next, int flags)	723	transfer (pTHX_ struct coro prev, struct coro next, int flags)
586	{	724	{
587	dSP;	725	dSTACKLEVEL;
588		726
589	if (prev != next)	727	if (prev != next)
590	{	728	{
591	/*
592	* this could be done in newprocess which would lead to
593	* extremely elegant and fast (basically just SAVE/LOAD)
594	* code here, but lazy allocation of stacks has also
595	* some virtues and the overhead of the if() is nil.
596	*/
597	if (next->mainstack)	729	if (next->mainstack)
598	{	730	{
		731	LOCK;
599	SAVE (prev, flags);	732	SAVE (prev, flags);
600	LOAD (next);	733	LOAD (next);
		734	UNLOCK;
601		735
602	/* mark this state as in-use */	736	/* mark this state as in-use */
603	next->mainstack = 0;	737	next->mainstack = 0;
604	next->tmps_ix = -2;	738	next->tmps_ix = -2;
605		739
		740	/* stacklevel changed? if yes, grab the stack for us! */
606	if (flags & TRANSFER_SAVE_CCTXT)	741	if (flags & TRANSFER_SAVE_CCTXT)
607	{	742	{
608	if (!next->ssize)
609	croak ("destination coroutine has no CCTXT (%p, %d)", next->sptr, next->ssize);
610
611	if (!prev->ssize)	743	if (!prev->stack)
612	prev->ssize = 1; /* mark cctx as valid ;) */	744	allocate_stack (prev, 0);
		745	else if (prev->cursp != stacklevel
		746	&& prev->stack->usecnt > 1)
		747	{
		748	prev->gencnt = ++prev->stack->gencnt;
		749	prev->stack->usecnt = 1;
		750	}
613		751
		752	/* has our stack been invalidated? */
		753	if (next->stack && next->stack->gencnt != next->gencnt)
		754	{
		755	deallocate_stack (next);
		756	allocate_stack (next, 1);
		757	coro_create (&(next->stack->cctx),
		758	continue_coro, (void *)next,
		759	next->stack->sptr, labs (next->stack->ssize));
		760	}
		761
614	coro_transfer (&(prev->cctx), &(next->cctx));	762	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		763	prev->cursp = stacklevel;
		764	/* don't add any code here */
615	}	765	}
616		766	else
		767	next->cursp = stacklevel;
617	}	768	}
618	else if (next->tmps_ix == -2)	769	else if (next->tmps_ix == -2)
619	croak ("tried to transfer to running coroutine");	770	croak ("tried to transfer to running coroutine");
620	else	771	else
621	{	772	{
		773	LOCK;
622	SAVE (prev, -1); /* first get rid of the old state */	774	SAVE (prev, -1); /* first get rid of the old state */
		775	UNLOCK;
623		776
624	if (flags & TRANSFER_SAVE_CCTXT)	777	if (flags & TRANSFER_SAVE_CCTXT)
625	{	778	{
626	if (!next->ssize)	779	if (!prev->stack)
		780	allocate_stack (prev, 0);
		781
		782	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
627	{	783	{
		784	PL_top_env = &next->start_env;
		785
		786	setup_coro (next);
		787	next->cursp = stacklevel;
		788
		789	prev->stack->refcnt++;
		790	prev->stack->usecnt++;
		791	next->stack = prev->stack;
		792	next->gencnt = prev->gencnt;
		793	}
		794	else
		795	{
		796	assert (!next->stack);
628	allocate_stack (next);	797	allocate_stack (next, 1);
629	coro_create (&(next->cctx),	798	coro_create (&(next->stack->cctx),
630	setup_coro, (void *)next,	799	setup_coro, (void *)next,
631	next->sptr, next->ssize);	800	next->stack->sptr, labs (next->stack->ssize));
		801	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		802	prev->cursp = stacklevel;
		803	/* don't add any code here */
632	}	804	}
633
634	if (!prev->ssize)
635	prev->ssize = 1; /* mark cctx as valid ;) */
636
637	coro_transfer (&(prev->cctx), &(next->cctx));
638	}	805	}
639	else	806	else
		807	{
640	setup_coro (next);	808	setup_coro (next);
		809	next->cursp = stacklevel;
		810	}
641	}	811	}
642	}	812	}
		813
		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) (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 ();
643	}	960	}
644		961
645	MODULE = Coro::State PACKAGE = Coro::State	962	MODULE = Coro::State PACKAGE = Coro::State
646		963
647	PROTOTYPES: ENABLE	964	PROTOTYPES: ENABLE
648		965
649	BOOT:	966	BOOT:
650	{ /* {} 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
		972	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
		973	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
651	coro_state_stash = gv_stashpvn ("Coro::State", 10, TRUE);	974	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
652		975
653	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	976	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
654	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	977	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
655	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));	978	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
656	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));	979	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
657		980
658	if (!padlist_cache)
659	padlist_cache = newHV ();
660
661	main_mainstack = PL_mainstack;	981	main_mainstack = PL_mainstack;
		982
		983	coroapi.ver = CORO_API_VERSION;
		984	coroapi.transfer = api_transfer;
662	}	985	}
663		986
664	Coro::State	987	Coro::State
665	_newprocess(args)	988	_newprocess(args)
666	SV * args	989	SV * args
…		…
669	Coro__State coro;	992	Coro__State coro;
670		993
671	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)	994	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
672	croak ("Coro::State::_newprocess expects an arrayref");	995	croak ("Coro::State::_newprocess expects an arrayref");
673		996
674	New (0, coro, 1, struct coro);	997	Newz (0, coro, 1, struct coro);
675		998
676	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	999	coro->args = (AV *)SvREFCNT_inc (SvRV (args));
677	coro->mainstack = 0; /* actual work is done inside transfer */	1000	/coro->mainstack = 0; //actual work is done inside transfer /
678	coro->sptr = 0;	1001	/coro->stack = 0;/
679	coro->ssize = 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;
680		1008
681	RETVAL = coro;	1009	RETVAL = coro;
682	OUTPUT:	1010	OUTPUT:
683	RETVAL	1011	RETVAL
684		1012
685	void	1013	void
686	transfer(prev, next, flags = TRANSFER_SAVE_ALL)	1014	transfer(prev, next, flags)
687	Coro::State_or_hashref prev	1015	SV *prev
688	Coro::State_or_hashref next	1016	SV *next
689	int flags	1017	int flags
690	PROTOTYPE: @	1018	PROTOTYPE: @
691	CODE:	1019	CODE:
		1020	PUTBACK;
		1021	SV_CORO (next, "Coro::transfer");
		1022	SV_CORO (prev, "Coro::transfer");
692	transfer (aTHX_ prev, next, flags);	1023	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
		1024	SPAGAIN;
693		1025
694	void	1026	void
695	DESTROY(coro)	1027	DESTROY(coro)
696	Coro::State coro	1028	Coro::State coro
697	CODE:	1029	CODE:
698		1030
699	if (coro->mainstack && coro->mainstack != main_mainstack)	1031	if (coro->mainstack && coro->mainstack != main_mainstack)
700	{	1032	{
701	struct coro temp;	1033	struct coro temp;
702		1034
		1035	PUTBACK;
703	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);	1036	SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
704	LOAD(aTHX_ coro);	1037	LOAD (aTHX_ coro);
		1038	SPAGAIN;
705		1039
706	destroy_stacks (aTHX);	1040	destroy_stacks (aTHX);
707		1041
708	LOAD((&temp)); /* this will get rid of defsv etc.. */	1042	LOAD ((&temp)); /* this will get rid of defsv etc.. */
		1043	SPAGAIN;
709		1044
710	coro->mainstack = 0;	1045	coro->mainstack = 0;
711	}	1046	}
712		1047
713	if (coro->sptr)
714	{
715	deallocate_stack (coro);	1048	deallocate_stack (coro);
716	coro->sptr = 0;	1049	SvREFCNT_dec (coro->args);
717	}
718
719	Safefree (coro);	1050	Safefree (coro);
720		1051
721	void	1052	void
722	flush()	1053	_exit(code)
		1054	int code
		1055	PROTOTYPE: $
723	CODE:	1056	CODE:
724	#ifdef MAY_FLUSH	1057	_exit (code);
725	flush_padlist_cache ();
726	#endif
727		1058
728	MODULE = Coro::State PACKAGE = Coro::Cont	1059	MODULE = Coro::State PACKAGE = Coro::Cont
729		1060
730	# this is slightly dirty	1061	# this is slightly dirty (should expose a c-level api)
731		1062
732	void	1063	void
733	yield(...)	1064	yield(...)
734	PROTOTYPE: @	1065	PROTOTYPE: @
735	CODE:	1066	CODE:
736	static SV *returnstk;	1067	SV *yieldstack;
737	SV *sv;	1068	SV *sv;
738	AV *defav = GvAV (PL_defgv);	1069	AV *defav = GvAV (PL_defgv);
739	struct coro prev, next;	1070	struct coro prev, next;
740		1071
741	if (!returnstk)	1072	yieldstack = *hv_fetch (
742	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1073	(HV *)SvRV (GvSV (coro_current)),
		1074	"yieldstack", sizeof ("yieldstack") - 1,
		1075	0
		1076	);
743		1077
744	/* set up @_ -- ugly */	1078	/* set up @_ -- ugly */
745	av_clear (defav);	1079	av_clear (defav);
746	av_fill (defav, items - 1);	1080	av_fill (defav, items - 1);
747	while (items--)	1081	while (items--)
748	av_store (defav, items, SvREFCNT_inc (ST(items)));	1082	av_store (defav, items, SvREFCNT_inc (ST(items)));
749		1083
750	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
751	sv = av_pop ((AV *)SvRV (returnstk));	1084	sv = av_pop ((AV *)SvRV (yieldstack));
752	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));	1085	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));
753	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));	1086	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));
754	SvREFCNT_dec (sv);	1087	SvREFCNT_dec (sv);
755		1088
756	transfer(aTHX_ prev, next, 0);	1089	transfer (aTHX_ prev, next, 0);
757		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.13 by root, Mon Jul 23 22:09:39 2001 UTC vs. Revision 1.74 by root, Mon Oct 23 22:49:09 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.13 by root, Mon Jul 23 22:09:39 2001 UTC vs.
Revision 1.74 by root, Mon Oct 23 22:49:09 2006 UTC