ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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