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