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
|
/* $Id$ */
/***
This file is part of avahi.
avahi is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 2.1 of the
License, or (at your option) any later version.
avahi 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 Lesser General
Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with avahi; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
USA.
***/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <pthread.h>
#include <stdlib.h>
#include <assert.h>
#include "timeval.h"
int avahi_timeval_compare(const struct timeval *a, const struct timeval *b) {
assert(a);
assert(b);
if (a->tv_sec < b->tv_sec)
return -1;
if (a->tv_sec > b->tv_sec)
return 1;
if (a->tv_usec < b->tv_usec)
return -1;
if (a->tv_usec > b->tv_usec)
return 1;
return 0;
}
AvahiUsec avahi_timeval_diff(const struct timeval *a, const struct timeval *b) {
assert(a);
assert(b);
if (avahi_timeval_compare(a, b) < 0)
return - avahi_timeval_diff(b, a);
return ((AvahiUsec) a->tv_sec - b->tv_sec)*1000000 + a->tv_usec - b->tv_usec;
}
struct timeval* avahi_timeval_add(struct timeval *a, AvahiUsec usec) {
AvahiUsec u;
assert(a);
u = usec + a->tv_usec;
if (u < 0) {
a->tv_usec = (long) (1000000 + (u % 1000000));
a->tv_sec += (long) (-1 + (u / 1000000));
} else {
a->tv_usec = (long) (u % 1000000);
a->tv_sec += (long) (u / 1000000);
}
return a;
}
AvahiUsec avahi_age(const struct timeval *a) {
struct timeval now;
assert(a);
gettimeofday(&now, NULL);
return avahi_timeval_diff(&now, a);
}
struct timeval *avahi_elapse_time(struct timeval *tv, unsigned msec, unsigned jitter) {
assert(tv);
gettimeofday(tv, NULL);
if (msec)
avahi_timeval_add(tv, (AvahiUsec) msec*1000);
if (jitter) {
static pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER;
static int last_rand;
static time_t timestamp = 0;
time_t now;
int r;
now = time(NULL);
pthread_mutex_lock(&mutex);
if (now >= timestamp + 10) {
timestamp = now;
last_rand = rand();
}
r = last_rand;
pthread_mutex_unlock(&mutex);
/* We use the same jitter for 10 seconds. That way our
* time events elapse in bursts which has the advantage that
* packet data can be aggegrated better */
avahi_timeval_add(tv, (AvahiUsec) (jitter*1000.0*r/(RAND_MAX+1.0)));
}
return tv;
}
|
