ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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