ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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