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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.28 by root, Sat Aug 25 21:32:05 2001 UTC vs.
Revision 1.96 by root, Sun Nov 26 18:25:11 2006 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.28 by root, Sat Aug 25 21:32:05 2001 UTC vs. Revision 1.96 by root, Sun Nov 26 18:25:11 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.28 by root, Sat Aug 25 21:32:05 2001 UTC vs.
Revision 1.96 by root, Sun Nov 26 18:25:11 2006 UTC