[ViewVC] Diff of: 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.98 by root, Sun Nov 26 21:25:53 2006 UTC

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.21 by root, Sat Aug 11 19:59:19 2001 UTC vs. Revision 1.98 by root, Sun Nov 26 21:25:53 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.21 by root, Sat Aug 11 19:59:19 2001 UTC vs.
Revision 1.98 by root, Sun Nov 26 21:25:53 2006 UTC