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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.27 by root, Mon Aug 20 16:58:19 2001 UTC vs.
Revision 1.90 by root, Sat Nov 25 00:56:35 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 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) 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	if (PL_main_cv != Nullcv) /* don't during destruction. hack? */	516	if (!IN_DESTRUCT)
520	dounwind(-1);	517	{
521		518	dounwind (-1);/D//remove/
522	SvREFCNT_dec(PL_curstackinfo->si_stack);	519	SvREFCNT_dec (PL_curstackinfo->si_stack);
		520	}
		521
523	Safefree(PL_curstackinfo->si_cxstack);	522	Safefree (PL_curstackinfo->si_cxstack);
524	Safefree(PL_curstackinfo);	523	Safefree (PL_curstackinfo);
525	PL_curstackinfo = p;	524	PL_curstackinfo = p;
526	}	525	}
527		526
528	Safefree(PL_tmps_stack);	527	Safefree (PL_tmps_stack);
529	Safefree(PL_markstack);	528	Safefree (PL_markstack);
530	Safefree(PL_scopestack);	529	Safefree (PL_scopestack);
531	Safefree(PL_savestack);	530	Safefree (PL_savestack);
		531	#if PERL_VERSION < 9
532	Safefree(PL_retstack);	532	Safefree (PL_retstack);
533	}
534
535	static void
536	allocate_stack (Coro__State ctx, int alloc)
537	{
538	coro_stack *stack;
539
540	New (0, stack, 1, coro_stack);
541
542	stack->refcnt = 1;
543	stack->usecnt = 1;
544	stack->gencnt = ctx->gencnt = 0;
545	if (alloc)
546	{
547	#ifdef HAVE_MMAP
548	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
549	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANON, 0, 0);
550	if (stack->sptr == (void *)-1)
551	#endif	533	#endif
552	{
553	/FIXME//D//* reasonable stack size! */
554	stack->ssize = -4096 * sizeof (long);
555	New (0, stack->sptr, 4096, long);
556	}
557	}
558	else
559	stack->sptr = 0;
560
561	ctx->stack = stack;
562	}	534	}
563		535
564	static void	536	static void
565	deallocate_stack (Coro__State ctx)	537	setup_coro (struct coro *coro)
566	{
567	coro_stack *stack = ctx->stack;
568
569	ctx->stack = 0;
570
571	if (stack)
572	{
573	if (!--stack->refcnt)
574	{
575	#ifdef HAVE_MMAP
576	if (stack->ssize > 0 && stack->sptr)
577	munmap (stack->sptr, stack->ssize);
578	else
579	#else
580	Safefree (stack->sptr);
581	#endif
582	Safefree (stack);
583	}
584	else if (ctx->gencnt == stack->gencnt)
585	--stack->usecnt;
586	}
587	}
588
589	static void
590	setup_coro (void *arg)
591	{	538	{
592	/*	539	/*
593	* emulate part of the perl startup here.	540	* emulate part of the perl startup here.
594	*/	541	*/
		542	dTHX;
595	dSP;	543	dSP;
596	Coro__State ctx = (Coro__State)arg;	544	UNOP myop;
597	SV sub_init = (SV)get_cv(SUB_INIT, FALSE);	545	SV sub_init = (SV )get_cv (SUB_INIT, FALSE);
598		546
599	coro_init_stacks (aTHX);	547	coro_init_stacks (aTHX);
600	/PL_curcop = 0;/	548	/PL_curcop = 0;/
601	/PL_in_eval = PL_in_eval;/ /* inherit */	549	/PL_in_eval = PL_in_eval;/ /* inherit */
602	SvREFCNT_dec (GvAV (PL_defgv));	550	SvREFCNT_dec (GvAV (PL_defgv));
603	GvAV (PL_defgv) = ctx->args;	551	GvAV (PL_defgv) = coro->args; coro->args = 0;
604		552
605	SPAGAIN;	553	SPAGAIN;
606		554
607	if (ctx->stack)	555	Zero (&myop, 1, UNOP);
608	{	556	myop.op_next = Nullop;
609	ctx->cursp = 0;	557	myop.op_flags = OPf_WANT_VOID;
610		558
		559	PL_op = (OP *)&myop;
		560
611	PUSHMARK(SP);	561	PUSHMARK(SP);
		562	XPUSHs (sub_init);
612	PUTBACK;	563	PUTBACK;
613	(void) call_sv (sub_init, G_VOID\|G_NOARGS\|G_EVAL);	564	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		565	SPAGAIN;
614		566
615	if (SvTRUE (ERRSV))	567	ENTER; /* necessary e.g. for dounwind */
616	croak (NULL);	568	}
617	else	569
618	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;
619	}	577	}
620	else
621	{
622	UNOP myop;
623		578
624	PL_op = (OP *)&myop;	579	UNLOCK;
625
626	Zero(&myop, 1, UNOP);
627	myop.op_next = Nullop;
628	myop.op_flags = OPf_WANT_VOID;
629
630	PUSHMARK(SP);
631	XPUSHs (sub_init);
632	/*
633	* the next line is slightly wrong, as PL_op->op_next
634	* is actually being executed so we skip the first op.
635	* that doesn't matter, though, since it is only
636	* pp_nextstate and we never return...
637	* ah yes, and I don't care anyways ;)
638	*/
639	PUTBACK;
640	PL_op = pp_entersub();
641	SPAGAIN;
642
643	ENTER; /* necessary e.g. for dounwind */
644	}
645	}	580	}
646		581
647	static void	582	static void
648	continue_coro (void *arg)	583	coro_run (void *arg)
649	{	584	{
650	/*	585	/*
651	* this is a _very_ stripped down perl interpreter ;)	586	* this is a _very_ stripped down perl interpreter ;)
652	*/	587	*/
653	Coro__State ctx = (Coro__State)arg;	588	dTHX;
654		589
655	/FIXME//* must set up top_env here */	590	transfer_tail ();
656	ctx->cursp = 0;	591
		592	PL_top_env = &PL_start_env;
657	PL_op = PL_op->op_next;	593	PL_restartop = PL_op->op_next;
658	CALLRUNOPS(aTHX);	594	/* somebody will hit me for both perl_run and PL_restart_top */
		595	perl_run (aTHX_ PERL_GET_CONTEXT);
659		596
660	abort ();	597	abort ();
661	}	598	}
662		599
663	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
664	transfer(pTHX_ struct coro prev, struct coro next, int flags)	676	transfer_impl (pTHX_ struct coro prev, struct coro next, int flags)
665	{	677	{
666	dSP;
667	dSTACKLEVEL;	678	dSTACKLEVEL;
668		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
669	if (prev != next)	686	if (prev != next)
670	{	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
671	if (next->mainstack)	697	if (next->mainstack)
672	{	698	{
		699	/* coroutine already started */
673	SAVE (prev, flags);	700	SAVE (prev, flags);
674	LOAD (next);	701	LOAD (next);
675
676	/* mark this state as in-use */
677	next->mainstack = 0;
678	next->tmps_ix = -2;
679
680	/* stacklevel changed? if yes, grab the stack for us! */
681	if (flags & TRANSFER_SAVE_CCTXT)
682	{
683	if (!prev->stack)
684	allocate_stack (prev, 0);
685	else if (prev->cursp != stacklevel
686	&& prev->stack->usecnt > 1)
687	{
688	prev->gencnt = ++prev->stack->gencnt;
689	prev->stack->usecnt = 1;
690	}
691
692	/* has our stack been invalidated? */
693	if (next->stack && next->stack->gencnt != next->gencnt)
694	{
695	deallocate_stack (next);
696	allocate_stack (next, 1);
697	coro_create (&(next->stack->cctx),
698	continue_coro, (void *)next,
699	next->stack->sptr, labs (next->stack->ssize));
700	}
701
702	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
703	}
704
705	}	702	}
706	else if (next->tmps_ix == -2)
707	croak ("tried to transfer to running coroutine");
708	else	703	else
709	{	704	{
		705	/* need to start coroutine */
710	SAVE (prev, -1); /* first get rid of the old state */	706	/* first get rid of the old state */
711		707	SAVE (prev, -1);
712	if (flags & TRANSFER_SAVE_CCTXT)	708	/* 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	}
734	}
735	else
736	setup_coro (next);	709	setup_coro (next);
		710	/* need to change stack from main_stack to real one */
		711	next->stack = 0;
737	}	712	}
		713
		714	if (!next->stack)
		715	stack_get (next);
		716
		717	if (prev_stack != next->stack)
		718	coro_transfer (&prev_stack->cctx, &next->stack->cctx);
738	}	719	}
739		720
740	next->cursp = stacklevel;	721	transfer_tail ();
741	}	722	}
		723
		724	/* use this function pointer to call the above function */
		725	/* this is done to increase chances of the compiler not inlining the call */
		726	void (coro_state_transfer)(pTHX_ struct coro prev, struct coro *next, int flags) = transfer_impl;
		727
		728	static void
		729	coro_state_destroy (struct coro *coro)
		730	{
		731	if (coro->refcnt--)
		732	return;
		733
		734	if (coro->mainstack && coro->mainstack != main_mainstack)
		735	{
		736	struct coro temp;
		737
		738	SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
		739	LOAD (aTHX_ coro);
		740
		741	destroy_stacks (aTHX);
		742
		743	LOAD ((&temp)); /* this will get rid of defsv etc.. */
		744
		745	coro->mainstack = 0;
		746	}
		747
		748	stack_free (coro->stack);
		749	SvREFCNT_dec (coro->args);
		750	Safefree (coro);
		751	}
		752
		753	static int
		754	coro_state_clear (SV sv, MAGIC mg)
		755	{
		756	struct coro coro = (struct coro )mg->mg_ptr;
		757	mg->mg_ptr = 0;
		758
		759	coro_state_destroy (coro);
		760
		761	return 0;
		762	}
		763
		764	static int
		765	coro_state_dup (MAGIC mg, CLONE_PARAMS params)
		766	{
		767	struct coro coro = (struct coro )mg->mg_ptr;
		768
		769	++coro->refcnt;
		770
		771	return 0;
		772	}
		773
		774	static MGVTBL coro_state_vtbl = { 0, 0, 0, 0, coro_state_clear, 0, coro_state_dup, 0 };
