Coverage Report

Created: 2025-11-07 06:58

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/util-linux/libuuid/src/unpack.c
Line
Count
Source
1
/*
2
 * Internal routine for unpacking UUID
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 <string.h>
36
#include "uuidP.h"
37
38
void uuid_unpack(const uuid_t in, struct uuid *uu)
39
0
{
40
0
  const uint8_t *ptr = in;
41
0
  uint32_t    tmp;
42
43
0
  tmp = *ptr++;
44
0
  tmp = (tmp << 8) | *ptr++;
45
0
  tmp = (tmp << 8) | *ptr++;
46
0
  tmp = (tmp << 8) | *ptr++;
47
0
  uu->time_low = tmp;
48
49
0
  tmp = *ptr++;
50
0
  tmp = (tmp << 8) | *ptr++;
51
0
  uu->time_mid = tmp;
52
53
0
  tmp = *ptr++;
54
0
  tmp = (tmp << 8) | *ptr++;
55
0
  uu->time_hi_and_version = tmp;
56
57
0
  tmp = *ptr++;
58
0
  tmp = (tmp << 8) | *ptr++;
59
0
  uu->clock_seq = tmp;
60
61
0
  memcpy(uu->node, ptr, 6);
62
0
}
63