WebSVN – HelenOS – Diff – /branches/dynload/kernel/generic/src/ipc/kbox.c


/*
 * Copyright (c) 2008 Jiri Svoboda
 * 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.
 */
 
/** @addtogroup genericipc
 * @{
 */
/** @file
 */
 
#include <synch/synch.h>
#include <synch/spinlock.h>
#include <synch/mutex.h>
#include <ipc/ipc.h>
#include <ipc/ipcrsc.h>
#include <arch.h>
#include <errno.h>
#include <debug.h>
#include <udebug/udebug_ipc.h>
#include <ipc/kbox.h>
 
void ipc_kbox_cleanup(void)
{
    ipl_t ipl;
    bool have_kb_thread;
 
    /*
     * Only hold kb.cleanup_lock while setting kb.finished -
     * this is enough.
     */
    mutex_lock(&TASK->kb.cleanup_lock);
    TASK->kb.finished = true;
    mutex_unlock(&TASK->kb.cleanup_lock);
 
    have_kb_thread = (TASK->kb.thread != NULL);
 
    /*
     * From now on nobody will try to connect phones or attach
     * kbox threads
     */
 
    /*
     * Disconnect all phones connected to our kbox. Passing true for
     * notify_box causes a HANGUP message to be inserted for each
     * disconnected phone. This ensures the kbox thread is going to
     * wake up and terminate.
     */
    ipc_answerbox_slam_phones(&TASK->kb.box, have_kb_thread);
 
    /*
     * If the task was being debugged, clean up debugging session.
     * This is necessarry as slamming the phones won't force
     * kbox thread to clean it up since sender != debugger.
     */
    ipl = interrupts_disable();
    spinlock_lock(&TASK->lock);
    udebug_task_cleanup(TASK);
    spinlock_unlock(&TASK->lock);
    interrupts_restore(ipl);
   
    if (have_kb_thread) {
        LOG("join kb.thread..\n");
        thread_join(TASK->kb.thread);
        thread_detach(TASK->kb.thread);
        LOG("join done\n");
        TASK->kb.thread = NULL;
    }
 
    /* Answer all messages in 'calls' and 'dispatched_calls' queues. */
    spinlock_lock(&TASK->kb.box.lock);
    ipc_cleanup_call_list(&TASK->kb.box.dispatched_calls);
    ipc_cleanup_call_list(&TASK->kb.box.calls);
    spinlock_unlock(&TASK->kb.box.lock);
}
 
/** Handle hangup message in kbox.
 *
 * @param call  The IPC_M_PHONE_HUNGUP call structure.
 * @param last  Output, the function stores @c true here if
 *      this was the last phone, @c false otherwise.
 **/
static void kbox_proc_phone_hungup(call_t *call, bool *last)
{
    ipl_t ipl;
 
    LOG("kbox_proc_phone_hungup()\n");
 
    /* Was it our debugger, who hung up? */
    if (call->sender == TASK->udebug.debugger) {
        /* Terminate debugging session (if any). */
        LOG("kbox: terminate debug session\n");
        ipl = interrupts_disable();
        spinlock_lock(&TASK->lock);
        udebug_task_cleanup(TASK);
        spinlock_unlock(&TASK->lock);
        interrupts_restore(ipl);
    } else {
        LOG("kbox: was not debugger\n");
    }
 
    LOG("kbox: continue with hangup message\n");
    IPC_SET_RETVAL(call->data, 0);
    ipc_answer(&TASK->kb.box, call);
 
    ipl = interrupts_disable();
    spinlock_lock(&TASK->lock);
    spinlock_lock(&TASK->answerbox.lock);
    if (list_empty(&TASK->answerbox.connected_phones)) {
        /*
         * Last phone has been disconnected. Detach this thread so it
         * gets freed and signal to the caller.
         */
 
        /* Only detach kbox thread unless already terminating. */
        mutex_lock(&TASK->kb.cleanup_lock);
        if (&TASK->kb.finished == false) {
            /* Detach kbox thread so it gets freed from memory. */
            thread_detach(TASK->kb.thread);
            TASK->kb.thread = NULL;
        }
        mutex_unlock(&TASK->kb.cleanup_lock);
 
        LOG("phone list is empty\n");
        *last = true;
    } else {
        *last = false;
    }
 
    spinlock_unlock(&TASK->answerbox.lock);
    spinlock_unlock(&TASK->lock);
    interrupts_restore(ipl);
}
 
