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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.1 by root, Sat Jul 14 22:14:21 2001 UTC vs.
Revision 1.27 by root, Mon Aug 20 16:58:19 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 */
		22
		23	#define SUB_INIT "Coro::State::initialize"
		24	#define UCORO_STATE "_coro_state"
		25
		26	/* The next macro should delcare 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	SV *proc;	92	/* data associated with this coroutine (initial args) */
		93	AV *args;
35	};	94	};
36		95
37	typedef struct coro *Coro__State;	96	typedef struct coro *Coro__State;
38	typedef struct coro *Coro__State_or_hashref;	97	typedef struct coro *Coro__State_or_hashref;
39		98
40	#define SAVE(c) \	99	static AV main_mainstack; / used to differentiate between $main and others */
		100	static HV *coro_state_stash;
		101	static SV *ucoro_state_sv;
		102	static U32 ucoro_state_hash;
		103	static HV *padlist_cache;
		104
		105	/* mostly copied from op.c:cv_clone2 */
		106	STATIC AV *
		107	clone_padlist (AV *protopadlist)
		108	{
		109	AV *av;
		110	I32 ix;
		111	AV protopad_name = (AV ) * av_fetch (protopadlist, 0, FALSE);
		112	AV protopad = (AV ) * av_fetch (protopadlist, 1, FALSE);
		113	SV **pname = AvARRAY (protopad_name);
		114	SV **ppad = AvARRAY (protopad);
		115	I32 fname = AvFILLp (protopad_name);
		116	I32 fpad = AvFILLp (protopad);
		117	AV newpadlist, newpad_name, *newpad;
		118	SV **npad;
		119
		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
		200	STATIC void
		201	free_padlist (AV *padlist)
		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) SB load_state(aTHX_ (state)); SPAGAIN; SE
		276	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE
		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	do
		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	while (cxix >= 0);
		397
		398	if (top_si->si_type == PERLSI_MAIN)
		399	break;
		400
		401	top_si = top_si->si_prev;
		402	ccstk = top_si->si_cxstack;
		403	cxix = top_si->si_cxix;
		404	}
		405
		406	PUTBACK;
		407	}
		408
		409	c->defav = flags & TRANSFER_SAVE_DEFAV ? (AV *)SvREFCNT_inc (GvAV (PL_defgv)) : 0;
		410	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
		411	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
		412
		413	/* I have not the slightest idea of why av_reify is necessary */
		414	/* but if it's missing the defav contents magically get replaced sometimes */
		415	if (c->defav)
		416	av_reify (c->defav);
		417
41	c->dowarn = PL_dowarn; \	418	c->dowarn = PL_dowarn;
		419	c->in_eval = PL_in_eval;
		420
42	c->curstackinfo = PL_curstackinfo; \	421	c->curstackinfo = PL_curstackinfo;
43	c->curstack = PL_curstack; \	422	c->curstack = PL_curstack;
44	c->mainstack = PL_mainstack; \	423	c->mainstack = PL_mainstack;
45	c->stack_sp = PL_stack_sp; \	424	c->stack_sp = PL_stack_sp;
46	c->op = PL_op; \	425	c->op = PL_op;
47	c->curpad = PL_curpad; \	426	c->curpad = PL_curpad;
48	c->stack_base = PL_stack_base; \	427	c->stack_base = PL_stack_base;
49	c->stack_max = PL_stack_max; \	428	c->stack_max = PL_stack_max;
50	c->tmps_stack = PL_tmps_stack; \	429	c->tmps_stack = PL_tmps_stack;
51	c->tmps_floor = PL_tmps_floor; \	430	c->tmps_floor = PL_tmps_floor;
52	c->tmps_ix = PL_tmps_ix; \	431	c->tmps_ix = PL_tmps_ix;
53	c->tmps_max = PL_tmps_max; \	432	c->tmps_max = PL_tmps_max;
54	c->markstack = PL_markstack; \	433	c->markstack = PL_markstack;
55	c->markstack_ptr = PL_markstack_ptr; \	434	c->markstack_ptr = PL_markstack_ptr;
56	c->markstack_max = PL_markstack_max; \	435	c->markstack_max = PL_markstack_max;
57	c->scopestack = PL_scopestack; \	436	c->scopestack = PL_scopestack;
58	c->scopestack_ix = PL_scopestack_ix; \	437	c->scopestack_ix = PL_scopestack_ix;
59	c->scopestack_max = PL_scopestack_max;\	438	c->scopestack_max = PL_scopestack_max;
60	c->savestack = PL_savestack; \	439	c->savestack = PL_savestack;
61	c->savestack_ix = PL_savestack_ix; \	440	c->savestack_ix = PL_savestack_ix;
62	c->savestack_max = PL_savestack_max; \	441	c->savestack_max = PL_savestack_max;
63	c->retstack = PL_retstack; \	442	c->retstack = PL_retstack;
64	c->retstack_ix = PL_retstack_ix; \	443	c->retstack_ix = PL_retstack_ix;
65	c->retstack_max = PL_retstack_max; \	444	c->retstack_max = PL_retstack_max;
66	c->curcop = PL_curcop;	445	c->curcop = PL_curcop;
		446	c->top_env = PL_top_env;
		447	}
