ViewVC Help

View File | Revision Log | Show Annotations | Download File

/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.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	#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::initialize"	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; /* original stacklevel when coroutine was created */
		99	JMPENV *top_env;
		100	coro_context cctx;
		101	} coro_stack;
20		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 */
21	struct coro {	107	struct coro {
		108	/* the c coroutine allocated to this perl coroutine, if any */
		109	coro_stack *stack;
		110
		111	/* data associated with this coroutine (initial args) */
		112	AV *args;
		113	int refcnt;
		114
22	/* optionally saved, might be zero */	115	/* optionally saved, might be zero */
23	AV *defav;	116	AV *defav;
24	SV *defsv;	117	SV *defsv;
25	SV *errsv;	118	SV *errsv;
26		119
27	/* saved global state not related to stacks */	120	/* saved global state not related to stacks */
28	U8 dowarn;	121	U8 dowarn;
		122	I32 in_eval;
29		123
30	/* the stacks and related info (callchain etc..) */	124	/* the stacks and related info (callchain etc..) */
31	PERL_SI *curstackinfo;	125	PERL_SI *curstackinfo;
32	AV *curstack;	126	AV *curstack;
33	AV *mainstack;	127	AV *mainstack;
34	SV **stack_sp;	128	SV **stack_sp;
35	OP *op;	129	OP *op;
36	SV **curpad;	130	SV **curpad;
		131	AV *comppad;
		132	CV *compcv;
37	SV **stack_base;	133	SV **stack_base;
38	SV **stack_max;	134	SV **stack_max;
39	SV **tmps_stack;	135	SV **tmps_stack;
40	I32 tmps_floor;	136	I32 tmps_floor;
41	I32 tmps_ix;	137	I32 tmps_ix;
…		…
50	I32 savestack_ix;	146	I32 savestack_ix;
51	I32 savestack_max;	147	I32 savestack_max;
52	OP **retstack;	148	OP **retstack;
53	I32 retstack_ix;	149	I32 retstack_ix;
54	I32 retstack_max;	150	I32 retstack_max;
		151	PMOP *curpm;
55	COP *curcop;	152	COP *curcop;
56		153
57	/* data associated with this coroutine (initial args) */	154	/* coro process data */
58	AV *args;	155	int prio;
59	};	156	};
60		157
61	typedef struct coro *Coro__State;	158	typedef struct coro *Coro__State;
62	typedef struct coro *Coro__State_or_hashref;	159	typedef struct coro *Coro__State_or_hashref;
63		160
64	static HV *padlist_cache;	161	static AV *
65		162	coro_clone_padlist (pTHX_ CV *cv)
66	/* mostly copied from op.c:cv_clone2 */
67	STATIC AV *
68	clone_padlist (AV *protopadlist)
69	{	163	{
70	AV *av;	164	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;	165	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		166
89	newpadlist = newAV ();	167	newpadlist = newAV ();
90	AvREAL_off (newpadlist);	168	AvREAL_off (newpadlist);
91	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)));
92	av_store (newpadlist, 1, (SV *) newpad);	178	av_store (newpadlist, 1, (SV *)newpad);
93		179
94	av = newAV (); /* will be @_ */	180	return newpadlist;
95	av_extend (av, 0);	181	}
96	av_store (newpad, 0, (SV *) av);
97	AvFLAGS (av) = AVf_REIFY;
98		182
99	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))
100	{	188	{
101	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;	189	I32 i = AvFILLp (padlist);
102	if (namesv && namesv != &PL_sv_undef)	190	while (i >= 0)
103	{	191	{
104	char *name = SvPVX (namesv); /* XXX */	192	SV **svp = av_fetch (padlist, i--, FALSE);
105	if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')	193	if (svp)
106	{ /* lexical from outside? */
107	npad[ix] = SvREFCNT_inc (ppad[ix]);
108	}	194	{
109	else
110	{ /* our own lexical */
111	SV *sv;	195	SV *sv;
112	if (*name == '&')	196	while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
113	sv = SvREFCNT_inc (ppad[ix]);	197	SvREFCNT_dec (sv);
114	else if (*name == '@')	198
115	sv = (SV *) newAV ();	199	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	}	200	}
124	}	201	}
125	else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))	202
126	{	203	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	}	204	}
		205	}
