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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.11 by root, Sat Jul 21 18:21:45 2001 UTC vs. Revision 1.78 by root, Wed Nov 1 01:21:21 2006 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.11 by root, Sat Jul 21 18:21:45 2001 UTC vs.
Revision 1.78 by root, Wed Nov 1 01:21:21 2006 UTC