Rev 2103 | Rev 2106 | Go to most recent revision | Only display areas with differences | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2103 | Rev 2105 | ||
---|---|---|---|
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 | /** @addtogroup genericproc |
29 | /** @addtogroup genericproc |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | /** @file |
32 | /** @file |
33 | */ |
33 | */ |
34 | 34 | ||
35 | #ifndef KERN_TASK_H_ |
35 | #ifndef KERN_TASK_H_ |
36 | #define KERN_TASK_H_ |
36 | #define KERN_TASK_H_ |
37 | 37 | ||
38 | #include <cpu.h> |
38 | #include <cpu.h> |
- | 39 | #include <ipc/ipc.h> |
|
39 | #include <synch/spinlock.h> |
40 | #include <synch/spinlock.h> |
40 | #include <synch/mutex.h> |
41 | #include <synch/mutex.h> |
41 | #include <synch/rwlock.h> |
42 | #include <synch/rwlock.h> |
42 | #include <synch/futex.h> |
43 | #include <synch/futex.h> |
43 | #include <adt/btree.h> |
44 | #include <adt/btree.h> |
44 | #include <adt/list.h> |
45 | #include <adt/list.h> |
45 | #include <security/cap.h> |
46 | #include <security/cap.h> |
46 | #include <arch/proc/task.h> |
47 | #include <arch/proc/task.h> |
47 | #include <arch/proc/thread.h> |
48 | #include <arch/proc/thread.h> |
48 | #include <arch/context.h> |
49 | #include <arch/context.h> |
49 | #include <arch/fpu_context.h> |
50 | #include <arch/fpu_context.h> |
50 | #include <arch/cpu.h> |
51 | #include <arch/cpu.h> |
51 | #include <mm/tlb.h> |
52 | #include <mm/tlb.h> |
52 | #include <proc/scheduler.h> |
53 | #include <proc/scheduler.h> |
53 | 54 | ||
54 | #define IPC_MAX_PHONES 16 |
- | |
55 | - | ||
56 | struct answerbox; |
- | |
57 | struct task; |
- | |
58 | struct thread; |
55 | struct thread; |
59 | 56 | ||
60 | typedef enum { |
- | |
61 | IPC_PHONE_FREE = 0, /**< Phone is free and can be allocated */ |
- | |
62 | IPC_PHONE_CONNECTING, /**< Phone is connecting somewhere */ |
- | |
63 | IPC_PHONE_CONNECTED, /**< Phone is connected */ |
- | |
64 | IPC_PHONE_HUNGUP, /**< Phone is hung up, waiting for answers to come */ |
- | |
65 | IPC_PHONE_SLAMMED /**< Phone was hungup from server */ |
- | |
66 | } ipc_phone_state_t; |
- | |
67 | - | ||
68 | /** Structure identifying phone (in TASK structure) */ |
- | |
69 | typedef struct { |
- | |
70 | SPINLOCK_DECLARE(lock); |
- | |
71 | link_t link; |
- | |
72 | struct answerbox *callee; |
- | |
73 | ipc_phone_state_t state; |
- | |
74 | atomic_t active_calls; |
- | |
75 | } phone_t; |
- | |
76 | - | ||
77 | typedef struct answerbox { |
- | |
78 | SPINLOCK_DECLARE(lock); |
- | |
79 | - | ||
80 | struct task *task; |
- | |
81 | - | ||
82 | waitq_t wq; |
- | |
83 | - | ||
84 | link_t connected_phones; /**< Phones connected to this answerbox */ |
- | |
85 | link_t calls; /**< Received calls */ |
- | |
86 | link_t dispatched_calls; /* Should be hash table in the future */ |
- | |
87 | - | ||
88 | link_t answers; /**< Answered calls */ |
- | |
89 | - | ||
90 | SPINLOCK_DECLARE(irq_lock); |
- | |
91 | link_t irq_notifs; /**< Notifications from IRQ handlers */ |
- | |
92 | link_t irq_head; /**< IRQs with notifications to this answerbox. */ |
- | |
93 | } answerbox_t; |
- | |
94 | - | ||
95 | /** Task structure. */ |
57 | /** Task structure. */ |
96 | typedef struct task { |
58 | typedef struct task { |
97 | /** Task lock. |
59 | /** Task lock. |
98 | * |
60 | * |
99 | * Must be acquired before threads_lock and thread lock of any of its threads. |
61 | * Must be acquired before threads_lock and thread lock of any of its threads. |
100 | */ |
62 | */ |
101 | SPINLOCK_DECLARE(lock); |
63 | SPINLOCK_DECLARE(lock); |
102 | 64 | ||
103 | char *name; |
65 | char *name; |
104 | struct thread *main_thread; /**< Pointer to the main thread. */ |
66 | struct thread *main_thread; /**< Pointer to the main thread. */ |
105 | link_t th_head; /**< List of threads contained in this task. */ |
67 | link_t th_head; /**< List of threads contained in this task. */ |
106 | as_t *as; /**< Address space. */ |
68 | as_t *as; /**< Address space. */ |
107 | task_id_t taskid; /**< Unique identity of task */ |
69 | task_id_t taskid; /**< Unique identity of task */ |
108 | context_id_t context; /**< Task security context */ |
70 | context_id_t context; /**< Task security context */ |
109 | 71 | ||
110 | /** If this is true, new threads can become part of the task. */ |
72 | /** If this is true, new threads can become part of the task. */ |
111 | bool accept_new_threads; |
73 | bool accept_new_threads; |
112 | 74 | ||
113 | count_t refcount; /**< Number of references (i.e. threads). */ |
75 | count_t refcount; /**< Number of references (i.e. threads). */ |
114 | 76 | ||
115 | cap_t capabilities; /**< Task capabilities. */ |
77 | cap_t capabilities; /**< Task capabilities. */ |
116 | 78 | ||
117 | /* IPC stuff */ |
79 | /* IPC stuff */ |
118 | answerbox_t answerbox; /**< Communication endpoint */ |
80 | answerbox_t answerbox; /**< Communication endpoint */ |
119 | phone_t phones[IPC_MAX_PHONES]; |
81 | phone_t phones[IPC_MAX_PHONES]; |
120 | atomic_t active_calls; /**< Active asynchronous messages. |
82 | atomic_t active_calls; /**< Active asynchronous messages. |
121 | * It is used for limiting uspace to |
83 | * It is used for limiting uspace to |
122 | * certain extent. */ |
84 | * certain extent. */ |
123 | 85 | ||
124 | task_arch_t arch; /**< Architecture specific task data. */ |
86 | task_arch_t arch; /**< Architecture specific task data. */ |
125 | 87 | ||
126 | /** |
88 | /** |
127 | * Serializes access to the B+tree of task's futexes. This mutex is |
89 | * Serializes access to the B+tree of task's futexes. This mutex is |
128 | * independent on the task spinlock. |
90 | * independent on the task spinlock. |
129 | */ |
91 | */ |
130 | mutex_t futexes_lock; |
92 | mutex_t futexes_lock; |
131 | btree_t futexes; /**< B+tree of futexes referenced by this task. */ |
93 | btree_t futexes; /**< B+tree of futexes referenced by this task. */ |
132 | 94 | ||
133 | uint64_t cycles; /**< Accumulated accounting. */ |
95 | uint64_t cycles; /**< Accumulated accounting. */ |
134 | } task_t; |
96 | } task_t; |
135 | 97 | ||
136 | SPINLOCK_EXTERN(tasks_lock); |
98 | SPINLOCK_EXTERN(tasks_lock); |
137 | extern btree_t tasks_btree; |
99 | extern btree_t tasks_btree; |
138 | 100 | ||
139 | extern void task_init(void); |
101 | extern void task_init(void); |
140 | extern task_t *task_create(as_t *as, char *name); |
102 | extern task_t *task_create(as_t *as, char *name); |
141 | extern void task_destroy(task_t *t); |
103 | extern void task_destroy(task_t *t); |
142 | extern task_t *task_run_program(void *program_addr, char *name); |
104 | extern task_t *task_run_program(void *program_addr, char *name); |
143 | extern task_t *task_find_by_id(task_id_t id); |
105 | extern task_t *task_find_by_id(task_id_t id); |
144 | extern int task_kill(task_id_t id); |
106 | extern int task_kill(task_id_t id); |
145 | extern uint64_t task_get_accounting(task_t *t); |
107 | extern uint64_t task_get_accounting(task_t *t); |
146 | 108 | ||
147 | extern void cap_set(task_t *t, cap_t caps); |
109 | extern void cap_set(task_t *t, cap_t caps); |
148 | extern cap_t cap_get(task_t *t); |
110 | extern cap_t cap_get(task_t *t); |
149 | 111 | ||
150 | 112 | ||
151 | #ifndef task_create_arch |
113 | #ifndef task_create_arch |
152 | extern void task_create_arch(task_t *t); |
114 | extern void task_create_arch(task_t *t); |
153 | #endif |
115 | #endif |
154 | 116 | ||
155 | #ifndef task_destroy_arch |
117 | #ifndef task_destroy_arch |
156 | extern void task_destroy_arch(task_t *t); |
118 | extern void task_destroy_arch(task_t *t); |
157 | #endif |
119 | #endif |
158 | 120 | ||
159 | extern unative_t sys_task_get_id(task_id_t *uspace_task_id); |
121 | extern unative_t sys_task_get_id(task_id_t *uspace_task_id); |
160 | 122 | ||
161 | #endif |
123 | #endif |
162 | 124 | ||
163 | /** @} |
125 | /** @} |
164 | */ |
126 | */ |
165 | 127 |