742		775
743	static struct coro *	776	static struct coro *
744	sv_to_coro (SV arg, const char funcname, const char *varname)	777	SvSTATE (SV *coro)
745	{	778	{
746	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)	779	HV *stash;
747	{	780	MAGIC *mg;
748	HE he = hv_fetch_ent((HV )SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
749		781
750	if (!he)	782	if (SvROK (coro))
751	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);	783	coro = SvRV (coro);
752		784
753	arg = HeVAL(he);	785	stash = SvSTASH (coro);
		786	if (stash != coro_stash && stash != coro_state_stash)
		787	{
		788	/* very slow, but rare, check */
		789	if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
		790	croak ("Coro::State object required");
754	}	791	}
755
756	/* must also be changed inside Coro::Cont::yield */
757	if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
758	return (struct coro ) SvIV((SV)SvRV(arg));
759		792
760	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);	793	mg = SvMAGIC (coro);
761	/NORETURN/	794	assert (mg->mg_type == PERL_MAGIC_ext);
		795	return (struct coro *)mg->mg_ptr;
762	}	796	}
763		797
764	static void	798	static void
765	api_transfer(pTHX_ SV prev, SV next, int flags)	799	api_transfer (pTHX_ SV prev, SV next, int flags)
766	{	800	{
767	transfer(aTHX_	801	coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
768	sv_to_coro (prev, "Coro::transfer", "prev"),
769	sv_to_coro (next, "Coro::transfer", "next"),
770	flags);
771	}	802	}
772		803
773	/ Coro ******************************************************************/	804	/ Coro ******************************************************************/
774		805
775	#define PRIO_MAX 3	806	#define PRIO_MAX 3
…		…
779	#define PRIO_IDLE -3	810	#define PRIO_IDLE -3
780	#define PRIO_MIN -4	811	#define PRIO_MIN -4
781		812
782	/* for Coro.pm */	813	/* for Coro.pm */
783	static GV coro_current, coro_idle;	814	static GV coro_current, coro_idle;
784	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];	815	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
785	static int coro_nready;	816	static int coro_nready;
786		817
787	static void	818	static void
788	coro_enq (SV *sv)	819	coro_enq (pTHX_ SV *sv)
789	{	820	{
790	if (SvROK (sv))	821	int prio;
791	{	822
792	SV *hv = SvRV (sv);
793	if (SvTYPE (hv) == SVt_PVHV)	823	if (SvTYPE (sv) != SVt_PVHV)
794	{
795	SV *xprio = hv_fetch ((HV )hv, "prio", 4, 0);
796	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
797
798	prio = prio > PRIO_MAX ? PRIO_MAX
799	: prio < PRIO_MIN ? PRIO_MIN
800	: prio;
801
802	av_push (coro_ready [prio - PRIO_MIN], sv);
803	coro_nready++;
804
805	return;
806	}
807	}
808
809	croak ("Coro::ready tried to enqueue something that is not a coroutine");	824	croak ("Coro::ready tried to enqueue something that is not a coroutine");
		825
		826	prio = SvSTATE (sv)->prio;
		827
		828	av_push (coro_ready [prio - PRIO_MIN], sv);
		829	coro_nready++;
810	}	830	}
811		831
812	static SV *	832	static SV *
813	coro_deq (int min_prio)	833	coro_deq (pTHX_ int min_prio)
814	{	834	{
815	int prio = PRIO_MAX - PRIO_MIN;	835	int prio = PRIO_MAX - PRIO_MIN;
816		836
817	min_prio -= PRIO_MIN;	837	min_prio -= PRIO_MIN;
818	if (min_prio < 0)	838	if (min_prio < 0)
819	min_prio = 0;	839	min_prio = 0;
820		840
821	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )	841	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
822	if (av_len (coro_ready[prio]) >= 0)	842	if (AvFILLp (coro_ready [prio]) >= 0)
823	{	843	{
824	coro_nready--;	844	coro_nready--;
825	return av_shift (coro_ready[prio]);	845	return av_shift (coro_ready [prio]);
826	}	846	}
827		847
828	return 0;	848	return 0;
829	}	849	}
830		850
831	static void	851	static void
832	api_ready (SV *coro)	852	api_ready (SV *coro)
833	{	853	{
		854	dTHX;
		855
		856	if (SvROK (coro))
		857	coro = SvRV (coro);
		858
		859	LOCK;
834	coro_enq (SvREFCNT_inc (coro));	860	coro_enq (aTHX_ SvREFCNT_inc (coro));
		861	UNLOCK;
835	}	862	}
836		863
837	static void	864	static void
838	api_schedule (int cede)	865	api_schedule (void)
839	{	866	{
		867	dTHX;
		868
840	SV prev, next;	869	SV prev, next;
841
842	prev = GvSV (coro_current);	870	SV *current = GvSV (coro_current);
843		871
844	if (cede)	872	for (;;)
845	coro_enq (SvREFCNT_inc (prev));	873	{
		874	LOCK;
846		875
847	next = coro_deq (PRIO_MIN);	876	next = coro_deq (aTHX_ PRIO_MIN);
848		877
849	if (!next)	878	if (next)
850	next = SvREFCNT_inc (GvSV (coro_idle));	879	break;
851		880
852	GvSV (coro_current) = SvREFCNT_inc (next);	881	UNLOCK;
853	transfer (aTHX_	882
854	sv_to_coro (prev, "Coro::schedule", "current coroutine"),	883	{
855	sv_to_coro (next, "Coro::schedule", "next coroutine"),	884	dSP;
856	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);	885
857	SvREFCNT_dec (next);	886	ENTER;
858	SvREFCNT_dec (prev);	887	SAVETMPS;
		888
		889	PUSHMARK (SP);
		890	PUTBACK;
		891	call_sv (GvSV (coro_idle), G_DISCARD);
		892
		893	FREETMPS;
		894	LEAVE;
		895	}
		896	}
		897
		898	prev = SvRV (current);
		899	SvRV (current) = next;
		900
		901	/* free this only after the transfer */
		902	coro_mortal = prev;
		903
		904	UNLOCK;
		905
		906	coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), TRANSFER_SAVE_ALL);
		907	}
		908
		909	static int coro_cede_self;
		910
		911	static void
		912	api_cede (void)
		913	{
		914	dTHX;
		915	SV *current = SvREFCNT_inc (SvRV (GvSV (coro_current)));
		916
		917	LOCK;
		918
		919	if (coro_cede_self)
		920	{
		921	AV *runqueue = coro_ready [PRIO_MAX - PRIO_MIN];
		922	av_unshift (runqueue, 1);
		923	av_store (runqueue, 0, current);
		924	coro_nready++;
		925	coro_cede_self = 0;
		926	}
		927	else
		928	coro_enq (aTHX_ current);
		929
		930	UNLOCK;
		931
		932	api_schedule ();
859	}	933	}
860		934
861	MODULE = Coro::State PACKAGE = Coro::State	935	MODULE = Coro::State PACKAGE = Coro::State
862		936
863	PROTOTYPES: ENABLE	937	PROTOTYPES: DISABLE
864		938
865	BOOT:	939	BOOT:
866	{ /* {} necessary for stoopid perl-5.6.x */	940	{
867	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);	941	#ifdef USE_ITHREADS
868	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);	942	MUTEX_INIT (&coro_mutex);
		943	#endif
		944	BOOT_PAGESIZE;
		945
