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>
 
char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"};
 
spinlock_t threads_lock;
link_t threads_head;
 
static spinlock_t tidlock;
__u32 last_tid = 0;
 
/*
 * cushion() is provided to ensure that every thread
 * makes a call to thread_exit() when its implementing
 * function returns.
 *
 * cpu_priority_high()'d
 */
void cushion(void)
{
    void (*f)(void *) = THREAD->thread_code;
    void *arg = THREAD->thread_arg;
 
    /* this is where each thread wakes up after its creation */
    spinlock_unlock(&THREAD->lock);
    cpu_priority_low();
 
    f(arg);
    thread_exit();
    /* not reached */
}
 
void thread_init(void)
{
    THREAD = NULL;
    nrdy = 0;
    spinlock_initialize(&threads_lock);
    list_initialize(&threads_head);
}
 
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);
 
    spinlock_lock(&nrdylock);
    avg = ++nrdy / config.cpu_active;
    spinlock_unlock(&nrdylock);
 
    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);
}
 
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(0);
        }
 
        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);
        t->saved_context.pc = (__address) cushion;
        t->saved_context.sp = (__address) &t->kstack[THREAD_STACK_SIZE-8];
 
        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;
       
        /*
         * 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;
}
 
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();
}
 
void thread_sleep(__u32 sec)
{
        thread_usleep(sec*1000000);
}
   
/*
 * Suspend execution of current thread for usec microseconds.
 */
