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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.11 by root, Sat Jul 21 18:21:45 2001 UTC vs.
Revision 1.61 by root, Tue Aug 10 01:56:30 2004 UTC

…		…
		1	#define PERL_NO_GET_CONTEXT
		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	#if 1	7	#include "patchlevel.h"
6	# define CHK(x) (void *)0	8
		9	#if PATCHLEVEL < 6
		10	# ifndef PL_ppaddr
		11	# define PL_ppaddr ppaddr
		12	# endif
		13	# ifndef call_sv
		14	# define call_sv perl_call_sv
		15	# endif
		16	# ifndef get_sv
		17	# define get_sv perl_get_sv
		18	# endif
		19	# ifndef get_cv
		20	# define get_cv perl_get_cv
		21	# endif
		22	# ifndef IS_PADGV
		23	# define IS_PADGV(v) 0
		24	# endif
		25	# ifndef IS_PADCONST
		26	# define IS_PADCONST(v) 0
		27	# endif
		28	#endif
		29
		30	#include "libcoro/coro.c"
		31
		32	#include <signal.h>
		33
		34	#ifdef HAVE_MMAP
		35	# include <unistd.h>
		36	# include <sys/mman.h>
		37	# ifndef MAP_ANONYMOUS
		38	# ifdef MAP_ANON
		39	# define MAP_ANONYMOUS MAP_ANON
		40	# else
		41	# undef HAVE_MMAP
		42	# endif
		43	# endif
		44	#endif
		45
		46	#define SUB_INIT "Coro::State::initialize"
		47	#define UCORO_STATE "_coro_state"
		48
		49	/* The next macro should declare a variable stacklevel that contains and approximation
		50	* to the current C stack pointer. Its property is that it changes with each call
		51	* and should be unique. */
		52	#define dSTACKLEVEL void *stacklevel = &stacklevel
		53
		54	#define IN_DESTRUCT (PL_main_cv == Nullcv)
		55
		56	#define labs(l) ((l) >= 0 ? (l) : -(l))
		57
		58	#include "CoroAPI.h"
		59
		60	#ifdef USE_ITHREADS
		61	static perl_mutex coro_mutex;
		62	# define LOCK do { MUTEX_LOCK (&coro_mutex); } while (0)
		63	# define UNLOCK do { MUTEX_UNLOCK (&coro_mutex); } while (0)
7	#else	64	#else
8	# define CHK(x) if (!(x)) croak("FATAL, CHK: " #x)	65	# define LOCK 0
		66	# define UNLOCK 0
9	#endif	67	#endif
10		68
11	#define MAY_FLUSH /* increases codesize */	69	static struct CoroAPI coroapi;
		70	static AV main_mainstack; / used to differentiate between $main and others */
		71	static HV *coro_state_stash;
		72	static SV *ucoro_state_sv;
		73	static U32 ucoro_state_hash;
		74	static SV coro_mortal; / will be freed after next transfer */
12		75
13	#define SUB_INIT "Coro::State::initialize"	76	/* this is actually not only the c stack but also c registers etc... */
		77	typedef struct {
		78	int refcnt; /* pointer reference counter */
		79	int usecnt; /* shared by how many coroutines */
		80	int gencnt; /* generation counter */
14		81
15	#define SAVE_DEFAV 0x00000001	82	coro_context cctx;
16	#define SAVE_DEFSV 0x00000002
17	#define SAVE_ERRSV 0x00000004
18		83
19	#define SAVE_ALL -1	84	void *sptr;
		85	long ssize; /* positive == mmap, otherwise malloc */
		86	} coro_stack;
