Zephyr Project API 4.5.0-rc2
A Scalable Open Source RTOS
Loading...
Searching...
No Matches
rtio.h
Go to the documentation of this file.
1/*
2 * SPDX-FileCopyrightText: Copyright (c) 2022 Intel Corporation
3 * SPDX-FileCopyrightText: Copyright (c) 2026 Infineon Technologies AG,
4 * SPDX-FileCopyrightText: or an affiliate of Infineon Technologies AG. All rights reserved.
5 *
6 * SPDX-License-Identifier: Apache-2.0
7 */
8
28
29#ifndef ZEPHYR_INCLUDE_RTIO_RTIO_H_
30#define ZEPHYR_INCLUDE_RTIO_RTIO_H_
31
32#include <string.h>
33
35#include <zephyr/device.h>
36#include <zephyr/kernel.h>
37#include <zephyr/sys/__assert.h>
38#include <zephyr/sys/atomic.h>
40#include <zephyr/sys/util.h>
42#include <zephyr/rtio/sqe.h>
43#include <zephyr/rtio/cqe.h>
44#include <zephyr/rtio/iodev.h>
45
46#ifdef __cplusplus
47extern "C" {
48#endif
49
50
59
60struct rtio;
61
70typedef void (*rtio_cqe_callback_t)(struct rtio *r, void *user_data);
71
83struct rtio {
84#ifdef CONFIG_RTIO_SUBMIT_SEM
85 /* A wait semaphore which may suspend the calling thread
86 * to wait for some number of completions when calling submit
87 */
88 struct k_sem *submit_sem;
89
90 uint32_t submit_count;
91#endif
92
93#ifdef CONFIG_RTIO_CONSUME_SEM
94 /* A wait semaphore which may suspend the calling thread
95 * to wait for some number of completions while consuming
96 * them from the completion queue
97 */
98 struct k_sem *consume_sem;
99#endif
100
103
106
108 struct rtio_sqe_pool *sqe_pool;
109
111 struct rtio_cqe_pool *cqe_pool;
112
113#ifdef CONFIG_RTIO_SYS_MEM_BLOCKS
114 /* Mem block pool */
115 struct sys_mem_blocks *block_pool;
116#endif
117
119 struct mpsc sq;
120
122 struct mpsc cq;
123
124#ifdef CONFIG_RTIO_CQE_CALLBACK
125 /* Completion queue event callback */
126 rtio_cqe_callback_t cqe_cb;
127
128 /* Completion queue event callback user data */
129 void *cqe_cb_user_data;
130#endif
131};
132
133/* @cond ignore */
134#define Z_RTIO_DEFINE(name, _sqe_pool, _cqe_pool, _block_pool) \
135 IF_ENABLED(CONFIG_RTIO_SUBMIT_SEM, \
136 (static K_SEM_DEFINE(CONCAT(_submit_sem_, name), 0, K_SEM_MAX_LIMIT))) \
137 IF_ENABLED(CONFIG_RTIO_CONSUME_SEM, \
138 (static K_SEM_DEFINE(CONCAT(_consume_sem_, name), 0, K_SEM_MAX_LIMIT))) \
139 STRUCT_SECTION_ITERABLE(rtio, name) = { \
140 IF_ENABLED(CONFIG_RTIO_SUBMIT_SEM, (.submit_sem = &CONCAT(_submit_sem_, name),)) \
141 IF_ENABLED(CONFIG_RTIO_SUBMIT_SEM, (.submit_count = 0,)) \
142 IF_ENABLED(CONFIG_RTIO_CONSUME_SEM, (.consume_sem = &CONCAT(_consume_sem_, name),))\
143 .cq_count = ATOMIC_INIT(0), \
144 .xcqcnt = ATOMIC_INIT(0), \
145 .sqe_pool = _sqe_pool, \
146 .cqe_pool = _cqe_pool, \
147 IF_ENABLED(CONFIG_RTIO_SYS_MEM_BLOCKS, (.block_pool = _block_pool,)) \
148 .sq = MPSC_INIT((name.sq)), \
149 .cq = MPSC_INIT((name.cq)), \
150 IF_ENABLED(CONFIG_RTIO_CQE_CALLBACK, (.cqe_cb = NULL, .cqe_cb_user_data = NULL,)) \
151 }
152/* @endcond */
153
161#define RTIO_DEFINE(name, sq_sz, cq_sz) \
162 Z_RTIO_SQE_POOL_DEFINE(CONCAT(name, _sqe_pool), sq_sz); \
163 Z_RTIO_CQE_POOL_DEFINE(CONCAT(name, _cqe_pool), cq_sz); \
164 Z_RTIO_DEFINE(name, &CONCAT(name, _sqe_pool), \
165 &CONCAT(name, _cqe_pool), NULL)
166
167
175static inline size_t rtio_mempool_block_size(const struct rtio *r)
176{
177#ifndef CONFIG_RTIO_SYS_MEM_BLOCKS
178 ARG_UNUSED(r);
179 return 0;
180#else
181 if (r == NULL || r->block_pool == NULL) {
182 return 0;
183 }
184 return BIT(r->block_pool->info.blk_sz_shift);
185#endif
186}
187
195#if defined(CONFIG_RTIO_SYS_MEM_BLOCKS) || defined(__DOXYGEN__)
196static inline uint16_t __rtio_compute_mempool_block_index(const struct rtio *r, const void *ptr)
197{
198 uintptr_t addr = (uintptr_t)ptr;
199 struct sys_mem_blocks *mem_pool = r->block_pool;
200 uint32_t block_size = rtio_mempool_block_size(r);
201
202 uintptr_t buff = (uintptr_t)mem_pool->buffer;
203 uint32_t buff_size = mem_pool->info.num_blocks * block_size;
204
205 if (addr < buff || addr >= buff + buff_size) {
206 return UINT16_MAX;
207 }
208 return (addr - buff) / block_size;
209}
210#endif
211
213
214static inline int rtio_block_pool_alloc(struct rtio *r, size_t min_sz,
215 size_t max_sz, uint8_t **buf, uint32_t *buf_len)
216{
217#ifndef CONFIG_RTIO_SYS_MEM_BLOCKS
218 ARG_UNUSED(r);
219 ARG_UNUSED(min_sz);
220 ARG_UNUSED(max_sz);
221 ARG_UNUSED(buf);
222 ARG_UNUSED(buf_len);
223 return -ENOTSUP;
224#else
225 const uint32_t block_size = rtio_mempool_block_size(r);
226 uint32_t bytes = max_sz;
227
228 /* Not every context has a block pool and the block size may return 0 in
229 * that case
230 */
231 if (block_size == 0) {
232 return -ENOMEM;
233 }
234
235 do {
236 size_t num_blks = DIV_ROUND_UP(bytes, block_size);
237 int rc = sys_mem_blocks_alloc_contiguous(r->block_pool, num_blks, (void **)buf);
238
239 if (rc == 0) {
240 *buf_len = num_blks * block_size;
241 return 0;
242 }
243
244 if (bytes <= block_size) {
245 break;
246 }
247
248 bytes -= block_size;
249 } while (bytes >= min_sz);
250
251 return -ENOMEM;
252#endif
253}
254
255static inline void rtio_block_pool_free(struct rtio *r, void *buf, uint32_t buf_len)
256{
257#ifndef CONFIG_RTIO_SYS_MEM_BLOCKS
258 ARG_UNUSED(r);
259 ARG_UNUSED(buf);
260 ARG_UNUSED(buf_len);
261#else
262 size_t num_blks = buf_len >> r->block_pool->info.blk_sz_shift;
263
264 sys_mem_blocks_free_contiguous(r->block_pool, buf, num_blks);
265#endif
266}
267
269
270
272extern struct k_mem_partition rtio_partition;
273
274
275/* Do not try and reformat the macros */
276
286#if CONFIG_RTIO_BLOCK_POOL_PLACEMENT_DTCM
287#define RTIO_BMEM Z_GENERIC_SECTION(".dtcm_bss") static
288#elif defined(CONFIG_RTIO_BLOCK_POOL_PLACEMENT_NOCACHE)
289#define RTIO_BMEM __nocache static
290#else
291#define RTIO_BMEM COND_CODE_1(CONFIG_USERSPACE, (K_APP_BMEM(rtio_partition) static), (static))
292#endif
293
303#if CONFIG_RTIO_BLOCK_POOL_PLACEMENT_DTCM
304#define RTIO_DMEM Z_GENERIC_SECTION(".dtcm_data") static
305#elif defined(CONFIG_RTIO_BLOCK_POOL_PLACEMENT_NOCACHE)
306#define RTIO_DMEM __nocache_load static
307#else
308#define RTIO_DMEM COND_CODE_1(CONFIG_USERSPACE, (K_APP_DMEM(rtio_partition) static), (static))
309#endif
310
311/* clang-format off */
312/* @cond ignore */
313#define Z_RTIO_BLOCK_POOL_DEFINE(name, blk_sz, blk_cnt, blk_align) \
314 RTIO_BMEM uint8_t __aligned(WB_UP(blk_align)) \
315 CONCAT(_block_pool_, name)[(blk_cnt) * WB_UP(blk_sz)]; \
316 _SYS_MEM_BLOCKS_DEFINE_WITH_EXT_BUF(name, WB_UP(blk_sz), (blk_cnt), \
317 CONCAT(_block_pool_, name), RTIO_DMEM)
318
319/* @endcond */
320
321
322/* clang-format on */
323
334#define RTIO_DEFINE_WITH_MEMPOOL(name, sq_sz, cq_sz, num_blks, blk_size, balign) \
335 Z_RTIO_SQE_POOL_DEFINE(name##_sqe_pool, sq_sz); \
336 Z_RTIO_CQE_POOL_DEFINE(name##_cqe_pool, cq_sz); \
337 Z_RTIO_BLOCK_POOL_DEFINE(name##_block_pool, blk_size, num_blks, balign); \
338 Z_RTIO_DEFINE(name, &name##_sqe_pool, &name##_cqe_pool, &name##_block_pool)
339
340/* clang-format on */
341
349static inline uint32_t rtio_sqe_acquirable(struct rtio *r)
350{
351 return r->sqe_pool->pool_free;
352}
353
362static inline struct rtio_sqe *rtio_sqe_acquire(struct rtio *r)
363{
364 SYS_PORT_TRACING_FUNC_ENTER(rtio, sqe_acquire, r);
365 struct rtio_iodev_sqe *iodev_sqe = rtio_sqe_pool_alloc(r->sqe_pool);
366
367 if (iodev_sqe == NULL) {
368 SYS_PORT_TRACING_FUNC_EXIT(rtio, sqe_acquire, r, NULL);
369 return NULL;
370 }
371
372 mpsc_push(&r->sq, &iodev_sqe->q);
373
374 SYS_PORT_TRACING_FUNC_EXIT(rtio, sqe_acquire, r, &iodev_sqe->sqe);
375 return &iodev_sqe->sqe;
376}
377
390static inline int rtio_sqe_acquire_array(struct rtio *r, size_t n, struct rtio_sqe **sqes)
391{
392 struct rtio_iodev_sqe *iodev_sqe;
393 size_t i;
394
395 for (i = 0; i < n; i++) {
396 iodev_sqe = rtio_sqe_pool_alloc(r->sqe_pool);
397 if (iodev_sqe == NULL) {
398 break;
399 }
400 sqes[i] = &iodev_sqe->sqe;
401 }
402
403 /* Not enough SQEs in the pool */
404 if (i < n) {
405 while (i > 0) {
406 i--;
407 iodev_sqe = CONTAINER_OF(sqes[i], struct rtio_iodev_sqe, sqe);
408 rtio_sqe_pool_free(r->sqe_pool, iodev_sqe);
409 sqes[i] = NULL;
410 }
411
412 return -ENOMEM;
413 }
414
415 for (i = 0; i < n; i++) {
416 iodev_sqe = CONTAINER_OF(sqes[i], struct rtio_iodev_sqe, sqe);
417 mpsc_push(&r->sq, &iodev_sqe->q);
418 }
419
420 return 0;
421}
422
428static inline void rtio_sqe_drop_all(struct rtio *r)
429{
430 struct rtio_iodev_sqe *iodev_sqe;
431 struct mpsc_node *node = mpsc_pop(&r->sq);
432
433 while (node != NULL) {
434 iodev_sqe = CONTAINER_OF(node, struct rtio_iodev_sqe, q);
435 rtio_sqe_pool_free(r->sqe_pool, iodev_sqe);
436 node = mpsc_pop(&r->sq);
437 }
438}
439
443static inline struct rtio_cqe *rtio_cqe_acquire(struct rtio *r)
444{
445 SYS_PORT_TRACING_FUNC_ENTER(rtio, cqe_acquire, r);
446 struct rtio_cqe *cqe = rtio_cqe_pool_alloc(r->cqe_pool);
447
448 if (cqe == NULL) {
449 SYS_PORT_TRACING_FUNC_EXIT(rtio, cqe_acquire, r, NULL);
450 return NULL;
451 }
452
453 memset(cqe, 0, sizeof(struct rtio_cqe));
454
455 SYS_PORT_TRACING_FUNC_EXIT(rtio, cqe_acquire, r, cqe);
456 return cqe;
457}
458
475static inline int rtio_set_cqe_callback(struct rtio *r,
476 rtio_cqe_callback_t callback,
477 void *user_data)
478{
479#ifdef CONFIG_RTIO_CQE_CALLBACK
480 r->cqe_cb = callback;
481 r->cqe_cb_user_data = user_data;
482
483 return 0;
484#else
485 ARG_UNUSED(r);
486 ARG_UNUSED(callback);
487 ARG_UNUSED(user_data);
488
489 return -ENOTSUP;
490#endif
491}
492
496static inline void rtio_cqe_produce(struct rtio *r, struct rtio_cqe *cqe)
497{
498 mpsc_push(&r->cq, &cqe->q);
499}
500
512static inline struct rtio_cqe *rtio_cqe_consume(struct rtio *r)
513{
514 SYS_PORT_TRACING_FUNC_ENTER(rtio, cqe_consume, r);
515 struct mpsc_node *node;
516 struct rtio_cqe *cqe = NULL;
517
518#ifdef CONFIG_RTIO_CONSUME_SEM
519 if (k_sem_take(r->consume_sem, K_NO_WAIT) != 0) {
520 SYS_PORT_TRACING_FUNC_EXIT(rtio, cqe_consume, r, NULL);
521 return NULL;
522 }
523#endif
524
525 node = mpsc_pop(&r->cq);
526 if (node == NULL) {
527 SYS_PORT_TRACING_FUNC_EXIT(rtio, cqe_consume, r, NULL);
528 return NULL;
529 }
530 cqe = CONTAINER_OF(node, struct rtio_cqe, q);
531
532 SYS_PORT_TRACING_FUNC_EXIT(rtio, cqe_consume, r, cqe);
533 return cqe;
534}
535
546static inline struct rtio_cqe *rtio_cqe_consume_block(struct rtio *r)
547{
548 struct mpsc_node *node;
549 struct rtio_cqe *cqe;
550
551#ifdef CONFIG_RTIO_CONSUME_SEM
552 k_sem_take(r->consume_sem, K_FOREVER);
553#endif
554 node = mpsc_pop(&r->cq);
555 while (node == NULL) {
556 Z_SPIN_DELAY(1);
557 node = mpsc_pop(&r->cq);
558 }
559 cqe = CONTAINER_OF(node, struct rtio_cqe, q);
560
561 return cqe;
562}
563
570static inline void rtio_cqe_release(struct rtio *r, struct rtio_cqe *cqe)
571{
572 SYS_PORT_TRACING_FUNC(rtio, cqe_release, r, cqe);
573 rtio_cqe_pool_free(r->cqe_pool, cqe);
574}
575
584static inline int rtio_flush_completion_queue(struct rtio *r)
585{
586 struct rtio_cqe *cqe;
587 int res = 0;
588
589 do {
590 cqe = rtio_cqe_consume(r);
591 if (cqe != NULL) {
592 if ((cqe->result < 0) && (res == 0)) {
593 res = cqe->result;
594 }
595 rtio_cqe_release(r, cqe);
596 }
597 } while (cqe != NULL);
598
599 return res;
600}
601
613__syscall void rtio_sqe_signal(struct rtio_sqe *sqe);
614
615static inline void z_impl_rtio_sqe_signal(struct rtio_sqe *sqe)
616{
617 struct rtio_iodev_sqe *iodev_sqe = CONTAINER_OF(sqe, struct rtio_iodev_sqe, sqe);
618
619 if (!atomic_cas(&iodev_sqe->rt.await.ok, 0, 1)) {
620 iodev_sqe->rt.await.callback(iodev_sqe, iodev_sqe->rt.await.userdata);
621 }
622}
623
630static inline uint32_t rtio_cqe_compute_flags(struct rtio_iodev_sqe *iodev_sqe)
631{
632 uint32_t flags = 0;
633
634#ifdef CONFIG_RTIO_SYS_MEM_BLOCKS
635 if (iodev_sqe->sqe.op == RTIO_OP_RX && iodev_sqe->sqe.flags & RTIO_SQE_MEMPOOL_BUFFER) {
636 struct rtio *r = iodev_sqe->r;
637 struct sys_mem_blocks *mem_pool = r->block_pool;
638 unsigned int blk_index = 0;
639 unsigned int blk_count = 0;
640
641 if (iodev_sqe->rt.rx_bind.buf) {
642 blk_index = (iodev_sqe->rt.rx_bind.buf - mem_pool->buffer) >>
643 mem_pool->info.blk_sz_shift;
644 blk_count = iodev_sqe->rt.rx_bind.buf_len >> mem_pool->info.blk_sz_shift;
645 }
646 flags = RTIO_CQE_FLAG_PREP_MEMPOOL(blk_index, blk_count);
647 }
648#else
649 ARG_UNUSED(iodev_sqe);
650#endif
651
652 return flags;
653}
654
670__syscall int rtio_cqe_get_mempool_buffer(const struct rtio *r, struct rtio_cqe *cqe,
671 uint8_t **buff, uint32_t *buff_len);
672
673static inline int z_impl_rtio_cqe_get_mempool_buffer(const struct rtio *r, struct rtio_cqe *cqe,
674 uint8_t **buff, uint32_t *buff_len)
675{
676#ifdef CONFIG_RTIO_SYS_MEM_BLOCKS
678 unsigned int blk_idx = RTIO_CQE_FLAG_MEMPOOL_GET_BLK_IDX(cqe->flags);
679 unsigned int blk_count = RTIO_CQE_FLAG_MEMPOOL_GET_BLK_CNT(cqe->flags);
681
682 *buff_len = blk_count * blk_size;
683
684 if (blk_count > 0) {
685 *buff = r->block_pool->buffer + blk_idx * blk_size;
686
687 __ASSERT_NO_MSG(*buff >= r->block_pool->buffer);
688 __ASSERT_NO_MSG(*buff <
689 r->block_pool->buffer + blk_size * r->block_pool->info.num_blocks);
690 } else {
691 *buff = NULL;
692 }
693 return 0;
694 }
695 return -EINVAL;
696#else
697 ARG_UNUSED(r);
698 ARG_UNUSED(cqe);
699 ARG_UNUSED(buff);
700 ARG_UNUSED(buff_len);
701
702 return -ENOTSUP;
703#endif
704}
705
707
708void rtio_executor_submit(struct rtio *r);
709void rtio_executor_ok(struct rtio_iodev_sqe *iodev_sqe, int result);
710void rtio_executor_err(struct rtio_iodev_sqe *iodev_sqe, int result);
711
713
722static inline void rtio_iodev_sqe_ok(struct rtio_iodev_sqe *iodev_sqe, int result)
723{
724 rtio_executor_ok(iodev_sqe, result);
725}
726
735static inline void rtio_iodev_sqe_err(struct rtio_iodev_sqe *iodev_sqe, int result)
736{
737 rtio_executor_err(iodev_sqe, result);
738}
739
751static inline void rtio_cqe_submit(struct rtio *r, int result, void *userdata, uint32_t flags)
752{
753 SYS_PORT_TRACING_FUNC_ENTER(rtio, cqe_submit, r, result, flags);
754 struct rtio_cqe *cqe = rtio_cqe_acquire(r);
755
756 if (cqe == NULL) {
757 atomic_inc(&r->xcqcnt);
758 } else {
759 cqe->result = result;
760 cqe->userdata = userdata;
761 cqe->flags = flags;
762 rtio_cqe_produce(r, cqe);
763#ifdef CONFIG_RTIO_CONSUME_SEM
764 k_sem_give(r->consume_sem);
765#endif
766#ifdef CONFIG_RTIO_CQE_CALLBACK
767 if (r->cqe_cb != NULL) {
768 r->cqe_cb(r, r->cqe_cb_user_data);
769 }
770#endif
771 }
772
773 /* atomic_t isn't guaranteed to wrap correctly as it could be signed, so
774 * we must resort to a cas loop.
775 */
776 atomic_t val, new_val;
777
778 do {
779 val = atomic_get(&r->cq_count);
780 new_val = (atomic_t)((uintptr_t)val + 1);
781 } while (!atomic_cas(&r->cq_count, val, new_val));
782
783#ifdef CONFIG_RTIO_SUBMIT_SEM
784 if (r->submit_count > 0) {
785 r->submit_count--;
786 if (r->submit_count == 0) {
787 k_sem_give(r->submit_sem);
788 }
789 }
790#endif
791 SYS_PORT_TRACING_FUNC_EXIT(rtio, cqe_submit, r);
792}
793
794#define __RTIO_MEMPOOL_GET_NUM_BLKS(num_bytes, blk_size) (((num_bytes) + (blk_size)-1) / (blk_size))
795
808static inline int rtio_sqe_rx_buf(struct rtio_iodev_sqe *iodev_sqe, uint32_t min_buf_len,
809 uint32_t max_buf_len, uint8_t **buf, uint32_t *buf_len)
810{
811 const struct rtio_sqe *sqe = &iodev_sqe->sqe;
812
813#ifdef CONFIG_RTIO_SYS_MEM_BLOCKS
814 if (sqe->op == RTIO_OP_RX && sqe->flags & RTIO_SQE_MEMPOOL_BUFFER) {
815 struct rtio *r = iodev_sqe->r;
816
817 /* The mempool buffer is bound at runtime and kept in the wrapper so
818 * the submission description itself stays immutable.
819 */
820 if (iodev_sqe->rt.rx_bind.buf != NULL) {
821 if (iodev_sqe->rt.rx_bind.buf_len < min_buf_len) {
822 return -ENOMEM;
823 }
824 *buf = iodev_sqe->rt.rx_bind.buf;
825 *buf_len = iodev_sqe->rt.rx_bind.buf_len;
826 return 0;
827 }
828
829 int rc = rtio_block_pool_alloc(r, min_buf_len, max_buf_len, buf, buf_len);
830
831 if (rc == 0) {
832 iodev_sqe->rt.rx_bind.buf = *buf;
833 iodev_sqe->rt.rx_bind.buf_len = *buf_len;
834 return 0;
835 }
836
837 return -ENOMEM;
838 }
839#else
840 ARG_UNUSED(max_buf_len);
841#endif
842
843 if (sqe->rx.buf_len < min_buf_len) {
844 return -ENOMEM;
845 }
846
847 *buf = sqe->rx.buf;
848 *buf_len = sqe->rx.buf_len;
849 return 0;
850}
851
866__syscall void rtio_release_buffer(struct rtio *r, void *buff, uint32_t buff_len);
867
868static inline void z_impl_rtio_release_buffer(struct rtio *r, void *buff, uint32_t buff_len)
869{
870#ifdef CONFIG_RTIO_SYS_MEM_BLOCKS
871 if (r == NULL || buff == NULL || r->block_pool == NULL || buff_len == 0) {
872 return;
873 }
874
875 rtio_block_pool_free(r, buff, buff_len);
876#else
877 ARG_UNUSED(r);
878 ARG_UNUSED(buff);
879 ARG_UNUSED(buff_len);
880#endif
881}
882
889static inline void rtio_access_grant(struct rtio *r, struct k_thread *t)
890{
892
893#ifdef CONFIG_RTIO_SUBMIT_SEM
894 k_object_access_grant(r->submit_sem, t);
895#endif
896
897#ifdef CONFIG_RTIO_CONSUME_SEM
898 k_object_access_grant(r->consume_sem, t);
899#endif
900
901#ifdef CONFIG_RTIO_OP_DELAY
902 /* Delay submissions are dispatched to the shared timeout iodev, so a thread
903 * allowed to use this context must also be able to reference it.
904 */
905 k_object_access_grant(&rtio_timeout_iodev, t);
906#endif
907}
908
909
916static inline void rtio_access_revoke(struct rtio *r, struct k_thread *t)
917{
919
920#ifdef CONFIG_RTIO_SUBMIT_SEM
921 k_object_access_revoke(r->submit_sem, t);
922#endif
923
924#ifdef CONFIG_RTIO_CONSUME_SEM
925 k_object_access_revoke(r->consume_sem, t);
926#endif
927
928#ifdef CONFIG_RTIO_OP_DELAY
929 k_object_access_revoke(&rtio_timeout_iodev, t);
930#endif
931}
932
945static inline rtio_sqe_handle_t rtio_sqe_handle(const struct rtio *r, const struct rtio_sqe *sqe)
946{
947 const struct rtio_iodev_sqe *iodev_sqe = CONTAINER_OF(sqe, struct rtio_iodev_sqe, sqe);
948 uint32_t blk_index = (uint32_t)(iodev_sqe - r->sqe_pool->pool);
949 uint32_t gen = (uint32_t)(atomic_get(&iodev_sqe->status) & RTIO_SQE_GEN_MASK);
950
951 return (blk_index << 16) | gen;
952}
953
967static inline struct rtio_iodev_sqe *rtio_iodev_sqe_from_handle(struct rtio *r,
968 rtio_sqe_handle_t handle)
969{
970 uint32_t blk_index = handle >> 16;
971 uint32_t gen = handle & RTIO_SQE_GEN_MASK;
972
973 if (blk_index >= r->sqe_pool->pool_size) {
974 return NULL;
975 }
976
977 struct rtio_iodev_sqe *iodev_sqe = &r->sqe_pool->pool[blk_index];
978 atomic_val_t status = atomic_get(&iodev_sqe->status);
979
980 if ((status & RTIO_SQE_ALLOCD) == 0 || (uint32_t)(status & RTIO_SQE_GEN_MASK) != gen) {
981 return NULL;
982 }
983
984 return iodev_sqe;
985}
986
1018__syscall int rtio_sqe_cancel(struct rtio *r, rtio_sqe_handle_t handle);
1019
1020static inline int z_impl_rtio_sqe_cancel(struct rtio *r, rtio_sqe_handle_t handle)
1021{
1022 SYS_PORT_TRACING_FUNC(rtio, sqe_cancel, handle);
1023
1024 uint16_t blk_index = rtio_sqe_handle_index(handle);
1026
1027 if (blk_index >= r->sqe_pool->pool_size) {
1028 return 0;
1029 }
1030
1031 struct rtio_iodev_sqe *iodev_sqe = &r->sqe_pool->pool[blk_index];
1032
1033 /* Validate identity and mark canceled in one atomic step so a concurrent
1034 * completion cannot recycle the slot between the check and the mark: if
1035 * the entry is freed meanwhile the CAS fails and the re-read observes the
1036 * bumped generation, turning the cancel into a no-op.
1037 */
1038 while (true) {
1039 atomic_val_t status = atomic_get(&iodev_sqe->status);
1040
1041 if ((status & RTIO_SQE_ALLOCD) == 0 ||
1042 (uint16_t)(status & RTIO_SQE_GEN_MASK) != gen) {
1043 return 0;
1044 }
1045
1046 if (atomic_cas(&iodev_sqe->status, status,
1048 break;
1049 }
1050 }
1051
1052 /* Give the iodev a chance to abort a submission it is already sitting on,
1053 * which nothing else would wake.
1054 *
1055 * The entry is not owned here, so re-read the status after taking the iodev
1056 * out of it: every free bumps the generation, so an unchanged generation
1057 * proves no completion recycled the slot in between and the iodev really is
1058 * this submission's. The hook is handed the handle rather than the entry,
1059 * because the entry may still be completed before the hook runs; the iodev
1060 * resolves the handle under its own lock.
1061 */
1062 const struct rtio_iodev *iodev = iodev_sqe->sqe.iodev;
1063 atomic_val_t status = atomic_get(&iodev_sqe->status);
1064
1065 if ((status & RTIO_SQE_ALLOCD) == 0 || (uint16_t)(status & RTIO_SQE_GEN_MASK) != gen) {
1066 return 0;
1067 }
1068
1069 if (iodev != NULL && iodev->api->cancel != NULL) {
1070 iodev->api->cancel(iodev, r, handle);
1071 }
1072
1073 return 0;
1074}
1075
1095__syscall int rtio_sqe_copy_in_get_handles(struct rtio *r, const struct rtio_sqe *sqes,
1096 rtio_sqe_handle_t *handles, size_t sqe_count);
1097
1098static inline int z_impl_rtio_sqe_copy_in_get_handles(struct rtio *r, const struct rtio_sqe *sqes,
1099 rtio_sqe_handle_t *handles,
1100 size_t sqe_count)
1101{
1102 struct rtio_sqe *sqe;
1103 uint32_t acquirable = rtio_sqe_acquirable(r);
1104
1105 if (acquirable < sqe_count) {
1106 return -ENOMEM;
1107 }
1108
1109 for (unsigned long i = 0; i < sqe_count; i++) {
1110 sqe = rtio_sqe_acquire(r);
1111 __ASSERT_NO_MSG(sqe != NULL);
1112 if (handles != NULL) {
1113 handles[i] = rtio_sqe_handle(r, sqe);
1114 }
1115 *sqe = sqes[i];
1116 }
1117
1118 return 0;
1119}
1120
1137static inline int rtio_sqe_copy_in(struct rtio *r, const struct rtio_sqe *sqes, size_t sqe_count)
1138{
1139 return rtio_sqe_copy_in_get_handles(r, sqes, NULL, sqe_count);
1140}
1141
1157__syscall int rtio_cqe_copy_out(struct rtio *r,
1158 struct rtio_cqe *cqes,
1159 size_t cqe_count,
1160 k_timeout_t timeout);
1161static inline int z_impl_rtio_cqe_copy_out(struct rtio *r,
1162 struct rtio_cqe *cqes,
1163 size_t cqe_count,
1164 k_timeout_t timeout)
1165{
1166 size_t copied = 0;
1167 struct rtio_cqe *cqe;
1168 k_timepoint_t end = sys_timepoint_calc(timeout);
1169
1170 do {
1173 if (cqe == NULL) {
1174 Z_SPIN_DELAY(25);
1175 continue;
1176 }
1177 cqes[copied++] = *cqe;
1178 rtio_cqe_release(r, cqe);
1179 } while (copied < cqe_count && !sys_timepoint_expired(end));
1180
1181 return copied;
1182}
1183
1199__syscall int rtio_submit(struct rtio *r, uint32_t wait_count);
1200
1201#ifdef CONFIG_RTIO_SUBMIT_SEM
1202static inline int z_impl_rtio_submit(struct rtio *r, uint32_t wait_count)
1203{
1204 SYS_PORT_TRACING_FUNC_ENTER(rtio, submit, r, wait_count);
1205 int res = 0;
1206
1207 if (wait_count > 0) {
1208 __ASSERT(!k_is_in_isr(),
1209 "expected rtio submit with wait count to be called from a thread");
1210
1211 k_sem_reset(r->submit_sem);
1212 r->submit_count = wait_count;
1213 }
1214
1215 rtio_executor_submit(r);
1216
1217 if (wait_count > 0) {
1218 res = k_sem_take(r->submit_sem, K_FOREVER);
1219 __ASSERT(res == 0,
1220 "semaphore was reset or timed out while waiting on completions!");
1221 }
1222
1224 return res;
1225}
1226#else
1227static inline int z_impl_rtio_submit(struct rtio *r, uint32_t wait_count)
1228{
1229
1230 SYS_PORT_TRACING_FUNC_ENTER(rtio, submit, r, wait_count);
1231 int res = 0;
1232 uintptr_t cq_count = (uintptr_t)atomic_get(&r->cq_count);
1233 uintptr_t cq_complete_count = cq_count + wait_count;
1234 bool wraps = cq_complete_count < cq_count;
1235
1236 rtio_executor_submit(r);
1237
1238 if (wraps) {
1239 while ((uintptr_t)atomic_get(&r->cq_count) >= cq_count) {
1240 Z_SPIN_DELAY(10);
1241 k_yield();
1242 }
1243 }
1244
1245 while ((uintptr_t)atomic_get(&r->cq_count) < cq_complete_count) {
1246 Z_SPIN_DELAY(10);
1247 k_yield();
1248 }
1249
1251 return res;
1252}
1253#endif /* CONFIG_RTIO_SUBMIT_SEM */
1254
1261
1263 struct rtio **contexts;
1264
1267};
1268
1277__syscall struct rtio *rtio_pool_acquire(struct rtio_pool *pool);
1278
1279static inline struct rtio *z_impl_rtio_pool_acquire(struct rtio_pool *pool)
1280{
1281 struct rtio *r = NULL;
1282
1283 for (size_t i = 0; i < pool->pool_size; i++) {
1284 if (atomic_test_and_set_bit(pool->used, i) == 0) {
1285 r = pool->contexts[i];
1286 break;
1287 }
1288 }
1289
1290 if (r != NULL) {
1292 }
1293
1294 return r;
1295}
1296
1303__syscall void rtio_pool_release(struct rtio_pool *pool, struct rtio *r);
1304
1305static inline void z_impl_rtio_pool_release(struct rtio_pool *pool, struct rtio *r)
1306{
1307
1308 if (k_is_user_context()) {
1310 }
1311
1312 for (size_t i = 0; i < pool->pool_size; i++) {
1313 if (pool->contexts[i] == r) {
1314 atomic_clear_bit(pool->used, i);
1315 break;
1316 }
1317 }
1318}
1319
1320/* clang-format off */
1321
1323
1324#define Z_RTIO_POOL_NAME_N(n, name) \
1325 name##_##n
1326
1327#define Z_RTIO_POOL_DEFINE_N(n, name, sq_sz, cq_sz) \
1328 RTIO_DEFINE(Z_RTIO_POOL_NAME_N(n, name), sq_sz, cq_sz)
1329
1330#define Z_RTIO_POOL_REF_N(n, name) \
1331 &Z_RTIO_POOL_NAME_N(n, name)
1332
1334
1343#define RTIO_POOL_DEFINE(name, pool_sz, sq_sz, cq_sz) \
1344 LISTIFY(pool_sz, Z_RTIO_POOL_DEFINE_N, (;), name, sq_sz, cq_sz); \
1345 static struct rtio *name##_contexts[] = { \
1346 LISTIFY(pool_sz, Z_RTIO_POOL_REF_N, (,), name) \
1347 }; \
1348 ATOMIC_DEFINE(name##_used, pool_sz); \
1349 STRUCT_SECTION_ITERABLE(rtio_pool, name) = { \
1350 .pool_size = pool_sz, \
1351 .contexts = name##_contexts, \
1352 .used = name##_used, \
1353 }
1354
1355/* clang-format on */
1356
1360
1361#ifdef __cplusplus
1362}
1363#endif
1364
1365#include <zephyr/syscalls/rtio.h>
1366
1367#endif /* ZEPHYR_INCLUDE_RTIO_RTIO_H_ */
workaround assembler barfing for ST r
Definition asm-macro-32-bit-gnu.h:27
RTIO Completion Queue Events and Related Functions.
APIs and macros for the Zephyr device model.
long atomic_t
Atomic integer variable.
Definition atomic_types.h:34
static void atomic_clear_bit(atomic_t *target, int bit)
Atomically clear a bit.
Definition atomic.h:227
atomic_t atomic_val_t
Value type for atomic integer variables.
Definition atomic_types.h:41
atomic_val_t atomic_get(const atomic_t *target)
Atomic get.
static bool atomic_test_and_set_bit(atomic_t *target, int bit)
Atomically set a bit and test it.
Definition atomic.h:181
atomic_val_t atomic_inc(atomic_t *target)
Atomic increment.
bool atomic_cas(atomic_t *target, atomic_val_t old_value, atomic_val_t new_value)
Atomic compare-and-set.
#define K_FOREVER
Generate infinite timeout delay.
Definition kernel.h:1712
#define K_NO_WAIT
Generate null timeout delay.
Definition kernel.h:1602
k_timepoint_t sys_timepoint_calc(k_timeout_t timeout)
Calculate a timepoint value.
static bool sys_timepoint_expired(k_timepoint_t timepoint)
Indicates if timepoint is expired.
Definition clock.h:386
#define K_TIMEOUT_EQ(a, b)
Compare timeouts for equality.
Definition clock.h:80
bool k_is_in_isr(void)
Determine if code is running at interrupt level.
int sys_mem_blocks_free_contiguous(sys_mem_blocks_t *mem_block, void *block, size_t count)
Free contiguous multiple memory blocks.
int sys_mem_blocks_alloc_contiguous(sys_mem_blocks_t *mem_block, size_t count, void **out_block)
Allocate a contiguous set of memory blocks.
static ALWAYS_INLINE void mpsc_push(struct mpsc *q, struct mpsc_node *n)
Push a node.
Definition mpsc_lockfree.h:126
static struct mpsc_node * mpsc_pop(struct mpsc *q)
Pop a node off of the list.
Definition mpsc_lockfree.h:145
#define RTIO_CQE_FLAG_MEMPOOL_GET_BLK_CNT(flags)
Get the block count of a mempool flags.
Definition cqe.h:70
#define RTIO_CQE_FLAG_MEMPOOL_GET_BLK_IDX(flags)
Get the block index of a mempool flags.
Definition cqe.h:62
#define RTIO_CQE_FLAG_MEMPOOL_BUFFER
The entry's buffer was allocated from the RTIO's mempool.
Definition cqe.h:46
#define RTIO_CQE_FLAG_PREP_MEMPOOL(blk_idx, blk_cnt)
Prepare CQE flags for a mempool read.
Definition cqe.h:79
#define RTIO_CQE_FLAG_GET(flags)
Get the flag bits of a CQE flags value.
Definition cqe.h:54
#define RTIO_OP_RX
An operation that receives (reads).
Definition sqe.h:148
#define RTIO_SQE_MEMPOOL_BUFFER
The buffer should be allocated by the RTIO mempool.
Definition sqe.h:106
void rtio_pool_release(struct rtio_pool *pool, struct rtio *r)
Return an RTIO context to a pool.
static struct rtio_iodev_sqe * rtio_iodev_sqe_from_handle(struct rtio *r, rtio_sqe_handle_t handle)
Resolve a handle to a live submission, validating identity.
Definition rtio.h:967
static uint32_t rtio_sqe_acquirable(struct rtio *r)
Count of acquirable submission queue events.
Definition rtio.h:349
struct rtio * rtio_pool_acquire(struct rtio_pool *pool)
Obtain an RTIO context from a pool.
#define RTIO_SQE_ALLOCD
Set while the entry is allocated from the pool (i.e.
Definition sqe.h:427
static size_t rtio_mempool_block_size(const struct rtio *r)
Get the mempool block size of the RTIO context.
Definition rtio.h:175
static void rtio_cqe_submit(struct rtio *r, int result, void *userdata, uint32_t flags)
Submit a completion queue event with a given result and userdata.
Definition rtio.h:751
static rtio_sqe_handle_t rtio_sqe_handle(const struct rtio *r, const struct rtio_sqe *sqe)
Capture an opaque, validatable handle for a live submission.
Definition rtio.h:945
void rtio_release_buffer(struct rtio *r, void *buff, uint32_t buff_len)
Release memory that was allocated by the RTIO's memory pool.
static int rtio_sqe_copy_in(struct rtio *r, const struct rtio_sqe *sqes, size_t sqe_count)
Copy an array of SQEs into the queue.
Definition rtio.h:1137
void(* rtio_cqe_callback_t)(struct rtio *r, void *user_data)
RTIO completion queue event callback.
Definition rtio.h:70
static int rtio_sqe_rx_buf(struct rtio_iodev_sqe *iodev_sqe, uint32_t min_buf_len, uint32_t max_buf_len, uint8_t **buf, uint32_t *buf_len)
Get the buffer associate with the RX submission.
Definition rtio.h:808
static void rtio_cqe_produce(struct rtio *r, struct rtio_cqe *cqe)
Produce a complete queue event if available.
Definition rtio.h:496
#define RTIO_SQE_GEN_MASK
Generation counter; bumped on free, compared against a handle's generation.
Definition sqe.h:425
static uint32_t rtio_cqe_compute_flags(struct rtio_iodev_sqe *iodev_sqe)
Compute the CQE flags from the rtio_iodev_sqe entry.
Definition rtio.h:630
int rtio_sqe_copy_in_get_handles(struct rtio *r, const struct rtio_sqe *sqes, rtio_sqe_handle_t *handles, size_t sqe_count)
Copy an array of SQEs into the queue and get resulting handles back.
uint32_t rtio_sqe_handle_t
Opaque identity for a submission queue entry.
Definition sqe.h:322
struct k_mem_partition rtio_partition
The memory partition associated with all RTIO context information.
static struct rtio_sqe * rtio_sqe_acquire(struct rtio *r)
Acquire a single submission queue event if available.
Definition rtio.h:362
static uint16_t rtio_sqe_handle_generation(rtio_sqe_handle_t handle)
Generation counter encoded in a handle.
Definition sqe.h:449
static void rtio_sqe_drop_all(struct rtio *r)
Drop all previously acquired sqe.
Definition rtio.h:428
int rtio_cqe_copy_out(struct rtio *r, struct rtio_cqe *cqes, size_t cqe_count, k_timeout_t timeout)
Copy an array of CQEs from the queue.
static int rtio_flush_completion_queue(struct rtio *r)
Flush completion queue.
Definition rtio.h:584
static void rtio_access_revoke(struct rtio *r, struct k_thread *t)
Revoke access to an RTIO context from a user thread.
Definition rtio.h:916
static void rtio_access_grant(struct rtio *r, struct k_thread *t)
Grant access to an RTIO context to a user thread.
Definition rtio.h:889
int rtio_sqe_cancel(struct rtio *r, rtio_sqe_handle_t handle)
Attempt to cancel an SQE.
#define RTIO_SQE_STATUS_CANCELED
Set when cancellation of the submission has been requested.
Definition sqe.h:429
static void rtio_cqe_release(struct rtio *r, struct rtio_cqe *cqe)
Release consumed completion queue event.
Definition rtio.h:570
static uint16_t rtio_sqe_handle_index(rtio_sqe_handle_t handle)
Pool block index encoded in a handle.
Definition sqe.h:438
static int rtio_set_cqe_callback(struct rtio *r, rtio_cqe_callback_t callback, void *user_data)
Set the completion queue event callback.
Definition rtio.h:475
static void rtio_iodev_sqe_err(struct rtio_iodev_sqe *iodev_sqe, int result)
Inform the executor of a submissions completion with error.
Definition rtio.h:735
static void rtio_iodev_sqe_ok(struct rtio_iodev_sqe *iodev_sqe, int result)
Inform the executor of a submission completion with success.
Definition rtio.h:722
static struct rtio_cqe * rtio_cqe_acquire(struct rtio *r)
Acquire a complete queue event if available.
Definition rtio.h:443
static struct rtio_cqe * rtio_cqe_consume(struct rtio *r)
Consume a single completion queue event if available.
Definition rtio.h:512
void rtio_sqe_signal(struct rtio_sqe *sqe)
Signal an AWAIT SQE.
int rtio_cqe_get_mempool_buffer(const struct rtio *r, struct rtio_cqe *cqe, uint8_t **buff, uint32_t *buff_len)
Retrieve the mempool buffer that was allocated for the CQE.
static struct rtio_cqe * rtio_cqe_consume_block(struct rtio *r)
Wait for and consume a single completion queue event.
Definition rtio.h:546
static int rtio_sqe_acquire_array(struct rtio *r, size_t n, struct rtio_sqe **sqes)
Acquire a number of submission queue events if available.
Definition rtio.h:390
int rtio_submit(struct rtio *r, uint32_t wait_count)
Submit I/O requests to the underlying executor.
void k_sem_reset(struct k_sem *sem)
Resets a semaphore's count to zero.
void k_sem_give(struct k_sem *sem)
Give a semaphore.
int k_sem_take(struct k_sem *sem, k_timeout_t timeout)
Take a semaphore.
#define SYS_PORT_TRACING_FUNC_ENTER(type, func,...)
Tracing macro for the entry into a function that might or might not return a value.
Definition tracing_macros.h:246
#define SYS_PORT_TRACING_FUNC_EXIT(type, func,...)
Tracing macro for when a function ends its execution.
Definition tracing_macros.h:272
#define SYS_PORT_TRACING_FUNC(type, func,...)
Tracing macro for function calls which are not directly associated with a specific type of object.
Definition tracing_macros.h:233
#define BIT(n)
Unsigned integer with bit position n set (signed in assembly language).
Definition util_macro.h:44
#define CONTAINER_OF(ptr, type, field)
Get a pointer to a structure containing the element.
Definition util.h:281
#define DIV_ROUND_UP(n, d)
Divide and round up.
Definition util.h:348
#define EINVAL
Invalid argument.
Definition errno.h:61
#define ENOMEM
Not enough core.
Definition errno.h:51
#define ENOTSUP
Unsupported value.
Definition errno.h:115
void k_yield(void)
Yield the current thread.
static __attribute_const__ k_tid_t k_current_get(void)
Get thread ID of the current thread.
Definition kernel.h:859
void k_object_access_grant(const void *object, struct k_thread *thread)
Grant a thread access to a kernel object.
void k_object_access_revoke(const void *object, struct k_thread *thread)
Revoke a thread's access to a kernel object.
#define NULL
Definition iar_missing_defs.h:20
RTIO I/O Device and Related Functions.
Public kernel APIs.
Memory Blocks Allocator.
flags
Definition parser.h:86
RTIO Submission Queue Events and Related Functions.
__UINT32_TYPE__ uint32_t
Definition stdint.h:90
__UINT8_TYPE__ uint8_t
Definition stdint.h:88
#define UINT16_MAX
Definition stdint.h:28
__UINTPTR_TYPE__ uintptr_t
Definition stdint.h:105
__UINT16_TYPE__ uint16_t
Definition stdint.h:89
void * memset(void *buf, int c, size_t n)
Memory Partition.
Definition mem_domain.h:55
Semaphore structure.
Definition kernel.h:3738
Thread Structure.
Definition thread.h:258
Kernel timeout type.
Definition clock.h:65
Kernel timepoint type.
Definition clock.h:289
Queue member.
Definition mpsc_lockfree.h:79
MPSC Queue.
Definition mpsc_lockfree.h:86
A completion queue event.
Definition cqe.h:90
void * userdata
Associated userdata with operation.
Definition cqe.h:96
uint32_t flags
Flags associated with the operation.
Definition cqe.h:97
int32_t result
Result from operation.
Definition cqe.h:95
void(* cancel)(const struct rtio_iodev *iodev, struct rtio *r, rtio_sqe_handle_t handle)
Attempt to actively cancel a previously submitted entry.
Definition iodev.h:77
IO device submission queue entry.
Definition sqe.h:459
struct rtio_iodev_sqe::@330064006263143366064036221227125351044336131221::@020376107202163366036113216314102104241220072312 await
OP_AWAIT signaling state.
struct rtio_iodev_sqe::@330064006263143366064036221227125351044336131221::@135022137027372164350061046374202042306257337314 rx_bind
OP_RX buffer bound at runtime (see RTIO_SQE_MEMPOOL_BUFFER).
struct rtio_sqe sqe
The submission queue entry this wraps.
Definition sqe.h:461
uint8_t * buf
Buffer allocated for the read.
Definition sqe.h:481
struct rtio * r
RTIO context that owns this entry.
Definition sqe.h:467
atomic_t ok
Set once the awaited signal arrives.
Definition sqe.h:487
void * userdata
Opaque pointer passed to the callback.
Definition sqe.h:489
uint32_t buf_len
Length of the allocated buffer.
Definition sqe.h:482
atomic_t status
Identity + lifetime word (generation | ALLOCD), see RTIO_SQE_* bits above.
Definition sqe.h:470
struct mpsc_node q
Node used to link the entry into the pool free list and iodev queues.
Definition sqe.h:463
union rtio_iodev_sqe::@330064006263143366064036221227125351044336131221 rt
Runtime scratch state that the subsystem/driver mutates while it owns the submission.
rtio_signaled_t callback
Invoked when the entry is signaled.
Definition sqe.h:488
An IO device with a function table for submitting requests.
Definition iodev.h:83
const struct rtio_iodev_api * api
Function pointer table.
Definition iodev.h:85
Pool of RTIO contexts to use with dynamically created threads.
Definition rtio.h:1258
struct rtio ** contexts
Array containing contexts of the pool.
Definition rtio.h:1263
atomic_t * used
Atomic bitmap to signal a member is used/unused.
Definition rtio.h:1266
size_t pool_size
Size of the pool.
Definition rtio.h:1260
A submission queue event.
Definition sqe.h:337
uint8_t op
Op code.
Definition sqe.h:338
uint32_t buf_len
Length of buffer.
Definition sqe.h:362
const struct rtio_iodev * iodev
Device to operation on.
Definition sqe.h:346
struct rtio_sqe::@342363352172076106335370162240320153276337137375::@110162343014114265152332336213215220201374200140 rx
OP_RX.
uint16_t flags
Op Flags.
Definition sqe.h:342
const uint8_t * buf
Buffer to write from.
Definition sqe.h:363
An RTIO context containing what can be viewed as a pair of queues.
Definition rtio.h:83
struct rtio_cqe_pool * cqe_pool
Completion queue object pool with free list.
Definition rtio.h:111
struct mpsc sq
Submission queue.
Definition rtio.h:119
atomic_t cq_count
Total number of completions.
Definition rtio.h:102
struct rtio_sqe_pool * sqe_pool
Submission queue object pool with free list.
Definition rtio.h:108
atomic_t xcqcnt
Number of completions dropped because no CQE was available.
Definition rtio.h:105
struct mpsc cq
Completion queue.
Definition rtio.h:122
Header file for the Atomic operations API.
Iterable sections helpers.
Misc utilities.
static bool k_is_user_context(void)
Indicate whether the CPU is currently in user mode.
Definition syscall.h:120