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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.21 by root, Sat Aug 11 19:59:19 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"
6		29
7	#include <signal.h>	30	#include <signal.h>
8		31
9	#ifdef HAVE_MMAP	32	#ifdef HAVE_MMAP
10	# include <unistd.h>	33	# include <unistd.h>
11	# include <sys/mman.h>	34	# include <sys/mman.h>
12	# ifndef MAP_ANON
13	# ifdef MAP_ANONYMOUS	35	# ifndef MAP_ANONYMOUS
14	# define MAP_ANON MAP_ANONYMOUS	36	# ifdef MAP_ANON
		37	# define MAP_ANONYMOUS MAP_ANON
15	# else	38	# else
16	# undef HAVE_MMAP	39	# undef HAVE_MMAP
17	# endif	40	# endif
18	# endif	41	# endif
19	#endif	42	#endif
20		43
21	#define MAY_FLUSH /* increases codesize */
22
23	/* perl-related */
24	#define TRANSFER_SAVE_DEFAV 0x00000001
25	#define TRANSFER_SAVE_DEFSV 0x00000002
26	#define TRANSFER_SAVE_ERRSV 0x00000004
27	/* c-related */
28	#define TRANSFER_SAVE_CCTXT 0x00000008
29	#ifdef CORO_LAZY_STACK
30	# define TRANSFER_LAZY_STACK 0x00000010
31	#else
32	# define TRANSFER_LAZY_STACK 0x00000000
33	#endif
34
35	#define TRANSFER_SAVE_ALL (TRANSFER_SAVE_DEFAV\|TRANSFER_SAVE_DEFSV \
36	\|TRANSFER_SAVE_ERRSV\|TRANSFER_SAVE_CCTXT)
37
38	#define SUB_INIT "Coro::State::initialize"	44	#define SUB_INIT "Coro::State::initialize"
39	#define UCORO_STATE "_coro_state"	45	#define UCORO_STATE "_coro_state"
40		46
41	/* 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
42	* 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
43	* and should be unique. */	49	* and should be unique. */
44	#define dSTACKLEVEL void *stacklevel = &stacklevel	50	#define dSTACKLEVEL void *stacklevel = &stacklevel
45		51
		52	#define IN_DESTRUCT (PL_main_cv == Nullcv)
		53
46	#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;
47		59
48	/* 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... */
49	typedef struct {	61	typedef struct {
50	int refcnt; /* pointer reference counter */	62	int refcnt; /* pointer reference counter */
51	int usecnt; /* shared by how many coroutines */	63	int usecnt; /* shared by how many coroutines */
56	void *sptr;	68	void *sptr;
57	long ssize; /* positive == mmap, otherwise malloc */	69	long ssize; /* positive == mmap, otherwise malloc */
58	} coro_stack;	70	} coro_stack;
59		71
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
…		…
77	AV *curstack;	92	AV *curstack;
78	AV *mainstack;	93	AV *mainstack;
79	SV **stack_sp;	94	SV **stack_sp;
80	OP *op;	95	OP *op;
81	SV **curpad;	96	SV **curpad;
		97	AV *comppad;
