|
| 1 | +/* |
| 2 | + * Copyright (c) 2025 Croxel Inc. |
| 3 | + * |
| 4 | + * SPDX-License-Identifier: Apache-2.0 |
| 5 | + */ |
| 6 | + |
| 7 | +#include <zephyr/kernel.h> |
| 8 | +#include <zephyr/rtio/rtio.h> |
| 9 | +#include <zephyr/spinlock.h> |
| 10 | +#include "rtio_sched.h" |
| 11 | + |
| 12 | +static struct k_spinlock rio_sched_lock; |
| 13 | +static sys_slist_t rtio_sched_list = SYS_SLIST_STATIC_INIT(&rtio_sched_list); |
| 14 | + |
| 15 | +static inline void add_alarm_to_list(struct rtio_sqe *sqe) |
| 16 | +{ |
| 17 | + struct rtio_sqe *curr_sqe, *prev_sqe = NULL; |
| 18 | + |
| 19 | + /** We assume we have a sorted list: earlier alarms go first */ |
| 20 | + SYS_SLIST_FOR_EACH_CONTAINER(&rtio_sched_list, curr_sqe, delay.node) { |
| 21 | + if (sys_timepoint_cmp(sqe->delay.deadline, curr_sqe->delay.deadline) <= 0) { |
| 22 | + sys_slist_insert(&rtio_sched_list, |
| 23 | + (prev_sqe ? &prev_sqe->delay.node : NULL), |
| 24 | + &sqe->delay.node); |
| 25 | + return; |
| 26 | + } |
| 27 | + prev_sqe = curr_sqe; |
| 28 | + } |
| 29 | + |
| 30 | + sys_slist_append(&rtio_sched_list, &sqe->delay.node); |
| 31 | +} |
| 32 | + |
| 33 | +static inline void remove_alarm_from_list(struct rtio_sqe *sqe) |
| 34 | +{ |
| 35 | + sys_slist_find_and_remove(&rtio_sched_list, &sqe->delay.node); |
| 36 | +} |
| 37 | + |
| 38 | +static inline struct rtio_sqe *get_next_alarm_from_list(void) |
| 39 | +{ |
| 40 | + sys_snode_t *node = sys_slist_peek_head(&rtio_sched_list); |
| 41 | + |
| 42 | + if (node == NULL) { |
| 43 | + return NULL; |
| 44 | + } |
| 45 | + |
| 46 | + struct rtio_sqe *sqe = CONTAINER_OF(node, struct rtio_sqe, delay.node); |
| 47 | + |
| 48 | + return sqe; |
| 49 | +} |
| 50 | + |
| 51 | +static void rtio_sched_alarm_expired(struct k_timer *timer) |
| 52 | +{ |
| 53 | + struct rtio_iodev_sqe *iodev_sqe; |
| 54 | + |
| 55 | + K_SPINLOCK(&rio_sched_lock) { |
| 56 | + struct rtio_sqe *sqe = get_next_alarm_from_list(); |
| 57 | + |
| 58 | + iodev_sqe = CONTAINER_OF(sqe, struct rtio_iodev_sqe, sqe); |
| 59 | + |
| 60 | + remove_alarm_from_list(sqe); |
| 61 | + |
| 62 | + sqe = get_next_alarm_from_list(); |
| 63 | + if (sqe != NULL) { |
| 64 | + k_timer_start(timer, |
| 65 | + sys_timepoint_timeout(sqe->delay.deadline), |
| 66 | + K_NO_WAIT); |
| 67 | + } |
| 68 | + } |
| 69 | + |
| 70 | + rtio_iodev_sqe_ok(iodev_sqe, 0); |
| 71 | +} |
| 72 | + |
| 73 | +static K_TIMER_DEFINE(rtio_delay_timer, rtio_sched_alarm_expired, NULL); |
| 74 | + |
| 75 | +void rtio_sched_alarm(struct rtio_iodev_sqe *iodev_sqe, k_timeout_t timeout) |
| 76 | +{ |
| 77 | + struct rtio_sqe *sqe = &iodev_sqe->sqe; |
| 78 | + k_timepoint_t *sqe_deadline = &sqe->delay.deadline; |
| 79 | + |
| 80 | + *sqe_deadline = sys_timepoint_calc(timeout); |
| 81 | + |
| 82 | + K_SPINLOCK(&rio_sched_lock) { |
| 83 | + struct rtio_sqe *next_sqe; |
| 84 | + |
| 85 | + add_alarm_to_list(sqe); |
| 86 | + |
| 87 | + next_sqe = get_next_alarm_from_list(); |
| 88 | + |
| 89 | + /** We assume we have an alarm to schedule, since we just added a new one */ |
| 90 | + k_timer_start(&rtio_delay_timer, |
| 91 | + sys_timepoint_timeout(next_sqe->delay.deadline), |
| 92 | + K_NO_WAIT); |
| 93 | + } |
| 94 | +} |
0 commit comments