20		87
21	struct coro {	88	struct coro {
		89	/* the top-level JMPENV for each coroutine, needed to catch dies. */
		90	JMPENV start_env;
		91
		92	/* the optional C context */
		93	coro_stack *stack;
		94	void *cursp;
		95	int gencnt;
		96
22	/* optionally saved, might be zero */	97	/* optionally saved, might be zero */
23	AV *defav;	98	AV *defav;
24	SV *defsv;	99	SV *defsv;
25	SV *errsv;	100	SV *errsv;
26		101
27	/* saved global state not related to stacks */	102	/* saved global state not related to stacks */
28	U8 dowarn;	103	U8 dowarn;
		104	I32 in_eval;
29		105
30	/* the stacks and related info (callchain etc..) */	106	/* the stacks and related info (callchain etc..) */
31	PERL_SI *curstackinfo;	107	PERL_SI *curstackinfo;
32	AV *curstack;	108	AV *curstack;
33	AV *mainstack;	109	AV *mainstack;
34	SV **stack_sp;	110	SV **stack_sp;
35	OP *op;	111	OP *op;
36	SV **curpad;	112	SV **curpad;
		113	AV *comppad;
37	SV **stack_base;	114	SV **stack_base;
38	SV **stack_max;	115	SV **stack_max;
39	SV **tmps_stack;	116	SV **tmps_stack;
40	I32 tmps_floor;	117	I32 tmps_floor;
41	I32 tmps_ix;	118	I32 tmps_ix;
51	I32 savestack_max;	128	I32 savestack_max;
52	OP **retstack;	129	OP **retstack;
53	I32 retstack_ix;	130	I32 retstack_ix;
54	I32 retstack_max;	131	I32 retstack_max;
55	COP *curcop;	132	COP *curcop;
		133	JMPENV *top_env;
56		134
57	/* data associated with this coroutine (initial args) */	135	/* data associated with this coroutine (initial args) */
58	AV *args;	136	AV *args;
59	};	137	};
60		138
61	typedef struct coro *Coro__State;	139	typedef struct coro *Coro__State;
62	typedef struct coro *Coro__State_or_hashref;	140	typedef struct coro *Coro__State_or_hashref;
63		141
64	static HV *padlist_cache;
65
66	/* mostly copied from op.c:cv_clone2 */	142	/* mostly copied from op.c:cv_clone2 */
67	STATIC AV *	143	STATIC AV *
68	clone_padlist (AV *protopadlist)	144	clone_padlist (pTHX_ AV *protopadlist)
69	{	145	{
70	AV *av;	146	AV *av;
71	I32 ix;	147	I32 ix;
72	AV protopad_name = (AV ) * av_fetch (protopadlist, 0, FALSE);	148	AV protopad_name = (AV ) * av_fetch (protopadlist, 0, FALSE);
73	AV protopad = (AV ) * av_fetch (protopadlist, 1, FALSE);	149	AV protopad = (AV ) * av_fetch (protopadlist, 1, FALSE);
…		…
97	AvFLAGS (av) = AVf_REIFY;	173	AvFLAGS (av) = AVf_REIFY;
98		174
99	for (ix = fpad; ix > 0; ix--)	175	for (ix = fpad; ix > 0; ix--)
100	{	176	{
101	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;	177	SV *namesv = (ix <= fname) ? pname[ix] : Nullsv;
		178
102	if (namesv && namesv != &PL_sv_undef)	179	if (namesv && namesv != &PL_sv_undef)
103	{	180	{
104	char name = SvPVX (namesv); / XXX */	181	char name = SvPVX (namesv); / XXX */
		182
105	if (SvFLAGS (namesv) & SVf_FAKE \|\| *name == '&')	183	if (SvFLAGS (namesv) & SVf_FAKE \|\| *name == '&')
106	{ /* lexical from outside? */	184	{ /* lexical from outside? */
107	npad[ix] = SvREFCNT_inc (ppad[ix]);	185	npad[ix] = SvREFCNT_inc (ppad[ix]);
108	}	186	}
109	else	187	else
…		…
115	sv = (SV *) newAV ();	193	sv = (SV *) newAV ();
116	else if (*name == '%')	194	else if (*name == '%')
117	sv = (SV *) newHV ();	195	sv = (SV *) newHV ();
118	else	196	else
119	sv = NEWSV (0, 0);	197	sv = NEWSV (0, 0);
		198
		199	#ifdef SvPADBUSY
120	if (!SvPADBUSY (sv))	200	if (!SvPADBUSY (sv))
		201	#endif
121	SvPADMY_on (sv);	202	SvPADMY_on (sv);
		203
122	npad[ix] = sv;	204	npad[ix] = sv;
123	}	205	}
124	}	206	}
125	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))	207	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))
126	{	208	{
…		…
155	#endif	237	#endif
156		238
157	return newpadlist;	239	return newpadlist;
158	}	240	}
159		241
160	#ifdef MAY_FLUSH	242	STATIC void
161	STATIC AV *
162	free_padlist (AV *padlist)	243	free_padlist (pTHX_ AV *padlist)
163	{	244	{
164	/* may be during global destruction */	245	/* may be during global destruction */
165	if (SvREFCNT(padlist))	246	if (SvREFCNT (padlist))
166	{	247	{
167	I32 i = AvFILLp(padlist);	248	I32 i = AvFILLp (padlist);
168	while (i >= 0)	249	while (i >= 0)
169	{	250	{
170	SV **svp = av_fetch(padlist, i--, FALSE);	251	SV **svp = av_fetch (padlist, i--, FALSE);
171	SV sv = svp ? svp : Nullsv;
172	if (sv)	252	if (svp)
		253	{
		254	SV *sv;
		255	while (&PL_sv_undef != (sv = av_pop ((AV )svp)))
173	SvREFCNT_dec(sv);	256	SvREFCNT_dec (sv);
		257
		258	SvREFCNT_dec (*svp);
		259	}
174	}	260	}
175		261
176	SvREFCNT_dec((SV*)padlist);	262	SvREFCNT_dec ((SV*)padlist);
177	}	263	}
178	}	264	}
179	#endif	265
		266	STATIC int
		267	coro_cv_free (pTHX_ SV sv, MAGIC mg)
		268	{
		269	AV *padlist;
		270	AV av = (AV )mg->mg_obj;
		271
		272	/* casting is fun. */
		273	while (&PL_sv_undef != (SV )(padlist = (AV )av_pop (av)))
		274	free_padlist (aTHX_ padlist);
		275
		276	SvREFCNT_dec (av);
		277	}
		278
		279	#define PERL_MAGIC_coro PERL_MAGIC_ext
		280
		281	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
