Subversion Repositories HelenOS

Rev

Rev 2712 | Rev 3063 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 2712 Rev 2745
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
 
32
 
33
/**
33
/**
34
 * @file
34
 * @file
35
 * @brief   Task management.
35
 * @brief   Task management.
36
 */
36
 */
37
 
37
 
38
#include <main/uinit.h>
38
#include <main/uinit.h>
39
#include <proc/thread.h>
39
#include <proc/thread.h>
40
#include <proc/task.h>
40
#include <proc/task.h>
41
#include <proc/uarg.h>
41
#include <proc/uarg.h>
42
#include <mm/as.h>
42
#include <mm/as.h>
43
#include <mm/slab.h>
43
#include <mm/slab.h>
44
#include <atomic.h>
44
#include <atomic.h>
45
#include <synch/spinlock.h>
45
#include <synch/spinlock.h>
46
#include <synch/waitq.h>
46
#include <synch/waitq.h>
47
#include <arch.h>
47
#include <arch.h>
48
#include <panic.h>
48
#include <panic.h>
49
#include <adt/avl.h>
49
#include <adt/avl.h>
50
#include <adt/btree.h>
50
#include <adt/btree.h>
51
#include <adt/list.h>
51
#include <adt/list.h>
52
#include <ipc/ipc.h>
52
#include <ipc/ipc.h>
53
#include <security/cap.h>
53
#include <security/cap.h>
54
#include <memstr.h>
54
#include <memstr.h>
55
#include <print.h>
55
#include <print.h>
56
#include <lib/elf.h>
56
#include <lib/elf.h>
57
#include <errno.h>
57
#include <errno.h>
58
#include <func.h>
58
#include <func.h>
59
#include <syscall/copy.h>
59
#include <syscall/copy.h>
60
 
60
 
61
#ifndef LOADED_PROG_STACK_PAGES_NO
61
#ifndef LOADED_PROG_STACK_PAGES_NO
62
#define LOADED_PROG_STACK_PAGES_NO 1
62
#define LOADED_PROG_STACK_PAGES_NO 1
63
#endif
63
#endif
64
 
64
 
65
/** Spinlock protecting the tasks_tree AVL tree. */
65
/** Spinlock protecting the tasks_tree AVL tree. */
66
SPINLOCK_INITIALIZE(tasks_lock);
66
SPINLOCK_INITIALIZE(tasks_lock);
67
 
67
 
68
/** AVL tree of active tasks.
68
/** AVL tree of active tasks.
69
 *
69
 *
70
 * The task is guaranteed to exist after it was found in the tasks_tree as
70
 * The task is guaranteed to exist after it was found in the tasks_tree as
71
 * long as:
71
 * long as:
72
 * @li the tasks_lock is held,
72
 * @li the tasks_lock is held,
73
 * @li the task's lock is held when task's lock is acquired before releasing
73
 * @li the task's lock is held when task's lock is acquired before releasing
74
 *     tasks_lock or
74
 *     tasks_lock or
75
 * @li the task's refcount is greater than 0
75
 * @li the task's refcount is greater than 0
76
 *
76
 *
77
 */
77
 */
78
avltree_t tasks_tree;
78
avltree_t tasks_tree;
79
 
79
 
80
static task_id_t task_counter = 0;
80
static task_id_t task_counter = 0;
81
 
81
 
82
/** Initialize tasks
82
/** Initialize tasks
83
 *
83
 *
84
 * Initialize kernel tasks support.
84
 * Initialize kernel tasks support.
85
 *
85
 *
86
 */
86
 */
87
void task_init(void)
87
void task_init(void)
88
{
88
{
89
    TASK = NULL;
89
    TASK = NULL;
90
    avltree_create(&tasks_tree);
90
    avltree_create(&tasks_tree);
91
}
91
}
92
 
92
 
93
/*
93
/*
94
 * The idea behind this walker is to remember a single task different from TASK.
94
 * The idea behind this walker is to remember a single task different from TASK.
95
 */
95
 */
