WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/src/proc/thread.c


/*
 * Copyright (C) 2001-2004 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#include <proc/scheduler.h>
#include <proc/thread.h>
#include <proc/task.h>
#include <mm/heap.h>
#include <mm/frame.h>
#include <mm/page.h>
#include <arch/asm.h>
#include <arch.h>
#include <synch/synch.h>
#include <synch/spinlock.h>
#include <synch/waitq.h>
#include <synch/rwlock.h>
#include <cpu.h>
#include <func.h>
#include <context.h>
#include <list.h>
#include <typedefs.h>
#include <time/clock.h>
#include <list.h>
#include <config.h>
#include <arch/interrupt.h>
#include <smp/ipi.h>
#include <arch/faddr.h>
#include <arch/atomic.h>
 
char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /**< Thread states */
 
spinlock_t threads_lock;
link_t threads_head;
 
static spinlock_t tidlock;
__u32 last_tid = 0;
 
 
/** Thread wrapper
 *
 * This wrapper is provided to ensure that every thread
 * makes a call to thread_exit() when its implementing
 * function returns.
 *
 * cpu_priority_high() is assumed.
 *
 */
void cushion(void)
{
    void (*f)(void *) = THREAD->thread_code;
    void *arg = THREAD->thread_arg;
 
    before_thread_runs();
 
    /* this is where each thread wakes up after its creation */
    spinlock_unlock(&THREAD->lock);
    cpu_priority_low();
 
    f(arg);
    thread_exit();
    /* not reached */
}
 
 
/** Initialize threads
 *
 * Initialize kernel threads support.
 *
 */
void thread_init(void)
{
    THREAD = NULL;
    nrdy = 0;
    spinlock_initialize(&threads_lock);
    list_initialize(&threads_head);
}
 
 
/** Make thread ready
 *
 * Switch thread t to the ready state.
 *
 * @param t Thread to make ready.
 *
 */
void thread_ready(thread_t *t)
{
    cpu_t *cpu;
    runq_t *r;
    pri_t pri;
    int i, avg, send_ipi = 0;
 
    pri = cpu_priority_high();
 
    spinlock_lock(&t->lock);
 
    i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri;
   
    cpu = CPU;
    if (t->flags & X_WIRED) {
        cpu = t->cpu;
    }
    spinlock_unlock(&t->lock);
   
    /*
     * Append t to respective ready queue on respective processor.
     */
    r = &cpu->rq[i];
    spinlock_lock(&r->lock);
    list_append(&t->rq_link, &r->rq_head);
    r->n++;
    spinlock_unlock(&r->lock);
 
    atomic_inc(&nrdy);
    avg = nrdy / config.cpu_active;
 
    spinlock_lock(&cpu->lock);
    if ((++cpu->nrdy) > avg) {
        /*
         * If there are idle halted CPU's, this will wake them up.
         */
        ipi_broadcast(VECTOR_WAKEUP_IPI);
    }  
    spinlock_unlock(&cpu->lock);
 
    cpu_priority_restore(pri);
}
 
 
/** Create new thread
 *
 * Create a new thread.
 *
 * @param func  Thread's implementing function.
 * @param arg   Thread's implementing function argument.
 * @param task  Task to which the thread belongs.
 * @param flags Thread flags.
 *
 * @return New thread's structure on success, NULL on failure.
 *
 */
