mirror of
https://git.FreeBSD.org/src.git
synced 2024-12-24 11:29:10 +00:00
52183d0145
The uuidgen command, by means of the uuidgen syscall, generates one
or more Universally Unique Identifiers compatible with OSF/DCE 1.1
version 1 UUIDs.
From the Perforce logs (change 11995):
Round of cleanups:
o Give uuidgen() the correct prototype in syscalls.master
o Define struct uuid according to DCE 1.1 in sys/uuid.h
o Use struct uuid instead of uuid_t. The latter is defined
in sys/uuid.h but should not be used in kernel land.
o Add snprintf_uuid(), printf_uuid() and sbuf_printf_uuid()
to kern_uuid.c for use in the kernel (currently geom_gpt.c).
o Rename the non-standard struct uuid in kern/kern_uuid.c
to struct uuid_private and give it a slightly better definition
for better byte-order handling. See below.
o In sys/gpt.h, fix the broken uuid definitions to match the now
compliant struct uuid definition. See below.
o In usr.bin/uuidgen/uuidgen.c catch up with struct uuid change.
A note about byte-order:
The standard failed to provide a non-conflicting and
unambiguous definition for the binary representation. My initial
implementation always wrote the timestamp as a 64-bit little-endian
(2s-complement) integral. The clock sequence was always written
as a 16-bit big-endian (2s-complement) integral. After a good
nights sleep and couple of Pan Galactic Gargle Blasters (not
necessarily in that order :-) I reread the spec and came to the
conclusion that the time fields are always written in the native
by order, provided the the low, mid and hi chopping still occurs.
The spec mentions that you "might need to swap bytes if you talk
to a machine that has a different byte-order". The clock sequence
is always written in big-endian order (as is the IEEE 802 address)
because its division is resulting in bytes, making the ordering
unambiguous.
114 lines
2.8 KiB
C
114 lines
2.8 KiB
C
/*
|
|
* Copyright (c) 2002 Marcel Moolenaar
|
|
* 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.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
|
|
*
|
|
* $Id$
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/endian.h>
|
|
#include <sys/uuid.h>
|
|
|
|
#include <err.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <unistd.h>
|
|
|
|
static void
|
|
usage(void)
|
|
{
|
|
(void)fprintf(stderr, "usage: uuidgen [-1] [-n count]\n");
|
|
exit(1);
|
|
}
|
|
|
|
static void
|
|
uuid_print(uuid_t *uuid)
|
|
{
|
|
printf("%08x-%04x-%04x-%02x%02x-", uuid->time_low, uuid->time_mid,
|
|
uuid->time_hi_and_version, uuid->clock_seq_hi_and_reserved,
|
|
uuid->clock_seq_low);
|
|
printf("%02x%02x%02x%02x%02x%02x\n", uuid->node[0], uuid->node[1],
|
|
uuid->node[2], uuid->node[3], uuid->node[4], uuid->node[5]);
|
|
}
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
uuid_t *store, *uuid;
|
|
char *p;
|
|
int ch, count, i, iterate;
|
|
|
|
count = -1; /* no count yet */
|
|
iterate = 0; /* not one at a time */
|
|
while ((ch = getopt(argc, argv, "1n:")) != -1)
|
|
switch (ch) {
|
|
case '1':
|
|
iterate = 1;
|
|
break;
|
|
case 'n':
|
|
if (count > 0)
|
|
usage();
|
|
count = strtol(optarg, &p, 10);
|
|
if (*p != 0 || count < 1)
|
|
usage();
|
|
break;
|
|
default:
|
|
usage();
|
|
}
|
|
argv += optind;
|
|
argc -= optind;
|
|
|
|
if (argc)
|
|
usage();
|
|
|
|
if (count == -1)
|
|
count = 1;
|
|
|
|
store = (uuid_t*)malloc(sizeof(uuid_t) * count);
|
|
if (store == NULL)
|
|
err(1, "malloc()");
|
|
|
|
if (!iterate) {
|
|
/* Get them all in a single batch */
|
|
if (uuidgen(store, count) != 0)
|
|
err(1, "uuidgen()");
|
|
} else {
|
|
uuid = store;
|
|
for (i = 0; i < count; i++) {
|
|
if (uuidgen(uuid++, 1) != 0)
|
|
err(1, "uuidgen()");
|
|
}
|
|
}
|
|
|
|
uuid = store;
|
|
while (count--)
|
|
uuid_print(uuid++);
|
|
|
|
free(store);
|
|
return (0);
|
|
}
|