ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.25 by root, Wed Aug 15 03:24:07 2001 UTC vs.
Revision 1.157 by root, Fri Sep 21 02:01:13 2007 UTC

		1	#include "libcoro/coro.c"
		2
		3	#define PERL_NO_GET_CONTEXT
		4
1	#include "EXTERN.h"	5	#include "EXTERN.h"
2	#include "perl.h"	6	#include "perl.h"
3	#include "XSUB.h"	7	#include "XSUB.h"
4		8
5	#include "libcoro/coro.c"	9	#include "patchlevel.h"
6		10
7	#include <signal.h>	11	#include <stdio.h>
		12	#include <errno.h>
		13	#include <assert.h>
8		14
9	#ifdef HAVE_MMAP	15	#ifdef HAVE_MMAP
10	# include <unistd.h>	16	# include <unistd.h>
11	# include <sys/mman.h>	17	# include <sys/mman.h>
12	# ifndef MAP_ANON
13	# ifdef MAP_ANONYMOUS	18	# ifndef MAP_ANONYMOUS
14	# define MAP_ANON MAP_ANONYMOUS	19	# ifdef MAP_ANON
		20	# define MAP_ANONYMOUS MAP_ANON
15	# else	21	# else
16	# undef HAVE_MMAP	22	# undef HAVE_MMAP
17	# endif	23	# endif
18	# endif	24	# endif
		25	# include <limits.h>
		26	# ifndef PAGESIZE
		27	# define PAGESIZE pagesize
		28	# define BOOT_PAGESIZE pagesize = sysconf (_SC_PAGESIZE)
		29	static long pagesize;
		30	# else
		31	# define BOOT_PAGESIZE (void)0
19	#endif	32	# endif
		33	#else
		34	# define PAGESIZE 0
		35	# define BOOT_PAGESIZE (void)0
		36	#endif
20		37
21	#define MAY_FLUSH /* increases codesize */	38	#if CORO_USE_VALGRIND
		39	# include <valgrind/valgrind.h>
		40	# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
		41	#else
		42	# define REGISTER_STACK(cctx,start,end)
		43	#endif