96
static bool task_done_walker(avltree_node_t *node, void *arg)
96
static bool task_done_walker(avltree_node_t *node, void *arg)
97
{
97
{
98
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
98
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
99
    task_t **tp = (task_t **) arg;
99
    task_t **tp = (task_t **) arg;
100
 
100
 
101
    if (t != TASK) {
101
    if (t != TASK) {
102
        *tp = t;
102
        *tp = t;
103
        return false;   /* stop walking */
103
        return false;   /* stop walking */
104
    }
104
    }
105
 
105
 
106
    return true;    /* continue the walk */
106
    return true;    /* continue the walk */
107
}
107
}
108
 
108
 
109
/** Kill all tasks except the current task.
109
/** Kill all tasks except the current task.
110
 *
110
 *
111
 */
111
 */
112
void task_done(void)
112
void task_done(void)
113
{
113
{
114
    task_t *t;
114
    task_t *t;
115
    do { /* Repeat until there are any tasks except TASK */
115
    do { /* Repeat until there are any tasks except TASK */
116
       
116
       
117
        /* Messing with task structures, avoid deadlock */
117
        /* Messing with task structures, avoid deadlock */
118
        ipl_t ipl = interrupts_disable();
118
        ipl_t ipl = interrupts_disable();
119
        spinlock_lock(&tasks_lock);
119
        spinlock_lock(&tasks_lock);
120
       
120
       
121
        t = NULL;
121
        t = NULL;
122
        avltree_walk(&tasks_tree, task_done_walker, &t);
122
        avltree_walk(&tasks_tree, task_done_walker, &t);
123
       
123
       
124
        if (t != NULL) {
124
        if (t != NULL) {
125
            task_id_t id = t->taskid;
125
            task_id_t id = t->taskid;
126
           
126
           
127
            spinlock_unlock(&tasks_lock);
127
            spinlock_unlock(&tasks_lock);
128
            interrupts_restore(ipl);
128
            interrupts_restore(ipl);
129
           
129
           
130
#ifdef CONFIG_DEBUG
130
#ifdef CONFIG_DEBUG
131
            printf("Killing task %llu\n", id);
131
            printf("Killing task %llu\n", id);
132
#endif          
132
#endif          
133
            task_kill(id);
133
            task_kill(id);
134
            thread_usleep(10000);
134
            thread_usleep(10000);
135
        } else {
135
        } else {
136
            spinlock_unlock(&tasks_lock);
136
            spinlock_unlock(&tasks_lock);
137
            interrupts_restore(ipl);
137
            interrupts_restore(ipl);
138
        }
138
        }
139
       
139
       
140
    } while (t != NULL);
140
    } while (t != NULL);
141
}
141
}
142
 
142
 
143
/** Create new task
143
/** Create new task
144
 *
144
 *
145
 * Create new task with no threads.
145
 * Create new task with no threads.
146
 *
146
 *
147
 * @param as Task's address space.
147
 * @param as Task's address space.
148
 * @param name Symbolic name.
148
 * @param name Symbolic name.
149
 *
149
 *
150
 * @return New task's structure
150
 * @return New task's structure
151
 *
151
 *
152
 */
152
 */