82	SV **stack_base;	98	SV **stack_base;
83	SV **stack_max;	99	SV **stack_max;
84	SV **tmps_stack;	100	SV **tmps_stack;
85	I32 tmps_floor;	101	I32 tmps_floor;
86	I32 tmps_ix;	102	I32 tmps_ix;
…		…
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;
115		131	static SV coro_mortal; / will be freed after next transfer */
116	/* for Coro.pm */
117	static GV coro_current, coro_idle;
118	static AV *coro_ready;
119		132
120	/* mostly copied from op.c:cv_clone2 */	133	/* mostly copied from op.c:cv_clone2 */
121	STATIC AV *	134	STATIC AV *
122	clone_padlist (AV *protopadlist)	135	clone_padlist (AV *protopadlist)
123	{	136	{
…		…
169	sv = (SV *) newAV ();	182	sv = (SV *) newAV ();
170	else if (*name == '%')	183	else if (*name == '%')
171	sv = (SV *) newHV ();	184	sv = (SV *) newHV ();
172	else	185	else
173	sv = NEWSV (0, 0);	186	sv = NEWSV (0, 0);
		187	#ifdef SvPADBUSY
174	if (!SvPADBUSY (sv))	188	if (!SvPADBUSY (sv))
		189	#endif
175	SvPADMY_on (sv);	190	SvPADMY_on (sv);
176	npad[ix] = sv;	191	npad[ix] = sv;
177	}	192	}
178	}	193	}
179	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))	194	else if (IS_PADGV (ppad[ix]) \|\| IS_PADCONST (ppad[ix]))
…		…
209	#endif	224	#endif
210		225
211	return newpadlist;	226	return newpadlist;
212	}	227	}
213		228
214	#ifdef MAY_FLUSH	229	STATIC void
215	STATIC AV *
216	free_padlist (AV *padlist)	230	free_padlist (AV *padlist)
217	{	231	{
218	/* may be during global destruction */	232	/* may be during global destruction */
219	if (SvREFCNT(padlist))	233	if (SvREFCNT (padlist))
220	{	234	{
221	I32 i = AvFILLp(padlist);	235	I32 i = AvFILLp (padlist);
222	while (i >= 0)	236	while (i >= 0)
223	{	237	{
224	SV **svp = av_fetch(padlist, i--, FALSE);	238	SV **svp = av_fetch (padlist, i--, FALSE);
225	SV sv = svp ? svp : Nullsv;
226	if (sv)	239	if (svp)
		240	{
		241	SV *sv;
		242	while (&PL_sv_undef != (sv = av_pop ((AV )svp)))
227	SvREFCNT_dec(sv);	243	SvREFCNT_dec (sv);
		244
		245	SvREFCNT_dec (*svp);
		246	}
228	}	247	}
229		248
230	SvREFCNT_dec((SV*)padlist);	249	SvREFCNT_dec ((SV*)padlist);
231	}	250	}
232	}	251	}
233	#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};
234		267
235	/* the next two functions merely cache the padlists */	268	/* the next two functions merely cache the padlists */
236	STATIC void	269	STATIC void
237	get_padlist (CV *cv)	270	get_padlist (CV *cv)
238	{	271	{
239	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 0);	272	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
240		273
241	if (he && AvFILLp ((AV )he) >= 0)	274	if (mg && AvFILLp ((AV *)mg->mg_obj) >= 0)
242	CvPADLIST (cv) = (AV )av_pop ((AV )*he);	275	CvPADLIST (cv) = (AV )av_pop ((AV )mg->mg_obj);
243	else	276	else
244	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));	277	CvPADLIST (cv) = clone_padlist (CvPADLIST (cv));
245	}	278	}
246		279
247	STATIC void	280	STATIC void
248	put_padlist (CV *cv)	281	put_padlist (CV *cv)
249	{	282	{
250	SV *he = hv_fetch (padlist_cache, (void )&cv, sizeof (CV *), 1);	283	MAGIC mg = mg_find ((SV )cv, PERL_MAGIC_coro);
251		284
252	if (SvTYPE (*he) != SVt_PVAV)	285	if (!mg)
253	{	286	{
254	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;
255	he = (SV )newAV ();	290	mg->mg_obj = (SV *)newAV ();
256	}	291	}
257		292
258	av_push ((AV )he, (SV *)CvPADLIST (cv));	293	av_push ((AV )mg->mg_obj, (SV )CvPADLIST (cv));
259	}	294	}
260
261	#ifdef MAY_FLUSH
262	STATIC void
263	flush_padlist_cache ()
264	{
265	HV *hv = padlist_cache;
266	padlist_cache = newHV ();
267
268	if (hv_iterinit (hv))
269	{
270	HE *he;
271	AV *padlist;
272
273	while (!!(he = hv_iternext (hv)))
274	{
275	AV av = (AV )HeVAL(he);
276
277	/* casting is fun. */
278	while (&PL_sv_undef != (SV )(padlist = (AV )av_pop (av)))
279	free_padlist (padlist);
280	}
281	}
282
283	SvREFCNT_dec (hv);
284	}
285	#endif
286		295
287	#define SB do {	296	#define SB do {
288	#define SE } while (0)	297	#define SE } while (0)
289		298
290	#define LOAD(state) SB load_state(aTHX_ (state)); SPAGAIN; SE	299	#define LOAD(state) load_state(aTHX_ (state));
291	#define SAVE(state,flags) SB PUTBACK; save_state(aTHX_ (state),(flags)); SE	300	#define SAVE(state,flags) save_state(aTHX_ (state),(flags));
292		301
293	#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
294		303
295	static void	304	static void
296	load_state(pTHX_ Coro__State c)	305	load_state(pTHX_ Coro__State c)
297	{	306	{
298	PL_dowarn = c->dowarn;	307	PL_dowarn = c->dowarn;
…		…
302	PL_curstack = c->curstack;	311	PL_curstack = c->curstack;
303	PL_mainstack = c->mainstack;	312	PL_mainstack = c->mainstack;
304	PL_stack_sp = c->stack_sp;	313	PL_stack_sp = c->stack_sp;
305	PL_op = c->op;	314	PL_op = c->op;
306	PL_curpad = c->curpad;	315	PL_curpad = c->curpad;
		316	PL_comppad = c->comppad;
307	PL_stack_base = c->stack_base;	317	PL_stack_base = c->stack_base;
308	PL_stack_max = c->stack_max;	318	PL_stack_max = c->stack_max;
309	PL_tmps_stack = c->tmps_stack;	319	PL_tmps_stack = c->tmps_stack;
310	PL_tmps_floor = c->tmps_floor;	320	PL_tmps_floor = c->tmps_floor;
311	PL_tmps_ix = c->tmps_ix;	321	PL_tmps_ix = c->tmps_ix;
…		…
370		380
371	PUSHs (Nullsv);	381	PUSHs (Nullsv);
372	/* this loop was inspired by pp_caller */	382	/* this loop was inspired by pp_caller */
373	for (;;)	383	for (;;)
374	{	384	{
375	do	385	while (cxix >= 0)
376	{	386	{
377	PERL_CONTEXT *cx = &ccstk[cxix--];	387	PERL_CONTEXT *cx = &ccstk[cxix--];
378		388
379	if (CxTYPE(cx) == CXt_SUB)	389	if (CxTYPE(cx) == CXt_SUB)
380	{	390	{
…		…
399	PUSHs ((SV *)cv);	409	PUSHs ((SV *)cv);
400		410
401	get_padlist (cv); /* this is a monster */	411	get_padlist (cv); /* this is a monster */
402	}	412	}
403	}	413	}
		414	#ifdef CXt_FORMAT
404	else if (CxTYPE(cx) == CXt_FORMAT)	415	else if (CxTYPE(cx) == CXt_FORMAT)
405	{	416	{
406	/* 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? */
407	/* my bold guess is as a simple, plain sub... */	418	/* my bold guess is as a simple, plain sub... */
408	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");
409	}	420	}
		421	#endif
410	}	422	}
411	while (cxix >= 0);
412		423
413	if (top_si->si_type == PERLSI_MAIN)	424	if (top_si->si_type == PERLSI_MAIN)
414	break;	425	break;
415		426
416	top_si = top_si->si_prev;	427	top_si = top_si->si_prev;
…		…
422	}	433	}
423		434
424	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;
425	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;	436	c->defsv = flags & TRANSFER_SAVE_DEFSV ? SvREFCNT_inc (DEFSV) : 0;
426	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;	437	c->errsv = flags & TRANSFER_SAVE_ERRSV ? SvREFCNT_inc (ERRSV) : 0;
427
428	/* I have not the slightest idea of why av_reify is necessary */
429	/* but if it's missing the defav contents magically get replaced sometimes */
430	if (c->defav)
431	av_reify (c->defav);
432		438
433	c->dowarn = PL_dowarn;	439	c->dowarn = PL_dowarn;
434	c->in_eval = PL_in_eval;	440	c->in_eval = PL_in_eval;
435		441
436	c->curstackinfo = PL_curstackinfo;	442	c->curstackinfo = PL_curstackinfo;
437	c->curstack = PL_curstack;	443	c->curstack = PL_curstack;
438	c->mainstack = PL_mainstack;	444	c->mainstack = PL_mainstack;
439	c->stack_sp = PL_stack_sp;	445	c->stack_sp = PL_stack_sp;
440	c->op = PL_op;	446	c->op = PL_op;
441	c->curpad = PL_curpad;	447	c->curpad = PL_curpad;
		448	c->comppad = PL_comppad;
