ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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