[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.86 by root, Fri Nov 24 11:36:57 2006 UTC

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

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.86 by root, Fri Nov 24 11:36:57 2006 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.86 by root, Fri Nov 24 11:36:57 2006 UTC