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

Comparing Coro/Coro/State.xs (file contents):
Revision 1.125 by root, Mon Dec 11 20:54:45 2006 UTC vs.
Revision 1.143 by root, Wed Feb 28 11:43:03 2007 UTC

…		…
4	#include "perl.h"	4	#include "perl.h"
5	#include "XSUB.h"	5	#include "XSUB.h"
6		6
7	#include "patchlevel.h"	7	#include "patchlevel.h"
8		8
9	#if USE_VALGRIND
10	# include <valgrind/valgrind.h>
11	#endif
12
13	/* the maximum number of idle cctx that will be pooled */
14	#define MAX_IDLE_CCTX 8
15
16	#define PERL_VERSION_ATLEAST(a,b,c) \
17	(PERL_REVISION > (a) \
18	\|\| (PERL_REVISION == (a) \
19	&& (PERL_VERSION > (b) \
20	\|\| (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
21
22	#if !PERL_VERSION_ATLEAST (5,6,0)
23	# ifndef PL_ppaddr
24	# define PL_ppaddr ppaddr
25	# endif
26	# ifndef call_sv
27	# define call_sv perl_call_sv
28	# endif
29	# ifndef get_sv
30	# define get_sv perl_get_sv
31	# endif
32	# ifndef get_cv
33	# define get_cv perl_get_cv
34	# endif
35	# ifndef IS_PADGV
36	# define IS_PADGV(v) 0
37	# endif
38	# ifndef IS_PADCONST
39	# define IS_PADCONST(v) 0
40	# endif
41	#endif
42
43	/* 5.8.7 */
44	#ifndef SvRV_set
45	# define SvRV_set(s,v) SvRV(s) = (v)
46	#endif
47
48	#include <stdio.h>	9	#include <stdio.h>
49	#include <errno.h>	10	#include <errno.h>
50	#include <assert.h>	11	#include <assert.h>
51
52	#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
53	# undef STACKGUARD
54	#endif
55
56	#ifndef STACKGUARD
57	# define STACKGUARD 0
58	#endif
59		12
60	#ifdef HAVE_MMAP	13	#ifdef HAVE_MMAP
61	# include <unistd.h>	14	# include <unistd.h>
62	# include <sys/mman.h>	15	# include <sys/mman.h>
63	# ifndef MAP_ANONYMOUS	16	# ifndef MAP_ANONYMOUS
…		…
78	#else	31	#else
79	# define PAGESIZE 0	32	# define PAGESIZE 0
80	# define BOOT_PAGESIZE (void)0	33	# define BOOT_PAGESIZE (void)0
81	#endif	34	#endif
82		35
		36	#if CORO_USE_VALGRIND
		37	# include <valgrind/valgrind.h>
		38	# define REGISTER_STACK(cctx,start,end) (cctx)->valgrind_id = VALGRIND_STACK_REGISTER ((start), (end))
		39	#else
		40	# define REGISTER_STACK(cctx,start,end)
		41	#endif
		42
		43	/* the maximum number of idle cctx that will be pooled */
		44	#define MAX_IDLE_CCTX 8
		45
		46	#define PERL_VERSION_ATLEAST(a,b,c) \
		47	(PERL_REVISION > (a) \
		48	\|\| (PERL_REVISION == (a) \
		49	&& (PERL_VERSION > (b) \
		50	\|\| (PERL_VERSION == (b) && PERLSUBVERSION >= (c)))))
		51
		52	#if !PERL_VERSION_ATLEAST (5,6,0)
		53	# ifndef PL_ppaddr
		54	# define PL_ppaddr ppaddr
		55	# endif
		56	# ifndef call_sv
		57	# define call_sv perl_call_sv
		58	# endif
		59	# ifndef get_sv
		60	# define get_sv perl_get_sv
		61	# endif
		62	# ifndef get_cv
		63	# define get_cv perl_get_cv
		64	# endif
		65	# ifndef IS_PADGV
		66	# define IS_PADGV(v) 0
		67	# endif
		68	# ifndef IS_PADCONST
		69	# define IS_PADCONST(v) 0
		70	# endif
		71	#endif
		72
		73	/* 5.8.7 */
		74	#ifndef SvRV_set
		75	# define SvRV_set(s,v) SvRV(s) = (v)
		76	#endif
		77
		78	#if !__i386 && !__x86_64 && !__powerpc && !__m68k && !__alpha && !__mips && !__sparc64
		79	# undef CORO_STACKGUARD
		80	#endif
		81
		82	#ifndef CORO_STACKGUARD
		83	# define CORO_STACKGUARD 0
		84	#endif
		85
		86	/* prefer perl internal functions over our own? */
		87	#ifndef CORO_PREFER_PERL_FUNCTIONS
		88	# define CORO_PREFER_PERL_FUNCTIONS 0
		89	#endif
		90
83	/* The next macro should declare a variable stacklevel that contains and approximation	91	/* The next macro should declare a variable stacklevel that contains and approximation
84	* to the current C stack pointer. Its property is that it changes with each call	92	* to the current C stack pointer. Its property is that it changes with each call
85	* and should be unique. */	93	* and should be unique. */
86	#define dSTACKLEVEL int stacklevel	94	#define dSTACKLEVEL int stacklevel
87	#define STACKLEVEL ((void *)&stacklevel)	95	#define STACKLEVEL ((void *)&stacklevel)
88		96
89	#define IN_DESTRUCT (PL_main_cv == Nullcv)	97	#define IN_DESTRUCT (PL_main_cv == Nullcv)
90		98
91	#if __GNUC__ >= 3	99	#if __GNUC__ >= 3
92	# define attribute(x) __attribute__(x)	100	# define attribute(x) __attribute__(x)
		101	# define BARRIER __asm__ __volatile__ ("" : : : "memory")
93	#else	102	#else
94	# define attribute(x)	103	# define attribute(x)
		104	# define BARRIER
95	#endif	105	#endif
96		106
97	#define NOINLINE attribute ((noinline))	107	#define NOINLINE attribute ((noinline))
98		108
99	#include "CoroAPI.h"	109	#include "CoroAPI.h"
…		…
105	#else	115	#else
106	# define LOCK (void)0	116	# define LOCK (void)0
107	# define UNLOCK (void)0	117	# define UNLOCK (void)0
108	#endif	118	#endif
109		119
		120	/* helper storage struct for Coro::AIO */
110	struct io_state	121	struct io_state
111	{	122	{
112	int errorno;	123	int errorno;
113	I32 laststype;	124	I32 laststype;
114	int laststatval;	125	int laststatval;
…		…
127	typedef struct coro_cctx {	138	typedef struct coro_cctx {
128	struct coro_cctx *next;	139	struct coro_cctx *next;
129		140
130	/* the stack */	141	/* the stack */
131	void *sptr;	142	void *sptr;
132	long ssize; /* positive == mmap, otherwise malloc */	143	ssize_t ssize; /* positive == mmap, otherwise malloc */
133		144
134	/* cpu state */	145	/* cpu state */
135	void idle_sp; / sp of top-level transfer/schedule/cede call */	146	void idle_sp; / sp of top-level transfer/schedule/cede call */
		147	JMPENV idle_te; / same as idle_sp, but for top_env, TODO: remove once stable */
136	JMPENV *top_env;	148	JMPENV *top_env;
137	coro_context cctx;	149	coro_context cctx;
138		150
139	int inuse;	151	int inuse;
140		152
141	#if USE_VALGRIND	153	#if CORO_USE_VALGRIND
142	int valgrind_id;	154	int valgrind_id;
143	#endif	155	#endif
144	} coro_cctx;	156	} coro_cctx;
145		157
146	enum {	158	enum {
147	CF_RUNNING = 0x0001, /* coroutine is running */	159	CF_RUNNING = 0x0001, /* coroutine is running */
148	CF_READY = 0x0002, /* coroutine is ready */	160	CF_READY = 0x0002, /* coroutine is ready */
149	CF_NEW = 0x0004, /* ahs never been switched to */	161	CF_NEW = 0x0004, /* has never been switched to */
		162	CF_DESTROYED = 0x0008, /* coroutine data has been freed */
150	};	163	};
151		164
152	/* this is a structure representing a perl-level coroutine */	165	/* this is a structure representing a perl-level coroutine */
153	struct coro {	166	struct coro {
154	/* the c coroutine allocated to this perl coroutine, if any */	167	/* the c coroutine allocated to this perl coroutine, if any */
…		…
176	};	189	};
177		190
178	typedef struct coro *Coro__State;	191	typedef struct coro *Coro__State;
179	typedef struct coro *Coro__State_or_hashref;	192	typedef struct coro *Coro__State_or_hashref;
180		193
		194	/ Coro ******************************************************************/
		195
		196	#define PRIO_MAX 3
		197	#define PRIO_HIGH 1
		198	#define PRIO_NORMAL 0
		199	#define PRIO_LOW -1
		200	#define PRIO_IDLE -3
		201	#define PRIO_MIN -4
		202
		203	/* for Coro.pm */
		204	static SV *coro_current;
		205	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
		206	static int coro_nready;
		207
		208	/ lowlevel stuff ********************************************************/
		209
181	static AV *	210	static AV *
182	coro_clone_padlist (CV *cv)	211	coro_clone_padlist (CV *cv)
183	{	212	{
184	AV *padlist = CvPADLIST (cv);	213	AV *padlist = CvPADLIST (cv);
185	AV newpadlist, newpad;	214	AV newpadlist, newpad;
…		…
259		288
260	if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)	289	if (mg && AvFILLp ((av = (AV *)mg->mg_obj)) >= 0)
261	CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];	290	CvPADLIST (cv) = (AV *)AvARRAY (av)[AvFILLp (av)--];
262	else	291	else
263	{	292	{
264	#if 0	293	#if CORO_PREFER_PERL_FUNCTIONS
265	/* this is probably cleaner, but also slower? */	294	/* this is probably cleaner, but also slower? */
266	CV *cp = Perl_cv_clone (cv);	295	CV *cp = Perl_cv_clone (cv);
267	CvPADLIST (cv) = CvPADLIST (cp);	296	CvPADLIST (cv) = CvPADLIST (cp);
268	CvPADLIST (cp) = 0;	297	CvPADLIST (cp) = 0;
269	SvREFCNT_dec (cp);	298	SvREFCNT_dec (cp);
…		…
292	if (AvFILLp (av) >= AvMAX (av))	321	if (AvFILLp (av) >= AvMAX (av))
293	av_extend (av, AvMAX (av) + 1);	322	av_extend (av, AvMAX (av) + 1);
294		323
295	AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);	324	AvARRAY (av)[++AvFILLp (av)] = (SV *)CvPADLIST (cv);
296	}	325	}
		326
		327	/ load & save, init *****************************************************/
297		328
298	#define SB do {	329	#define SB do {
299	#define SE } while (0)	330	#define SE } while (0)
300		331
301	#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE	332	#define REPLACE_SV(sv,val) SB SvREFCNT_dec (sv); (sv) = (val); (val) = 0; SE
…		…
334	CvPADLIST (cv) = (AV *)POPs;	365	CvPADLIST (cv) = (AV *)POPs;
335	}	366	}
336		367
337	PUTBACK;	368	PUTBACK;
338	}	369	}
		370	assert (!PL_comppad \|\| AvARRAY (PL_comppad));//D
339	}	371	}
340		372
341	static void	373	static void
342	save_perl (Coro__State c)	374	save_perl (Coro__State c)
343	{	375	{
		376	assert (!PL_comppad \|\| AvARRAY (PL_comppad));//D
344	{	377	{
345	dSP;	378	dSP;
346	I32 cxix = cxstack_ix;	379	I32 cxix = cxstack_ix;
347	PERL_CONTEXT *ccstk = cxstack;	380	PERL_CONTEXT *ccstk = cxstack;
348	PERL_SI *top_si = PL_curstackinfo;	381	PERL_SI *top_si = PL_curstackinfo;
…		…
350	/*	383	/*
351	* the worst thing you can imagine happens first - we have to save	384	* the worst thing you can imagine happens first - we have to save
352	* (and reinitialize) all cv's in the whole callchain :(	385	* (and reinitialize) all cv's in the whole callchain :(
353	*/	386	*/
354		387
		388	EXTEND (SP, 3 + 1);
355	PUSHs (Nullsv);	389	PUSHs (Nullsv);
356	/* this loop was inspired by pp_caller */	390	/* this loop was inspired by pp_caller */
357	for (;;)	391	for (;;)
358	{	392	{
359	while (cxix >= 0)	393	while (cxix >= 0)
…		…
365	CV *cv = cx->blk_sub.cv;	399	CV *cv = cx->blk_sub.cv;
366		400
367	if (CvDEPTH (cv))	401	if (CvDEPTH (cv))
368	{	402	{
369	EXTEND (SP, 3);	403	EXTEND (SP, 3);
370
371	PUSHs ((SV *)CvPADLIST (cv));	404	PUSHs ((SV *)CvPADLIST (cv));
372	PUSHs (INT2PTR (SV *, CvDEPTH (cv)));	405	PUSHs (INT2PTR (SV *, CvDEPTH (cv)));
373	PUSHs ((SV *)cv);	406	PUSHs ((SV *)cv);
374		407
375	CvDEPTH (cv) = 0;	408	CvDEPTH (cv) = 0;
376	get_padlist (cv);	409	get_padlist (cv);
377	}	410	}
378	}	411	}
379	#ifdef CXt_FORMAT
380	else if (CxTYPE (cx) == CXt_FORMAT)
381	{
382	/* I never used formats, so how should I know how these are implemented? */
383	/* my bold guess is as a simple, plain sub... */
384	croak ("CXt_FORMAT not yet handled. Don't switch coroutines from within formats");
385	}
386	#endif
387	}	412	}
388		413
389	if (top_si->si_type == PERLSI_MAIN)	414	if (top_si->si_type == PERLSI_MAIN)
390	break;	415	break;
391		416
…		…
411	* allocate various perl stacks. This is an exact copy	436	* allocate various perl stacks. This is an exact copy
412	* of perl.c:init_stacks, except that it uses less memory	437	* of perl.c:init_stacks, except that it uses less memory
413	* on the (sometimes correct) assumption that coroutines do	438	* on the (sometimes correct) assumption that coroutines do
414	* not usually need a lot of stackspace.	439	* not usually need a lot of stackspace.
415	*/	440	*/
		441	#if CORO_PREFER_PERL_FUNCTIONS
		442	# define coro_init_stacks init_stacks
		443	#else
416	static void	444	static void
417	coro_init_stacks ()	445	coro_init_stacks ()
418	{	446	{
419	PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));	447	PL_curstackinfo = new_stackinfo(128, 1024/sizeof(PERL_CONTEXT));
420	PL_curstackinfo->si_type = PERLSI_MAIN;	448	PL_curstackinfo->si_type = PERLSI_MAIN;
…		…
450	New(54,PL_retstack,16,OP*);	478	New(54,PL_retstack,16,OP*);
451	PL_retstack_ix = 0;	479	PL_retstack_ix = 0;
452	PL_retstack_max = 16;	480	PL_retstack_max = 16;
453	#endif	481	#endif
454	}	482	}
		483	#endif
