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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.2 by root, Sun Jul 15 02:35:52 2001 UTC vs. Revision 1.31 by root, Sun Aug 26 16:36:08 2001 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.2 by root, Sun Jul 15 02:35:52 2001 UTC vs.
Revision 1.31 by root, Sun Aug 26 16:36:08 2001 UTC