180		282
181	/* the next two functions merely cache the padlists */	283	/* the next two functions merely cache the padlists */
182	STATIC void	284	STATIC void
183	get_padlist (CV *cv)	285	get_padlist (pTHX_ CV *cv)
184	{	286	{
185	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 0);	287	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
186		288
187	if (he && AvFILLp ((AV )he) >= 0)	289	if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
188	CvPADLIST (cv) = (AV )av_pop ((AV )*he);	290	CvPADLIST (cv) = (AV )av_pop ((AV )mg->mg_obj);
189	else	291	else
190	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));	292	CvPADLIST (cv) = clone_padlist (aTHX_ CvPADLIST (cv));
191	}	293	}
192		294
193	STATIC void	295	STATIC void
194	put_padlist (CV *cv)	296	put_padlist (pTHX_ CV *cv)
195	{	297	{
196	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 1);	298	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
197		299
198	if (SvTYPE (*he) != SVt_PVAV)	300	if (!mg)
199	{	301	{
200	SvREFCNT_dec (*he);	302	sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
		303	mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
		304	mg->mg_virtual = &vtbl_coro;
201	he = (SV )newAV ();	305	mg->mg_obj = (SV *)newAV ();
202	}	306	}
203		307
204	av_push ((AV )he, (SV *)CvPADLIST (cv));	308	av_push ((AV )mg->mg_obj, (SV )CvPADLIST (cv));
205	}	309	}
206
207	#ifdef MAY_FLUSH
208	STATIC void
209	flush_padlist_cache ()
210	{
211	HV *hv = padlist_cache;
212	padlist_cache = newHV ();
213
214	if (hv_iterinit (hv))
215	{
216	HE *he;
217	AV *padlist;
218
219	while (!!(he = hv_iternext (hv)))
220	{
221	AV av = (AV )HeVAL(he);
222
223	/* casting is fun. */
224	while (&PL_sv_undef != (SV )(padlist = (AV )av_pop (av)))
225	free_padlist (padlist);
226	}
227	}
228
229	SvREFCNT_dec (hv);
230	}
231	#endif
232		310
233	#define SB do {	311	#define SB do {
234	#define SE } while (0)	312	#define SE } while (0)
235		313
236	#define LOAD(state) SB load_state(aTHX_ state); SPAGAIN; SE	314	#define LOAD(state) load_state(aTHX_ (state));
237	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ state,flags); SE	315	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
238		316
239	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE	317	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
240		318
241	static void	319	static void
242	load_state(pTHX_ Coro__State c)	320	load_state(pTHX_ Coro__State c)
243	{	321	{
244	PL_dowarn = c->dowarn;	322	PL_dowarn = c->dowarn;
		323	PL_in_eval = c->in_eval;
245		324
246	PL_curstackinfo = c->curstackinfo;	325	PL_curstackinfo = c->curstackinfo;
247	PL_curstack = c->curstack;	326	PL_curstack = c->curstack;
248	PL_mainstack = c->mainstack;	327	PL_mainstack = c->mainstack;
249	PL_stack_sp = c->stack_sp;	328	PL_stack_sp = c->stack_sp;
250	PL_op = c->op;	329	PL_op = c->op;
251	PL_curpad = c->curpad;	330	PL_curpad = c->curpad;
		331	PL_comppad = c->comppad;
252	PL_stack_base = c->stack_base;	332	PL_stack_base = c->stack_base;
253	PL_stack_max = c->stack_max;	333	PL_stack_max = c->stack_max;
254	PL_tmps_stack = c->tmps_stack;	334	PL_tmps_stack = c->tmps_stack;
255	PL_tmps_floor = c->tmps_floor;	335	PL_tmps_floor = c->tmps_floor;
256	PL_tmps_ix = c->tmps_ix;	336	PL_tmps_ix = c->tmps_ix;
…		…
266	PL_savestack_max = c->savestack_max;	346	PL_savestack_max = c->savestack_max;
267	PL_retstack = c->retstack;	347	PL_retstack = c->retstack;
268	PL_retstack_ix = c->retstack_ix;	348	PL_retstack_ix = c->retstack_ix;
269	PL_retstack_max = c->retstack_max;	349	PL_retstack_max = c->retstack_max;
270	PL_curcop = c->curcop;	350	PL_curcop = c->curcop;
		351	PL_top_env = c->top_env;
271		352
272	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);	353	if (c->defav) REPLACE_SV (GvAV (PL_defgv), c->defav);
273	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);	354	if (c->defsv) REPLACE_SV (DEFSV , c->defsv);
274	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);	355	if (c->errsv) REPLACE_SV (ERRSV , c->errsv);
275		356
…		…
282	{	363	{
283	AV padlist = (AV )POPs;	364	AV padlist = (AV )POPs;
284		365
285	if (padlist)	366	if (padlist)
286	{	367	{
287	put_padlist (cv); /* mark this padlist as available */	368	put_padlist (aTHX_ cv); /* mark this padlist as available */
288	CvPADLIST(cv) = padlist;	369	CvPADLIST(cv) = padlist;
289	#ifdef USE_THREADS
290	/CvOWNER(cv) = (struct perl_thread )POPs;*/
291	#endif
292	}	370	}
293		371
294	++CvDEPTH(cv);	372	++CvDEPTH(cv);
295	}	373	}
296		374
…		…
314		392
315	PUSHs (Nullsv);	393	PUSHs (Nullsv);
316	/* this loop was inspired by pp_caller */	394	/* this loop was inspired by pp_caller */
317	for (;;)	395	for (;;)
318	{	396	{
319	do	397	while (cxix >= 0)
320	{	398	{
321	PERL_CONTEXT *cx = &ccstk[cxix--];	399	PERL_CONTEXT *cx = &ccstk[cxix--];
322		400
323	if (CxTYPE(cx) == CXt_SUB)	401	if (CxTYPE(cx) == CXt_SUB)
324	{	402	{
325	CV *cv = cx->blk_sub.cv;	403	CV *cv = cx->blk_sub.cv;
326	if (CvDEPTH(cv))	404	if (CvDEPTH(cv))
327	{	405	{
328	#ifdef USE_THREADS
329	/XPUSHs ((SV )CvOWNER(cv));*/
330	/CvOWNER(cv) = 0;/
331	/error must unlock this cv etc.. etc.../
332	#endif
333	EXTEND (SP, CvDEPTH(cv)*2);	406	EXTEND (SP, CvDEPTH(cv)*2);
334		407
335	while (--CvDEPTH(cv))	408	while (--CvDEPTH(cv))
336	{	409	{
337	/* this tells the restore code to increment CvDEPTH */	410	/* this tells the restore code to increment CvDEPTH */
…		…
340	}	413	}
341		414
342	PUSHs ((SV *)CvPADLIST(cv));	415	PUSHs ((SV *)CvPADLIST(cv));
343	PUSHs ((SV *)cv);	416	PUSHs ((SV *)cv);
344		417
345	get_padlist (cv); /* this is a monster */	418	get_padlist (aTHX_ cv); /* this is a monster */
346	}	419	}
347	}	420	}
		421	#ifdef CXt_FORMAT
348	else if (CxTYPE(cx) == CXt_FORMAT)	422	else if (CxTYPE(cx) == CXt_FORMAT)
349	{	423	{
350	/* I never used formats, so how should I know how these are implemented? */	424	/* I never used formats, so how should I know how these are implemented? */
351	/* my bold guess is as a simple, plain sub... */	425	/* my bold guess is as a simple, plain sub... */
352	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");	426	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
353	}	427	}
		428	#endif
354	}	429	}
355	while (cxix >= 0);
356		430
357	if (top_si->si_type == PERLSI_MAIN)	431	if (top_si->si_type == PERLSI_MAIN)
358	break;	432	break;
359		433
360	top_si = top_si->si_prev;	434	top_si = top_si->si_prev;
…		…
363	}	437	}
364		438
365	PUTBACK;	439	PUTBACK;
366	}	440	}
367		441
368	c->defav = flags & SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;	442	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
369	c->defsv = flags & SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	443	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
370	c->errsv = flags & SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;	444	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
371
372	/* I have not the slightest idea of why av_reify is necessary */
373	/* but if it's missing the defav contents magically get replaced sometimes */
374	if (c->defav)
375	av_reify (c->defav);
376		445
377	c->dowarn = PL_dowarn;	446	c->dowarn = PL_dowarn;
		447	c->in_eval = PL_in_eval;
