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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.26 by root, Fri Aug 17 01:45:39 2001 UTC vs. Revision 1.87 by root, Fri Nov 24 13:40:36 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.26 by root, Fri Aug 17 01:45:39 2001 UTC vs.
Revision 1.87 by root, Fri Nov 24 13:40:36 2006 UTC