136		206
137	#if 0 /* return -ENOTUNDERSTOOD */	207	static int
138	/* 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;
139		212
140	for (ix = fpad; ix > 0; ix--) {	213	/* casting is fun. */
141	SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;	214	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
142	if (namesv	215	free_padlist (aTHX_ padlist);
143	&& namesv != &PL_sv_undef	216
144	&& !(SvFLAGS(namesv) & SVf_FAKE)	217	SvREFCNT_dec (av);
145	&& *SvPVX(namesv) == '&'	218
146	&& CvCLONE(ppad[ix]))	219	return 0;
147	{	220	}
148	CV *kid = cv_clone((CV*)ppad[ix]);	221
149	SvREFCNT_dec(ppad[ix]);	222	#define PERL_MAGIC_coro PERL_MAGIC_ext
150	CvCLONE_on(kid);	223
151	SvPADMY_on(kid);	224	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
152	npad[ix] = (SV*)kid;	225
153	}	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 ();
154	}	259	}
155	#endif
156		260
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));	261	av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
205	}	262	}
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		263
233	#define SB do {	264	#define SB do {
234	#define SE } while (0)	265	#define SE } while (0)
235		266
236	#define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE	267	#define LOAD(state) load_state(aTHX_ (state));
237	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE	268	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
238		269
239	#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
240		271
241	static void	272	static void
242	load_state(pTHX_ Coro__State c)	273	load_state(pTHX_ Coro__State c)
243	{	274	{
244	PL_dowarn = c->dowarn;	275	PL_dowarn = c->dowarn;
		276	PL_in_eval = c->in_eval;
245		277
246	PL_curstackinfo = c->curstackinfo;	278	PL_curstackinfo = c->curstackinfo;
247	PL_curstack = c->curstack;	279	PL_curstack = c->curstack;
248	PL_mainstack = c->mainstack;	280	PL_mainstack = c->mainstack;
249	PL_stack_sp = c->stack_sp;	281	PL_stack_sp = c->stack_sp;
250	PL_op = c->op;	282	PL_op = c->op;
251	PL_curpad = c->curpad;	283	PL_curpad = c->curpad;
		284	PL_comppad = c->comppad;
		285	PL_compcv = c->compcv;
252	PL_stack_base = c->stack_base;	286	PL_stack_base = c->stack_base;
253	PL_stack_max = c->stack_max;	287	PL_stack_max = c->stack_max;
254	PL_tmps_stack = c->tmps_stack;	288	PL_tmps_stack = c->tmps_stack;
255	PL_tmps_floor = c->tmps_floor;	289	PL_tmps_floor = c->tmps_floor;
256	PL_tmps_ix = c->tmps_ix;	290	PL_tmps_ix = c->tmps_ix;
…		…
262	PL_scopestack_ix = c->scopestack_ix;	296	PL_scopestack_ix = c->scopestack_ix;
263	PL_scopestack_max = c->scopestack_max;	297	PL_scopestack_max = c->scopestack_max;
264	PL_savestack = c->savestack;	298	PL_savestack = c->savestack;
265	PL_savestack_ix = c->savestack_ix;	299	PL_savestack_ix = c->savestack_ix;
266	PL_savestack_max = c->savestack_max;	300	PL_savestack_max = c->savestack_max;
		301	#if PERL_VERSION < 9
267	PL_retstack = c->retstack;	302	PL_retstack = c->retstack;
268	PL_retstack_ix = c->retstack_ix;	303	PL_retstack_ix = c->retstack_ix;
269	PL_retstack_max = c->retstack_max;	304	PL_retstack_max = c->retstack_max;
		305	#endif
		306	PL_curpm = c->curpm;
270	PL_curcop = c->curcop;	307	PL_curcop = c->curcop;
271		308
272	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	309	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
273	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	310	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
274	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);	311	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
…		…
282	{	319	{
283	AV *padlist = (AV *)POPs;	320	AV *padlist = (AV *)POPs;
284		321
285	if (padlist)	322	if (padlist)
286	{	323	{
287	put_padlist (cv); /* mark this padlist as available */	324	put_padlist (aTHX_ cv); /* mark this padlist as available */
288	CvPADLIST(cv) = padlist;	325	CvPADLIST(cv) = padlist;
289	#ifdef USE_THREADS
290	/*CvOWNER(cv) = (struct perl_thread *)POPs;*/
291	#endif
292	}	326	}
293		327
294	++CvDEPTH(cv);	328	++CvDEPTH(cv);
295	}	329	}
296		330
…		…
314		348
315	PUSHs (Nullsv);	349	PUSHs (Nullsv);
316	/* this loop was inspired by pp_caller */	350	/* this loop was inspired by pp_caller */
317	for (;;)	351	for (;;)
318	{	352	{
319	do	353	while (cxix >= 0)
320	{	354	{
321	PERL_CONTEXT *cx = &ccstk[cxix--];	355	PERL_CONTEXT *cx = &ccstk[cxix--];
322		356
323	if (CxTYPE(cx) == CXt_SUB)	357	if (CxTYPE(cx) == CXt_SUB)
324	{	358	{
325	CV *cv = cx->blk_sub.cv;	359	CV *cv = cx->blk_sub.cv;
326	if (CvDEPTH(cv))	360	if (CvDEPTH(cv))
327	{	361	{
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);	362	EXTEND (SP, CvDEPTH(cv)*2);
334		363
335	while (--CvDEPTH(cv))	364	while (--CvDEPTH(cv))
336	{	365	{
337	/* this tells the restore code to increment CvDEPTH */	366	/* this tells the restore code to increment CvDEPTH */
…		…
340	}	369	}
341		370
342	PUSHs ((SV *)CvPADLIST(cv));	371	PUSHs ((SV *)CvPADLIST(cv));
343	PUSHs ((SV *)cv);	372	PUSHs ((SV *)cv);
344		373
345	get_padlist (cv); /* this is a monster */	374	get_padlist (aTHX_ cv);
346	}	375	}
347	}	376	}
		377	#ifdef CXt_FORMAT
348	else if (CxTYPE(cx) == CXt_FORMAT)	378	else if (CxTYPE(cx) == CXt_FORMAT)
349	{	379	{
350	/* 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? */
351	/* my bold guess is as a simple, plain sub... */	381	/* my bold guess is as a simple, plain sub... */
352	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");
353	}	383	}
		384	#endif
354	}	385	}
355	while (cxix >= 0);
356		386
357	if (top_si->si_type == PERLSI_MAIN)	387	if (top_si->si_type == PERLSI_MAIN)
358	break;	388	break;
359		389
360	top_si = top_si->si_prev;	390	top_si = top_si->si_prev;
…		…
363	}	393	}
364		394
365	PUTBACK;	395	PUTBACK;
366	}	396	}
367		397
368	c->defav = flags & SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;	398	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
369	c->defsv = flags & SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	399	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
370	c->errsv = flags & SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;	400	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		401
377	c->dowarn = PL_dowarn;	402	c->dowarn = PL_dowarn;
		403	c->in_eval = PL_in_eval;
