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

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

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

Diff Legend

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

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

Diff Legend

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