]>
Commit | Line | Data |
---|---|---|
1a59d1b8 | 1 | // SPDX-License-Identifier: GPL-2.0-or-later |
87de5ac7 | 2 | /* |
1f5a2479 | 3 | * Generic Timer-queue |
87de5ac7 | 4 | * |
1f5a2479 | 5 | * Manages a simple queue of timers, ordered by expiration time. |
87de5ac7 JS |
6 | * Uses rbtrees for quick list adds and expiration. |
7 | * | |
8 | * NOTE: All of the following functions need to be serialized | |
25985edc | 9 | * to avoid races. No locking is done by this library code. |
87de5ac7 JS |
10 | */ |
11 | ||
50af5ead | 12 | #include <linux/bug.h> |
1f5a2479 | 13 | #include <linux/timerqueue.h> |
87de5ac7 | 14 | #include <linux/rbtree.h> |
8bc3bcc9 | 15 | #include <linux/export.h> |
87de5ac7 | 16 | |
798172b1 PZ |
17 | #define __node_2_tq(_n) \ |
18 | rb_entry((_n), struct timerqueue_node, node) | |
19 | ||
20 | static inline bool __timerqueue_less(struct rb_node *a, const struct rb_node *b) | |
21 | { | |
22 | return __node_2_tq(a)->expires < __node_2_tq(b)->expires; | |
23 | } | |
24 | ||
87de5ac7 | 25 | /** |
1f5a2479 | 26 | * timerqueue_add - Adds timer to timerqueue. |
87de5ac7 | 27 | * |
1f5a2479 | 28 | * @head: head of timerqueue |
87de5ac7 JS |
29 | * @node: timer node to be added |
30 | * | |
9f4533cd TG |
31 | * Adds the timer node to the timerqueue, sorted by the node's expires |
32 | * value. Returns true if the newly added timer is the first expiring timer in | |
33 | * the queue. | |
87de5ac7 | 34 | */ |
c320642e | 35 | bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) |
87de5ac7 | 36 | { |
87de5ac7 JS |
37 | /* Make sure we don't add nodes that are already added */ |
38 | WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node)); | |
39 | ||
798172b1 | 40 | return rb_add_cached(&node->node, &head->rb_root, __timerqueue_less); |
87de5ac7 | 41 | } |
9bb99b14 | 42 | EXPORT_SYMBOL_GPL(timerqueue_add); |
87de5ac7 JS |
43 | |
44 | /** | |
1f5a2479 | 45 | * timerqueue_del - Removes a timer from the timerqueue. |
87de5ac7 | 46 | * |
1f5a2479 | 47 | * @head: head of timerqueue |
87de5ac7 JS |
48 | * @node: timer node to be removed |
49 | * | |
9f4533cd TG |
50 | * Removes the timer node from the timerqueue. Returns true if the queue is |
51 | * not empty after the remove. | |
87de5ac7 | 52 | */ |
c320642e | 53 | bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) |
87de5ac7 JS |
54 | { |
55 | WARN_ON_ONCE(RB_EMPTY_NODE(&node->node)); | |
56 | ||
511885d7 | 57 | rb_erase_cached(&node->node, &head->rb_root); |
87de5ac7 | 58 | RB_CLEAR_NODE(&node->node); |
511885d7 DB |
59 | |
60 | return !RB_EMPTY_ROOT(&head->rb_root.rb_root); | |
87de5ac7 | 61 | } |
9bb99b14 | 62 | EXPORT_SYMBOL_GPL(timerqueue_del); |
87de5ac7 | 63 | |
87de5ac7 | 64 | /** |
1f5a2479 | 65 | * timerqueue_iterate_next - Returns the timer after the provided timer |
87de5ac7 JS |
66 | * |
67 | * @node: Pointer to a timer. | |
68 | * | |
69 | * Provides the timer that is after the given node. This is used, when | |
70 | * necessary, to iterate through the list of timers in a timer list | |
71 | * without modifying the list. | |
72 | */ | |
1f5a2479 | 73 | struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node) |
87de5ac7 JS |
74 | { |
75 | struct rb_node *next; | |
76 | ||
77 | if (!node) | |
78 | return NULL; | |
79 | next = rb_next(&node->node); | |
80 | if (!next) | |
81 | return NULL; | |
1f5a2479 | 82 | return container_of(next, struct timerqueue_node, node); |
87de5ac7 | 83 | } |
9bb99b14 | 84 | EXPORT_SYMBOL_GPL(timerqueue_iterate_next); |