378		404
379	c->curstackinfo = PL_curstackinfo;	405	c->curstackinfo = PL_curstackinfo;
380	c->curstack = PL_curstack;	406	c->curstack = PL_curstack;
381	c->mainstack = PL_mainstack;	407	c->mainstack = PL_mainstack;
382	c->stack_sp = PL_stack_sp;	408	c->stack_sp = PL_stack_sp;
383	c->op = PL_op;	409	c->op = PL_op;
384	c->curpad = PL_curpad;	410	c->curpad = PL_curpad;
		411	c->comppad = PL_comppad;
		412	c->compcv = PL_compcv;
385	c->stack_base = PL_stack_base;	413	c->stack_base = PL_stack_base;
386	c->stack_max = PL_stack_max;	414	c->stack_max = PL_stack_max;
387	c->tmps_stack = PL_tmps_stack;	415	c->tmps_stack = PL_tmps_stack;
388	c->tmps_floor = PL_tmps_floor;	416	c->tmps_floor = PL_tmps_floor;
389	c->tmps_ix = PL_tmps_ix;	417	c->tmps_ix = PL_tmps_ix;
…		…
395	c->scopestack_ix = PL_scopestack_ix;	423	c->scopestack_ix = PL_scopestack_ix;
396	c->scopestack_max = PL_scopestack_max;	424	c->scopestack_max = PL_scopestack_max;
397	c->savestack = PL_savestack;	425	c->savestack = PL_savestack;
398	c->savestack_ix = PL_savestack_ix;	426	c->savestack_ix = PL_savestack_ix;
399	c->savestack_max = PL_savestack_max;	427	c->savestack_max = PL_savestack_max;
		428	#if PERL_VERSION < 9
