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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.23 by root, Tue Aug 14 04:33:58 2001 UTC vs.
Revision 1.89 by root, Sat Nov 25 00:40:26 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 <errno.h>
		33
		34	#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
		35	# undef STACKGUARD
		36	#endif
		37
		38	#ifndef STACKGUARD
		39	# define STACKGUARD 0
		40	#endif
8		41
9	#ifdef HAVE_MMAP	42	#ifdef HAVE_MMAP
10	# include <unistd.h>	43	# include <unistd.h>
11	# include <sys/mman.h>	44	# include <sys/mman.h>
12	# ifndef MAP_ANON
13	# ifdef MAP_ANONYMOUS	45	# ifndef MAP_ANONYMOUS
14	# define MAP_ANON MAP_ANONYMOUS	46	# ifdef MAP_ANON
		47	# define MAP_ANONYMOUS MAP_ANON
15	# else	48	# else
16	# undef HAVE_MMAP	49	# undef HAVE_MMAP
17	# endif	50	# endif
18	# endif	51	# endif
		52	# include <limits.h>
		53	# ifndef PAGESIZE
		54	# define PAGESIZE pagesize
		55	# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
		56	static long pagesize;
		57	# else
		58	# define BOOT_PAGESIZE
19	#endif	59	# endif
		60	#endif
20		61
21	#define MAY_FLUSH /* increases codesize */
22
23	#define SUB_INIT "Coro::State::initialize"	62	#define SUB_INIT "Coro::State::initialize"
24	#define UCORO_STATE "_coro_state"
25		63
26	/* The next macro should delcare a variable stacklevel that contains and approximation	64	/* 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	65	* to the current C stack pointer. Its property is that it changes with each call
28	* and should be unique. */	66	* and should be unique. */
29	#define dSTACKLEVEL void *stacklevel = &stacklevel	67	#define dSTACKLEVEL void *stacklevel = &stacklevel
30		68
		69	#define IN_DESTRUCT (PL_main_cv == Nullcv)
		70
31	#define labs(l) ((l) >= 0 ? (l) : -(l))	71	#define labs(l) ((l) >= 0 ? (l) : -(l))
32		72
33	#include "CoroAPI.h"	73	#include "CoroAPI.h"
34		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 actually not just the c stack but also c registers etc... */
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	void *idle_sp;
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	coro_context cctx;
47	} coro_stack;	99	} coro_stack;
48		100
		101	static coro_stack *main_stack;
		102
49	struct coro {	103	struct coro {
50	/* the optional C context */
51	coro_stack *stack;
52	void *cursp;
53	int gencnt;
54
55	/* optionally saved, might be zero */	104	/* optionally saved, might be zero */
56	AV *defav;	105	AV *defav;
57	SV *defsv;	106	SV *defsv;
58	SV *errsv;	107	SV *errsv;
59		108
60	/* saved global state not related to stacks */	109	/* saved global state not related to stacks */
61	U8 dowarn;	110	U8 dowarn;
62	I32 in_eval;	111	I32 in_eval;
63		112
		113	/* the c stack, if any */
		114	coro_stack *stack;
		115
64	/* the stacks and related info (callchain etc..) */	116	/* the stacks and related info (callchain etc..) */
65	PERL_SI *curstackinfo;	117	PERL_SI *curstackinfo;
66	AV *curstack;	118	AV *curstack;
67	AV *mainstack;	119	AV *mainstack;
68	SV **stack_sp;	120	SV **stack_sp;
69	OP *op;	121	OP *op;
70	SV **curpad;	122	SV **curpad;
		123	AV *comppad;
		124	CV *compcv;
71	SV **stack_base;	125	SV **stack_base;
72	SV **stack_max;	126	SV **stack_max;
73	SV **tmps_stack;	127	SV **tmps_stack;
74	I32 tmps_floor;	128	I32 tmps_floor;
75	I32 tmps_ix;	129	I32 tmps_ix;
84	I32 savestack_ix;	138	I32 savestack_ix;
85	I32 savestack_max;	139	I32 savestack_max;
86	OP **retstack;	140	OP **retstack;
87	I32 retstack_ix;	141	I32 retstack_ix;
88	I32 retstack_max;	142	I32 retstack_max;
		143	PMOP *curpm;
89	COP *curcop;	144	COP *curcop;
90	JMPENV *top_env;	145	JMPENV *top_env;
91		146
		147	/* coro process data */
		148	int prio;
		149
92	/* data associated with this coroutine (initial args) */	150	/* data associated with this coroutine (initial args) */
93	AV *args;	151	AV *args;
		152	int refcnt;
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 should work - but it doesn't :( */
		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 AV *
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) SB load_state(aTHX_ (state)); SPAGAIN; SE	264	#define LOAD(state) load_state(aTHX_ (state));
276	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE	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;	305	PL_top_env = c->top_env;
312		306
313	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	307	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	308	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
…		…
323	{	317	{
324	AV padlist = (AV )POPs;	318	AV padlist = (AV )POPs;
325		319
326	if (padlist)	320	if (padlist)
327	{	321	{
328	put_padlist (cv); /* mark this padlist as available */	322	put_padlist (aTHX_ cv); /* mark this padlist as available */
329	CvPADLIST(cv) = padlist;	323	CvPADLIST(cv) = padlist;
330	#ifdef USE_THREADS
331	/CvOWNER(cv) = (struct perl_thread )POPs;*/
332	#endif
333	}	324	}
334		325
335	++CvDEPTH(cv);	326	++CvDEPTH(cv);
336	}	327	}
337		328
…		…
355		346
356	PUSHs (Nullsv);	347	PUSHs (Nullsv);
357	/* this loop was inspired by pp_caller */	348	/* this loop was inspired by pp_caller */
358	for (;;)	349	for (;;)
359	{	350	{
360	do	351	while (cxix >= 0)
361	{	352	{
362	PERL_CONTEXT *cx = &ccstk[cxix--];	353	PERL_CONTEXT *cx = &ccstk[cxix--];
363		354
364	if (CxTYPE(cx) == CXt_SUB)	355	if (CxTYPE(cx) == CXt_SUB)
365	{	356	{
366	CV *cv = cx->blk_sub.cv;	357	CV *cv = cx->blk_sub.cv;
367	if (CvDEPTH(cv))	358	if (CvDEPTH(cv))
368	{	359	{
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);	360	EXTEND (SP, CvDEPTH(cv)*2);
375		361
376	while (--CvDEPTH(cv))	362	while (--CvDEPTH(cv))
377	{	363	{
378	/* this tells the restore code to increment CvDEPTH */	364	/* this tells the restore code to increment CvDEPTH */
…		…
381	}	367	}
382		368
383	PUSHs ((SV *)CvPADLIST(cv));	369	PUSHs ((SV *)CvPADLIST(cv));
384	PUSHs ((SV *)cv);	370	PUSHs ((SV *)cv);
385		371
386	get_padlist (cv); /* this is a monster */	372	get_padlist (aTHX_ cv);
387	}	373	}
388	}	374	}
		375	#ifdef CXt_FORMAT
389	else if (CxTYPE(cx) == CXt_FORMAT)	376	else if (CxTYPE(cx) == CXt_FORMAT)
390	{	377	{
391	/* I never used formats, so how should I know how these are implemented? */	378	/* I never used formats, so how should I know how these are implemented? */
392	/* my bold guess is as a simple, plain sub... */	379	/* my bold guess is as a simple, plain sub... */
393	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");	380	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
394	}	381	}
		382	#endif
395	}	383	}
396	while (cxix >= 0);
397		384
398	if (top_si->si_type == PERLSI_MAIN)	385	if (top_si->si_type == PERLSI_MAIN)
399	break;	386	break;
400		387
401	top_si = top_si->si_prev;	388	top_si = top_si->si_prev;
…		…
407	}	394	}
408		395
409	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;	396	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
410	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	397	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
411	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;	398	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
412
413	/* I have not the slightest idea of why av_reify is necessary */
414	/* but if it's missing the defav contents magically get replaced sometimes */
415	if (c->defav)
416	av_reify (c->defav);
417		399
418	c->dowarn = PL_dowarn;	400	c->dowarn = PL_dowarn;
419	c->in_eval = PL_in_eval;	401	c->in_eval = PL_in_eval;
420		402
421	c->curstackinfo = PL_curstackinfo;	403	c->curstackinfo = PL_curstackinfo;
422	c->curstack = PL_curstack;	404	c->curstack = PL_curstack;
423	c->mainstack = PL_mainstack;	405	c->mainstack = PL_mainstack;
424	c->stack_sp = PL_stack_sp;	406	c->stack_sp = PL_stack_sp;
425	c->op = PL_op;	407	c->op = PL_op;
426	c->curpad = PL_curpad;	408	c->curpad = PL_curpad;
		409	c->comppad = PL_comppad;
		410	c->compcv = PL_compcv;
427	c->stack_base = PL_stack_base;	411	c->stack_base = PL_stack_base;
428	c->stack_max = PL_stack_max;	412	c->stack_max = PL_stack_max;
429	c->tmps_stack = PL_tmps_stack;	413	c->tmps_stack = PL_tmps_stack;
430	c->tmps_floor = PL_tmps_floor;	414	c->tmps_floor = PL_tmps_floor;
431	c->tmps_ix = PL_tmps_ix;	415	c->tmps_ix = PL_tmps_ix;
…		…
437	c->scopestack_ix = PL_scopestack_ix;	421	c->scopestack_ix = PL_scopestack_ix;
438	c->scopestack_max = PL_scopestack_max;	422	c->scopestack_max = PL_scopestack_max;
439	c->savestack = PL_savestack;	423	c->savestack = PL_savestack;
440	c->savestack_ix = PL_savestack_ix;	424	c->savestack_ix = PL_savestack_ix;
441	c->savestack_max = PL_savestack_max;	425	c->savestack_max = PL_savestack_max;
		426	#if PERL_VERSION < 9
442	c->retstack = PL_retstack;	427	c->retstack = PL_retstack;
443	c->retstack_ix = PL_retstack_ix;	428	c->retstack_ix = PL_retstack_ix;
444	c->retstack_max = PL_retstack_max;	429	c->retstack_max = PL_retstack_max;
		430	#endif
		431	c->curpm = PL_curpm;
