ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

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

Diff Legend

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