[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.94 by root, Sun Nov 26 17:14:15 2006 UTC

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

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.94 by root, Sun Nov 26 17:14:15 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.94 by root, Sun Nov 26 17:14:15 2006 UTC