ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.96 by root, Sun Nov 26 18:25:11 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 TRANSFER_SAVE_DEFAV 0x00000001	93	/* the stack */
16	#define TRANSFER_SAVE_DEFSV 0x00000002	94	void *sptr;
17	#define TRANSFER_SAVE_ERRSV 0x00000004	95	long ssize; /* positive == mmap, otherwise malloc */
18		96
19	#define TRANSFER_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 AV *main_mainstack; /* used to differentiate between $main and others */	158	static AV *
65		159	coro_clone_padlist (pTHX_ CV *cv)
66	static HV *padlist_cache;
67
68	/* mostly copied from op.c:cv_clone2 */
69	STATIC AV *
70	clone_padlist (AV *protopadlist)
71	{	160	{
72	AV *av;	161	AV *padlist = CvPADLIST (cv);
73	I32 ix;
74	AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
75	AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
76	SV **pname = AvARRAY (protopad_name);
77	SV **ppad = AvARRAY (protopad);
78	I32 fname = AvFILLp (protopad_name);
79	I32 fpad = AvFILLp (protopad);
80	AV *newpadlist, *newpad_name, *newpad;	162	AV *newpadlist, *newpad;
81	SV **npad;
82
83	newpad_name = newAV ();
84	for (ix = fname; ix >= 0; ix--)
85	av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
86
87	newpad = newAV ();
88	av_fill (newpad, AvFILLp (protopad));
89	npad = AvARRAY (newpad);
90		163
91	newpadlist = newAV ();	164	newpadlist = newAV ();
92	AvREAL_off (newpadlist);	165	AvREAL_off (newpadlist);
93	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)));
94	av_store (newpadlist, 1, (SV *) newpad);	175	av_store (newpadlist, 1, (SV *)newpad);
95		176
96	av = newAV (); /* will be @_ */	177	return newpadlist;
97	av_extend (av, 0);	178	}
98	av_store (newpad, 0, (SV *) av);
99	AvFLAGS (av) = AVf_REIFY;
100		179
101	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))
102	{	185	{
103	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;	186	I32 i = AvFILLp (padlist);
104	if (namesv && namesv != &PL_sv_undef)	187	while (i >= 0)
105	{	188	{
106	char *name = SvPVX (namesv); /* XXX */	189	SV **svp = av_fetch (padlist, i--, FALSE);
107	if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')	190	if (svp)
108	{ /* lexical from outside? */
109	npad[ix] = SvREFCNT_inc (ppad[ix]);
110	}	191	{
111	else
112	{ /* our own lexical */
113	SV *sv;	192	SV *sv;
114	if (*name == '&')	193	while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
115	sv = SvREFCNT_inc (ppad[ix]);	194	SvREFCNT_dec (sv);
116	else if (*name == '@')	195
117	sv = (SV *) newAV ();	196	SvREFCNT_dec (*svp);
118	else if (*name == '%')
119	sv = (SV *) newHV ();
120	else
121	sv = NEWSV (0, 0);
122	if (!SvPADBUSY (sv))
123	SvPADMY_on (sv);
124	npad[ix] = sv;
125	}	197	}
126	}	198	}
127	else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))	199
128	{	200	SvREFCNT_dec ((SV*)padlist);
129	npad[ix] = SvREFCNT_inc (ppad[ix]);
130	}
131	else
132	{
133	SV *sv = NEWSV (0, 0);
134	SvPADTMP_on (sv);
135	npad[ix] = sv;
136	}
137	}	201	}
		202	}