400	c->retstack = PL_retstack;	429	c->retstack = PL_retstack;
401	c->retstack_ix = PL_retstack_ix;	430	c->retstack_ix = PL_retstack_ix;
402	c->retstack_max = PL_retstack_max;	431	c->retstack_max = PL_retstack_max;
		432	#endif
		433	c->curpm = PL_curpm;
403	c->curcop = PL_curcop;	434	c->curcop = PL_curcop;
		435	}
		436
		437	/*
		438	* allocate various perl stacks. This is an exact copy
		439	* of perl.c:init_stacks, except that it uses less memory
		440	* on the (sometimes correct) assumption that coroutines do
		441	* not usually need a lot of stackspace.
		442	*/
		443	static void
		444	coro_init_stacks (pTHX)
		445	{
		446	LOCK;
		447
		448	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
		449	PL_curstackinfo->si_type = PERLSI_MAIN;
		450	PL_curstack = PL_curstackinfo->si_stack;
		451	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
		452
		453	PL_stack_base = AvARRAY(PL_curstack);
		454	PL_stack_sp = PL_stack_base;
		455	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
		456
		457	New(50,PL_tmps_stack,96,SV*);
		458	PL_tmps_floor = -1;
		459	PL_tmps_ix = -1;
		460	PL_tmps_max = 96;
		461
		462	New(54,PL_markstack,16,I32);
		463	PL_markstack_ptr = PL_markstack;
		464	PL_markstack_max = PL_markstack + 16;
		465
		466	#ifdef SET_MARK_OFFSET
		467	SET_MARK_OFFSET;
		468	#endif
		469
		470	New(54,PL_scopestack,16,I32);
		471	PL_scopestack_ix = 0;
		472	PL_scopestack_max = 16;
		473
		474	New(54,PL_savestack,96,ANY);
		475	PL_savestack_ix = 0;
		476	PL_savestack_max = 96;
		477
		478	#if PERL_VERSION < 9
		479	New(54,PL_retstack,8,OP*);
		480	PL_retstack_ix = 0;
		481	PL_retstack_max = 8;
		482	#endif
		483
		484	UNLOCK;
404	}	485	}
405		486
406	/*	487	/*
407	* destroy the stacks, the callchain etc...	488	* destroy the stacks, the callchain etc...
408	* still there is a memleak of 128 bytes...
409	*/	489	*/
410	STATIC void	490	static void
411	destroy_stacks(pTHX)	491	destroy_stacks(pTHX)
412	{	492	{
		493	if (!IN_DESTRUCT)
		494	{
413	/* is this ugly, I ask? */	495	/* is this ugly, I ask? */
414	while (PL_scopestack_ix)	496	LEAVE_SCOPE (0);
415	LEAVE;
416		497
417	/* sure it is, but more important: is it correct?? :/ */	498	/* 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;	499	FREETMPS;
		500
		501	/*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
		502	}
420		503
421	while (PL_curstackinfo->si_next)	504	while (PL_curstackinfo->si_next)
422	PL_curstackinfo = PL_curstackinfo->si_next;	505	PL_curstackinfo = PL_curstackinfo->si_next;
423		506
424	while (PL_curstackinfo)	507	while (PL_curstackinfo)
425	{	508	{
426	PERL_SI *p = PL_curstackinfo->si_prev;	509	PERL_SI *p = PL_curstackinfo->si_prev;
427		510
428	{	511	{ /*D*//*remove*/
429	dSP;	512	dSP;
430	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	513	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
431	PUTBACK; /* possibly superfluous */	514	PUTBACK; /* possibly superfluous */
432	}	515	}
433		516
434	dounwind(-1);	517	if (!IN_DESTRUCT)
435		518	{
		519	dounwind (-1);/*D*//*remove*/
436	SvREFCNT_dec(PL_curstackinfo->si_stack);	520	SvREFCNT_dec (PL_curstackinfo->si_stack);
		521	}
		522
437	Safefree(PL_curstackinfo->si_cxstack);	523	Safefree (PL_curstackinfo->si_cxstack);
438	Safefree(PL_curstackinfo);	524	Safefree (PL_curstackinfo);
439	PL_curstackinfo = p;	525	PL_curstackinfo = p;
440	}	526	}
441		527
442	Safefree(PL_tmps_stack);	528	Safefree (PL_tmps_stack);
443	Safefree(PL_markstack);	529	Safefree (PL_markstack);
444	Safefree(PL_scopestack);	530	Safefree (PL_scopestack);
445	Safefree(PL_savestack);	531	Safefree (PL_savestack);
		532	#if PERL_VERSION < 9