442	c->stack_base = PL_stack_base;	449	c->stack_base = PL_stack_base;
443	c->stack_max = PL_stack_max;	450	c->stack_max = PL_stack_max;
444	c->tmps_stack = PL_tmps_stack;	451	c->tmps_stack = PL_tmps_stack;
445	c->tmps_floor = PL_tmps_floor;	452	c->tmps_floor = PL_tmps_floor;
446	c->tmps_ix = PL_tmps_ix;	453	c->tmps_ix = PL_tmps_ix;
…		…
462	}	469	}
463		470
464	/*	471	/*
465	* allocate various perl stacks. This is an exact copy	472	* allocate various perl stacks. This is an exact copy
466	* of perl.c:init_stacks, except that it uses less memory	473	* of perl.c:init_stacks, except that it uses less memory
467	* on the assumption that coroutines do not usually need	474	* on the (sometimes correct) assumption that coroutines do
468	* a lot of stackspace.	475	* not usually need a lot of stackspace.
469	*/	476	*/
470	STATIC void	477	STATIC void
471	coro_init_stacks (pTHX)	478	coro_init_stacks (pTHX)
472	{	479	{
473	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);	480	PL_curstackinfo = new_stackinfo(96, 1024/sizeof(PERL_CONTEXT) - 1);
…		…
486		493
487	New(54,PL_markstack,16,I32);	494	New(54,PL_markstack,16,I32);
488	PL_markstack_ptr = PL_markstack;	495	PL_markstack_ptr = PL_markstack;
489	PL_markstack_max = PL_markstack + 16;	496	PL_markstack_max = PL_markstack + 16;
490		497
		498	#ifdef SET_MARK_OFFSET
491	SET_MARK_OFFSET;	499	SET_MARK_OFFSET;
		500	#endif
492		501
493	New(54,PL_scopestack,16,I32);	502	New(54,PL_scopestack,16,I32);
494	PL_scopestack_ix = 0;	503	PL_scopestack_ix = 0;
495	PL_scopestack_max = 16;	504	PL_scopestack_max = 16;
496		505
…		…
503	PL_retstack_max = 8;	512	PL_retstack_max = 8;
504	}	513	}
505		514
506	/*	515	/*
507	* destroy the stacks, the callchain etc...	516	* destroy the stacks, the callchain etc...
508	* still there is a memleak of 128 bytes...
509	*/	517	*/
510	STATIC void	518	STATIC void
511	destroy_stacks(pTHX)	519	destroy_stacks(pTHX)
512	{	520	{
		521	if (!IN_DESTRUCT)
		522	{
513	/* is this ugly, I ask? */	523	/* is this ugly, I ask? */
514	while (PL_scopestack_ix)	524	LEAVE_SCOPE (0);
515	LEAVE;
516		525
517	/* sure it is, but more important: is it correct?? :/ */	526	/* sure it is, but more important: is it correct?? :/ */
518	while (PL_tmps_ix > PL_tmps_floor) /* should only ever be one iteration */
519	FREETMPS;	527	FREETMPS;
		528	}
520		529
521	while (PL_curstackinfo->si_next)	530	while (PL_curstackinfo->si_next)
522	PL_curstackinfo = PL_curstackinfo->si_next;	531	PL_curstackinfo = PL_curstackinfo->si_next;
523		532
524	while (PL_curstackinfo)	533	while (PL_curstackinfo)
…		…
529	dSP;	538	dSP;
530	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);	539	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
531	PUTBACK; /* possibly superfluous */	540	PUTBACK; /* possibly superfluous */
532	}	541	}
533		542
		543	if (!IN_DESTRUCT)
		544	{
534	dounwind(-1);	545	dounwind(-1);
535
536	SvREFCNT_dec(PL_curstackinfo->si_stack);	546	SvREFCNT_dec(PL_curstackinfo->si_stack);
		547	}
		548