153
task_t *task_create(as_t *as, char *name)
153
task_t *task_create(as_t *as, char *name)
154
{
154
{
155
    ipl_t ipl;
155
    ipl_t ipl;
156
    task_t *ta;
156
    task_t *ta;
157
    int i;
157
    int i;
158
   
158
   
159
    ta = (task_t *) malloc(sizeof(task_t), 0);
159
    ta = (task_t *) malloc(sizeof(task_t), 0);
160
 
160
 
161
    task_create_arch(ta);
161
    task_create_arch(ta);
162
 
162
 
163
    spinlock_initialize(&ta->lock, "task_ta_lock");
163
    spinlock_initialize(&ta->lock, "task_ta_lock");
164
    list_initialize(&ta->th_head);
164
    list_initialize(&ta->th_head);
165
    ta->as = as;
165
    ta->as = as;
166
    ta->name = name;
166
    ta->name = name;
167
    atomic_set(&ta->refcount, 0);
167
    atomic_set(&ta->refcount, 0);
168
    atomic_set(&ta->lifecount, 0);
168
    atomic_set(&ta->lifecount, 0);
169
    ta->context = CONTEXT;
169
    ta->context = CONTEXT;
170
 
170
 
171
    ta->capabilities = 0;
171
    ta->capabilities = 0;
172
    ta->cycles = 0;
172
    ta->cycles = 0;
173
   
173
   
174
    ipc_answerbox_init(&ta->answerbox);
174
    ipc_answerbox_init(&ta->answerbox);
175
    for (i = 0; i < IPC_MAX_PHONES; i++)
175
    for (i = 0; i < IPC_MAX_PHONES; i++)
176
        ipc_phone_init(&ta->phones[i]);
176
        ipc_phone_init(&ta->phones[i]);
177
    if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
177
    if ((ipc_phone_0) && (context_check(ipc_phone_0->task->context,
178
        ta->context)))
178
        ta->context)))
179
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
179
        ipc_phone_connect(&ta->phones[0], ipc_phone_0);
180
    atomic_set(&ta->active_calls, 0);
180
    atomic_set(&ta->active_calls, 0);
181
 
181
 
182
    mutex_initialize(&ta->futexes_lock);
182
    mutex_initialize(&ta->futexes_lock);
183
    btree_create(&ta->futexes);
183
    btree_create(&ta->futexes);
184
   
184
   
185
    ipl = interrupts_disable();
185
    ipl = interrupts_disable();
186
 
186
 
187
    /*
187
    /*
188
     * Increment address space reference count.
188
     * Increment address space reference count.
189
     */
189
     */
190
    atomic_inc(&as->refcount);
190
    atomic_inc(&as->refcount);
191
 
191
 
192
    spinlock_lock(&tasks_lock);
192
    spinlock_lock(&tasks_lock);
193
    ta->taskid = ++task_counter;
193
    ta->taskid = ++task_counter;
194
    avltree_node_initialize(&ta->tasks_tree_node);
194
    avltree_node_initialize(&ta->tasks_tree_node);
195
    ta->tasks_tree_node.key = ta->taskid;
195
    ta->tasks_tree_node.key = ta->taskid;
196
    avltree_insert(&tasks_tree, &ta->tasks_tree_node);
196
    avltree_insert(&tasks_tree, &ta->tasks_tree_node);
197
    spinlock_unlock(&tasks_lock);
197
    spinlock_unlock(&tasks_lock);
198
    interrupts_restore(ipl);
198
    interrupts_restore(ipl);
199
 
199
 
200
    return ta;
200
    return ta;
201
}
201
}
202
 
202
 
203
/** Destroy task.
203
/** Destroy task.
204
 *
204
 *
205
 * @param t Task to be destroyed.
205
 * @param t Task to be destroyed.
206
 */
206
 */
207
void task_destroy(task_t *t)
207
void task_destroy(task_t *t)
208
{
208
{
209
    /*
209
    /*
210
     * Remove the task from the task B+tree.
210
     * Remove the task from the task B+tree.
211
     */
211
     */
212
    spinlock_lock(&tasks_lock);
212
    spinlock_lock(&tasks_lock);
213
    avltree_delete(&tasks_tree, &t->tasks_tree_node);
213
    avltree_delete(&tasks_tree, &t->tasks_tree_node);
214
    spinlock_unlock(&tasks_lock);
214
    spinlock_unlock(&tasks_lock);
215
 
215
 
216
    /*
216
    /*
217
     * Perform architecture specific task destruction.
217
     * Perform architecture specific task destruction.
218
     */
218
     */
219
    task_destroy_arch(t);
219
    task_destroy_arch(t);
220
 
220
 
221
    /*
221
    /*
222
     * Free up dynamically allocated state.
222
     * Free up dynamically allocated state.
223
     */
223
     */
224
    btree_destroy(&t->futexes);
224
    btree_destroy(&t->futexes);
225
 
225
 
226
    /*
226
    /*
227
     * Drop our reference to the address space.
227
     * Drop our reference to the address space.
228
     */
228
     */
229
    if (atomic_predec(&t->as->refcount) == 0)
229
    if (atomic_predec(&t->as->refcount) == 0)
230
        as_destroy(t->as);
230
        as_destroy(t->as);
231
   
231
   
232
    free(t);
232
    free(t);
233
    TASK = NULL;
233
    TASK = NULL;
234
}
234
}
235
 
