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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.63 by root, Mon Mar 21 14:35:22 2005 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs. Revision 1.63 by root, Mon Mar 21 14:35:22 2005 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.63 by root, Mon Mar 21 14:35:22 2005 UTC