67		448
68	#define LOAD(c) \	449	/*
69	PL_dowarn = c->dowarn; \	450	* allocate various perl stacks. This is an exact copy
70	PL_curstackinfo = c->curstackinfo; \	451	* of perl.c:init_stacks, except that it uses less memory
71	PL_curstack = c->curstack; \	452	* on the assumption that coroutines do not usually need
72	PL_mainstack = c->mainstack; \	453	* a lot of stackspace.
73	PL_stack_sp = c->stack_sp; \	454	*/
74	PL_op = c->op; \
75	PL_curpad = c->curpad; \
76	PL_stack_base = c->stack_base; \
77	PL_stack_max = c->stack_max; \
78	PL_tmps_stack = c->tmps_stack; \
79	PL_tmps_floor = c->tmps_floor; \
80	PL_tmps_ix = c->tmps_ix; \
81	PL_tmps_max = c->tmps_max; \
82	PL_markstack = c->markstack; \
83	PL_markstack_ptr = c->markstack_ptr; \
84	PL_markstack_max = c->markstack_max; \
85	PL_scopestack = c->scopestack; \
86	PL_scopestack_ix = c->scopestack_ix; \
87	PL_scopestack_max = c->scopestack_max;\
88	PL_savestack = c->savestack; \
89	PL_savestack_ix = c->savestack_ix; \
90	PL_savestack_max = c->savestack_max; \
91	PL_retstack = c->retstack; \
92	PL_retstack_ix = c->retstack_ix; \
93	PL_retstack_max = c->retstack_max; \
94	PL_curcop = c->curcop;
95
96	/* this is an EXACT copy of S_nuke_stacks in perl.c, which is unfortunately static */
97	STATIC void	455	STATIC void
98	S_nuke_stacks(pTHX)	456	coro_init_stacks (pTHX)
99	{	457	{
		458	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
		459	PL_curstackinfo->si_type = PERLSI_MAIN;
		460	PL_curstack = PL_curstackinfo->si_stack;
		461	PL_mainstack = PL_curstack; /* remember in case we switch stacks */
		462
		463	PL_stack_base = AvARRAY(PL_curstack);
		464	PL_stack_sp = PL_stack_base;
		465	PL_stack_max = PL_stack_base + AvMAX(PL_curstack);
		466
		467	New(50,PL_tmps_stack,96,SV*);
		468	PL_tmps_floor = -1;
		469	PL_tmps_ix = -1;
		470	PL_tmps_max = 96;
		471
		472	New(54,PL_markstack,16,I32);
		473	PL_markstack_ptr = PL_markstack;
		474	PL_markstack_max = PL_markstack + 16;
		475
		476	SET_MARK_OFFSET;
		477
		478	New(54,PL_scopestack,16,I32);
		479	PL_scopestack_ix = 0;
		480	PL_scopestack_max = 16;
		481
		482	New(54,PL_savestack,96,ANY);
		483	PL_savestack_ix = 0;
		484	PL_savestack_max = 96;
		485
		486	New(54,PL_retstack,8,OP*);
		487	PL_retstack_ix = 0;
		488	PL_retstack_max = 8;
		489	}
		490
		491	/*
		492	* destroy the stacks, the callchain etc...
		493	* still there is a memleak of 128 bytes...
		494	*/
		495	STATIC void
		496	destroy_stacks(pTHX)
		497	{
		498	/* is this ugly, I ask? */
		499	while (PL_scopestack_ix)
		500	LEAVE;
		501
		502	/* sure it is, but more important: is it correct?? :/ */
		503	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
		504	FREETMPS;
		505
100	while (PL_curstackinfo->si_next)	506	while (PL_curstackinfo->si_next)
101	PL_curstackinfo = PL_curstackinfo->si_next;	507	PL_curstackinfo = PL_curstackinfo->si_next;
		508
102	while (PL_curstackinfo) {	509	while (PL_curstackinfo)
		510	{
103	PERL_SI *p = PL_curstackinfo->si_prev;	511	PERL_SI *p = PL_curstackinfo->si_prev;
104	/* curstackinfo->si_stack got nuked by sv_free_arenas() */	512
		513	{
		514	dSP;
		515	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
		516	PUTBACK; /* possibly superfluous */
		517	}
		518
		519	if (PL_main_cv != Nullcv) /* don't during destruction. hack? */
		520	dounwind(-1);
		521
		522	SvREFCNT_dec(PL_curstackinfo->si_stack);
105	Safefree(PL_curstackinfo->si_cxstack);	523	Safefree(PL_curstackinfo->si_cxstack);
106	Safefree(PL_curstackinfo);	524	Safefree(PL_curstackinfo);
107	PL_curstackinfo = p;	525	PL_curstackinfo = p;
		526	}
		527
		528	Safefree(PL_tmps_stack);
		529	Safefree(PL_markstack);
		530	Safefree(PL_scopestack);
		531	Safefree(PL_savestack);
		532	Safefree(PL_retstack);
		533	}
		534
		535	static void
		536	allocate_stack (Coro__State ctx, int alloc)
		537	{
		538	coro_stack *stack;
		539
		540	New (0, stack, 1, coro_stack);
		541
		542	stack->refcnt = 1;
		543	stack->usecnt = 1;
		544	stack->gencnt = ctx->gencnt = 0;
		545	if (alloc)
		546	{
		547	#ifdef HAVE_MMAP
		548	stack->ssize = 128 * 1024 * sizeof (long); /* mmap should do allocate-on-write for us */
		549	stack->sptr = mmap (0, stack->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANON, 0, 0);
		550	if (stack->sptr == (void *)-1)
		551	#endif
		552	{
		553	/FIXME//D//* reasonable stack size! */
		554	stack->ssize = -4096 * sizeof (long);
		555	New (0, stack->sptr, 4096, long);
		556	}
108	}	557	}
109	Safefree(PL_tmps_stack);	558	else
110	Safefree(PL_markstack);	559	stack->sptr = 0;
111	Safefree(PL_scopestack);	560
112	Safefree(PL_savestack);	561	ctx->stack = stack;
		562	}
		563
		564	static void
		565	deallocate_stack (Coro__State ctx)
		566	{
		567	coro_stack *stack = ctx->stack;
		568
		569	ctx->stack = 0;
		570
		571	if (stack)
		572	{
		573	if (!--stack->refcnt)
		574	{
		575	#ifdef HAVE_MMAP
		576	if (stack->ssize > 0 && stack->sptr)
		577	munmap (stack->sptr, stack->ssize);
		578	else
		579	#else
		580	Safefree (stack->sptr);
		581	#endif
113	Safefree(PL_retstack);	582	Safefree (stack);
		583	}
		584	else if (ctx->gencnt == stack->gencnt)
		585	--stack->usecnt;
		586	}
114	}	587	}
115		588
		589	static void
		590	setup_coro (void *arg)
		591	{
		592	/*
		593	* emulate part of the perl startup here.
		594	*/
		595	dSP;
		596	Coro__State ctx = (Coro__State)arg;
		597	SV sub_init = (SV)get_cv(SUB_INIT, FALSE);
		598
		599	coro_init_stacks (aTHX);
		600	/PL_curcop = 0;/
		601	/PL_in_eval = PL_in_eval;/ /* inherit */
		602	SvREFCNT_dec (GvAV (PL_defgv));
		603	GvAV (PL_defgv) = ctx->args;
		604
		605	SPAGAIN;
		606
		607	if (ctx->stack)
		608	{
		609	ctx->cursp = 0;
		610
		611	PUSHMARK(SP);
		612	PUTBACK;
		613	(void) call_sv (sub_init, G_VOID\|G_NOARGS\|G_EVAL);
		614
		615	if (SvTRUE (ERRSV))
		616	croak (NULL);
		617	else
		618	croak ("FATAL: CCTXT coroutine returned!");
		619	}
		620	else
		621	{
		622	UNOP myop;
		623
		624	PL_op = (OP *)&myop;
		625
		626	Zero(&myop, 1, UNOP);
		627	myop.op_next = Nullop;
		628	myop.op_flags = OPf_WANT_VOID;
		629
		630	PUSHMARK(SP);
		631	XPUSHs (sub_init);
		632	/*
		633	* the next line is slightly wrong, as PL_op->op_next
		634	* is actually being executed so we skip the first op.
		635	* that doesn't matter, though, since it is only
		636	* pp_nextstate and we never return...
		637	* ah yes, and I don't care anyways ;)
		638	*/
		639	PUTBACK;
		640	PL_op = pp_entersub();
		641	SPAGAIN;
		642
		643	ENTER; /* necessary e.g. for dounwind */
		644	}
		645	}
		646
		647	static void
		648	continue_coro (void *arg)
		649	{
		650	/*
		651	* this is a _very_ stripped down perl interpreter ;)
		652	*/
		653	Coro__State ctx = (Coro__State)arg;
		654
		655	/FIXME//* must set up top_env here */
		656	ctx->cursp = 0;
		657	PL_op = PL_op->op_next;
		658	CALLRUNOPS(aTHX);
		659
		660	abort ();
		661	}
		662
		663	STATIC void
		664	transfer(pTHX_ struct coro prev, struct coro next, int flags)
		665	{
		666	dSP;
		667	dSTACKLEVEL;
		668
		669	if (prev != next)
		670	{
		671	if (next->mainstack)
		672	{
		673	SAVE (prev, flags);
		674	LOAD (next);
		675
		676	/* mark this state as in-use */
		677	next->mainstack = 0;
		678	next->tmps_ix = -2;
		679
		680	/* stacklevel changed? if yes, grab the stack for us! */
		681	if (flags & TRANSFER_SAVE_CCTXT)
		682	{
		683	if (!prev->stack)
		684	allocate_stack (prev, 0);
		685	else if (prev->cursp != stacklevel
		686	&& prev->stack->usecnt > 1)
		687	{
		688	prev->gencnt = ++prev->stack->gencnt;
		689	prev->stack->usecnt = 1;
		690	}
		691
		692	/* has our stack been invalidated? */
		693	if (next->stack && next->stack->gencnt != next->gencnt)
		694	{
		695	deallocate_stack (next);
		696	allocate_stack (next, 1);
		697	coro_create (&(next->stack->cctx),
		698	continue_coro, (void *)next,
		699	next->stack->sptr, labs (next->stack->ssize));
		700	}
		701
		702	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		703	}
		704
		705	}
		706	else if (next->tmps_ix == -2)
		707	croak ("tried to transfer to running coroutine");
		708	else
		709	{
		710	SAVE (prev, -1); /* first get rid of the old state */
		711
		712	if (flags & TRANSFER_SAVE_CCTXT)
		713	{
		714	if (!prev->stack)
		715	allocate_stack (prev, 0);
		716
		717	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
		718	{
		719	setup_coro (next);
		720
		721	prev->stack->refcnt++;
		722	prev->stack->usecnt++;
		723	next->stack = prev->stack;
		724	next->gencnt = prev->gencnt;
		725	}
		726	else
		727	{
		728	allocate_stack (next, 1);
		729	coro_create (&(next->stack->cctx),
		730	setup_coro, (void *)next,
		731	next->stack->sptr, labs (next->stack->ssize));
		732	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		733	}
		734	}
		735	else
		736	setup_coro (next);
		737	}
		738	}
		739
		740	next->cursp = stacklevel;
		741	}
		742
		743	static struct coro *
		744	sv_to_coro (SV arg, const char funcname, const char *varname)
		745	{
		746	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
		747	{
		748	HE he = hv_fetch_ent((HV )SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);
		749
		750	if (!he)
		751	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);
		752
		753	arg = HeVAL(he);
		754	}
		755
		756	/* must also be changed inside Coro::Cont::yield */
		757	if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)
		758	return (struct coro ) SvIV((SV)SvRV(arg));
		759
		760	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);
		761	/NORETURN/
		762	}
		763
		764	static void
		765	api_transfer(pTHX_ SV prev, SV next, int flags)
		766	{
		767	transfer(aTHX_
		768	sv_to_coro (prev, "Coro::transfer", "prev"),
		769	sv_to_coro (next, "Coro::transfer", "next"),
		770	flags);
		771	}
		772
		773	/ Coro ******************************************************************/
		774
		775	#define PRIO_MAX 3
		776	#define PRIO_HIGH 1
		777	#define PRIO_NORMAL 0
		778	#define PRIO_LOW -1
		779	#define PRIO_IDLE -3
		780	#define PRIO_MIN -4
		781
		782	/* for Coro.pm */
		783	static GV coro_current, coro_idle;
		784	static AV *coro_ready[PRIO_MAX-PRIO_MIN+1];
		785	static int coro_nready;
		786
		787	static void
		788	coro_enq (SV *sv)
		789	{
		790	if (SvROK (sv))
		791	{
		792	SV *hv = SvRV (sv);
		793	if (SvTYPE (hv) == SVt_PVHV)
		794	{
		795	SV *xprio = hv_fetch ((HV )hv, "prio", 4, 0);
		796	int prio = xprio ? SvIV (*xprio) : PRIO_NORMAL;
		797
		798	prio = prio > PRIO_MAX ? PRIO_MAX
		799	: prio < PRIO_MIN ? PRIO_MIN
		800	: prio;
		801
		802	av_push (coro_ready [prio - PRIO_MIN], sv);
		803	coro_nready++;
		804
		805	return;
		806	}
		807	}
		808
		809	croak ("Coro::ready tried to enqueue something that is not a coroutine");
		810	}
		811
		812	static SV *
		813	coro_deq (int min_prio)
		814	{
		815	int prio = PRIO_MAX - PRIO_MIN;
		816
		817	min_prio -= PRIO_MIN;
		818	if (min_prio < 0)
		819	min_prio = 0;
		820
		821	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
		822	if (av_len (coro_ready[prio]) >= 0)
		823	{
		824	coro_nready--;
		825	return av_shift (coro_ready[prio]);
		826	}
		827
		828	return 0;
		829	}
		830
		831	static void
		832	api_ready (SV *coro)
		833	{
		834	coro_enq (SvREFCNT_inc (coro));
		835	}
		836
		837	static void
		838	api_schedule (int cede)
		839	{
		840	SV prev, next;
		841
		842	prev = GvSV (coro_current);
		843
		844	if (cede)
		845	coro_enq (SvREFCNT_inc (prev));
		846
		847	next = coro_deq (PRIO_MIN);
		848
		849	if (!next)
		850	next = SvREFCNT_inc (GvSV (coro_idle));
		851
		852	GvSV (coro_current) = SvREFCNT_inc (next);
		853	transfer (aTHX_
		854	sv_to_coro (prev, "Coro::schedule", "current coroutine"),
		855	sv_to_coro (next, "Coro::schedule", "next coroutine"),
		856	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);
		857	SvREFCNT_dec (next);
		858	SvREFCNT_dec (prev);
		859	}
		860
