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

Subversion Repositories HelenOS

(root)/trunk/kernel/generic/src/ipc/kbox.c @ 4199 – Rev 3620 → 3867