void thread_usleep(__u32 usec)
{
    waitq_t wq;
                 
    waitq_initialize(&wq);
 
    (void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);
}
 
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 15	Rev 16
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		51
52	char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"};	52	char *thread_states[] = {"Invalid", "Running", "Sleeping", "Ready", "Entering", "Exiting"};
53		53
54	spinlock_t threads_lock;	54	spinlock_t threads_lock;
55	link_t threads_head;	55	link_t threads_head;
56		56
57	static spinlock_t tidlock;	57	static spinlock_t tidlock;
58	__u32 last_tid = 0;	58	__u32 last_tid = 0;
59		59
60	/*	60	/*
61	* cushion() is provided to ensure that every thread	61	* cushion() is provided to ensure that every thread
62	* makes a call to thread_exit() when its implementing	62	* makes a call to thread_exit() when its implementing
63	* function returns.	63	* function returns.
64	*	64	*
65	* cpu_priority_high()'d	65	* cpu_priority_high()'d
66	*/	66	*/
67	void cushion(void)	67	void cushion(void)
68	{	68	{
69	void (f)(void ) = THREAD->thread_code;	69	void (f)(void ) = THREAD->thread_code;
70	void *arg = THREAD->thread_arg;	70	void *arg = THREAD->thread_arg;
71		71
72	/* this is where each thread wakes up after its creation */	72	/* this is where each thread wakes up after its creation */
73	spinlock_unlock(&THREAD->lock);	73	spinlock_unlock(&THREAD->lock);
74	cpu_priority_low();	74	cpu_priority_low();
75		75
76	f(arg);	76	f(arg);
77	thread_exit();	77	thread_exit();
78	/* not reached */	78	/* not reached */
79	}	79	}
80		80
81	void thread_init(void)	81	void thread_init(void)
82	{	82	{
83	THREAD = NULL;	83	THREAD = NULL;
84	nrdy = 0;	84	nrdy = 0;
85	spinlock_initialize(&threads_lock);	85	spinlock_initialize(&threads_lock);
86	list_initialize(&threads_head);	86	list_initialize(&threads_head);
87	}	87	}
88		88
89	void thread_ready(thread_t *t)	89	void thread_ready(thread_t *t)
90	{	90	{
91	cpu_t *cpu;	91	cpu_t *cpu;
92	runq_t *r;	92	runq_t *r;
93	pri_t pri;	93	pri_t pri;
94	int i, avg, send_ipi = 0;	94	int i, avg, send_ipi = 0;
95		95
96	pri = cpu_priority_high();	96	pri = cpu_priority_high();
97		97
98	spinlock_lock(&t->lock);	98	spinlock_lock(&t->lock);
99		99
100	i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri;	100	i = (t->pri < RQ_COUNT -1) ? ++t->pri : t->pri;
101		101
102	cpu = the->cpu;	102	cpu = CPU;
103	if (t->flags & X_WIRED) {	103	if (t->flags & X_WIRED) {
104	cpu = t->cpu;	104	cpu = t->cpu;
105	}	105	}
106	spinlock_unlock(&t->lock);	106	spinlock_unlock(&t->lock);
107		107
108	/*	108	/*
109	* Append t to respective ready queue on respective processor.	109	* Append t to respective ready queue on respective processor.
110	*/	110	*/
111	r = &cpu->rq[i];	111	r = &cpu->rq[i];
112	spinlock_lock(&r->lock);	112	spinlock_lock(&r->lock);
113	list_append(&t->rq_link, &r->rq_head);	113	list_append(&t->rq_link, &r->rq_head);
114	r->n++;	114	r->n++;
115	spinlock_unlock(&r->lock);	115	spinlock_unlock(&r->lock);
116		116
117	spinlock_lock(&nrdylock);	117	spinlock_lock(&nrdylock);
118	avg = ++nrdy / config.cpu_active;	118	avg = ++nrdy / config.cpu_active;
119	spinlock_unlock(&nrdylock);	119	spinlock_unlock(&nrdylock);
120		120
121	spinlock_lock(&cpu->lock);	121	spinlock_lock(&cpu->lock);
122	if ((++cpu->nrdy) > avg) {	122	if ((++cpu->nrdy) > avg) {
123	/*	123	/*
124	* If there are idle halted CPU's, this will wake them up.	124	* If there are idle halted CPU's, this will wake them up.
125	*/	125	*/
126	ipi_broadcast(VECTOR_WAKEUP_IPI);	126	ipi_broadcast(VECTOR_WAKEUP_IPI);
127	}	127	}
128	spinlock_unlock(&cpu->lock);	128	spinlock_unlock(&cpu->lock);
129		129
130	cpu_priority_restore(pri);	130	cpu_priority_restore(pri);
131	}	131	}
132		132
133	thread_t thread_create(void ( func)(void ), void arg, task_t *task, int flags)	133	thread_t thread_create(void ( func)(void ), void arg, task_t *task, int flags)
134	{	134	{
135	thread_t *t;	135	thread_t *t;
136	__address frame_ks, frame_us = NULL;	136	__address frame_ks, frame_us = NULL;
137		137
138	t = (thread_t *) malloc(sizeof(thread_t));	138	t = (thread_t *) malloc(sizeof(thread_t));
139	if (t) {	139	if (t) {
140	pri_t pri;	140	pri_t pri;
141		141
142	spinlock_initialize(&t->lock);	142	spinlock_initialize(&t->lock);
143		143
144	frame_ks = frame_alloc(FRAME_KA);	144	frame_ks = frame_alloc(FRAME_KA);
145	if (THREAD_USER_STACK & flags) {	145	if (THREAD_USER_STACK & flags) {
146	frame_us = frame_alloc(0);	146	frame_us = frame_alloc(0);
147	}	147	}
148		148
149	pri = cpu_priority_high();	149	pri = cpu_priority_high();
150	spinlock_lock(&tidlock);	150	spinlock_lock(&tidlock);
151	t->tid = ++last_tid;	151	t->tid = ++last_tid;
152	spinlock_unlock(&tidlock);	152	spinlock_unlock(&tidlock);
153	cpu_priority_restore(pri);	153	cpu_priority_restore(pri);
154		154
155	memsetb(frame_ks, THREAD_STACK_SIZE, 0);	155	memsetb(frame_ks, THREAD_STACK_SIZE, 0);
156	link_initialize(&t->rq_link);	156	link_initialize(&t->rq_link);
157	link_initialize(&t->wq_link);	157	link_initialize(&t->wq_link);
158	link_initialize(&t->th_link);	158	link_initialize(&t->th_link);
159	link_initialize(&t->threads_link);	159	link_initialize(&t->threads_link);
160	t->kstack = (__u8 *) frame_ks;	160	t->kstack = (__u8 *) frame_ks;
161	t->ustack = (__u8 *) frame_us;	161	t->ustack = (__u8 *) frame_us;
162		162
163		163
164	context_save(&t->saved_context);	164	context_save(&t->saved_context);
165	t->saved_context.pc = (__address) cushion;	165	t->saved_context.pc = (__address) cushion;
166	t->saved_context.sp = (__address) &t->kstack[THREAD_STACK_SIZE-8];	166	t->saved_context.sp = (__address) &t->kstack[THREAD_STACK_SIZE-8];
167		167
168	pri = cpu_priority_high();	168	pri = cpu_priority_high();
169	t->saved_context.pri = cpu_priority_read();	169	t->saved_context.pri = cpu_priority_read();
170	cpu_priority_restore(pri);	170	cpu_priority_restore(pri);
171		171
172	t->thread_code = func;	172	t->thread_code = func;
173	t->thread_arg = arg;	173	t->thread_arg = arg;
174	t->ticks = -1;	174	t->ticks = -1;
175	t->pri = -1; /* start in rq[0] */	175	t->pri = -1; /* start in rq[0] */
176	t->cpu = NULL;	176	t->cpu = NULL;
177	t->flags = 0;	177	t->flags = 0;
178	t->state = Entering;	178	t->state = Entering;
179	t->call_me = NULL;	179	t->call_me = NULL;
180	t->call_me_with = NULL;	180	t->call_me_with = NULL;
181		181
182	timeout_initialize(&t->sleep_timeout);	182	timeout_initialize(&t->sleep_timeout);
183	t->sleep_queue = NULL;	183	t->sleep_queue = NULL;
184	t->timeout_pending = 0;	184	t->timeout_pending = 0;
185		185
186	t->rwlock_holder_type = RWLOCK_NONE;	186	t->rwlock_holder_type = RWLOCK_NONE;
187		187
188	t->task = task;	188	t->task = task;
189		189
190	/*	190	/*
191	* Register this thread in the system-wide list.	191	* Register this thread in the system-wide list.
192	*/	192	*/
193	pri = cpu_priority_high();	193	pri = cpu_priority_high();
194	spinlock_lock(&threads_lock);	194	spinlock_lock(&threads_lock);
195	list_append(&t->threads_link, &threads_head);	195	list_append(&t->threads_link, &threads_head);
196	spinlock_unlock(&threads_lock);	196	spinlock_unlock(&threads_lock);
197		197
198	/*	198	/*
199	* Attach to the containing task.	199	* Attach to the containing task.
200	*/	200	*/
201	spinlock_lock(&task->lock);	201	spinlock_lock(&task->lock);
202	list_append(&t->th_link, &task->th_head);	202	list_append(&t->th_link, &task->th_head);
203	spinlock_unlock(&task->lock);	203	spinlock_unlock(&task->lock);
204		204
205	cpu_priority_restore(pri);	205	cpu_priority_restore(pri);
206	}	206	}
207		207
208	return t;	208	return t;
209	}	209	}
210		210
211	void thread_exit(void)	211	void thread_exit(void)
212	{	212	{
213	pri_t pri;	213	pri_t pri;
214		214
215	restart:	215	restart:
216	pri = cpu_priority_high();	216	pri = cpu_priority_high();
217	spinlock_lock(&THREAD->lock);	217	spinlock_lock(&THREAD->lock);
218	if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */	218	if (THREAD->timeout_pending) { /* busy waiting for timeouts in progress */
219	spinlock_unlock(&THREAD->lock);	219	spinlock_unlock(&THREAD->lock);
220	cpu_priority_restore(pri);	220	cpu_priority_restore(pri);
221	goto restart;	221	goto restart;
222	}	222	}
223	THREAD->state = Exiting;	223	THREAD->state = Exiting;
224	spinlock_unlock(&THREAD->lock);	224	spinlock_unlock(&THREAD->lock);
225	scheduler();	225	scheduler();
226	}	226	}
227		227
228	void thread_sleep(__u32 sec)	228	void thread_sleep(__u32 sec)
229	{	229	{
230	thread_usleep(sec*1000000);	230	thread_usleep(sec*1000000);
231	}	231	}
232		232
233	/*	233	/*
234	* Suspend execution of current thread for usec microseconds.	234	* Suspend execution of current thread for usec microseconds.
235	*/	235	*/
236	void thread_usleep(__u32 usec)	236	void thread_usleep(__u32 usec)
237	{	237	{
238	waitq_t wq;	238	waitq_t wq;
239		239
240	waitq_initialize(&wq);	240	waitq_initialize(&wq);
241		241
242	(void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);	242	(void) waitq_sleep_timeout(&wq, usec, SYNCH_NON_BLOCKING);
243	}	243	}
244		244
245	void thread_register_call_me(void (* call_me)(void ), void call_me_with)	245	void thread_register_call_me(void (* call_me)(void ), void call_me_with)
246	{	246	{
247	pri_t pri;	247	pri_t pri;
248		248
249	pri = cpu_priority_high();	249	pri = cpu_priority_high();
250	spinlock_lock(&THREAD->lock);	250	spinlock_lock(&THREAD->lock);
251	THREAD->call_me = call_me;	251	THREAD->call_me = call_me;
252	THREAD->call_me_with = call_me_with;	252	THREAD->call_me_with = call_me_with;
253	spinlock_unlock(&THREAD->lock);	253	spinlock_unlock(&THREAD->lock);
254	cpu_priority_restore(pri);	254	cpu_priority_restore(pri);
255	}	255	}
256		256

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/src/proc/thread.c @ 1780 – Rev 15 → 16