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
|
/* MIT License
*
* Copyright (c) 1998 Massachusetts Institute of Technology
* Copyright (c) The c-ares project and its contributors
*
* 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 (including the next
* paragraph) 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.
*
* SPDX-License-Identifier: MIT
*/
#include "ares_setup.h"
#ifdef HAVE_LIMITS_H
# include <limits.h>
#endif
#include "ares.h"
#include "ares_private.h"
void ares__timeval_remaining(ares_timeval_t *remaining,
const ares_timeval_t *now,
const ares_timeval_t *tout)
{
memset(remaining, 0, sizeof(*remaining));
/* Expired! */
if (tout->sec < now->sec ||
(tout->sec == now->sec && tout->usec < now->usec)) {
return;
}
remaining->sec = tout->sec - now->sec;
if (tout->usec < now->usec) {
remaining->sec -= 1;
remaining->usec = (tout->usec + 1000000) - now->usec;
} else {
remaining->usec = tout->usec - now->usec;
}
}
static struct timeval ares_timeval_to_struct_timeval(const ares_timeval_t *atv)
{
struct timeval tv;
tv.tv_sec = (time_t)atv->sec;
tv.tv_usec = (int)atv->usec;
return tv;
}
static ares_timeval_t struct_timeval_to_ares_timeval(const struct timeval *tv)
{
ares_timeval_t atv;
atv.sec = (ares_int64_t)tv->tv_sec;
atv.usec = (unsigned int)tv->tv_usec;
return atv;
}
struct timeval *ares_timeout(const ares_channel_t *channel,
struct timeval *maxtv, struct timeval *tvbuf)
{
const struct query *query;
ares__slist_node_t *node;
ares_timeval_t now;
ares_timeval_t atvbuf;
ares_timeval_t amaxtv;
/* The minimum timeout of all queries is always the first entry in
* channel->queries_by_timeout */
node = ares__slist_node_first(channel->queries_by_timeout);
/* no queries/timeout */
if (node == NULL) {
return maxtv;
}
query = ares__slist_node_val(node);
now = ares__tvnow();
ares__timeval_remaining(&atvbuf, &now, &query->timeout);
*tvbuf = ares_timeval_to_struct_timeval(&atvbuf);
if (maxtv == NULL) {
return tvbuf;
}
/* Return the minimum time between maxtv and tvbuf */
amaxtv = struct_timeval_to_ares_timeval(maxtv);
if (atvbuf.sec > amaxtv.sec) {
return maxtv;
}
if (atvbuf.sec < amaxtv.sec) {
return tvbuf;
}
if (atvbuf.usec > amaxtv.usec) {
return maxtv;
}
return tvbuf;
}
|
