[ViewVC] Diff of: cvs/Coro/Coro/State.xs

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.23 by root, Tue Aug 14 04:33:58 2001 UTC vs. Revision 1.139 by root, Sun Jan 14 21:13:41 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.23 by root, Tue Aug 14 04:33:58 2001 UTC vs.
Revision 1.139 by root, Sun Jan 14 21:13:41 2007 UTC