1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/*
* Copyright (c) 2012 Richard Braun.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef KERN_TASK_H
#define KERN_TASK_H
#include <kern/atomic.h>
#include <kern/init.h>
#include <kern/list.h>
#include <kern/spinlock.h>
#include <kern/thread.h>
#include <vm/vm_map.h>
/*
* Task name buffer size.
*/
#define TASK_NAME_SIZE 32
/*
* Task structure.
*/
struct task {
unsigned long nr_refs;
struct spinlock lock;
struct list node;
struct list threads;
struct vm_map *map;
char name[TASK_NAME_SIZE];
};
static inline struct task *
task_get_kernel_task(void)
{
extern struct task task_kernel_task;
return &task_kernel_task;
}
static inline void
task_ref(struct task *task)
{
unsigned long nr_refs;
nr_refs = atomic_fetch_add(&task->nr_refs, 1, ATOMIC_RELAXED);
assert(nr_refs != (unsigned long)-1);
}
static inline void
task_unref(struct task *task)
{
unsigned long nr_refs;
nr_refs = atomic_fetch_sub(&task->nr_refs, 1, ATOMIC_ACQ_REL);
assert(nr_refs != 0);
if (nr_refs == 1) {
/* TODO Task destruction */
}
}
static inline struct vm_map *
task_get_vm_map(const struct task *task)
{
return task->map;
}
/*
* Create a task.
*/
int task_create(struct task **taskp, const char *name);
/*
* Look up a task from its name.
*
* If a task is found, it gains a reference. Otherwise, NULL is returned.
*
* This function is meant for debugging only.
*/
struct task * task_lookup(const char *name);
/*
* Add a thread to a task.
*/
void task_add_thread(struct task *task, struct thread *thread);
/*
* Remove a thread from a task.
*/
void task_remove_thread(struct task *task, struct thread *thread);
/*
* Look up a thread in a task from its name.
*
* If a thread is found, it gains a reference, Otherwise, NULL is returned.
*
* This function is meant for debugging only.
*/
struct thread * task_lookup_thread(struct task *task, const char *name);
/*
* Display task information.
*
* If task is NULL, this function displays all tasks.
*/
void task_info(struct task *task);
/*
* This init operation provides :
* - task creation
* - module fully initialized
*/
INIT_OP_DECLARE(task_setup);
#endif /* KERN_TASK_H */
|
