-
Notifications
You must be signed in to change notification settings - Fork 2
/
timer.c
142 lines (115 loc) · 2.94 KB
/
timer.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
#include "timer.h"
#include "rbtree.h"
#include <stdlib.h>
#include <time.h>
static unsigned long timer_get_time();
static void timer_delete_nodes(rbtree_node_t *node, rbtree_node_t *sentinel);
static rbtree_node_t * timer_find_node(rbtree_node_t *node, rbtree_node_t *sentinel, unsigned long id);
struct timer {
rbtree_t tree;
rbtree_node_t sentinel;
};
typedef struct timer_node {
rbtree_node_t node;
unsigned long id;
} timer_node_t;
timer_t *
timer_create()
{
timer_t *timer;
timer = (timer_t *)malloc(sizeof(*timer));
if (timer) {
rbtree_init(&timer->tree, &timer->sentinel, rbtree_insert_value);
}
return timer;
}
void
timer_destroy(timer_t *timer)
{
if (timer) {
timer_delete_all(timer);
free(timer);
}
}
void
timer_expire(timer_t *timer, timer_execute_ptr execute, void *userp)
{
unsigned long id;
timer_node_t *timer_node;
rbtree_node_t *root, *sentinel, *node;
sentinel = &timer->sentinel;
while (1) {
root = timer->tree.root;
if (root == sentinel) {
break;
}
node = rbtree_min(root, sentinel);
if (timer_get_time() < node->key) {
break;
}
timer_node = (timer_node_t *)node;
id = timer_node->id;
rbtree_delete(&timer->tree, node);
free(timer_node);
execute(id, userp);
}
}
void
timer_add(timer_t *timer, unsigned long id, unsigned long elapse)
{
timer_node_t *timer_node;
timer_node = (timer_node_t *)malloc(sizeof(*timer_node));
if (timer_node) {
timer_node->id = id;
timer_node->node.key = timer_get_time() + elapse;
rbtree_insert(&timer->tree, &timer_node->node);
}
}
void
timer_delete(timer_t *timer, unsigned long id)
{
rbtree_node_t *node;
node = timer_find_node(timer->tree.root, &timer->sentinel, id);;
if (node != &timer->sentinel) {
rbtree_delete(&timer->tree, node);
}
}
void
timer_delete_all(timer_t *timer)
{
timer_delete_nodes(timer->tree.root, &timer->sentinel);
}
static unsigned long
timer_get_time()
{
return (unsigned long)clock();
}
static void
timer_delete_nodes(rbtree_node_t *node, rbtree_node_t *sentinel)
{
if (node != sentinel) {
timer_delete_nodes(node->left, sentinel);
timer_delete_nodes(node->right, sentinel);
free((timer_node_t *)node);
}
}
static rbtree_node_t *
timer_find_node(rbtree_node_t *node, rbtree_node_t *sentinel, unsigned long id)
{
if (node != sentinel) {
if (((timer_node_t *)node)->id == id) {
return node;
} else {
rbtree_node_t *left, *right;
left = timer_find_node(node->left, sentinel, id);
if (left != sentinel) {
return left;
}
right = timer_find_node(node->right, sentinel, id);
if (right != sentinel) {
return right;
}
}
}
return sentinel;
}