[J-u-boot.git] / examples / sched.c

/*
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of
 * the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
 * MA 02111-1307 USA
 */

#include <common.h>
#include <exports.h>

/*
 * Author: Arun Dharankar <[email protected]>
 *
 * A very simple thread/schedular model:
 *   - only one master thread, and no parent child relation maintained
 *   - parent thread cannot be stopped or deleted
 *   - no permissions or credentials
 *   - no elaborate safety checks
 *   - cooperative multi threading
 *   - Simple round-robin scheduleing with no priorities
 *   - no metering/statistics collection
 *
 * Basic idea of implementing this is to allow more than one tests to
 * execute "simultaneously".
 *
 * This may be modified such thread_yield may be called in syscalls, and
 * timer interrupts.
 */


#define MAX_THREADS 8

#define CTX_SIZE 512
#define STK_SIZE 8*1024

#define STATE_EMPTY 0
#define STATE_RUNNABLE 1
#define STATE_STOPPED 2
#define STATE_TERMINATED 2

#define MASTER_THREAD 0

#define RC_FAILURE	(-1)
#define	RC_SUCCESS	(0)

typedef	vu_char *jmp_ctx;
unsigned long setctxsp (vu_char *sp);
int ppc_setjmp(jmp_ctx env);
void ppc_longjmp(jmp_ctx env, int val);
#define setjmp	ppc_setjmp
#define longjmp	ppc_longjmp

struct lthread {
	int state;
	int retval;
	char stack[STK_SIZE];
	uchar context[CTX_SIZE];
	int (*func) (void *);
	void *arg;
};
static volatile struct lthread lthreads[MAX_THREADS];
static volatile int current_tid = MASTER_THREAD;


static uchar dbg = 0;

#define PDEBUG(fmt, args...)	 {					\
	if(dbg != 0) {							\
		printf("[%s %d %s]: ",__FILE__,__LINE__,__FUNCTION__);\
		printf(fmt, ##args);				\
		printf("\n");					\
	}								\
}

static int testthread (void *);
static void sched_init (void);
static int thread_create (int (*func) (void *), void *arg);
static int thread_start (int id);
static void thread_yield (void);
static int thread_delete (int id);
static int thread_join (int *ret);

#if 0							/* not used yet */
static int thread_stop (int id);
#endif							/* not used yet */

/* An example of schedular test */

#define NUMTHREADS 7
int sched (int ac, char *av[])
{
	int i, j;
	int tid[NUMTHREADS];
	int names[NUMTHREADS];

	app_startup(av);

	sched_init ();

	for (i = 0; i < NUMTHREADS; i++) {
		names[i] = i;
		j = thread_create (testthread, (void *) &names[i]);
		if (j == RC_FAILURE)
			printf ("schedtest: Failed to create thread %d\n", i);
		if (j > 0) {
			printf ("schedtest: Created thread with id %d, name %d\n",
						j, i);
			tid[i] = j;
		}
	}
	printf ("schedtest: Threads created\n");

	printf ("sched_test: function=0x%08x\n", (unsigned)testthread);
	for (i = 0; i < NUMTHREADS; i++) {
		printf ("schedtest: Setting thread %d runnable\n", tid[i]);
		thread_start (tid[i]);
		thread_yield ();
	}
	printf ("schedtest: Started %d threads\n", NUMTHREADS);

	while (1) {
		printf ("schedtest: Waiting for threads to complete\n");
		if (tstc () && getc () == 0x3) {
			printf ("schedtest: Aborting threads...\n");
			for (i = 0; i < NUMTHREADS; i++) {
				printf ("schedtest: Deleting thread %d\n", tid[i]);
				thread_delete (tid[i]);
			}
			return RC_SUCCESS;
		}
		j = -1;
		i = thread_join (&j);
		if (i == RC_FAILURE) {
			printf ("schedtest: No threads pending, "
						"exiting schedular test\n");
			return RC_SUCCESS;
		}
		printf ("schedtest: thread is %d returned %d\n", i, j);
		thread_yield ();
	}

	return RC_SUCCESS;
}