378		448
379	c->curstackinfo = PL_curstackinfo;	449	c->curstackinfo = PL_curstackinfo;
380	c->curstack = PL_curstack;	450	c->curstack = PL_curstack;
381	c->mainstack = PL_mainstack;	451	c->mainstack = PL_mainstack;
382	c->stack_sp = PL_stack_sp;	452	c->stack_sp = PL_stack_sp;
383	c->op = PL_op;	453	c->op = PL_op;
384	c->curpad = PL_curpad;	454	c->curpad = PL_curpad;
		455	c->comppad = PL_comppad;
385	c->stack_base = PL_stack_base;	456	c->stack_base = PL_stack_base;
386	c->stack_max = PL_stack_max;	457	c->stack_max = PL_stack_max;
387	c->tmps_stack = PL_tmps_stack;	458	c->tmps_stack = PL_tmps_stack;
388	c->tmps_floor = PL_tmps_floor;	459	c->tmps_floor = PL_tmps_floor;
389	c->tmps_ix = PL_tmps_ix;	460	c->tmps_ix = PL_tmps_ix;
…		…
399	c->savestack_max = PL_savestack_max;	470	c->savestack_max = PL_savestack_max;
400	c->retstack = PL_retstack;	471	c->retstack = PL_retstack;
401	c->retstack_ix = PL_retstack_ix;	472	c->retstack_ix = PL_retstack_ix;
402	c->retstack_max = PL_retstack_max;	473	c->retstack_max = PL_retstack_max;
403	c->curcop = PL_curcop;	474	c->curcop = PL_curcop;
		475	c->top_env = PL_top_env;
		476	}
		477
		478	/*
		479	* allocate various perl stacks. This is an exact copy
		480	* of perl.c:init_stacks, except that it uses less memory
		481	* on the (sometimes correct) assumption that coroutines do
		482	* not usually need a lot of stackspace.
		483	*/
		484	STATIC void
		485	coro_init_stacks (pTHX)
		486	{
		487	LOCK;
		488
		489	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
		490	PL_curstackinfo->si_type = PERLSI_MAIN;
		491	PL_curstack = PL_curstackinfo->si_stack;
		492	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
		493
		494	PL_stack_base = AvARRAY(PL_curstack);
		495	PL_stack_sp = PL_stack_base;
		496	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
		497
		498	New(50,PL_tmps_stack,96,SV*);
		499	PL_tmps_floor = -1;
		500	PL_tmps_ix = -1;
		501	PL_tmps_max = 96;
		502
		503	New(54,PL_markstack,16,I32);
		504	PL_markstack_ptr = PL_markstack;
		505	PL_markstack_max = PL_markstack + 16;
		506
		507	#ifdef SET_MARK_OFFSET
		508	SET_MARK_OFFSET;
		509	#endif
		510
		511	New(54,PL_scopestack,16,I32);
		512	PL_scopestack_ix = 0;
		513	PL_scopestack_max = 16;
		514
		515	New(54,PL_savestack,96,ANY);
		516	PL_savestack_ix = 0;
		517	PL_savestack_max = 96;
		518
		519	New(54,PL_retstack,8,OP*);
		520	PL_retstack_ix = 0;
		521	PL_retstack_max = 8;
		522
		523	UNLOCK;
404	}	524	}
405		525
406	/*	526	/*
407	* destroy the stacks, the callchain etc...	527	* destroy the stacks, the callchain etc...
408	* still there is a memleak of 128 bytes...
409	*/	528	*/
410	STATIC void	529	STATIC void
411	destroy_stacks(pTHX)	530	destroy_stacks(pTHX)
412	{	531	{
		532	if (!IN_DESTRUCT)
		533	{
413	/* is this ugly, I ask? */	534	/* is this ugly, I ask? */
414	while (PL_scopestack_ix)	535	LEAVE_SCOPE (0);
415	LEAVE;
416		536
417	/* sure it is, but more important: is it correct?? :/ */	537	/* sure it is, but more important: is it correct?? :/ */
418	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
419	FREETMPS;	538	FREETMPS;
		539
		540	/POPSTACK_TO (PL_mainstack);//D//use/
		541	}
420		542
421	while (PL_curstackinfo->si_next)	543	while (PL_curstackinfo->si_next)
422	PL_curstackinfo = PL_curstackinfo->si_next;	544	PL_curstackinfo = PL_curstackinfo->si_next;
423		545
424	while (PL_curstackinfo)	546	while (PL_curstackinfo)
425	{	547	{
426	PERL_SI *p = PL_curstackinfo->si_prev;	548	PERL_SI *p = PL_curstackinfo->si_prev;
427		549
428	{	550	{ /D//remove/
429	dSP;	551	dSP;
430	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	552	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
431	PUTBACK; /* possibly superfluous */	553	PUTBACK; /* possibly superfluous */
432	}	554	}
433		555
434	dounwind(-1);	556	if (!IN_DESTRUCT)
435		557	{
		558	dounwind (-1);/D//remove/
436	SvREFCNT_dec(PL_curstackinfo->si_stack);	559	SvREFCNT_dec (PL_curstackinfo->si_stack);
		560	}
		561
437	Safefree(PL_curstackinfo->si_cxstack);	562	Safefree (PL_curstackinfo->si_cxstack);
438	Safefree(PL_curstackinfo);	563	Safefree (PL_curstackinfo);
439	PL_curstackinfo = p;	564	PL_curstackinfo = p;
440	}	565	}
441		566
442	Safefree(PL_tmps_stack);	567	Safefree (PL_tmps_stack);
443	Safefree(PL_markstack);	568	Safefree (PL_markstack);
444	Safefree(PL_scopestack);	569	Safefree (PL_scopestack);
445	Safefree(PL_savestack);	570	Safefree (PL_savestack);
446	Safefree(PL_retstack);	571	Safefree (PL_retstack);
		572	}
		573
		574	static void
		575	allocate_stack (Coro__State ctx, int alloc)
		576	{
		577	coro_stack *stack;
		578
		579	New (0, stack, 1, coro_stack);
		580
		581	stack->refcnt = 1;
		582	stack->usecnt = 1;
		583	stack->gencnt = ctx->gencnt = 0;
		584
		585	if (alloc)
		586	{
		587	#if HAVE_MMAP
		588	stack->ssize = 16384 * sizeof (long); /* mmap should do allocate-on-write for us */
		589	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
		590	if (stack->sptr == (void *)-1)
		591	#endif
		592	{
		593	/FIXME//D//* reasonable stack size! */
		594	stack->ssize = - (8192 * sizeof (long));
		595	New (0, stack->sptr, 8192, long);
		596	}
		597	}
		598	else
		599	stack->sptr = 0;
		600
		601	ctx->stack = stack;
		602	}
		603
		604	static void
		605	deallocate_stack (Coro__State ctx)
		606	{
		607	coro_stack *stack = ctx->stack;
		608
		609	ctx->stack = 0;
		610
		611	if (stack)
		612	{
		613	if (!--stack->refcnt)
		614	{
		615	#ifdef HAVE_MMAP
		616	if (stack->ssize > 0 && stack->sptr)
		617	munmap (stack->sptr, stack->ssize);
		618	else
		619	#endif
		620	Safefree (stack->sptr);
		621
		622	Safefree (stack);
		623	}
		624	else if (ctx->gencnt == stack->gencnt)
		625	--stack->usecnt;
		626	}
		627	}
		628
		629	static void
		630	setup_coro (void *arg)
		631	{
		632	/*
		633	* emulate part of the perl startup here.
		634	*/
		635	dTHX;
		636	dSP;
		637	Coro__State ctx = (Coro__State)arg;
		638	SV sub_init = (SV )get_cv (SUB_INIT, FALSE);
		639
		640	coro_init_stacks (aTHX);
		641	/PL_curcop = 0;/
		642	/PL_in_eval = PL_in_eval;/ /* inherit */
		643	SvREFCNT_dec (GvAV (PL_defgv));
		644	GvAV (PL_defgv) = ctx->args; ctx->args = 0;
		645
		646	SPAGAIN;
		647
		648	if (ctx->stack)
		649	{
		650	ctx->cursp = 0;
		651
		652	PUSHMARK(SP);
		653	PUTBACK;
		654	(void) call_sv (sub_init, G_VOID\|G_NOARGS\|G_EVAL);
		655
		656	if (SvTRUE (ERRSV))
		657	croak (NULL);
		658	else
		659	croak ("FATAL: CCTXT coroutine returned!");
		660	}
		661	else
		662	{
		663	UNOP myop;
		664
		665	PL_op = (OP *)&myop;
		666
		667	Zero(&myop, 1, UNOP);
		668	myop.op_next = Nullop;
		669	myop.op_flags = OPf_WANT_VOID;
		670
		671	PUSHMARK(SP);
		672	XPUSHs (sub_init);
		673	/*
		674	* the next line is slightly wrong, as PL_op->op_next
		675	* is actually being executed so we skip the first op.
		676	* that doesn't matter, though, since it is only
		677	* pp_nextstate and we never return...
		678	* ah yes, and I don't care anyways ;)
		679	*/
		680	PUTBACK;
		681	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
		682	SPAGAIN;
		683
		684	ENTER; /* necessary e.g. for dounwind */
		685	}
		686	}
		687
		688	static void
		689	continue_coro (void *arg)
		690	{
		691	/*
		692	* this is a _very_ stripped down perl interpreter ;)
		693	*/
		694	dTHX;
		695	Coro__State ctx = (Coro__State)arg;
		696	JMPENV coro_start_env;
		697
		698	PL_top_env = &ctx->start_env;
		699
		700	ctx->cursp = 0;
		701	PL_op = PL_op->op_next;
		702	CALLRUNOPS(aTHX);
		703
		704	abort ();
447	}	705	}
448		706
449	STATIC void	707	STATIC void
450	transfer(pTHX_ struct coro prev, struct coro next, int flags)	708	transfer (pTHX_ struct coro prev, struct coro next, int flags)
451	{	709	{
452	dSP;	710	dSTACKLEVEL;
453		711
454	if (prev != next)	712	if (prev != next)
455	{	713	{
456	/*
457	* this could be done in newprocess which would lead to
458	* extremely elegant and fast (just SAVE/LOAD)
459	* code here, but lazy allocation of stacks has also
460	* some virtues and the overhead of the if() is nil.
461	*/
462	if (next->mainstack)	714	if (next->mainstack)
463	{	715	{
		716	LOCK;
464	SAVE (prev, flags);	717	SAVE (prev, flags);
465	LOAD (next);	718	LOAD (next);
		719	UNLOCK;
		720
466	/* mark this state as in-use */	721	/* mark this state as in-use */
467	next->mainstack = 0;	722	next->mainstack = 0;
468	next->tmps_ix = -2;	723	next->tmps_ix = -2;
		724
		725	/* stacklevel changed? if yes, grab the stack for us! */
		726	if (flags & TRANSFER_SAVE_CCTXT)
		727	{
		728	if (!prev->stack)
		729	allocate_stack (prev, 0);
		730	else if (prev->cursp != stacklevel
		731	&& prev->stack->usecnt > 1)
		732	{
		733	prev->gencnt = ++prev->stack->gencnt;
		734	prev->stack->usecnt = 1;
		735	}
		736
		737	/* has our stack been invalidated? */
		738	if (next->stack && next->stack->gencnt != next->gencnt)
		739	{
		740	deallocate_stack (next);
		741	allocate_stack (next, 1);
		742	coro_create (&(next->stack->cctx),
		743	continue_coro, (void *)next,
		744	next->stack->sptr, labs (next->stack->ssize));
		745	}
		746
		747	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		748	prev->cursp = stacklevel;
		749	/* don't add any code here */
		750	}
		751	else
		752	next->cursp = stacklevel;
469	}	753	}
470	else if (next->tmps_ix == -2)	754	else if (next->tmps_ix == -2)
471	{
472	croak ("tried to transfer to running coroutine");	755	croak ("tried to transfer to running coroutine");
473	}
474	else	756	else
475	{	757	{
476	/*	758	LOCK;
477	* emulate part of the perl startup here.
478	*/
479	UNOP myop;
480
481	SAVE (prev, -1); /* first get rid of the old state */	759	SAVE (prev, -1); /* first get rid of the old state */
		760	UNLOCK;
482		761
483	init_stacks (); /* from perl.c */	762	if (flags & TRANSFER_SAVE_CCTXT)
484	SPAGAIN;
485
486	PL_op = (OP *)&myop;
487	/PL_curcop = 0;/
488	SvREFCNT_dec (GvAV (PL_defgv));
489	GvAV (PL_defgv) = next->args;
490
491	Zero(&myop, 1, UNOP);
492	myop.op_next = Nullop;
493	myop.op_flags = OPf_WANT_VOID;
494
495	PUSHMARK(SP);
496	XPUSHs ((SV*)get_cv(SUB_INIT, TRUE));
497	/*
498	* the next line is slightly wrong, as PL_op->op_next
499	* is actually being executed so we skip the first op.
500	* that doesn't matter, though, since it is only
501	* pp_nextstate and we never return...
502	* ah yes, and I don't care anyways ;)
503	*/	763	{
504	PUTBACK;	764	if (!prev->stack)
505	PL_op = pp_entersub(aTHX);	765	allocate_stack (prev, 0);
506	SPAGAIN;
507		766
508	ENTER; /* necessary e.g. for dounwind */	767	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
		768	{
		769	PL_top_env = &next->start_env;
		770
		771	setup_coro (next);
		772	next->cursp = stacklevel;
		773
		774	prev->stack->refcnt++;
		775	prev->stack->usecnt++;
		776	next->stack = prev->stack;
		777	next->gencnt = prev->gencnt;
		778	}
		779	else
		780	{
		781	assert (!next->stack);
		782	allocate_stack (next, 1);
		783	coro_create (&(next->stack->cctx),
		784	setup_coro, (void *)next,
		785	next->stack->sptr, labs (next->stack->ssize));
		786	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		787	prev->cursp = stacklevel;
		788	/* don't add any code here */
		789	}
		790	}
		791	else
		792	{
		793	setup_coro (next);
		794	next->cursp = stacklevel;
		795	}
509	}	796	}
510	}	797	}
		798
		799	LOCK;
		800	if (coro_mortal)
		801	{
		802	SvREFCNT_dec (coro_mortal);
		803	coro_mortal = 0;
		804	}
		805	UNLOCK;
		806	}
		807
		808	#define SV_CORO(sv,func) \
		809	do { \
		810	if (SvROK (sv)) \
		811	sv = SvRV (sv); \
		812	\
		813	if (SvTYPE (sv) == SVt_PVHV) \
		814	{ \
		815	HE he = hv_fetch_ent ((HV )sv, ucoro_state_sv, 0, ucoro_state_hash); \
		816	\
		817	if (!he) \
		818	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
		819	\
		820	(sv) = SvRV (HeVAL(he)); \
		821	} \
		822	\
		823	/* must also be changed inside Coro::Cont::yield */ \
		824	if (!SvOBJECT (sv) \|\| SvSTASH (sv) != coro_state_stash) \
		825	croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
		826	\
		827	} while(0)
		828
		829	#define SvSTATE(sv) (struct coro *)SvIV (sv)
		830
		831	static void
		832	api_transfer(pTHX_ SV prev, SV next, int flags)
		833	{
		834	SV_CORO (prev, "Coro::transfer");
		835	SV_CORO (next, "Coro::transfer");
		836
		837	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
		838	}
		839
		840	/ Coro ******************************************************************/
		841
		842	#define PRIO_MAX 3
		843	#define PRIO_HIGH 1
		844	#define PRIO_NORMAL 0
		845	#define PRIO_LOW -1
		846	#define PRIO_IDLE -3
		847	#define PRIO_MIN -4
		848
		849	/* for Coro.pm */
		850	static GV coro_current, coro_idle;
		851	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
		852	static int coro_nready;
		853
		854	static void
		855	coro_enq (pTHX_ SV *sv)
		856	{
		857	if (SvTYPE (sv) == SVt_PVHV)
		858	{
		859	SV *xprio = hv_fetch ((HV )sv, "prio", 4, 0);
		860	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
		861
		862	prio = prio > PRIO_MAX ? PRIO_MAX
		863	: prio < PRIO_MIN ? PRIO_MIN
		864	: prio;
		865
		866	av_push (coro_ready [prio - PRIO_MIN], sv);
		867	coro_nready++;
		868
		869	return;
		870	}
		871
		872	croak ("Coro::ready tried to enqueue something that is not a coroutine");
		873	}
		874
		875	static SV *
		876	coro_deq (pTHX_ int min_prio)
		877	{
		878	int prio = PRIO_MAX - PRIO_MIN;
		879
		880	min_prio -= PRIO_MIN;
		881	if (min_prio < 0)
		882	min_prio = 0;
		883
		884	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
		885	if (av_len (coro_ready[prio]) >= 0)
		886	{
		887	coro_nready--;
		888	return av_shift (coro_ready[prio]);
		889	}
		890
		891	return 0;
		892	}
		893
		894	static void
		895	api_ready (SV *coro)
		896	{
		897	dTHX;
		898
		899	if (SvROK (coro))
		900	coro = SvRV (coro);
		901
		902	LOCK;
		903	coro_enq (aTHX_ SvREFCNT_inc (coro));
		904	UNLOCK;
		905	}
		906
		907	static void
		908	api_schedule (void)
		909	{
		910	dTHX;
		911
		912	SV prev, next;
		913
		914	LOCK;
		915
		916	prev = SvRV (GvSV (coro_current));
		917	next = coro_deq (aTHX_ PRIO_MIN);
		918
		919	if (!next)
		920	next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
		921
		922	/* free this only after the transfer */
		923	coro_mortal = prev;
		924	SV_CORO (prev, "Coro::schedule");
		925
		926	SvRV (GvSV (coro_current)) = next;
		927
		928	SV_CORO (next, "Coro::schedule");
		929
		930	UNLOCK;
		931
		932	transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
		933	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);
		934	}
		935
		936	static void
		937	api_cede (void)
		938	{
		939	dTHX;
		940
		941	LOCK;
		942	coro_enq (aTHX_ SvREFCNT_inc (SvRV (GvSV (coro_current))));
		943	UNLOCK;
		944
		945	api_schedule ();
511	}	946	}
512		947
513	MODULE = Coro::State PACKAGE = Coro::State	948	MODULE = Coro::State PACKAGE = Coro::State
514		949
515	PROTOTYPES: ENABLE	950	PROTOTYPES: ENABLE
516		951
517	BOOT:	952	BOOT:
518	{ /* {} necessary for stoopid perl-5.6.x */	953	{ /* {} necessary for stoopid perl-5.6.x */
		954	#ifdef USE_ITHREADS
		955	MUTEX_INIT (&coro_mutex);
		956	#endif
		957
		958	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
		959	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
519	HV * stash = gv_stashpvn("Coro::State", 10, TRUE);	960	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
520		961
521	newCONSTSUB (stash, "SAVE_DEFAV", newSViv (SAVE_DEFAV));	962	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
522	newCONSTSUB (stash, "SAVE_DEFSV", newSViv (SAVE_DEFSV));	963	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
523	newCONSTSUB (stash, "SAVE_ERRSV", newSViv (SAVE_ERRSV));	964	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
		965	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
524		966
525	if (!padlist_cache)	967	main_mainstack = PL_mainstack;
526	padlist_cache = newHV ();	968
		969	coroapi.ver = CORO_API_VERSION;
		970	coroapi.transfer = api_transfer;
527	}	971	}
528		972
529	Coro::State	973	Coro::State
530	_newprocess(args)	974	_newprocess(args)
531	SV * args	975	SV * args
…		…
534	Coro__State coro;	978	Coro__State coro;
535		979
536	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)	980	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
537	croak ("Coro::State::_newprocess expects an arrayref");	981	croak ("Coro::State::_newprocess expects an arrayref");
538		982
539	New (0, coro, 1, struct coro);	983	Newz (0, coro, 1, struct coro);
540		984
541	coro->mainstack = 0; /* actual work is done inside transfer */
542	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	985	coro->args = (AV *)SvREFCNT_inc (SvRV (args));
		986	/coro->mainstack = 0; //actual work is done inside transfer /
		987	/coro->stack = 0;/
		988
		989	/* same as JMPENV_BOOTSTRAP */
		990	/* we might be able to recycle start_env, but safe is safe */
		991	/Zero(&coro->start_env, 1, JMPENV);/
		992	coro->start_env.je_ret = -1;
		993	coro->start_env.je_mustcatch = TRUE;