138		203
139	#if 0 /* return -ENOTUNDERSTOOD */	204	static int
140	/* 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;
141		209
142	for (ix = fpad; ix > 0; ix--) {	210	/* casting is fun. */
143	SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;	211	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
144	if (namesv	212	free_padlist (aTHX_ padlist);
145	&& namesv != &PL_sv_undef	213
146	&& !(SvFLAGS(namesv) & SVf_FAKE)	214	SvREFCNT_dec (av);
147	&& *SvPVX(namesv) == '&'	215
148	&& CvCLONE(ppad[ix]))	216	return 0;
149	{	217	}
150	CV *kid = cv_clone((CV*)ppad[ix]);	218
151	SvREFCNT_dec(ppad[ix]);	219	#define PERL_MAGIC_coro PERL_MAGIC_ext
152	CvCLONE_on(kid);	220
153	SvPADMY_on(kid);	221	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
154	npad[ix] = (SV*)kid;	222
155	}	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 ();
156	}	256	}
157	#endif
158		257
159	return newpadlist;
160	}
161
162	#ifdef MAY_FLUSH
163	STATIC AV *
164	free_padlist (AV *padlist)
165	{
166	/* may be during global destruction */
167	if (SvREFCNT(padlist))
168	{
169	I32 i = AvFILLp(padlist);
170	while (i >= 0)
171	{
172	SV **svp = av_fetch(padlist, i--, FALSE);
173	SV *sv = svp ? *svp : Nullsv;
174	if (sv)
175	SvREFCNT_dec(sv);
176	}
177
178	SvREFCNT_dec((SV*)padlist);
179	}
180	}
181	#endif
182
183	/* the next two functions merely cache the padlists */
184	STATIC void
185	get_padlist (CV *cv)
186	{
187	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
188
189	if (he && AvFILLp ((AV *)*he) >= 0)
190	CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
191	else
192	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
193	}
194
195	STATIC void
196	put_padlist (CV *cv)
197	{
198	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
199
200	if (SvTYPE (*he) != SVt_PVAV)
201	{
202	SvREFCNT_dec (*he);
203	*he = (SV *)newAV ();
204	}
205
206	av_push ((AV *)*he, (SV *)CvPADLIST (cv));	258	av_push ((AV *)mg->mg_obj, (SV *)CvPADLIST (cv));
207	}	259	}
208
209	#ifdef MAY_FLUSH
210	STATIC void
211	flush_padlist_cache ()
212	{
213	HV *hv = padlist_cache;
214	padlist_cache = newHV ();
215
216	if (hv_iterinit (hv))
217	{
218	HE *he;
219	AV *padlist;
220
221	while (!!(he = hv_iternext (hv)))
222	{
223	AV *av = (AV *)HeVAL(he);
224
225	/* casting is fun. */
226	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
227	free_padlist (padlist);
228	}
229	}
230
231	SvREFCNT_dec (hv);
232	}
233	#endif
234		260
235	#define SB do {	261	#define SB do {
236	#define SE } while (0)	262	#define SE } while (0)
237		263
238	#define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE	264	#define LOAD(state) load_state(aTHX_ (state));
239	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE	265	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
240		266
241	#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
242		268
243	static void	269	static void
244	load_state(pTHX_ Coro__State c)	270	load_state(pTHX_ Coro__State c)
245	{	271	{
246	PL_dowarn = c->dowarn;	272	PL_dowarn = c->dowarn;
		273	PL_in_eval = c->in_eval;
247		274
248	PL_curstackinfo = c->curstackinfo;	275	PL_curstackinfo = c->curstackinfo;
249	PL_curstack = c->curstack;	276	PL_curstack = c->curstack;
250	PL_mainstack = c->mainstack;	277	PL_mainstack = c->mainstack;
251	PL_stack_sp = c->stack_sp;	278	PL_stack_sp = c->stack_sp;
252	PL_op = c->op;	279	PL_op = c->op;
253	PL_curpad = c->curpad;	280	PL_curpad = c->curpad;
		281	PL_comppad = c->comppad;
		282	PL_compcv = c->compcv;
254	PL_stack_base = c->stack_base;	283	PL_stack_base = c->stack_base;
255	PL_stack_max = c->stack_max;	284	PL_stack_max = c->stack_max;
256	PL_tmps_stack = c->tmps_stack;	285	PL_tmps_stack = c->tmps_stack;
257	PL_tmps_floor = c->tmps_floor;	286	PL_tmps_floor = c->tmps_floor;
258	PL_tmps_ix = c->tmps_ix;	287	PL_tmps_ix = c->tmps_ix;
…		…
264	PL_scopestack_ix = c->scopestack_ix;	293	PL_scopestack_ix = c->scopestack_ix;
265	PL_scopestack_max = c->scopestack_max;	294	PL_scopestack_max = c->scopestack_max;
266	PL_savestack = c->savestack;	295	PL_savestack = c->savestack;
267	PL_savestack_ix = c->savestack_ix;	296	PL_savestack_ix = c->savestack_ix;
268	PL_savestack_max = c->savestack_max;	297	PL_savestack_max = c->savestack_max;
		298	#if PERL_VERSION < 9
269	PL_retstack = c->retstack;	299	PL_retstack = c->retstack;
270	PL_retstack_ix = c->retstack_ix;	300	PL_retstack_ix = c->retstack_ix;
271	PL_retstack_max = c->retstack_max;	301	PL_retstack_max = c->retstack_max;
		302	#endif
		303	PL_curpm = c->curpm;
272	PL_curcop = c->curcop;	304	PL_curcop = c->curcop;
273		305
274	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	306	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
275	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	307	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
276	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);	308	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
…		…
284	{	316	{
285	AV *padlist = (AV *)POPs;	317	AV *padlist = (AV *)POPs;
286		318
287	if (padlist)	319	if (padlist)
288	{	320	{
289	put_padlist (cv); /* mark this padlist as available */	321	put_padlist (aTHX_ cv); /* mark this padlist as available */
290	CvPADLIST(cv) = padlist;	322	CvPADLIST(cv) = padlist;
291	#ifdef USE_THREADS
292	/*CvOWNER(cv) = (struct perl_thread *)POPs;*/
293	#endif
294	}	323	}
295		324
296	++CvDEPTH(cv);	325	++CvDEPTH(cv);
297	}	326	}
298		327
…		…
316		345
317	PUSHs (Nullsv);	346	PUSHs (Nullsv);
318	/* this loop was inspired by pp_caller */	347	/* this loop was inspired by pp_caller */
319	for (;;)	348	for (;;)
320	{	349	{
321	do	350	while (cxix >= 0)
322	{	351	{
323	PERL_CONTEXT *cx = &ccstk[cxix--];	352	PERL_CONTEXT *cx = &ccstk[cxix--];
324		353
325	if (CxTYPE(cx) == CXt_SUB)	354	if (CxTYPE(cx) == CXt_SUB)
326	{	355	{
327	CV *cv = cx->blk_sub.cv;	356	CV *cv = cx->blk_sub.cv;
328	if (CvDEPTH(cv))	357	if (CvDEPTH(cv))
329	{	358	{
330	#ifdef USE_THREADS
331	/*XPUSHs ((SV *)CvOWNER(cv));*/
332	/*CvOWNER(cv) = 0;*/
333	/*error must unlock this cv etc.. etc...*/
334	#endif
335	EXTEND (SP, CvDEPTH(cv)*2);	359	EXTEND (SP, CvDEPTH(cv)*2);
336		360
337	while (--CvDEPTH(cv))	361	while (--CvDEPTH(cv))
338	{	362	{
339	/* this tells the restore code to increment CvDEPTH */	363	/* this tells the restore code to increment CvDEPTH */
…		…
342	}	366	}
343		367
344	PUSHs ((SV *)CvPADLIST(cv));	368	PUSHs ((SV *)CvPADLIST(cv));
345	PUSHs ((SV *)cv);	369	PUSHs ((SV *)cv);
346		370
347	get_padlist (cv); /* this is a monster */	371	get_padlist (aTHX_ cv);
348	}	372	}
349	}	373	}
		374	#ifdef CXt_FORMAT
350	else if (CxTYPE(cx) == CXt_FORMAT)	375	else if (CxTYPE(cx) == CXt_FORMAT)
351	{	376	{
352	/* 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? */
353	/* my bold guess is as a simple, plain sub... */	378	/* my bold guess is as a simple, plain sub... */
354	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");
355	}	380	}
		381	#endif
356	}	382	}
357	while (cxix >= 0);
358		383
359	if (top_si->si_type == PERLSI_MAIN)	384	if (top_si->si_type == PERLSI_MAIN)
360	break;	385	break;
361		386
362	top_si = top_si->si_prev;	387	top_si = top_si->si_prev;
…		…
369		394
370	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;	395	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
371	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	396	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
372	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;	397	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
373		398
374	/* I have not the slightest idea of why av_reify is necessary */
375	/* but if it's missing the defav contents magically get replaced sometimes */
376	if (c->defav)
377	av_reify (c->defav);
378
379	c->dowarn = PL_dowarn;	399	c->dowarn = PL_dowarn;
		400	c->in_eval = PL_in_eval;
380		401
381	c->curstackinfo = PL_curstackinfo;	402	c->curstackinfo = PL_curstackinfo;
382	c->curstack = PL_curstack;	403	c->curstack = PL_curstack;
383	c->mainstack = PL_mainstack;	404	c->mainstack = PL_mainstack;
384	c->stack_sp = PL_stack_sp;	405	c->stack_sp = PL_stack_sp;
385	c->op = PL_op;	406	c->op = PL_op;
386	c->curpad = PL_curpad;	407	c->curpad = PL_curpad;
		408	c->comppad = PL_comppad;
		409	c->compcv = PL_compcv;
387	c->stack_base = PL_stack_base;	410	c->stack_base = PL_stack_base;
388	c->stack_max = PL_stack_max;	411	c->stack_max = PL_stack_max;
389	c->tmps_stack = PL_tmps_stack;	412	c->tmps_stack = PL_tmps_stack;
390	c->tmps_floor = PL_tmps_floor;	413	c->tmps_floor = PL_tmps_floor;
391	c->tmps_ix = PL_tmps_ix;	414	c->tmps_ix = PL_tmps_ix;
…		…
397	c->scopestack_ix = PL_scopestack_ix;	420	c->scopestack_ix = PL_scopestack_ix;
398	c->scopestack_max = PL_scopestack_max;	421	c->scopestack_max = PL_scopestack_max;
399	c->savestack = PL_savestack;	422	c->savestack = PL_savestack;
400	c->savestack_ix = PL_savestack_ix;	423	c->savestack_ix = PL_savestack_ix;
401	c->savestack_max = PL_savestack_max;	424	c->savestack_max = PL_savestack_max;
		425	#if PERL_VERSION < 9
402	c->retstack = PL_retstack;	426	c->retstack = PL_retstack;
403	c->retstack_ix = PL_retstack_ix;	427	c->retstack_ix = PL_retstack_ix;
404	c->retstack_max = PL_retstack_max;	428	c->retstack_max = PL_retstack_max;
		429	#endif
		430	c->curpm = PL_curpm;
405	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;
406	}	482	}
407		483
408	/*	484	/*
409	* destroy the stacks, the callchain etc...	485	* destroy the stacks, the callchain etc...
410	* still there is a memleak of 128 bytes...
411	*/	486	*/
412	STATIC void	487	static void
413	destroy_stacks(pTHX)	488	destroy_stacks(pTHX)
414	{	489	{
		490	if (!IN_DESTRUCT)
		491	{
415	/* is this ugly, I ask? */	492	/* is this ugly, I ask? */
416	while (PL_scopestack_ix)	493	LEAVE_SCOPE (0);
417	LEAVE;
418		494
419	/* sure it is, but more important: is it correct?? :/ */	495	/* sure it is, but more important: is it correct?? :/ */
420	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
421	FREETMPS;	496	FREETMPS;
		497
		498	/*POPSTACK_TO (PL_mainstack);*//*D*//*use*/
		499	}
422		500
423	while (PL_curstackinfo->si_next)	501	while (PL_curstackinfo->si_next)
424	PL_curstackinfo = PL_curstackinfo->si_next;	502	PL_curstackinfo = PL_curstackinfo->si_next;
425		503
426	while (PL_curstackinfo)	504	while (PL_curstackinfo)
427	{	505	{
428	PERL_SI *p = PL_curstackinfo->si_prev;	506	PERL_SI *p = PL_curstackinfo->si_prev;
429		507
430	{	508	{ /*D*//*remove*/
431	dSP;	509	dSP;
432	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	510	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
433	PUTBACK; /* possibly superfluous */	511	PUTBACK; /* possibly superfluous */
434	}	512	}
435		513
436	dounwind(-1);	514	if (!IN_DESTRUCT)
437		515	{
		516	dounwind (-1);/*D*//*remove*/
438	SvREFCNT_dec(PL_curstackinfo->si_stack);	517	SvREFCNT_dec (PL_curstackinfo->si_stack);
		518	}
		519
439	Safefree(PL_curstackinfo->si_cxstack);	520	Safefree (PL_curstackinfo->si_cxstack);
440	Safefree(PL_curstackinfo);	521	Safefree (PL_curstackinfo);
441	PL_curstackinfo = p;	522	PL_curstackinfo = p;
442	}	523	}
443		524
444	Safefree(PL_tmps_stack);	525	Safefree (PL_tmps_stack);
445	Safefree(PL_markstack);	526	Safefree (PL_markstack);
446	Safefree(PL_scopestack);	527	Safefree (PL_scopestack);
447	Safefree(PL_savestack);	528	Safefree (PL_savestack);
		529	#if PERL_VERSION < 9
448	Safefree(PL_retstack);	530	Safefree (PL_retstack);
		531	#endif
449	}	532	}
450		533
451	STATIC void	534	static void
452	transfer(pTHX_ struct coro *prev, struct coro *next, int flags)	535	setup_coro (struct coro *coro)
453	{	536	{
		537	/*
		538	* emulate part of the perl startup here.
		539	*/
		540	dTHX;
454	dSP;	541	dSP;
		542	UNOP myop;
		543	SV *sub_init = (SV *)get_cv ("Coro::State::coro_init", FALSE);
455		544
456	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)
457	{	572	{
458	/*	573	SvREFCNT_dec (coro_mortal);
459	* this could be done in newprocess which would lead to	574	coro_mortal = 0;
460	* extremely elegant and fast (just SAVE/LOAD)	575	}
461	* code here, but lazy allocation of stacks has also	576	}
462	* some virtues and the overhead of the if() is nil.	577
463	*/	578	static void
		579	coro_run (void *arg)
		580	{
		581	/*
		582	* this is a _very_ stripped down perl interpreter ;)
		583	*/
		584	dTHX;
		585	int ret;
		586
		587	UNLOCK;
		588
		589	PL_top_env = &PL_start_env;
		590
		591	sv_setiv (get_sv ("Coro::State::cctx_stack", FALSE), PTR2IV ((coro_stack *)arg));
		592	sv_setiv (get_sv ("Coro::State::cctx_restartop", FALSE), PTR2IV (PL_op));
		593
		594	/* continue at cctx_init, without entersub */
		595	PL_restartop = CvSTART (get_cv ("Coro::State::cctx_init", FALSE));
		596
		597	/* somebody will hit me for both perl_run and PL_restartop */
		598	ret = perl_run (aTHX_ PERL_GET_CONTEXT);
		599	printf ("ret %d\n", ret);//D
		600
		601	fputs ("FATAL: C coroutine fell over the edge of the world, aborting.\n", stderr);
		602	abort ();
		603	}
		604
		605	static coro_stack *
		606	stack_new ()
		607	{
		608	coro_stack *stack;
		609
		610	New (0, stack, 1, coro_stack);
		611
		612	#if HAVE_MMAP
		613
		614	stack->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;
		615	/* mmap suppsedly does allocate-on-write for us */
		616	stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
		617
		618	if (stack->sptr == (void *)-1)
		619	{
		620	perror ("FATAL: unable to mmap stack for coroutine");
		621	_exit (EXIT_FAILURE);
		622	}
		623
		624	# if STACKGUARD
		625	mprotect (stack->sptr, STACKGUARD * PAGESIZE, PROT_NONE);
		626	# endif
		627
		628	#else
		629
		630	stack->ssize = STACKSIZE * (long)sizeof (long);
		631	New (0, stack->sptr, STACKSIZE, long);
		632
		633	if (!stack->sptr)
		634	{
		635	perror (stderr, "FATAL: unable to malloc stack for coroutine");
		636	_exit (EXIT_FAILURE);
		637	}
		638
		639	#endif
		640
		641	coro_create (&stack->cctx, coro_run, (void *)stack, stack->sptr, stack->ssize);
		642
		643	return stack;
		644	}
		645
		646	static void
		647	stack_free (coro_stack *stack)
		648	{
		649	if (!stack)
		650	return;
		651
		652	#if HAVE_MMAP
		653	munmap (stack->sptr, stack->ssize);
		654	#else
		655	Safefree (stack->sptr);
		656	#endif
		657
		658	Safefree (stack);
		659	}
		660
		661	static coro_stack *stack_first;
		662
		663	static coro_stack *
		664	stack_get ()
		665	{
		666	coro_stack *stack;
		667
		668	if (stack_first)
		669	{
		670	stack = stack_first;
		671	stack_first = stack->next;
		672	}
		673	else
		674	{
		675	stack = stack_new ();
		676	PL_op = PL_op->op_next;
		677	}
		678
		679	return stack;
		680	}
		681
		682	static void
		683	stack_put (coro_stack *stack)
		684	{
		685	stack->next = stack_first;
		686	stack_first = stack;
		687	}
		688
		689	/* never call directly, always through the coro_state_transfer global variable */
		690	static void
		691	transfer_impl (pTHX_ struct coro *prev, struct coro *next, int flags)
		692	{
		693	dSTACKLEVEL;
		694
		695	/* sometimes transfer is only called to set idle_sp */
		696	if (flags == TRANSFER_SET_STACKLEVEL)
		697	((coro_stack *)prev)->idle_sp = STACKLEVEL;
		698	else if (prev != next)
		699	{
		700	coro_stack *prev__stack;
		701
		702	LOCK;
		703
464	if (next->mainstack)	704	if (next->mainstack)
465	{	705	{
		706	/* coroutine already started */
466	SAVE (prev, flags);	707	SAVE (prev, flags);
467	LOAD (next);	708	LOAD (next);
468	/* mark this state as in-use */
469	next->mainstack = 0;
470	next->tmps_ix = -2;
471	}
472	else if (next->tmps_ix == -2)
473	{
474	croak ("tried to transfer to running coroutine");
475	}	709	}
476	else	710	else
477	{	711	{
478	/*	712	/* need to start coroutine */
479	* emulate part of the perl startup here.
480	*/
481	UNOP myop;
482
483	SAVE (prev, -1); /* first get rid of the old state */	713	/* first get rid of the old state */
484		714	SAVE (prev, -1);
485	init_stacks (); /* from perl.c */	715	/* setup coroutine call */
486	SPAGAIN;	716	setup_coro (next);
487		717	/* need a stack */
488	PL_op = (OP *)&myop;	718	next->stack = 0;
489	/*PL_curcop = 0;*/
490	SvREFCNT_dec (GvAV (PL_defgv));
491	GvAV (PL_defgv) = next->args;
492
493	Zero(&myop, 1, UNOP);
494	myop.op_next = Nullop;
495	myop.op_flags = OPf_WANT_VOID;
496
497	PUSHMARK(SP);
498	XPUSHs ((SV*)get_cv(SUB_INIT, TRUE));
499	/*
500	* the next line is slightly wrong, as PL_op->op_next
501	* is actually being executed so we skip the first op.
502	* that doesn't matter, though, since it is only
503	* pp_nextstate and we never return...
504	* ah yes, and I don't care anyways ;)
505	*/
506	PUTBACK;
507	PL_op = pp_entersub(aTHX);
508	SPAGAIN;
509
510	ENTER; /* necessary e.g. for dounwind */
511	}	719	}
		720
		721	if (!prev->stack)
		722	/* create a new empty context */
		723	Newz (0, prev->stack, 1, coro_stack);
		724
		725	prev__stack = prev->stack;
		726
		727	/* possibly "free" the stack */
		728	if (prev__stack->idle_sp == STACKLEVEL)
		729	{
		730	stack_put (prev__stack);
		731	prev->stack = 0;
		732	}
		733
		734	if (!next->stack)
		735	next->stack = stack_get ();
		736
		737	if (prev__stack != next->stack)
		738	{
		739	prev__stack->top_env = PL_top_env;
		740	PL_top_env = next->stack->top_env;
		741	coro_transfer (&prev__stack->cctx, &next->stack->cctx);
		742	}
		743
		744	free_coro_mortal ();
		745
		746	UNLOCK;
512	}	747	}
513	}	748	}
514		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
515	MODULE = Coro::State PACKAGE = Coro::State	990	MODULE = Coro::State PACKAGE = Coro::State
516		991
517	PROTOTYPES: ENABLE	992	PROTOTYPES: DISABLE
518		993
519	BOOT:	994	BOOT:
520	{ /* {} necessary for stoopid perl-5.6.x */	995	{
		996	#ifdef USE_ITHREADS
		997	MUTEX_INIT (&coro_mutex);
		998	#endif
		999	BOOT_PAGESIZE;
		1000
521	HV * stash = gv_stashpvn("Coro::State", 10, TRUE);	1001	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
522		1002
523	newCONSTSUB (stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	1003	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
524	newCONSTSUB (stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	1004	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
525	newCONSTSUB (stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));	1005	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
526
527	if (!padlist_cache)
528	padlist_cache = newHV ();
529		1006
530	main_mainstack = PL_mainstack;	1007	main_mainstack = PL_mainstack;
531	}
532		1008
533	Coro::State	1009	coroapi.ver = CORO_API_VERSION;
534	_newprocess(args)	1010	coroapi.transfer = api_transfer;
535	SV * args	1011
536	PROTOTYPE: $	1012	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
		1013	}
		1014
		1015	SV *
		1016	new (char *klass, ...)
537	CODE:	1017	CODE:
538	Coro__State coro;	1018	{
		1019	struct coro *coro;
		1020	HV *hv;
		1021	int i;
539		1022
540	if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
541	croak ("Coro::State::_newprocess expects an arrayref");
542
543	New (0, coro, 1, struct coro);	1023	Newz (0, coro, 1, struct coro);
		1024	coro->args = newAV ();
544		1025
		1026	hv = newHV ();
		1027	sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
		1028	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
		1029
		1030	for (i = 1; i < items; i++)
		1031	av_push (coro->args, newSVsv (ST (i)));
		1032
545	coro->mainstack = 0; /* actual work is done inside transfer */	1033	/*coro->mainstack = 0; *//*actual work is done inside transfer */
546	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	1034	/*coro->stack = 0;*/
547		1035	}
548	RETVAL = coro;
549	OUTPUT:	1036	OUTPUT:
550	RETVAL	1037	RETVAL
551		1038
552	void	1039	void
553	transfer(prev, next, flags = TRANSFER_SAVE_ALL)	1040	_set_stacklevel (...)
554	Coro::State_or_hashref prev	1041	ALIAS:
555	Coro::State_or_hashref next	1042	Coro::State::transfer = 1
556	int flags	1043	Coro::schedule = 2
557	PROTOTYPE: @	1044	Coro::cede = 3
		1045	Coro::Cont::yield = 4
558	CODE:	1046	CODE:
		1047	{
		1048	struct transfer_args ta;
559		1049
560	transfer (aTHX_ prev, next, flags);	1050	switch (ix)
		1051	{
		1052	case 0:
		1053	ta.prev = (struct coro *)INT2PTR (coro_stack *, SvIV (ST (0)));
		1054	ta.next = 0;
		1055	ta.flags = TRANSFER_SET_STACKLEVEL;
		1056	break;
		1057
		1058	case 1:
		1059	if (items != 3)
		1060	croak ("Coro::State::transfer(prev,next,flags) expects three arguments, not %d", items);
		1061
		1062	prepare_transfer (&ta, ST (0), ST (1), SvIV (ST (2)));
		1063	break;
		1064
		1065	case 2:
		1066	prepare_schedule (&ta);
		1067	break;
		1068
		1069	case 3:
		1070	prepare_cede (&ta);
		1071	break;
		1072
		1073	case 4:
		1074	{
		1075	SV *yieldstack;
		1076	SV *sv;
		1077	AV *defav = GvAV (PL_defgv);
		1078
		1079	yieldstack = *hv_fetch (
		1080	(HV *)SvRV (GvSV (coro_current)),
		1081	"yieldstack", sizeof ("yieldstack") - 1,
		1082	0
		1083	);
		1084
		1085	/* set up @_ -- ugly */
		1086	av_clear (defav);
		1087	av_fill (defav, items - 1);
		1088	while (items--)
		1089	av_store (defav, items, SvREFCNT_inc (ST(items)));
		1090
		1091	sv = av_pop ((AV *)SvRV (yieldstack));
		1092	ta.prev = SvSTATE (*av_fetch ((AV *)SvRV (sv), 0, 0));
		1093	ta.next = SvSTATE (*av_fetch ((AV *)SvRV (sv), 1, 0));
		1094	ta.flags = 0;
		1095	SvREFCNT_dec (sv);
		1096	}
		1097	break;
		1098
		1099	}
		1100
		1101	TRANSFER (ta);
		1102	}
561		1103
562	void	1104	void
563	DESTROY(coro)	1105	_clone_state_from (SV *dst, SV *src)
564	Coro::State coro	1106	CODE:
		1107	{
		1108	struct coro *coro_src = SvSTATE (src);
		1109
		1110	sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
		1111
		1112	++coro_src->refcnt;
		1113	sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags |= MGf_DUP;
		1114	}
		1115
		1116	void
		1117	_nonlocal_goto (IV nextop)
		1118	CODE:
		1119	/* uuh, somebody will kill me again for this */
		1120	PL_op->op_next = INT2PTR (OP *, nextop);
		1121
		1122	void
		1123	_exit (code)
		1124	int code
		1125	PROTOTYPE: $
		1126	CODE:
		1127	_exit (code);
		1128
		1129	MODULE = Coro::State PACKAGE = Coro
		1130
		1131	BOOT:
		1132	{
		1133	int i;
		1134
		1135	coro_stash = gv_stashpv ("Coro", TRUE);
		1136
		1137	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
		1138	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
		1139	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
		1140	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
		1141	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
		1142	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
		1143
		1144	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
		1145	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
		1146
		1147	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
		1148	coro_ready[i] = newAV ();
		1149
		1150	{
		1151	SV *sv = perl_get_sv("Coro::API", 1);
		1152
		1153	coroapi.schedule = api_schedule;
		1154	coroapi.cede = api_cede;
		1155	coroapi.ready = api_ready;
		1156	coroapi.nready = &coro_nready;
		1157	coroapi.current = coro_current;
		1158
		1159	GCoroAPI = &coroapi;
		1160	sv_setiv (sv, (IV)&coroapi);
		1161	SvREADONLY_on (sv);
		1162	}
		1163	}
		1164
		1165	int
		1166	prio (Coro::State coro, int newprio = 0)
		1167	ALIAS:
		1168	nice = 1
565	CODE:	1169	CODE:
		1170	{
		1171	RETVAL = coro->prio;
566		1172
567	if (coro->mainstack && coro->mainstack != main_mainstack)	1173	if (items > 1)
568	{	1174	{
569	struct coro temp;	1175	if (ix)
		1176	newprio += coro->prio;
570		1177
571	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);	1178	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
572	LOAD(aTHX_ coro);	1179	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
573		1180
574	destroy_stacks ();	1181	coro->prio = newprio;
575
576	LOAD((&temp)); /* this will get rid of defsv etc.. */
577	}	1182	}
		1183	}
578		1184
579	Safefree (coro);
580
581	/*
582	* there is one problematic case left (remember _recurse?)
583	* consider the case when we
584	*
585	* 1. start a coroutine
586	* 2. inside it descend into some xs functions
587	* 3. xs function calls a callback
588	* 4. callback switches to $main
589	* 5. $main ends - we will end inside the xs function
590	* 6. xs function returns and perl executes - what?
591	*
592	* to avoid this case we recurse in this function
593	* and simply call my_exit(0), skipping other xs functions
594	*/
595
596	#if 0
597	void	1185	void
598	_recurse()	1186	ready (SV *self)
		1187	PROTOTYPE: $
599	CODE:	1188	CODE:
600	LEAVE;	1189	api_ready (self);
601	PL_stack_sp = PL_stack_base + ax - 1;
602	PL_op = PL_op->op_next;
603	CALLRUNOPS(aTHX);
604	printf ("my_exit\n");
605	my_exit (0);
606		1190
607	#endif	1191	int
		1192	nready (...)
		1193	PROTOTYPE:
		1194	CODE:
		1195	RETVAL = coro_nready;
		1196	OUTPUT:
		1197	RETVAL
		1198
		1199	MODULE = Coro::State PACKAGE = Coro::AIO
		1200
		1201	SV *
		1202	_get_state ()
		1203	CODE:
		1204	{
		1205	struct {
		1206	int errorno;
		1207	int laststype;
		1208	int laststatval;
		1209	Stat_t statcache;
		1210	} data;
		1211
		1212	data.errorno = errno;
		1213	data.laststype = PL_laststype;
		1214	data.laststatval = PL_laststatval;
		1215	data.statcache = PL_statcache;
		1216
		1217	RETVAL = newSVpvn ((char *)&data, sizeof data);
		1218	}
		1219	OUTPUT:
		1220	RETVAL
608		1221
609	void	1222	void
610	flush()	1223	_set_state (char *data_)
		1224	PROTOTYPE: $
611	CODE:	1225	CODE:
612	#ifdef MAY_FLUSH	1226	{
613	flush_padlist_cache ();	1227	struct {
614	#endif	1228	int errorno;
		1229	int laststype;
		1230	int laststatval;
		1231	Stat_t statcache;
		1232	} *data = (void *)data_;
615		1233
616	MODULE = Coro::State PACKAGE = Coro::Cont	1234	errno = data->errorno;
617		1235	PL_laststype = data->laststype;
618	# this is dirty (do you hear me?) and should be in it's own .xs	1236	PL_laststatval = data->laststatval;
619		1237	PL_statcache = data->statcache;
620	void	1238	}
621	result(...)
622	PROTOTYPE: @
623	CODE:
624	static SV *returnstk;
625	SV *sv;
626	AV *defav = GvAV (PL_defgv);
627	struct coro *prev, *next;
628
629	if (!returnstk)
630	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
631
632	/* set up @_ -- ugly */
633	av_clear (defav);
634	av_fill (defav, items - 1);
635	while (items--)
636	av_store (defav, items, SvREFCNT_inc (ST(items)));
637
638	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
639	sv = av_pop ((AV *)SvRV (returnstk));
640	prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
641	next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
642	SvREFCNT_dec (sv);
643	transfer(prev, next, 0);
644

Diff Legend

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