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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.35 by root, Mon Sep 24 01:36:20 2001 UTC vs.
Revision 1.93 by root, Sun Nov 26 03:22:50 2006 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.35 by root, Mon Sep 24 01:36:20 2001 UTC vs. Revision 1.93 by root, Sun Nov 26 03:22:50 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.35 by root, Mon Sep 24 01:36:20 2001 UTC vs.
Revision 1.93 by root, Sun Nov 26 03:22:50 2006 UTC