1*4a5d661aSToomas Soome /*-
2*4a5d661aSToomas Soome * Copyright (c) 2015 M. Warner Losh
3*4a5d661aSToomas Soome * All rights reserved.
4*4a5d661aSToomas Soome *
5*4a5d661aSToomas Soome * Redistribution and use in source and binary forms, with or without
6*4a5d661aSToomas Soome * modification, are permitted provided that the following conditions
7*4a5d661aSToomas Soome * are met:
8*4a5d661aSToomas Soome * 1. Redistributions of source code must retain the above copyright
9*4a5d661aSToomas Soome * notice, this list of conditions and the following disclaimer.
10*4a5d661aSToomas Soome * 2. Redistributions in binary form must reproduce the above copyright
11*4a5d661aSToomas Soome * notice, this list of conditions and the following disclaimer in the
12*4a5d661aSToomas Soome * documentation and/or other materials provided with the distribution.
13*4a5d661aSToomas Soome *
14*4a5d661aSToomas Soome * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*4a5d661aSToomas Soome * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*4a5d661aSToomas Soome * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*4a5d661aSToomas Soome * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*4a5d661aSToomas Soome * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*4a5d661aSToomas Soome * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*4a5d661aSToomas Soome * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*4a5d661aSToomas Soome * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*4a5d661aSToomas Soome * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*4a5d661aSToomas Soome * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*4a5d661aSToomas Soome * SUCH DAMAGE.
25*4a5d661aSToomas Soome *
26*4a5d661aSToomas Soome * $FreeBSD$
27*4a5d661aSToomas Soome */
28*4a5d661aSToomas Soome
29*4a5d661aSToomas Soome
30*4a5d661aSToomas Soome /*
31*4a5d661aSToomas Soome * Note: some comments taken from lib/libc/uuid/uuid_to_string.c
32*4a5d661aSToomas Soome * Copyright (c) 2002,2005 Marcel Moolenaar
33*4a5d661aSToomas Soome * Copyright (c) 2002 Hiten Mahesh Pandya
34*4a5d661aSToomas Soome */
35*4a5d661aSToomas Soome
36*4a5d661aSToomas Soome #include <stand.h>
37*4a5d661aSToomas Soome #include <uuid.h>
38*4a5d661aSToomas Soome
39*4a5d661aSToomas Soome /*
40*4a5d661aSToomas Soome * Dump len characters into *buf from val as hex and update *buf
41*4a5d661aSToomas Soome */
42*4a5d661aSToomas Soome static void
tohex(char ** buf,int len,uint32_t val)43*4a5d661aSToomas Soome tohex(char **buf, int len, uint32_t val)
44*4a5d661aSToomas Soome {
45*4a5d661aSToomas Soome static const char *hexstr = "0123456789abcdef";
46*4a5d661aSToomas Soome char *walker = *buf;
47*4a5d661aSToomas Soome int i;
48*4a5d661aSToomas Soome
49*4a5d661aSToomas Soome for (i = len - 1; i >= 0; i--) {
50*4a5d661aSToomas Soome walker[i] = hexstr[val & 0xf];
51*4a5d661aSToomas Soome val >>= 4;
52*4a5d661aSToomas Soome }
53*4a5d661aSToomas Soome *buf = walker + len;
54*4a5d661aSToomas Soome }
55*4a5d661aSToomas Soome
56*4a5d661aSToomas Soome /*
57*4a5d661aSToomas Soome * uuid_to_string() - Convert a binary UUID into a string representation.
58*4a5d661aSToomas Soome * See also:
59*4a5d661aSToomas Soome * http://www.opengroup.org/onlinepubs/009629399/uuid_to_string.htm
60*4a5d661aSToomas Soome *
61*4a5d661aSToomas Soome * NOTE: The references given above do not have a status code for when
62*4a5d661aSToomas Soome * the string could not be allocated. The status code has been
63*4a5d661aSToomas Soome * taken from the Hewlett-Packard implementation.
64*4a5d661aSToomas Soome *
65*4a5d661aSToomas Soome * NOTE: we don't support u == NULL for a nil UUID, sorry.
66*4a5d661aSToomas Soome *
67*4a5d661aSToomas Soome * NOTE: The sequence field is in big-endian, while the time fields are in
68*4a5d661aSToomas Soome * native byte order.
69*4a5d661aSToomas Soome *
70*4a5d661aSToomas Soome * hhhhhhhh-hhhh-hhhh-bbbb-bbbbbbbbbbbb
71*4a5d661aSToomas Soome * 01234567-89ab-cdef-0123-456789abcdef
72*4a5d661aSToomas Soome */
73*4a5d661aSToomas Soome void
uuid_to_string(const uuid_t * u,char ** s,uint32_t * status)74*4a5d661aSToomas Soome uuid_to_string(const uuid_t *u, char **s, uint32_t *status)
75*4a5d661aSToomas Soome {
76*4a5d661aSToomas Soome uuid_t nil;
77*4a5d661aSToomas Soome char *w;
78*4a5d661aSToomas Soome
79*4a5d661aSToomas Soome if (status != NULL)
80*4a5d661aSToomas Soome *status = uuid_s_ok;
81*4a5d661aSToomas Soome if (s == NULL) /* Regular version does this odd-ball behavior too */
82*4a5d661aSToomas Soome return;
83*4a5d661aSToomas Soome w = *s = malloc(37);
84*4a5d661aSToomas Soome if (*s == NULL) {
85*4a5d661aSToomas Soome if (status != NULL)
86*4a5d661aSToomas Soome *status = uuid_s_no_memory;
87*4a5d661aSToomas Soome return;
88*4a5d661aSToomas Soome }
89*4a5d661aSToomas Soome if (u == NULL) {
90*4a5d661aSToomas Soome u = &nil;
91*4a5d661aSToomas Soome uuid_create_nil(&nil, NULL);
92*4a5d661aSToomas Soome }
93*4a5d661aSToomas Soome /* native */
94*4a5d661aSToomas Soome tohex(&w, 8, u->time_low);
95*4a5d661aSToomas Soome *w++ = '-';
96*4a5d661aSToomas Soome tohex(&w, 4, u->time_mid);
97*4a5d661aSToomas Soome *w++ = '-';
98*4a5d661aSToomas Soome tohex(&w, 4, u->time_hi_and_version);
99*4a5d661aSToomas Soome *w++ = '-';
100*4a5d661aSToomas Soome /* Big endian, so do a byte at a time */
101*4a5d661aSToomas Soome tohex(&w, 2, u->clock_seq_hi_and_reserved);
102*4a5d661aSToomas Soome tohex(&w, 2, u->clock_seq_low);
103*4a5d661aSToomas Soome *w++ = '-';
104*4a5d661aSToomas Soome tohex(&w, 2, u->node[0]);
105*4a5d661aSToomas Soome tohex(&w, 2, u->node[1]);
106*4a5d661aSToomas Soome tohex(&w, 2, u->node[2]);
107*4a5d661aSToomas Soome tohex(&w, 2, u->node[3]);
108*4a5d661aSToomas Soome tohex(&w, 2, u->node[4]);
109*4a5d661aSToomas Soome tohex(&w, 2, u->node[5]);
110*4a5d661aSToomas Soome *w++ = '\0';
111*4a5d661aSToomas Soome }
112