/** Implementing function for the kbox thread.
 *
 * This function listens for debug requests. It terminates
 * when all phones are disconnected from the kbox.
 *
 * @param arg   Ignored.
 */
static void kbox_thread_proc(void *arg)
{
    call_t *call;
    bool done;
 
    (void)arg;
    LOG("kbox_thread_proc()\n");
    done = false;
 
    while (!done) {
        call = ipc_wait_for_call(&TASK->kb.box, SYNCH_NO_TIMEOUT,
            SYNCH_FLAGS_NONE);
 
        if (call == NULL)
            continue;   /* Try again. */
 
        switch (IPC_GET_METHOD(call->data)) {
 
        case IPC_M_DEBUG_ALL:
            /* Handle debug call. */
            udebug_call_receive(call);
            break;
 
        case IPC_M_PHONE_HUNGUP:
            /*
             * Process the hangup call. If this was the last
             * phone, done will be set to true and the
             * while loop will terminate.
             */
            kbox_proc_phone_hungup(call, &done);
            break;
 
        default:
            /* Ignore */
            break;
        }
    }
 
    LOG("kbox: finished\n");
}
 
 
/**
 * Connect phone to a task kernel-box specified by id.
 *
 * Note that this is not completely atomic. For optimisation reasons, the task
 * might start cleaning up kbox after the phone has been connected and before
 * a kbox thread has been created. This must be taken into account in the
 * cleanup code.
 *
 * @return      Phone id on success, or negative error code.
 */
int ipc_connect_kbox(task_id_t taskid)
{
    int newphid;
    task_t *ta;
    thread_t *kb_thread;
    ipl_t ipl;
 
    ipl = interrupts_disable();
    spinlock_lock(&tasks_lock);
 
    ta = task_find_by_id(taskid);
    if (ta == NULL) {
        spinlock_unlock(&tasks_lock);
        interrupts_restore(ipl);
        return ENOENT;
    }
 
    atomic_inc(&ta->refcount);
 
    spinlock_unlock(&tasks_lock);
    interrupts_restore(ipl);
 
    mutex_lock(&ta->kb.cleanup_lock);
 
    if (atomic_predec(&ta->refcount) == 0) {
        mutex_unlock(&ta->kb.cleanup_lock);
        task_destroy(ta);
        return ENOENT;
    }
 
    if (ta->kb.finished != false) {
        mutex_unlock(&ta->kb.cleanup_lock);
        return EINVAL;
    }
 
    newphid = phone_alloc();
    if (newphid < 0) {
        mutex_unlock(&ta->kb.cleanup_lock);
        return ELIMIT;
    }
 
    /* Connect the newly allocated phone to the kbox */
    ipc_phone_connect(&TASK->phones[newphid], &ta->kb.box);
 
    if (ta->kb.thread != NULL) {
        mutex_unlock(&ta->kb.cleanup_lock);
        return newphid;
    }
 
    /* Create a kbox thread */
    kb_thread = thread_create(kbox_thread_proc, NULL, ta, 0,
        "kbox", false);
    if (!kb_thread) {
        mutex_unlock(&ta->kb.cleanup_lock);
        return ENOMEM;
    }
 
    ta->kb.thread = kb_thread;
    thread_ready(kb_thread);
 
    mutex_unlock(&ta->kb.cleanup_lock);
 
    return newphid;
}
 
/** @}
 */
 