22		44
23	#define SUB_INIT "Coro::State::initialize"	45	/* the maximum number of idle cctx that will be pooled */
24	#define UCORO_STATE "_coro_state"	46	#define MAX_IDLE_CCTX 8
25		47
		48	#define PERL_VERSION_ATLEAST(a,b,c) \
		49	(PERL_REVISION > (a) \
		50	|| (PERL_REVISION == (a) \
		51	&& (PERL_VERSION > (b) \
		52	|| (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
		53
		54	#if !PERL_VERSION_ATLEAST (5,6,0)
		55	# ifndef PL_ppaddr
		56	# define PL_ppaddr ppaddr
		57	# endif
		58	# ifndef call_sv
		59	# define call_sv perl_call_sv
		60	# endif
		61	# ifndef get_sv
		62	# define get_sv perl_get_sv
		63	# endif
		64	# ifndef get_cv
		65	# define get_cv perl_get_cv
		66	# endif
		67	# ifndef IS_PADGV
		68	# define IS_PADGV(v) 0
		69	# endif
		70	# ifndef IS_PADCONST
		71	# define IS_PADCONST(v) 0
		72	# endif
		73	#endif
		74
		75	/* 5.8.7 */
		76	#ifndef SvRV_set
		77	# define SvRV_set(s,v) SvRV(s) = (v)
		78	#endif
		79
		80	#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
		81	# undef CORO_STACKGUARD
		82	#endif
		83
		84	#ifndef CORO_STACKGUARD
		85	# define CORO_STACKGUARD 0
		86	#endif
		87
		88	/* prefer perl internal functions over our own? */
		89	#ifndef CORO_PREFER_PERL_FUNCTIONS
		90	# define CORO_PREFER_PERL_FUNCTIONS 0
		91	#endif
		92
26	/* The next macro should delcare a variable stacklevel that contains and approximation	93	/* The next macro should declare a variable stacklevel that contains and approximation
27	* to the current C stack pointer. Its property is that it changes with each call	94	* to the current C stack pointer. Its property is that it changes with each call
28	* and should be unique. */	95	* and should be unique. */
		96	#define dSTACKLEVEL int stacklevel
29	#define dSTACKLEVEL void *stacklevel = &stacklevel	97	#define STACKLEVEL ((void *)&stacklevel)
30		98
31	#define labs(l) ((l) >= 0 ? (l) : -(l))	99	#define IN_DESTRUCT (PL_main_cv == Nullcv)
		100
		101	#if __GNUC__ >= 3
		102	# define attribute(x) __attribute__(x)
		103	# define BARRIER __asm__ __volatile__ ("" : : : "memory")
		104	#else
		105	# define attribute(x)
		106	# define BARRIER
		107	#endif
		108
		109	#define NOINLINE attribute ((noinline))
32		110
33	#include "CoroAPI.h"	111	#include "CoroAPI.h"
34		112
		113	#ifdef USE_ITHREADS
		114	static perl_mutex coro_mutex;
		115	# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
		116	# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
		117	#else
		118	# define LOCK (void)0
		119	# define UNLOCK (void)0
		120	#endif
		121
		122	/* helper storage struct for Coro::AIO */
		123	struct io_state
		124	{
		125	int errorno;
		126	I32 laststype;
		127	int laststatval;
		128	Stat_t statcache;
		129	};
		130
		131	static size_t coro_stacksize = CORO_STACKSIZE;
35	static struct CoroAPI coroapi;	132	static struct CoroAPI coroapi;
		133	static AV *main_mainstack; /* used to differentiate between $main and others */
		134	static JMPENV *main_top_env;
		135	static HV *coro_state_stash, *coro_stash;
		136	static SV *coro_mortal; /* will be freed after next transfer */
36		137
37	/* this is actually not only the c stack but also c registers etc... */	138	static struct coro_cctx *cctx_first;
		139	static int cctx_count, cctx_idle;
		140
		141	/* this is a structure representing a c-level coroutine */
38	typedef struct {	142	typedef struct coro_cctx {
39	int refcnt; /* pointer reference counter */	143	struct coro_cctx *next;
40	int usecnt; /* shared by how many coroutines */
41	int gencnt; /* generation counter */
42		144
		145	/* the stack */
		146	void *sptr;
		147	size_t ssize;
		148
		149	/* cpu state */
		150	void *idle_sp; /* sp of top-level transfer/schedule/cede call */
		151	JMPENV *idle_te; /* same as idle_sp, but for top_env, TODO: remove once stable */
		152	JMPENV *top_env;
43	coro_context cctx;	153	coro_context cctx;
44		154
45	void *sptr;	155	#if CORO_USE_VALGRIND
46	long ssize; /* positive == mmap, otherwise malloc */	156	int valgrind_id;
47	} coro_stack;	157	#endif
		158	char inuse, mapped;
		159	} coro_cctx;
48		160
		161	enum {
		162	CF_RUNNING = 0x0001, /* coroutine is running */
		163	CF_READY = 0x0002, /* coroutine is ready */
		164	CF_NEW = 0x0004, /* has never been switched to */
		165	CF_DESTROYED = 0x0008, /* coroutine data has been freed */
		166	};
		167
		168	/* this is a structure representing a perl-level coroutine */
49	struct coro {	169	struct coro {
50	/* the optional C context */	170	/* the c coroutine allocated to this perl coroutine, if any */
51	coro_stack *stack;	171	coro_cctx *cctx;
52	void *cursp;
53	int gencnt;
54
55	/* optionally saved, might be zero */
56	AV *defav;
57	SV *defsv;
58	SV *errsv;
59
60	/* saved global state not related to stacks */
61	U8 dowarn;
62	I32 in_eval;
63
64	/* the stacks and related info (callchain etc..) */
65	PERL_SI *curstackinfo;
66	AV *curstack;
67	AV *mainstack;
68	SV **stack_sp;
69	OP *op;
70	SV **curpad;
71	SV **stack_base;
72	SV **stack_max;
73	SV **tmps_stack;
74	I32 tmps_floor;
75	I32 tmps_ix;
76	I32 tmps_max;
77	I32 *markstack;
78	I32 *markstack_ptr;
79	I32 *markstack_max;
80	I32 *scopestack;
81	I32 scopestack_ix;
82	I32 scopestack_max;
83	ANY *savestack;
84	I32 savestack_ix;
85	I32 savestack_max;
86	OP **retstack;
87	I32 retstack_ix;
88	I32 retstack_max;
89	COP *curcop;
90	JMPENV *top_env;
91		172
92	/* data associated with this coroutine (initial args) */	173	/* data associated with this coroutine (initial args) */
93	AV *args;	174	AV *args;
		175	int refcnt;
		176	int save; /* CORO_SAVE flags */
		177	int flags; /* CF_ flags */
		178
		179	/* optionally saved, might be zero */
		180	AV *defav; /* @_ */
		181	SV *defsv; /* $_ */
		182	SV *errsv; /* $@ */
		183	GV *deffh; /* default filehandle */
		184	SV *irssv; /* $/ */
		185	SV *irssv_sv; /* real $/ cache */
		186
		187	#define VAR(name,type) type name;
		188	# include "state.h"
		189	#undef VAR
		190
		191	/* coro process data */
		192	int prio;
		193
		194	/* linked list */
		195	struct coro *next, *prev;
		196	HV *hv; /* the perl hash associated with this coro, if any */
94	};	197	};
95		198
96	typedef struct coro *Coro__State;	199	typedef struct coro *Coro__State;
97	typedef struct coro *Coro__State_or_hashref;	200	typedef struct coro *Coro__State_or_hashref;
98
99	static AV *main_mainstack; /* used to differentiate between $main and others */
100	static HV *coro_state_stash;
101	static SV *ucoro_state_sv;
102	static U32 ucoro_state_hash;
103	static HV *padlist_cache;
104
105	/* mostly copied from op.c:cv_clone2 */
106	STATIC AV *
107	clone_padlist (AV *protopadlist)
108	{
109	AV *av;
110	I32 ix;
111	AV *protopad_name = (AV *) * av_fetch (protopadlist, 0, FALSE);
112	AV *protopad = (AV *) * av_fetch (protopadlist, 1, FALSE);
113	SV **pname = AvARRAY (protopad_name);
114	SV **ppad = AvARRAY (protopad);
115	I32 fname = AvFILLp (protopad_name);
116	I32 fpad = AvFILLp (protopad);
117	AV *newpadlist, *newpad_name, *newpad;
118	SV **npad;
119
120	newpad_name = newAV ();
121	for (ix = fname; ix >= 0; ix--)
122	av_store (newpad_name, ix, SvREFCNT_inc (pname[ix]));
123
124	newpad = newAV ();
125	av_fill (newpad, AvFILLp (protopad));
126	npad = AvARRAY (newpad);
127
128	newpadlist = newAV ();
129	AvREAL_off (newpadlist);
130	av_store (newpadlist, 0, (SV *) newpad_name);
131	av_store (newpadlist, 1, (SV *) newpad);
132
133	av = newAV (); /* will be @_ */
134	av_extend (av, 0);
135	av_store (newpad, 0, (SV *) av);
136	AvFLAGS (av) = AVf_REIFY;
137
138	for (ix = fpad; ix > 0; ix--)
139	{
140	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
141	if (namesv && namesv != &PL_sv_undef)
142	{
143	char *name = SvPVX (namesv); /* XXX */
144	if (SvFLAGS (namesv) & SVf_FAKE || *name == '&')
145	{ /* lexical from outside? */
146	npad[ix] = SvREFCNT_inc (ppad[ix]);
147	}
148	else
149	{ /* our own lexical */
150	SV *sv;
151	if (*name == '&')
152	sv = SvREFCNT_inc (ppad[ix]);
153	else if (*name == '@')
154	sv = (SV *) newAV ();
155	else if (*name == '%')
156	sv = (SV *) newHV ();
157	else
158	sv = NEWSV (0, 0);
159	if (!SvPADBUSY (sv))
160	SvPADMY_on (sv);
161	npad[ix] = sv;
162	}
163	}
164	else if (IS_PADGV (ppad[ix]) || IS_PADCONST (ppad[ix]))
165	{
166	npad[ix] = SvREFCNT_inc (ppad[ix]);
167	}
168	else
169	{
170	SV *sv = NEWSV (0, 0);
171	SvPADTMP_on (sv);
172	npad[ix] = sv;
173	}
174	}
175
176	#if 0 /* return -ENOTUNDERSTOOD */
177	/* Now that vars are all in place, clone nested closures. */
178
179	for (ix = fpad; ix > 0; ix--) {
180	SV* namesv = (ix <= fname) ? pname[ix] : Nullsv;
181	if (namesv
182	&& namesv != &PL_sv_undef
183	&& !(SvFLAGS(namesv) & SVf_FAKE)
184	&& *SvPVX(namesv) == '&'
185	&& CvCLONE(ppad[ix]))
186	{
187	CV *kid = cv_clone((CV*)ppad[ix]);
188	SvREFCNT_dec(ppad[ix]);
189	CvCLONE_on(kid);
190	SvPADMY_on(kid);
191	npad[ix] = (SV*)kid;
192	}
193	}
194	#endif
195
196	return newpadlist;
197	}
198
199	#ifdef MAY_FLUSH
200	STATIC AV *
201	free_padlist (AV *padlist)
202	{
203	/* may be during global destruction */
204	if (SvREFCNT(padlist))
205	{
206	I32 i = AvFILLp(padlist);
207	while (i >= 0)
208	{
209	SV **svp = av_fetch(padlist, i--, FALSE);
210	SV *sv = svp ? *svp : Nullsv;
211	if (sv)
212	SvREFCNT_dec(sv);
213	}
214
215	SvREFCNT_dec((SV*)padlist);
216	}
217	}
218	#endif
219
220	/* the next two functions merely cache the padlists */
221	STATIC void
222	get_padlist (CV *cv)
223	{
224	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 0);
225
226	if (he && AvFILLp ((AV *)*he) >= 0)
227	CvPADLIST (cv) = (AV *)av_pop ((AV *)*he);
228	else
229	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
230	}
231
232	STATIC void
233	put_padlist (CV *cv)
234	{
235	SV **he = hv_fetch (padlist_cache, (void *)&cv, sizeof (CV *), 1);
236
237	if (SvTYPE (*he) != SVt_PVAV)
238	{
239	SvREFCNT_dec (*he);
240	*he = (SV *)newAV ();
241	}
242
243	av_push ((AV *)*he, (SV *)CvPADLIST (cv));
244	}
245
246	#ifdef MAY_FLUSH
247	STATIC void
248	flush_padlist_cache ()
249	{
250	HV *hv = padlist_cache;
251	padlist_cache = newHV ();
252
253	if (hv_iterinit (hv))
254	{
255	HE *he;
256	AV *padlist;
257
258	while (!!(he = hv_iternext (hv)))
259	{
260	AV *av = (AV *)HeVAL(he);
261
262	/* casting is fun. */
263	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
264	free_padlist (padlist);
265	}
266	}
267
268	SvREFCNT_dec (hv);
269	}
270	#endif
271
272	#define SB do {
273	#define SE } while (0)
274
275	#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE
276	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
277
278	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE
279
280	static void
281	load_state(pTHX_ Coro__State c)
282	{
283	PL_dowarn = c->dowarn;
284	PL_in_eval = c->in_eval;
285
286	PL_curstackinfo = c->curstackinfo;
287	PL_curstack = c->curstack;
288	PL_mainstack = c->mainstack;
289	PL_stack_sp = c->stack_sp;
290	PL_op = c->op;
291	PL_curpad = c->curpad;
292	PL_stack_base = c->stack_base;
293	PL_stack_max = c->stack_max;
294	PL_tmps_stack = c->tmps_stack;
295	PL_tmps_floor = c->tmps_floor;
296	PL_tmps_ix = c->tmps_ix;
297	PL_tmps_max = c->tmps_max;
298	PL_markstack = c->markstack;
299	PL_markstack_ptr = c->markstack_ptr;
300	PL_markstack_max = c->markstack_max;
301	PL_scopestack = c->scopestack;
302	PL_scopestack_ix = c->scopestack_ix;
303	PL_scopestack_max = c->scopestack_max;
304	PL_savestack = c->savestack;
305	PL_savestack_ix = c->savestack_ix;
306	PL_savestack_max = c->savestack_max;
307	PL_retstack = c->retstack;
308	PL_retstack_ix = c->retstack_ix;
309	PL_retstack_max = c->retstack_max;
310	PL_curcop = c->curcop;
311	PL_top_env = c->top_env;
312
313	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
314	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
315	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
316
317	{
318	dSP;
319	CV *cv;
320
321	/* now do the ugly restore mess */
322	while ((cv = (CV *)POPs))
323	{
324	AV *padlist = (AV *)POPs;
325
326	if (padlist)
327	{
328	put_padlist (cv); /* mark this padlist as available */
329	CvPADLIST(cv) = padlist;
330	#ifdef USE_THREADS
331	/*CvOWNER(cv) = (struct perl_thread *)POPs;*/
332	#endif
333	}
334
335	++CvDEPTH(cv);
336	}
337
338	PUTBACK;
339	}
340	}
341
342	static void
343	save_state(pTHX_ Coro__State c, int flags)
344	{
345	{
346	dSP;
347	I32 cxix = cxstack_ix;
348	PERL_CONTEXT *ccstk = cxstack;
349	PERL_SI *top_si = PL_curstackinfo;
350
351	/*
352	* the worst thing you can imagine happens first - we have to save
353	* (and reinitialize) all cv's in the whole callchain :(
354	*/
355
356	PUSHs (Nullsv);
357	/* this loop was inspired by pp_caller */
358	for (;;)
359	{
360	do
361	{
362	PERL_CONTEXT *cx = &ccstk[cxix--];
363
364	if (CxTYPE(cx) == CXt_SUB)
365	{
366	CV *cv = cx->blk_sub.cv;
367	if (CvDEPTH(cv))
368	{
369	#ifdef USE_THREADS
370	/*XPUSHs ((SV *)CvOWNER(cv));*/
371	/*CvOWNER(cv) = 0;*/
372	/*error must unlock this cv etc.. etc...*/
373	#endif
374	EXTEND (SP, CvDEPTH(cv)*2);
375
376	while (--CvDEPTH(cv))
377	{
378	/* this tells the restore code to increment CvDEPTH */
379	PUSHs (Nullsv);
380	PUSHs ((SV *)cv);
381	}
382
383	PUSHs ((SV *)CvPADLIST(cv));
384	PUSHs ((SV *)cv);
385
386	get_padlist (cv); /* this is a monster */
387	}
388	}
389	else if (CxTYPE(cx) == CXt_FORMAT)
390	{
391	/* I never used formats, so how should I know how these are implemented? */
392	/* my bold guess is as a simple, plain sub... */
393	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
394	}
395	}
396	while (cxix >= 0);
397
398	if (top_si->si_type == PERLSI_MAIN)
399	break;
400
401	top_si = top_si->si_prev;
402	ccstk = top_si->si_cxstack;
403	cxix = top_si->si_cxix;
404	}
405
406	PUTBACK;
407	}
408
409	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
410	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
411	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
412
413	/* I have not the slightest idea of why av_reify is necessary */
414	/* but if it's missing the defav contents magically get replaced sometimes */
415	if (c->defav)
416	av_reify (c->defav);
417
418	c->dowarn = PL_dowarn;
419	c->in_eval = PL_in_eval;
420
421	c->curstackinfo = PL_curstackinfo;
422	c->curstack = PL_curstack;
423	c->mainstack = PL_mainstack;
424	c->stack_sp = PL_stack_sp;
425	c->op = PL_op;
426	c->curpad = PL_curpad;
427	c->stack_base = PL_stack_base;
428	c->stack_max = PL_stack_max;
429	c->tmps_stack = PL_tmps_stack;
430	c->tmps_floor = PL_tmps_floor;
431	c->tmps_ix = PL_tmps_ix;
432	c->tmps_max = PL_tmps_max;
433	c->markstack = PL_markstack;
434	c->markstack_ptr = PL_markstack_ptr;
435	c->markstack_max = PL_markstack_max;
436	c->scopestack = PL_scopestack;
437	c->scopestack_ix = PL_scopestack_ix;
438	c->scopestack_max = PL_scopestack_max;
439	c->savestack = PL_savestack;
440	c->savestack_ix = PL_savestack_ix;
441	c->savestack_max = PL_savestack_max;
442	c->retstack = PL_retstack;
443	c->retstack_ix = PL_retstack_ix;
444	c->retstack_max = PL_retstack_max;
445	c->curcop = PL_curcop;
446	c->top_env = PL_top_env;
447	}
448
449	/*
450	* allocate various perl stacks. This is an exact copy
451	* of perl.c:init_stacks, except that it uses less memory
452	* on the assumption that coroutines do not usually need
453	* a lot of stackspace.
454	*/
455	STATIC void
456	coro_init_stacks (pTHX)
457	{
458	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
459	PL_curstackinfo->si_type = PERLSI_MAIN;
460	PL_curstack = PL_curstackinfo->si_stack;
461	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
462
463	PL_stack_base = AvARRAY(PL_curstack);
464	PL_stack_sp = PL_stack_base;
465	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
466
467	New(50,PL_tmps_stack,96,SV*);
468	PL_tmps_floor = -1;
469	PL_tmps_ix = -1;
470	PL_tmps_max = 96;
471
472	New(54,PL_markstack,16,I32);
473	PL_markstack_ptr = PL_markstack;
474	PL_markstack_max = PL_markstack + 16;
475
476	SET_MARK_OFFSET;
477
478	New(54,PL_scopestack,16,I32);
479	PL_scopestack_ix = 0;
480	PL_scopestack_max = 16;
481
482	New(54,PL_savestack,96,ANY);
483	PL_savestack_ix = 0;
484	PL_savestack_max = 96;
485
486	New(54,PL_retstack,8,OP*);
487	PL_retstack_ix = 0;
488	PL_retstack_max = 8;
489	}
490
491	/*
492	* destroy the stacks, the callchain etc...
493	* still there is a memleak of 128 bytes...
494	*/
495	STATIC void
496	destroy_stacks(pTHX)
497	{
498	/* is this ugly, I ask? */
499	while (PL_scopestack_ix)
500	LEAVE;
501
502	/* sure it is, but more important: is it correct?? :/ */
503	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
504	FREETMPS;
505
506	while (PL_curstackinfo->si_next)
507	PL_curstackinfo = PL_curstackinfo->si_next;
508
509	while (PL_curstackinfo)
510	{
511	PERL_SI *p = PL_curstackinfo->si_prev;
512
513	{
514	dSP;
515	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
516	PUTBACK; /* possibly superfluous */
517	}
518
519	if (PL_main_cv != Nullcv) /* don't during destruction. hack? */
520	dounwind(-1);
521
522	SvREFCNT_dec(PL_curstackinfo->si_stack);
523	Safefree(PL_curstackinfo->si_cxstack);
524	Safefree(PL_curstackinfo);
525	PL_curstackinfo = p;
526	}
527
528	Safefree(PL_tmps_stack);
529	Safefree(PL_markstack);
530	Safefree(PL_scopestack);
531	Safefree(PL_savestack);
532	Safefree(PL_retstack);
533	}
534
535	static void
536	allocate_stack (Coro__State ctx, int alloc)
537	{
538	coro_stack *stack;
539
540	New (0, stack, 1, coro_stack);
541
542	stack->refcnt = 1;
543	stack->usecnt = 1;
544	stack->gencnt = ctx->gencnt = 0;
545	if (alloc)
546	{
547	#ifdef HAVE_MMAP
548	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
549	stack->sptr = mmap (0, stack->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANON, 0, 0);
550	if (stack->sptr == (void *)-1)
551	#endif
552	{
553	/*FIXME*//*D*//* reasonable stack size! */
554	stack->ssize = -4096 * sizeof (long);
555	New (0, stack->sptr, 4096, long);
556	}
557	}
558	else
559	stack->sptr = 0;
560
561	ctx->stack = stack;
562	}
563
564	static void
565	deallocate_stack (Coro__State ctx)
566	{
567	coro_stack *stack = ctx->stack;
568
569	ctx->stack = 0;
570
571	if (stack)
572	{
573	if (!--stack->refcnt)
574	{
575	#ifdef HAVE_MMAP
576	if (stack->ssize > 0 && stack->sptr)
577	munmap (stack->sptr, stack->ssize);
578	else
579	#else
580	Safefree (stack->sptr);
581	#endif
582	Safefree (stack);
583	}
584	else if (ctx->gencnt == stack->gencnt)
585	--stack->usecnt;
586	}
587	}
588
589	static void
590	setup_coro (void *arg)
591	{
592	/*
593	* emulate part of the perl startup here.
594	*/
595	dSP;
596	Coro__State ctx = (Coro__State)arg;
597	SV *sub_init = (SV*)get_cv(SUB_INIT, FALSE);
598
599	coro_init_stacks (aTHX);
600	/*PL_curcop = 0;*/
601	/*PL_in_eval = PL_in_eval;*/ /* inherit */
602	SvREFCNT_dec (GvAV (PL_defgv));
603	GvAV (PL_defgv) = ctx->args;
604
605	SPAGAIN;
606
607	if (ctx->stack)
608	{
609	ctx->cursp = 0;
610
611	PUSHMARK(SP);
612	PUTBACK;
613	(void) call_sv (sub_init, G_VOID|G_NOARGS|G_EVAL);
614
615	if (SvTRUE (ERRSV))
616	croak (NULL);
617	else
618	croak ("FATAL: CCTXT coroutine returned!");
619	}
620	else
621	{
622	UNOP myop;
623
624	PL_op = (OP *)&myop;
625
626	Zero(&myop, 1, UNOP);
627	myop.op_next = Nullop;
628	myop.op_flags = OPf_WANT_VOID;
629
630	PUSHMARK(SP);
631	XPUSHs (sub_init);
632	/*
633	* the next line is slightly wrong, as PL_op->op_next
634	* is actually being executed so we skip the first op.
635	* that doesn't matter, though, since it is only
636	* pp_nextstate and we never return...
637	* ah yes, and I don't care anyways ;)
638	*/
639	PUTBACK;
640	PL_op = pp_entersub();
641	SPAGAIN;
642
643	ENTER; /* necessary e.g. for dounwind */
644	}
645	}
646
647	static void
648	continue_coro (void *arg)
649	{
650	/*
651	* this is a _very_ stripped down perl interpreter ;)
652	*/
653	Coro__State ctx = (Coro__State)arg;
654
655	/*FIXME*//* must set up top_env here */
656	ctx->cursp = 0;
657	PL_op = PL_op->op_next;
658	CALLRUNOPS(aTHX);
659
660	abort ();
661	}
662
663	STATIC void
664	transfer(pTHX_ struct coro *prev, struct coro *next, int flags)
665	{
666	dSP;
667	dSTACKLEVEL;
668
669	if (prev != next)
670	{
671	if (next->mainstack)
672	{
673	SAVE (prev, flags);
674	LOAD (next);
675
676	/* mark this state as in-use */
677	next->mainstack = 0;
678	next->tmps_ix = -2;
679
680	/* stacklevel changed? if yes, grab the stack for us! */
681	if (flags & TRANSFER_SAVE_CCTXT)
682	{
683	if (!prev->stack)
684	allocate_stack (prev, 0);
685	else if (prev->cursp != stacklevel
686	&& prev->stack->usecnt > 1)
687	{
688	prev->gencnt = ++prev->stack->gencnt;
689	prev->stack->usecnt = 1;
690	}
691
692	/* has our stack been invalidated? */
693	if (next->stack && next->stack->gencnt != next->gencnt)
694	{
695	deallocate_stack (next);
696	allocate_stack (next, 1);
697	coro_create (&(next->stack->cctx),
698	continue_coro, (void *)next,
699	next->stack->sptr, labs (next->stack->ssize));
700	}
701
702	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
703	}
704
705	}
706	else if (next->tmps_ix == -2)
707	croak ("tried to transfer to running coroutine");
708	else
709	{
710	SAVE (prev, -1); /* first get rid of the old state */
711
712	if (flags & TRANSFER_SAVE_CCTXT)
713	{
714	if (!prev->stack)
715	allocate_stack (prev, 0);
716
717	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
718	{
719	setup_coro (next);
720
721	prev->stack->refcnt++;
722	prev->stack->usecnt++;
723	next->stack = prev->stack;
724	next->gencnt = prev->gencnt;
725	}
726	else
727	{
728	allocate_stack (next, 1);
729	coro_create (&(next->stack->cctx),
730	setup_coro, (void *)next,
731	next->stack->sptr, labs (next->stack->ssize));
732	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
733	}
734	}
735	else
736	setup_coro (next);
737	}
738	}
739
740	next->cursp = stacklevel;
741	}
742
743	static struct coro *
744	sv_to_coro (SV *arg, const char *funcname, const char *varname)
745	{
746	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
747	{
748	HE *he = hv_fetch_ent((HV *)SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
749
750	if (!he)
751	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
752
753	arg = HeVAL(he);
754	}
755
756	/* must also be changed inside Coro::Cont::yield */
757	if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
758	return (struct coro *) SvIV((SV*)SvRV(arg));
759	else
760	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
761	}
762
763	static void
764	api_transfer(pTHX_ SV *prev, SV *next, int flags)
765	{
766	transfer(aTHX_ sv_to_coro (prev, "Coro::transfer", "prev"),
767	sv_to_coro (next, "Coro::transfer", "next"),
768	flags);
769	}
770		201
771	/** Coro ********************************************************************/	202	/** Coro ********************************************************************/
772		203
773	#define PRIO_MAX 3	204	#define PRIO_MAX 3
774	#define PRIO_HIGH 1	205	#define PRIO_HIGH 1
…		…
776	#define PRIO_LOW -1	207	#define PRIO_LOW -1
777	#define PRIO_IDLE -3	208	#define PRIO_IDLE -3
778	#define PRIO_MIN -4	209	#define PRIO_MIN -4
779		210
780	/* for Coro.pm */	211	/* for Coro.pm */
781	static GV *coro_current, *coro_idle;	212	static SV *coro_current;
782	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];	213	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
783	static int coro_nready;	214	static int coro_nready;
		215	static struct coro *coro_first;
784		216
785	static void	217	/** lowlevel stuff **********************************************************/
786	coro_enq (SV *sv)	218
		219	static AV *
		220	coro_clone_padlist (pTHX_ CV *cv)
787	{	221	{
788	if (SvROK (sv))	222	AV *padlist = CvPADLIST (cv);
		223	AV *newpadlist, *newpad;
		224
		225	newpadlist = newAV ();
		226	AvREAL_off (newpadlist);
		227	#if PERL_VERSION_ATLEAST (5,9,0)
		228	Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1);
		229	#else
		230	Perl_pad_push (aTHX_ padlist, AvFILLp (padlist) + 1, 1);
		231	#endif
		232	newpad = (AV *)AvARRAY (padlist)[AvFILLp (padlist)];
		233	--AvFILLp (padlist);
		234
		235	av_store (newpadlist, 0, SvREFCNT_inc (*av_fetch (padlist, 0, FALSE)));
		236	av_store (newpadlist, 1, (SV *)newpad);
		237
		238	return newpadlist;
		239	}
		240
		241	static void
		242	free_padlist (pTHX_ AV *padlist)
		243	{
		244	/* may be during global destruction */
		245	if (SvREFCNT (padlist))
789	{	246	{
790	SV *hv = SvRV (sv);	247	I32 i = AvFILLp (padlist);
791	if (SvTYPE (hv) == SVt_PVHV)	248	while (i >= 0)
792	{	249	{
793	SV **xprio = hv_fetch ((HV *)hv, "prio", 4, 0);	250	SV **svp = av_fetch (padlist, i--, FALSE);
794	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;	251	if (svp)
		252	{
		253	SV *sv;
		254	while (&PL_sv_undef != (sv = av_pop ((AV *)*svp)))
		255	SvREFCNT_dec (sv);
795		256
796	prio = prio > PRIO_MAX ? PRIO_MAX	257	SvREFCNT_dec (*svp);
797	: prio < PRIO_MIN ? PRIO_MIN	258	}
798	: prio;
799
800	av_push (coro_ready [prio - PRIO_MIN], sv);
801	coro_nready++;
802
803	return;
804	}	259	}
		260
		261	SvREFCNT_dec ((SV*)padlist);
		262	}
		263	}
		264
		265	static int
		266	coro_cv_free (pTHX_ SV *sv, MAGIC *mg)
		267	{
		268	AV *padlist;
		269	AV *av = (AV *)mg->mg_obj;
		270
		271	/* casting is fun. */
		272	while (&PL_sv_undef != (SV *)(padlist = (AV *)av_pop (av)))
		273	free_padlist (aTHX_ padlist);
		274
		275	SvREFCNT_dec (av);
		276
		277	return 0;
		278	}
		279
		280	#define PERL_MAGIC_coro PERL_MAGIC_ext
		281
		282	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
		283
		284	#define CORO_MAGIC(cv) \
		285	SvMAGIC (cv) \
		286	? SvMAGIC (cv)->mg_type == PERL_MAGIC_coro \
		287	? SvMAGIC (cv) \
		288	: mg_find ((SV *)cv, PERL_MAGIC_coro) \
		289	: 0
		290
		291	/* the next two functions merely cache the padlists */
		292	static void
		293	get_padlist (pTHX_ CV *cv)
		294	{
		295	MAGIC *mg = CORO_MAGIC (cv);
		296	AV *av;
		297
		298	if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
		299	CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
		300	else
		301	{
		302	#if CORO_PREFER_PERL_FUNCTIONS
		303	/* this is probably cleaner, but also slower? */
		304	CV *cp = Perl_cv_clone (cv);
		305	CvPADLIST (cv) = CvPADLIST (cp);
		306	CvPADLIST (cp) = 0;
		307	SvREFCNT_dec (cp);
		308	#else
		309	CvPADLIST (cv) = coro_clone_padlist (aTHX_ cv);
		310	#endif
805	}	311	}
		312	}
806		313
807	croak ("Coro::ready tried to enqueue something that is not a coroutine");	314	static void
		315	put_padlist (pTHX_ CV *cv)
		316	{
		317	MAGIC *mg = CORO_MAGIC (cv);
		318	AV *av;
		319
		320	if (!mg)
		321	{
		322	sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
		323	mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
		324	mg->mg_virtual = &vtbl_coro;
		325	mg->mg_obj = (SV *)newAV ();
		326	}
		327
		328	av = (AV *)mg->mg_obj;
		329
		330	if (AvFILLp (av) >= AvMAX (av))
		331	av_extend (av, AvMAX (av) + 1);
		332
		333	AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
		334	}
		335
		336	/** load & save, init *******************************************************/
		337
		338	#define SB do {
		339	#define SE } while (0)
		340
		341	#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
		342
		343	static void
		344	load_perl (pTHX_ Coro__State c)
		345	{
		346	#define VAR(name,type) PL_ ## name = c->name;
		347	# include "state.h"
		348	#undef VAR
		349
		350	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
		351	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
		352	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
		353	if (c->deffh) REPLACE_SV (PL_defoutgv , c->deffh);
		354
		355	if (c->irssv)
		356	{
		357	if (c->irssv == PL_rs || sv_eq (PL_rs, c->irssv))
		358	{
		359	SvREFCNT_dec (c->irssv);
		360	c->irssv = 0;
		361	}
		362	else
		363	{
		364	REPLACE_SV (PL_rs, c->irssv);
		365	if (!c->irssv_sv) c->irssv_sv = get_sv ("/", 0);
		366	sv_setsv (c->irssv_sv, PL_rs);
		367	}
		368	}
		369
		370	{
		371	dSP;
		372	CV *cv;
		373
		374	/* now do the ugly restore mess */
		375	while ((cv = (CV *)POPs))
		376	{
		377	put_padlist (aTHX_ cv); /* mark this padlist as available */
		378	CvDEPTH (cv) = PTR2IV (POPs);
		379	CvPADLIST (cv) = (AV *)POPs;
		380	}
		381
		382	PUTBACK;
		383	}
		384	}
		385
		386	static void
		387	save_perl (pTHX_ Coro__State c)
		388	{
		389	{
		390	dSP;
		391	I32 cxix = cxstack_ix;
		392	PERL_CONTEXT *ccstk = cxstack;
		393	PERL_SI *top_si = PL_curstackinfo;
		394
		395	/*
		396	* the worst thing you can imagine happens first - we have to save
		397	* (and reinitialize) all cv's in the whole callchain :(
		398	*/
		399
		400	XPUSHs (Nullsv);
		401	/* this loop was inspired by pp_caller */
		402	for (;;)
		403	{
		404	while (cxix >= 0)
		405	{
		406	PERL_CONTEXT *cx = &ccstk[cxix--];
		407
		408	if (CxTYPE (cx) == CXt_SUB || CxTYPE (cx) == CXt_FORMAT)
		409	{
		410	CV *cv = cx->blk_sub.cv;
		411
		412	if (CvDEPTH (cv))
		413	{
		414	EXTEND (SP, 3);
		415	PUSHs ((SV *)CvPADLIST (cv));
		416	PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
		417	PUSHs ((SV *)cv);
		418
		419	CvDEPTH (cv) = 0;
		420	get_padlist (aTHX_ cv);
		421	}
		422	}
		423	}
		424
		425	if (top_si->si_type == PERLSI_MAIN)
		426	break;
		427
		428	top_si = top_si->si_prev;
		429	ccstk = top_si->si_cxstack;
		430	cxix = top_si->si_cxix;
		431	}
		432
		433	PUTBACK;
		434	}
		435
		436	c->defav = c->save & CORO_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
		437	c->defsv = c->save & CORO_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
		438	c->errsv = c->save & CORO_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
		439	c->deffh = c->save & CORO_SAVE_DEFFH ? (GV *)SvREFCNT_inc (PL_defoutgv) : 0;
		440	c->irssv = c->save & CORO_SAVE_IRSSV ? SvREFCNT_inc (PL_rs) : 0;
		441
		442	#define VAR(name,type)c->name = PL_ ## name;
		443	# include "state.h"
		444	#undef VAR
		445	}
		446
		447	/*
		448	* allocate various perl stacks. This is an exact copy
		449	* of perl.c:init_stacks, except that it uses less memory
		450	* on the (sometimes correct) assumption that coroutines do
		451	* not usually need a lot of stackspace.
		452	*/
		453	#if CORO_PREFER_PERL_FUNCTIONS
		454	# define coro_init_stacks init_stacks
		455	#else
		456	static void
		457	coro_init_stacks (pTHX)
		458	{
		459	PL_curstackinfo = new_stackinfo(64, 6);
		460	PL_curstackinfo->si_type = PERLSI_MAIN;
		461	PL_curstack = PL_curstackinfo->si_stack;
		462	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
		463
		464	PL_stack_base = AvARRAY(PL_curstack);
		465	PL_stack_sp = PL_stack_base;
		466	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
		467
		468	New(50,PL_tmps_stack,64,SV*);
		469	PL_tmps_floor = -1;
		470	PL_tmps_ix = -1;
		471	PL_tmps_max = 64;
		472
		473	New(54,PL_markstack,16,I32);
		474	PL_markstack_ptr = PL_markstack;
		475	PL_markstack_max = PL_markstack + 16;
		476
		477	#ifdef SET_MARK_OFFSET
		478	SET_MARK_OFFSET;
		479	#endif
		480
		481	New(54,PL_scopestack,16,I32);
		482	PL_scopestack_ix = 0;
		483	PL_scopestack_max = 16;
		484
		485	New(54,PL_savestack,64,ANY);
		486	PL_savestack_ix = 0;
		487	PL_savestack_max = 64;
		488
		489	#if !PERL_VERSION_ATLEAST (5,9,0)
		490	New(54,PL_retstack,4,OP*);
		491	PL_retstack_ix = 0;
		492	PL_retstack_max = 4;
		493	#endif
		494	}
		495	#endif
		496
		497	/*
		498	* destroy the stacks, the callchain etc...
		499	*/
		500	static void
		501	coro_destroy_stacks (pTHX)
		502	{
		503	if (!IN_DESTRUCT)
		504	{
		505	/* restore all saved variables and stuff */
		506	LEAVE_SCOPE (0);
		507	assert (PL_tmps_floor == -1);
		508
		509	/* free all temporaries */
		510	FREETMPS;
		511	assert (PL_tmps_ix == -1);
		512
		513	/* unwind all extra stacks */
		514	POPSTACK_TO (PL_mainstack);
		515
		516	/* unwind main stack */
		517	dounwind (-1);
		518	}
		519
		520	while (PL_curstackinfo->si_next)
		521	PL_curstackinfo = PL_curstackinfo->si_next;
		522
		523	while (PL_curstackinfo)
		524	{
		525	PERL_SI *p = PL_curstackinfo->si_prev;
		526
		527	if (!IN_DESTRUCT)
		528	SvREFCNT_dec (PL_curstackinfo->si_stack);
		529
		530	Safefree (PL_curstackinfo->si_cxstack);
		531	Safefree (PL_curstackinfo);
		532	PL_curstackinfo = p;
		533	}
		534
		535	Safefree (PL_tmps_stack);
		536	Safefree (PL_markstack);
		537	Safefree (PL_scopestack);
		538	Safefree (PL_savestack);
		539	#if !PERL_VERSION_ATLEAST (5,9,0)
		540	Safefree (PL_retstack);
		541	#endif
		542	}
		543
		544	static size_t
		545	coro_rss (struct coro *coro)
		546	{
		547	size_t rss = sizeof (coro);
		548
		549	if (coro->mainstack)
		550	{
		551	if (coro->flags & CF_RUNNING)
		552	{
		553	#define VAR(name,type)coro->name = PL_ ## name;
		554	# include "state.h"
		555	#undef VAR
		556	}
		557
		558	rss += sizeof (coro->curstackinfo);
		559	rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstackinfo->si_stack)) * sizeof (SV *);
		560	rss += (coro->curstackinfo->si_cxmax + 1) * sizeof (PERL_CONTEXT);
		561	rss += sizeof (struct xpvav) + (1 + AvFILL (coro->curstack)) * sizeof (SV *);
		562	rss += coro->tmps_max * sizeof (SV *);
		563	rss += (coro->markstack_max - coro->markstack_ptr) * sizeof (I32);
		564	rss += coro->scopestack_max * sizeof (I32);
		565	rss += coro->savestack_max * sizeof (ANY);
		566
		567	#if !PERL_VERSION_ATLEAST (5,9,0)
		568	rss += coro->retstack_max * sizeof (OP *);
		569	#endif
		570	}
		571
		572	return rss;
		573	}
		574
		575	/** coroutine stack handling ************************************************/
		576
		577	static void
		578	setup_coro (pTHX_ struct coro *coro)
		579	{
		580	/*
		581	* emulate part of the perl startup here.
		582	*/
		583	coro_init_stacks (aTHX);
		584
		585	PL_curcop = &PL_compiling;
		586	PL_in_eval = EVAL_NULL;
		587	PL_comppad = 0;
		588	PL_curpm = 0;
		589	PL_localizing = 0;
		590	PL_dirty = 0;
		591	PL_restartop = 0;
		592
		593	{
		594	dSP;
		595	LOGOP myop;
		596
		597	SvREFCNT_dec (GvAV (PL_defgv));
		598	GvAV (PL_defgv) = coro->args; coro->args = 0;
		599
		600	Zero (&myop, 1, LOGOP);
		601	myop.op_next = Nullop;
		602	myop.op_flags = OPf_WANT_VOID;
		603
		604	PUSHMARK (SP);
		605	XPUSHs (av_shift (GvAV (PL_defgv)));
		606	PUTBACK;
		607	PL_op = (OP *)&myop;
		608	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		609	SPAGAIN;
		610	}
		611
		612	ENTER; /* necessary e.g. for dounwind */
		613	}
		614
		615	static void
		616	free_coro_mortal (pTHX)
		617	{
		618	if (coro_mortal)
		619	{
		620	SvREFCNT_dec (coro_mortal);
		621	coro_mortal = 0;
		622	}
		623	}
		624
		625	/* inject a fake call to Coro::State::_cctx_init into the execution */
		626	/* _cctx_init should be careful, as it could be called at almost any time */
		627	/* during execution of a perl program */
		628	static void NOINLINE
		629	prepare_cctx (pTHX_ coro_cctx *cctx)
		630	{
		631	dSP;
		632	LOGOP myop;
		633
		634	Zero (&myop, 1, LOGOP);
		635	myop.op_next = PL_op;
		636	myop.op_flags = OPf_WANT_VOID | OPf_STACKED;
		637
		638	PUSHMARK (SP);
		639	EXTEND (SP, 2);
		640	PUSHs (sv_2mortal (newSViv (PTR2IV (cctx))));
		641	PUSHs ((SV *)get_cv ("Coro::State::_cctx_init", FALSE));
		642	PUTBACK;
		643	PL_op = (OP *)&myop;
		644	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		645	SPAGAIN;
		646	}
		647
		648	/*
		649	* this is a _very_ stripped down perl interpreter ;)
		650	*/
		651	static void
		652	coro_run (void *arg)
		653	{
		654	dTHX;
		655
		656	/* coro_run is the alternative tail of transfer(), so unlock here. */
		657	UNLOCK;
		658
		659	PL_top_env = &PL_start_env;
		660
		661	/* inject a fake subroutine call to cctx_init */
		662	prepare_cctx (aTHX_ (coro_cctx *)arg);
		663
		664	/* somebody or something will hit me for both perl_run and PL_restartop */
		665	PL_restartop = PL_op;
		666	perl_run (PL_curinterp);
		667
		668	/*
		669	* If perl-run returns we assume exit() was being called or the coro
		670	* fell off the end, which seems to be the only valid (non-bug)
		671	* reason for perl_run to return. We try to exit by jumping to the
		672	* bootstrap-time "top" top_env, as we cannot restore the "main"
		673	* coroutine as Coro has no such concept
		674	*/
		675	PL_top_env = main_top_env;
		676	JMPENV_JUMP (2); /* I do not feel well about the hardcoded 2 at all */
		677	}
		678
		679	static coro_cctx *
		680	cctx_new ()
		681	{
		682	coro_cctx *cctx;
		683	void *stack_start;
		684	size_t stack_size;
		685
		686	++cctx_count;
		687
		688	Newz (0, cctx, 1, coro_cctx);
		689
		690	#if HAVE_MMAP
		691
		692	cctx->ssize = ((coro_stacksize * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
		693	/* mmap supposedly does allocate-on-write for us */
		694	cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC|PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, 0, 0);
		695
		696	if (cctx->sptr != (void *)-1)
		697	{
		698	# if CORO_STACKGUARD
		699	mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
		700	# endif
		701	stack_start = CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr;
		702	stack_size = cctx->ssize - CORO_STACKGUARD * PAGESIZE;
		703	cctx->mapped = 1;
		704	}
		705	else
		706	#endif
		707	{
		708	cctx->ssize = coro_stacksize * (long)sizeof (long);
		709	New (0, cctx->sptr, coro_stacksize, long);
		710
		711	if (!cctx->sptr)
		712	{
		713	perror ("FATAL: unable to allocate stack for coroutine");
		714	_exit (EXIT_FAILURE);
		715	}
		716
		717	stack_start = cctx->sptr;
		718	stack_size = cctx->ssize;
		719	}
		720
		721	REGISTER_STACK (cctx, (char *)stack_start, (char *)stack_start + stack_size);
		722	coro_create (&cctx->cctx, coro_run, (void *)cctx, stack_start, stack_size);
		723
		724	return cctx;
		725	}
		726
		727	static void
		728	cctx_destroy (coro_cctx *cctx)
		729	{
		730	if (!cctx)
		731	return;
		732
		733	--cctx_count;
		734
		735	#if CORO_USE_VALGRIND
		736	VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
		737	#endif
		738
		739	#if HAVE_MMAP
		740	if (cctx->mapped)
		741	munmap (cctx->sptr, cctx->ssize);
		742	else
		743	#endif
		744	Safefree (cctx->sptr);
		745
		746	Safefree (cctx);
		747	}
		748
		749	static coro_cctx *
		750	cctx_get (pTHX)
		751	{
		752	while (cctx_first)
		753	{
		754	coro_cctx *cctx = cctx_first;
		755	cctx_first = cctx->next;
		756	--cctx_idle;
		757
		758	if (cctx->ssize >= coro_stacksize)
		759	return cctx;
		760
		761	cctx_destroy (cctx);
		762	}
		763
		764	PL_op = PL_op->op_next;
		765	return cctx_new ();
		766	}
		767
		768	static void
		769	cctx_put (coro_cctx *cctx)
		770	{
		771	/* free another cctx if overlimit */
		772	if (cctx_idle >= MAX_IDLE_CCTX)
		773	{
		774	coro_cctx *first = cctx_first;
		775	cctx_first = first->next;
		776	--cctx_idle;
		777
		778	assert (!first->inuse);
		779	cctx_destroy (first);
		780	}
		781
		782	++cctx_idle;
		783	cctx->next = cctx_first;
		784	cctx_first = cctx;
		785	}
		786
		787	/** coroutine switching *****************************************************/
		788
		789	/* never call directly, always through the coro_state_transfer global variable */
		790	static void NOINLINE
		791	transfer (pTHX_ struct coro *prev, struct coro *next)
		792	{
		793	dSTACKLEVEL;
		794
		795	/* sometimes transfer is only called to set idle_sp */
		796	if (!next)
		797	{
		798	((coro_cctx *)prev)->idle_sp = STACKLEVEL;
		799	assert (((coro_cctx *)prev)->idle_te = PL_top_env); /* just for the side-effect when asserts are enabled */
		800	}
		801	else if (prev != next)
		802	{
		803	coro_cctx *prev__cctx;
		804
		805	if (prev->flags & CF_NEW)
		806	{
		807	/* create a new empty context */
		808	Newz (0, prev->cctx, 1, coro_cctx);
		809	prev->cctx->inuse = 1;
		810	prev->flags &= ~CF_NEW;
		811	prev->flags |= CF_RUNNING;
		812	}
		813
		814	/*TODO: must not croak here */
		815	if (!prev->flags & CF_RUNNING)
		816	croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
		817
		818	if (next->flags & CF_RUNNING)
		819	croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
		820
		821	if (next->flags & CF_DESTROYED)
		822	croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
		823
		824	prev->flags &= ~CF_RUNNING;
		825	next->flags |= CF_RUNNING;
		826
		827	LOCK;
		828
		829	if (next->flags & CF_NEW)
		830	{
		831	/* need to start coroutine */
		832	next->flags &= ~CF_NEW;
		833	/* first get rid of the old state */
		834	save_perl (aTHX_ prev);
		835	/* setup coroutine call */
		836	setup_coro (aTHX_ next);
		837	/* need a new stack */
		838	assert (!next->cctx);
		839	}
		840	else
		841	{
		842	/* coroutine already started */
		843	save_perl (aTHX_ prev);
		844	load_perl (aTHX_ next);
		845	}
		846
		847	prev__cctx = prev->cctx;
		848
		849	/* possibly "free" the cctx */
		850	if (prev__cctx->idle_sp == STACKLEVEL)
		851	{
		852	/* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
		853	assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
		854
		855	prev->cctx = 0;
		856
		857	cctx_put (prev__cctx);
		858	prev__cctx->inuse = 0;
		859	}
		860
		861	if (!next->cctx)
		862	{
		863	next->cctx = cctx_get (aTHX);
		864	assert (!next->cctx->inuse);
		865	next->cctx->inuse = 1;
		866	}
		867
		868	if (prev__cctx != next->cctx)
		869	{
		870	prev__cctx->top_env = PL_top_env;
		871	PL_top_env = next->cctx->top_env;
		872	coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
		873	}
		874
		875	free_coro_mortal (aTHX);
		876	UNLOCK;
		877	}
		878	}
		879
		880	struct transfer_args
		881	{
		882	struct coro *prev, *next;
		883	};
		884
		885	#define TRANSFER(ta) transfer (aTHX_ (ta).prev, (ta).next)
		886
		887	/** high level stuff ********************************************************/
		888
		889	static int
		890	coro_state_destroy (pTHX_ struct coro *coro)
		891	{
		892	if (coro->flags & CF_DESTROYED)
		893	return 0;
		894
		895	coro->flags |= CF_DESTROYED;
		896
		897	if (coro->flags & CF_READY)
		898	{
		899	/* reduce nready, as destroying a ready coro effectively unreadies it */
		900	/* alternative: look through all ready queues and remove the coro */
		901	LOCK;
		902	--coro_nready;
		903	UNLOCK;
		904	}
		905	else
		906	coro->flags |= CF_READY; /* make sure it is NOT put into the readyqueue */
		907
		908	if (coro->mainstack && coro->mainstack != main_mainstack)
		909	{
		910	struct coro temp;
		911
		912	assert (!(coro->flags & CF_RUNNING));
		913
		914	Zero (&temp, 1, struct coro);
		915	temp.save = CORO_SAVE_ALL;
		916
		917	if (coro->flags & CF_RUNNING)
		918	croak ("FATAL: tried to destroy currently running coroutine");
		919
		920	save_perl (aTHX_ &temp);
		921	load_perl (aTHX_ coro);
		922
		923	coro_destroy_stacks (aTHX);
		924
		925	load_perl (aTHX_ &temp); /* this will get rid of defsv etc.. */
		926
		927	coro->mainstack = 0;
		928	}
		929
		930	cctx_destroy (coro->cctx);
		931	SvREFCNT_dec (coro->args);
		932
		933	if (coro->next) coro->next->prev = coro->prev;
		934	if (coro->prev) coro->prev->next = coro->next;
		935	if (coro == coro_first) coro_first = coro->next;
		936
		937	return 1;
		938	}
		939
		940	static int
		941	coro_state_free (pTHX_ SV *sv, MAGIC *mg)
		942	{
		943	struct coro *coro = (struct coro *)mg->mg_ptr;
		944	mg->mg_ptr = 0;
		945
		946	coro->hv = 0;
		947
		948	if (--coro->refcnt < 0)
		949	{
		950	coro_state_destroy (aTHX_ coro);
		951	Safefree (coro);
		952	}
		953
		954	return 0;
		955	}
		956
		957	static int
		958	coro_state_dup (pTHX_ MAGIC *mg, CLONE_PARAMS *params)
		959	{
		960	struct coro *coro = (struct coro *)mg->mg_ptr;
		961
		962	++coro->refcnt;
		963
		964	return 0;
		965	}
		966
		967	static MGVTBL coro_state_vtbl = {
		968	0, 0, 0, 0,
		969	coro_state_free,
		970	0,
		971	#ifdef MGf_DUP
		972	coro_state_dup,
		973	#else
		974	# define MGf_DUP 0
		975	#endif
		976	};
		977
		978	static struct coro *
		979	SvSTATE_ (pTHX_ SV *coro)
		980	{
		981	HV *stash;
		982	MAGIC *mg;
		983
		984	if (SvROK (coro))
		985	coro = SvRV (coro);
		986
		987	stash = SvSTASH (coro);
		988	if (stash != coro_stash && stash != coro_state_stash)
		989	{
		990	/* very slow, but rare, check */
		991	if (!sv_derived_from (sv_2mortal (newRV_inc (coro)), "Coro::State"))
		992	croak ("Coro::State object required");
		993	}
		994
		995	mg = CORO_MAGIC (coro);
		996	return (struct coro *)mg->mg_ptr;
		997	}
		998
		999	#define SvSTATE(sv) SvSTATE_ (aTHX_ (sv))
		1000
		1001	static void
		1002	prepare_transfer (pTHX_ struct transfer_args *ta, SV *prev_sv, SV *next_sv)
		1003	{
		1004	ta->prev = SvSTATE (prev_sv);
		1005	ta->next = SvSTATE (next_sv);
		1006	}
		1007
		1008	static void
		1009	api_transfer (SV *prev_sv, SV *next_sv)
		1010	{
		1011	dTHX;
		1012	struct transfer_args ta;
		1013
		1014	prepare_transfer (aTHX_ &ta, prev_sv, next_sv);
		1015	TRANSFER (ta);
		1016	}
		1017
		1018	static int
		1019	api_save (SV *coro_sv, int new_save)
		1020	{
		1021	dTHX;
		1022	struct coro *coro = SvSTATE (coro_sv);
		1023	int old_save = coro->save;
		1024
		1025	if (new_save >= 0)
		1026	coro->save = new_save;
		1027
		1028	return old_save;
		1029	}
		1030
		1031	/** Coro ********************************************************************/
		1032
		1033	static void
		1034	coro_enq (pTHX_ SV *coro_sv)
		1035	{
		1036	av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
808	}	1037	}
809		1038
810	static SV *	1039	static SV *
811	coro_deq (int min_prio)	1040	coro_deq (pTHX_ int min_prio)
812	{	1041	{
813	int prio = PRIO_MAX - PRIO_MIN;	1042	int prio = PRIO_MAX - PRIO_MIN;
814		1043
815	min_prio -= PRIO_MIN;	1044	min_prio -= PRIO_MIN;
816	if (min_prio < 0)	1045	if (min_prio < 0)
817	min_prio = 0;	1046	min_prio = 0;
818		1047
819	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )	1048	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
820	if (av_len (coro_ready[prio]) >= 0)	1049	if (AvFILLp (coro_ready [prio]) >= 0)
821	{
822	coro_nready--;
823	return av_shift (coro_ready[prio]);	1050	return av_shift (coro_ready [prio]);
824	}
825		1051
826	return 0;	1052	return 0;
827	}	1053	}
828		1054
829	static void	1055	static int
830	api_ready (SV *coro)	1056	api_ready (SV *coro_sv)
831	{	1057	{
		1058	dTHX;
		1059	struct coro *coro;
		1060
		1061	if (SvROK (coro_sv))
		1062	coro_sv = SvRV (coro_sv);
		1063
		1064	coro = SvSTATE (coro_sv);
		1065
		1066	if (coro->flags & CF_READY)
		1067	return 0;
		1068
		1069	coro->flags |= CF_READY;
		1070
		1071	LOCK;
832	coro_enq (SvREFCNT_inc (coro));	1072	coro_enq (aTHX_ SvREFCNT_inc (coro_sv));
833	}	1073	++coro_nready;
		1074	UNLOCK;
834		1075
		1076	return 1;
		1077	}
		1078
835	static void	1079	static int
836	api_schedule (int cede)	1080	api_is_ready (SV *coro_sv)
837	{	1081	{
		1082	dTHX;
		1083	return !!(SvSTATE (coro_sv)->flags & CF_READY);
		1084	}
		1085
		1086	static void
		1087	prepare_schedule (pTHX_ struct transfer_args *ta)
		1088	{
838	SV *prev, *next;	1089	SV *prev_sv, *next_sv;
839		1090
		1091	for (;;)
		1092	{
		1093	LOCK;
		1094	next_sv = coro_deq (aTHX_ PRIO_MIN);
		1095
		1096	/* nothing to schedule: call the idle handler */
		1097	if (!next_sv)
		1098	{
		1099	dSP;
		1100	UNLOCK;
		1101
		1102	ENTER;
		1103	SAVETMPS;
		1104
		1105	PUSHMARK (SP);
		1106	PUTBACK;
		1107	call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
		1108
		1109	FREETMPS;
		1110	LEAVE;
		1111	continue;
		1112	}
		1113
		1114	ta->next = SvSTATE (next_sv);
		1115
		1116	/* cannot transfer to destroyed coros, skip and look for next */
		1117	if (ta->next->flags & CF_DESTROYED)
		1118	{
		1119	UNLOCK;
		1120	SvREFCNT_dec (next_sv);
		1121	/* coro_nready is already taken care of by destroy */
		1122	continue;
		1123	}
		1124
		1125	--coro_nready;
		1126	UNLOCK;
		1127	break;
		1128	}
		1129
		1130	/* free this only after the transfer */
840	prev = GvSV (coro_current);	1131	prev_sv = SvRV (coro_current);
		1132	SvRV_set (coro_current, next_sv);
		1133	ta->prev = SvSTATE (prev_sv);
841		1134
842	if (cede)	1135	assert (ta->next->flags & CF_READY);
843	coro_enq (SvREFCNT_inc (prev));	1136	ta->next->flags &= ~CF_READY;
844		1137
845	next = coro_deq (PRIO_MIN);	1138	LOCK;
		1139	free_coro_mortal (aTHX);
		1140	coro_mortal = prev_sv;
		1141	UNLOCK;
		1142	}
846		1143
847	if (!next)	1144	static void
848	next = SvREFCNT_inc (GvSV (coro_idle));	1145	prepare_cede (pTHX_ struct transfer_args *ta)
		1146	{
		1147	api_ready (coro_current);
		1148	prepare_schedule (aTHX_ ta);
		1149	}
849		1150
850	GvSV (coro_current) = SvREFCNT_inc (next);	1151	static int
851	transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"),	1152	prepare_cede_notself (pTHX_ struct transfer_args *ta)
852	sv_to_coro (next, "Coro::schedule", "next coroutine"),	1153	{
853	TRANSFER_SAVE_ALL | TRANSFER_LAZY_STACK);	1154	if (coro_nready)
854	SvREFCNT_dec (next);	1155	{
855	SvREFCNT_dec (prev);	1156	SV *prev = SvRV (coro_current);
		1157	prepare_schedule (aTHX_ ta);
		1158	api_ready (prev);
		1159	return 1;
		1160	}
		1161	else
		1162	return 0;
		1163	}
		1164
		1165	static void
		1166	api_schedule (void)
		1167	{
		1168	dTHX;
		1169	struct transfer_args ta;
		1170
		1171	prepare_schedule (aTHX_ &ta);
		1172	TRANSFER (ta);
		1173	}
		1174
		1175	static int
		1176	api_cede (void)
		1177	{
		1178	dTHX;
		1179	struct transfer_args ta;
		1180
		1181	prepare_cede (aTHX_ &ta);
		1182
		1183	if (ta.prev != ta.next)
		1184	{
		1185	TRANSFER (ta);
		1186	return 1;
		1187	}
		1188	else
		1189	return 0;
		1190	}
		1191
		1192	static int
		1193	api_cede_notself (void)
		1194	{
		1195	dTHX;
		1196	struct transfer_args ta;
		1197
		1198	if (prepare_cede_notself (aTHX_ &ta))
		1199	{
		1200	TRANSFER (ta);
		1201	return 1;
		1202	}
		1203	else
		1204	return 0;
856	}	1205	}
857		1206
858	MODULE = Coro::State PACKAGE = Coro::State	1207	MODULE = Coro::State PACKAGE = Coro::State
859		1208
860	PROTOTYPES: ENABLE	1209	PROTOTYPES: DISABLE
861		1210
862	BOOT:	1211	BOOT:
863	{ /* {} necessary for stoopid perl-5.6.x */	1212	{
864	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);	1213	#ifdef USE_ITHREADS
865	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);	1214	MUTEX_INIT (&coro_mutex);
		1215	#endif
		1216	BOOT_PAGESIZE;
		1217
866	coro_state_stash = gv_stashpv ("Coro::State", TRUE);	1218	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
867		1219
868	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));	1220	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (CORO_SAVE_DEFAV));
869	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));	1221	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (CORO_SAVE_DEFSV));
870	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));	1222	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (CORO_SAVE_ERRSV));
		1223	newCONSTSUB (coro_state_stash, "SAVE_IRSSV", newSViv (CORO_SAVE_IRSSV));
		1224	newCONSTSUB (coro_state_stash, "SAVE_DEFFH", newSViv (CORO_SAVE_DEFFH));