537	Safefree(PL_curstackinfo->si_cxstack);	549	Safefree(PL_curstackinfo->si_cxstack);
538	Safefree(PL_curstackinfo);	550	Safefree(PL_curstackinfo);
539	PL_curstackinfo = p;	551	PL_curstackinfo = p;
540	}	552	}
541		553
…		…
556	stack->refcnt = 1;	568	stack->refcnt = 1;
557	stack->usecnt = 1;	569	stack->usecnt = 1;
558	stack->gencnt = ctx->gencnt = 0;	570	stack->gencnt = ctx->gencnt = 0;
559	if (alloc)	571	if (alloc)
560	{	572	{
561	#ifdef HAVE_MMAP	573	#if HAVE_MMAP
562	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 */
563	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);
564	if (stack->sptr == (void *)-1)	576	if (stack->sptr == (void *)-1)
565	#endif	577	#endif
566	{	578	{
567	/FIXME//D//* reasonable stack size! */	579	/FIXME//D//* reasonable stack size! */
568	stack->ssize = -4096 * sizeof (long);	580	stack->ssize = - (16384 * sizeof (long));
569	New (0, stack->sptr, 4096, long);	581	New (0, stack->sptr, 16384, long);
570	}	582	}
571	}	583	}
572	else	584	else
573	stack->sptr = 0;	585	stack->sptr = 0;
574		586
…		…
588	{	600	{
589	#ifdef HAVE_MMAP	601	#ifdef HAVE_MMAP
590	if (stack->ssize > 0 && stack->sptr)	602	if (stack->ssize > 0 && stack->sptr)
591	munmap (stack->sptr, stack->ssize);	603	munmap (stack->sptr, stack->ssize);
592	else	604	else
593	#else	605	#endif
594	Safefree (stack->sptr);	606	Safefree (stack->sptr);
595	#endif	607
596	Safefree (stack);	608	Safefree (stack);
597	}	609	}
598	else if (ctx->gencnt == stack->gencnt)	610	else if (ctx->gencnt == stack->gencnt)
599	--stack->usecnt;	611	--stack->usecnt;
600	}	612	}
…		…
606	/*	618	/*
607	* emulate part of the perl startup here.	619	* emulate part of the perl startup here.
608	*/	620	*/
609	dSP;	621	dSP;
610	Coro__State ctx = (Coro__State)arg;	622	Coro__State ctx = (Coro__State)arg;
611	SV sub_init = (SV)get_cv(SUB_INIT, FALSE);	623	SV sub_init = (SV )get_cv (SUB_INIT, FALSE);
612		624
613	coro_init_stacks (aTHX);	625	coro_init_stacks (aTHX);
614	/PL_curcop = 0;/	626	/PL_curcop = 0;/
615	/PL_in_eval = PL_in_eval;/ /* inherit */	627	/PL_in_eval = PL_in_eval;/ /* inherit */
616	SvREFCNT_dec (GvAV (PL_defgv));	628	SvREFCNT_dec (GvAV (PL_defgv));
617	GvAV (PL_defgv) = ctx->args;	629	GvAV (PL_defgv) = ctx->args; ctx->args = 0;
618		630
619	SPAGAIN;	631	SPAGAIN;
620		632
621	if (ctx->stack)	633	if (ctx->stack)
622	{	634	{
…		…
649	* that doesn't matter, though, since it is only	661	* that doesn't matter, though, since it is only
650	* pp_nextstate and we never return...	662	* pp_nextstate and we never return...
651	* ah yes, and I don't care anyways ;)	663	* ah yes, and I don't care anyways ;)
652	*/	664	*/
653	PUTBACK;	665	PUTBACK;
654	PL_op = pp_entersub();	666	PL_op = PL_ppaddr[OP_ENTERSUB](aTHX);
655	SPAGAIN;	667	SPAGAIN;
656		668
657	ENTER; /* necessary e.g. for dounwind */	669	ENTER; /* necessary e.g. for dounwind */
658	}	670	}
659	}	671	}
…		…
663	{	675	{
664	/*	676	/*
665	* this is a _very_ stripped down perl interpreter ;)	677	* this is a _very_ stripped down perl interpreter ;)
666	*/	678	*/
667	Coro__State ctx = (Coro__State)arg;	679	Coro__State ctx = (Coro__State)arg;
		680	JMPENV coro_start_env;
668		681
669	/FIXME//* must set up top_env here */	682	PL_top_env = &ctx->start_env;
		683
670	ctx->cursp = 0;	684	ctx->cursp = 0;
671	PL_op = PL_op->op_next;	685	PL_op = PL_op->op_next;
672	CALLRUNOPS(aTHX);	686	CALLRUNOPS(aTHX);
673		687
674	abort ();	688	abort ();
675	}	689	}
676		690
677	STATIC void	691	STATIC void
678	transfer(pTHX_ struct coro prev, struct coro next, int flags)	692	transfer(pTHX_ struct coro prev, struct coro next, int flags)
679	{	693	{
680	dSP;
681	dSTACKLEVEL;	694	dSTACKLEVEL;
		695	static struct coro *xnext;
682		696
683	if (prev != next)	697	if (prev != next)
684	{	698	{
		699	xnext = next;
		700
685	if (next->mainstack)	701	if (next->mainstack)
686	{	702	{
687	SAVE (prev, flags);	703	SAVE (prev, flags);
688	LOAD (next);	704	LOAD (next);
689		705
…		…
712	continue_coro, (void *)next,	728	continue_coro, (void *)next,
713	next->stack->sptr, labs (next->stack->ssize));	729	next->stack->sptr, labs (next->stack->ssize));
714	}	730	}
715		731
716	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));	732	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		733	/* don't add any code here */
717	}	734	}
718		735
719	}	736	}
720	else if (next->tmps_ix == -2)	737	else if (next->tmps_ix == -2)
721	croak ("tried to transfer to running coroutine");	738	croak ("tried to transfer to running coroutine");
…		…
728	if (!prev->stack)	745	if (!prev->stack)
729	allocate_stack (prev, 0);	746	allocate_stack (prev, 0);
730		747
731	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)	748	if (prev->stack->sptr && flags & TRANSFER_LAZY_STACK)
732	{	749	{
		750	PL_top_env = &next->start_env;
		751
733	setup_coro (next);	752	setup_coro (next);
734		753
735	prev->stack->refcnt++;	754	prev->stack->refcnt++;
736	prev->stack->usecnt++;	755	prev->stack->usecnt++;
737	next->stack = prev->stack;	756	next->stack = prev->stack;
738	next->gencnt = prev->gencnt;	757	next->gencnt = prev->gencnt;
739	}	758	}
740	else	759	else
741	{	760	{
		761	assert (!next->stack);
742	allocate_stack (next, 1);	762	allocate_stack (next, 1);
743	coro_create (&(next->stack->cctx),	763	coro_create (&(next->stack->cctx),
744	setup_coro, (void *)next,	764	setup_coro, (void *)next,
745	next->stack->sptr, labs (next->stack->ssize));	765	next->stack->sptr, labs (next->stack->ssize));
746	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));	766	coro_transfer (&(prev->stack->cctx), &(next->stack->cctx));
		767	/* don't add any code here */
