ViewVC Help

View File | Revision Log | Show Annotations | Download File

/cvs/Coro/Coro/State.xs

Comparing Coro/Coro/State.xs (file contents):
Revision 1.24 by root, Tue Aug 14 14:56:22 2001 UTC vs.
Revision 1.143 by root, Wed Feb 28 11:43:03 2007 UTC

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

Diff Legend

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