static int testthread (void *name)
{
	int i;

	printf ("testthread: Begin executing thread, myname %d, &i=0x%08x\n",
		*(int *) name, (unsigned)&i);

	printf ("Thread %02d, i=%d\n", *(int *) name, i);

	for (i = 0; i < 0xffff * (*(int *) name + 1); i++) {
		if (tstc () && getc () == 0x3) {
			printf ("testthread: myname %d terminating.\n",
						*(int *) name);
			return *(int *) name + 1;
		}

		if (i % 100 == 0)
			thread_yield ();
	}

	printf ("testthread: returning %d, i=0x%x\n",
				*(int *) name + 1, i);

	return *(int *) name + 1;
}


static void sched_init (void)
{
	int i;

	for (i = MASTER_THREAD + 1; i < MAX_THREADS; i++)
		lthreads[i].state = STATE_EMPTY;

	current_tid = MASTER_THREAD;
	lthreads[current_tid].state = STATE_RUNNABLE;
	PDEBUG ("sched_init: master context = 0x%08x",
		(unsigned)lthreads[current_tid].context);
	return;
}

static void thread_yield (void)
{
	static int i;

	PDEBUG ("thread_yield: current tid=%d", current_tid);

#define SWITCH(new) 							\
	if(lthreads[new].state == STATE_RUNNABLE) {			\
		PDEBUG("thread_yield: %d match, ctx=0x%08x",		\
			new,						\
			(unsigned)lthreads[current_tid].context);	\
		if(setjmp(lthreads[current_tid].context) == 0) {	\
			current_tid = new;				\
			PDEBUG("thread_yield: tid %d returns 0",	\
				new); 					\
			longjmp(lthreads[new].context, 1);		\
		} else {						\
			PDEBUG("thread_yield: tid %d returns 1",	\
				new); 					\
			return;						\
		}							\
	}

	for (i = current_tid + 1; i < MAX_THREADS; i++) {
		SWITCH (i);
	}

	if (current_tid != 0) {
		for (i = 0; i <= current_tid; i++) {
			SWITCH (i);
		}
	}

	PDEBUG ("thread_yield: returning from thread_yield");
	return;
}

static int thread_create (int (*func) (void *), void *arg)
{
	int i;

	for (i = MASTER_THREAD + 1; i < MAX_THREADS; i++) {
		if (lthreads[i].state == STATE_EMPTY) {
			lthreads[i].state = STATE_STOPPED;
			lthreads[i].func = func;
			lthreads[i].arg = arg;
			PDEBUG ("thread_create: returns new tid %d", i);
			return i;
		}
	}

	PDEBUG ("thread_create: returns failure");
	return RC_FAILURE;
}

static int thread_delete (int id)
{
	if (id <= MASTER_THREAD || id > MAX_THREADS)
		return RC_FAILURE;

	if (current_tid == id)
		return RC_FAILURE;

	lthreads[id].state = STATE_EMPTY;
	return RC_SUCCESS;
}

static void thread_launcher (void)
{
	PDEBUG ("thread_launcher: invoking func=0x%08x",
		   (unsigned)lthreads[current_tid].func);

	lthreads[current_tid].retval =
			lthreads[current_tid].func (lthreads[current_tid].arg);

	PDEBUG ("thread_launcher: tid %d terminated", current_tid);

	lthreads[current_tid].state = STATE_TERMINATED;
	thread_yield ();
	printf ("thread_launcher: should NEVER get here!\n");

	return;
}

static int thread_start (int id)
{
	PDEBUG ("thread_start: id=%d", id);
	if (id <= MASTER_THREAD || id > MAX_THREADS) {
		return RC_FAILURE;
	}

	if (lthreads[id].state != STATE_STOPPED)
		return RC_FAILURE;

	if (setjmp (lthreads[current_tid].context) == 0) {
		lthreads[id].state = STATE_RUNNABLE;
		current_tid = id;
		PDEBUG ("thread_start: to be stack=0%08x",
			(unsigned)lthreads[id].stack);
		setctxsp (&lthreads[id].stack[STK_SIZE]);
		thread_launcher ();
	}

	PDEBUG ("thread_start: Thread id=%d started, parent returns", id);

	return RC_SUCCESS;
}

#if 0	/* not used so far */
static int thread_stop (int id)
{
	if (id <= MASTER_THREAD || id >= MAX_THREADS)
		return RC_FAILURE;

	if (current_tid == id)
		return RC_FAILURE;

	lthreads[id].state = STATE_STOPPED;
	return RC_SUCCESS;
}
#endif	/* not used so far */

