Coverage Report

Created: 2025-10-12 06:56

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/util-linux/libuuid/src/parse.c
Line
Count
Source
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 "c.h"
41
#include "uuidP.h"
42
43
int uuid_parse(const char *in, uuid_t uu)
44
0
{
45
0
  size_t len = strlen(in);
46
0
  if (len != 36)
47
0
    return -1;
48
49
0
  return uuid_parse_range(in, in + len, uu);
50
0
}
51
52
int uuid_parse_range(const char *in_start, const char *in_end, uuid_t uu)
53
0
{
54
0
  struct uuid uuid;
55
0
  int   i;
56
0
  const char  *cp;
57
0
  char    buf[3];
58
59
0
  if ((in_end - in_start) != 36)
60
0
    return -1;
61
0
  for (i=0, cp = in_start; i < 36; i++,cp++) {
62
0
    if ((i == 8) || (i == 13) || (i == 18) ||
63
0
        (i == 23)) {
64
0
      if (*cp == '-')
65
0
        continue;
66
0
      return -1;
67
0
    }
68
69
0
    if (!isxdigit(*cp))
70
0
      return -1;
71
0
  }
72
0
  errno = 0;
73
0
  uuid.time_low = strtoul(in_start, NULL, 16);
74
75
0
  if (!errno)
76
0
    uuid.time_mid = strtoul(in_start+9, NULL, 16);
77
0
  if (!errno)
78
0
    uuid.time_hi_and_version = strtoul(in_start+14, NULL, 16);
79
0
  if (!errno)
80
0
    uuid.clock_seq = strtoul(in_start+19, NULL, 16);
81
0
  if (errno)
82
0
    return -1;
83
84
0
  cp = in_start+24;
85
0
  buf[2] = 0;
86
0
  for (i=0; i < 6; i++) {
87
0
    buf[0] = *cp++;
88
0
    buf[1] = *cp++;
89
90
0
    errno = 0;
91
0
    uuid.node[i] = strtoul(buf, NULL, 16);
92
0
    if (errno)
93
0
      return -1;
94
0
  }
95
96
0
  uuid_pack(&uuid, uu);
97
0
  return 0;
98
0
}