ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.10 by root, Sat Jul 21 04:19:34 2001 UTC vs.
Revision 1.104 by root, Mon Nov 27 01:51:02 2006 UTC

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

Diff Legend

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