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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.36 by root, Fri Oct 5 14:20:10 2001 UTC vs.
Revision 1.52 by pcg, Sun Nov 30 22:49:25 2003 UTC

…		…
1	#include "EXTERN.h"	1	#include "EXTERN.h"
2	#include "perl.h"	2	#include "perl.h"
3	#include "XSUB.h"	3	#include "XSUB.h"
		4
		5	#include "patchlevel.h"
		6
		7	#if PATCHLEVEL < 6
		8	# ifndef PL_ppaddr
		9	# define PL_ppaddr ppaddr
		10	# endif
		11	# ifndef call_sv
		12	# define call_sv perl_call_sv
		13	# endif
		14	# ifndef get_sv
		15	# define get_sv perl_get_sv
		16	# endif
		17	# ifndef get_cv
		18	# define get_cv perl_get_cv
		19	# endif
		20	# ifndef IS_PADGV
		21	# define IS_PADGV(v) 0
		22	# endif
		23	# ifndef IS_PADCONST
		24	# define IS_PADCONST(v) 0
		25	# endif
		26	#endif
4		27
5	#include "libcoro/coro.c"	28	#include "libcoro/coro.c"
6		29
7	#include <signal.h>	30	#include <signal.h>
8		31
16	# undef HAVE_MMAP	39	# undef HAVE_MMAP
17	# endif	40	# endif
18	# endif	41	# endif
19	#endif	42	#endif
20		43
21	#define MAY_FLUSH /* increases codesize and is rarely used */
22
23	#define SUB_INIT "Coro::State::initialize"	44	#define SUB_INIT "Coro::State::initialize"
24	#define UCORO_STATE "_coro_state"	45	#define UCORO_STATE "_coro_state"
25		46
26	/* The next macro should declare a variable stacklevel that contains and approximation	47	/* 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	48	* to the current C stack pointer. Its property is that it changes with each call
…		…
47	void *sptr;	68	void *sptr;
48	long ssize; /* positive == mmap, otherwise malloc */	69	long ssize; /* positive == mmap, otherwise malloc */
49	} coro_stack;	70	} coro_stack;
50		71
51	struct coro {	72	struct coro {
		73	/* the top-level JMPENV for each coroutine, needed to catch dies. */
		74	JMPENV start_env;
		75
52	/* the optional C context */	76	/* the optional C context */
53	coro_stack *stack;	77	coro_stack *stack;
54	void *cursp;	78	void *cursp;
55	int gencnt;	79	int gencnt;
56		80
…		…
68	AV *curstack;	92	AV *curstack;
69	AV *mainstack;	93	AV *mainstack;
70	SV **stack_sp;	94	SV **stack_sp;
71	OP *op;	95	OP *op;
72	SV **curpad;	96	SV **curpad;
		97	AV *comppad;
73	SV **stack_base;	98	SV **stack_base;
74	SV **stack_max;	99	SV **stack_max;
75	SV **tmps_stack;	100	SV **tmps_stack;
76	I32 tmps_floor;	101	I32 tmps_floor;
77	I32 tmps_ix;	102	I32 tmps_ix;
…		…
101	static AV main_mainstack; / used to differentiate between $main and others */	126	static AV main_mainstack; / used to differentiate between $main and others */
102	static HV *coro_state_stash;	127	static HV *coro_state_stash;
103	static SV *ucoro_state_sv;	128	static SV *ucoro_state_sv;
104	static U32 ucoro_state_hash;	129	static U32 ucoro_state_hash;
105	static HV *padlist_cache;	130	static HV *padlist_cache;
		131	static SV coro_mortal; / will be freed after next transfer */
106		132
107	/* mostly copied from op.c:cv_clone2 */	133	/* mostly copied from op.c:cv_clone2 */
108	STATIC AV *	134	STATIC AV *
109	clone_padlist (AV *protopadlist)	135	clone_padlist (AV *protopadlist)
110	{	136	{
…		…
156	sv = (SV *) newAV ();	182	sv = (SV *) newAV ();
157	else if (*name == '%')	183	else if (*name == '%')
158	sv = (SV *) newHV ();	184	sv = (SV *) newHV ();
159	else	185	else
160	sv = NEWSV (0, 0);	186	sv = NEWSV (0, 0);
		187	#ifdef SvPADBUSY
161	if (!SvPADBUSY (sv))	188	if (!SvPADBUSY (sv))
		189	#endif
162	SvPADMY_on (sv);	190	SvPADMY_on (sv);
163	npad[ix] = sv;	191	npad[ix] = sv;
164	}	192	}
165	}	193	}
166	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))	194	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))
…		…
196	#endif	224	#endif
197		225
198	return newpadlist;	226	return newpadlist;
199	}	227	}
200		228
201	#ifdef MAY_FLUSH
202	STATIC void	229	STATIC void
203	free_padlist (AV *padlist)	230	free_padlist (AV *padlist)
204	{	231	{
205	/* may be during global destruction */	232	/* may be during global destruction */
206	if (SvREFCNT(padlist))	233	if (SvREFCNT (padlist))
207	{	234	{
208	I32 i = AvFILLp(padlist);	235	I32 i = AvFILLp (padlist);
209	while (i >= 0)	236	while (i >= 0)
210	{	237	{
211	SV **svp = av_fetch(padlist, i--, FALSE);	238	SV **svp = av_fetch (padlist, i--, FALSE);
212	SV sv = svp ? svp : Nullsv;
213	if (sv)	239	if (svp)
		240	{
		241	SV *sv;
		242	while (&PL_sv_undef != (sv = av_pop ((AV )svp)))
214	SvREFCNT_dec(sv);	243	SvREFCNT_dec (sv);
		244
		245	SvREFCNT_dec (*svp);
		246	}
215	}	247	}
216		248
217	SvREFCNT_dec((SV*)padlist);	249	SvREFCNT_dec ((SV*)padlist);
218	}	250	}
219	}	251	}
220	#endif	252
		253	STATIC int
		254	coro_cv_free (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
		264	#define PERL_MAGIC_coro PERL_MAGIC_ext
		265
		266	static MGVTBL vtbl_coro = {0, 0, 0, 0, coro_cv_free};
221		267
222	/* the next two functions merely cache the padlists */	268	/* the next two functions merely cache the padlists */
223	STATIC void	269	STATIC void
224	get_padlist (CV *cv)	270	get_padlist (CV *cv)
225	{	271	{
226	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 0);	272	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
227		273
228	if (he && AvFILLp ((AV )he) >= 0)	274	if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
229	CvPADLIST (cv) = (AV )av_pop ((AV )*he);	275	CvPADLIST (cv) = (AV )av_pop ((AV )mg->mg_obj);
230	else	276	else
231	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));	277	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
232	}	278	}
233		279
234	STATIC void	280	STATIC void
235	put_padlist (CV *cv)	281	put_padlist (CV *cv)
236	{	282	{
237	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 1);	283	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
238		284
239	if (SvTYPE (*he) != SVt_PVAV)	285	if (!mg)
240	{	286	{
241	SvREFCNT_dec (*he);	287	sv_magic ((SV *)cv, 0, PERL_MAGIC_coro, 0, 0);
		288	mg = mg_find ((SV *)cv, PERL_MAGIC_coro);
		289	mg->mg_virtual = &vtbl_coro;
242	he = (SV )newAV ();	290	mg->mg_obj = (SV *)newAV ();
243	}	291	}
244		292
245	av_push ((AV )he, (SV *)CvPADLIST (cv));	293	av_push ((AV )mg->mg_obj, (SV )CvPADLIST (cv));
246	}	294	}
247
248	#ifdef MAY_FLUSH
249	STATIC void
250	flush_padlist_cache ()
251	{
252	HV *hv = padlist_cache;
253	padlist_cache = newHV ();
254
255	if (hv_iterinit (hv))
256	{
257	HE *he;
258	AV *padlist;
259
260	while (!!(he = hv_iternext (hv)))
261	{
262	AV av = (AV )HeVAL(he);
263
264	/* casting is fun. */
265	while (&PL_sv_undef != (SV )(padlist = (AV )av_pop (av)))
266	free_padlist (padlist);
267	}
268	}
269
270	SvREFCNT_dec (hv);
271	}
272	#endif
273		295
274	#define SB do {	296	#define SB do {
275	#define SE } while (0)	297	#define SE } while (0)
276		298
277	#define LOAD(state) load_state(aTHX_ (state));	299	#define LOAD(state) load_state(aTHX_ (state));
278	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));	300	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
279		301
280	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); SE	302	#define REPLACE_SV(sv,val) SB SvREFCNT_dec(sv); (sv) = (val); (val) = 0; SE
281		303
282	static void	304	static void
283	load_state(pTHX_ Coro__State c)	305	load_state(pTHX_ Coro__State c)
284	{	306	{
285	PL_dowarn = c->dowarn;	307	PL_dowarn = c->dowarn;
…		…
289	PL_curstack = c->curstack;	311	PL_curstack = c->curstack;
290	PL_mainstack = c->mainstack;	312	PL_mainstack = c->mainstack;
291	PL_stack_sp = c->stack_sp;	313	PL_stack_sp = c->stack_sp;
292	PL_op = c->op;	314	PL_op = c->op;
293	PL_curpad = c->curpad;	315	PL_curpad = c->curpad;
		316	PL_comppad = c->comppad;
294	PL_stack_base = c->stack_base;	317	PL_stack_base = c->stack_base;
295	PL_stack_max = c->stack_max;	318	PL_stack_max = c->stack_max;
296	PL_tmps_stack = c->tmps_stack;	319	PL_tmps_stack = c->tmps_stack;
297	PL_tmps_floor = c->tmps_floor;	320	PL_tmps_floor = c->tmps_floor;
298	PL_tmps_ix = c->tmps_ix;	321	PL_tmps_ix = c->tmps_ix;
…		…
386	PUSHs ((SV *)cv);	409	PUSHs ((SV *)cv);
387		410
388	get_padlist (cv); /* this is a monster */	411	get_padlist (cv); /* this is a monster */
389	}	412	}
390	}	413	}
		414	#ifdef CXt_FORMAT