455		484
456	/*	485	/*
457	* destroy the stacks, the callchain etc...	486	* destroy the stacks, the callchain etc...
458	*/	487	*/
459	static void	488	static void
460	coro_destroy_stacks ()	489	coro_destroy_stacks ()
461	{	490	{
462	if (!IN_DESTRUCT)	491	if (!IN_DESTRUCT)
463	{	492	{
464	/* is this ugly, I ask? */	493	/* restore all saved variables and stuff */
465	LEAVE_SCOPE (0);	494	LEAVE_SCOPE (0);
		495	assert (PL_tmps_floor == -1);
466		496
467	/* sure it is, but more important: is it correct?? :/ */	497	/* free all temporaries */
468	FREETMPS;	498	FREETMPS;
		499	assert (PL_tmps_ix == -1);
469		500
		501	/* unwind all extra stacks */
470	/POPSTACK_TO (PL_mainstack);//D//use/	502	POPSTACK_TO (PL_mainstack);
		503
		504	/* unwind main stack */
		505	dounwind (-1);
471	}	506	}
472		507
473	while (PL_curstackinfo->si_next)	508	while (PL_curstackinfo->si_next)
474	PL_curstackinfo = PL_curstackinfo->si_next;	509	PL_curstackinfo = PL_curstackinfo->si_next;
475		510
476	while (PL_curstackinfo)	511	while (PL_curstackinfo)
477	{	512	{
478	PERL_SI *p = PL_curstackinfo->si_prev;	513	PERL_SI *p = PL_curstackinfo->si_prev;
479		514
480	{ /D//remove/
481	dSP;
482	SWITCHSTACK (PL_curstack, PL_curstackinfo->si_stack);
483	PUTBACK; /* possibly superfluous */
484	}
485
486	if (!IN_DESTRUCT)	515	if (!IN_DESTRUCT)
487	{
488	dounwind (-1);/D//remove/
489	SvREFCNT_dec (PL_curstackinfo->si_stack);	516	SvREFCNT_dec (PL_curstackinfo->si_stack);
490	}
491		517
492	Safefree (PL_curstackinfo->si_cxstack);	518	Safefree (PL_curstackinfo->si_cxstack);
493	Safefree (PL_curstackinfo);	519	Safefree (PL_curstackinfo);
494	PL_curstackinfo = p;	520	PL_curstackinfo = p;
495	}	521	}
…		…
501	#if !PERL_VERSION_ATLEAST (5,9,0)	527	#if !PERL_VERSION_ATLEAST (5,9,0)
502	Safefree (PL_retstack);	528	Safefree (PL_retstack);
503	#endif	529	#endif
504	}	530	}
505		531
		532	/ coroutine stack handling **********************************************/
		533