543		994
544	RETVAL = coro;	995	RETVAL = coro;
545	OUTPUT:	996	OUTPUT:
546	RETVAL	997	RETVAL
547		998
548	void	999	void
549	transfer(prev, next, flags = SAVE_ALL)	1000	transfer(prev, next, flags)
550	Coro::State_or_hashref prev	1001	SV *prev
551	Coro::State_or_hashref next	1002	SV *next
552	int flags	1003	int flags
553	PROTOTYPE: @	1004	PROTOTYPE: @
554	CODE:	1005	CODE:
555		1006	PUTBACK;
		1007	SV_CORO (next, "Coro::transfer");
		1008	SV_CORO (prev, "Coro::transfer");
556	transfer (aTHX_ prev, next, flags);	1009	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
		1010	SPAGAIN;
557		1011
558	void	1012	void
559	DESTROY(coro)	1013	DESTROY(coro)
560	Coro::State coro	1014	Coro::State coro
561	CODE:	1015	CODE:
562		1016
563	if (coro->mainstack)	1017	if (coro->mainstack && coro->mainstack != main_mainstack)
564	{	1018	{
565	struct coro temp;	1019	struct coro temp;
566		1020
		1021	PUTBACK;
567	SAVE(aTHX_ (&temp), SAVE_ALL);	1022	SAVE (aTHX_ (&temp), TRANSFER_SAVE_ALL);
568	LOAD(aTHX_ coro);	1023	LOAD (aTHX_ coro);
		1024	SPAGAIN;
569		1025
570	destroy_stacks ();	1026	destroy_stacks (aTHX);
571		1027
572	LOAD((&temp)); /* this will get rid of defsv etc.. */	1028	LOAD ((&temp)); /* this will get rid of defsv etc.. */
		1029	SPAGAIN;
		1030
		1031	coro->mainstack = 0;
573	}	1032	}
574		1033
		1034	deallocate_stack (coro);
		1035	SvREFCNT_dec (coro->args);