391	else if (CxTYPE(cx) == CXt_FORMAT)	415	else if (CxTYPE(cx) == CXt_FORMAT)
392	{	416	{
393	/* I never used formats, so how should I know how these are implemented? */	417	/* I never used formats, so how should I know how these are implemented? */
394	/* my bold guess is as a simple, plain sub... */	418	/* my bold guess is as a simple, plain sub... */
395	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");	419	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
396	}	420	}
		421	#endif
397	}	422	}
398		423
399	if (top_si->si_type == PERLSI_MAIN)	424	if (top_si->si_type == PERLSI_MAIN)
400	break;	425	break;
401		426
…		…
418	c->curstack = PL_curstack;	443	c->curstack = PL_curstack;
419	c->mainstack = PL_mainstack;	444	c->mainstack = PL_mainstack;
420	c->stack_sp = PL_stack_sp;	445	c->stack_sp = PL_stack_sp;
421	c->op = PL_op;	446	c->op = PL_op;
422	c->curpad = PL_curpad;	447	c->curpad = PL_curpad;
		448	c->comppad = PL_comppad;
423	c->stack_base = PL_stack_base;	449	c->stack_base = PL_stack_base;
424	c->stack_max = PL_stack_max;	450	c->stack_max = PL_stack_max;
425	c->tmps_stack = PL_tmps_stack;	451	c->tmps_stack = PL_tmps_stack;
426	c->tmps_floor = PL_tmps_floor;	452	c->tmps_floor = PL_tmps_floor;
427	c->tmps_ix = PL_tmps_ix;	453	c->tmps_ix = PL_tmps_ix;
…		…
443	}	469	}
444		470
445	/*	471	/*
446	* allocate various perl stacks. This is an exact copy	472	* allocate various perl stacks. This is an exact copy
447	* of perl.c:init_stacks, except that it uses less memory	473	* of perl.c:init_stacks, except that it uses less memory
448	* on the assumption that coroutines do not usually need	474	* on the (sometimes correct) assumption that coroutines do
449	* a lot of stackspace.	475	* not usually need a lot of stackspace.
450	*/	476	*/
451	STATIC void	477	STATIC void
452	coro_init_stacks (pTHX)	478	coro_init_stacks (pTHX)
453	{	479	{
454	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);	480	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
…		…
467		493
468	New(54,PL_markstack,16,I32);	494	New(54,PL_markstack,16,I32);
469	PL_markstack_ptr = PL_markstack;	495	PL_markstack_ptr = PL_markstack;
470	PL_markstack_max = PL_markstack + 16;	496	PL_markstack_max = PL_markstack + 16;
471		497
		498	#ifdef SET_MARK_OFFSET
472	SET_MARK_OFFSET;	499	SET_MARK_OFFSET;
		500	#endif
473		501
474	New(54,PL_scopestack,16,I32);	502	New(54,PL_scopestack,16,I32);
475	PL_scopestack_ix = 0;	503	PL_scopestack_ix = 0;
476	PL_scopestack_max = 16;	504	PL_scopestack_max = 16;
477		505
…		…
484	PL_retstack_max = 8;	512	PL_retstack_max = 8;
485	}	513	}
486		514
487	/*	515	/*
488	* destroy the stacks, the callchain etc...	516	* destroy the stacks, the callchain etc...
489	* still there is a memleak of 128 bytes...
490	*/	517	*/
491	STATIC void	518	STATIC void
492	destroy_stacks(pTHX)	519	destroy_stacks(pTHX)
493	{	520	{
494	if (!IN_DESTRUCT)	521	if (!IN_DESTRUCT)
495	{	522	{
496	/* is this ugly, I ask? */	523	/* is this ugly, I ask? */
497	while (PL_scopestack_ix)	524	LEAVE_SCOPE (0);
498	LEAVE;
499		525
500	/* sure it is, but more important: is it correct?? :/ */	526	/* sure it is, but more important: is it correct?? :/ */
501	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
502	FREETMPS;	527	FREETMPS;
503	}	528	}
504		529
505	while (PL_curstackinfo->si_next)	530	while (PL_curstackinfo->si_next)
506	PL_curstackinfo = PL_curstackinfo->si_next;	531	PL_curstackinfo = PL_curstackinfo->si_next;
507		532
…		…
543	stack->refcnt = 1;	568	stack->refcnt = 1;
544	stack->usecnt = 1;	569	stack->usecnt = 1;
545	stack->gencnt = ctx->gencnt = 0;	570	stack->gencnt = ctx->gencnt = 0;
546	if (alloc)	571	if (alloc)
547	{	572	{
548	#ifdef HAVE_MMAP	573	#if HAVE_MMAP
549	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */	574	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
550	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);	575	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
551	if (stack->sptr == (void *)-1)	576	if (stack->sptr == (void *)-1)
552	#endif	577	#endif
553	{	578	{
554	/FIXME//D//* reasonable stack size! */	579	/FIXME//D//* reasonable stack size! */
555	stack->ssize = -4096 * sizeof (long);	580	stack->ssize = - (16384 * sizeof (long));
556	New (0, stack->sptr, 4096, long);	581	New (0, stack->sptr, 16384, long);
557	}	582	}
558	}	583	}
559	else	584	else
560	stack->sptr = 0;	585	stack->sptr = 0;
561		586
…		…
575	{	600	{
576	#ifdef HAVE_MMAP	601	#ifdef HAVE_MMAP
577	if (stack->ssize > 0 && stack->sptr)	602	if (stack->ssize > 0 && stack->sptr)
578	munmap (stack->sptr, stack->ssize);	603	munmap (stack->sptr, stack->ssize);
579	else	604	else
580	#else	605	#endif
581	Safefree (stack->sptr);	606	Safefree (stack->sptr);
582	#endif	607
583	Safefree (stack);	608	Safefree (stack);
584	}	609	}
585	else if (ctx->gencnt == stack->gencnt)	610	else if (ctx->gencnt == stack->gencnt)
586	--stack->usecnt;	611	--stack->usecnt;
587	}	612	}
…		…
593	/*	618	/*
594	* emulate part of the perl startup here.	619	* emulate part of the perl startup here.
595	*/	620	*/
596	dSP;	621	dSP;
597	Coro__State ctx = (Coro__State)arg;	622	Coro__State ctx = (Coro__State)arg;
598	SV sub_init = (SV)get_cv(SUB_INIT, FALSE);	623	SV sub_init = (SV )get_cv (SUB_INIT, FALSE);
599		624
600	coro_init_stacks (aTHX);	625	coro_init_stacks (aTHX);
601	/PL_curcop = 0;/	626	/PL_curcop = 0;/
602	/PL_in_eval = PL_in_eval;/ /* inherit */	627	/PL_in_eval = PL_in_eval;/ /* inherit */
603	SvREFCNT_dec (GvAV (PL_defgv));	628	SvREFCNT_dec (GvAV (PL_defgv));
604	GvAV (PL_defgv) = ctx->args;	629	GvAV (PL_defgv) = ctx->args; ctx->args = 0;
605		630
606	SPAGAIN;	631	SPAGAIN;
607		632
608	if (ctx->stack)	633	if (ctx->stack)
609	{	634	{
…		…
636	* that doesn't matter, though, since it is only	661	* that doesn't matter, though, since it is only
637	* pp_nextstate and we never return...	662	* pp_nextstate and we never return...
638	* ah yes, and I don't care anyways ;)	663	* ah yes, and I don't care anyways ;)
639	*/	664	*/
640	PUTBACK;	665	PUTBACK;
641	PL_op = pp_entersub();	666	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
642	SPAGAIN;	667	SPAGAIN;
643		668
644	ENTER; /* necessary e.g. for dounwind */	669	ENTER; /* necessary e.g. for dounwind */
645	}	670	}
646	}	671	}
…		…
652	* this is a _very_ stripped down perl interpreter ;)	677	* this is a _very_ stripped down perl interpreter ;)
653	*/	678	*/
654	Coro__State ctx = (Coro__State)arg;	679	Coro__State ctx = (Coro__State)arg;
655	JMPENV coro_start_env;	680	JMPENV coro_start_env;
656		681
657	/* same as JMPENV_BOOTSTRAP */
658	Zero(&coro_start_env, 1, JMPENV);
659	coro_start_env.je_ret = -1;
660	coro_start_env.je_mustcatch = TRUE;
661	PL_top_env = &coro_start_env;	682	PL_top_env = &ctx->start_env;
662		683
663	ctx->cursp = 0;	684	ctx->cursp = 0;
664	PL_op = PL_op->op_next;	685	PL_op = PL_op->op_next;
665	CALLRUNOPS(aTHX);	686	CALLRUNOPS(aTHX);
666		687
…		…
724	if (!prev->stack)	745	if (!prev->stack)
725	allocate_stack (prev, 0);	746	allocate_stack (prev, 0);
726		747
727	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)	748	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
728	{	749	{
		750	PL_top_env = &next->start_env;
		751
729	setup_coro (next);	752	setup_coro (next);
730		753
731	prev->stack->refcnt++;	754	prev->stack->refcnt++;
732	prev->stack->usecnt++;	755	prev->stack->usecnt++;
733	next->stack = prev->stack;	756	next->stack = prev->stack;
734	next->gencnt = prev->gencnt;	757	next->gencnt = prev->gencnt;
735	}	758	}
736	else	759	else
737	{	760	{
		761	assert (!next->stack);
738	allocate_stack (next, 1);	762	allocate_stack (next, 1);
739	coro_create (&(next->stack->cctx),	763	coro_create (&(next->stack->cctx),
740	setup_coro, (void *)next,	764	setup_coro, (void *)next,
741	next->stack->sptr, labs (next->stack->ssize));	765	next->stack->sptr, labs (next->stack->ssize));
742	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));	766	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
…		…
747	setup_coro (next);	771	setup_coro (next);
748	}	772	}
749		773
750	/*	774	/*
751	* xnext is now either prev or next, depending on wether	775	* xnext is now either prev or next, depending on wether
752	* we switched the c stack or not. that's why i use a global	776	* we switched the c stack or not. that's why I use a global
753	* variable, that should become thread-specific at one point.	777	* variable, that should become thread-specific at one point.
754	*/	778	*/
755	xnext->cursp = stacklevel;	779	xnext->cursp = stacklevel;
756	}	780	}
757	}
758		781
759	static struct coro *	782	if (coro_mortal)
760	sv_to_coro (SV arg, const char funcname, const char *varname)
761	{
762	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
763	{	783	{
764	HE he = hv_fetch_ent((HV )SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);	784	SvREFCNT_dec (coro_mortal);
765		785	coro_mortal = 0;
766	if (!he)
767	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
768
769	arg = HeVAL(he);
770	}	786	}
771		787	}
		788
		789	#define SV_CORO(sv,func) \
		790	do { \
		791	if (SvROK (sv)) \
		792	sv = SvRV (sv); \
		793	\
		794	if (SvTYPE(sv) == SVt_PVHV) \
		795	{ \
		796	HE he = hv_fetch_ent((HV )sv, ucoro_state_sv, 0, ucoro_state_hash); \
		797	\
		798	if (!he) \
		799	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
		800	\
		801	(sv) = SvRV (HeVAL(he)); \
		802	} \
		803	\
772	/* must also be changed inside Coro::Cont::yield */	804	/* must also be changed inside Coro::Cont::yield */ \
773	if (SvROK(arg) && SvOBJECT(SvRV(arg))	805	if (!SvOBJECT(sv) \|\| SvSTASH(sv) != coro_state_stash) \
774	&& SvSTASH(SvRV(arg)) == coro_state_stash)
775	return (struct coro ) SvIV((SV)SvRV(arg));
776
777	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);	806	croak ("%s() -- %s is not (and contains not) a Coro::State object", func, # sv); \
778	/NORETURN/	807	\
779	}	808	} while(0)
		809
		810	#define SvSTATE(sv) (struct coro *)SvIV (sv)
