X-Git-Url: https://www.tinc-vpn.org/git/browse?a=blobdiff_plain;f=src%2Fevent.c;h=03efc675b20f7a480a70167abbfd0e99f514808c;hb=15a110013b50c53e4d943b9251ed94d0cbdfea85;hp=2396d4789ee964b379db30ef56e917c25e267d86;hpb=013a2e159e42c46808ea8d0b6abd57525db30a50;p=tinc diff --git a/src/event.c b/src/event.c index 2396d478..03efc675 100644 --- a/src/event.c +++ b/src/event.c @@ -1,7 +1,7 @@ /* event.c -- event queue - Copyright (C) 2002-2003 Guus Sliepen , - 2002-2003 Ivo Timmermans + Copyright (C) 2002-2009 Guus Sliepen , + 2002-2005 Ivo Timmermans 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 @@ -13,27 +13,23 @@ 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., 675 Mass Ave, Cambridge, MA 02139, USA. - - $Id: event.c,v 1.4 2003/08/24 20:38:24 guus Exp $ + 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., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. */ #include "system.h" -#include "avl_tree.h" +#include "splay_tree.h" #include "event.h" #include "utils.h" #include "xalloc.h" -avl_tree_t *event_tree; -extern time_t now; +splay_tree_t *event_tree; int id; -static int event_compare(const event_t *a, const event_t *b) -{ +static int event_compare(const event_t *a, const event_t *b) { if(a->time > b->time) return 1; @@ -43,60 +39,68 @@ static int event_compare(const event_t *a, const event_t *b) return a->id - b->id; } -void init_events(void) -{ - cp(); +void init_events(void) { + event_tree = splay_alloc_tree((splay_compare_t) event_compare, NULL); +} - event_tree = avl_alloc_tree((avl_compare_t) event_compare, NULL); +void exit_events(void) { + splay_delete_tree(event_tree); } -void exit_events(void) -{ - cp(); +void expire_events(void) { + splay_node_t *node; + event_t *event; + time_t diff; + + /* + * Make all events appear expired by substracting the difference between + * the expiration time of the last event and the current time. + */ - avl_delete_tree(event_tree); -} + if(!event_tree->tail) + return; + + event = event_tree->tail->data; + time_t now = time(NULL); -event_t *new_event(void) -{ - cp(); + if(event->time < now) + return; - return (event_t *) xmalloc_and_zero(sizeof(event_t)); + diff = 1 + event->time - now; + + for(node = event_tree->head; node; node = node->next) { + event = node->data; + event->time -= diff; + } } -void free_event(event_t *event) -{ - cp(); +event_t *new_event(void) { + return xmalloc_and_zero(sizeof(event_t)); +} +void free_event(event_t *event) { free(event); } -void event_add(event_t *event) -{ - cp(); - +void event_add(event_t *event) { event->id = ++id; - avl_insert(event_tree, event); + splay_insert(event_tree, event); } -void event_del(event_t *event) -{ - cp(); - - avl_delete(event_tree, event); +void event_del(event_t *event) { + splay_delete(event_tree, event); } -event_t *get_expired_event(void) -{ +event_t *get_expired_event(void) { event_t *event; - cp(); - if(event_tree->head) { - event = (event_t *) event_tree->head->data; + event = event_tree->head->data; - if(event->time < now) { - avl_delete(event_tree, event); + if(event->time < time(NULL)) { + splay_node_t *node = event_tree->head; + splay_unlink_node(event_tree, node); + free(node); return event; } }