445	c->curcop = PL_curcop;	432	c->curcop = PL_curcop;
446	c->top_env = PL_top_env;	433	c->top_env = PL_top_env;
447	}	434	}
448		435
449	/*	436	/*
450	* allocate various perl stacks. This is an exact copy	437	* allocate various perl stacks. This is an exact copy
451	* of perl.c:init_stacks, except that it uses less memory	438	* of perl.c:init_stacks, except that it uses less memory
452	* on the assumption that coroutines do not usually need	439	* on the (sometimes correct) assumption that coroutines do
453	* a lot of stackspace.	440	* not usually need a lot of stackspace.
454	*/	441	*/
455	STATIC void	442	static void
456	coro_init_stacks (pTHX)	443	coro_init_stacks (pTHX)
457	{	444	{
		445	LOCK;
		446
458	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);	447	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
459	PL_curstackinfo->si_type = PERLSI_MAIN;	448	PL_curstackinfo->si_type = PERLSI_MAIN;
460	PL_curstack = PL_curstackinfo->si_stack;	449	PL_curstack = PL_curstackinfo->si_stack;
461	PL_mainstack = PL_curstack; /* remember in case we switch stacks */	450	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
462		451
…		…
471		460
472	New(54,PL_markstack,16,I32);	461	New(54,PL_markstack,16,I32);
473	PL_markstack_ptr = PL_markstack;	462	PL_markstack_ptr = PL_markstack;
474	PL_markstack_max = PL_markstack + 16;	463	PL_markstack_max = PL_markstack + 16;
475		464
		465	#ifdef SET_MARK_OFFSET
476	SET_MARK_OFFSET;	466	SET_MARK_OFFSET;
		467	#endif
477		468
478	New(54,PL_scopestack,16,I32);	469	New(54,PL_scopestack,16,I32);
479	PL_scopestack_ix = 0;	470	PL_scopestack_ix = 0;
480	PL_scopestack_max = 16;	471	PL_scopestack_max = 16;
481		472
482	New(54,PL_savestack,96,ANY);	473	New(54,PL_savestack,96,ANY);
483	PL_savestack_ix = 0;	474	PL_savestack_ix = 0;
484	PL_savestack_max = 96;	475	PL_savestack_max = 96;
485		476
		477	#if PERL_VERSION < 9
486	New(54,PL_retstack,8,OP*);	478	New(54,PL_retstack,8,OP*);
487	PL_retstack_ix = 0;	479	PL_retstack_ix = 0;
488	PL_retstack_max = 8;	480	PL_retstack_max = 8;
		481	#endif
		482
		483	UNLOCK;
489	}	484	}
490		485
491	/*	486	/*
492	* destroy the stacks, the callchain etc...	487	* destroy the stacks, the callchain etc...
493	* still there is a memleak of 128 bytes...
494	*/	488	*/
495	STATIC void	489	static void
496	destroy_stacks(pTHX)	490	destroy_stacks(pTHX)
497	{	491	{
		492	if (!IN_DESTRUCT)
		493	{
498	/* is this ugly, I ask? */	494	/* is this ugly, I ask? */
499	while (PL_scopestack_ix)	495	LEAVE_SCOPE (0);
500	LEAVE;
501		496
502	/* sure it is, but more important: is it correct?? :/ */	497	/* sure it is, but more important: is it correct?? :/ */
503	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
504	FREETMPS;	498	FREETMPS;
		499
		500	/POPSTACK_TO (PL_mainstack);//D//use/
		501	}
505		502
506	while (PL_curstackinfo->si_next)	503	while (PL_curstackinfo->si_next)
507	PL_curstackinfo = PL_curstackinfo->si_next;	504	PL_curstackinfo = PL_curstackinfo->si_next;
508		505
509	while (PL_curstackinfo)	506	while (PL_curstackinfo)
510	{	507	{
511	PERL_SI *p = PL_curstackinfo->si_prev;	508	PERL_SI *p = PL_curstackinfo->si_prev;
512		509
513	{	510	{ /D//remove/
514	dSP;	511	dSP;
515	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	512	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
516	PUTBACK; /* possibly superfluous */	513	PUTBACK; /* possibly superfluous */
517	}	514	}
518		515
519	dounwind(-1);	516	if (!IN_DESTRUCT)
520		517	{
		518	dounwind (-1);/D//remove/
521	SvREFCNT_dec(PL_curstackinfo->si_stack);	519	SvREFCNT_dec (PL_curstackinfo->si_stack);
		520	}
		521
522	Safefree(PL_curstackinfo->si_cxstack);	522	Safefree (PL_curstackinfo->si_cxstack);
523	Safefree(PL_curstackinfo);	523	Safefree (PL_curstackinfo);
524	PL_curstackinfo = p;	524	PL_curstackinfo = p;
525	}	525	}
526		526
527	Safefree(PL_tmps_stack);	527	Safefree (PL_tmps_stack);
528	Safefree(PL_markstack);	528	Safefree (PL_markstack);
529	Safefree(PL_scopestack);	529	Safefree (PL_scopestack);
530	Safefree(PL_savestack);	530	Safefree (PL_savestack);
		531	#if PERL_VERSION < 9
531	Safefree(PL_retstack);	532	Safefree (PL_retstack);
532	}
533
534	static void
535	allocate_stack (Coro__State ctx, int alloc)
536	{
537	coro_stack *stack;
538
539	New (0, stack, 1, coro_stack);
540
541	stack->refcnt = 1;
542	stack->usecnt = 1;
543	stack->gencnt = ctx->gencnt = 0;
544	if (alloc)
545	{
546	#ifdef HAVE_MMAP
547	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
548	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANON, 0, 0);
549	if (stack->sptr == (void *)-1)
550	#endif	533	#endif
551	{
552	/FIXME//D//* reasonable stack size! */
553	stack->ssize = -4096 * sizeof (long);
554	New (0, stack->sptr, 4096, long);
555	}
556	}
557	else
558	stack->sptr = 0;
559
560	ctx->stack = stack;
561	}	534	}
562		535
563	static void	536	static void
564	deallocate_stack (Coro__State ctx)	537	setup_coro (struct coro *coro)
565	{
566	coro_stack *stack = ctx->stack;
567
568	ctx->stack = 0;
569
570	if (stack)
571	{
572	if (!--stack->refcnt)
573	{
574	#ifdef HAVE_MMAP
575	if (stack->ssize > 0 && stack->sptr)
576	munmap (stack->sptr, stack->ssize);
577	else
578	#else
579	Safefree (stack->sptr);
580	#endif
581	Safefree (stack);
582	}
583	else if (ctx->gencnt == stack->gencnt)
584	--stack->usecnt;
585	}
586	}
587
588	static void
589	setup_coro (void *arg)
590	{	538	{
591	/*	539	/*
592	* emulate part of the perl startup here.	540	* emulate part of the perl startup here.
593	*/	541	*/
		542	dTHX;
594	dSP;	543	dSP;
595	Coro__State ctx = (Coro__State)arg;	544	UNOP myop;
596	SV sub_init = (SV)get_cv(SUB_INIT, FALSE);	545	SV sub_init = (SV )get_cv (SUB_INIT, FALSE);
597		546
598	coro_init_stacks (aTHX);	547	coro_init_stacks (aTHX);
599	/PL_curcop = 0;/	548	/PL_curcop = 0;/
600	/PL_in_eval = PL_in_eval;/ /* inherit */	549	/PL_in_eval = PL_in_eval;/ /* inherit */
601	SvREFCNT_dec (GvAV (PL_defgv));	550	SvREFCNT_dec (GvAV (PL_defgv));
602	GvAV (PL_defgv) = ctx->args;	551	GvAV (PL_defgv) = coro->args; coro->args = 0;
603		552
604	SPAGAIN;	553	SPAGAIN;
605		554
606	if (ctx->stack)	555	Zero (&myop, 1, UNOP);
607	{	556	myop.op_next = Nullop;
608	ctx->cursp = 0;	557	myop.op_flags = OPf_WANT_VOID;
609		558
		559	PL_op = (OP *)&myop;
		560
610	PUSHMARK(SP);	561	PUSHMARK(SP);
		562	XPUSHs (sub_init);
611	PUTBACK;	563	PUTBACK;
612	(void) call_sv (sub_init, G_VOID\|G_NOARGS\|G_EVAL);	564	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		565	SPAGAIN;
613		566
614	if (SvTRUE (ERRSV))	567	ENTER; /* necessary e.g. for dounwind */
615	croak (NULL);	568	}
616	else	569
617	croak ("FATAL: CCTXT coroutine returned!");	570	static void
		571	transfer_tail ()
		572	{
		573	if (coro_mortal)
		574	{
		575	SvREFCNT_dec (coro_mortal);
		576	coro_mortal = 0;
618	}	577	}
619	else
620	{
621	UNOP myop;
622		578
623	PL_op = (OP *)&myop;	579	UNLOCK;
624
625	Zero(&myop, 1, UNOP);
626	myop.op_next = Nullop;
627	myop.op_flags = OPf_WANT_VOID;
628
629	PUSHMARK(SP);
630	XPUSHs (sub_init);
631	/*
632	* the next line is slightly wrong, as PL_op->op_next
633	* is actually being executed so we skip the first op.
634	* that doesn't matter, though, since it is only
635	* pp_nextstate and we never return...
636	* ah yes, and I don't care anyways ;)
637	*/
638	PUTBACK;
639	PL_op = pp_entersub();
640	SPAGAIN;
641
642	ENTER; /* necessary e.g. for dounwind */
643	}
644	}	580	}
645		581
646	static void	582	static void
647	continue_coro (void *arg)	583	coro_run (void *arg)
648	{	584	{
649	/*	585	/*
650	* this is a _very_ stripped down perl interpreter ;)	586	* this is a _very_ stripped down perl interpreter ;)
651	*/	587	*/
652	Coro__State ctx = (Coro__State)arg;	588	dTHX;
653		589
654	/FIXME//* must set up top_env here */	590	transfer_tail ();
655	ctx->cursp = 0;	591
		592	PL_top_env = &PL_start_env;
656	PL_op = PL_op->op_next;	593	PL_restartop = PL_op->op_next;
657	CALLRUNOPS(aTHX);	594	/* somebody will hit me for both perl_run and PL_restart_top */
		595	perl_run (aTHX_ PERL_GET_CONTEXT);
658		596
659	abort ();	597	abort ();
660	}	598	}
661		599
662	STATIC void	600	static coro_stack *
		601	stack_new ()
		602	{
		603	coro_stack *stack;
		604
		605	New (0, stack, 1, coro_stack);
		606
		607	#if HAVE_MMAP
		608
		609	stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE; /* mmap should do allocate-on-write for us */
		610	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
		611
		612	if (stack->sptr == (void *)-1)
		613	{
		614	fprintf (stderr, "FATAL: unable to mmap stack for coroutine\n");
		615	_exit (EXIT_FAILURE);
		616	}
		617
		618	mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
		619
		620	#else
		621
		622	stack->ssize = STACKSIZE * (long)sizeof (long);
		623	New (0, stack->sptr, STACKSIZE, long);
		624
		625	if (!stack->sptr)
		626	{
		627	fprintf (stderr, "FATAL: unable to malloc stack for coroutine\n");
		628	_exit (EXIT_FAILURE);
		629	}
		630
		631	#endif
		632
		633	coro_create (&stack->cctx, coro_run, 0, stack->sptr, stack->ssize);
		634
		635	return stack;
		636	}
		637
		638	static void
		639	stack_free (coro_stack *stack)
		640	{
		641	if (!stack \|\| stack == main_stack)
		642	return;
		643
		644	#if HAVE_MMAP
		645	munmap (stack->sptr, stack->ssize);
		646	#else
		647	Safefree (stack->sptr);
		648	#endif
		649
		650	Safefree (stack);
		651	}
		652
		653	static coro_stack *stack_first;
		654
		655	static void
		656	stack_get (struct coro *coro)
		657	{
		658	if (stack_first)
		659	{
		660	coro->stack = stack_first;
		661	stack_first = stack_first->next;
		662	}
		663	else
		664	coro->stack = stack_new ();
		665	}
		666
		667	static void
		668	stack_put (coro_stack *stack)
		669	{
		670	stack->next = stack_first;
		671	stack_first = stack;
		672	}
		673
		674	/* never call directly, always through the coro_state_transfer global variable */
		675	static void