116	MODULE = Coro::State PACKAGE = Coro::State	861	MODULE = Coro::State PACKAGE = Coro::State
117		862
118	PROTOTYPES: ENABLE	863	PROTOTYPES: ENABLE
119		864
		865	BOOT:
		866	{ /* {} necessary for stoopid perl-5.6.x */
		867	ucoro_state_sv = newSVpv (UCORO_STATE, sizeof(UCORO_STATE) - 1);
		868	PERL_HASH(ucoro_state_hash, UCORO_STATE, sizeof(UCORO_STATE) - 1);
		869	coro_state_stash = gv_stashpv ("Coro::State", TRUE);
		870
		871	newCONSTSUB (coro_state_stash, "SAVE_DEFAV", newSViv (TRANSFER_SAVE_DEFAV));
		872	newCONSTSUB (coro_state_stash, "SAVE_DEFSV", newSViv (TRANSFER_SAVE_DEFSV));
		873	newCONSTSUB (coro_state_stash, "SAVE_ERRSV", newSViv (TRANSFER_SAVE_ERRSV));
		874	newCONSTSUB (coro_state_stash, "SAVE_CCTXT", newSViv (TRANSFER_SAVE_CCTXT));
		875
		876	if (!padlist_cache)
		877	padlist_cache = newHV ();
		878
		879	main_mainstack = PL_mainstack;
		880
		881	coroapi.ver = CORO_API_VERSION;
		882	coroapi.transfer = api_transfer;
		883	}
		884