871	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));	1225	newCONSTSUB (coro_state_stash, "SAVE_DEF", newSViv (CORO_SAVE_DEF));
872		1226	newCONSTSUB (coro_state_stash, "SAVE_ALL", newSViv (CORO_SAVE_ALL));
873	if (!padlist_cache)
874	padlist_cache = newHV ();
875		1227
876	main_mainstack = PL_mainstack;	1228	main_mainstack = PL_mainstack;
		1229	main_top_env = PL_top_env;
877		1230
878	{	1231	while (main_top_env->je_prev)
879	SV *sv = perl_get_sv("Coro::API", 1);	1232	main_top_env = main_top_env->je_prev;
880		1233
881	coroapi.ver = CORO_API_VERSION - 1;	1234	coroapi.ver = CORO_API_VERSION;
882	coroapi.transfer = api_transfer;	1235	coroapi.transfer = api_transfer;
883	coroapi.schedule = api_schedule;
884	coroapi.ready = api_ready;
885	coroapi.nready = &coro_nready;
886		1236
887	GCoroAPI = &coroapi;	1237	assert (("PRIO_NORMAL must be 0", !PRIO_NORMAL));
888	sv_setiv(sv, (IV)&coroapi);
889	SvREADONLY_on(sv);
890	}
891	}	1238	}
892		1239
893	Coro::State	1240	SV *
894	_newprocess(args)	1241	new (char *klass, ...)
895	SV * args
896	PROTOTYPE: $
897	CODE:	1242	CODE:
898	Coro__State coro;	1243	{
		1244	struct coro *coro;
		1245	HV *hv;
		1246	int i;
899		1247
900	if (!SvROK (args) || SvTYPE (SvRV (args)) != SVt_PVAV)
901	croak ("Coro::State::_newprocess expects an arrayref");
902
903	New (0, coro, 1, struct coro);	1248	Newz (0, coro, 1, struct coro);
		1249	coro->args = newAV ();
		1250	coro->save = CORO_SAVE_DEF;
		1251	coro->flags = CF_NEW;
904		1252
905	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	1253	if (coro_first) coro_first->prev = coro;
906	coro->mainstack = 0; /* actual work is done inside transfer */	1254	coro->next = coro_first;
907	coro->stack = 0;	1255	coro_first = coro;
908		1256
909	RETVAL = coro;	1257	coro->hv = hv = newHV ();
		1258	sv_magicext ((SV *)hv, 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro, 0)->mg_flags |= MGf_DUP;
		1259	RETVAL = sv_bless (newRV_noinc ((SV *)hv), gv_stashpv (klass, 1));
		1260
		1261	for (i = 1; i < items; i++)
		1262	av_push (coro->args, newSVsv (ST (i)));
		1263	}
