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
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
|
/* $OpenBSD: uuid.c,v 1.4 2010/06/27 18:19:36 martinh Exp $ */
/*
* Copyright (c) 2002, Stockholms Universitet
* (Stockholm University, Stockholm Sweden)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the university nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/*
* NCS/DCE/AFS/GUID generator
*
* for more information about DCE UUID, see
* <http://www.opengroup.org/onlinepubs/9629399/apdxa.htm>
*
* Note, the Microsoft GUID is a DCE UUID, but it seems like they
* folded in the seq num with the node part. That would explain how
* the reserved field have a bit pattern 110 when reserved is a 2 bit
* field.
*
* XXX should hash the node address for privacy issues
*/
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <net/if.h>
#include <net/if_types.h>
#include <net/if_dl.h>
#include <sys/file.h>
#include <fcntl.h>
#include <ifaddrs.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "uuid.h"
static uint32_t seq_num;
static struct timeval last_time;
static int32_t counter;
static char nodeaddr[6];
enum { UUID_NODE_MULTICAST = 0x80 };
static int
time_cmp(struct timeval *tv1, struct timeval *tv2)
{
if (tv1->tv_sec > tv2->tv_sec)
return -1;
if (tv1->tv_sec < tv2->tv_sec)
return 1;
if (tv1->tv_usec > tv2->tv_usec)
return -1;
if (tv1->tv_usec < tv2->tv_usec)
return 1;
return 0;
}
static void
get_node_addr(char *addr)
{
struct ifaddrs *ifa, *ifa0;
int found_mac = 0;
if (getifaddrs(&ifa0) != 0)
ifa0 = NULL;
for (ifa = ifa0; ifa != NULL && !found_mac; ifa = ifa->ifa_next) {
if (ifa->ifa_addr == NULL)
continue;
#if IFF_LOOPBACK
if (ifa->ifa_flags & IFF_LOOPBACK)
continue;
#endif
switch (ifa->ifa_addr->sa_family) {
#ifdef AF_LINK
case AF_LINK: {
struct sockaddr_dl *dl = (struct sockaddr_dl *)ifa->ifa_addr;
switch (dl->sdl_type) {
case IFT_ETHER:
case IFT_FDDI:
if (dl->sdl_alen == 6) {
memcpy(addr, LLADDR(dl), 6);
found_mac = 1;
}
}
}
#endif
default:
break;
}
}
if (ifa0 != NULL)
freeifaddrs(ifa0);
if (!found_mac) {
/*
* Set the multicast bit to make sure we won't collide with an
* allocated (mac) address.
*/
arc4random_buf(addr, 6);
addr[0] |= UUID_NODE_MULTICAST;
}
return;
}
/*
* Creates a new UUID.
*/
void
uuid_create(afsUUID *uuid)
{
static int uuid_inited = 0;
struct timeval tv;
int ret, got_time;
uint64_t dce_time;
if (uuid_inited == 0) {
gettimeofday(&last_time, NULL);
seq_num = arc4random();
get_node_addr(nodeaddr);
uuid_inited = 1;
}
gettimeofday(&tv, NULL);
got_time = 0;
do {
ret = time_cmp(&tv, &last_time);
if (ret < 0) {
/* Time went backward, just inc seq_num and be done.
* seq_num is 6 + 8 bit field it the uuid, so let it wrap
* around. don't let it be zero.
*/
seq_num = (seq_num + 1) & 0x3fff ;
if (seq_num == 0)
seq_num++;
got_time = 1;
counter = 0;
last_time = tv;
} else if (ret > 0) {
/* time went forward, reset counter and be happy */
last_time = tv;
counter = 0;
got_time = 1;
} else {
#define UUID_MAX_HZ (1) /* make this bigger fix you have larger tickrate */
#define MULTIPLIER_100_NANO_SEC 10
if (++counter < UUID_MAX_HZ * MULTIPLIER_100_NANO_SEC)
got_time = 1;
}
} while(!got_time);
/*
* now shift time to dce_time, epoch 00:00:00:00, 15 October 1582
* dce time ends year ~3400, so start to worry now
*/
dce_time = tv.tv_usec * MULTIPLIER_100_NANO_SEC + counter;
dce_time += ((uint64_t)tv.tv_sec) * 10000000;
dce_time += (((uint64_t)0x01b21dd2) << 32) + 0x13814000;
uuid->time_low = dce_time & 0xffffffff;
uuid->time_mid = 0xffff & (dce_time >> 32);
uuid->time_hi_and_version = 0x0fff & (dce_time >> 48);
uuid->time_hi_and_version |= (1 << 12);
uuid->clock_seq_low = seq_num & 0xff;
uuid->clock_seq_hi_and_reserved = (seq_num >> 8) & 0x3f;
uuid->clock_seq_hi_and_reserved |= 0x80; /* dce variant */
memcpy(uuid->node, nodeaddr, 6);
}
/*
* Converts a UUID from binary representation to a string representation.
*/
void
uuid_to_string(const afsUUID *uuid, char *str, size_t strsz)
{
snprintf(str, strsz,
"%08lx-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x",
uuid->time_low,
uuid->time_mid,
uuid->time_hi_and_version,
(unsigned char)uuid->clock_seq_hi_and_reserved,
(unsigned char)uuid->clock_seq_low,
(unsigned char)uuid->node[0],
(unsigned char)uuid->node[1],
(unsigned char)uuid->node[2],
(unsigned char)uuid->node[3],
(unsigned char)uuid->node[4],
(unsigned char)uuid->node[5]);
}
#ifdef TEST
int
main(int argc, char **argv)
{
char str[1000];
afsUUID u1, u2;
uuid_create(&u1);
uuid_to_string(&u1, str, sizeof(str));
printf("u: %s\n", str);
if (uuid_from_string(str, &u2)) {
printf("failed to parse\n");
return 0;
}
if (bcmp(&u1, &u2, sizeof(u1)) != 0)
printf("u1 != u2\n");
return 0;
}
#endif
|