120	Coro::State	885	Coro::State
121	newprocess(proc)	886	_newprocess(args)
122	SV * proc	887	SV * args
123	PROTOTYPE: &	888	PROTOTYPE: $
124	CODE:	889	CODE:
125	Coro__State coro;	890	Coro__State coro;
		891
		892	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
		893	croak ("Coro::State::_newprocess expects an arrayref");
126		894
127	New (0, coro, 1, struct coro);	895	New (0, coro, 1, struct coro);
128		896
		897	coro->args = (AV *)SvREFCNT_inc (SvRV (args));
129	coro->mainstack = 0; /* actual work is done inside transfer */	898	coro->mainstack = 0; /* actual work is done inside transfer */
130	coro->proc = SvREFCNT_inc (proc);	899	coro->stack = 0;
131		900
132	RETVAL = coro;	901	RETVAL = coro;
133	OUTPUT:	902	OUTPUT:
134	RETVAL	903	RETVAL
135		904
136	void	905	void
137	transfer(prev,next)	906	transfer(prev, next, flags)
138	Coro::State_or_hashref prev	907	Coro::State_or_hashref prev
139	Coro::State_or_hashref next	908	Coro::State_or_hashref next
		909	int flags
		910	PROTOTYPE: @
140	CODE:	911	CODE:
141
142	PUTBACK;	912	PUTBACK;
143	SAVE (prev);	913	transfer (aTHX_ prev, next, flags);
144
145	/*
146	* this could be done in newprocess which would to
147	* extremely elegant and fast (just PUTBACK/SAVE/LOAD/SPAGAIN)
148	* code here, but lazy allocation of stacks has also
149	* some virtues and the overhead of the if() is nil.
150	*/
151	if (next->mainstack)
152	{
153	LOAD (next);
154	next->mainstack = 0; /* unnecessary but much cleaner */
155	SPAGAIN;	914	SPAGAIN;
156	}
157	else
158	{
159	/*
160	* emulate part of the perl startup here.
161	*/
162	UNOP myop;
163
164	init_stacks ();
165	PL_op = (OP *)&myop;
166	/PL_curcop = 0;/
167
168	SPAGAIN;
169	Zero(&myop, 1, UNOP);
170	myop.op_next = Nullop;
171	myop.op_flags = OPf_WANT_VOID;
172
173	EXTEND (SP,1);
174	PUSHs (next->proc);
175
176	PUTBACK;
177	/*
178	* the next line is slightly wrong, as PL_op->op_next
179	* is actually being executed so we skip the first op
180	* that doens't matter, though, since it is only
181	* pp_nextstate and we never return...
182	*/
183	PL_op = Perl_pp_entersub(aTHX);
184	SPAGAIN;
185
186	ENTER;
187	}
188		915
189	void	916	void
190	DESTROY(coro)	917	DESTROY(coro)
191	Coro::State coro	918	Coro::State coro
192	CODE:	919	CODE:
193		920
194	if (coro->mainstack)	921	if (coro->mainstack && coro->mainstack != main_mainstack)
195	{	922	{
196	struct coro temp;	923	struct coro temp;
197		924
198	PUTBACK;	925	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
199	SAVE((&temp));
200	LOAD(coro);	926	LOAD(aTHX_ coro);
201		927
202	S_nuke_stacks ();	928	destroy_stacks (aTHX);
203		929
204	LOAD((&temp));	930	LOAD((&temp)); /* this will get rid of defsv etc.. */
205	SPAGAIN;	931
		932	coro->mainstack = 0;
206	}	933	}
207		934
208	SvREFCNT_dec (coro->proc);	935	deallocate_stack (coro);
		936