747	}	768	}
748	}	769	}
749	else	770	else
750	setup_coro (next);	771	setup_coro (next);
751	}	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;
752	}	780	}
753		781
754	next->cursp = stacklevel;	782	if (coro_mortal)
755	}
756
757	static struct coro *
758	sv_to_coro (SV arg, const char funcname, const char *varname)
759	{
760	if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVHV)
761	{	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	{ \
762	HE he = hv_fetch_ent((HV )SvRV(arg), ucoro_state_sv, 0, ucoro_state_hash);	796	HE he = hv_fetch_ent((HV )sv, ucoro_state_sv, 0, ucoro_state_hash); \
763		797	\
764	if (!he)	798	if (!he) \
765	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", funcname, varname);	799	croak ("%s() -- %s is a hashref but lacks the " UCORO_STATE " key", func, # sv); \
766		800	\
767	arg = HeVAL(he);	801	(sv) = SvRV (HeVAL(he)); \
768	}	802	} \
769		803	\
770	/* must also be changed inside Coro::Cont::yield */	804	/* must also be changed inside Coro::Cont::yield */ \
771	if (SvROK(arg) && SvSTASH(SvRV(arg)) == coro_state_stash)	805	if (!SvOBJECT(sv) \|\| SvSTASH(sv) != coro_state_stash) \
772	return (struct coro ) SvIV((SV)SvRV(arg));
773	else
774	croak ("%s() -- %s is not (and contains not) a Coro::State object", funcname, varname);	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 ();
775	}	913	}
776		914
777	MODULE = Coro::State PACKAGE = Coro::State	915	MODULE = Coro::State PACKAGE = Coro::State
778		916
779	PROTOTYPES: ENABLE	917	PROTOTYPES: ENABLE
…		…
791		929
792	if (!padlist_cache)	930	if (!padlist_cache)
793	padlist_cache = newHV ();	931	padlist_cache = newHV ();
794		932
795	main_mainstack = PL_mainstack;	933	main_mainstack = PL_mainstack;
		934
		935	coroapi.ver = CORO_API_VERSION;
		936	coroapi.transfer = api_transfer;