869	coro_state_stash = gv_stashpv ("Coro::State", TRUE);	946	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
870		947
871	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	948	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
872	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	949	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
873	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));	950	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
874	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
875
876	if (!padlist_cache)
877	padlist_cache = newHV ();
878		951
879	main_mainstack = PL_mainstack;	952	main_mainstack = PL_mainstack;
880		953
881	coroapi.ver = CORO_API_VERSION;	954	coroapi.ver = CORO_API_VERSION;
882	coroapi.transfer = api_transfer;	955	coroapi.transfer = api_transfer;
883	}
884		956
885	Coro::State	957	Newz (0, main_stack, 1, coro_stack);
886	_newprocess(args)	958	main_stack->idle_sp = (void *)-1;
887	SV * args	959
888	PROTOTYPE: $	960	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
		961	}
		962
		963	SV *
		964	new (char *klass, ...)
889	CODE:	965	CODE:
890	Coro__State coro;	966	{
		967	struct coro *coro;
		968	HV *hv;
		969	int i;
891		970
892	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
893	croak ("Coro::State::_newprocess expects an arrayref");
894
895	New (0, coro, 1, struct coro);	971	Newz (0, coro, 1, struct coro);
		972	coro->args = newAV ();
896		973
897	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	974	hv = newHV ();
		975	sv_magicext ((SV )hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char )coro, 0)->mg_flags \|= MGf_DUP;
		976	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
		977
		978	av_push (coro->args, newSVsv (RETVAL));
		979	for (i = 1; i < items; i++)
		980	av_push (coro->args, newSVsv (ST (i)));
		981
		982	coro->stack = main_stack;