thread_t *thread_create(void (* func)(void *), void *arg, task_t *task, int flags)
{
    thread_t *t;
    __address frame_ks, frame_us = NULL;
 
    t = (thread_t *) malloc(sizeof(thread_t));
    if (t) {
        pri_t pri;
   
        spinlock_initialize(&t->lock);
   
        frame_ks = frame_alloc(FRAME_KA);
        if (THREAD_USER_STACK & flags) {
            frame_us = frame_alloc(FRAME_KA);
        }
 
        pri = cpu_priority_high();
        spinlock_lock(&tidlock);
        t->tid = ++last_tid;
        spinlock_unlock(&tidlock);
        cpu_priority_restore(pri);
 
        memsetb(frame_ks, THREAD_STACK_SIZE, 0);
        link_initialize(&t->rq_link);
        link_initialize(&t->wq_link);
        link_initialize(&t->th_link);
        link_initialize(&t->threads_link);
        t->kstack = (__u8 *) frame_ks;
        t->ustack = (__u8 *) frame_us;
       
       
        context_save(&t->saved_context);
        context_set(&t->saved_context, FADDR(cushion), t->kstack, THREAD_STACK_SIZE);
 
        pri = cpu_priority_high();
        t->saved_context.pri = cpu_priority_read();
        cpu_priority_restore(pri);
       
        t->thread_code = func;
        t->thread_arg = arg;
        t->ticks = -1;
        t->pri = -1;        /* start in rq[0] */
        t->cpu = NULL;
        t->flags = 0;
        t->state = Entering;
        t->call_me = NULL;
        t->call_me_with = NULL;
       
        timeout_initialize(&t->sleep_timeout);
        t->sleep_queue = NULL;
        t->timeout_pending = 0;
       
        t->rwlock_holder_type = RWLOCK_NONE;
       
        t->task = task;
       
        t->fpu_context_exists=0;
        t->fpu_context_engaged=0;
       
        /*
         * Register this thread in the system-wide list.
         */
        pri = cpu_priority_high();     
        spinlock_lock(&threads_lock);
        list_append(&t->threads_link, &threads_head);
        spinlock_unlock(&threads_lock);
 
        /*
         * Attach to the containing task.
         */
        spinlock_lock(&task->lock);
        list_append(&t->th_link, &task->th_head);
        spinlock_unlock(&task->lock);
 
        cpu_priority_restore(pri);
    }
 
    return t;
}
 
 
/** Make thread exiting
 *
 * End current thread execution and switch it to the exiting
 * state. All pending timeouts are executed.
 *
 */
void thread_exit(void)
{
    pri_t pri;
 
restart:
    pri = cpu_priority_high();
    spinlock_lock(&THREAD->lock);
    if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */
        spinlock_unlock(&THREAD->lock);
        cpu_priority_restore(pri);
        goto restart;
    }
    THREAD->state = Exiting;
    spinlock_unlock(&THREAD->lock);
    scheduler();
}
 
 
/** Thread sleep
 *
 * Suspend execution of the current thread.
 *
 * @param sec Number of seconds to sleep.
 *
 */
void thread_sleep(__u32 sec)
{
    thread_usleep(sec*1000000);
}
 
 
/** Thread usleep
 *
 * Suspend execution of the current thread.
 *
 * @param usec Number of microseconds to sleep.
 *
 */
void thread_usleep(__u32 usec)
{
    waitq_t wq;
                 
    waitq_initialize(&wq);
 
    (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);
}
 
 
/** Register thread out-of-context invocation
 *
 * Register a function and its argument to be executed
 * on next context switch to the current thread.
 *
 * @param call_me      Out-of-context function.
 * @param call_me_with Out-of-context function argument.
 *
 */
void thread_register_call_me(void (* call_me)(void *), void *call_me_with)
{
    pri_t pri;
   
    pri = cpu_priority_high();
    spinlock_lock(&THREAD->lock);
    THREAD->call_me = call_me;
    THREAD->call_me_with = call_me_with;
    spinlock_unlock(&THREAD->lock);
    cpu_priority_restore(pri);
}
 