796	}	937	}
797		938
798	Coro::State	939	Coro::State
799	_newprocess(args)	940	_newprocess(args)
800	SV * args	941	SV * args
…		…
803	Coro__State coro;	944	Coro__State coro;
804		945
805	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)	946	if (!SvROK (args) \|\| SvTYPE (SvRV (args)) != SVt_PVAV)
806	croak ("Coro::State::_newprocess expects an arrayref");	947	croak ("Coro::State::_newprocess expects an arrayref");
807		948
808	New (0, coro, 1, struct coro);	949	Newz (0, coro, 1, struct coro);
809		950
810	coro->args = (AV *)SvREFCNT_inc (SvRV (args));	951	coro->args = (AV *)SvREFCNT_inc (SvRV (args));
811	coro->mainstack = 0; /* actual work is done inside transfer */	952	coro->mainstack = 0; /* actual work is done inside transfer */
812	coro->stack = 0;	953	coro->stack = 0;
813		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
814	RETVAL = coro;	961	RETVAL = coro;
815	OUTPUT:	962	OUTPUT:
816	RETVAL	963	RETVAL
817		964
818	void	965	void
819	transfer(prev, next, flags)	966	transfer(prev, next, flags)
820	Coro::State_or_hashref prev	967	SV *prev
821	Coro::State_or_hashref next	968	SV *next
822	int flags	969	int flags
823	PROTOTYPE: @	970	PROTOTYPE: @
824	CODE:	971	CODE:
825	PUTBACK;	972	PUTBACK;
		973	SV_CORO (next, "Coro::transfer");
		974	SV_CORO (prev, "Coro::transfer");
