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

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.35 by root, Mon Sep 24 01:36:20 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.35 by root, Mon Sep 24 01:36:20 2001 UTC