[ViewVC] Diff of: cvs/Coro/Coro/State.xs

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.36 by root, Fri Oct 5 14:20:10 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.36 by root, Fri Oct 5 14:20:10 2001 UTC vs.
Revision 1.98 by root, Sun Nov 26 21:25:53 2006 UTC