506	static void	534	static void
507	setup_coro (struct coro *coro)	535	setup_coro (struct coro *coro)
508	{	536	{
509	/*	537	/*
510	* emulate part of the perl startup here.	538	* emulate part of the perl startup here.
…		…
512		540
513	coro_init_stacks ();	541	coro_init_stacks ();
514		542
515	PL_curcop = &PL_compiling;	543	PL_curcop = &PL_compiling;
516	PL_in_eval = EVAL_NULL;	544	PL_in_eval = EVAL_NULL;
		545	PL_comppad = 0;
517	PL_curpm = 0;	546	PL_curpm = 0;
518	PL_localizing = 0;	547	PL_localizing = 0;
519	PL_dirty = 0;	548	PL_dirty = 0;
520	PL_restartop = 0;	549	PL_restartop = 0;
521		550
…		…
603		632
604	Newz (0, cctx, 1, coro_cctx);	633	Newz (0, cctx, 1, coro_cctx);
605		634
606	#if HAVE_MMAP	635	#if HAVE_MMAP
607		636
608	cctx->ssize = ((STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + STACKGUARD) * PAGESIZE;	637	cctx->ssize = ((CORO_STACKSIZE * sizeof (long) + PAGESIZE - 1) / PAGESIZE + CORO_STACKGUARD) * PAGESIZE;
609	/* mmap supposedly does allocate-on-write for us */	638	/* mmap supposedly does allocate-on-write for us */
610	cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);	639	cctx->sptr = mmap (0, cctx->ssize, PROT_EXEC\|PROT_READ\|PROT_WRITE, MAP_PRIVATE\|MAP_ANONYMOUS, 0, 0);
611		640
612	if (cctx->sptr == (void *)-1)	641	if (cctx->sptr != (void *)-1)
613	{
614	perror ("FATAL: unable to mmap stack for coroutine");
615	_exit (EXIT_FAILURE);
616	}	642	{
617
618	# if STACKGUARD	643	# if CORO_STACKGUARD
619	mprotect (cctx->sptr, STACKGUARD * PAGESIZE, PROT_NONE);	644	mprotect (cctx->sptr, CORO_STACKGUARD * PAGESIZE, PROT_NONE);
620	# endif	645	# endif
621		646	REGISTER_STACK (
622	#else	647	cctx,
623
624	cctx->ssize = STACKSIZE * (long)sizeof (long);
625	New (0, cctx->sptr, STACKSIZE, long);
626
627	if (!cctx->sptr)
628	{
629	perror ("FATAL: unable to malloc stack for coroutine");
630	_exit (EXIT_FAILURE);
631	}
632
633	#endif
634
635	#if USE_VALGRIND
636	cctx->valgrind_id = VALGRIND_STACK_REGISTER (
637	STACKGUARD * PAGESIZE + (char *)cctx->sptr,	648	CORO_STACKGUARD * PAGESIZE + (char *)cctx->sptr,
638	cctx->ssize + (char *)cctx->sptr	649	cctx->ssize + (char *)cctx->sptr
639	);	650	);
640	#endif
641		651
642	coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize);	652	coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, cctx->ssize);
		653	}
		654	else
		655	#endif
		656	{
		657	cctx->ssize = -CORO_STACKSIZE * (long)sizeof (long);
		658	New (0, cctx->sptr, CORO_STACKSIZE, long);
		659
		660	if (!cctx->sptr)
		661	{
		662	perror ("FATAL: unable to allocate stack for coroutine");
		663	_exit (EXIT_FAILURE);
		664	}
		665
		666	REGISTER_STACK (
		667	cctx,
		668	(char *)cctx->sptr,
		669	(char *)cctx->sptr - cctx->ssize
		670	);
		671
		672	coro_create (&cctx->cctx, coro_run, (void *)cctx, cctx->sptr, -cctx->ssize);
		673	}
