[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.52 by pcg, Sun Nov 30 22:49:25 2003 UTC

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.1 by root, Sat Jul 14 22:14:21 2001 UTC vs. Revision 1.52 by pcg, Sun Nov 30 22:49:25 2003 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.1 by root, Sat Jul 14 22:14:21 2001 UTC vs.
Revision 1.52 by pcg, Sun Nov 30 22:49:25 2003 UTC