575	Safefree (coro);	1036	Safefree (coro);
576		1037
577	void	1038	void
578	flush()	1039	_exit(code)
		1040	int code
		1041	PROTOTYPE: $
579	CODE:	1042	CODE:
580	#ifdef MAY_FLUSH	1043	_exit (code);
581	flush_padlist_cache ();
582	#endif
583		1044
584	MODULE = Coro::State PACKAGE = Coro::Cont	1045	MODULE = Coro::State PACKAGE = Coro::Cont
585		1046
586	# this is dirty (do you hear me?) and should be in it's own .xs	1047	# this is slightly dirty (should expose a c-level api)
587		1048
588	void	1049	void
589	result(...)	1050	yield(...)
590	PROTOTYPE: @	1051	PROTOTYPE: @
591	CODE:	1052	CODE:
592	static SV *returnstk;	1053	static SV *returnstk;
593	SV *sv;	1054	SV *sv;
594	AV *defav = GvAV (PL_defgv);	1055	AV *defav = GvAV (PL_defgv);
595	struct coro prev, next;	1056	struct coro prev, next;
596		1057
597	if (!returnstk)	1058	if (!returnstk)
598	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1059	returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
599		1060
600	/* set up @_ -- ugly */	1061	/* set up @_ -- ugly */
601	av_clear (defav);	1062	av_clear (defav);
602	av_fill (defav, items - 1);	1063	av_fill (defav, items - 1);
603	while (items--)	1064	while (items--)
604	av_store (defav, items, SvREFCNT_inc (ST(items)));	1065	av_store (defav, items, SvREFCNT_inc (ST(items)));
605		1066
606	mg_get (returnstk); /* isn't documentation wrong for mg_get? */	1067	SvGETMAGIC (returnstk); /* isn't documentation wrong for mg_get? */
607	sv = av_pop ((AV *)SvRV (returnstk));	1068	sv = av_pop ((AV *)SvRV (returnstk));
608	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));	1069	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));
609	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));	1070	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));
610	SvREFCNT_dec (sv);	1071	SvREFCNT_dec (sv);
		1072