235
 
236
/** Create new task with 1 thread and run it
236
/** Create new task with 1 thread and run it
237
 *
237
 *
238
 * @param program_addr Address of program executable image.
238
 * @param program_addr Address of program executable image.
239
 * @param name Program name.
239
 * @param name Program name.
240
 *
240
 *
241
 * @return Task of the running program or NULL on error.
241
 * @return Task of the running program or NULL on error.
242
 */
242
 */
243
task_t *task_run_program(void *program_addr, char *name)
243
task_t *task_run_program(void *program_addr, char *name)
244
{
244
{
245
    as_t *as;
245
    as_t *as;
246
    as_area_t *a;
246
    as_area_t *a;
247
    int rc;
247
    unsigned int rc;
248
    thread_t *t;
248
    thread_t *t;
249
    task_t *task;
249
    task_t *task;
250
    uspace_arg_t *kernel_uarg;
250
    uspace_arg_t *kernel_uarg;
251
 
251
 
252
    as = as_create(0);
252
    as = as_create(0);
253
    ASSERT(as);
253
    ASSERT(as);
254
 
254
 
255
    rc = elf_load((elf_header_t *) program_addr, as);
255
    rc = elf_load((elf_header_t *) program_addr, as);
256
    if (rc != EE_OK) {
256
    if (rc != EE_OK) {
257
        as_destroy(as);
257
        as_destroy(as);
258
        return NULL;
258
        return NULL;
259
    }
259
    }
260
   
260
   
261
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
261
    kernel_uarg = (uspace_arg_t *) malloc(sizeof(uspace_arg_t), 0);
262
    kernel_uarg->uspace_entry =
262
    kernel_uarg->uspace_entry =
263
        (void *) ((elf_header_t *) program_addr)->e_entry;
263
        (void *) ((elf_header_t *) program_addr)->e_entry;
264
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
264
    kernel_uarg->uspace_stack = (void *) USTACK_ADDRESS;
265
    kernel_uarg->uspace_thread_function = NULL;
265
    kernel_uarg->uspace_thread_function = NULL;
266
    kernel_uarg->uspace_thread_arg = NULL;
266
    kernel_uarg->uspace_thread_arg = NULL;
267
    kernel_uarg->uspace_uarg = NULL;
267
    kernel_uarg->uspace_uarg = NULL;
268
   
268
   
269
    task = task_create(as, name);
269
    task = task_create(as, name);
270
    ASSERT(task);
270
    ASSERT(task);
271
 
271
 
272
    /*
272
    /*
273
     * Create the data as_area.
273
     * Create the data as_area.
274
     */
274
     */
275
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
275
    a = as_area_create(as, AS_AREA_READ | AS_AREA_WRITE | AS_AREA_CACHEABLE,
276
        LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,
276
        LOADED_PROG_STACK_PAGES_NO * PAGE_SIZE, USTACK_ADDRESS,
277
        AS_AREA_ATTR_NONE, &anon_backend, NULL);
277
        AS_AREA_ATTR_NONE, &anon_backend, NULL);
278
 
278
 
279
    /*
279
    /*
280
     * Create the main thread.
280
     * Create the main thread.
281
     */
281
     */
282
    t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,
282
    t = thread_create(uinit, kernel_uarg, task, THREAD_FLAG_USPACE,
283
        "uinit", false);
283
        "uinit", false);
284
    ASSERT(t);
284
    ASSERT(t);
285
   
285
   
286
    thread_ready(t);