910	OUTPUT:	1264	OUTPUT:
911	RETVAL	1265	RETVAL
912		1266
		1267	int
		1268	save (SV *coro, int new_save = -1)
		1269	CODE:
		1270	RETVAL = api_save (coro, new_save);
		1271	OUTPUT:
		1272	RETVAL
		1273
		1274	int
		1275	save_also (SV *coro_sv, int save_also)
		1276	CODE:
		1277	{
		1278	struct coro *coro = SvSTATE (coro_sv);
		1279	RETVAL = coro->save;
		1280	coro->save |= save_also;
		1281	}
		1282	OUTPUT:
		1283	RETVAL
		1284
913	void	1285	void
914	transfer(prev, next, flags)	1286	_set_stacklevel (...)
915	Coro::State_or_hashref prev	1287	ALIAS:
916	Coro::State_or_hashref next	1288	Coro::State::transfer = 1
917	int flags	1289	Coro::schedule = 2
918	PROTOTYPE: @	1290	Coro::cede = 3
		1291	Coro::cede_notself = 4
919	CODE:	1292	CODE:
920	PUTBACK;	1293	{
921	transfer (aTHX_ prev, next, flags);	1294	struct transfer_args ta;
922	SPAGAIN;	1295
		1296	switch (ix)
		1297	{
		1298	case 0:
		1299	ta.prev = (struct coro *)INT2PTR (coro_cctx *, SvIV (ST (0)));
		1300	ta.next = 0;
		1301	break;
		1302
		1303	case 1:
		1304	if (items != 2)
		1305	croak ("Coro::State::transfer (prev,next) expects two arguments, not %d", items);
		1306
		1307	prepare_transfer (aTHX_ &ta, ST (0), ST (1));
		1308	break;
		1309
		1310	case 2:
		1311	prepare_schedule (aTHX_ &ta);
		1312	break;
		1313
		1314	case 3:
		1315	prepare_cede (aTHX_ &ta);
		1316	break;
		1317
		1318	case 4:
		1319	if (!prepare_cede_notself (aTHX_ &ta))
		1320	XSRETURN_EMPTY;
		1321
		1322	break;
		1323	}
		1324
		1325	BARRIER;
		1326	TRANSFER (ta);
		1327
		1328	if (GIMME_V != G_VOID && ta.next != ta.prev)
		1329	XSRETURN_YES;
		1330	}
		1331
		1332	bool
		1333	_destroy (SV *coro_sv)
		1334	CODE:
		1335	RETVAL = coro_state_destroy (aTHX_ SvSTATE (coro_sv));
		1336	OUTPUT:
		1337	RETVAL
