xref: /iperf/src/iperf_time.c (revision e919e8c2)
1cde81d76SBen Fox-Moore /*
2cde81d76SBen Fox-Moore  * iperf, Copyright (c) 2014-2018, The Regents of the University of
3cde81d76SBen Fox-Moore  * California, through Lawrence Berkeley National Laboratory (subject
4cde81d76SBen Fox-Moore  * to receipt of any required approvals from the U.S. Dept. of
5cde81d76SBen Fox-Moore  * Energy).  All rights reserved.
6cde81d76SBen Fox-Moore  *
7cde81d76SBen Fox-Moore  * If you have questions about your rights to use or distribute this
8cde81d76SBen Fox-Moore  * software, please contact Berkeley Lab's Technology Transfer
9cde81d76SBen Fox-Moore  * Department at [email protected].
10cde81d76SBen Fox-Moore  *
11cde81d76SBen Fox-Moore  * NOTICE.  This software is owned by the U.S. Department of Energy.
12cde81d76SBen Fox-Moore  * As such, the U.S. Government has been granted for itself and others
13cde81d76SBen Fox-Moore  * acting on its behalf a paid-up, nonexclusive, irrevocable,
14cde81d76SBen Fox-Moore  * worldwide license in the Software to reproduce, prepare derivative
15cde81d76SBen Fox-Moore  * works, and perform publicly and display publicly.  Beginning five
16cde81d76SBen Fox-Moore  * (5) years after the date permission to assert copyright is obtained
17cde81d76SBen Fox-Moore  * from the U.S. Department of Energy, and subject to any subsequent
18cde81d76SBen Fox-Moore  * five (5) year renewals, the U.S. Government is granted for itself
19cde81d76SBen Fox-Moore  * and others acting on its behalf a paid-up, nonexclusive,
20cde81d76SBen Fox-Moore  * irrevocable, worldwide license in the Software to reproduce,
21cde81d76SBen Fox-Moore  * prepare derivative works, distribute copies to the public, perform
22cde81d76SBen Fox-Moore  * publicly and display publicly, and to permit others to do so.
23cde81d76SBen Fox-Moore  *
24cde81d76SBen Fox-Moore  * This code is distributed under a BSD style license, see the LICENSE
25cde81d76SBen Fox-Moore  * file for complete information.
26cde81d76SBen Fox-Moore  */
27cde81d76SBen Fox-Moore 
28cde81d76SBen Fox-Moore 
29cde81d76SBen Fox-Moore #include <stddef.h>
30cde81d76SBen Fox-Moore 
31cde81d76SBen Fox-Moore #include "iperf_config.h"
32cde81d76SBen Fox-Moore #include "iperf_time.h"
33cde81d76SBen Fox-Moore 
34cde81d76SBen Fox-Moore #ifdef HAVE_CLOCK_GETTIME
35cde81d76SBen Fox-Moore 
36cde81d76SBen Fox-Moore #include <time.h>
37cde81d76SBen Fox-Moore 
38cde81d76SBen Fox-Moore int
iperf_time_now(struct iperf_time * time1)39cde81d76SBen Fox-Moore iperf_time_now(struct iperf_time *time1)
40cde81d76SBen Fox-Moore {
41cde81d76SBen Fox-Moore     struct timespec ts;
42cde81d76SBen Fox-Moore     int result;
43*8b9c59b3SBruce A. Mah     result = clock_gettime(CLOCK_MONOTONIC, &ts);
44cde81d76SBen Fox-Moore     if (result == 0) {
45cde81d76SBen Fox-Moore         time1->secs = (uint32_t) ts.tv_sec;
46cde81d76SBen Fox-Moore         time1->usecs = (uint32_t) ts.tv_nsec / 1000;
47cde81d76SBen Fox-Moore     }
48cde81d76SBen Fox-Moore     return result;
49cde81d76SBen Fox-Moore }
50cde81d76SBen Fox-Moore 
51cde81d76SBen Fox-Moore #else
52cde81d76SBen Fox-Moore 
53cde81d76SBen Fox-Moore #include <sys/time.h>
54cde81d76SBen Fox-Moore 
55cde81d76SBen Fox-Moore int
iperf_time_now(struct iperf_time * time1)56cde81d76SBen Fox-Moore iperf_time_now(struct iperf_time *time1)
57cde81d76SBen Fox-Moore {
58cde81d76SBen Fox-Moore     struct timeval tv;
59cde81d76SBen Fox-Moore     int result;
60cde81d76SBen Fox-Moore     result = gettimeofday(&tv, NULL);
61cde81d76SBen Fox-Moore     time1->secs = tv.tv_sec;
62cde81d76SBen Fox-Moore     time1->usecs = tv.tv_usec;
63cde81d76SBen Fox-Moore     return result;
64cde81d76SBen Fox-Moore }
65cde81d76SBen Fox-Moore 
66cde81d76SBen Fox-Moore #endif
67cde81d76SBen Fox-Moore 
68cde81d76SBen Fox-Moore /* iperf_time_add_usecs
69cde81d76SBen Fox-Moore  *
70cde81d76SBen Fox-Moore  * Add a number of microseconds to a iperf_time.
71cde81d76SBen Fox-Moore  */
72cde81d76SBen Fox-Moore void
iperf_time_add_usecs(struct iperf_time * time1,uint64_t usecs)73cde81d76SBen Fox-Moore iperf_time_add_usecs(struct iperf_time *time1, uint64_t usecs)
74cde81d76SBen Fox-Moore {
75cde81d76SBen Fox-Moore     time1->secs += usecs / 1000000L;
76cde81d76SBen Fox-Moore     time1->usecs += usecs % 1000000L;
77cde81d76SBen Fox-Moore     if ( time1->usecs >= 1000000L ) {
78cde81d76SBen Fox-Moore         time1->secs += time1->usecs / 1000000L;
79cde81d76SBen Fox-Moore         time1->usecs %= 1000000L;
80cde81d76SBen Fox-Moore     }
81cde81d76SBen Fox-Moore }
82cde81d76SBen Fox-Moore 
83cde81d76SBen Fox-Moore uint64_t
iperf_time_in_usecs(struct iperf_time * time)84cde81d76SBen Fox-Moore iperf_time_in_usecs(struct iperf_time *time)
85cde81d76SBen Fox-Moore {
86cde81d76SBen Fox-Moore     return time->secs * 1000000LL + time->usecs;
87cde81d76SBen Fox-Moore }
88cde81d76SBen Fox-Moore 
89cde81d76SBen Fox-Moore double
iperf_time_in_secs(struct iperf_time * time)90cde81d76SBen Fox-Moore iperf_time_in_secs(struct iperf_time *time)
91cde81d76SBen Fox-Moore {
92cde81d76SBen Fox-Moore     return time->secs + time->usecs / 1000000.0;
93cde81d76SBen Fox-Moore }
94cde81d76SBen Fox-Moore 
95cde81d76SBen Fox-Moore /* iperf_time_compare
96cde81d76SBen Fox-Moore  *
97cde81d76SBen Fox-Moore  * Compare two timestamps
98cde81d76SBen Fox-Moore  *
99cde81d76SBen Fox-Moore  * Returns -1 if time1 is earlier, 1 if time1 is later,
100cde81d76SBen Fox-Moore  * or 0 if the timestamps are equal.
101cde81d76SBen Fox-Moore  */
102cde81d76SBen Fox-Moore int
iperf_time_compare(struct iperf_time * time1,struct iperf_time * time2)103cde81d76SBen Fox-Moore iperf_time_compare(struct iperf_time *time1, struct iperf_time *time2)
104cde81d76SBen Fox-Moore {
105cde81d76SBen Fox-Moore     if (time1->secs < time2->secs)
106cde81d76SBen Fox-Moore         return -1;
107cde81d76SBen Fox-Moore     if (time1->secs > time2->secs)
108cde81d76SBen Fox-Moore         return 1;
109cde81d76SBen Fox-Moore     if (time1->usecs < time2->usecs)
110cde81d76SBen Fox-Moore         return -1;
111cde81d76SBen Fox-Moore     if (time1->usecs > time2->usecs)
112cde81d76SBen Fox-Moore         return 1;
113cde81d76SBen Fox-Moore     return 0;
114cde81d76SBen Fox-Moore }
115cde81d76SBen Fox-Moore 
116cde81d76SBen Fox-Moore /* iperf_time_diff
117cde81d76SBen Fox-Moore  *
118cde81d76SBen Fox-Moore  * Calculates the time from time2 to time1, assuming time1 is later than time2.
119cde81d76SBen Fox-Moore  * The diff will always be positive, so the return value should be checked
120cde81d76SBen Fox-Moore  * to determine if time1 was earlier than time2.
121cde81d76SBen Fox-Moore  *
122cde81d76SBen Fox-Moore  * Returns 1 if the time1 is less than or equal to time2, otherwise 0.
123cde81d76SBen Fox-Moore  */
124cde81d76SBen Fox-Moore int
iperf_time_diff(struct iperf_time * time1,struct iperf_time * time2,struct iperf_time * diff)125cde81d76SBen Fox-Moore iperf_time_diff(struct iperf_time *time1, struct iperf_time *time2, struct iperf_time *diff)
126cde81d76SBen Fox-Moore {
127cde81d76SBen Fox-Moore     int past = 0;
128cde81d76SBen Fox-Moore     int cmp = 0;
129cde81d76SBen Fox-Moore 
130cde81d76SBen Fox-Moore     cmp = iperf_time_compare(time1, time2);
131cde81d76SBen Fox-Moore     if (cmp == 0) {
132cde81d76SBen Fox-Moore         diff->secs = 0;
133cde81d76SBen Fox-Moore         diff->usecs = 0;
134cde81d76SBen Fox-Moore         past = 1;
135cde81d76SBen Fox-Moore     }
136cde81d76SBen Fox-Moore     else if (cmp == 1) {
137cde81d76SBen Fox-Moore         diff->secs = time1->secs - time2->secs;
138cde81d76SBen Fox-Moore         diff->usecs = time1->usecs;
139cde81d76SBen Fox-Moore         if (diff->usecs < time2->usecs) {
140cde81d76SBen Fox-Moore             diff->secs -= 1;
141cde81d76SBen Fox-Moore             diff->usecs += 1000000;
142cde81d76SBen Fox-Moore         }
143cde81d76SBen Fox-Moore         diff->usecs = diff->usecs - time2->usecs;
144cde81d76SBen Fox-Moore     } else {
145cde81d76SBen Fox-Moore         diff->secs = time2->secs - time1->secs;
146cde81d76SBen Fox-Moore         diff->usecs = time2->usecs;
147cde81d76SBen Fox-Moore         if (diff->usecs < time1->usecs) {
148cde81d76SBen Fox-Moore             diff->secs -= 1;
149cde81d76SBen Fox-Moore             diff->usecs += 1000000;
150cde81d76SBen Fox-Moore         }
151cde81d76SBen Fox-Moore         diff->usecs = diff->usecs - time1->usecs;
152cde81d76SBen Fox-Moore         past = 1;
153cde81d76SBen Fox-Moore     }
154cde81d76SBen Fox-Moore 
155cde81d76SBen Fox-Moore     return past;
156cde81d76SBen Fox-Moore }
157