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

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.55 by pcg, Thu Apr 1 02:29:05 2004 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.55 by pcg, Thu Apr 1 02:29:05 2004 UTC