forked from teawater/libhermit
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtasks_types.h
More file actions
205 lines (178 loc) · 5.32 KB
/
tasks_types.h
File metadata and controls
205 lines (178 loc) · 5.32 KB
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
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
/*
* Copyright (c) 2010, Stefan Lankes, RWTH Aachen University
* 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.
* * Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 REGENTS OR CONTRIBUTORS 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.
*/
/**
* @author Stefan Lankes
* @file include/hermit/tasks_types.h
* @brief Task related structure definitions
*
* This file contains the task_t structure definition
* and task state define constants
*/
#ifndef __TASKS_TYPES_H__
#define __TASKS_TYPES_H__
#include <hermit/stddef.h>
#include <hermit/spinlock_types.h>
#include <hermit/vma.h>
#include <hermit/signal.h>
#include <asm/tasks_types.h>
#include <asm/atomic.h>
#ifdef __cplusplus
extern "C" {
#endif
#define TASK_INVALID 0
#define TASK_READY 1
#define TASK_RUNNING 2
#define TASK_BLOCKED 3
#define TASK_FINISHED 4
#define TASK_IDLE 5
#define TASK_DEFAULT_FLAGS 0
#define TASK_FPU_INIT (1 << 0)
#define TASK_FPU_USED (1 << 1)
#define TASK_TIMER (1 << 2)
#define MAX_PRIO 31
#define REALTIME_PRIO 31
#define HIGH_PRIO 16
#define NORMAL_PRIO 8
#define LOW_PRIO 1
#define IDLE_PRIO 0
typedef int (*entry_point_t)(void*);
/** @brief Represents a the process control block */
typedef struct task {
/// Task id = position in the task table
tid_t id __attribute__ ((aligned (CACHE_LINE)));
/// Task status (INVALID, READY, RUNNING, ...)
uint32_t status;
/// last core id on which the task was running
uint32_t last_core;
/// copy of the stack pointer before a context switch
size_t* last_stack_pointer;
/// start address of the stack
void* stack;
/// interrupt stack for IST1
void* ist_addr;
/// Additional status flags. For instance, to signalize the using of the FPU
uint8_t flags;
/// Task priority
uint8_t prio;
/// timeout for a blocked task
uint64_t timeout;
/// starting time/tick of the task
uint64_t start_tick;
/// last TSC, when the task got the CPU
uint64_t last_tsc;
/// the userspace heap
vma_t* heap;
/// parent thread
tid_t parent;
/// next task in the queue
struct task* next;
/// previous task in the queue
struct task* prev;
/// TLS address
size_t tls_addr;
/// TLS file size
size_t tls_size;
/// LwIP error code
int lwip_err;
/// Handler for (POSIX) Signals
signal_handler_t signal_handler;
/// FPU state
union fpu_state fpu;
} task_t;
typedef struct {
task_t* first;
task_t* last;
} task_list_t;
/** @brief Represents a queue for all runable tasks */
typedef struct {
/// idle task
task_t* idle __attribute__ ((aligned (CACHE_LINE)));
/// previous task
task_t* old_task;
/// last task, which used the FPU
tid_t fpu_owner;
/// total number of tasks in the queue
uint32_t nr_tasks;
/// indicates the used priority queues
uint32_t prio_bitmap;
/// a queue for each priority
task_list_t queue[MAX_PRIO];
/// a queue for timers
task_list_t timers;
/// lock for this runqueue
spinlock_irqsave_t lock;
} readyqueues_t;
static inline void task_list_remove_task(task_list_t* list, task_t* task)
{
if (task->prev)
task->prev->next = task->next;
if (task->next)
task->next->prev = task->prev;
if (list->last == task)
list->last = task->prev;
if (list->first == task)
list->first = task->next;
}
static inline void task_list_push_back(task_list_t* list, task_t* task)
{
if(BUILTIN_EXPECT((task == NULL) || (list == NULL), 0)) {
return;
}
if (list->last) {
task->prev = list->last;
task->next = NULL;
list->last->next = task;
list->last = task;
} else {
list->last = list->first = task;
task->next = task->prev = NULL;
}
}
static inline task_t* task_list_pop_front(task_list_t* list)
{
if(BUILTIN_EXPECT((list == NULL), 0)) {
return NULL;
}
task_t* task = list->first;
if(list->first) {
// advance list
list->first = list->first->next;
if(list->first) {
// first element has no previous element
list->first->prev = NULL;
} else {
// no first element => no last element either
list->last = NULL;
}
}
task->next = task->prev = NULL;
return task;
}
#ifdef __cplusplus
}
#endif
#endif