663	transfer(pTHX_ struct coro prev, struct coro next, int flags)	676	transfer_impl (pTHX_ struct coro prev, struct coro next, int flags)
664	{	677	{
665	dSP;
666	dSTACKLEVEL;	678	dSTACKLEVEL;
667		679
		680	/* sometimes transfer is only called to set idle_sp */
		681	if (!prev->stack->idle_sp)
		682	prev->stack->idle_sp = stacklevel;
		683
		684	LOCK;
		685
668	if (prev != next)	686	if (prev != next)
669	{	687	{
		688	coro_stack *prev_stack = prev->stack;
		689
		690	/* possibly "free" the stack */
		691	if (prev_stack->idle_sp == stacklevel)
		692	{
		693	stack_put (prev_stack);
		694	prev->stack = 0;
		695	}
		696
670	if (next->mainstack)	697	if (!next->mainstack)
		698	{
		699	/* first get rid of the old state */
		700	SAVE (prev, -1);
		701	/* setup coroutine call */
		702	setup_coro (next);
		703	next->stack = 0;
		704	}
		705	else
671	{	706	{
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	}
703
704	}	709	}
705	else if (next->tmps_ix == -2)
706	croak ("tried to transfer to running coroutine");
707	else
708	{
709	SAVE (prev, -1); /* first get rid of the old state */
710		710
711	if (flags & TRANSFER_SAVE_CCTXT)	711	if (!next->stack)
712	{	712	stack_get (next);
713	if (!prev->stack)
714	allocate_stack (prev, 0);
715		713
716	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)	714	if (prev_stack != next->stack)
717	{
718	setup_coro (next);
719
720	prev->stack->refcnt++;
721	prev->stack->usecnt++;
722	next->stack = prev->stack;
723	next->gencnt = prev->gencnt;
724	}
725	else
726	{
727	allocate_stack (next, 1);
728	coro_create (&(next->stack->cctx),
729	setup_coro, (void *)next,
730	next->stack->sptr, labs (next->stack->ssize));
731	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));	715	coro_transfer (&prev_stack->cctx, &next->stack->cctx);
732	}
733	}
734	else
735	setup_coro (next);
736	}
737	}	716	}
738		717
739	next->cursp = stacklevel;	718	transfer_tail ();
740	}	719	}
		720
		721	/* use this function pointer to call the above function */
		722	/* this is done to increase chances of the compiler not inlining the call */
		723	void (coro_state_transfer)(pTHX_ struct coro prev, struct coro *next, int flags) = transfer_impl;
		724
		725	static void
		726	coro_state_destroy (struct coro *coro)
		727	{
		728	if (coro->refcnt--)
		729	return;
		730
		731	if (coro->mainstack && coro->mainstack != main_mainstack)
		732	{
		733	struct coro temp;
		734
		735	SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
		736	LOAD (aTHX_ coro);
		737
		738	destroy_stacks (aTHX);
		739
		740	LOAD ((&temp)); /* this will get rid of defsv etc.. */
		741
		742	coro->mainstack = 0;
		743	}
		744
		745	stack_free (coro->stack);
		746	SvREFCNT_dec (coro->args);
		747	Safefree (coro);
		748	}
		749
		750	static int
		751	coro_state_clear (SV sv, MAGIC mg)
		752	{
		753	struct coro coro = (struct coro )mg->mg_ptr;
		754	mg->mg_ptr = 0;
		755
		756	coro_state_destroy (coro);
		757
		758	return 0;
		759	}
		760
		761	static int
		762	coro_state_dup (MAGIC mg, CLONE_PARAMS params)
		763	{
		764	struct coro coro = (struct coro )mg->mg_ptr;
		765
		766	++coro->refcnt;
		767
		768	return 0;
		769	}
		770
		771	static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 };