780		811
781	static void	812	static void
782	api_transfer(pTHX_ SV prev, SV next, int flags)	813	api_transfer(pTHX_ SV prev, SV next, int flags)
783	{	814	{
784	transfer(aTHX_	815	SV_CORO (prev, "Coro::transfer");
785	sv_to_coro (prev, "Coro::transfer", "prev"),	816	SV_CORO (next, "Coro::transfer");
786	sv_to_coro (next, "Coro::transfer", "next"),	817
787	flags);	818	transfer(aTHX_ SvSTATE(prev), SvSTATE(next), flags);
788	}	819	}
789		820
790	/ Coro ******************************************************************/	821	/ Coro ******************************************************************/
791		822
792	#define PRIO_MAX 3	823	#define PRIO_MAX 3
…		…
802	static int coro_nready;	833	static int coro_nready;
803		834
804	static void	835	static void
805	coro_enq (SV *sv)	836	coro_enq (SV *sv)
806	{	837	{
807	if (SvROK (sv))	838	if (SvTYPE (sv) == SVt_PVHV)
808	{	839	{
809	SV *hv = SvRV (sv);
810	if (SvTYPE (hv) == SVt_PVHV)
811	{
812	SV *xprio = hv_fetch ((HV )hv, "prio", 4, 0);	840	SV *xprio = hv_fetch ((HV )sv, "prio", 4, 0);
813	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;	841	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
814		842
815	prio = prio > PRIO_MAX ? PRIO_MAX	843	prio = prio > PRIO_MAX ? PRIO_MAX
816	: prio < PRIO_MIN ? PRIO_MIN	844	: prio < PRIO_MIN ? PRIO_MIN
817	: prio;	845	: prio;
818		846
819	av_push (coro_ready [prio - PRIO_MIN], sv);	847	av_push (coro_ready [prio - PRIO_MIN], sv);
820	coro_nready++;	848	coro_nready++;
821		849
822	return;	850	return;
823	}
824	}	851	}
825		852
826	croak ("Coro::ready tried to enqueue something that is not a coroutine");	853	croak ("Coro::ready tried to enqueue something that is not a coroutine");
827	}	854	}
828		855
…		…
846	}	873	}
847		874
848	static void	875	static void
849	api_ready (SV *coro)	876	api_ready (SV *coro)
850	{	877	{
		878	if (SvROK (coro))
		879	coro = SvRV (coro);
		880
851	coro_enq (SvREFCNT_inc (coro));	881	coro_enq (SvREFCNT_inc (coro));
852	}	882	}
853		883
854	static void	884	static void
855	api_schedule (int cede)	885	api_schedule (void)
856	{	886	{
857	SV prev, next;	887	SV prev, next;
858		888
859	prev = GvSV (coro_current);	889	prev = SvRV (GvSV (coro_current));
860
861	if (cede)
862	coro_enq (SvREFCNT_inc (prev));
863
864	next = coro_deq (PRIO_MIN);	890	next = coro_deq (PRIO_MIN);
865		891
866	if (!next)	892	if (!next)
867	next = SvREFCNT_inc (GvSV (coro_idle));	893	next = SvREFCNT_inc (SvRV (GvSV (coro_idle)));
868		894
869	GvSV (coro_current) = SvREFCNT_inc (next);	895	/* free this only after the transfer */
870	transfer (aTHX_	896	coro_mortal = prev;
871	sv_to_coro (prev, "Coro::schedule", "current coroutine"),	897	SV_CORO (prev, "Coro::schedule");
872	sv_to_coro (next, "Coro::schedule", "next coroutine"),	898
		899	SvRV (GvSV (coro_current)) = next;
		900
		901	SV_CORO (next, "Coro::schedule");
		902
		903	transfer (aTHX_ SvSTATE (prev), SvSTATE (next),
873	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);	904	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);
874	SvREFCNT_dec (next);	905	}
875	SvREFCNT_dec (prev);	906
		907	static void
		908	api_cede (void)
		909	{
		910	coro_enq (SvREFCNT_inc (SvRV (GvSV (coro_current))));
		911
		912	api_schedule ();
876	}	913	}
877		914
878	MODULE = Coro::State PACKAGE = Coro::State	915	MODULE = Coro::State PACKAGE = Coro::State
879		916
880	PROTOTYPES: ENABLE	917	PROTOTYPES: ENABLE
…		…
907	Coro__State coro;	944	Coro__State coro;
908		945
909	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)	946	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
910	croak ("Coro::State::_newprocess expects an arrayref");	947	croak ("Coro::State::_newprocess expects an arrayref");
911		948
912	New (0, coro, 1, struct coro);	949	Newz (0, coro, 1, struct coro);
913		950
914	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	951	coro->args = (AV *)SvREFCNT_inc (SvRV (args));
915	coro->mainstack = 0; /* actual work is done inside transfer */	952	coro->mainstack = 0; /* actual work is done inside transfer */
916	coro->stack = 0;	953	coro->stack = 0;
917		954
		955	/* same as JMPENV_BOOTSTRAP */
		956	/* we might be able to recycle start_env, but safe is safe */
		957	//Zero(&coro->start_env, 1, JMPENV);
		958	coro->start_env.je_ret = -1;
		959	coro->start_env.je_mustcatch = TRUE;
		960