826	transfer (aTHX_ prev, next, flags);	975	transfer (aTHX_ SvSTATE (prev), SvSTATE (next), flags);
827	SPAGAIN;	976	SPAGAIN;
828		977
829	void	978	void
830	DESTROY(coro)	979	DESTROY(coro)
831	Coro::State coro	980	Coro::State coro
…		…
833		982
834	if (coro->mainstack && coro->mainstack != main_mainstack)	983	if (coro->mainstack && coro->mainstack != main_mainstack)
835	{	984	{
836	struct coro temp;	985	struct coro temp;
837		986
		987	PUTBACK;
838	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);	988	SAVE(aTHX_ (&temp), TRANSFER_SAVE_ALL);
839	LOAD(aTHX_ coro);	989	LOAD(aTHX_ coro);
		990	SPAGAIN;
840		991
841	destroy_stacks (aTHX);	992	destroy_stacks (aTHX);
842		993
843	LOAD((&temp)); /* this will get rid of defsv etc.. */	994	LOAD((&temp)); /* this will get rid of defsv etc.. */
		995	SPAGAIN;
844		996
845	coro->mainstack = 0;	997	coro->mainstack = 0;
846	}	998	}
847		999
848	deallocate_stack (coro);	1000	deallocate_stack (coro);
849		1001	SvREFCNT_dec (coro->args);
850	Safefree (coro);	1002	Safefree (coro);
851
852	void
853	flush()
854	CODE:
855	#ifdef MAY_FLUSH
856	flush_padlist_cache ();
857	#endif
858		1003
859	void	1004	void
860	_exit(code)	1005	_exit(code)
861	int code	1006	int code
862	PROTOTYPE: $	1007	PROTOTYPE: $
863	CODE:	1008	CODE:
864	#if defined(__GLIBC__) \|\| _POSIX_C_SOURCE
865	_exit (code);	1009	_exit (code);
866	#else
867	signal (SIGTERM, SIG_DFL);
868	raise (SIGTERM);
869	exit (code);
870	#endif
871		1010
872	MODULE = Coro::State PACKAGE = Coro::Cont	1011	MODULE = Coro::State PACKAGE = Coro::Cont
873		1012
874	# this is slightly dirty (should expose a c-level api)	1013	# this is slightly dirty (should expose a c-level api)
875		1014
…		…
881	SV *sv;	1020	SV *sv;
882	AV *defav = GvAV (PL_defgv);	1021	AV *defav = GvAV (PL_defgv);
883	struct coro prev, next;	1022	struct coro prev, next;
884		1023
885	if (!returnstk)	1024	if (!returnstk)
886	returnstk = SvRV (get_sv ("Coro::Cont::return", FALSE));	1025	returnstk = SvRV ((SV *)get_sv ("Coro::Cont::return", FALSE));
887		1026
888	/* set up @_ -- ugly */	1027	/* set up @_ -- ugly */
889	av_clear (defav);	1028	av_clear (defav);
890	av_fill (defav, items - 1);	1029	av_fill (defav, items - 1);
891	while (items--)	1030	while (items--)
…		…
903		1042
904	# this is slightly dirty (should expose a c-level api)	1043	# this is slightly dirty (should expose a c-level api)
905		1044
906	BOOT:	1045	BOOT:
907	{	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
908	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);	1057	coro_current = gv_fetchpv ("Coro::current", TRUE, SVt_PV);
909	coro_ready = newAV ();
910	coro_idle = gv_fetchpv ("Coro::idle" , 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	}
911	}	1076	}
		1077
		1078	#if !PERL_MICRO