741		772
742	static struct coro *	773	static struct coro *
743	sv_to_coro (SV arg, const char funcname, const char *varname)	774	SvSTATE (SV *coro)
744	{	775	{
745	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)	776	HV *stash;
746	{	777	MAGIC *mg;
747	HE he = hv_fetch_ent((HV )SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
748		778
749	if (!he)	779	if (SvROK (coro))
750	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);	780	coro = SvRV (coro);
751		781
752	arg = HeVAL(he);	782	stash = SvSTASH (coro);
		783	if (stash != coro_stash && stash != coro_state_stash)
		784	{
		785	/* very slow, but rare, check */
		786	if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
		787	croak ("Coro::State object required");
753	}	788	}
754
755	/* must also be changed inside Coro::Cont::yield */
756	if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
757	return (struct coro ) SvIV((SV)SvRV(arg));
758	else
759	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
760	}
761		789
		790	mg = SvMAGIC (coro);
		791	assert (mg->mg_type == PERL_MAGIC_ext);
		792	return (struct coro *)mg->mg_ptr;
		793	}
		794
762	static void	795	static void
763	api_transfer(pTHX_ SV prev, SV next, int flags)	796	api_transfer (pTHX_ SV prev, SV next, int flags)
764	{	797	{
765	transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"),	798	coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
766	sv_to_coro (next, "Coro::transfer", "next"),
767	flags);
768	}	799	}
769		800
770	/ Coro ******************************************************************/	801	/ Coro ******************************************************************/
771		802
772	#define PRIO_MAX 3	803	#define PRIO_MAX 3
…		…
776	#define PRIO_IDLE -3	807	#define PRIO_IDLE -3
777	#define PRIO_MIN -4	808	#define PRIO_MIN -4
778		809
779	/* for Coro.pm */	810	/* for Coro.pm */
780	static GV coro_current, coro_idle;	811	static GV coro_current, coro_idle;
781	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];	812	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
		813	static int coro_nready;
