27 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node)  in timerqueue_add()  argument
35 	WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node));  in timerqueue_add()
39 		ptr = rb_entry(parent, struct timerqueue_node, node);  in timerqueue_add()
40 		if (node->expires < ptr->expires) {  in timerqueue_add()
47 	rb_link_node(&node->node, parent, p);  in timerqueue_add()
48 	rb_insert_color_cached(&node->node, &head->rb_root, leftmost);  in timerqueue_add()
63 bool timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node)  in timerqueue_del()  argument
65 	WARN_ON_ONCE(RB_EMPTY_NODE(&node->node));  in timerqueue_del()
67 	rb_erase_cached(&node->node, &head->rb_root);  in timerqueue_del()
68 	RB_CLEAR_NODE(&node->node);  in timerqueue_del()
83 struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node)  in timerqueue_iterate_next()  argument
87 	if (!node)  in timerqueue_iterate_next()
89 	next = rb_next(&node->node);  in timerqueue_iterate_next()
92 	return container_of(next, struct timerqueue_node, node);  in timerqueue_iterate_next()