ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.41 by root, Tue Nov 27 02:51:03 2001 UTC vs.
Revision 1.90 by root, Sat Nov 25 00:56:35 2006 UTC

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

Diff Legend

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