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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
/* Copyright (C) 2017 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <tap/basic.h>
#include <string.h>
#include "contrib/time.h"
static void test_now(void)
{
struct timespec t = time_now();
ok(t.tv_sec != 0, "time_now() returns something");
}
static void test_diff(void)
{
struct timespec t1 = { 10, 1000 };
struct timespec t2 = { 50, 1500 };
struct timespec t3 = { 70, 500 };
struct timespec res;
res = time_diff(&t1, &t2);
ok(res.tv_sec == 40 && res.tv_nsec == 500, "time_diff()");
res = time_diff(&t2, &t3);
ok(res.tv_sec == 19 && res.tv_nsec == 999999000, "time_diff() ns overflow");
res = time_diff(&t3, &t1);
ok(res.tv_sec == -60 && res.tv_nsec == 500, "time_diff() negative");
res = time_diff(&t2, &t1);
ok(res.tv_sec == -41 && res.tv_nsec == 999999500, "time_diff() negative");
}
static void test_diff_ms(void)
{
struct timespec t1 = { 10, 1000 };
struct timespec t2 = { 50, 500 };
float ms = 0.0;
ms = time_diff_ms(&t1, &t2);
ok(39990.0 < ms && ms < 40010.0, "time_diff_ms()");
ms = time_diff_ms(&t2, &t1);
ok(-40010.0 < ms && ms < -39990.0, "time_diff_ms() negative");
}
static void test_knot_time(void)
{
knot_time_t a = knot_time();
knot_time_t inf = 0;
knot_time_t c;
knot_timediff_t d;
int ret;
ok(a != 0, "knot time not zero");
ret = knot_time_cmp(a, a);
ok(ret == 0, "compare same times");
ret = knot_time_cmp(a - 1, a + 1);
ok(ret == -1, "compare smaller time");
ret = knot_time_cmp(a + 10, a - 10);
ok(ret == 1, "compare bigger time");
ret = knot_time_cmp(inf, inf);
ok(ret == 0, "compare two infinities");
ret = knot_time_cmp(a, inf);
ok(ret == -1, "compare time and infinity");
ret = knot_time_cmp(inf, a);
ok(ret == 1, "compare infinity and time");
c = knot_time_min(a, a);
ok(c == a, "take same time");
c = knot_time_min(a, a + 1);
ok(c == a, "take first smaller");
c = knot_time_min(a + 1, a);
ok(c == a, "take second smaller");
c = knot_time_min(inf, inf);
ok(c == inf, "take same infinity");
c = knot_time_min(a, inf);
ok(c == a, "take first finite");
c = knot_time_min(inf, a);
ok(c == a, "take second finite");
d = knot_time_diff(a + 1, a);
ok(d == 1, "positive diff");
d = knot_time_diff(a, a + 1);
ok(d == -1, "negative diff");
d = knot_time_diff(inf, inf);
ok(d == KNOT_TIMEDIFF_MAX, "positive double infinity diff");
d = knot_time_diff(inf, a);
ok(d == KNOT_TIMEDIFF_MAX, "positive infinity diff");
d = knot_time_diff(a, inf);
ok(d == KNOT_TIMEDIFF_MIN, "negative infinity diff");
}
static void test_time_parse_expect(int ret, knot_time_t res,
knot_time_t expected, const char *msg)
{
ok(ret == 0, "time_parse %s ok", msg);
ok(res == expected, "time_parse %s result", msg);
}
static void test_time_parse(void)
{
knot_time_t res;
int ret;
ret = knot_time_parse("", "", &res);
test_time_parse_expect(ret, res, 0, "nihilist");
ret = knot_time_parse("#", "12345", &res);
test_time_parse_expect(ret, res, 12345, "unix");
ret = knot_time_parse("+-#U", "-1h", &res);
test_time_parse_expect(ret, res, knot_time() - 3600, "hour");
ret = knot_time_parse("+-#u'nths'|+-#u'nutes'", "+1minutes", &res);
test_time_parse_expect(ret, res, knot_time() + 60, "minute");
}
static void test_time_print_expect(int ret, const char *res, int res_len,
const char *expected, const char *msg)
{
ok(ret == 0, "time_print %s ok", msg);
ok(strncmp(res, expected, res_len) == 0, "time_print %s result", msg);
}
static void test_time_print(void)
{
char buff[100];
int bufl = sizeof(buff);
int ret;
knot_time_t t = 44000, t2, big;
ret = knot_time_print(TIME_PRINT_UNIX, t, buff, bufl);
test_time_print_expect(ret, buff, bufl, "44000", "unix");
t2 = knot_time_add(knot_time(), -10000);
ret = knot_time_print(TIME_PRINT_RELSEC, t2, buff, bufl);
test_time_print_expect(ret, buff, bufl, "-10000", "relsec");
ret = knot_time_print(TIME_PRINT_ISO8601, t, buff, bufl);
buff[11] = '0', buff[12] = '0'; // zeroing 'hours' field to avoid locality issues
test_time_print_expect(ret, buff, bufl, "1970-01-01T00:13:20Z", "iso");
t2 = knot_time_add(knot_time(), -10000);
ret = knot_time_print(TIME_PRINT_HUMAN_MIXED, t2, buff, bufl);
test_time_print_expect(ret, buff, bufl, "-2h46m40s", "negative human mixed");
big = knot_time_add(knot_time(), 2 * 365 * 24 * 3600 + 1);
ret = knot_time_print(TIME_PRINT_HUMAN_MIXED, big, buff, bufl);
test_time_print_expect(ret, buff, bufl, "+2Y1s", "big human mixed");
t2 = knot_time_add(knot_time(), -10000);
ret = knot_time_print(TIME_PRINT_HUMAN_LOWER, t2, buff, bufl);
test_time_print_expect(ret, buff, bufl, "-2h46mi40s", "negative human lower");
big = knot_time_add(knot_time(), 2 * 365 * 24 * 3600 + 1);
ret = knot_time_print(TIME_PRINT_HUMAN_LOWER, big, buff, bufl);
test_time_print_expect(ret, buff, bufl, "+2y1s", "big human lower");
}
int main(int argc, char *argv[])
{
plan_lazy();
test_now();
test_diff();
test_diff_ms();
test_knot_time();
test_time_parse();
test_time_print();
return 0;
}
|