611	transfer(prev, next, 0);	1073	transfer (aTHX_ prev, next, 0);
612		1074
		1075	MODULE = Coro::State PACKAGE = Coro
		1076
		1077	# this is slightly dirty (should expose a c-level api)
		1078
		1079	BOOT:
		1080	{
		1081	int i;
		1082	HV *stash = gv_stashpv ("Coro", TRUE);
		1083
		1084	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
		1085	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
		1086	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
		1087	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
		1088	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
		1089	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
		1090
		1091	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
		1092	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
		1093
		1094	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
		1095	coro_ready[i] = newAV ();
		1096
		1097	{
		1098	SV *sv = perl_get_sv("Coro::API", 1);
		1099
		1100	coroapi.schedule = api_schedule;
		1101	coroapi.cede = api_cede;
		1102	coroapi.ready = api_ready;
		1103	coroapi.nready = &coro_nready;
		1104	coroapi.current = coro_current;
		1105
		1106	GCoroAPI = &coroapi;
		1107	sv_setiv(sv, (IV)&coroapi);
		1108	SvREADONLY_on(sv);
		1109	}
		1110	}
		1111
		1112	#if !PERL_MICRO
		1113
		1114	void
		1115	ready(self)
		1116	SV * self
		1117	PROTOTYPE: $
		1118	CODE:
		1119	api_ready (self);
		1120
		1121	#endif
		1122
		1123	int
		1124	nready(...)
		1125	PROTOTYPE:
		1126	CODE:
		1127	RETVAL = coro_nready;
		1128	OUTPUT:
		1129	RETVAL
		1130
		1131	void
		1132	schedule(...)
		1133	PROTOTYPE:
		1134	CODE:
		1135	api_schedule ();
		1136
		1137	void
		1138	cede(...)
		1139	PROTOTYPE:
		1140	CODE:
		1141	api_cede ();
		1142

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.11 by root, Sat Jul 21 18:21:45 2001 UTC vs. Revision 1.61 by root, Tue Aug 10 01:56:30 2004 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.11 by root, Sat Jul 21 18:21:45 2001 UTC vs.
Revision 1.61 by root, Tue Aug 10 01:56:30 2004 UTC