X-Git-Url: https://www.tinc-vpn.org/git/browse?p=tinc;a=blobdiff_plain;f=src%2Fevent.c;h=359fa4285c532a0821127df80667531c20a468de;hp=d11f91cc5ea554f083b8b42bb070381b0a6e1ffe;hb=503c32eb0ef9d6329e931559082f4ddf6d487dc6;hpb=5bf4b88666ecafe190e8ed71d6c14c9de8d16e1f diff --git a/src/event.c b/src/event.c index d11f91cc..359fa428 100644 --- a/src/event.c +++ b/src/event.c @@ -1,7 +1,7 @@ /* event.c -- event queue - Copyright (C) 2002 Guus Sliepen , - 2002 Ivo Timmermans + Copyright (C) 2002-2007 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 @@ -17,93 +17,119 @@ 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.1.4.1 2002/02/11 10:05:58 guus Exp $ + $Id$ */ -#include "config.h" - -#include -#include -#include -#include -#include -#include +#include "system.h" +#include "avl_tree.h" #include "event.h" - -#include "system.h" +#include "utils.h" +#include "xalloc.h" avl_tree_t *event_tree; +extern time_t now; int id; -int event_compare(event_t *a, event_t *b) +static int event_compare(const event_t *a, const event_t *b) { - if(a->time > b->time) - return 1; - if(a->time < b->time) - return -1; - return a->id - b->id; + if(a->time > b->time) + return 1; + + if(a->time < b->time) + return -1; + + return a->id - b->id; } void init_events(void) { -cp - event_tree = avl_alloc_tree((avl_compare_t)event_compare, NULL); -cp + cp(); + + event_tree = avl_alloc_tree((avl_compare_t) event_compare, (avl_action_t) free_event); } void exit_events(void) { -cp - avl_delete_tree(event_tree); -cp + cp(); + + avl_delete_tree(event_tree); +} + +void expire_events(void) +{ + avl_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. + */ + + cp(); + + if(!event_tree->tail) + return; + + event = event_tree->tail->data; + if(event->time < now) + return; + + diff = 1 + event->time - now; + + for(node = event_tree->head; node; node = node->next) { + event = node->data; + event->time -= diff; + } } event_t *new_event(void) { - event_t *event; -cp - event = (event_t *)xmalloc_and_zero(sizeof(*event)); -cp - return event; + cp(); + + return xmalloc_and_zero(sizeof(event_t)); } void free_event(event_t *event) { -cp - free(event); -cp + cp(); + + free(event); } void event_add(event_t *event) { -cp - event->id = ++id; - avl_insert(event_tree, event); -cp + cp(); + + event->id = ++id; + avl_insert(event_tree, event); } void event_del(event_t *event) { -cp - avl_delete(event_tree, event); -cp + cp(); + + avl_delete(event_tree, event); } event_t *get_expired_event(void) { - event_t *event; -cp - if(event_tree->head) - { - event = (event_t *)event_tree->head->data; - if(event->time < time(NULL)) - { - avl_delete(event_tree, event); - return event; - } - } -cp - return NULL; + event_t *event; + + cp(); + + if(event_tree->head) { + event = event_tree->head->data; + + if(event->time < now) { + avl_node_t *node = event_tree->head; + avl_unlink_node(event_tree, node); + free(node); + return event; + } + } + + return NULL; }