]>
Commit | Line | Data |
---|---|---|
cbea8737 DS |
1 | /* |
2 | * Timer Wheel | |
3 | * Copyright (C) 2016 Cumulus Networks, Inc. | |
4 | * Donald Sharp | |
5 | * | |
6 | * This program is free software; you can redistribute it and/or modify | |
7 | * it under the terms of the GNU General Public License as published by | |
8 | * the Free Software Foundation; either version 2 of the License, or | |
9 | * (at your option) any later version. | |
10 | * | |
11 | * This program is distributed in the hope that it will be useful, but | |
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | * General Public License for more details. | |
15 | * | |
16 | * You should have received a copy of the GNU General Public License | |
17 | * along with this program; see the file COPYING; if not, write to the | |
18 | * Free Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, | |
19 | * MA 02110-1301 USA | |
20 | */ | |
21 | #include "zebra.h" | |
22 | #include "linklist.h" | |
23 | #include "thread.h" | |
24 | #include "memory.h" | |
25 | #include "wheel.h" | |
26 | #include "log.h" | |
27 | ||
28 | DEFINE_MTYPE_STATIC(LIB, TIMER_WHEEL, "Timer Wheel") | |
29 | DEFINE_MTYPE_STATIC(LIB, TIMER_WHEEL_LIST, "Timer Wheel Slot List") | |
30 | ||
31 | static int debug_timer_wheel = 0; | |
32 | ||
33 | static int | |
34 | wheel_timer_thread (struct thread *t) | |
35 | { | |
36 | struct listnode *node, *nextnode; | |
37 | unsigned long long curr_slot; | |
38 | unsigned int slots_to_skip = 1; | |
39 | struct timer_wheel *wheel; | |
40 | void *data; | |
41 | ||
42 | wheel = THREAD_ARG(t); | |
43 | THREAD_OFF(wheel->timer); | |
44 | ||
45 | wheel->curr_slot += wheel->slots_to_skip; | |
46 | ||
47 | curr_slot = wheel->curr_slot % wheel->slots; | |
48 | ||
49 | if (debug_timer_wheel) | |
50 | zlog_debug ("%s: Wheel Slot: %lld(%lld) count: %d", | |
51 | __PRETTY_FUNCTION__, | |
52 | wheel->curr_slot, | |
53 | curr_slot, listcount(wheel->wheel_slot_lists[curr_slot])); | |
54 | ||
55 | for (ALL_LIST_ELEMENTS (wheel->wheel_slot_lists[curr_slot], node, nextnode, data)) | |
56 | (*wheel->slot_run)(data); | |
57 | ||
58 | while (list_isempty(wheel->wheel_slot_lists[(curr_slot + slots_to_skip) % wheel->slots]) && | |
59 | (curr_slot + slots_to_skip ) % wheel->slots != curr_slot) | |
60 | slots_to_skip++; | |
61 | ||
62 | wheel->slots_to_skip = slots_to_skip; | |
ffa2c898 QY |
63 | thread_add_timer_msec(wheel->master, wheel_timer_thread, wheel, |
64 | wheel->nexttime * slots_to_skip, &wheel->timer); | |
cbea8737 DS |
65 | |
66 | return 0; | |
67 | } | |
68 | ||
69 | struct timer_wheel * | |
70 | wheel_init (struct thread_master *master, int period, size_t slots, | |
71 | unsigned int (*slot_key) (void *), | |
72 | void (*slot_run) (void *)) | |
73 | { | |
74 | struct timer_wheel *wheel; | |
75 | size_t i; | |
76 | ||
77 | wheel = XCALLOC(MTYPE_TIMER_WHEEL, sizeof (struct timer_wheel)); | |
78 | ||
79 | wheel->slot_key = slot_key; | |
80 | wheel->slot_run = slot_run; | |
81 | ||
82 | wheel->period = period; | |
83 | wheel->slots = slots; | |
84 | wheel->curr_slot = 0; | |
85 | wheel->master = master; | |
86 | wheel->nexttime = period / slots; | |
87 | ||
88 | wheel->wheel_slot_lists = XCALLOC(MTYPE_TIMER_WHEEL_LIST, | |
89 | slots * sizeof (struct listnode *)); | |
90 | for (i = 0; i < slots; i++) | |
91 | wheel->wheel_slot_lists[i] = list_new (); | |
92 | ||
ffa2c898 QY |
93 | thread_add_timer_msec(wheel->master, wheel_timer_thread, wheel, |
94 | wheel->nexttime, &wheel->timer); | |
cbea8737 DS |
95 | |
96 | return wheel; | |
97 | } | |
98 | ||
99 | void | |
100 | wheel_delete (struct timer_wheel *wheel) | |
101 | { | |
102 | int i; | |
103 | ||
104 | for (i = 0; i < wheel->slots; i++) | |
105 | { | |
106 | list_delete(wheel->wheel_slot_lists[i]); | |
107 | } | |
108 | ||
109 | THREAD_OFF(wheel->timer); | |
110 | XFREE(MTYPE_TIMER_WHEEL_LIST, wheel->wheel_slot_lists); | |
111 | XFREE(MTYPE_TIMER_WHEEL, wheel); | |
112 | } | |
113 | ||
114 | int | |
115 | wheel_stop (struct timer_wheel *wheel) | |
116 | { | |
117 | THREAD_OFF(wheel->timer); | |
118 | return 0; | |
119 | } | |
120 | ||
121 | int | |
122 | wheel_start (struct timer_wheel *wheel) | |
123 | { | |
124 | if (!wheel->timer) | |
ffa2c898 QY |
125 | thread_add_timer_msec(wheel->master, wheel_timer_thread, wheel, |
126 | wheel->nexttime, &wheel->timer); | |
cbea8737 DS |
127 | |
128 | return 0; | |
129 | } | |
130 | ||
131 | int | |
132 | wheel_add_item (struct timer_wheel *wheel, void *item) | |
133 | { | |
134 | long long slot; | |
135 | ||
136 | slot = (*wheel->slot_key)(item); | |
137 | ||
138 | if (debug_timer_wheel) | |
139 | zlog_debug ("%s: Inserting %p: %lld %lld", | |
140 | __PRETTY_FUNCTION__, item, | |
141 | slot, slot % wheel->slots); | |
142 | listnode_add (wheel->wheel_slot_lists[slot % wheel->slots], item); | |
143 | ||
144 | return 0; | |
145 | } | |
146 | ||
147 | int | |
148 | wheel_remove_item (struct timer_wheel *wheel, void *item) | |
149 | { | |
150 | long long slot; | |
151 | ||
152 | slot = (*wheel->slot_key)(item); | |
153 | ||
154 | if (debug_timer_wheel) | |
155 | zlog_debug ("%s: Removing %p: %lld %lld", | |
156 | __PRETTY_FUNCTION__, item, | |
157 | slot, slot % wheel->slots); | |
158 | listnode_delete (wheel->wheel_slot_lists[slot % wheel->slots], item); | |
159 | ||
160 | return 0; | |
161 | } |