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