timerqueue.c 3.1 KB
Newer Older
1
/*
2
 *  Generic Timer-queue
3
 *
4
 *  Manages a simple queue of timers, ordered by expiration time.
5 6 7
 *  Uses rbtrees for quick list adds and expiration.
 *
 *  NOTE: All of the following functions need to be serialized
8
 *  to avoid races. No locking is done by this library code.
9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

25
#include <linux/bug.h>
26
#include <linux/timerqueue.h>
27
#include <linux/rbtree.h>
28
#include <linux/export.h>
29 30

/**
31
 * timerqueue_add - Adds timer to timerqueue.
32
 *
33
 * @head: head of timerqueue
34 35
 * @node: timer node to be added
 *
36
 * Adds the timer node to the timerqueue, sorted by the
37 38
 * node's expires value.
 */
39
void timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node)
40 41 42
{
	struct rb_node **p = &head->head.rb_node;
	struct rb_node *parent = NULL;
43
	struct timerqueue_node  *ptr;
44 45 46 47 48 49

	/* Make sure we don't add nodes that are already added */
	WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node));

	while (*p) {
		parent = *p;
50
		ptr = rb_entry(parent, struct timerqueue_node, node);
51 52 53 54 55 56 57 58 59 60 61
		if (node->expires.tv64 < ptr->expires.tv64)
			p = &(*p)->rb_left;
		else
			p = &(*p)->rb_right;
	}
	rb_link_node(&node->node, parent, p);
	rb_insert_color(&node->node, &head->head);

	if (!head->next || node->expires.tv64 < head->next->expires.tv64)
		head->next = node;
}
62
EXPORT_SYMBOL_GPL(timerqueue_add);
63 64

/**
65
 * timerqueue_del - Removes a timer from the timerqueue.
66
 *
67
 * @head: head of timerqueue
68 69
 * @node: timer node to be removed
 *
70
 * Removes the timer node from the timerqueue.
71
 */
72
void timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node)
73 74 75 76 77 78 79 80
{
	WARN_ON_ONCE(RB_EMPTY_NODE(&node->node));

	/* update next pointer */
	if (head->next == node) {
		struct rb_node *rbn = rb_next(&node->node);

		head->next = rbn ?
81
			rb_entry(rbn, struct timerqueue_node, node) : NULL;
82 83 84 85
	}
	rb_erase(&node->node, &head->head);
	RB_CLEAR_NODE(&node->node);
}
86
EXPORT_SYMBOL_GPL(timerqueue_del);
87 88

/**
89
 * timerqueue_iterate_next - Returns the timer after the provided timer
90 91 92 93 94 95 96
 *
 * @node: Pointer to a timer.
 *
 * Provides the timer that is after the given node. This is used, when
 * necessary, to iterate through the list of timers in a timer list
 * without modifying the list.
 */
97
struct timerqueue_node *timerqueue_iterate_next(struct timerqueue_node *node)
98 99 100 101 102 103 104 105
{
	struct rb_node *next;

	if (!node)
		return NULL;
	next = rb_next(&node->node);
	if (!next)
		return NULL;
106
	return container_of(next, struct timerqueue_node, node);
107
}
108
EXPORT_SYMBOL_GPL(timerqueue_iterate_next);