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

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

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs. Revision 1.50 by pcg, Sun Nov 30 16:59:15 2003 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.12 by root, Sun Jul 22 03:24:10 2001 UTC vs.
Revision 1.50 by pcg, Sun Nov 30 16:59:15 2003 UTC