3 Copyright (C) 2002-2009 Guus Sliepen <guus@tinc-vpn.org>,
4 2002-2005 Ivo Timmermans
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License along
17 with this program; if not, write to the Free Software Foundation, Inc.,
18 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
28 avl_tree_t *event_tree;
33 static int event_compare(const event_t *a, const event_t *b) {
43 void init_events(void) {
46 event_tree = avl_alloc_tree((avl_compare_t) event_compare, (avl_action_t) free_event);
49 void exit_events(void) {
52 avl_delete_tree(event_tree);
55 void expire_events(void) {
61 * Make all events appear expired by substracting the difference between
62 * the expiration time of the last event and the current time.
70 event = event_tree->tail->data;
74 diff = 1 + event->time - now;
76 for(node = event_tree->head; node; node = node->next) {
82 event_t *new_event(void) {
85 return xmalloc_and_zero(sizeof(event_t));
88 void free_event(event_t *event) {
94 void event_add(event_t *event) {
98 avl_insert(event_tree, event);
101 void event_del(event_t *event) {
104 avl_delete(event_tree, event);
107 event_t *get_expired_event(void) {
112 if(event_tree->head) {
113 event = event_tree->head->data;
115 if(event->time < now) {
116 avl_node_t *node = event_tree->head;
117 avl_unlink_node(event_tree, node);