286
    thread_ready(t);
287
 
287
 
288
    return task;
288
    return task;
289
}
289
}
290
 
290
 
291
/** Syscall for reading task ID from userspace.
291
/** Syscall for reading task ID from userspace.
292
 *
292
 *
293
 * @param uspace_task_id Userspace address of 8-byte buffer where to store
293
 * @param uspace_task_id Userspace address of 8-byte buffer where to store
294
 * current task ID.
294
 * current task ID.
295
 *
295
 *
296
 * @return 0 on success or an error code from @ref errno.h.
296
 * @return 0 on success or an error code from @ref errno.h.
297
 */
297
 */
298
unative_t sys_task_get_id(task_id_t *uspace_task_id)
298
unative_t sys_task_get_id(task_id_t *uspace_task_id)
299
{
299
{
300
    /*
300
    /*
301
     * No need to acquire lock on TASK because taskid
301
     * No need to acquire lock on TASK because taskid
302
     * remains constant for the lifespan of the task.
302
     * remains constant for the lifespan of the task.
303
     */
303
     */
304
    return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
304
    return (unative_t) copy_to_uspace(uspace_task_id, &TASK->taskid,
305
        sizeof(TASK->taskid));
305
        sizeof(TASK->taskid));
306
}
306
}
307
 
307
 
308
/** Find task structure corresponding to task ID.
308
/** Find task structure corresponding to task ID.
309
 *
309
 *
310
 * The tasks_lock must be already held by the caller of this function
310
 * The tasks_lock must be already held by the caller of this function
311
 * and interrupts must be disabled.
311
 * and interrupts must be disabled.
312
 *
312
 *
313
 * @param id Task ID.
313
 * @param id Task ID.
314
 *
314
 *
315
 * @return Task structure address or NULL if there is no such task ID.
315
 * @return Task structure address or NULL if there is no such task ID.
316
 */
316
 */
317
task_t *task_find_by_id(task_id_t id)
317
task_t *task_find_by_id(task_id_t id)
318
{
318
{
319
    avltree_node_t *node;
319
    avltree_node_t *node;
320
   
320
   
321
    node = avltree_search(&tasks_tree, (avltree_key_t) id);
321
    node = avltree_search(&tasks_tree, (avltree_key_t) id);
322
 
322
 
323
    if (node)
323
    if (node)
324
        return avltree_get_instance(node, task_t, tasks_tree_node);
324
        return avltree_get_instance(node, task_t, tasks_tree_node);
325
    return NULL;
325
    return NULL;
326
}
326
}
327
 
327
 
328
/** Get accounting data of given task.
328
/** Get accounting data of given task.
329
 *
329
 *
330
 * Note that task lock of 't' must be already held and
330
 * Note that task lock of 't' must be already held and
331
 * interrupts must be already disabled.
331
 * interrupts must be already disabled.
332
 *
332
 *
333
 * @param t Pointer to thread.
333
 * @param t Pointer to thread.
334
 *
334
 *
335
 */
335
 */
336
uint64_t task_get_accounting(task_t *t)
336
uint64_t task_get_accounting(task_t *t)
337
{
337
{
338
    /* Accumulated value of task */
338
    /* Accumulated value of task */
339
    uint64_t ret = t->cycles;
339
    uint64_t ret = t->cycles;
340
   
340
   
341
    /* Current values of threads */
341
    /* Current values of threads */
342
    link_t *cur;
342
    link_t *cur;
343
    for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
343
    for (cur = t->th_head.next; cur != &t->th_head; cur = cur->next) {
344
        thread_t *thr = list_get_instance(cur, thread_t, th_link);
344
        thread_t *thr = list_get_instance(cur, thread_t, th_link);
345
       
345
       
346
        spinlock_lock(&thr->lock);
346
        spinlock_lock(&thr->lock);
347
        /* Process only counted threads */
347
        /* Process only counted threads */
348
        if (!thr->uncounted) {
348
        if (!thr->uncounted) {
349
            if (thr == THREAD) {
349
            if (thr == THREAD) {
350
                /* Update accounting of current thread */
350
                /* Update accounting of current thread */
351
                thread_update_accounting();
351
                thread_update_accounting();
352
            }
352
            }
353
            ret += thr->cycles;
353
            ret += thr->cycles;
354
        }
354
        }
355
        spinlock_unlock(&thr->lock);
355
        spinlock_unlock(&thr->lock);
356
    }
356
    }
357
   
357
   
358
    return ret;
358
    return ret;
359
}
359
}
360
 