Rev 115	Rev 125
1	/*	1	/*
2	* Copyright (C) 2001-2004 Jakub Jermar	2	* Copyright (C) 2001-2004 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	13	* documentation and/or other materials provided with the distribution.
14	* - The name of the author may not be used to endorse or promote products	14	* - The name of the author may not be used to endorse or promote products
15	* derived from this software without specific prior written permission.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF	25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	#include <proc/scheduler.h>	29	#include <proc/scheduler.h>
30	#include <proc/thread.h>	30	#include <proc/thread.h>
31	#include <proc/task.h>	31	#include <proc/task.h>
32	#include <mm/heap.h>	32	#include <mm/heap.h>
33	#include <mm/frame.h>	33	#include <mm/frame.h>
34	#include <mm/page.h>	34	#include <mm/page.h>
35	#include <arch/asm.h>	35	#include <arch/asm.h>
36	#include <arch.h>	36	#include <arch.h>
37	#include <synch/synch.h>	37	#include <synch/synch.h>
38	#include <synch/spinlock.h>	38	#include <synch/spinlock.h>
39	#include <synch/waitq.h>	39	#include <synch/waitq.h>
40	#include <synch/rwlock.h>	40	#include <synch/rwlock.h>
41	#include <cpu.h>	41	#include <cpu.h>
42	#include <func.h>	42	#include <func.h>
43	#include <context.h>	43	#include <context.h>
44	#include <list.h>	44	#include <list.h>
45	#include <typedefs.h>	45	#include <typedefs.h>
46	#include <time/clock.h>	46	#include <time/clock.h>
47	#include <list.h>	47	#include <list.h>
48	#include <config.h>	48	#include <config.h>
49	#include <arch/interrupt.h>	49	#include <arch/interrupt.h>
50	#include <smp/ipi.h>	50	#include <smp/ipi.h>
51	#include <arch/faddr.h>	51	#include <arch/faddr.h>
52	#include <arch/atomic.h>	52	#include <arch/atomic.h>
53		53
54	char thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /< Thread states /	54	char thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"}; /< Thread states /
55		55
56	spinlock_t threads_lock;	56	spinlock_t threads_lock;
57	link_t threads_head;	57	link_t threads_head;
58		58
59	static spinlock_t tidlock;	59	static spinlock_t tidlock;
60	__u32 last_tid = 0;	60	__u32 last_tid = 0;
61		61
62		62
63	/** Thread wrapper	63	/** Thread wrapper
64	*	64	*
65	* This wrapper is provided to ensure that every thread	65	* This wrapper is provided to ensure that every thread
66	* makes a call to thread_exit() when its implementing	66	* makes a call to thread_exit() when its implementing
67	* function returns.	67	* function returns.
68	*	68	*
69	* cpu_priority_high() is assumed.	69	* cpu_priority_high() is assumed.
70	*	70	*
71	*/	71	*/
72	void cushion(void)	72	void cushion(void)
73	{	73	{
74	void (f)(void ) = THREAD->thread_code;	74	void (f)(void ) = THREAD->thread_code;
75	void *arg = THREAD->thread_arg;	75	void *arg = THREAD->thread_arg;
76		76
77	before_thread_runs();	77	before_thread_runs();
78		78
79	/* this is where each thread wakes up after its creation */	79	/* this is where each thread wakes up after its creation */
80	spinlock_unlock(&THREAD->lock);	80	spinlock_unlock(&THREAD->lock);
81	cpu_priority_low();	81	cpu_priority_low();
82		82
83	f(arg);	83	f(arg);
84	thread_exit();	84	thread_exit();
85	/* not reached */	85	/* not reached */
86	}	86	}
87		87
88		88
89	/** Initialize threads	89	/** Initialize threads
90	*	90	*
91	* Initialize kernel threads support.	91	* Initialize kernel threads support.
92	*	92	*
93	*/	93	*/
94	void thread_init(void)	94	void thread_init(void)
95	{	95	{
96	THREAD = NULL;	96	THREAD = NULL;
97	nrdy = 0;	97	nrdy = 0;
98	spinlock_initialize(&threads_lock);	98	spinlock_initialize(&threads_lock);
99	list_initialize(&threads_head);	99	list_initialize(&threads_head);
100	}	100	}
101		101
102		102
103	/** Make thread ready	103	/** Make thread ready
104	*	104	*
105	* Switch thread t to the ready state.	105	* Switch thread t to the ready state.
106	*	106	*
107	* @param t Thread to make ready.	107	* @param t Thread to make ready.
108	*	108	*
109	*/	109	*/
110	void thread_ready(thread_t *t)	110	void thread_ready(thread_t *t)
111	{	111	{
112	cpu_t *cpu;	112	cpu_t *cpu;
113	runq_t *r;	113	runq_t *r;
114	pri_t pri;	114	pri_t pri;
115	int i, avg, send_ipi = 0;	115	int i, avg, send_ipi = 0;
116		116
117	pri = cpu_priority_high();	117	pri = cpu_priority_high();
118		118
119	spinlock_lock(&t->lock);	119	spinlock_lock(&t->lock);
120		120
121	i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri;	121	i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri;
122		122
123	cpu = CPU;	123	cpu = CPU;
124	if (t->flags & X_WIRED) {	124	if (t->flags & X_WIRED) {
125	cpu = t->cpu;	125	cpu = t->cpu;
126	}	126	}
127	spinlock_unlock(&t->lock);	127	spinlock_unlock(&t->lock);
128		128
129	/*	129	/*
130	* Append t to respective ready queue on respective processor.	130	* Append t to respective ready queue on respective processor.
131	*/	131	*/
132	r = &cpu->rq[i];	132	r = &cpu->rq[i];
133	spinlock_lock(&r->lock);	133	spinlock_lock(&r->lock);
134	list_append(&t->rq_link, &r->rq_head);	134	list_append(&t->rq_link, &r->rq_head);
135	r->n++;	135	r->n++;
136	spinlock_unlock(&r->lock);	136	spinlock_unlock(&r->lock);
137		137
138	atomic_inc(&nrdy);	138	atomic_inc(&nrdy);
139	avg = nrdy / config.cpu_active;	139	avg = nrdy / config.cpu_active;
140		140
141	spinlock_lock(&cpu->lock);	141	spinlock_lock(&cpu->lock);
142	if ((++cpu->nrdy) > avg) {	142	if ((++cpu->nrdy) > avg) {
143	/*	143	/*
144	* If there are idle halted CPU's, this will wake them up.	144	* If there are idle halted CPU's, this will wake them up.
145	*/	145	*/
146	ipi_broadcast(VECTOR_WAKEUP_IPI);	146	ipi_broadcast(VECTOR_WAKEUP_IPI);
147	}	147	}
148	spinlock_unlock(&cpu->lock);	148	spinlock_unlock(&cpu->lock);
149		149
150	cpu_priority_restore(pri);	150	cpu_priority_restore(pri);
151	}	151	}
152		152
153		153
154	/** Create new thread	154	/** Create new thread
155	*	155	*
156	* Create a new thread.	156	* Create a new thread.
157	*	157	*
158	* @param func Thread's implementing function.	158	* @param func Thread's implementing function.
159	* @param arg Thread's implementing function argument.	159	* @param arg Thread's implementing function argument.
160	* @param task Task to which the thread belongs.	160	* @param task Task to which the thread belongs.
161	* @param flags Thread flags.	161	* @param flags Thread flags.
162	*	162	*
163	* @return New thread's structure on success, NULL on failure.	163	* @return New thread's structure on success, NULL on failure.
164	*	164	*
165	*/	165	*/
166	thread_t thread_create(void ( func)(void ), void arg, task_t *task, int flags)	166	thread_t thread_create(void ( func)(void ), void arg, task_t *task, int flags)
167	{	167	{
168	thread_t *t;	168	thread_t *t;
169	__address frame_ks, frame_us = NULL;	169	__address frame_ks, frame_us = NULL;
170		170
171	t = (thread_t *) malloc(sizeof(thread_t));	171	t = (thread_t *) malloc(sizeof(thread_t));
172	if (t) {	172	if (t) {
173	pri_t pri;	173	pri_t pri;
174		174
175	spinlock_initialize(&t->lock);	175	spinlock_initialize(&t->lock);
176		176
177	frame_ks = frame_alloc(FRAME_KA);	177	frame_ks = frame_alloc(FRAME_KA);
178	if (THREAD_USER_STACK & flags) {	178	if (THREAD_USER_STACK & flags) {
179	frame_us = frame_alloc(FRAME_KA);	179	frame_us = frame_alloc(FRAME_KA);
180	}	180	}
181		181
182	pri = cpu_priority_high();	182	pri = cpu_priority_high();
183	spinlock_lock(&tidlock);	183	spinlock_lock(&tidlock);
184	t->tid = ++last_tid;	184	t->tid = ++last_tid;
185	spinlock_unlock(&tidlock);	185	spinlock_unlock(&tidlock);
186	cpu_priority_restore(pri);	186	cpu_priority_restore(pri);
187		187
188	memsetb(frame_ks, THREAD_STACK_SIZE, 0);	188	memsetb(frame_ks, THREAD_STACK_SIZE, 0);
189	link_initialize(&t->rq_link);	189	link_initialize(&t->rq_link);
190	link_initialize(&t->wq_link);	190	link_initialize(&t->wq_link);
191	link_initialize(&t->th_link);	191	link_initialize(&t->th_link);
192	link_initialize(&t->threads_link);	192	link_initialize(&t->threads_link);
193	t->kstack = (__u8 *) frame_ks;	193	t->kstack = (__u8 *) frame_ks;
194	t->ustack = (__u8 *) frame_us;	194	t->ustack = (__u8 *) frame_us;
195		195
196		196
197	context_save(&t->saved_context);	197	context_save(&t->saved_context);
198	context_set(&t->saved_context, FADDR(cushion), t->kstack, THREAD_STACK_SIZE);	198	context_set(&t->saved_context, FADDR(cushion), t->kstack, THREAD_STACK_SIZE);
199		199
200	pri = cpu_priority_high();	200	pri = cpu_priority_high();
201	t->saved_context.pri = cpu_priority_read();	201	t->saved_context.pri = cpu_priority_read();
202	cpu_priority_restore(pri);	202	cpu_priority_restore(pri);
203		203
204	t->thread_code = func;	204	t->thread_code = func;
205	t->thread_arg = arg;	205	t->thread_arg = arg;
206	t->ticks = -1;	206	t->ticks = -1;
207	t->pri = -1; /* start in rq[0] */	207	t->pri = -1; /* start in rq[0] */
208	t->cpu = NULL;	208	t->cpu = NULL;
209	t->flags = 0;	209	t->flags = 0;
210	t->state = Entering;	210	t->state = Entering;
211	t->call_me = NULL;	211	t->call_me = NULL;
212	t->call_me_with = NULL;	212	t->call_me_with = NULL;
213		213
214	timeout_initialize(&t->sleep_timeout);	214	timeout_initialize(&t->sleep_timeout);
215	t->sleep_queue = NULL;	215	t->sleep_queue = NULL;
216	t->timeout_pending = 0;	216	t->timeout_pending = 0;
217		217
218	t->rwlock_holder_type = RWLOCK_NONE;	218	t->rwlock_holder_type = RWLOCK_NONE;
219		219
220	t->task = task;	220	t->task = task;
221		221
222	t->fpu_context_exists=0;	222	t->fpu_context_exists=0;
223	t->fpu_context_engaged=0;	223	t->fpu_context_engaged=0;
224		224
225	/*	225	/*
226	* Register this thread in the system-wide list.	226	* Register this thread in the system-wide list.
227	*/	227	*/
228	pri = cpu_priority_high();	228	pri = cpu_priority_high();
229	spinlock_lock(&threads_lock);	229	spinlock_lock(&threads_lock);
230	list_append(&t->threads_link, &threads_head);	230	list_append(&t->threads_link, &threads_head);
231	spinlock_unlock(&threads_lock);	231	spinlock_unlock(&threads_lock);
232		232
233	/*	233	/*
234	* Attach to the containing task.	234	* Attach to the containing task.
235	*/	235	*/
236	spinlock_lock(&task->lock);	236	spinlock_lock(&task->lock);
237	list_append(&t->th_link, &task->th_head);	237	list_append(&t->th_link, &task->th_head);
238	spinlock_unlock(&task->lock);	238	spinlock_unlock(&task->lock);
239		239
240	cpu_priority_restore(pri);	240	cpu_priority_restore(pri);
241	}	241	}
242		242
243	return t;	243	return t;
244	}	244	}
245		245
246		246
247	/** Make thread exiting	247	/** Make thread exiting
248	*	248	*
249	* End current thread execution and switch it to the exiting	249	* End current thread execution and switch it to the exiting
250	* state. All pending timeouts are executed.	250	* state. All pending timeouts are executed.
251	*	251	*
252	*/	252	*/
253	void thread_exit(void)	253	void thread_exit(void)
254	{	254	{
255	pri_t pri;	255	pri_t pri;
256		256
257	restart:	257	restart:
258	pri = cpu_priority_high();	258	pri = cpu_priority_high();
259	spinlock_lock(&THREAD->lock);	259	spinlock_lock(&THREAD->lock);
260	if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */	260	if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */
261	spinlock_unlock(&THREAD->lock);	261	spinlock_unlock(&THREAD->lock);
262	cpu_priority_restore(pri);	262	cpu_priority_restore(pri);
263	goto restart;	263	goto restart;
264	}	264	}
265	THREAD->state = Exiting;	265	THREAD->state = Exiting;
266	spinlock_unlock(&THREAD->lock);	266	spinlock_unlock(&THREAD->lock);
267	scheduler();	267	scheduler();
268	}	268	}
269		269
270		270
271	/** Thread sleep	271	/** Thread sleep
272	*	272	*
273	* Suspend execution of the current thread.	273	* Suspend execution of the current thread.
274	*	274	*
275	* @param sec Number of seconds to sleep.	275	* @param sec Number of seconds to sleep.
276	*	276	*
277	*/	277	*/
278	void thread_sleep(__u32 sec)	278	void thread_sleep(__u32 sec)
279	{	279	{
280	thread_usleep(sec*1000000);	280	thread_usleep(sec*1000000);
281	}	281	}
282		282
283		283
284	/** Thread usleep	284	/** Thread usleep
285	*	285	*
286	* Suspend execution of the current thread.	286	* Suspend execution of the current thread.
287	*	287	*
288	* @param usec Number of microseconds to sleep.	288	* @param usec Number of microseconds to sleep.
289	*	289	*
290	*/	290	*/
291	void thread_usleep(__u32 usec)	291	void thread_usleep(__u32 usec)
292	{	292	{
293	waitq_t wq;	293	waitq_t wq;
294		294
295	waitq_initialize(&wq);	295	waitq_initialize(&wq);
296		296
297	(void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);	297	(void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);
298	}	298	}
299		299
300		300
301	/** Register thread out-of-context invocation	301	/** Register thread out-of-context invocation
302	*	302	*
303	* Register a function and its argument to be executed	303	* Register a function and its argument to be executed
304	* on next context switch to the current thread.	304	* on next context switch to the current thread.
305	*	305	*
306	* @param call_me Out-of-context function.	306	* @param call_me Out-of-context function.
307	* @param call_me_with Out-of-context function argument.	307	* @param call_me_with Out-of-context function argument.
308	*	308	*
309	*/	309	*/
310	void thread_register_call_me(void (* call_me)(void ), void call_me_with)	310	void thread_register_call_me(void (* call_me)(void ), void call_me_with)
311	{	311	{
312	pri_t pri;	312	pri_t pri;
313		313
314	pri = cpu_priority_high();	314	pri = cpu_priority_high();
315	spinlock_lock(&THREAD->lock);	315	spinlock_lock(&THREAD->lock);
316	THREAD->call_me = call_me;	316	THREAD->call_me = call_me;
317	THREAD->call_me_with = call_me_with;	317	THREAD->call_me_with = call_me_with;
318	spinlock_unlock(&THREAD->lock);	318	spinlock_unlock(&THREAD->lock);
319	cpu_priority_restore(pri);	319	cpu_priority_restore(pri);
320	}	320	}
321		321

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/thread.c @ 1760 – Rev 115 → 125