923		1338
924	void	1339	void
925	DESTROY(coro)
926	Coro::State coro
927	CODE:
928
929	if (coro->mainstack && coro->mainstack != main_mainstack)
930	{
931	struct coro temp;
932
933	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
934	LOAD(aTHX_ coro);
935
936	destroy_stacks (aTHX);
937
938	LOAD((&temp)); /* this will get rid of defsv etc.. */
939
940	coro->mainstack = 0;
941	}
942
943	deallocate_stack (coro);
944
945	Safefree (coro);
946
947	void
948	flush()
949	CODE:
950	#ifdef MAY_FLUSH
951	flush_padlist_cache ();
952	#endif
953
954	void
955	_exit(code)	1340	_exit (code)
956	int code	1341	int code
957	PROTOTYPE: $	1342	PROTOTYPE: $
958	CODE:	1343	CODE:
959	#if defined(__GLIBC__) || _POSIX_C_SOURCE
960	_exit (code);	1344	_exit (code);
961	#else
962	signal (SIGTERM, SIG_DFL);
963	raise (SIGTERM);
964	exit (code);
965	#endif
966		1345
967	MODULE = Coro::State PACKAGE = Coro::Cont	1346	int
		1347	cctx_stacksize (int new_stacksize = 0)
		1348	CODE:
		1349	RETVAL = coro_stacksize;
		1350	if (new_stacksize)
		1351	coro_stacksize = new_stacksize;
		1352	OUTPUT:
		1353	RETVAL