782		814
783	static void	815	static void
784	coro_enq (SV *sv)	816	coro_enq (pTHX_ SV *sv)
785	{	817	{
786	if (SvROK (sv))	818	int prio;
787	{	819
788	SV *hv = SvRV (sv);
789	if (SvTYPE (hv) == SVt_PVHV)	820	if (SvTYPE (sv) != SVt_PVHV)
790	{
791	SV *xprio = hv_fetch ((HV )hv, "prio", 4, 0);
792	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
793
794	prio = prio > PRIO_MAX ? PRIO_MAX
795	: prio < PRIO_MIN ? PRIO_MIN
796	: prio;
797
798	av_push (coro_ready [prio - PRIO_MIN], sv);
799
800	return;
801	}
802	}
803
804	croak ("Coro::ready tried to enqueue something that is not a coroutine");	821	croak ("Coro::ready tried to enqueue something that is not a coroutine");
		822
		823	prio = SvSTATE (sv)->prio;
		824
		825	av_push (coro_ready [prio - PRIO_MIN], sv);
		826	coro_nready++;
805	}	827	}
806		828
807	static SV *	829	static SV *
808	coro_deq (int min_prio)	830	coro_deq (pTHX_ int min_prio)
809	{	831	{
810	int prio = PRIO_MAX - PRIO_MIN;	832	int prio = PRIO_MAX - PRIO_MIN;
811		833
812	min_prio -= PRIO_MIN;	834	min_prio -= PRIO_MIN;
813	if (min_prio < 0)	835	if (min_prio < 0)
814	min_prio = 0;	836	min_prio = 0;
815		837
816	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )	838	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
817	if (av_len (coro_ready[prio]) >= 0)	839	if (AvFILLp (coro_ready [prio]) >= 0)
		840	{
		841	coro_nready--;
818	return av_shift (coro_ready[prio]);	842	return av_shift (coro_ready [prio]);
		843	}
819		844
820	return 0;	845	return 0;
821	}	846	}
822		847
823	static void	848	static void
824	api_ready (SV *coro)	849	api_ready (SV *coro)
825	{	850	{
		851	dTHX;
		852
		853	if (SvROK (coro))
		854	coro = SvRV (coro);
		855
		856	LOCK;
826	coro_enq (SvREFCNT_inc (coro));	857	coro_enq (aTHX_ SvREFCNT_inc (coro));
		858	UNLOCK;
827	}	859	}
828		860
829	static void	861	static void
830	api_schedule (int cede)	862	api_schedule (void)
831	{	863	{
		864	dTHX;
		865
832	SV prev, next;	866	SV prev, next;
833
834	prev = GvSV (coro_current);	867	SV *current = GvSV (coro_current);
835		868
836	if (cede)	869	for (;;)
837	coro_enq (SvREFCNT_inc (prev));	870	{
		871	LOCK;
838		872
839	next = coro_deq (PRIO_MIN);	873	next = coro_deq (aTHX_ PRIO_MIN);
840		874
841	if (!next)	875	if (next)
842	next = SvREFCNT_inc (GvSV (coro_idle));	876	break;
843		877
844	GvSV (coro_current) = SvREFCNT_inc (next);	878	UNLOCK;
845	transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"),	879
846	sv_to_coro (next, "Coro::schedule", "next coroutine"),	880	{
847	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);	881	dSP;
848	SvREFCNT_dec (next);	882
849	SvREFCNT_dec (prev);	883	ENTER;
		884	SAVETMPS;
		885
		886	PUSHMARK (SP);
		887	PUTBACK;
		888	call_sv (GvSV (coro_idle), G_DISCARD);
		889
		890	FREETMPS;
		891	LEAVE;
		892	}
		893	}
		894
		895	prev = SvRV (current);
		896	SvRV (current) = next;
		897
		898	/* free this only after the transfer */
		899	coro_mortal = prev;
		900
		901	UNLOCK;
		902
		903	coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), TRANSFER_SAVE_ALL);
		904	}
		905
		906	static int coro_cede_self;
		907
		908	static void
		909	api_cede (void)
		910	{
		911	dTHX;
		912	SV *current = SvREFCNT_inc (SvRV (GvSV (coro_current)));
		913
		914	LOCK;
		915
		916	if (coro_cede_self)
		917	{
		918	AV *runqueue = coro_ready [PRIO_MAX - PRIO_MIN];
		919	av_unshift (runqueue, 1);
		920	av_store (runqueue, 0, current);
		921	coro_nready++;
		922	coro_cede_self = 0;
		923	}
		924	else
		925	coro_enq (aTHX_ current);
		926
		927	UNLOCK;
		928
		929	api_schedule ();
850	}	930	}
851		931
852	MODULE = Coro::State PACKAGE = Coro::State	932	MODULE = Coro::State PACKAGE = Coro::State
853		933
854	PROTOTYPES: ENABLE	934	PROTOTYPES: DISABLE
855		935
856	BOOT:	936	BOOT:
857	{ /* {} necessary for stoopid perl-5.6.x */	937	{
858	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);	938	#ifdef USE_ITHREADS
859	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);	939	MUTEX_INIT (&coro_mutex);
		940	#endif
		941	BOOT_PAGESIZE;
		942
