1 /* SPDX-License-Identifier: GPL-2.0 */
2 #ifndef _LINUX_TIMERQUEUE_H
3 #define _LINUX_TIMERQUEUE_H
5 #include <linux/rbtree.h>
6 #include <linux/ktime.h>
9 struct timerqueue_node {
14 struct timerqueue_head {
15 struct rb_root_cached rb_root;
19 extern bool timerqueue_add(struct timerqueue_head *head,
20 struct timerqueue_node *node);
21 extern bool timerqueue_del(struct timerqueue_head *head,
22 struct timerqueue_node *node);
23 extern struct timerqueue_node *timerqueue_iterate_next(
24 struct timerqueue_node *node);
27 * timerqueue_getnext - Returns the timer with the earliest expiration time
29 * @head: head of timerqueue
31 * Returns a pointer to the timer node that has the earliest expiration time.
34 struct timerqueue_node *timerqueue_getnext(struct timerqueue_head *head)
36 struct rb_node *leftmost = rb_first_cached(&head->rb_root);
38 return rb_entry(leftmost, struct timerqueue_node, node);
41 static inline void timerqueue_init(struct timerqueue_node *node)
43 RB_CLEAR_NODE(&node->node);
46 static inline bool timerqueue_node_queued(struct timerqueue_node *node)
48 return !RB_EMPTY_NODE(&node->node);
51 static inline bool timerqueue_node_expires(struct timerqueue_node *node)
56 static inline void timerqueue_init_head(struct timerqueue_head *head)
58 head->rb_root = RB_ROOT_CACHED;
60 #endif /* _LINUX_TIMERQUEUE_H */