| bigbiff | 7b4c7a6 | 2015-01-01 19:44:14 -0500 | [diff] [blame] | 1 | /* |
| 2 | * parse.c --- UUID parsing |
| 3 | * |
| 4 | * Copyright (C) 1996, 1997 Theodore Ts'o. |
| 5 | * |
| 6 | * %Begin-Header% |
| 7 | * Redistribution and use in source and binary forms, with or without |
| 8 | * modification, are permitted provided that the following conditions |
| 9 | * are met: |
| 10 | * 1. Redistributions of source code must retain the above copyright |
| 11 | * notice, and the entire permission notice in its entirety, |
| 12 | * including the disclaimer of warranties. |
| 13 | * 2. Redistributions in binary form must reproduce the above copyright |
| 14 | * notice, this list of conditions and the following disclaimer in the |
| 15 | * documentation and/or other materials provided with the distribution. |
| 16 | * 3. The name of the author may not be used to endorse or promote |
| 17 | * products derived from this software without specific prior |
| 18 | * written permission. |
| 19 | * |
| 20 | * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| 21 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
| 22 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE, ALL OF |
| 23 | * WHICH ARE HEREBY DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE |
| 24 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 25 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT |
| 26 | * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR |
| 27 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF |
| 28 | * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 29 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE |
| 30 | * USE OF THIS SOFTWARE, EVEN IF NOT ADVISED OF THE POSSIBILITY OF SUCH |
| 31 | * DAMAGE. |
| 32 | * %End-Header% |
| 33 | */ |
| 34 | |
| 35 | #include <stdlib.h> |
| 36 | #include <stdio.h> |
| 37 | #include <ctype.h> |
| 38 | #include <string.h> |
| 39 | |
| 40 | #include "uuidP.h" |
| 41 | |
| 42 | int uuid_parse(const char *in, uuid_t uu) |
| 43 | { |
| 44 | struct uuid uuid; |
| 45 | int i; |
| 46 | const char *cp; |
| 47 | char buf[3]; |
| 48 | |
| 49 | if (strlen(in) != 36) |
| 50 | return -1; |
| 51 | for (i=0, cp = in; i <= 36; i++,cp++) { |
| 52 | if ((i == 8) || (i == 13) || (i == 18) || |
| 53 | (i == 23)) { |
| 54 | if (*cp == '-') |
| 55 | continue; |
| 56 | else |
| 57 | return -1; |
| 58 | } |
| 59 | if (i== 36) |
| 60 | if (*cp == 0) |
| 61 | continue; |
| 62 | if (!isxdigit(*cp)) |
| 63 | return -1; |
| 64 | } |
| 65 | uuid.time_low = strtoul(in, NULL, 16); |
| 66 | uuid.time_mid = strtoul(in+9, NULL, 16); |
| 67 | uuid.time_hi_and_version = strtoul(in+14, NULL, 16); |
| 68 | uuid.clock_seq = strtoul(in+19, NULL, 16); |
| 69 | cp = in+24; |
| 70 | buf[2] = 0; |
| 71 | for (i=0; i < 6; i++) { |
| 72 | buf[0] = *cp++; |
| 73 | buf[1] = *cp++; |
| 74 | uuid.node[i] = strtoul(buf, NULL, 16); |
| 75 | } |
| 76 | |
| 77 | uuid_pack(&uuid, uu); |
| 78 | return 0; |
| 79 | } |