static int thread_join (int *ret)
{
	int i, j = 0;

	PDEBUG ("thread_join: *ret = %d", *ret);

	if (!(*ret == -1 || *ret > MASTER_THREAD || *ret < MAX_THREADS)) {
		PDEBUG ("thread_join: invalid tid %d", *ret);
		return RC_FAILURE;
	}

	if (*ret == -1) {
		PDEBUG ("Checking for tid = -1");
		while (1) {
			/* PDEBUG("thread_join: start while-loopn"); */
			j = 0;
			for (i = MASTER_THREAD + 1; i < MAX_THREADS; i++) {
				if (lthreads[i].state == STATE_TERMINATED) {
					*ret = lthreads[i].retval;
					lthreads[i].state = STATE_EMPTY;
					/* PDEBUG("thread_join: returning retval %d of tid %d",
					   ret, i); */
					return RC_SUCCESS;
				}

				if (lthreads[i].state != STATE_EMPTY) {
					PDEBUG ("thread_join: %d used slots tid %d state=%d",
						   j, i, lthreads[i].state);
					j++;
				}
			}
			if (j == 0) {
				PDEBUG ("thread_join: all slots empty!");
				return RC_FAILURE;
			}
			/*  PDEBUG("thread_join: yielding"); */
			thread_yield ();
			/*  PDEBUG("thread_join: back from yield"); */
		}
	}

	if (lthreads[*ret].state == STATE_TERMINATED) {
		i = *ret;
		*ret = lthreads[*ret].retval;
		lthreads[*ret].state = STATE_EMPTY;
		PDEBUG ("thread_join: returing %d for tid %d", *ret, i);
		return RC_SUCCESS;
	}

	PDEBUG ("thread_join: thread %d is not terminated!", *ret);
	return RC_FAILURE;
}
Commit	Line	Data
85ec0bcc WD	1	/*
	2	* This program is free software; you can redistribute it and/or
	3	* modify it under the terms of the GNU General Public License as
	4	* published by the Free Software Foundation; either version 2 of
	5	* the License, or (at your option) any later version.
3e38691e	6	*
85ec0bcc WD	7	* This program is distributed in the hope that it will be useful,
	8	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	9	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	10	* GNU General Public License for more details.
3e38691e	11	*
85ec0bcc WD	12	* You should have received a copy of the GNU General Public License
	13	* along with this program; if not, write to the Free Software
	14	* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
	15	* MA 02111-1307 USA
	16	*/
	17
	18	#include <common.h>
27b207fd	19	#include <exports.h>
85ec0bcc WD	20
	21	/*
	22	* Author: Arun Dharankar <[email protected]>
	23	*
	24	* A very simple thread/schedular model:
	25	* - only one master thread, and no parent child relation maintained
	26	* - parent thread cannot be stopped or deleted
	27	* - no permissions or credentials
	28	* - no elaborate safety checks
	29	* - cooperative multi threading
	30	* - Simple round-robin scheduleing with no priorities
	31	* - no metering/statistics collection
	32	*
	33	* Basic idea of implementing this is to allow more than one tests to
	34	* execute "simultaneously".
	35	*
	36	* This may be modified such thread_yield may be called in syscalls, and
	37	* timer interrupts.
	38	*/
	39
	40
	41	#define MAX_THREADS 8
	42
	43	#define CTX_SIZE 512
	44	#define STK_SIZE 8*1024
	45
	46	#define STATE_EMPTY 0
	47	#define STATE_RUNNABLE 1
	48	#define STATE_STOPPED 2
	49	#define STATE_TERMINATED 2
	50
	51	#define MASTER_THREAD 0
	52
	53	#define RC_FAILURE (-1)
	54	#define RC_SUCCESS (0)
	55
3e38691e WD	56	typedef vu_char *jmp_ctx;
	57	unsigned long setctxsp (vu_char *sp);
	58	int ppc_setjmp(jmp_ctx env);
	59	void ppc_longjmp(jmp_ctx env, int val);
	60	#define setjmp ppc_setjmp
	61	#define longjmp ppc_longjmp
	62
