WebSVN – HelenOS-historic – Diff – /kernel/trunk/generic/include/proc/task.h


/*
 * 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.
 */
 
#ifndef __TASK_H__
#define __TASK_H__
 
#include <typedefs.h>
#include <synch/spinlock.h>
#include <synch/mutex.h>
#include <adt/btree.h>
#include <adt/list.h>
#include <ipc/ipc.h>
#include <security/cap.h>
#include <arch/proc/task.h>
 
/** Task structure. */
struct task {
    /** Task lock.
     *
     * Must be acquired before threads_lock and thread lock of any of its threads.
     */
    SPINLOCK_DECLARE(lock);
   
    char *name;
    link_t th_head;     /**< List of threads contained in this task. */
    as_t *as;       /**< Address space. */
    task_id_t taskid;   /**< Unique identity of task */
 
    /** If this is true, new threads can become part of the task. */
    bool accept_new_threads;
 
    count_t refcount;   /**< Number of references (i.e. threads). */
 
    cap_t capabilities; /**< Task capabilities. */
 
    /* IPC stuff */
    answerbox_t answerbox;  /**< Communication endpoint */
    phone_t phones[IPC_MAX_PHONES];
    atomic_t active_calls;  /**< Active asynchronous messages.
                 *   It is used for limiting uspace to
                 *   certain extent. */
   
    task_arch_t arch;   /**< Architecture specific task data. */
   
    /**
     * Serializes access to the B+tree of task's futexes. This mutex is
     * independent on the task spinlock.
     */
    mutex_t futexes_lock;
    btree_t futexes;    /**< B+tree of futexes referenced by this task. */
};
 
extern spinlock_t tasks_lock;
extern btree_t tasks_btree;
 
extern void task_init(void);
extern task_t *task_create(as_t *as, char *name);
extern void task_destroy(task_t *t);
extern task_t *task_run_program(void *program_addr, char *name);
extern task_t *task_find_by_id(task_id_t id);
extern int task_kill(task_id_t id);
 
 
#ifndef task_create_arch
extern void task_create_arch(task_t *t);
#endif
 
extern __native sys_task_get_id(task_id_t *uspace_task_id);
 
#endif
 

Rev 1568	Rev 1579
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	#ifndef __TASK_H__	29	#ifndef __TASK_H__
30	#define __TASK_H__	30	#define __TASK_H__
31		31
32	#include <typedefs.h>	32	#include <typedefs.h>
33	#include <synch/spinlock.h>	33	#include <synch/spinlock.h>
34	#include <synch/mutex.h>	34	#include <synch/mutex.h>
35	#include <adt/btree.h>	35	#include <adt/btree.h>
36	#include <adt/list.h>	36	#include <adt/list.h>
37	#include <ipc/ipc.h>	37	#include <ipc/ipc.h>
38	#include <security/cap.h>	38	#include <security/cap.h>
39	#include <arch/proc/task.h>	39	#include <arch/proc/task.h>
40		40
41	/** Task structure. */	41	/** Task structure. */
42	struct task {	42	struct task {
-		43	/** Task lock.
-		44	*
-		45	* Must be acquired before threads_lock and thread lock of any of its threads.
-		46	*/
43	SPINLOCK_DECLARE(lock);	47	SPINLOCK_DECLARE(lock);
-		48
44	char *name;	49	char *name;
45	link_t th_head; /*< List of threads contained in this task. /	50	link_t th_head; /*< List of threads contained in this task. /
46	as_t as; /< Address space. /	51	as_t as; /< Address space. /
47	task_id_t taskid; /*< Unique identity of task /	52	task_id_t taskid; /*< Unique identity of task /
48		53
-		54	/** If this is true, new threads can become part of the task. */
-		55	bool accept_new_threads;
-		56
-		57	count_t refcount; /*< Number of references (i.e. threads). /
-		58
49	cap_t capabilities; /*< Task capabilities. /	59	cap_t capabilities; /*< Task capabilities. /
50		60
51	/* IPC stuff */	61	/* IPC stuff */
52	answerbox_t answerbox; /*< Communication endpoint /	62	answerbox_t answerbox; /*< Communication endpoint /
53	phone_t phones[IPC_MAX_PHONES];	63	phone_t phones[IPC_MAX_PHONES];
54	atomic_t active_calls; /**< Active asynchronous messages.	64	atomic_t active_calls; /**< Active asynchronous messages.
55	* It is used for limiting uspace to	65	* It is used for limiting uspace to
56	* certain extent. */	66	* certain extent. */
57		67
58	task_arch_t arch; /*< Architecture specific task data. /	68	task_arch_t arch; /*< Architecture specific task data. /
59		69
60	/**	70	/**
61	* Serializes access to the B+tree of task's futexes. This mutex is	71	* Serializes access to the B+tree of task's futexes. This mutex is
62	* independent on the task spinlock.	72	* independent on the task spinlock.
63	*/	73	*/
64	mutex_t futexes_lock;	74	mutex_t futexes_lock;
65	btree_t futexes; /*< B+tree of futexes referenced by this task. /	75	btree_t futexes; /*< B+tree of futexes referenced by this task. /
66	};	76	};
67		77
68	extern spinlock_t tasks_lock;	78	extern spinlock_t tasks_lock;
69	extern btree_t tasks_btree;	79	extern btree_t tasks_btree;
70		80
71	extern void task_init(void);	81	extern void task_init(void);
72	extern task_t task_create(as_t as, char *name);	82	extern task_t task_create(as_t as, char *name);
-		83	extern void task_destroy(task_t *t);
73	extern task_t task_run_program(void program_addr, char *name);	84	extern task_t task_run_program(void program_addr, char *name);
74	extern task_t *task_find_by_id(task_id_t id);	85	extern task_t *task_find_by_id(task_id_t id);
-		86	extern int task_kill(task_id_t id);
-		87
75		88
76	#ifndef task_create_arch	89	#ifndef task_create_arch
77	extern void task_create_arch(task_t *t);	90	extern void task_create_arch(task_t *t);
78	#endif	91	#endif
79		92
80	extern __native sys_task_get_id(task_id_t *uspace_task_id);	93	extern __native sys_task_get_id(task_id_t *uspace_task_id);
81		94
82	#endif	95	#endif
83		96

Subversion Repositories HelenOS-historic

(root)/kernel/trunk/generic/include/proc/task.h @ 1780 – Rev 1568 → 1579