643		674
644	return cctx;	675	return cctx;
645	}	676	}
646		677
647	static void	678	static void
…		…
650	if (!cctx)	681	if (!cctx)
651	return;	682	return;
652		683
653	--cctx_count;	684	--cctx_count;
654		685
655	#if USE_VALGRIND	686	#if CORO_USE_VALGRIND
656	VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);	687	VALGRIND_STACK_DEREGISTER (cctx->valgrind_id);
657	#endif	688	#endif
658		689
659	#if HAVE_MMAP	690	#if HAVE_MMAP
		691	if (cctx->ssize > 0)
660	munmap (cctx->sptr, cctx->ssize);	692	munmap (cctx->sptr, cctx->ssize);
661	#else	693	else
		694	#endif
662	Safefree (cctx->sptr);	695	Safefree (cctx->sptr);
663	#endif
664		696
665	Safefree (cctx);	697	Safefree (cctx);
666	}	698	}
667		699
668	static coro_cctx *	700	static coro_cctx *
…		…
702	++cctx_idle;	734	++cctx_idle;
703	cctx->next = cctx_first;	735	cctx->next = cctx_first;
704	cctx_first = cctx;	736	cctx_first = cctx;
705	}	737	}
706		738
		739	/ coroutine switching ***************************************************/
		740
