[8e8c1a5] | 1 | /*
|
---|
[df4ed85] | 2 | * Copyright (c) 2001-2004 Jakub Jermar
|
---|
[f761f1eb] | 3 | * All rights reserved.
|
---|
| 4 | *
|
---|
| 5 | * Redistribution and use in source and binary forms, with or without
|
---|
| 6 | * modification, are permitted provided that the following conditions
|
---|
| 7 | * are met:
|
---|
| 8 | *
|
---|
| 9 | * - Redistributions of source code must retain the above copyright
|
---|
| 10 | * notice, this list of conditions and the following disclaimer.
|
---|
| 11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
| 12 | * notice, this list of conditions and the following disclaimer in the
|
---|
| 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
|
---|
| 15 | * derived from this software without specific prior written permission.
|
---|
| 16 | *
|
---|
| 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
|
---|
| 19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
| 20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
| 21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
| 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
|
---|
| 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
|
---|
| 26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
| 27 | */
|
---|
| 28 |
|
---|
[764c302] | 29 | /** @addtogroup genericproc
|
---|
[b45c443] | 30 | * @{
|
---|
| 31 | */
|
---|
| 32 | /** @file
|
---|
| 33 | */
|
---|
| 34 |
|
---|
[06e1e95] | 35 | #ifndef KERN_TASK_H_
|
---|
| 36 | #define KERN_TASK_H_
|
---|
[f761f1eb] | 37 |
|
---|
[0b3a78f] | 38 | #include <cpu.h>
|
---|
[f761f1eb] | 39 | #include <synch/spinlock.h>
|
---|
[4fded58] | 40 | #include <synch/mutex.h>
|
---|
[b3f8fb7] | 41 | #include <synch/rwlock.h>
|
---|
[e090e1bc] | 42 | #include <synch/futex.h>
|
---|
[7f6e755] | 43 | #include <adt/btree.h>
|
---|
[5c9a08b] | 44 | #include <adt/list.h>
|
---|
[1077d91] | 45 | #include <security/cap.h>
|
---|
[a6d4ceb] | 46 | #include <arch/proc/task.h>
|
---|
[b3f8fb7] | 47 | #include <arch/proc/thread.h>
|
---|
| 48 | #include <arch/context.h>
|
---|
| 49 | #include <arch/fpu_context.h>
|
---|
| 50 | #include <arch/cpu.h>
|
---|
| 51 | #include <mm/tlb.h>
|
---|
| 52 | #include <proc/scheduler.h>
|
---|
| 53 |
|
---|
| 54 | #define IPC_MAX_PHONES 16
|
---|
| 55 |
|
---|
| 56 | struct answerbox;
|
---|
| 57 | struct task;
|
---|
| 58 | struct thread;
|
---|
| 59 |
|
---|
| 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;
|
---|
[f761f1eb] | 94 |
|
---|
[20d50a1] | 95 | /** Task structure. */
|
---|
[b3f8fb7] | 96 | typedef struct task {
|
---|
[7509ddc] | 97 | /** Task lock.
|
---|
| 98 | *
|
---|
| 99 | * Must be acquired before threads_lock and thread lock of any of its threads.
|
---|
| 100 | */
|
---|
[dc747e3] | 101 | SPINLOCK_DECLARE(lock);
|
---|
[7509ddc] | 102 |
|
---|
[ff14c520] | 103 | char *name;
|
---|
[b3f8fb7] | 104 | struct thread *main_thread; /**< Pointer to the main thread. */
|
---|
[9cefba4] | 105 | link_t th_head; /**< List of threads contained in this task. */
|
---|
[20d50a1] | 106 | as_t *as; /**< Address space. */
|
---|
[7f6e755] | 107 | task_id_t taskid; /**< Unique identity of task */
|
---|
[764c302] | 108 | context_id_t context; /**< Task security context */
|
---|
[286e03d] | 109 |
|
---|
[7509ddc] | 110 | /** If this is true, new threads can become part of the task. */
|
---|
| 111 | bool accept_new_threads;
|
---|
| 112 |
|
---|
| 113 | count_t refcount; /**< Number of references (i.e. threads). */
|
---|
| 114 |
|
---|
[1077d91] | 115 | cap_t capabilities; /**< Task capabilities. */
|
---|
| 116 |
|
---|
[5f62ef9] | 117 | /* IPC stuff */
|
---|
[6d9c49a] | 118 | answerbox_t answerbox; /**< Communication endpoint */
|
---|
| 119 | phone_t phones[IPC_MAX_PHONES];
|
---|
[eb3d379] | 120 | atomic_t active_calls; /**< Active asynchronous messages.
|
---|
| 121 | * It is used for limiting uspace to
|
---|
| 122 | * certain extent. */
|
---|
[a6d4ceb] | 123 |
|
---|
[39cea6a] | 124 | task_arch_t arch; /**< Architecture specific task data. */
|
---|
[4fded58] | 125 |
|
---|
| 126 | /**
|
---|
[482826d] | 127 | * Serializes access to the B+tree of task's futexes. This mutex is
|
---|
| 128 | * independent on the task spinlock.
|
---|
| 129 | */
|
---|
[4fded58] | 130 | mutex_t futexes_lock;
|
---|
| 131 | btree_t futexes; /**< B+tree of futexes referenced by this task. */
|
---|
[0313ff0] | 132 |
|
---|
| 133 | uint64_t cycles; /**< Accumulated accounting. */
|
---|
[b3f8fb7] | 134 | } task_t;
|
---|
| 135 |
|
---|
[8be8cfa] | 136 | SPINLOCK_EXTERN(tasks_lock);
|
---|
[7f6e755] | 137 | extern btree_t tasks_btree;
|
---|
[f761f1eb] | 138 |
|
---|
| 139 | extern void task_init(void);
|
---|
[ff14c520] | 140 | extern task_t *task_create(as_t *as, char *name);
|
---|
[7509ddc] | 141 | extern void task_destroy(task_t *t);
|
---|
[ff14c520] | 142 | extern task_t *task_run_program(void *program_addr, char *name);
|
---|
[9a8d91b] | 143 | extern task_t *task_find_by_id(task_id_t id);
|
---|
[7509ddc] | 144 | extern int task_kill(task_id_t id);
|
---|
[0313ff0] | 145 | extern uint64_t task_get_accounting(task_t *t);
|
---|
[7509ddc] | 146 |
|
---|
[b3f8fb7] | 147 | extern void cap_set(task_t *t, cap_t caps);
|
---|
| 148 | extern cap_t cap_get(task_t *t);
|
---|
| 149 |
|
---|
[f761f1eb] | 150 |
|
---|
[963074b3] | 151 | #ifndef task_create_arch
|
---|
| 152 | extern void task_create_arch(task_t *t);
|
---|
| 153 | #endif
|
---|
| 154 |
|
---|
[31e8ddd] | 155 | #ifndef task_destroy_arch
|
---|
| 156 | extern void task_destroy_arch(task_t *t);
|
---|
| 157 | #endif
|
---|
| 158 |
|
---|
[7f1c620] | 159 | extern unative_t sys_task_get_id(task_id_t *uspace_task_id);
|
---|
[ec55358] | 160 |
|
---|
[f761f1eb] | 161 | #endif
|
---|
[b45c443] | 162 |
|
---|
[06e1e95] | 163 | /** @}
|
---|
[b45c443] | 164 | */
|
---|