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
|
/*
* Copyright (c) 2014 DeNA Co., Ltd.
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
#include "h2o/timeout.h"
void h2o_timeout_run(h2o_loop_t *loop, h2o_timeout_t *timeout, uint64_t now)
{
uint64_t max_registered_at = now - timeout->timeout;
while (!h2o_linklist_is_empty(&timeout->_entries)) {
h2o_timeout_entry_t *entry = H2O_STRUCT_FROM_MEMBER(h2o_timeout_entry_t, _link, timeout->_entries.next);
if (entry->registered_at > max_registered_at) {
break;
}
h2o_linklist_unlink(&entry->_link);
entry->registered_at = 0;
entry->cb(entry);
h2o_timeout__do_post_callback(loop);
}
}
uint64_t h2o_timeout_get_wake_at(h2o_linklist_t *timeouts)
{
h2o_linklist_t *node;
uint64_t wake_at = UINT64_MAX;
/* change wake_at to the minimum value of the timeouts */
for (node = timeouts->next; node != timeouts; node = node->next) {
h2o_timeout_t *timeout = H2O_STRUCT_FROM_MEMBER(h2o_timeout_t, _link, node);
if (!h2o_linklist_is_empty(&timeout->_entries)) {
h2o_timeout_entry_t *entry = H2O_STRUCT_FROM_MEMBER(h2o_timeout_entry_t, _link, timeout->_entries.next);
uint64_t entry_wake_at = entry->registered_at + timeout->timeout;
if (entry_wake_at < wake_at)
wake_at = entry_wake_at;
}
}
return wake_at;
}
void h2o_timeout_init(h2o_loop_t *loop, h2o_timeout_t *timeout, uint64_t millis)
{
memset(timeout, 0, sizeof(*timeout));
timeout->timeout = millis;
h2o_linklist_init_anchor(&timeout->_entries);
h2o_timeout__do_init(loop, timeout);
}
void h2o_timeout_dispose(h2o_loop_t *loop, h2o_timeout_t *timeout)
{
assert(h2o_linklist_is_empty(&timeout->_entries));
h2o_timeout__do_dispose(loop, timeout);
}
void h2o_timeout_link(h2o_loop_t *loop, h2o_timeout_t *timeout, h2o_timeout_entry_t *entry)
{
/* insert at tail, so that the entries are sorted in ascending order */
h2o_linklist_insert(&timeout->_entries, &entry->_link);
/* set data */
entry->registered_at = h2o_now(loop);
h2o_timeout__do_link(loop, timeout, entry);
}
void h2o_timeout_unlink(h2o_timeout_entry_t *entry)
{
if (h2o_linklist_is_linked(&entry->_link)) {
h2o_linklist_unlink(&entry->_link);
entry->registered_at = 0;
}
}
|