360
 
361
/** Kill task.
361
/** Kill task.
362
 *
362
 *
363
 * This function is idempotent.
363
 * This function is idempotent.
364
 * It signals all the task's threads to bail it out.
364
 * It signals all the task's threads to bail it out.
365
 *
365
 *
366
 * @param id ID of the task to be killed.
366
 * @param id ID of the task to be killed.
367
 *
367
 *
368
 * @return 0 on success or an error code from errno.h
368
 * @return 0 on success or an error code from errno.h
369
 */
369
 */
370
int task_kill(task_id_t id)
370
int task_kill(task_id_t id)
371
{
371
{
372
    ipl_t ipl;
372
    ipl_t ipl;
373
    task_t *ta;
373
    task_t *ta;
374
    link_t *cur;
374
    link_t *cur;
375
 
375
 
376
    if (id == 1)
376
    if (id == 1)
377
        return EPERM;
377
        return EPERM;
378
   
378
   
379
    ipl = interrupts_disable();
379
    ipl = interrupts_disable();
380
    spinlock_lock(&tasks_lock);
380
    spinlock_lock(&tasks_lock);
381
    if (!(ta = task_find_by_id(id))) {
381
    if (!(ta = task_find_by_id(id))) {
382
        spinlock_unlock(&tasks_lock);
382
        spinlock_unlock(&tasks_lock);
383
        interrupts_restore(ipl);
383
        interrupts_restore(ipl);
384
        return ENOENT;
384
        return ENOENT;
385
    }
385
    }
386
    spinlock_unlock(&tasks_lock);
386
    spinlock_unlock(&tasks_lock);
387
   
387
   
388
    /*
388
    /*
389
     * Interrupt all threads except ktaskclnp.
389
     * Interrupt all threads except ktaskclnp.
390
     */
390
     */
391
    spinlock_lock(&ta->lock);
391
    spinlock_lock(&ta->lock);
392
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
392
    for (cur = ta->th_head.next; cur != &ta->th_head; cur = cur->next) {
393
        thread_t *thr;
393
        thread_t *thr;
394
        bool sleeping = false;
394
        bool sleeping = false;
395
       
395
       
396
        thr = list_get_instance(cur, thread_t, th_link);
396
        thr = list_get_instance(cur, thread_t, th_link);
397
           
397
           
398
        spinlock_lock(&thr->lock);
398
        spinlock_lock(&thr->lock);
399
        thr->interrupted = true;
399
        thr->interrupted = true;
400
        if (thr->state == Sleeping)
400
        if (thr->state == Sleeping)
401
            sleeping = true;
401
            sleeping = true;
402
        spinlock_unlock(&thr->lock);
402
        spinlock_unlock(&thr->lock);
403
       
403
       
404
        if (sleeping)
404
        if (sleeping)
405
            waitq_interrupt_sleep(thr);
405
            waitq_interrupt_sleep(thr);
406
    }
406
    }
407
    spinlock_unlock(&ta->lock);
407
    spinlock_unlock(&ta->lock);
408
    interrupts_restore(ipl);
408
    interrupts_restore(ipl);
409
   
409
   
410
    return 0;
410
    return 0;
411
}
411
}
412
 
412
 