707	/* never call directly, always through the coro_state_transfer global variable */	741	/* never call directly, always through the coro_state_transfer global variable */
708	static void NOINLINE	742	static void NOINLINE
709	transfer (struct coro prev, struct coro next)	743	transfer (struct coro prev, struct coro next)
710	{	744	{
711	dSTACKLEVEL;	745	dSTACKLEVEL;
712		746
713	/* sometimes transfer is only called to set idle_sp */	747	/* sometimes transfer is only called to set idle_sp */
714	if (!next)	748	if (!next)
715	{	749	{
716	((coro_cctx *)prev)->idle_sp = STACKLEVEL;	750	((coro_cctx *)prev)->idle_sp = STACKLEVEL;
717	assert (((coro_cctx )prev)->top_env = PL_top_env); / just for the side effetc when assert is enabled */	751	assert (((coro_cctx )prev)->idle_te = PL_top_env); / just for the side-effect when asserts are enabled */
718	}	752	}
719	else if (prev != next)	753	else if (prev != next)
720	{	754	{
721	coro_cctx *prev__cctx;	755	coro_cctx *prev__cctx;
722		756
…		…
733	if (!prev->flags & CF_RUNNING)	767	if (!prev->flags & CF_RUNNING)
734	croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");	768	croak ("Coro::State::transfer called with non-running prev Coro::State, but can only transfer from running states");
735		769
736	if (next->flags & CF_RUNNING)	770	if (next->flags & CF_RUNNING)
737	croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");	771	croak ("Coro::State::transfer called with running next Coro::State, but can only transfer to inactive states");
		772
		773	if (next->flags & CF_DESTROYED)
		774	croak ("Coro::State::transfer called with destroyed next Coro::State, but can only transfer to inactive states");
738		775
739	prev->flags &= ~CF_RUNNING;	776	prev->flags &= ~CF_RUNNING;
740	next->flags \|= CF_RUNNING;	777	next->flags \|= CF_RUNNING;
741		778
742	LOCK;	779	LOCK;
…		…
763		800
764	/* possibly "free" the cctx */	801	/* possibly "free" the cctx */
765	if (prev__cctx->idle_sp == STACKLEVEL)	802	if (prev__cctx->idle_sp == STACKLEVEL)
766	{	803	{
767	/* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */	804	/* I assume that STACKLEVEL is a stronger indicator than PL_top_env changes */
768	assert (PL_top_env == prev__cctx->top_env);	805	assert (("ERROR: current top_env must equal previous top_env", PL_top_env == prev__cctx->idle_te));
769		806
770	prev->cctx = 0;	807	prev->cctx = 0;
771		808
772	cctx_put (prev__cctx);	809	cctx_put (prev__cctx);
773	prev__cctx->inuse = 0;	810	prev__cctx->inuse = 0;
…		…
786	PL_top_env = next->cctx->top_env;	823	PL_top_env = next->cctx->top_env;
787	coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);	824	coro_transfer (&prev__cctx->cctx, &next->cctx->cctx);
788	}	825	}
789		826
790	free_coro_mortal ();	827	free_coro_mortal ();
791
792	UNLOCK;	828	UNLOCK;
793	}	829	}
794	}	830	}
795		831
796	struct transfer_args	832	struct transfer_args
…		…
798	struct coro prev, next;	834	struct coro prev, next;
799	};	835	};
800		836
801	#define TRANSFER(ta) transfer ((ta).prev, (ta).next)	837	#define TRANSFER(ta) transfer ((ta).prev, (ta).next)
802		838
		839	/ high level stuff ******************************************************/
		840