968		1354
969	# this is slightly dirty (should expose a c-level api)	1355	int
		1356	cctx_count ()
		1357	CODE:
		1358	RETVAL = cctx_count;
		1359	OUTPUT:
		1360	RETVAL
		1361
		1362	int
		1363	cctx_idle ()
		1364	CODE:
		1365	RETVAL = cctx_idle;
		1366	OUTPUT:
		1367	RETVAL
970		1368
971	void	1369	void
972	yield(...)	1370	list ()
973	PROTOTYPE: @	1371	PPCODE:
		1372	{
		1373	struct coro *coro;
		1374	for (coro = coro_first; coro; coro = coro->next)
		1375	if (coro->hv)
		1376	XPUSHs (sv_2mortal (newRV_inc ((SV *)coro->hv)));
		1377	}
		1378
		1379	void
		1380	_eval (Coro::State coro, SV *coderef)
		1381	CODE:
		1382	{
		1383	if (coro->mainstack)
		1384	{
		1385	struct coro temp;
		1386	Zero (&temp, 1, struct coro);
		1387	temp.save = CORO_SAVE_ALL;
		1388
		1389	if (!(coro->flags & CF_RUNNING))
		1390	{
		1391	save_perl (aTHX_ &temp);
		1392	load_perl (aTHX_ coro);
		1393	}
		1394
		1395	{
		1396	dSP;
		1397	ENTER;
		1398	SAVETMPS;
		1399	PUSHMARK (SP);
		1400	PUTBACK;
		1401	call_sv (coderef, G_KEEPERR | G_EVAL | G_VOID | G_DISCARD);
		1402	SPAGAIN;
		1403	FREETMPS;
		1404	LEAVE;
		1405	PUTBACK;
		1406	}
		1407
		1408	if (!(coro->flags & CF_RUNNING))
		1409	{
		1410	save_perl (aTHX_ coro);
		1411	load_perl (aTHX_ &temp);
		1412	}
		1413	}
		1414	}
		1415
		1416	SV *
		1417	is_ready (Coro::State coro)
		1418	PROTOTYPE: $
		1419	ALIAS:
		1420	is_ready = CF_READY
		1421	is_running = CF_RUNNING
		1422	is_new = CF_NEW
		1423	is_destroyed = CF_DESTROYED
		1424	CODE:
		1425	RETVAL = boolSV (coro->flags & ix);
		1426	OUTPUT:
		1427	RETVAL
		1428
		1429	IV
		1430	rss (Coro::State coro)
		1431	PROTOTYPE: $
