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

Diff Legend

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