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
204
205
206
207
|
/*-
* Public Domain 2014-2020 MongoDB, Inc.
* Public Domain 2008-2014 WiredTiger, Inc.
*
* This is free and unencumbered software released into the public domain.
*
* Anyone is free to copy, modify, publish, use, compile, sell, or
* distribute this software, either in source code form or as a compiled
* binary, for any purpose, commercial or non-commercial, and by any
* means.
*
* In jurisdictions that recognize copyright laws, the author or authors
* of this software dedicate any and all copyright interest in the
* software to the public domain. We make this dedication for the benefit
* of the public at large and to the detriment of our heirs and
* successors. We intend this dedication to be an overt act of
* relinquishment in perpetuity of all present and future rights to this
* software under copyright law.
*
* 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 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.
*/
#define THOUSAND (1000ULL)
#define MILLION (1000000ULL)
#define BILLION (1000000000ULL)
#define NSEC_PER_SEC BILLION
#define USEC_PER_SEC MILLION
#define MSEC_PER_SEC THOUSAND
#define ns_to_ms(v) ((v) / MILLION)
#define ns_to_sec(v) ((v) / BILLION)
#define ns_to_us(v) ((v) / THOUSAND)
#define us_to_ms(v) ((v) / THOUSAND)
#define us_to_ns(v) ((v) * THOUSAND)
#define us_to_sec(v) ((v) / MILLION)
#define ms_to_ns(v) ((v) * MILLION)
#define ms_to_us(v) ((v) * THOUSAND)
#define ms_to_sec(v) ((v) / THOUSAND)
#define sec_to_ns(v) ((v) * BILLION)
#define sec_to_us(v) ((v) * MILLION)
#define sec_to_ms(v) ((v) * THOUSAND)
inline std::ostream&
operator<<(std::ostream &os, const timespec &ts)
{
char oldfill;
std::streamsize oldwidth;
os << ts.tv_sec << ".";
oldfill = os.fill('0');
oldwidth = os.width(3);
os << (int)ns_to_ms(ts.tv_nsec);
os.fill(oldfill);
os.width(oldwidth);
return (os);
}
inline timespec
operator-(const timespec &lhs, const timespec &rhs)
{
timespec ts;
if (lhs.tv_nsec < rhs.tv_nsec) {
ts.tv_sec = lhs.tv_sec - rhs.tv_sec - 1;
ts.tv_nsec = lhs.tv_nsec - rhs.tv_nsec + NSEC_PER_SEC;
} else {
ts.tv_sec = lhs.tv_sec - rhs.tv_sec;
ts.tv_nsec = lhs.tv_nsec - rhs.tv_nsec;
}
return (ts);
}
inline timespec
operator+(const timespec &lhs, const int n)
{
timespec ts = lhs;
ts.tv_sec += n;
return (ts);
}
inline bool
operator<(const timespec &lhs, const timespec &rhs)
{
if (lhs.tv_sec == rhs.tv_sec)
return (lhs.tv_nsec < rhs.tv_nsec);
else
return (lhs.tv_sec < rhs.tv_sec);
}
inline bool
operator>(const timespec &lhs, const timespec &rhs)
{
if (lhs.tv_sec == rhs.tv_sec)
return (lhs.tv_nsec > rhs.tv_nsec);
else
return (lhs.tv_sec > rhs.tv_sec);
}
inline bool
operator>=(const timespec &lhs, const timespec &rhs)
{
return (!(lhs < rhs));
}
inline bool
operator<=(const timespec &lhs, const timespec &rhs)
{
return (!(lhs > rhs));
}
inline bool
operator==(const timespec &lhs, int n)
{
return (lhs.tv_sec == n && lhs.tv_nsec == 0);
}
inline bool
operator!=(const timespec &lhs, int n)
{
return (lhs.tv_sec != n || lhs.tv_nsec != 0);
}
inline timespec &
operator+=(timespec &lhs, const int n)
{
lhs.tv_sec += n;
return (lhs);
}
inline bool
operator==(const timespec &lhs, const timespec &rhs)
{
return (lhs.tv_sec == rhs.tv_sec && lhs.tv_nsec == rhs.tv_nsec);
}
inline timespec &
operator-=(timespec &lhs, const timespec &rhs)
{
lhs.tv_sec -= rhs.tv_sec;
lhs.tv_nsec -= rhs.tv_nsec;
if (lhs.tv_nsec < 0) {
lhs.tv_nsec += NSEC_PER_SEC;
lhs.tv_sec -= 1;
}
return (lhs);
}
inline timespec
ts_add_ms(const timespec &lhs, const uint64_t n)
{
timespec ts;
ts.tv_sec = lhs.tv_sec + ms_to_sec(n);
ts.tv_nsec = lhs.tv_nsec + ms_to_ns(n % THOUSAND);
while ((unsigned long)ts.tv_nsec > NSEC_PER_SEC) {
ts.tv_nsec -= NSEC_PER_SEC;
ts.tv_sec++;
}
return (ts);
}
inline void
ts_assign(timespec &lhs, const timespec &rhs)
{
lhs.tv_sec = rhs.tv_sec;
lhs.tv_nsec = rhs.tv_nsec;
}
inline void
ts_clear(timespec &ts)
{
ts.tv_sec = 0;
ts.tv_nsec = 0;
}
inline uint64_t
ts_sec(const timespec &ts)
{
return (ns_to_sec(ts.tv_nsec) + ts.tv_sec);
}
inline uint64_t
ts_ms(const timespec &ts)
{
return (ns_to_ms(ts.tv_nsec) + sec_to_ms(ts.tv_sec));
}
inline uint64_t
ts_us(const timespec &ts)
{
return (ns_to_us(ts.tv_nsec) + sec_to_us(ts.tv_sec));
}
inline uint64_t
secs_us(double secs)
{
return (secs * USEC_PER_SEC);
}
|