974	CODE:	1432	CODE:
975	static SV *returnstk;	1433	RETVAL = coro_rss (coro);
976	SV *sv;	1434	OUTPUT:
977	AV *defav = GvAV (PL_defgv);	1435	RETVAL
978	struct coro *prev, *next;
979		1436
980	if (!returnstk)
981	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
982
983	/* set up @_ -- ugly */
984	av_clear (defav);
985	av_fill (defav, items - 1);
986	while (items--)
987	av_store (defav, items, SvREFCNT_inc (ST(items)));
988
989	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
990	sv = av_pop ((AV *)SvRV (returnstk));
991	prev = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 0, 0)));
992	next = (struct coro *)SvIV ((SV*)SvRV (*av_fetch ((AV *)SvRV (sv), 1, 0)));
993	SvREFCNT_dec (sv);
994
995	transfer(aTHX_ prev, next, 0);
996		1437
997	MODULE = Coro::State PACKAGE = Coro	1438	MODULE = Coro::State PACKAGE = Coro
998		1439
999	# this is slightly dirty (should expose a c-level api)
1000
1001	BOOT:	1440	BOOT:
1002	{	1441	{
1003	int i;	1442	int i;
		1443
1004	HV *stash = gv_stashpv ("Coro", TRUE);	1444	coro_stash = gv_stashpv ("Coro", TRUE);
1005		1445
1006	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));	1446	newCONSTSUB (coro_stash, "PRIO_MAX", newSViv (PRIO_MAX));
1007	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));	1447	newCONSTSUB (coro_stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
1008	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));	1448	newCONSTSUB (coro_stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
1009	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));	1449	newCONSTSUB (coro_stash, "PRIO_LOW", newSViv (PRIO_LOW));
1010	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));	1450	newCONSTSUB (coro_stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
1011	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));	1451	newCONSTSUB (coro_stash, "PRIO_MIN", newSViv (PRIO_MIN));
1012		1452
1013	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);	1453	coro_current = get_sv ("Coro::current", FALSE);
1014	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);	1454	SvREADONLY_on (coro_current);
1015		1455
1016	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )	1456	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
1017	coro_ready[i] = newAV ();	1457	coro_ready[i] = newAV ();
		1458
		1459	{
		1460	SV *sv = perl_get_sv("Coro::API", 1);
		1461
		1462	coroapi.schedule = api_schedule;
		1463	coroapi.save = api_save;
		1464	coroapi.cede = api_cede;
		1465	coroapi.cede_notself = api_cede_notself;
		1466	coroapi.ready = api_ready;
		1467	coroapi.is_ready = api_is_ready;
		1468	coroapi.nready = &coro_nready;
		1469	coroapi.current = coro_current;
		1470
		1471	GCoroAPI = &coroapi;
		1472	sv_setiv (sv, (IV)&coroapi);
		1473	SvREADONLY_on (sv);
		1474	}