803	static void	841	static int
804	coro_state_destroy (struct coro *coro)	842	coro_state_destroy (struct coro *coro)
805	{	843	{
806	if (coro->refcnt--)	844	if (coro->flags & CF_DESTROYED)
807	return;	845	return 0;
		846
		847	coro->flags \|= CF_DESTROYED;
		848
		849	if (coro->flags & CF_READY)
		850	{
		851	/* reduce nready, as destroying a ready coro effectively unreadies it */
		852	/* alternative: look through all ready queues and remove the coro */
		853	LOCK;
		854	--coro_nready;
		855	UNLOCK;
		856	}
		857	else
		858	coro->flags \|= CF_READY; /* make sure it is NOT put into the readyqueue */
808		859
809	if (coro->mainstack && coro->mainstack != main_mainstack)	860	if (coro->mainstack && coro->mainstack != main_mainstack)
810	{	861	{
811	struct coro temp;	862	struct coro temp;
		863
		864	assert (!(coro->flags & CF_RUNNING));
		865
812	Zero (&temp, 1, struct coro);	866	Zero (&temp, 1, struct coro);
813	temp.save = CORO_SAVE_ALL;	867	temp.save = CORO_SAVE_ALL;
814		868
815	if (coro->flags & CF_RUNNING)	869	if (coro->flags & CF_RUNNING)
816	croak ("FATAL: tried to destroy currently running coroutine");	870	croak ("FATAL: tried to destroy currently running coroutine");
…		…
825	coro->mainstack = 0;	879	coro->mainstack = 0;
826	}	880	}
827		881
828	cctx_destroy (coro->cctx);	882	cctx_destroy (coro->cctx);
829	SvREFCNT_dec (coro->args);	883	SvREFCNT_dec (coro->args);
830	Safefree (coro);	884
		885	return 1;
831	}	886	}
832		887
833	static int	888	static int
834	coro_state_clear (pTHX_ SV sv, MAGIC mg)	889	coro_state_free (pTHX_ SV sv, MAGIC mg)
835	{	890	{
836	struct coro coro = (struct coro )mg->mg_ptr;	891	struct coro coro = (struct coro )mg->mg_ptr;
837	mg->mg_ptr = 0;	892	mg->mg_ptr = 0;
838		893
		894	if (--coro->refcnt < 0)
		895	{
839	coro_state_destroy (coro);	896	coro_state_destroy (coro);
		897	Safefree (coro);
		898	}
840		899
841	return 0;	900	return 0;
842	}	901	}
843		902
844	static int	903	static int
…		…
851	return 0;	910	return 0;
852	}	911	}
853		912
854	static MGVTBL coro_state_vtbl = {	913	static MGVTBL coro_state_vtbl = {
855	0, 0, 0, 0,	914	0, 0, 0, 0,
856	coro_state_clear,	915	coro_state_free,
857	0,	916	0,
858	#ifdef MGf_DUP	917	#ifdef MGf_DUP
859	coro_state_dup,	918	coro_state_dup,
860	#else	919	#else
861	# define MGf_DUP 0	920	# define MGf_DUP 0
…		…
912	return old_save;	971	return old_save;
913	}	972	}
914		973
915	/ Coro ******************************************************************/	974	/ Coro ******************************************************************/
916		975
917	#define PRIO_MAX 3
918	#define PRIO_HIGH 1
919	#define PRIO_NORMAL 0
920	#define PRIO_LOW -1
921	#define PRIO_IDLE -3
922	#define PRIO_MIN -4
923
924	/* for Coro.pm */
925	static SV *coro_current;
926	static AV *coro_ready [PRIO_MAX-PRIO_MIN+1];
927	static int coro_nready;
928
929	static void	976	static void
930	coro_enq (SV *coro_sv)	977	coro_enq (SV *coro_sv)
931	{	978	{
932	av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);	979	av_push (coro_ready [SvSTATE (coro_sv)->prio - PRIO_MIN], coro_sv);
933	coro_nready++;
934	}	980	}
935		981
936	static SV *	982	static SV *
937	coro_deq (int min_prio)	983	coro_deq (int min_prio)
938	{	984	{
…		…
942	if (min_prio < 0)	988	if (min_prio < 0)
943	min_prio = 0;	989	min_prio = 0;
944		990
945	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )	991	for (prio = PRIO_MAX - PRIO_MIN + 1; --prio >= min_prio; )
946	if (AvFILLp (coro_ready [prio]) >= 0)	992	if (AvFILLp (coro_ready [prio]) >= 0)
947	{
948	coro_nready--;
949	return av_shift (coro_ready [prio]);	993	return av_shift (coro_ready [prio]);
950	}
951		994
952	return 0;	995	return 0;
953	}	996	}
954		997
955	static int	998	static int
…		…
963	coro = SvSTATE (coro_sv);	1006	coro = SvSTATE (coro_sv);
964		1007
965	if (coro->flags & CF_READY)	1008	if (coro->flags & CF_READY)
966	return 0;	1009	return 0;
967		1010
968	#if 0 /* this is actually harmless */
969	if (coro->flags & CF_RUNNING)
970	croak ("Coro::ready called on currently running coroutine");
971	#endif
972
973	coro->flags \|= CF_READY;	1011	coro->flags \|= CF_READY;
974		1012
975	LOCK;	1013	LOCK;
976	coro_enq (SvREFCNT_inc (coro_sv));	1014	coro_enq (SvREFCNT_inc (coro_sv));
		1015	++coro_nready;
