2002-02-11 10:05:58 +00:00
|
|
|
/*
|
|
|
|
event.c -- event queue
|
2002-06-21 10:11:37 +00:00
|
|
|
Copyright (C) 2002 Guus Sliepen <guus@sliepen.eu.org>,
|
|
|
|
2002 Ivo Timmermans <ivo@o2w.nl>
|
2002-02-11 10:05:58 +00:00
|
|
|
|
|
|
|
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., 675 Mass Ave, Cambridge, MA 02139, USA.
|
|
|
|
|
2002-09-09 19:40:12 +00:00
|
|
|
$Id: event.c,v 1.1.4.4 2002/09/09 19:39:58 guus Exp $
|
2002-02-11 10:05:58 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "config.h"
|
|
|
|
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <xalloc.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <utils.h>
|
|
|
|
#include <avl_tree.h>
|
|
|
|
#include <time.h>
|
|
|
|
|
|
|
|
#include "event.h"
|
|
|
|
|
|
|
|
#include "system.h"
|
|
|
|
|
|
|
|
avl_tree_t *event_tree;
|
2002-03-01 14:09:31 +00:00
|
|
|
extern time_t now;
|
2002-02-11 10:05:58 +00:00
|
|
|
|
|
|
|
int id;
|
|
|
|
|
|
|
|
int event_compare(event_t *a, event_t *b)
|
|
|
|
{
|
|
|
|
if(a->time > b->time)
|
|
|
|
return 1;
|
|
|
|
if(a->time < b->time)
|
|
|
|
return -1;
|
|
|
|
return a->id - b->id;
|
|
|
|
}
|
|
|
|
|
|
|
|
void init_events(void)
|
|
|
|
{
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
event_tree = avl_alloc_tree((avl_compare_t)event_compare, NULL);
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void exit_events(void)
|
|
|
|
{
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
avl_delete_tree(event_tree);
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
event_t *new_event(void)
|
|
|
|
{
|
|
|
|
event_t *event;
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
event = (event_t *)xmalloc_and_zero(sizeof(*event));
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
return event;
|
|
|
|
}
|
|
|
|
|
|
|
|
void free_event(event_t *event)
|
|
|
|
{
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
free(event);
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void event_add(event_t *event)
|
|
|
|
{
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
event->id = ++id;
|
|
|
|
avl_insert(event_tree, event);
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void event_del(event_t *event)
|
|
|
|
{
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
avl_delete(event_tree, event);
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
event_t *get_expired_event(void)
|
|
|
|
{
|
|
|
|
event_t *event;
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
if(event_tree->head)
|
|
|
|
{
|
|
|
|
event = (event_t *)event_tree->head->data;
|
2002-03-01 14:09:31 +00:00
|
|
|
if(event->time < now)
|
2002-02-11 10:05:58 +00:00
|
|
|
{
|
|
|
|
avl_delete(event_tree, event);
|
|
|
|
return event;
|
|
|
|
}
|
|
|
|
}
|
2002-09-09 19:40:12 +00:00
|
|
|
cp();
|
2002-02-11 10:05:58 +00:00
|
|
|
return NULL;
|
|
|
|
}
|