1018	}	1475	}
1019		1476
1020	void	1477	void
1021	ready(self)	1478	_set_current (SV *current)
1022	SV * self	1479	PROTOTYPE: $
1023	CODE:	1480	CODE:
1024	api_ready (self);	1481	SvREFCNT_dec (SvRV (coro_current));
		1482	SvRV_set (coro_current, SvREFCNT_inc (SvRV (current)));
1025		1483
1026	int	1484	int
		1485	prio (Coro::State coro, int newprio = 0)
		1486	ALIAS:
		1487	nice = 1
		1488	CODE:
		1489	{
		1490	RETVAL = coro->prio;
		1491
		1492	if (items > 1)
		1493	{
		1494	if (ix)
		1495	newprio = coro->prio - newprio;
		1496
		1497	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
		1498	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
		1499
		1500	coro->prio = newprio;
		1501	}
		1502	}
		1503	OUTPUT:
		1504	RETVAL
		1505
		1506	SV *
		1507	ready (SV *self)
		1508	PROTOTYPE: $
		1509	CODE:
		1510	RETVAL = boolSV (api_ready (self));
		1511	OUTPUT:
		1512	RETVAL
		1513
		1514	int
1027	nready(...)	1515	nready (...)
1028	PROTOTYPE:	1516	PROTOTYPE:
1029	CODE:	1517	CODE:
1030	RETVAL = coro_nready;	1518	RETVAL = coro_nready;
1031	OUTPUT:	1519	OUTPUT:
1032	RETVAL	1520	RETVAL
1033		1521
		1522	MODULE = Coro::State PACKAGE = Coro::AIO
		1523
		1524	SV *
		1525	_get_state ()
		1526	CODE:
		1527	{
		1528	struct io_state *data;
		1529
		1530	RETVAL = newSV (sizeof (struct io_state));
		1531	data = (struct io_state *)SvPVX (RETVAL);
		1532	SvCUR_set (RETVAL, sizeof (struct io_state));
		1533	SvPOK_only (RETVAL);
		1534
		1535	data->errorno = errno;
		1536	data->laststype = PL_laststype;
		1537	data->laststatval = PL_laststatval;
		1538	data->statcache = PL_statcache;
		1539	}
		1540	OUTPUT:
		1541	RETVAL
		1542
1034	void	1543	void
1035	schedule(...)	1544	_set_state (char *data_)
1036	PROTOTYPE:	1545	PROTOTYPE: $
1037	ALIAS:
1038	cede = 1
1039	CODE:	1546	CODE:
1040	api_schedule (ix);	1547	{
		1548	struct io_state *data = (void *)data_;
1041		1549
		1550	errno = data->errorno;
		1551	PL_laststype = data->laststype;
		1552	PL_laststatval = data->laststatval;
		1553	PL_statcache = data->statcache;
		1554	}
		1555

Diff Legend

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