1*2fe8fb19SBen Gras /* $NetBSD: uuid_from_string.c,v 1.1 2004/09/13 21:44:54 thorpej Exp $ */
2*2fe8fb19SBen Gras
3*2fe8fb19SBen Gras /*-
4*2fe8fb19SBen Gras * Copyright (c) 2002 Marcel Moolenaar
5*2fe8fb19SBen Gras * Copyright (c) 2002 Hiten Mahesh Pandya
6*2fe8fb19SBen Gras * All rights reserved.
7*2fe8fb19SBen Gras *
8*2fe8fb19SBen Gras * Redistribution and use in source and binary forms, with or without
9*2fe8fb19SBen Gras * modification, are permitted provided that the following conditions
10*2fe8fb19SBen Gras * are met:
11*2fe8fb19SBen Gras * 1. Redistributions of source code must retain the above copyright
12*2fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer.
13*2fe8fb19SBen Gras * 2. Redistributions in binary form must reproduce the above copyright
14*2fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer in the
15*2fe8fb19SBen Gras * documentation and/or other materials provided with the distribution.
16*2fe8fb19SBen Gras *
17*2fe8fb19SBen Gras * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18*2fe8fb19SBen Gras * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19*2fe8fb19SBen Gras * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20*2fe8fb19SBen Gras * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21*2fe8fb19SBen Gras * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22*2fe8fb19SBen Gras * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23*2fe8fb19SBen Gras * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24*2fe8fb19SBen Gras * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25*2fe8fb19SBen Gras * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26*2fe8fb19SBen Gras * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27*2fe8fb19SBen Gras * SUCH DAMAGE.
28*2fe8fb19SBen Gras *
29*2fe8fb19SBen Gras * $FreeBSD: src/lib/libc/uuid/uuid_from_string.c,v 1.2 2003/08/08 19:18:43 marcel Exp $
30*2fe8fb19SBen Gras */
31*2fe8fb19SBen Gras
32*2fe8fb19SBen Gras #include <sys/cdefs.h>
33*2fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
34*2fe8fb19SBen Gras __RCSID("$NetBSD: uuid_from_string.c,v 1.1 2004/09/13 21:44:54 thorpej Exp $");
35*2fe8fb19SBen Gras #endif
36*2fe8fb19SBen Gras
37*2fe8fb19SBen Gras #include "namespace.h"
38*2fe8fb19SBen Gras
39*2fe8fb19SBen Gras #include <stdio.h>
40*2fe8fb19SBen Gras #include <string.h>
41*2fe8fb19SBen Gras #include <uuid.h>
42*2fe8fb19SBen Gras
43*2fe8fb19SBen Gras /*
44*2fe8fb19SBen Gras * uuid_from_string() - convert a string representation of an UUID into
45*2fe8fb19SBen Gras * a binary representation.
46*2fe8fb19SBen Gras * See also:
47*2fe8fb19SBen Gras * http://www.opengroup.org/onlinepubs/009629399/uuid_from_string.htm
48*2fe8fb19SBen Gras *
49*2fe8fb19SBen Gras * NOTE: The sequence field is in big-endian, while the time fields are in
50*2fe8fb19SBen Gras * native byte order.
51*2fe8fb19SBen Gras */
52*2fe8fb19SBen Gras void
uuid_from_string(const char * s,uuid_t * u,uint32_t * status)53*2fe8fb19SBen Gras uuid_from_string(const char *s, uuid_t *u, uint32_t *status)
54*2fe8fb19SBen Gras {
55*2fe8fb19SBen Gras int n;
56*2fe8fb19SBen Gras
57*2fe8fb19SBen Gras /* Short-circuit 2 special cases: NULL pointer and empty string. */
58*2fe8fb19SBen Gras if (s == NULL || *s == '\0') {
59*2fe8fb19SBen Gras uuid_create_nil(u, status);
60*2fe8fb19SBen Gras return;
61*2fe8fb19SBen Gras }
62*2fe8fb19SBen Gras
63*2fe8fb19SBen Gras /* Assume the worst. */
64*2fe8fb19SBen Gras if (status != NULL)
65*2fe8fb19SBen Gras *status = uuid_s_invalid_string_uuid;
66*2fe8fb19SBen Gras
67*2fe8fb19SBen Gras /* The UUID string representation has a fixed length. */
68*2fe8fb19SBen Gras if (strlen(s) != 36)
69*2fe8fb19SBen Gras return;
70*2fe8fb19SBen Gras
71*2fe8fb19SBen Gras /*
72*2fe8fb19SBen Gras * We only work with "new" UUIDs. New UUIDs have the form:
73*2fe8fb19SBen Gras * 01234567-89ab-cdef-0123-456789abcdef
74*2fe8fb19SBen Gras * The so called "old" UUIDs, which we don't support, have the form:
75*2fe8fb19SBen Gras * 0123456789ab.cd.ef.01.23.45.67.89.ab
76*2fe8fb19SBen Gras */
77*2fe8fb19SBen Gras if (s[8] != '-')
78*2fe8fb19SBen Gras return;
79*2fe8fb19SBen Gras
80*2fe8fb19SBen Gras n = sscanf(s,
81*2fe8fb19SBen Gras "%8x-%4hx-%4hx-%2hhx%2hhx-%2hhx%2hhx%2hhx%2hhx%2hhx%2hhx",
82*2fe8fb19SBen Gras &u->time_low, &u->time_mid, &u->time_hi_and_version,
83*2fe8fb19SBen Gras &u->clock_seq_hi_and_reserved, &u->clock_seq_low, &u->node[0],
84*2fe8fb19SBen Gras &u->node[1], &u->node[2], &u->node[3], &u->node[4], &u->node[5]);
85*2fe8fb19SBen Gras
86*2fe8fb19SBen Gras /* Make sure we have all conversions. */
87*2fe8fb19SBen Gras if (n != 11)
88*2fe8fb19SBen Gras return;
89*2fe8fb19SBen Gras
90*2fe8fb19SBen Gras /* We have a successful scan. Check semantics... */
91*2fe8fb19SBen Gras n = u->clock_seq_hi_and_reserved;
92*2fe8fb19SBen Gras if ((n & 0x80) != 0x00 && /* variant 0? */
93*2fe8fb19SBen Gras (n & 0xc0) != 0x80 && /* variant 1? */
94*2fe8fb19SBen Gras (n & 0xe0) != 0xc0) { /* variant 2? */
95*2fe8fb19SBen Gras if (status != NULL)
96*2fe8fb19SBen Gras *status = uuid_s_bad_version;
97*2fe8fb19SBen Gras } else {
98*2fe8fb19SBen Gras if (status != NULL)
99*2fe8fb19SBen Gras *status = uuid_s_ok;
100*2fe8fb19SBen Gras }
101*2fe8fb19SBen Gras }
102