Rev 3535	Rev 3674
1	/*	1	/*
2	* Copyright (c) 2008 Jiri Svoboda	2	* Copyright (c) 2008 Jiri Svoboda
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	/** @addtogroup genericipc	29	/** @addtogroup genericipc
30	* @{	30	* @{
31	*/	31	*/
32	/** @file	32	/** @file
33	*/	33	*/
34		34
35	#include <synch/synch.h>	35	#include <synch/synch.h>
36	#include <synch/spinlock.h>	36	#include <synch/spinlock.h>
37	#include <synch/mutex.h>	37	#include <synch/mutex.h>
38	#include <ipc/ipc.h>	38	#include <ipc/ipc.h>
39	#include <ipc/ipcrsc.h>	39	#include <ipc/ipcrsc.h>
40	#include <arch.h>	40	#include <arch.h>
41	#include <errno.h>	41	#include <errno.h>
42	#include <debug.h>	42	#include <debug.h>
43	#include <udebug/udebug_ipc.h>	43	#include <udebug/udebug_ipc.h>
44	#include <ipc/kbox.h>	44	#include <ipc/kbox.h>
45		45
46	void ipc_kbox_cleanup(void)	46	void ipc_kbox_cleanup(void)
47	{	47	{
48	ipl_t ipl;	48	ipl_t ipl;
49	bool have_kb_thread;	49	bool have_kb_thread;
50		50
-		51	/*
51	/* Only hold kb_cleanup_lock while setting kb_finished - this is enough */	52	* Only hold kb.cleanup_lock while setting kb.finished -
-		53	* this is enough.
-		54	*/
52	mutex_lock(&TASK->kb_cleanup_lock);	55	mutex_lock(&TASK->kb.cleanup_lock);
53	TASK->kb_finished = true;	56	TASK->kb.finished = true;
54	mutex_unlock(&TASK->kb_cleanup_lock);	57	mutex_unlock(&TASK->kb.cleanup_lock);
55		58
56	have_kb_thread = (TASK->kb_thread != NULL);	59	have_kb_thread = (TASK->kb.thread != NULL);
57		60
-		61	/*
58	/* From now on nobody will try to connect phones or attach kbox threads */	62	* From now on nobody will try to connect phones or attach
-		63	* kbox threads
-		64	*/
59		65
60	/*	66	/*
61	* Disconnect all phones connected to our kbox. Passing true for	67	* Disconnect all phones connected to our kbox. Passing true for
62	* notify_box causes a HANGUP message to be inserted for each	68	* notify_box causes a HANGUP message to be inserted for each
63	* disconnected phone. This ensures the kbox thread is going to	69	* disconnected phone. This ensures the kbox thread is going to
64	* wake up and terminate.	70	* wake up and terminate.
65	*/	71	*/
66	ipc_answerbox_slam_phones(&TASK->kernel_box, have_kb_thread);	72	ipc_answerbox_slam_phones(&TASK->kb.box, have_kb_thread);
67		73
68	/*	74	/*
69	* If the task was being debugged, clean up debugging session.	75	* If the task was being debugged, clean up debugging session.
70	* This is necessarry as slamming the phones won't force	76	* This is necessarry as slamming the phones won't force
71	* kbox thread to clean it up since sender != debugger.	77	* kbox thread to clean it up since sender != debugger.
72	*/	78	*/
73	ipl = interrupts_disable();	79	ipl = interrupts_disable();
74	spinlock_lock(&TASK->lock);	80	spinlock_lock(&TASK->lock);
75	udebug_task_cleanup(TASK);	81	udebug_task_cleanup(TASK);
76	spinlock_unlock(&TASK->lock);	82	spinlock_unlock(&TASK->lock);
77	interrupts_restore(ipl);	83	interrupts_restore(ipl);
78		84
79	if (have_kb_thread) {	85	if (have_kb_thread) {
80	LOG("join kb_thread..\n");	86	LOG("join kb.thread..\n");
81	thread_join(TASK->kb_thread);	87	thread_join(TASK->kb.thread);
82	thread_detach(TASK->kb_thread);	88	thread_detach(TASK->kb.thread);
83	LOG("join done\n");	89	LOG("join done\n");
84	TASK->kb_thread = NULL;	90	TASK->kb.thread = NULL;
85	}	91	}
86		92
87	/* Answer all messages in 'calls' and 'dispatched_calls' queues */	93	/* Answer all messages in 'calls' and 'dispatched_calls' queues. */
88	spinlock_lock(&TASK->kernel_box.lock);	94	spinlock_lock(&TASK->kb.box.lock);
89	ipc_cleanup_call_list(&TASK->kernel_box.dispatched_calls);	95	ipc_cleanup_call_list(&TASK->kb.box.dispatched_calls);
90	ipc_cleanup_call_list(&TASK->kernel_box.calls);	96	ipc_cleanup_call_list(&TASK->kb.box.calls);
91	spinlock_unlock(&TASK->kernel_box.lock);	97	spinlock_unlock(&TASK->kb.box.lock);
92	}	98	}
93		99
94	/** Handle hangup message in kbox.	100	/** Handle hangup message in kbox.
95	*	101	*
96	* @param call The IPC_M_PHONE_HUNGUP call structure.	102	* @param call The IPC_M_PHONE_HUNGUP call structure.
97	* @param last Output, the function stores @c true here if	103	* @param last Output, the function stores @c true here if
98	* this was the last phone, @c false otherwise.	104	* this was the last phone, @c false otherwise.
99	**/	105	**/
100	static void kbox_proc_phone_hungup(call_t call, bool last)	106	static void kbox_proc_phone_hungup(call_t call, bool last)
101	{	107	{
102	ipl_t ipl;	108	ipl_t ipl;
103		109
104	LOG("kbox_proc_phone_hungup()\n");	110	LOG("kbox_proc_phone_hungup()\n");
105		111
106	/* Was it our debugger, who hung up? */	112	/* Was it our debugger, who hung up? */
107	if (call->sender == TASK->udebug.debugger) {	113	if (call->sender == TASK->udebug.debugger) {
108	/* Terminate debugging session (if any) */	114	/* Terminate debugging session (if any). */
109	LOG("kbox: terminate debug session\n");	115	LOG("kbox: terminate debug session\n");
110	ipl = interrupts_disable();	116	ipl = interrupts_disable();
111	spinlock_lock(&TASK->lock);	117	spinlock_lock(&TASK->lock);
112	udebug_task_cleanup(TASK);	118	udebug_task_cleanup(TASK);
113	spinlock_unlock(&TASK->lock);	119	spinlock_unlock(&TASK->lock);
114	interrupts_restore(ipl);	120	interrupts_restore(ipl);
115	} else {	121	} else {
116	LOG("kbox: was not debugger\n");	122	LOG("kbox: was not debugger\n");
117	}	123	}
118		124
119	LOG("kbox: continue with hangup message\n");	125	LOG("kbox: continue with hangup message\n");
120	IPC_SET_RETVAL(call->data, 0);	126	IPC_SET_RETVAL(call->data, 0);
121	ipc_answer(&TASK->kernel_box, call);	127	ipc_answer(&TASK->kb.box, call);
122		128
123	ipl = interrupts_disable();	129	ipl = interrupts_disable();
124	spinlock_lock(&TASK->lock);	130	spinlock_lock(&TASK->lock);
125	spinlock_lock(&TASK->answerbox.lock);	131	spinlock_lock(&TASK->answerbox.lock);
126	if (list_empty(&TASK->answerbox.connected_phones)) {	132	if (list_empty(&TASK->answerbox.connected_phones)) {
127	/*	133	/*
128	* Last phone has been disconnected. Detach this thread so it	134	* Last phone has been disconnected. Detach this thread so it
129	* gets freed and signal to the caller.	135	* gets freed and signal to the caller.
130	*/	136	*/
131		137
132	/* Only detach kbox thread unless already terminating. */	138	/* Only detach kbox thread unless already terminating. */
133	mutex_lock(&TASK->kb_cleanup_lock);	139	mutex_lock(&TASK->kb.cleanup_lock);
134	if (&TASK->kb_finished == false) {	140	if (&TASK->kb.finished == false) {
135	/* Detach kbox thread so it gets freed from memory. */	141	/* Detach kbox thread so it gets freed from memory. */
136	thread_detach(TASK->kb_thread);	142	thread_detach(TASK->kb.thread);
137	TASK->kb_thread = NULL;	143	TASK->kb.thread = NULL;
138	}	144	}
139	mutex_unlock(&TASK->kb_cleanup_lock);	145	mutex_unlock(&TASK->kb.cleanup_lock);
140		146
141	LOG("phone list is empty\n");	147	LOG("phone list is empty\n");
142	*last = true;	148	*last = true;
143	} else {	149	} else {
144	*last = false;	150	*last = false;
145	}	151	}
146		152
147	spinlock_unlock(&TASK->answerbox.lock);	153	spinlock_unlock(&TASK->answerbox.lock);
148	spinlock_unlock(&TASK->lock);	154	spinlock_unlock(&TASK->lock);
149	interrupts_restore(ipl);	155	interrupts_restore(ipl);
150	}	156	}
151		157
152	/** Implementing function for the kbox thread.	158	/** Implementing function for the kbox thread.
153	*	159	*
154	* This function listens for debug requests. It terminates	160	* This function listens for debug requests. It terminates
155	* when all phones are disconnected from the kbox.	161	* when all phones are disconnected from the kbox.
156	*	162	*
157	* @param arg Ignored.	163	* @param arg Ignored.
158	*/	164	*/
159	static void kbox_thread_proc(void *arg)	165	static void kbox_thread_proc(void *arg)
160	{	166	{
161	call_t *call;	167	call_t *call;
162	bool done;	168	bool done;
163		169
164	(void)arg;	170	(void)arg;
165	LOG("kbox_thread_proc()\n");	171	LOG("kbox_thread_proc()\n");
166	done = false;	172	done = false;
167		173
168	while (!done) {	174	while (!done) {
169	call = ipc_wait_for_call(&TASK->kernel_box, SYNCH_NO_TIMEOUT,	175	call = ipc_wait_for_call(&TASK->kb.box, SYNCH_NO_TIMEOUT,
170	SYNCH_FLAGS_NONE);	176	SYNCH_FLAGS_NONE);
171		177
172	if (call == NULL)	178	if (call == NULL)
173	continue; /* Try again. */	179	continue; /* Try again. */
174		180
175	switch (IPC_GET_METHOD(call->data)) {	181	switch (IPC_GET_METHOD(call->data)) {
176		182
177	case IPC_M_DEBUG_ALL:	183	case IPC_M_DEBUG_ALL:
178	/* Handle debug call. */	184	/* Handle debug call. */
179	udebug_call_receive(call);	185	udebug_call_receive(call);
180	break;	186	break;
181		187
182	case IPC_M_PHONE_HUNGUP:	188	case IPC_M_PHONE_HUNGUP:
183	/*	189	/*
184	* Process the hangup call. If this was the last	190	* Process the hangup call. If this was the last
185	* phone, done will be set to true and the	191	* phone, done will be set to true and the
186	* while loop will terminate.	192	* while loop will terminate.
187	*/	193	*/
188	kbox_proc_phone_hungup(call, &done);	194	kbox_proc_phone_hungup(call, &done);
189	break;	195	break;
190		196
191	default:	197	default:
192	/* Ignore */	198	/* Ignore */
193	break;	199	break;
194	}	200	}
195	}	201	}
196		202
197	LOG("kbox: finished\n");	203	LOG("kbox: finished\n");
198	}	204	}
199		205
200		206
201	/**	207	/**
202	* Connect phone to a task kernel-box specified by id.	208	* Connect phone to a task kernel-box specified by id.
203	*	209	*
204	* Note that this is not completely atomic. For optimisation reasons,	210	* Note that this is not completely atomic. For optimisation reasons, the task
205	* The task might start cleaning up kbox after the phone has been connected	211	* might start cleaning up kbox after the phone has been connected and before
206	* and before a kbox thread has been created. This must be taken into account	212	* a kbox thread has been created. This must be taken into account in the
207	* in the cleanup code.	213	* cleanup code.
208	*	214	*
209	* @return Phone id on success, or negative error code.	215	* @return Phone id on success, or negative error code.
210	*/	216	*/
211	int ipc_connect_kbox(task_id_t taskid)	217	int ipc_connect_kbox(task_id_t taskid)
212	{	218	{
213	int newphid;	219	int newphid;
214	task_t *ta;	220	task_t *ta;
215	thread_t *kb_thread;	221	thread_t *kb_thread;
216	ipl_t ipl;	222	ipl_t ipl;
217		223
218	ipl = interrupts_disable();	224	ipl = interrupts_disable();
219	spinlock_lock(&tasks_lock);	225	spinlock_lock(&tasks_lock);
220		226
221	ta = task_find_by_id(taskid);	227	ta = task_find_by_id(taskid);
222	if (ta == NULL) {	228	if (ta == NULL) {
223	spinlock_unlock(&tasks_lock);	229	spinlock_unlock(&tasks_lock);
224	interrupts_restore(ipl);	230	interrupts_restore(ipl);
225	return ENOENT;	231	return ENOENT;
226	}	232	}
227		233
228	atomic_inc(&ta->refcount);	234	atomic_inc(&ta->refcount);
229		235
230	spinlock_unlock(&tasks_lock);	236	spinlock_unlock(&tasks_lock);
231	interrupts_restore(ipl);	237	interrupts_restore(ipl);
232		238
233	mutex_lock(&ta->kb_cleanup_lock);	239	mutex_lock(&ta->kb.cleanup_lock);
234		240
235	if (atomic_predec(&ta->refcount) == 0) {	241	if (atomic_predec(&ta->refcount) == 0) {
236	mutex_unlock(&ta->kb_cleanup_lock);	242	mutex_unlock(&ta->kb.cleanup_lock);
237	task_destroy(ta);	243	task_destroy(ta);
238	return ENOENT;	244	return ENOENT;
239	}	245	}
240		246
241	if (ta->kb_finished != false) {	247	if (ta->kb.finished != false) {
242	mutex_unlock(&ta->kb_cleanup_lock);	248	mutex_unlock(&ta->kb.cleanup_lock);
243	return EINVAL;	249	return EINVAL;
244	}	250	}
245		251
246	newphid = phone_alloc();	252	newphid = phone_alloc();
247	if (newphid < 0) {	253	if (newphid < 0) {
248	mutex_unlock(&ta->kb_cleanup_lock);	254	mutex_unlock(&ta->kb.cleanup_lock);
249	return ELIMIT;	255	return ELIMIT;
250	}	256	}
251		257
252	/* Connect the newly allocated phone to the kbox */	258	/* Connect the newly allocated phone to the kbox */
253	ipc_phone_connect(&TASK->phones[newphid], &ta->kernel_box);	259	ipc_phone_connect(&TASK->phones[newphid], &ta->kb.box);
254		260
255	if (ta->kb_thread != NULL) {	261	if (ta->kb.thread != NULL) {
256	mutex_unlock(&ta->kb_cleanup_lock);	262	mutex_unlock(&ta->kb.cleanup_lock);
257	return newphid;	263	return newphid;
258	}	264	}
259		265
260	/* Create a kbox thread */	266	/* Create a kbox thread */
261	kb_thread = thread_create(kbox_thread_proc, NULL, ta, 0, "kbox", false);	267	kb_thread = thread_create(kbox_thread_proc, NULL, ta, 0,
-		268	"kbox", false);
262	if (!kb_thread) {	269	if (!kb_thread) {
263	mutex_unlock(&ta->kb_cleanup_lock);	270	mutex_unlock(&ta->kb.cleanup_lock);
264	return ENOMEM;	271	return ENOMEM;
265	}	272	}
266		273
267	ta->kb_thread = kb_thread;	274	ta->kb.thread = kb_thread;
268	thread_ready(kb_thread);	275	thread_ready(kb_thread);
269		276
270	mutex_unlock(&ta->kb_cleanup_lock);	277	mutex_unlock(&ta->kb.cleanup_lock);
271		278
272	return newphid;	279	return newphid;
273	}	280	}
274		281
275	/** @}	282	/** @}
276	*/	283	*/
277		284

Subversion Repositories HelenOS

(root)/branches/dynload/kernel/generic/src/ipc/kbox.c – Rev 3535 → 3674