898	coro->mainstack = 0; /* actual work is done inside transfer */	983	/coro->mainstack = 0; //actual work is done inside transfer /
899	coro->stack = 0;	984	/coro->stack = 0;/
900		985	}
901	RETVAL = coro;
902	OUTPUT:	986	OUTPUT:
903	RETVAL	987	RETVAL
904		988
905	void	989	void
906	transfer(prev, next, flags)	990	transfer (prev, next, flags)
907	Coro::State_or_hashref prev	991	SV *prev
908	Coro::State_or_hashref next	992	SV *next
909	int flags	993	int flags
910	PROTOTYPE: @
911	CODE:	994	CODE:
912	PUTBACK;	995	PUTBACK;
913	transfer (aTHX_ prev, next, flags);	996	coro_state_transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
914	SPAGAIN;	997	SPAGAIN;
915		998
		999	int
		1000	prio (Coro::State coro, int newprio = 0)
		1001	ALIAS:
		1002	nice = 1
		1003	CODE:
		1004	{
		1005	RETVAL = coro->prio;
		1006
		1007	if (items > 1)
		1008	{
		1009	if (ix)
		1010	newprio += coro->prio;
		1011
		1012	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
		1013	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
		1014
		1015	coro->prio = newprio;
		1016	}
		1017	}
		1018
