toolchain: migrate iterable sections calls to the external API
This migrates all the current iterable section usages to the external API, dropping the "Z_" prefix: Z_ITERABLE_SECTION_ROM Z_ITERABLE_SECTION_ROM_GC_ALLOWED Z_ITERABLE_SECTION_RAM Z_ITERABLE_SECTION_RAM_GC_ALLOWED Z_STRUCT_SECTION_ITERABLE Z_STRUCT_SECTION_ITERABLE_ALTERNATE Z_STRUCT_SECTION_FOREACH Signed-off-by: Fabio Baltieri <fabiobaltieri@google.com>
This commit is contained in:
parent
34d2ca613f
commit
f88a420d69
54 changed files with 188 additions and 190 deletions
|
@ -671,7 +671,7 @@ struct _static_thread_data {
|
|||
prio, options, delay) \
|
||||
K_THREAD_STACK_DEFINE(_k_thread_stack_##name, stack_size); \
|
||||
struct k_thread _k_thread_obj_##name; \
|
||||
Z_STRUCT_SECTION_ITERABLE(_static_thread_data, _k_thread_data_##name) =\
|
||||
STRUCT_SECTION_ITERABLE(_static_thread_data, _k_thread_data_##name) = \
|
||||
Z_THREAD_INITIALIZER(&_k_thread_obj_##name, \
|
||||
_k_thread_stack_##name, stack_size, \
|
||||
entry, p1, p2, p3, prio, options, delay, \
|
||||
|
@ -1352,7 +1352,7 @@ typedef void (*k_timer_stop_t)(struct k_timer *timer);
|
|||
* @param stop_fn Function to invoke if the timer is stopped while running.
|
||||
*/
|
||||
#define K_TIMER_DEFINE(name, expiry_fn, stop_fn) \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_timer, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_timer, name) = \
|
||||
Z_TIMER_INITIALIZER(name, expiry_fn, stop_fn)
|
||||
|
||||
/**
|
||||
|
@ -1921,7 +1921,7 @@ __syscall void *k_queue_peek_tail(struct k_queue *queue);
|
|||
* @param name Name of the queue.
|
||||
*/
|
||||
#define K_QUEUE_DEFINE(name) \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_queue, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_queue, name) = \
|
||||
Z_QUEUE_INITIALIZER(name)
|
||||
|
||||
/** @} */
|
||||
|
@ -2243,7 +2243,7 @@ struct k_fifo {
|
|||
* @param name Name of the FIFO queue.
|
||||
*/
|
||||
#define K_FIFO_DEFINE(name) \
|
||||
Z_STRUCT_SECTION_ITERABLE_ALTERNATE(k_queue, k_fifo, name) = \
|
||||
STRUCT_SECTION_ITERABLE_ALTERNATE(k_queue, k_fifo, name) = \
|
||||
Z_FIFO_INITIALIZER(name)
|
||||
|
||||
/** @} */
|
||||
|
@ -2367,7 +2367,7 @@ struct k_lifo {
|
|||
* @param name Name of the fifo.
|
||||
*/
|
||||
#define K_LIFO_DEFINE(name) \
|
||||
Z_STRUCT_SECTION_ITERABLE_ALTERNATE(k_queue, k_lifo, name) = \
|
||||
STRUCT_SECTION_ITERABLE_ALTERNATE(k_queue, k_lifo, name) = \
|
||||
Z_LIFO_INITIALIZER(name)
|
||||
|
||||
/** @} */
|
||||
|
@ -2501,7 +2501,7 @@ __syscall int k_stack_pop(struct k_stack *stack, stack_data_t *data,
|
|||
#define K_STACK_DEFINE(name, stack_num_entries) \
|
||||
stack_data_t __noinit \
|
||||
_k_stack_buf_##name[stack_num_entries]; \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_stack, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_stack, name) = \
|
||||
Z_STACK_INITIALIZER(name, _k_stack_buf_##name, \
|
||||
stack_num_entries)
|
||||
|
||||
|
@ -2569,7 +2569,7 @@ struct k_mutex {
|
|||
* @param name Name of the mutex.
|
||||
*/
|
||||
#define K_MUTEX_DEFINE(name) \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_mutex, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_mutex, name) = \
|
||||
Z_MUTEX_INITIALIZER(name)
|
||||
|
||||
/**
|
||||
|
@ -2708,7 +2708,7 @@ __syscall int k_condvar_wait(struct k_condvar *condvar, struct k_mutex *mutex,
|
|||
* @param name Name of the condition variable.
|
||||
*/
|
||||
#define K_CONDVAR_DEFINE(name) \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_condvar, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_condvar, name) = \
|
||||
Z_CONDVAR_INITIALIZER(name)
|
||||
/**
|
||||
* @}
|
||||
|
@ -2851,7 +2851,7 @@ static inline unsigned int z_impl_k_sem_count_get(struct k_sem *sem)
|
|||
* @param count_limit Maximum permitted semaphore count.
|
||||
*/
|
||||
#define K_SEM_DEFINE(name, initial_count, count_limit) \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_sem, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_sem, name) = \
|
||||
Z_SEM_INITIALIZER(name, initial_count, count_limit); \
|
||||
BUILD_ASSERT(((count_limit) != 0) && \
|
||||
((initial_count) <= (count_limit)) && \
|
||||
|
@ -4214,7 +4214,7 @@ struct k_msgq_attrs {
|
|||
#define K_MSGQ_DEFINE(q_name, q_msg_size, q_max_msgs, q_align) \
|
||||
static char __noinit __aligned(q_align) \
|
||||
_k_fifo_buf_##q_name[(q_max_msgs) * (q_msg_size)]; \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_msgq, q_name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_msgq, q_name) = \
|
||||
Z_MSGQ_INITIALIZER(q_name, _k_fifo_buf_##q_name, \
|
||||
q_msg_size, q_max_msgs)
|
||||
|
||||
|
@ -4466,7 +4466,7 @@ struct k_mbox {
|
|||
* @param name Name of the mailbox.
|
||||
*/
|
||||
#define K_MBOX_DEFINE(name) \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_mbox, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_mbox, name) = \
|
||||
Z_MBOX_INITIALIZER(name) \
|
||||
|
||||
/**
|
||||
|
@ -4620,9 +4620,9 @@ struct k_pipe {
|
|||
*
|
||||
*/
|
||||
#define K_PIPE_DEFINE(name, pipe_buffer_size, pipe_align) \
|
||||
static unsigned char __noinit __aligned(pipe_align) \
|
||||
static unsigned char __noinit __aligned(pipe_align) \
|
||||
_k_pipe_buf_##name[pipe_buffer_size]; \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_pipe, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_pipe, name) = \
|
||||
Z_PIPE_INITIALIZER(name, _k_pipe_buf_##name, pipe_buffer_size)
|
||||
|
||||
/**
|
||||
|
@ -4800,7 +4800,7 @@ struct k_mem_slab {
|
|||
#define K_MEM_SLAB_DEFINE(name, slab_block_size, slab_num_blocks, slab_align) \
|
||||
char __noinit __aligned(WB_UP(slab_align)) \
|
||||
_k_mem_slab_buf_##name[(slab_num_blocks) * WB_UP(slab_block_size)]; \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_mem_slab, name) = \
|
||||
STRUCT_SECTION_ITERABLE(k_mem_slab, name) = \
|
||||
Z_MEM_SLAB_INITIALIZER(name, _k_mem_slab_buf_##name, \
|
||||
WB_UP(slab_block_size), slab_num_blocks)
|
||||
|
||||
|
@ -5025,7 +5025,7 @@ void k_heap_free(struct k_heap *h, void *mem);
|
|||
#define K_HEAP_DEFINE(name, bytes) \
|
||||
char __aligned(8) /* CHUNK_UNIT */ \
|
||||
kheap_##name[MAX(bytes, Z_HEAP_MIN_SIZE)]; \
|
||||
Z_STRUCT_SECTION_ITERABLE(k_heap, name) = { \
|
||||
STRUCT_SECTION_ITERABLE(k_heap, name) = { \
|
||||
.heap = { \
|
||||
.init_mem = kheap_##name, \
|
||||
.init_bytes = MAX(bytes, Z_HEAP_MIN_SIZE), \
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue