return;
event = event_tree->tail->data;
- if(event->time < now)
+ if(event->time <= now)
return;
- diff = 1 + event->time - now;
+ diff = event->time - now;
for(node = event_tree->head; node; node = node->next) {
event = node->data;
if(event_tree->head) {
event = event_tree->head->data;
- if(event->time < now) {
+ if(event->time <= now) {
avl_node_t *node = event_tree->head;
avl_unlink_node(event_tree, node);
free(node);
return NULL;
}
+
+event_t *peek_next_event(void) {
+ if (event_tree->head)
+ return event_tree->head->data;
+ return NULL;
+}