85ec0bcc WD	63	struct lthread {
	64	int state;
	65	int retval;
	66	char stack[STK_SIZE];
	67	uchar context[CTX_SIZE];
	68	int (func) (void );
	69	void *arg;
	70	};
	71	static volatile struct lthread lthreads[MAX_THREADS];
	72	static volatile int current_tid = MASTER_THREAD;
	73
	74
	75	static uchar dbg = 0;
	76
3e38691e WD	77	#define PDEBUG(fmt, args...) { \
3e38691e WD	78	if(dbg != 0) { \
27b207fd WD	79	printf("[%s %d %s]: ",__FILE__,__LINE__,__FUNCTION__);\
	80	printf(fmt, ##args); \
	81	printf("\n"); \
3e38691e WD	82	} \
3e38691e WD	83	}
85ec0bcc WD	84
	85	static int testthread (void *);
	86	static void sched_init (void);
	87	static int thread_create (int (func) (void ), void *arg);
	88	static int thread_start (int id);
	89	static void thread_yield (void);
	90	static int thread_delete (int id);
	91	static int thread_join (int *ret);
3e38691e WD	92
3e38691e WD	93	#if 0 /* not used yet */
85ec0bcc	94	static int thread_stop (int id);
3e38691e	95	#endif /* not used yet */
85ec0bcc WD	96
	97	/* An example of schedular test */
	98
	99	#define NUMTHREADS 7
