ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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