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

Diff Legend

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