916	void	1019	void
917	DESTROY(coro)	1020	_clear_idle_sp (Coro::State self)
918	Coro::State coro	1021	CODE:
919	CODE:	1022	self->stack->idle_sp = 0;
920
921	if (coro->mainstack && coro->mainstack != main_mainstack)
922	{
923	struct coro temp;
924
925	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
926	LOAD(aTHX_ coro);
927
928	destroy_stacks (aTHX);
929
930	LOAD((&temp)); /* this will get rid of defsv etc.. */
931
932	coro->mainstack = 0;
933	}
934
935	deallocate_stack (coro);
936
937	Safefree (coro);
938		1023
939	void	1024	void
940	flush()	1025	_clone_state_from (SV dst, SV src)
941	CODE:	1026	CODE:
942	#ifdef MAY_FLUSH	1027	{
943	flush_padlist_cache ();	1028	struct coro *coro_src = SvSTATE (src);
944	#endif	1029
		1030	sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
		1031
		1032	++coro_src->refcnt;
		1033	sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags \|= MGf_DUP;
		1034	}
945		1035
946	void	1036	void
947	_exit(code)	1037	_exit (code)
948	int code	1038	int code
949	PROTOTYPE: $	1039	PROTOTYPE: $
950	CODE:	1040	CODE:
951	#if defined(__GLIBC__) \|\| _POSIX_C_SOURCE
952	_exit (code);	1041	_exit (code);
953	#else
954	signal (SIGTERM, SIG_DFL);
955	raise (SIGTERM);
956	exit (code);
957	#endif
958		1042
959	MODULE = Coro::State PACKAGE = Coro::Cont	1043	MODULE = Coro::State PACKAGE = Coro::Cont
960		1044
961	# this is slightly dirty (should expose a c-level api)
962
963	void	1045	void
964	yield(...)	1046	yield (...)
965	PROTOTYPE: @	1047	PROTOTYPE: @
966	CODE:	1048	CODE:
967	static SV *returnstk;	1049	{
		1050	SV *yieldstack;
968	SV *sv;	1051	SV *sv;
969	AV *defav = GvAV (PL_defgv);	1052	AV *defav = GvAV (PL_defgv);
970	struct coro prev, next;	1053	struct coro prev, next;
971		1054
972	if (!returnstk)	1055	yieldstack = *hv_fetch (
973	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1056	(HV *)SvRV (GvSV (coro_current)),
		1057	"yieldstack", sizeof ("yieldstack") - 1,
		1058	0
		1059	);
974		1060
975	/* set up @_ -- ugly */	1061	/* set up @_ -- ugly */
976	av_clear (defav);	1062	av_clear (defav);
977	av_fill (defav, items - 1);	1063	av_fill (defav, items - 1);
978	while (items--)	1064	while (items--)
979	av_store (defav, items, SvREFCNT_inc (ST(items)));	1065	av_store (defav, items, SvREFCNT_inc (ST(items)));
980		1066
981	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
982	sv = av_pop ((AV *)SvRV (returnstk));	1067	sv = av_pop ((AV *)SvRV (yieldstack));
983	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));	1068	prev = SvSTATE (av_fetch ((AV )SvRV (sv), 0, 0));
984	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));	1069	next = SvSTATE (av_fetch ((AV )SvRV (sv), 1, 0));
985	SvREFCNT_dec (sv);	1070	SvREFCNT_dec (sv);
986		1071
987	transfer(aTHX_ prev, next, 0);	1072	coro_state_transfer (aTHX_ prev, next, 0);
		1073	}