918	RETVAL = coro;	961	RETVAL = coro;
919	OUTPUT:	962	OUTPUT:
920	RETVAL	963	RETVAL
921		964
922	void	965	void
923	transfer(prev, next, flags)	966	transfer(prev, next, flags)
924	Coro::State_or_hashref prev	967	SV *prev
925	Coro::State_or_hashref next	968	SV *next
926	int flags	969	int flags
927	PROTOTYPE: @	970	PROTOTYPE: @
928	CODE:	971	CODE:
929	PUTBACK;	972	PUTBACK;
		973	SV_CORO (next, "Coro::transfer");
		974	SV_CORO (prev, "Coro::transfer");
930	transfer (aTHX_ prev, next, flags);	975	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
931	SPAGAIN;	976	SPAGAIN;
932		977
933	void	978	void
934	DESTROY(coro)	979	DESTROY(coro)
935	Coro::State coro	980	Coro::State coro
…		…
951		996
952	coro->mainstack = 0;	997	coro->mainstack = 0;
953	}	998	}
954		999
955	deallocate_stack (coro);	1000	deallocate_stack (coro);
956		1001	SvREFCNT_dec (coro->args);
957	Safefree (coro);	1002	Safefree (coro);
958
959	void
960	flush()
961	CODE:
962	#ifdef MAY_FLUSH
963	flush_padlist_cache ();
964	#endif
965		1003
966	void	1004	void
967	_exit(code)	1005	_exit(code)
968	int code	1006	int code
969	PROTOTYPE: $	1007	PROTOTYPE: $
970	CODE:	1008	CODE:
971	#if defined(__GLIBC__) \|\| _POSIX_C_SOURCE
972	_exit (code);	1009	_exit (code);
973	#else
974	signal (SIGTERM, SIG_DFL);
975	raise (SIGTERM);
976	exit (code);
977	#endif
978		1010
979	MODULE = Coro::State PACKAGE = Coro::Cont	1011	MODULE = Coro::State PACKAGE = Coro::Cont
980		1012
981	# this is slightly dirty (should expose a c-level api)	1013	# this is slightly dirty (should expose a c-level api)
982		1014
…		…
988	SV *sv;	1020	SV *sv;
989	AV *defav = GvAV (PL_defgv);	1021	AV *defav = GvAV (PL_defgv);
990	struct coro prev, next;	1022	struct coro prev, next;
991		1023
992	if (!returnstk)	1024	if (!returnstk)
993	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1025	returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
994		1026
995	/* set up @_ -- ugly */	1027	/* set up @_ -- ugly */
996	av_clear (defav);	1028	av_clear (defav);
997	av_fill (defav, items - 1);	1029	av_fill (defav, items - 1);
998	while (items--)	1030	while (items--)
…		…
1030		1062
1031	{	1063	{
1032	SV *sv = perl_get_sv("Coro::API", 1);	1064	SV *sv = perl_get_sv("Coro::API", 1);
1033		1065
1034	coroapi.schedule = api_schedule;	1066	coroapi.schedule = api_schedule;
		1067	coroapi.cede = api_cede;
1035	coroapi.ready = api_ready;	1068	coroapi.ready = api_ready;
1036	coroapi.nready = &coro_nready;	1069	coroapi.nready = &coro_nready;
1037	coroapi.current = coro_current;	1070	coroapi.current = coro_current;
1038		1071
1039	GCoroAPI = &coroapi;	1072	GCoroAPI = &coroapi;
1040	sv_setiv(sv, (IV)&coroapi);	1073	sv_setiv(sv, (IV)&coroapi);
1041	SvREADONLY_on(sv);	1074	SvREADONLY_on(sv);
1042	}	1075	}
1043	}	1076	}
		1077
		1078	#if !PERL_MICRO