860	coro_state_stash = gv_stashpv ("Coro::State", TRUE);	943	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
861		944
862	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	945	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
863	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	946	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
864	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));	947	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
865	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
866
867	if (!padlist_cache)
868	padlist_cache = newHV ();
869		948
870	main_mainstack = PL_mainstack;	949	main_mainstack = PL_mainstack;
871		950
872	{
873	SV *sv = perl_get_sv("Coro::API", 1);
874
875	coroapi.ver = CORO_API_VERSION - 1;	951	coroapi.ver = CORO_API_VERSION;
876	coroapi.transfer = api_transfer;	952	coroapi.transfer = api_transfer;
877	coroapi.schedule = api_schedule;
878	coroapi.ready = api_ready;
879		953
880	GCoroAPI = &coroapi;	954	Newz (0, main_stack, 1, coro_stack);
881	sv_setiv(sv, (IV)&coroapi);	955	main_stack->idle_sp = (void *)-1;
882	SvREADONLY_on(sv);
883	}
884	}
885		956
886	Coro::State	957	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
887	_newprocess(args)	958	}
888	SV * args	959
889	PROTOTYPE: $	960	SV *
		961	new (char *klass, ...)
890	CODE:	962	CODE:
891	Coro__State coro;	963	{
		964	struct coro *coro;
		965	HV *hv;
		966	int i;
892		967
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);	968	Newz (0, coro, 1, struct coro);
		969	coro->args = newAV ();
897		970
898	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	971	hv = newHV ();
		972	sv_magicext ((SV )hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char )coro, 0)->mg_flags \|= MGf_DUP;
		973	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
		974
		975	av_push (coro->args, newSVsv (RETVAL));
		976	for (i = 1; i < items; i++)
		977	av_push (coro->args, newSVsv (ST (i)));
		978
		979	coro->stack = main_stack;
899	coro->mainstack = 0; /* actual work is done inside transfer */	980	/coro->mainstack = 0; //actual work is done inside transfer /
900	coro->stack = 0;	981	/coro->stack = 0;/
901		982	}
902	RETVAL = coro;
903	OUTPUT:	983	OUTPUT:
904	RETVAL	984	RETVAL
905		985
906	void	986	void
907	transfer(prev, next, flags)	987	transfer (prev, next, flags)
908	Coro::State_or_hashref prev	988	SV *prev
909	Coro::State_or_hashref next	989	SV *next
910	int flags	990	int flags
911	PROTOTYPE: @
912	CODE:	991	CODE:
913	PUTBACK;	992	PUTBACK;
914	transfer (aTHX_ prev, next, flags);	993	coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
915	SPAGAIN;	994	SPAGAIN;
916		995
		996	int
		997	prio (Coro::State coro, int newprio = 0)
		998	ALIAS:
		999	nice = 1
		1000	CODE:
		1001	{
		1002	RETVAL = coro->prio;
		1003
		1004	if (items > 1)
		1005	{
		1006	if (ix)
		1007	newprio += coro->prio;
		1008
		1009	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
		1010	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
		1011
		1012	coro->prio = newprio;
		1013	}
		1014	}
		1015
917	void	1016	void
918	DESTROY(coro)	1017	_clear_idle_sp (Coro::State self)
919	Coro::State coro	1018	CODE:
920	CODE:	1019	self->stack->idle_sp = 0;
921
922	if (coro->mainstack && coro->mainstack != main_mainstack)
923	{
924	struct coro temp;
925
926	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
927	LOAD(aTHX_ coro);
928
929	destroy_stacks (aTHX);
930
931	LOAD((&temp)); /* this will get rid of defsv etc.. */
932
933	coro->mainstack = 0;
934	}
935
936	deallocate_stack (coro);
937
938	Safefree (coro);
939		1020
940	void	1021	void
941	flush()	1022	_clone_state_from (SV dst, SV src)
942	CODE:	1023	CODE:
943	#ifdef MAY_FLUSH	1024	{
944	flush_padlist_cache ();	1025	struct coro *coro_src = SvSTATE (src);
945	#endif	1026
		1027	sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
		1028
		1029	++coro_src->refcnt;
		1030	sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags \|= MGf_DUP;
		1031	}