988		1074
989	MODULE = Coro::State PACKAGE = Coro	1075	MODULE = Coro::State PACKAGE = Coro
990		1076
991	# this is slightly dirty (should expose a c-level api)
992
993	BOOT:	1077	BOOT:
994	{	1078	{
995	int i;	1079	int i;
		1080
996	HV *stash = gv_stashpv ("Coro", TRUE);	1081	coro_stash = gv_stashpv ("Coro", TRUE);
997		1082
998	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));	1083	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
999	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));	1084	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1000	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));	1085	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1001	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));	1086	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1002	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));	1087	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1003	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));	1088	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1004		1089
1005	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);	1090	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
1006	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);	1091	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
1007		1092
1008	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )	1093	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
…		…
1010		1095
1011	{	1096	{
1012	SV *sv = perl_get_sv("Coro::API", 1);	1097	SV *sv = perl_get_sv("Coro::API", 1);
1013		1098
1014	coroapi.schedule = api_schedule;	1099	coroapi.schedule = api_schedule;
		1100	coroapi.cede = api_cede;
1015	coroapi.ready = api_ready;	1101	coroapi.ready = api_ready;
1016	coroapi.nready = &coro_nready;	1102	coroapi.nready = &coro_nready;
1017	coroapi.current = coro_current;	1103	coroapi.current = coro_current;
1018		1104
1019	GCoroAPI = &coroapi;	1105	GCoroAPI = &coroapi;
1020	sv_setiv(sv, (IV)&coroapi);	1106	sv_setiv (sv, (IV)&coroapi);
1021	SvREADONLY_on(sv);	1107	SvREADONLY_on (sv);
1022	}	1108	}
1023	}	1109	}
1024		1110
1025	void	1111	void
1026	ready(self)	1112	ready (SV *self)
1027	SV * self	1113	PROTOTYPE: $
1028	CODE:	1114	CODE:
1029	api_ready (self);	1115	api_ready (self);
1030		1116
1031	int	1117	int
1032	nready(...)	1118	nready (...)
1033	PROTOTYPE:	1119	PROTOTYPE:
1034	CODE:	1120	CODE:
1035	RETVAL = coro_nready;	1121	RETVAL = coro_nready;
1036	OUTPUT:	1122	OUTPUT:
1037	RETVAL	1123	RETVAL
1038		1124
1039	void	1125	void
1040	schedule(...)	1126	schedule (...)
1041	PROTOTYPE:	1127	PROTOTYPE:
1042	ALIAS:
1043	cede = 1
1044	CODE:	1128	CODE:
1045	api_schedule (ix);	1129	api_schedule ();
1046		1130
		1131	void
		1132	_set_cede_self ()
		1133	CODE:
		1134	coro_cede_self = 1;
		1135
		1136	void
		1137	cede (...)
		1138	PROTOTYPE:
		1139	CODE:
		1140	api_cede ();
		1141
		1142	MODULE = Coro::State PACKAGE = Coro::AIO
		1143
		1144	SV *
		1145	_get_state ()
		1146	CODE:
		1147	{
		1148	struct {
		1149	int errorno;
		1150	int laststype;
		1151	int laststatval;
		1152	Stat_t statcache;
		1153	} data;
		1154
		1155	data.errorno = errno;
		1156	data.laststype = PL_laststype;
		1157	data.laststatval = PL_laststatval;
		1158	data.statcache = PL_statcache;
		1159
		1160	RETVAL = newSVpvn ((char *)&data, sizeof data);
		1161	}
		1162	OUTPUT:
		1163	RETVAL
		1164
		1165	void
		1166	_set_state (char *data_)
		1167	PROTOTYPE: $
		1168	CODE:
		1169	{
		1170	struct {
		1171	int errorno;
		1172	int laststype;
		1173	int laststatval;
		1174	Stat_t statcache;
		1175	} data = (void )data_;
		1176
		1177	errno = data->errorno;
		1178	PL_laststype = data->laststype;
		1179	PL_laststatval = data->laststatval;
		1180	PL_statcache = data->statcache;
		1181	}

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.27 by root, Mon Aug 20 16:58:19 2001 UTC vs. Revision 1.90 by root, Sat Nov 25 00:56:35 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.27 by root, Mon Aug 20 16:58:19 2001 UTC vs.
Revision 1.90 by root, Sat Nov 25 00:56:35 2006 UTC