27b207fd	100	int sched (int ac, char *av[])
85ec0bcc WD	101	{
	102	int i, j;
	103	int tid[NUMTHREADS];
	104	int names[NUMTHREADS];
	105
27b207fd WD	106	app_startup(av);
27b207fd WD	107
85ec0bcc WD	108	sched_init ();
	109
	110	for (i = 0; i < NUMTHREADS; i++) {
	111	names[i] = i;
	112	j = thread_create (testthread, (void *) &names[i]);
	113	if (j == RC_FAILURE)
27b207fd	114	printf ("schedtest: Failed to create thread %d\n", i);
85ec0bcc	115	if (j > 0) {
27b207fd	116	printf ("schedtest: Created thread with id %d, name %d\n",
3e38691e	117	j, i);
85ec0bcc WD	118	tid[i] = j;
	119	}
	120	}
27b207fd	121	printf ("schedtest: Threads created\n");
85ec0bcc	122
27b207fd	123	printf ("sched_test: function=0x%08x\n", (unsigned)testthread);
85ec0bcc	124	for (i = 0; i < NUMTHREADS; i++) {
27b207fd	125	printf ("schedtest: Setting thread %d runnable\n", tid[i]);
85ec0bcc WD	126	thread_start (tid[i]);
	127	thread_yield ();
	128	}
27b207fd	129	printf ("schedtest: Started %d threads\n", NUMTHREADS);
85ec0bcc WD	130
85ec0bcc WD	131	while (1) {
27b207fd WD	132	printf ("schedtest: Waiting for threads to complete\n");
	133	if (tstc () && getc () == 0x3) {
	134	printf ("schedtest: Aborting threads...\n");
85ec0bcc	135	for (i = 0; i < NUMTHREADS; i++) {
27b207fd	136	printf ("schedtest: Deleting thread %d\n", tid[i]);
85ec0bcc WD	137	thread_delete (tid[i]);
	138	}
	139	return RC_SUCCESS;
	140	}
	141	j = -1;
	142	i = thread_join (&j);
	143	if (i == RC_FAILURE) {
27b207fd	144	printf ("schedtest: No threads pending, "
3e38691e	145	"exiting schedular test\n");
85ec0bcc WD	146	return RC_SUCCESS;
85ec0bcc WD	147	}
27b207fd	148	printf ("schedtest: thread is %d returned %d\n", i, j);
85ec0bcc WD	149	thread_yield ();
	150	}
	151
	152	return RC_SUCCESS;
	153	}
	154
	155	static int testthread (void *name)
	156	{
	157	int i;
	158
27b207fd WD	159	printf ("testthread: Begin executing thread, myname %d, &i=0x%08x\n",
27b207fd WD	160	(int ) name, (unsigned)&i);
85ec0bcc	161
27b207fd	162	printf ("Thread %02d, i=%d\n", (int ) name, i);
85ec0bcc WD	163
85ec0bcc WD	164	for (i = 0; i < 0xffff * ((int ) name + 1); i++) {
27b207fd WD	165	if (tstc () && getc () == 0x3) {
27b207fd WD	166	printf ("testthread: myname %d terminating.\n",
3e38691e	167	(int ) name);
85ec0bcc WD	168	return (int ) name + 1;
	169	}
	170
	171	if (i % 100 == 0)
	172	thread_yield ();
	173	}
	174
27b207fd	175	printf ("testthread: returning %d, i=0x%x\n",
3e38691e	176	(int ) name + 1, i);
85ec0bcc WD	177
	178	return (int ) name + 1;
	179	}
	180
	181
	182	static void sched_init (void)
	183	{
	184	int i;
	185
	186	for (i = MASTER_THREAD + 1; i < MAX_THREADS; i++)
	187	lthreads[i].state = STATE_EMPTY;
	188
	189	current_tid = MASTER_THREAD;
	190	lthreads[current_tid].state = STATE_RUNNABLE;
3e38691e	191	PDEBUG ("sched_init: master context = 0x%08x",
27b207fd	192	(unsigned)lthreads[current_tid].context);
85ec0bcc WD	193	return;
	194	}
	195
	196	static void thread_yield (void)
	197	{
	198	static int i;
	199
3e38691e	200	PDEBUG ("thread_yield: current tid=%d", current_tid);
85ec0bcc WD	201
	202	#define SWITCH(new) \
	203	if(lthreads[new].state == STATE_RUNNABLE) { \
3e38691e	204	PDEBUG("thread_yield: %d match, ctx=0x%08x", \
27b207fd WD	205	new, \
27b207fd WD	206	(unsigned)lthreads[current_tid].context); \
85ec0bcc WD	207	if(setjmp(lthreads[current_tid].context) == 0) { \
85ec0bcc WD	208	current_tid = new; \
3e38691e	209	PDEBUG("thread_yield: tid %d returns 0", \
85ec0bcc WD	210	new); \
	211	longjmp(lthreads[new].context, 1); \
	212	} else { \
3e38691e	213	PDEBUG("thread_yield: tid %d returns 1", \
85ec0bcc WD	214	new); \
	215	return; \
	216	} \
	217	}
	218
	219	for (i = current_tid + 1; i < MAX_THREADS; i++) {
	220	SWITCH (i);
	221	}
	222
	223	if (current_tid != 0) {
	224	for (i = 0; i <= current_tid; i++) {
	225	SWITCH (i);
	226	}
	227	}
	228
3e38691e	229	PDEBUG ("thread_yield: returning from thread_yield");
85ec0bcc WD	230	return;
	231	}
	232
	233	static int thread_create (int (func) (void ), void *arg)
	234	{
	235	int i;
	236
	237	for (i = MASTER_THREAD + 1; i < MAX_THREADS; i++) {
	238	if (lthreads[i].state == STATE_EMPTY) {
	239	lthreads[i].state = STATE_STOPPED;
	240	lthreads[i].func = func;
	241	lthreads[i].arg = arg;
3e38691e	242	PDEBUG ("thread_create: returns new tid %d", i);
85ec0bcc WD	243	return i;
	244	}
	245	}
	246
3e38691e	247	PDEBUG ("thread_create: returns failure");
85ec0bcc WD	248	return RC_FAILURE;
	249	}
	250
	251	static int thread_delete (int id)
	252	{
	253	if (id <= MASTER_THREAD \|\| id > MAX_THREADS)
	254	return RC_FAILURE;
	255
	256	if (current_tid == id)
	257	return RC_FAILURE;
	258
	259	lthreads[id].state = STATE_EMPTY;
	260	return RC_SUCCESS;
	261	}
	262
	263	static void thread_launcher (void)
	264	{
3e38691e	265	PDEBUG ("thread_launcher: invoking func=0x%08x",
27b207fd	266	(unsigned)lthreads[current_tid].func);
85ec0bcc WD	267
85ec0bcc WD	268	lthreads[current_tid].retval =
3e38691e	269	lthreads[current_tid].func (lthreads[current_tid].arg);
85ec0bcc	270
3e38691e	271	PDEBUG ("thread_launcher: tid %d terminated", current_tid);
85ec0bcc WD	272
	273	lthreads[current_tid].state = STATE_TERMINATED;
	274	thread_yield ();
27b207fd	275	printf ("thread_launcher: should NEVER get here!\n");
85ec0bcc WD	276
	277	return;
	278	}
	279
	280	static int thread_start (int id)
	281	{
3e38691e	282	PDEBUG ("thread_start: id=%d", id);
85ec0bcc WD	283	if (id <= MASTER_THREAD \|\| id > MAX_THREADS) {
	284	return RC_FAILURE;
	285	}
	286
	287	if (lthreads[id].state != STATE_STOPPED)
	288	return RC_FAILURE;
	289
	290	if (setjmp (lthreads[current_tid].context) == 0) {
	291	lthreads[id].state = STATE_RUNNABLE;
	292	current_tid = id;
27b207fd WD	293	PDEBUG ("thread_start: to be stack=0%08x",
27b207fd WD	294	(unsigned)lthreads[id].stack);
85ec0bcc WD	295	setctxsp (&lthreads[id].stack[STK_SIZE]);
	296	thread_launcher ();
	297	}
	298
3e38691e	299	PDEBUG ("thread_start: Thread id=%d started, parent returns", id);
85ec0bcc WD	300
	301	return RC_SUCCESS;
	302	}
	303