413
static bool task_print_walker(avltree_node_t *node, void *arg)
413
static bool task_print_walker(avltree_node_t *node, void *arg)
414
{
414
{
415
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
415
    task_t *t = avltree_get_instance(node, task_t, tasks_tree_node);
416
    int j;
416
    int j;
417
       
417
       
418
    spinlock_lock(&t->lock);
418
    spinlock_lock(&t->lock);
419
           
419
           
420
    uint64_t cycles;
420
    uint64_t cycles;
421
    char suffix;
421
    char suffix;
422
    order(task_get_accounting(t), &cycles, &suffix);
422
    order(task_get_accounting(t), &cycles, &suffix);
423
   
423
   
424
    if (sizeof(void *) == 4)
424
    if (sizeof(void *) == 4)
425
        printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd",
425
        printf("%-6llu %-10s %-3ld %#10zx %#10zx %9llu%c %7zd %6zd",
426
            t->taskid, t->name, t->context, t, t->as, cycles, suffix,
426
            t->taskid, t->name, t->context, t, t->as, cycles, suffix,
427
            t->refcount, atomic_get(&t->active_calls));
427
            t->refcount, atomic_get(&t->active_calls));
428
    else
428
    else
429
        printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd",
429
        printf("%-6llu %-10s %-3ld %#18zx %#18zx %9llu%c %7zd %6zd",
430
            t->taskid, t->name, t->context, t, t->as, cycles, suffix,
430
            t->taskid, t->name, t->context, t, t->as, cycles, suffix,
431
            t->refcount, atomic_get(&t->active_calls));
431
            t->refcount, atomic_get(&t->active_calls));
432
    for (j = 0; j < IPC_MAX_PHONES; j++) {
432
    for (j = 0; j < IPC_MAX_PHONES; j++) {
433
        if (t->phones[j].callee)
433
        if (t->phones[j].callee)
434
            printf(" %zd:%#zx", j, t->phones[j].callee);
434
            printf(" %zd:%#zx", j, t->phones[j].callee);
435
    }
435
    }
436
    printf("\n");
436
    printf("\n");
437
           
437
           
438
    spinlock_unlock(&t->lock);
438
    spinlock_unlock(&t->lock);
439
    return true;
439
    return true;
440
}
440
}
441
 
441
 
442
/** Print task list */
442
/** Print task list */
443
void task_print_list(void)
443
void task_print_list(void)
444
{
444
{
445
    ipl_t ipl;
445
    ipl_t ipl;
446
   
446
   
447
    /* Messing with task structures, avoid deadlock */
447
    /* Messing with task structures, avoid deadlock */
448
    ipl = interrupts_disable();
448
    ipl = interrupts_disable();
449
    spinlock_lock(&tasks_lock);
449
    spinlock_lock(&tasks_lock);
450
   
450
   
451
    if (sizeof(void *) == 4) {
451
    if (sizeof(void *) == 4) {
452
        printf("taskid name       ctx address    as         "
452
        printf("taskid name       ctx address    as         "
453
            "cycles     threads calls  callee\n");
453
            "cycles     threads calls  callee\n");
454
        printf("------ ---------- --- ---------- ---------- "
454
        printf("------ ---------- --- ---------- ---------- "
455
            "---------- ------- ------ ------>\n");
455
            "---------- ------- ------ ------>\n");
456
    } else {
456
    } else {
457
        printf("taskid name       ctx address            as                 "
457
        printf("taskid name       ctx address            as                 "
458
            "cycles     threads calls  callee\n");
458
            "cycles     threads calls  callee\n");
459
        printf("------ ---------- --- ------------------ ------------------ "
459
        printf("------ ---------- --- ------------------ ------------------ "
460
            "---------- ------- ------ ------>\n");
460
            "---------- ------- ------ ------>\n");
461
    }
461
    }
462
 
462
 
463
    avltree_walk(&tasks_tree, task_print_walker, NULL);
463
    avltree_walk(&tasks_tree, task_print_walker, NULL);
464
 
464
 
465
    spinlock_unlock(&tasks_lock);
465
    spinlock_unlock(&tasks_lock);
466
    interrupts_restore(ipl);
466
    interrupts_restore(ipl);
467
}
467
}
468
 
468
 
469
/** @}
469
/** @}
470
 */
470
 */
471
 
471