977	UNLOCK;	1016	UNLOCK;
978		1017
979	return 1;	1018	return 1;
980	}	1019	}
981		1020
982	static int	1021	static int
983	api_is_ready (SV *coro_sv)	1022	api_is_ready (SV *coro_sv)
984	{	1023	{
985	return !!SvSTATE (coro_sv)->flags & CF_READY;	1024	return !!(SvSTATE (coro_sv)->flags & CF_READY);
986	}	1025	}
987		1026
988	static void	1027	static void
989	prepare_schedule (struct transfer_args *ta)	1028	prepare_schedule (struct transfer_args *ta)
990	{	1029	{
991	SV prev, next;	1030	SV prev_sv, next_sv;
992		1031
993	for (;;)	1032	for (;;)
994	{	1033	{
995	LOCK;	1034	LOCK;
996	next = coro_deq (PRIO_MIN);	1035	next_sv = coro_deq (PRIO_MIN);
		1036
		1037	/* nothing to schedule: call the idle handler */
		1038	if (!next_sv)
		1039	{
		1040	dSP;
		1041	UNLOCK;
		1042
		1043	ENTER;
		1044	SAVETMPS;
		1045
		1046	PUSHMARK (SP);
		1047	PUTBACK;
		1048	call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
		1049
		1050	FREETMPS;
		1051	LEAVE;
		1052	continue;
		1053	}
		1054
		1055	ta->next = SvSTATE (next_sv);
		1056
		1057	/* cannot transfer to destroyed coros, skip and look for next */
		1058	if (ta->next->flags & CF_DESTROYED)
		1059	{
		1060	UNLOCK;
		1061	SvREFCNT_dec (next_sv);
		1062	/* coro_nready is already taken care of by destroy */
		1063	continue;
		1064	}
		1065
		1066	--coro_nready;
997	UNLOCK;	1067	UNLOCK;
998
999	if (next)
1000	break;	1068	break;
1001
1002	{
1003	dSP;
1004
1005	ENTER;
1006	SAVETMPS;
1007
1008	PUSHMARK (SP);
1009	PUTBACK;
1010	call_sv (get_sv ("Coro::idle", FALSE), G_DISCARD);
1011
1012	FREETMPS;
1013	LEAVE;
1014	}	1069	}
1015	}
1016
1017	prev = SvRV (coro_current);
1018	SvRV_set (coro_current, next);
1019		1070
1020	/* free this only after the transfer */	1071	/* free this only after the transfer */
		1072	prev_sv = SvRV (coro_current);
		1073	SvRV_set (coro_current, next_sv);
		1074	ta->prev = SvSTATE (prev_sv);
		1075
		1076	assert (ta->next->flags & CF_READY);
		1077	ta->next->flags &= ~CF_READY;
		1078
1021	LOCK;	1079	LOCK;
1022	free_coro_mortal ();	1080	free_coro_mortal ();
		1081	coro_mortal = prev_sv;
1023	UNLOCK;	1082	UNLOCK;
1024	coro_mortal = prev;
1025
1026	assert (!SvROK(prev));//D
1027	assert (!SvROK(next));//D
1028
1029	ta->prev = SvSTATE (prev);
1030	ta->next = SvSTATE (next);
1031
1032	assert (ta->next->flags & CF_READY);
1033	ta->next->flags &= ~CF_READY;
1034	}	1083	}
1035		1084
1036	static void	1085	static void
1037	prepare_cede (struct transfer_args *ta)	1086	prepare_cede (struct transfer_args *ta)
1038	{	1087	{
1039	api_ready (coro_current);	1088	api_ready (coro_current);
1040
1041	prepare_schedule (ta);	1089	prepare_schedule (ta);
		1090	}
		1091
		1092	static int
		1093	prepare_cede_notself (struct transfer_args *ta)
		1094	{
		1095	if (coro_nready)
		1096	{
		1097	SV *prev = SvRV (coro_current);
		1098	prepare_schedule (ta);
		1099	api_ready (prev);
		1100	return 1;
		1101	}
		1102	else
		1103	return 0;
1042	}	1104	}
1043		1105
1044	static void	1106	static void
1045	api_schedule (void)	1107	api_schedule (void)
1046	{	1108	{
…		…
1048		1110
1049	prepare_schedule (&ta);	1111	prepare_schedule (&ta);
1050	TRANSFER (ta);	1112	TRANSFER (ta);
1051	}	1113	}
1052		1114
1053	static void	1115	static int
1054	api_cede (void)	1116	api_cede (void)
1055	{	1117	{
1056	struct transfer_args ta;	1118	struct transfer_args ta;
1057		1119
1058	prepare_cede (&ta);	1120	prepare_cede (&ta);
		1121
		1122	if (ta.prev != ta.next)
		1123	{
1059	TRANSFER (ta);	1124	TRANSFER (ta);
		1125	return 1;
		1126	}
		1127	else
		1128	return 0;
		1129	}
		1130
		1131	static int
		1132	api_cede_notself (void)
		1133	{
		1134	struct transfer_args ta;
		1135
		1136	if (prepare_cede_notself (&ta))
		1137	{
		1138	TRANSFER (ta);
		1139	return 1;
		1140	}
		1141	else
		1142	return 0;
1060	}	1143	}
1061		1144
1062	MODULE = Coro::State PACKAGE = Coro::State	1145	MODULE = Coro::State PACKAGE = Coro::State
1063		1146
1064	PROTOTYPES: DISABLE	1147	PROTOTYPES: DISABLE
…		…
1120	_set_stacklevel (...)	1203	_set_stacklevel (...)
1121	ALIAS:	1204	ALIAS:
1122	Coro::State::transfer = 1	1205	Coro::State::transfer = 1
1123	Coro::schedule = 2	1206	Coro::schedule = 2
1124	Coro::cede = 3	1207	Coro::cede = 3
		1208	Coro::cede_notself = 4