27b207fd	304	#if 0 /* not used so far */
85ec0bcc WD	305	static int thread_stop (int id)
	306	{
	307	if (id <= MASTER_THREAD \|\| id >= MAX_THREADS)
	308	return RC_FAILURE;
	309
	310	if (current_tid == id)
	311	return RC_FAILURE;
	312
	313	lthreads[id].state = STATE_STOPPED;
	314	return RC_SUCCESS;
	315	}
27b207fd	316	#endif /* not used so far */
85ec0bcc WD	317
	318	static int thread_join (int *ret)
	319	{
	320	int i, j = 0;
	321
3e38691e	322	PDEBUG ("thread_join: ret = %d", ret);
85ec0bcc WD	323
85ec0bcc WD	324	if (!(ret == -1 \|\| ret > MASTER_THREAD \|\| *ret < MAX_THREADS)) {
3e38691e	325	PDEBUG ("thread_join: invalid tid %d", *ret);
85ec0bcc WD	326	return RC_FAILURE;
	327	}
	328
	329	if (*ret == -1) {
3e38691e	330	PDEBUG ("Checking for tid = -1");
85ec0bcc	331	while (1) {
3e38691e	332	/* PDEBUG("thread_join: start while-loopn"); */
85ec0bcc WD	333	j = 0;
	334	for (i = MASTER_THREAD + 1; i < MAX_THREADS; i++) {
	335	if (lthreads[i].state == STATE_TERMINATED) {
	336	*ret = lthreads[i].retval;
	337	lthreads[i].state = STATE_EMPTY;
3e38691e WD	338	/* PDEBUG("thread_join: returning retval %d of tid %d",
3e38691e WD	339	ret, i); */
85ec0bcc WD	340	return RC_SUCCESS;
	341	}
	342
	343	if (lthreads[i].state != STATE_EMPTY) {
3e38691e WD	344	PDEBUG ("thread_join: %d used slots tid %d state=%d",
3e38691e WD	345	j, i, lthreads[i].state);
85ec0bcc WD	346	j++;
	347	}
	348	}
	349	if (j == 0) {
3e38691e	350	PDEBUG ("thread_join: all slots empty!");
85ec0bcc WD	351	return RC_FAILURE;
85ec0bcc WD	352	}
3e38691e	353	/* PDEBUG("thread_join: yielding"); */
85ec0bcc	354	thread_yield ();
3e38691e	355	/* PDEBUG("thread_join: back from yield"); */
85ec0bcc WD	356	}
	357	}
	358
	359	if (lthreads[*ret].state == STATE_TERMINATED) {
	360	i = *ret;
	361	ret = lthreads[ret].retval;
	362	lthreads[*ret].state = STATE_EMPTY;
3e38691e	363	PDEBUG ("thread_join: returing %d for tid %d", *ret, i);
85ec0bcc WD	364	return RC_SUCCESS;
	365	}
	366
3e38691e	367	PDEBUG ("thread_join: thread %d is not terminated!", *ret);
85ec0bcc WD	368	return RC_FAILURE;
85ec0bcc WD	369	}