946		1032
947	void	1033	void
948	_exit(code)	1034	_exit (code)
949	int code	1035	int code
950	PROTOTYPE: $	1036	PROTOTYPE: $
951	CODE:	1037	CODE:
952	#if defined(__GLIBC__) \|\| _POSIX_C_SOURCE
953	_exit (code);	1038	_exit (code);
954	#else
955	signal (SIGTERM, SIG_DFL);
956	raise (SIGTERM);
957	exit (code);
958	#endif
959		1039
960	MODULE = Coro::State PACKAGE = Coro::Cont	1040	MODULE = Coro::State PACKAGE = Coro::Cont
961		1041
962	# this is slightly dirty (should expose a c-level api)
963
964	void	1042	void
965	yield(...)	1043	yield (...)
966	PROTOTYPE: @	1044	PROTOTYPE: @
967	CODE:	1045	CODE:
968	static SV *returnstk;	1046	{
		1047	SV *yieldstack;
969	SV *sv;	1048	SV *sv;
970	AV *defav = GvAV (PL_defgv);	1049	AV *defav = GvAV (PL_defgv);
971	struct coro prev, next;	1050	struct coro prev, next;
972		1051
973	if (!returnstk)	1052	yieldstack = *hv_fetch (
974	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1053	(HV *)SvRV (GvSV (coro_current)),
		1054	"yieldstack", sizeof ("yieldstack") - 1,
		1055	0
		1056	);
975		1057
976	/* set up @_ -- ugly */	1058	/* set up @_ -- ugly */
977	av_clear (defav);	1059	av_clear (defav);
978	av_fill (defav, items - 1);	1060	av_fill (defav, items - 1);
979	while (items--)	1061	while (items--)
980	av_store (defav, items, SvREFCNT_inc (ST(items)));	1062	av_store (defav, items, SvREFCNT_inc (ST(items)));
981		1063
982	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
983	sv = av_pop ((AV *)SvRV (returnstk));	1064	sv = av_pop ((AV *)SvRV (yieldstack));
984	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));	1065	prev = SvSTATE (av_fetch ((AV )SvRV (sv), 0, 0));
985	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));	1066	next = SvSTATE (av_fetch ((AV )SvRV (sv), 1, 0));
986	SvREFCNT_dec (sv);	1067	SvREFCNT_dec (sv);
987		1068
988	transfer(aTHX_ prev, next, 0);	1069	coro_state_transfer (aTHX_ prev, next, 0);
		1070	}
989		1071
990	MODULE = Coro::State PACKAGE = Coro	1072	MODULE = Coro::State PACKAGE = Coro
991		1073
992	# this is slightly dirty (should expose a c-level api)
993
994	BOOT:	1074	BOOT:
995	{	1075	{
996	int i;	1076	int i;
		1077
997	HV *stash = gv_stashpv ("Coro", TRUE);	1078	coro_stash = gv_stashpv ("Coro", TRUE);
998		1079
999	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));	1080	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1000	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));	1081	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1001	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));	1082	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1002	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));	1083	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1003	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));	1084	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1004	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));	1085	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1005		1086
1006	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);	1087	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1007	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);	1088	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1008		1089
1009	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )	1090	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1010	coro_ready[i] = newAV ();	1091	coro_ready[i] = newAV ();
		1092
		1093	{
		1094	SV *sv = perl_get_sv("Coro::API", 1);
		1095
		1096	coroapi.schedule = api_schedule;
		1097	coroapi.cede = api_cede;
		1098	coroapi.ready = api_ready;
		1099	coroapi.nready = &coro_nready;
		1100	coroapi.current = coro_current;
		1101
		1102	GCoroAPI = &coroapi;
		1103	sv_setiv (sv, (IV)&coroapi);
		1104	SvREADONLY_on (sv);
		1105	}
1011	}	1106	}
1012		1107
1013	void	1108	void
1014	ready(self)	1109	ready (SV *self)
1015	SV * self	1110	PROTOTYPE: $
1016	CODE:	1111	CODE:
1017	api_ready (self);	1112	api_ready (self);
1018		1113
		1114	int
		1115	nready (...)
		1116	PROTOTYPE:
		1117	CODE:
		1118	RETVAL = coro_nready;
		1119	OUTPUT:
		1120	RETVAL
		1121
1019	void	1122	void
1020	schedule(...)	1123	schedule (...)
1021	ALIAS:	1124	PROTOTYPE:
1022	cede = 1
1023	CODE:	1125	CODE:
1024	api_schedule (ix);	1126	api_schedule ();
1025		1127
		1128	void
		1129	_set_cede_self ()
		1130	CODE:
		1131	coro_cede_self = 1;
		1132
		1133	void
		1134	cede (...)
		1135	PROTOTYPE:
		1136	CODE:
		1137	api_cede ();
		1138
		1139	MODULE = Coro::State PACKAGE = Coro::AIO
		1140
		1141	SV *
		1142	_get_state ()
		1143	CODE:
		1144	{
		1145	struct {
		1146	int errorno;
		1147	int laststype;
		1148	int laststatval;
		1149	Stat_t statcache;
		1150	} data;
		1151
		1152	data.errorno = errno;
		1153	data.laststype = PL_laststype;
		1154	data.laststatval = PL_laststatval;
		1155	data.statcache = PL_statcache;
		1156
		1157	RETVAL = newSVpvn ((char *)&data, sizeof data);
		1158	}
		1159	OUTPUT:
		1160	RETVAL
		1161
		1162	void
		1163	_set_state (char *data_)
		1164	PROTOTYPE: $
		1165	CODE:
		1166	{
		1167	struct {
		1168	int errorno;
		1169	int laststype;
		1170	int laststatval;
		1171	Stat_t statcache;
		1172	} data = (void )data_;
		1173
		1174	errno = data->errorno;
		1175	PL_laststype = data->laststype;
		1176	PL_laststatval = data->laststatval;
		1177	PL_statcache = data->statcache;
		1178	}

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.23 by root, Tue Aug 14 04:33:58 2001 UTC vs. Revision 1.89 by root, Sat Nov 25 00:40:26 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.23 by root, Tue Aug 14 04:33:58 2001 UTC vs.
Revision 1.89 by root, Sat Nov 25 00:40:26 2006 UTC