912		1079
913	void	1080	void
914	ready(self)	1081	ready(self)
915	SV * self	1082	SV * self
		1083	PROTOTYPE: $
916	CODE:	1084	CODE:
917	av_push (coro_ready, SvREFCNT_inc (self));	1085	api_ready (self);
		1086
		1087	#endif
		1088
		1089	int
		1090	nready(...)
		1091	PROTOTYPE:
		1092	CODE:
		1093	RETVAL = coro_nready;
		1094	OUTPUT:
		1095	RETVAL
918		1096
919	void	1097	void
920	schedule(...)	1098	schedule(...)
921	ALIAS:	1099	PROTOTYPE:
922	cede = 1
923	CODE:	1100	CODE:
924	SV *prev = GvSV (coro_current);	1101	api_schedule ();
925	SV *next = av_shift (coro_ready);
926		1102
927	if (next == &PL_sv_undef)	1103	void
928	next = SvREFCNT_inc (GvSV (coro_idle));	1104	cede(...)
		1105	PROTOTYPE:
		1106	CODE:
		1107	api_cede ();
929		1108
930	if (ix)
931	av_push (coro_ready, SvREFCNT_inc (prev));
932
933	GvSV (coro_current) = SvREFCNT_inc (next);
934	transfer (sv_to_coro (prev, "Coro::schedule", "current coroutine"),
935	sv_to_coro (next, "Coro::schedule", "next coroutine"),
936	TRANSFER_SAVE_ALL \| TRANSFER_LAZY_STACK);
937	SvREFCNT_dec (next);
938	SvREFCNT_dec (prev);
939

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.21 by root, Sat Aug 11 19:59:19 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.21 by root, Sat Aug 11 19:59:19 2001 UTC vs.
Revision 1.52 by pcg, Sun Nov 30 22:49:25 2003 UTC