WebSVN – HelenOS – Diff – /trunk/kernel/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>
 
#ifdef __SMP__
#include <arch/interrupt.h>
#include <arch/apic.h>
#endif /* __SMP__ */
 
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 *) = the->thread->thread_code;
    void *arg = the->thread->thread_arg;
 
    /* this is where each thread wakes up after its creation */
    spinlock_unlock(&the->thread->lock);
    cpu_priority_low();
 
    f(arg);
    thread_exit();
    /* not reached */
}
 
void thread_init(void)
{
    the->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 = the->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 && (config.cpu_active == config.cpu_count)) {
        /*
         * If there are idle halted CPU's, this will wake them up.
         */
        #ifdef __SMP__
        l_apic_broadcast_custom_ipi(VECTOR_WAKEUP_IPI);
        #endif /* __SMP__  */
    }  
    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(&the->thread->lock);
    if (the->thread->timeout_pending) { /* busy waiting for timeouts in progress */
        spinlock_unlock(&the->thread->lock);
        cpu_priority_restore(pri);
        goto restart;
    }
    the->thread->state = Exiting;
    spinlock_unlock(&the->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(&the->thread->lock);
    the->thread->call_me = call_me;
    the->thread->call_me_with = call_me_with;
    spinlock_unlock(&the->thread->lock);
    cpu_priority_restore(pri);
}
 

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

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/proc/thread.c @ 2071 – Rev 1 → 7