446	Safefree(PL_retstack);	533	Safefree (PL_retstack);
		534	#endif
447	}	535	}
448		536
449	STATIC void	537	static void
450	transfer(pTHX_ struct coro *prev, struct coro *next, int flags)	538	setup_coro (struct coro *coro)
451	{	539	{
		540	/*
		541	* emulate part of the perl startup here.
		542	*/
		543	dTHX;
452	dSP;	544	dSP;
		545	UNOP myop;
		546	SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
453		547
454	if (prev != next)	548	coro_init_stacks (aTHX);
		549	/*PL_curcop = 0;*/
		550	/*PL_in_eval = PL_in_eval;*/ /* inherit */
		551	SvREFCNT_dec (GvAV (PL_defgv));
		552	GvAV (PL_defgv) = coro->args; coro->args = 0;
		553
		554	SPAGAIN;
		555
		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)
455	{	575	{
456	/*	576	SvREFCNT_dec (coro_mortal);
457	* this could be done in newprocess which would lead to	577	coro_mortal = 0;
458	* extremely elegant and fast (just SAVE/LOAD)	578	}
459	* code here, but lazy allocation of stacks has also	579	}
460	* some virtues and the overhead of the if() is nil.	580
461	*/	581	static void
		582	coro_run (void *arg)
		583	{
		584	/*
		585	* this is a _very_ stripped down perl interpreter ;)
		586	*/
		587	dTHX;
		588	int ret;
		589
		590	UNLOCK;
		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);
		605	abort ();
		606	}
		607
		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
		694	transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags)
		695	{
		696	dSTACKLEVEL;
		697
		698	/* sometimes transfer is only called to set idle_sp */
		699	if (flags == TRANSFER_SET_STACKLEVEL)
		700	((coro_stack *)prev)->idle_sp = STACKLEVEL;
		701	else if (prev != next)
		702	{
		703	coro_stack *prev__stack;
		704
		705	LOCK;
		706
462	if (next->mainstack)	707	if (next->mainstack)
463	{	708	{
		709	/* coroutine already started */
464	SAVE (prev, flags);	710	SAVE (prev, flags);
465	LOAD (next);	711	LOAD (next);
466	/* mark this state as in-use */
467	next->mainstack = 0;
468	next->tmps_ix = -2;
469	}
470	else if (next->tmps_ix == -2)
471	{
472	croak ("tried to transfer to running coroutine");
473	}	712	}
474	else	713	else
475	{	714	{
476	/*	715	/* need to start coroutine */
477	* emulate part of the perl startup here.
478	*/
479	UNOP myop;
480
481	SAVE (prev, -1); /* first get rid of the old state */	716	/* first get rid of the old state */
482		717	SAVE (prev, -1);
483	init_stacks (); /* from perl.c */	718	/* setup coroutine call */
484	SPAGAIN;	719	setup_coro (next);
485		720	/* need a stack */
486	PL_op = (OP *)&myop;	721	next->stack = 0;
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	*/
504	PUTBACK;
505	PL_op = pp_entersub(aTHX);
506	SPAGAIN;
507
508	ENTER; /* necessary e.g. for dounwind */
509	}	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;
510	}	747	}
511	}	748	}
512		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 };
		810
		811	static struct coro *
		812	SvSTATE (SV *coro)
		813	{
		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)
		822	{
		823	/* very slow, but rare, check */
		824	if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
		825	croak ("Coro::State object required");
		826	}
		827
		828	mg = SvMAGIC (coro);
		829	assert (mg->mg_type == PERL_MAGIC_ext);
		830	return (struct coro *)mg->mg_ptr;
		831	}
		832
		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
		842	api_transfer (SV *prev, SV *next, int flags)
		843	{
		844	dTHX;
		845	struct transfer_args ta;
		846
		847	prepare_transfer (aTHX_ &ta, prev, next, flags);
		848	TRANSFER (ta);
		849	}
		850
		851	/** Coro ********************************************************************/
		852
		853	#define PRIO_MAX 3
		854	#define PRIO_HIGH 1
		855	#define PRIO_NORMAL 0
		856	#define PRIO_LOW -1
		857	#define PRIO_IDLE -3
		858	#define PRIO_MIN -4
		859
		860	/* for Coro.pm */
		861	static GV *coro_current, *coro_idle;
		862	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
		863	static int coro_nready;
		864
		865	static void
		866	coro_enq (pTHX_ SV *sv)
		867	{
		868	int prio;
		869
		870	if (SvTYPE (sv) != SVt_PVHV)
		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++;
		877	}
		878
		879	static SV *
		880	coro_deq (pTHX_ int min_prio)
		881	{
		882	int prio = PRIO_MAX - PRIO_MIN;
		883
		884	min_prio -= PRIO_MIN;
		885	if (min_prio < 0)
		886	min_prio = 0;
		887
		888	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
		889	if (AvFILLp (coro_ready [prio]) >= 0)
		890	{
		891	coro_nready--;
		892	return av_shift (coro_ready [prio]);
		893	}
		894
		895	return 0;
		896	}
		897
		898	static void
		899	api_ready (SV *coro)
		900	{
		901	dTHX;
		902
		903	if (SvROK (coro))
		904	coro = SvRV (coro);
		905
		906	LOCK;
		907	coro_enq (aTHX_ SvREFCNT_inc (coro));
		908	UNLOCK;
		909	}
		910
		911	static void
		912	prepare_schedule (aTHX_ struct transfer_args *ta)
		913	{
		914	SV *current, *prev, *next;
		915
		916	LOCK;
		917
		918	current = GvSV (coro_current);
		919
		920	for (;;)
		921	{
		922	LOCK;
		923
		924	next = coro_deq (aTHX_ PRIO_MIN);
		925
		926	if (next)
		927	break;
		928
		929	UNLOCK;
		930
		931	{
		932	dSP;
		933
		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);
		988	}
		989
513	MODULE = Coro::State PACKAGE = Coro::State	990	MODULE = Coro::State PACKAGE = Coro::State
514		991
515	PROTOTYPES: ENABLE	992	PROTOTYPES: DISABLE
516		993
517	BOOT:	994	BOOT:
518	{ /* {} necessary for stoopid perl-5.6.x */	995	{
		996	#ifdef USE_ITHREADS
		997	MUTEX_INIT (&coro_mutex);
		998	#endif
		999	BOOT_PAGESIZE;
		1000
519	HV * stash = gv_stashpvn("Coro::State", 10, TRUE);	1001	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
520		1002
521	newCONSTSUB (stash, "SAVE_DEFAV", newSViv (SAVE_DEFAV));	1003	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
522	newCONSTSUB (stash, "SAVE_DEFSV", newSViv (SAVE_DEFSV));	1004	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
523	newCONSTSUB (stash, "SAVE_ERRSV", newSViv (SAVE_ERRSV));	1005	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
524		1006
525	if (!padlist_cache)	1007	main_mainstack = PL_mainstack;
526	padlist_cache = newHV ();
527	}
528		1008
529	Coro::State	1009	coroapi.ver = CORO_API_VERSION;
530	_newprocess(args)	1010	coroapi.transfer = api_transfer;
531	SV * args	1011
532	PROTOTYPE: $	1012	Newz (0, main_stack, 1, coro_stack);
		1013	main_stack->idle_sp = (void *)-1;
		1014
		1015	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
		1016	}
		1017
		1018	SV *
		1019	new (char *klass, ...)
533	CODE:	1020	CODE:
534	Coro__State coro;	1021	{
		1022	struct coro *coro;
		1023	HV *hv;
		1024	int i;
535		1025
536	if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
537	croak ("Coro::State::_newprocess expects an arrayref");
538
539	New (0, coro, 1, struct coro);	1026	Newz (0, coro, 1, struct coro);
		1027	coro->args = newAV ();
540		1028
		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;
541	coro->mainstack = 0; /* actual work is done inside transfer */	1037	/*coro->mainstack = 0; *//*actual work is done inside transfer */
542	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	1038	/*coro->stack = 0;*/
543		1039	}
544	RETVAL = coro;
545	OUTPUT:	1040	OUTPUT:
546	RETVAL	1041	RETVAL
547		1042
548	void	1043	void
549	transfer(prev, next, flags = SAVE_ALL)	1044	_set_stacklevel (...)
550	Coro::State_or_hashref prev	1045	ALIAS:
551	Coro::State_or_hashref next	1046	Coro::State::transfer = 1
552	int flags	1047	Coro::schedule = 2
553	PROTOTYPE: @	1048	Coro::cede = 3
		1049	Coro::Cont::yield = 4
554	CODE:	1050	CODE:
		1051	{
		1052	struct transfer_args ta;
555		1053
556	transfer (aTHX_ prev, next, flags);	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	}
557		1107
558	void	1108	void
559	DESTROY(coro)	1109	_clone_state_from (SV *dst, SV *src)
560	Coro::State coro	1110	CODE:
		1111	{
		1112	struct coro *coro_src = SvSTATE (src);
		1113
		1114	sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
		1115
		1116	++coro_src->refcnt;
		1117	sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
		1118	}
		1119
		1120	void
		1121	_nonlocal_goto (IV nextop)
		1122	CODE:
		1123	/* uuh, somebody will kill me again for this */
		1124	PL_op->op_next = INT2PTR (OP *, nextop);
		1125
		1126	void
		1127	_exit (code)
		1128	int code
		1129	PROTOTYPE: $
		1130	CODE:
		1131	_exit (code);
		1132
		1133	MODULE = Coro::State PACKAGE = Coro
		1134
		1135	BOOT:
		1136	{
		1137	int i;
		1138
		1139	coro_stash = gv_stashpv ("Coro", TRUE);
		1140
		1141	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
		1142	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
		1143	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
		1144	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
		1145	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
		1146	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
		1147
		1148	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
		1149	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
		1150
		1151	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
		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
561	CODE:	1173	CODE:
		1174	{
		1175	RETVAL = coro->prio;
562		1176
563	if (coro->mainstack)	1177	if (items > 1)
564	{	1178	{
565	struct coro temp;	1179	if (ix)
		1180	newprio += coro->prio;
566		1181
567	SAVE(aTHX_ (&temp), SAVE_ALL);	1182	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
568	LOAD(aTHX_ coro);	1183	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
569		1184
570	destroy_stacks ();	1185	coro->prio = newprio;
571
572	LOAD((&temp)); /* this will get rid of defsv etc.. */
573	}	1186	}
574		1187	}
575	Safefree (coro);
576		1188
577	void	1189	void
578	flush()	1190	ready (SV *self)
		1191	PROTOTYPE: $
579	CODE:	1192	CODE:
580	#ifdef MAY_FLUSH	1193	api_ready (self);
581	flush_padlist_cache ();
582	#endif
583		1194
		1195	int
		1196	nready (...)
		1197	PROTOTYPE:
		1198	CODE:
		1199	RETVAL = coro_nready;
		1200	OUTPUT:
		1201	RETVAL
		1202
584	MODULE = Coro::State PACKAGE = Coro::Cont	1203	MODULE = Coro::State PACKAGE = Coro::AIO
585		1204
586	# this is dirty (do you hear me?) and should be in it's own .xs	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
587		1225
588	void	1226	void
589	result(...)	1227	_set_state (char *data_)
590	PROTOTYPE: @	1228	PROTOTYPE: $
591	CODE:	1229	CODE:
592	static SV *returnstk;	1230	{
593	SV *sv;	1231	struct {
594	AV *defav = GvAV (PL_defgv);	1232	int errorno;
595	struct coro *prev, *next;	1233	int laststype;
		1234	int laststatval;
		1235	Stat_t statcache;
		1236	} *data = (void *)data_;
596		1237
597	if (!returnstk)	1238	errno = data->errorno;
598	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1239	PL_laststype = data->laststype;
599		1240	PL_laststatval = data->laststatval;
600	/* set up @_ -- ugly */	1241	PL_statcache = data->statcache;
601	av_clear (defav);	1242	}
602	av_fill (defav, items - 1);
603	while (items--)
604	av_store (defav, items, SvREFCNT_inc (ST(items)));
605
606	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
607	sv = av_pop ((AV *)SvRV (returnstk));
608	prev = (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)));
610	SvREFCNT_dec (sv);
611	transfer(prev, next, 0);
612

Diff Legend

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