1044		1079
1045	void	1080	void
1046	ready(self)	1081	ready(self)
1047	SV * self	1082	SV * self
1048	PROTOTYPE: $	1083	PROTOTYPE: $
1049	CODE:	1084	CODE:
1050	api_ready (self);	1085	api_ready (self);
		1086
		1087	#endif
1051		1088
1052	int	1089	int
1053	nready(...)	1090	nready(...)
1054	PROTOTYPE:	1091	PROTOTYPE:
1055	CODE:	1092	CODE:
…		…
1058	RETVAL	1095	RETVAL
1059		1096
1060	void	1097	void
1061	schedule(...)	1098	schedule(...)
1062	PROTOTYPE:	1099	PROTOTYPE:
1063	ALIAS:
1064	cede = 1
1065	CODE:	1100	CODE:
1066	api_schedule (ix);	1101	api_schedule ();
1067		1102
		1103	void
		1104	cede(...)
		1105	PROTOTYPE:
		1106	CODE:
		1107	api_cede ();
		1108

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.36 by root, Fri Oct 5 14:20:10 2001 UTC vs. Revision 1.52 by pcg, Sun Nov 30 22:49:25 2003 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.36 by root, Fri Oct 5 14:20:10 2001 UTC vs.
Revision 1.52 by pcg, Sun Nov 30 22:49:25 2003 UTC