1125	CODE:	1209	CODE:
1126	{	1210	{
1127	struct transfer_args ta;	1211	struct transfer_args ta;
1128		1212
1129	switch (ix)	1213	switch (ix)
…		…
1145	break;	1229	break;
1146		1230
1147	case 3:	1231	case 3:
1148	prepare_cede (&ta);	1232	prepare_cede (&ta);
1149	break;	1233	break;
		1234
		1235	case 4:
		1236	if (!prepare_cede_notself (&ta))
		1237	XSRETURN_EMPTY;
		1238
		1239	break;
1150	}	1240	}
1151		1241
		1242	BARRIER;
1152	TRANSFER (ta);	1243	TRANSFER (ta);
1153	}
1154		1244
1155	void	1245	if (GIMME_V != G_VOID && ta.next != ta.prev)
1156	_clone_state_from (SV dst, SV src)	1246	XSRETURN_YES;
		1247	}
		1248
		1249	bool
		1250	_destroy (SV *coro_sv)
1157	CODE:	1251	CODE:
1158	{	1252	RETVAL = coro_state_destroy (SvSTATE (coro_sv));
1159	struct coro *coro_src = SvSTATE (src);	1253	OUTPUT:
1160		1254	RETVAL
1161	sv_unmagic (SvRV (dst), PERL_MAGIC_ext);
1162
1163	++coro_src->refcnt;
1164	sv_magicext (SvRV (dst), 0, PERL_MAGIC_ext, &coro_state_vtbl, (char *)coro_src, 0)->mg_flags \|= MGf_DUP;
1165	}
1166		1255
1167	void	1256	void
1168	_exit (code)	1257	_exit (code)
1169	int code	1258	int code
1170	PROTOTYPE: $	1259	PROTOTYPE: $
…		…
1207	coro_ready[i] = newAV ();	1296	coro_ready[i] = newAV ();
1208		1297
1209	{	1298	{
1210	SV *sv = perl_get_sv("Coro::API", 1);	1299	SV *sv = perl_get_sv("Coro::API", 1);
1211		1300
1212	coroapi.schedule = api_schedule;	1301	coroapi.schedule = api_schedule;
1213	coroapi.save = api_save;	1302	coroapi.save = api_save;
1214	coroapi.cede = api_cede;	1303	coroapi.cede = api_cede;
		1304	coroapi.cede_notself = api_cede_notself;
1215	coroapi.ready = api_ready;	1305	coroapi.ready = api_ready;
1216	coroapi.is_ready = api_is_ready;	1306	coroapi.is_ready = api_is_ready;
1217	coroapi.nready = &coro_nready;	1307	coroapi.nready = &coro_nready;
1218	coroapi.current = coro_current;	1308	coroapi.current = coro_current;
1219		1309
1220	GCoroAPI = &coroapi;	1310	GCoroAPI = &coroapi;
1221	sv_setiv (sv, (IV)&coroapi);	1311	sv_setiv (sv, (IV)&coroapi);
1222	SvREADONLY_on (sv);	1312	SvREADONLY_on (sv);
1223	}	1313	}
…		…
1239	RETVAL = coro->prio;	1329	RETVAL = coro->prio;
1240		1330
1241	if (items > 1)	1331	if (items > 1)
1242	{	1332	{
1243	if (ix)	1333	if (ix)
1244	newprio += coro->prio;	1334	newprio = coro->prio - newprio;
1245		1335
1246	if (newprio < PRIO_MIN) newprio = PRIO_MIN;	1336	if (newprio < PRIO_MIN) newprio = PRIO_MIN;
1247	if (newprio > PRIO_MAX) newprio = PRIO_MAX;	1337	if (newprio > PRIO_MAX) newprio = PRIO_MAX;
1248		1338
1249	coro->prio = newprio;	1339	coro->prio = newprio;
1250	}	1340	}
1251	}	1341	}
		1342	OUTPUT:
		1343	RETVAL
1252		1344
1253	SV *	1345	SV *
1254	ready (SV *self)	1346	ready (SV *self)
1255	PROTOTYPE: $	1347	PROTOTYPE: $
1256	CODE:	1348	CODE:

Diff Legend

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

Comparing Coro/Coro/State.xs (file contents): Revision 1.125 by root, Mon Dec 11 20:54:45 2006 UTC vs. Revision 1.143 by root, Wed Feb 28 11:43:03 2007 UTC

Diff Legend

Comparing Coro/Coro/State.xs (file contents):
Revision 1.125 by root, Mon Dec 11 20:54:45 2006 UTC vs.
Revision 1.143 by root, Wed Feb 28 11:43:03 2007 UTC