209	Safefree (coro);	937	Safefree (coro);
210		938
		939	void
		940	flush()
		941	CODE:
		942	#ifdef MAY_FLUSH
		943	flush_padlist_cache ();
		944	#endif
211		945
		946	void
		947	_exit(code)
		948	int code
		949	PROTOTYPE: $
		950	CODE:
		951	#if defined(__GLIBC__) \|\| _POSIX_C_SOURCE
		952	_exit (code);
		953	#else
		954	signal (SIGTERM, SIG_DFL);
		955	raise (SIGTERM);
		956	exit (code);
		957	#endif
		958
		959	MODULE = Coro::State PACKAGE = Coro::Cont
		960
		961	# this is slightly dirty (should expose a c-level api)
		962
		963	void
		964	yield(...)
		965	PROTOTYPE: @
		966	CODE:
		967	static SV *returnstk;
		968	SV *sv;
		969	AV *defav = GvAV (PL_defgv);
		970	struct coro prev, next;
		971
		972	if (!returnstk)
		973	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));
		974
		975	/* set up @_ -- ugly */
		976	av_clear (defav);
		977	av_fill (defav, items - 1);
		978	while (items--)
		979	av_store (defav, items, SvREFCNT_inc (ST(items)));
		980
		981	mg_get (returnstk); /* isn't documentation wrong for mg_get? */
		982	sv = av_pop ((AV *)SvRV (returnstk));
		983	prev = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 0, 0)));
		984	next = (struct coro )SvIV ((SV)SvRV (av_fetch ((AV )SvRV (sv), 1, 0)));
		985	SvREFCNT_dec (sv);
		986
		987	transfer(aTHX_ prev, next, 0);
		988
		989	MODULE = Coro::State PACKAGE = Coro
		990
		991	# this is slightly dirty (should expose a c-level api)
		992
		993	BOOT:
		994	{
		995	int i;
		996	HV *stash = gv_stashpv ("Coro", TRUE);
		997
		998	newCONSTSUB (stash, "PRIO_MAX", newSViv (PRIO_MAX));
		999	newCONSTSUB (stash, "PRIO_HIGH", newSViv (PRIO_HIGH));
		1000	newCONSTSUB (stash, "PRIO_NORMAL", newSViv (PRIO_NORMAL));
		1001	newCONSTSUB (stash, "PRIO_LOW", newSViv (PRIO_LOW));
		1002	newCONSTSUB (stash, "PRIO_IDLE", newSViv (PRIO_IDLE));
		1003	newCONSTSUB (stash, "PRIO_MIN", newSViv (PRIO_MIN));
		1004
		1005	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
		1006	coro_idle = gv_fetchpv ("Coro::idle" , TRUE, SVt_PV);
		1007
		1008	for (i = PRIO_MAX - PRIO_MIN + 1; i--; )
		1009	coro_ready[i] = newAV ();
		1010
		1011	{
		1012	SV *sv = perl_get_sv("Coro::API", 1);
		1013
		1014	coroapi.schedule = api_schedule;
		1015	coroapi.ready = api_ready;
		1016	coroapi.nready = &coro_nready;
		1017	coroapi.current = coro_current;
		1018
		1019	GCoroAPI = &coroapi;
		1020	sv_setiv(sv, (IV)&coroapi);
		1021	SvREADONLY_on(sv);
		1022	}
		1023	}
		1024
		1025	void
		1026	ready(self)
		1027	SV * self
		1028	CODE:
		1029	api_ready (self);
		1030
		1031	int
		1032	nready(...)
		1033	PROTOTYPE:
		1034	CODE:
		1035	RETVAL = coro_nready;
		1036	OUTPUT:
		1037	RETVAL
		1038
		1039	void
		1040	schedule(...)
		1041	PROTOTYPE:
		1042	ALIAS:
		1043	cede = 1
		1044	CODE:
		1045	api_schedule (ix);
		1046

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.1 by root, Sat Jul 14 22:14:21 2001 UTC vs. Revision 1.27 by root, Mon Aug 20 16:58:19 2001 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.1 by root, Sat Jul 14 22:14:21 2001 UTC vs.
Revision 1.27 by root, Mon Aug 20 16:58:19 2001 UTC