Zephyr API Documentation 4.4.99
A Scalable Open Source RTOS
Loading...
Searching...
No Matches
kernel_structs.h
Go to the documentation of this file.
1/*
2 * Copyright (c) 2016 Wind River Systems, Inc.
3 *
4 * SPDX-License-Identifier: Apache-2.0
5 */
6
7/*
8 * The purpose of this file is to provide essential/minimal kernel structure
9 * definitions, so that they can be used without including kernel.h.
10 *
11 * The following rules must be observed:
12 * 1. kernel_structs.h shall not depend on kernel.h both directly and
13 * indirectly (i.e. it shall not include any header files that include
14 * kernel.h in their dependency chain).
15 * 2. kernel.h shall imply kernel_structs.h, such that it shall not be
16 * necessary to include kernel_structs.h explicitly when kernel.h is
17 * included.
18 */
19
20#ifndef ZEPHYR_KERNEL_INCLUDE_KERNEL_STRUCTS_H_
21#define ZEPHYR_KERNEL_INCLUDE_KERNEL_STRUCTS_H_
22
23#if !defined(_ASMLANGUAGE)
24#include <zephyr/sys/atomic.h>
25#include <zephyr/types.h>
26#include <zephyr/sys/dlist.h>
27#include <zephyr/sys/util.h>
28#include <zephyr/sys/sys_heap.h>
29#include <zephyr/arch/structs.h>
30#include <zephyr/kernel/stats.h>
32#include <zephyr/sys/rb.h>
33#endif
34
35#define K_NUM_THREAD_PRIO (CONFIG_NUM_PREEMPT_PRIORITIES + CONFIG_NUM_COOP_PRIORITIES + 1)
36#define PRIQ_BITMAP_SIZE (DIV_ROUND_UP(K_NUM_THREAD_PRIO, BITS_PER_LONG))
37
38#ifdef __cplusplus
39extern "C" {
40#endif
41
42/*
43 * Bitmask definitions for the struct k_thread.thread_state field.
44 *
45 * Must be before kernel_arch_data.h because it might need them to be already
46 * defined.
47 */
48
49/* states: common uses low bits, arch-specific use high bits */
50
51/* Not a real thread */
52#define _THREAD_DUMMY (BIT(0))
53
54/* Thread is waiting on an object */
55#define _THREAD_PENDING (BIT(1))
56
57/* Thread is sleeping */
58#define _THREAD_SLEEPING (BIT(2))
59
60/* Thread has terminated */
61#define _THREAD_DEAD (BIT(3))
62
63/* Thread is suspended */
64#define _THREAD_SUSPENDED (BIT(4))
65
66/* Thread is in the process of aborting */
67#define _THREAD_ABORTING (BIT(5))
68
69/* Thread is in the process of suspending */
70#define _THREAD_SUSPENDING (BIT(6))
71
72/* Thread is present in the ready queue */
73#define _THREAD_QUEUED (BIT(7))
74
75/* end - states */
76
77#ifdef CONFIG_STACK_SENTINEL
78/* Magic value in lowest bytes of the stack */
79#define STACK_SENTINEL 0xF0F0F0F0
80#endif
81
82/* lowest value of _thread_base.preempt at which a thread is non-preemptible */
83#define _NON_PREEMPT_THRESHOLD 0x0080U
84
85/* highest value of _thread_base.preempt at which a thread is preemptible */
86#define _PREEMPT_THRESHOLD (_NON_PREEMPT_THRESHOLD - 1U)
87
88#if !defined(_ASMLANGUAGE)
89
90/* There are three abstractions defined for "thread priority queues".
91 *
92 * The first is a simple doubly linked list (sys_dlist_t) appropriate for
93 * systems with small numbers of threads and sensitive to code size. It is
94 * stored in sorted order, taking an O(N) cost every time a thread is added
95 * to the list. This corresponds to the way the original _wait_q_t abstraction
96 * worked and is very fast as long as the number of threads is small.
97 *
98 * The second is a scalable balanced tree. It has a rather larger code size
99 * (due to the data structure itself, the code here is just stubs) and higher
100 * constant-factor performance overhead, with O(logN) scaling in the presence
101 * of large number of threads.
102 *
103 * The third is a traditional/textbook "multi-queue". It has separate lists
104 * for each priority. This corresponds to the original Zephyr scheduler. RAM
105 * requirements are comparatively high, but performance is very fast. It won't
106 * work with features like deadline scheduling which need large priority spaces
107 * to represent their requirements.
108 *
109 * Either the simple or balanced tree abstractions may be used for the wait_q.
110 * Any of the three may be used for the system ready queue. The choices are
111 * configurable at build time.
112 */
113
114struct _priq_rb {
115 struct rbtree tree;
116 int next_order_key;
117};
118
119struct _priq_mq {
121 unsigned long bitmask[PRIQ_BITMAP_SIZE];
122#ifndef CONFIG_SMP
123 unsigned int cached_queue_index;
124#endif
125};
126
127struct _ready_q {
128#ifndef CONFIG_SMP
129 /* always contains next thread to run: cannot be NULL */
130 struct k_thread *cache;
131#endif
132
133#if defined(CONFIG_SCHED_SIMPLE)
134 sys_dlist_t runq;
135#elif defined(CONFIG_SCHED_SCALABLE)
136 struct _priq_rb runq;
137#elif defined(CONFIG_SCHED_MULTIQ)
138 struct _priq_mq runq;
139#endif
140};
141
142typedef struct _ready_q _ready_q_t;
143
144struct _cpu {
145 /* nested interrupt count */
146 uint32_t nested;
147
148 /* interrupt stack pointer base */
149 char *irq_stack;
150
151 /* currently scheduled thread */
152 struct k_thread *current;
153
154 /* one assigned idle thread per CPU */
155 struct k_thread *idle_thread;
156
157#ifdef CONFIG_SCHED_CPU_MASK_PIN_ONLY
158 struct _ready_q ready_q;
159#endif
160
161#if (CONFIG_NUM_METAIRQ_PRIORITIES > 0)
162 /* Coop thread preempted by current metairq, or NULL */
163 struct k_thread *metairq_preempted;
164#endif
165
166 uint8_t id;
167
168#if defined(CONFIG_FPU_SHARING)
169 void *fp_ctx;
170#endif
171
172#ifdef CONFIG_SMP
173 /* True when _current is allowed to context switch */
174 uint8_t swap_ok;
175#endif
176
177#ifdef CONFIG_SCHED_THREAD_USAGE
178 /*
179 * [usage0] is used as a timestamp to mark the beginning of an
180 * execution window. [0] is a special value indicating that it
181 * has been stopped (but not disabled).
182 */
183
184 uint32_t usage0;
185
186#ifdef CONFIG_SCHED_THREAD_USAGE_ALL
187 struct k_cycle_stats *usage;
188#endif
189#endif
190
191#ifdef CONFIG_OBJ_CORE_SYSTEM
192 struct k_obj_core obj_core;
193#endif
194
195#ifdef CONFIG_SCHED_IPI_SUPPORTED
196 sys_dlist_t ipi_workq;
197#endif
198
199 /* Per CPU architecture specifics */
200 struct _cpu_arch arch;
201};
202
203typedef struct _cpu _cpu_t;
204
205struct z_kernel {
206 struct _cpu cpus[CONFIG_MP_MAX_NUM_CPUS];
207
208#ifdef CONFIG_PM
209 int32_t idle; /* Number of ticks for kernel idling */
210#endif
211
212 /*
213 * ready queue: can be big, keep after small fields, since some
214 * assembly (e.g. ARC) are limited in the encoding of the offset
215 */
216#ifndef CONFIG_SCHED_CPU_MASK_PIN_ONLY
217 struct _ready_q ready_q;
218#endif
219
220#if defined(CONFIG_THREAD_MONITOR)
221 struct k_thread *threads; /* singly linked list of ALL threads */
222#endif
223#ifdef CONFIG_SCHED_THREAD_USAGE_ALL
224 struct k_cycle_stats usage[CONFIG_MP_MAX_NUM_CPUS];
225#endif
226
227#ifdef CONFIG_OBJ_CORE_SYSTEM
228 struct k_obj_core obj_core;
229#endif
230
231#if defined(CONFIG_SMP) && defined(CONFIG_SCHED_IPI_SUPPORTED)
232 /* Identify CPUs to send IPIs to at the next scheduling point */
233 atomic_t pending_ipi;
234#endif
235};
236
237typedef struct z_kernel _kernel_t;
238
239extern struct z_kernel _kernel;
240
241extern atomic_t _cpus_active;
242
243#ifdef CONFIG_SMP
244
245/* True if the current context can be preempted and migrated to
246 * another SMP CPU.
247 */
248bool z_smp_cpu_mobile(void);
249#define _current_cpu ({ __ASSERT_NO_MSG(!z_smp_cpu_mobile()); \
250 arch_curr_cpu(); })
251
252__attribute_const__ struct k_thread *z_smp_current_get(void);
253#define _current z_smp_current_get()
254
255#else
256#define _current_cpu (&_kernel.cpus[0])
257#define _current _kernel.cpus[0].current
258#endif
259
260#define CPU_ID ((CONFIG_MP_MAX_NUM_CPUS == 1) ? 0 : _current_cpu->id)
261
262/* This is always invoked from a context where preemption is disabled */
263#define z_current_thread_set(thread) ({ _current_cpu->current = (thread); })
264
265#ifdef CONFIG_ARCH_HAS_CUSTOM_CURRENT_IMPL
266#undef _current
267#define _current arch_current_thread()
268#undef z_current_thread_set
269#define z_current_thread_set(thread) \
270 arch_current_thread_set(({ _current_cpu->current = (thread); }))
271#endif
272
273/* kernel wait queue record */
274#ifdef CONFIG_WAITQ_SCALABLE
275
276typedef struct {
277 struct _priq_rb waitq;
278} _wait_q_t;
279
280/* defined in kernel/priority_queues.c */
281bool z_priq_rb_lessthan(struct rbnode *a, struct rbnode *b);
282
283#define Z_WAIT_Q_INIT(wait_q) { { { .lessthan_fn = z_priq_rb_lessthan } } }
284
285#else
286
287typedef struct {
288 sys_dlist_t waitq;
289} _wait_q_t;
290
291#define Z_WAIT_Q_INIT(wait_q) { SYS_DLIST_STATIC_INIT(&(wait_q)->waitq) }
292
293#endif /* CONFIG_WAITQ_SCALABLE */
294
295/* kernel timeout record */
296struct _timeout;
297typedef void (*_timeout_func_t)(struct _timeout *t);
298
299struct _timeout {
300 sys_dnode_t node;
301 _timeout_func_t fn;
302#ifdef CONFIG_TIMEOUT_64BIT
303 /* Can't use k_ticks_t for header dependency reasons */
304 int64_t dticks;
305#else
306 int32_t dticks;
307#endif
308};
309
310typedef void (*k_thread_timeslice_fn_t)(struct k_thread *thread, void *data);
311
312#ifdef __cplusplus
313}
314#endif
315
316#endif /* _ASMLANGUAGE */
317
318#endif /* ZEPHYR_KERNEL_INCLUDE_KERNEL_STRUCTS_H_ */
long atomic_t
Definition atomic_types.h:15
struct _dnode sys_dnode_t
Doubly-linked list node structure.
Definition dlist.h:54
struct _dnode sys_dlist_t
Doubly-linked list structure.
Definition dlist.h:50
#define PRIQ_BITMAP_SIZE
Definition kernel_structs.h:36
void(* k_thread_timeslice_fn_t)(struct k_thread *thread, void *data)
Definition kernel_structs.h:310
#define K_NUM_THREAD_PRIO
Definition kernel_structs.h:35
__UINT32_TYPE__ uint32_t
Definition stdint.h:90
__INT32_TYPE__ int32_t
Definition stdint.h:74
__UINT8_TYPE__ uint8_t
Definition stdint.h:88
__INT64_TYPE__ int64_t
Definition stdint.h:75
Structure used to track internal statistics about both thread and CPU usage.
Definition stats.h:18
Object core structure.
Definition obj_core.h:121
Thread Structure.
Definition thread.h:259
Balanced red/black tree node structure.
Definition rb.h:58
Balanced red/black tree structure.
Definition rb.h:91
Misc utilities.