Bump version to 24.04.3.4
[LibreOffice.git] / sal / rtl / uuid.cxx
blob4249c7bddedb8bfb4c64be4b7cf2d148307ac48f
1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 /*
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
20 #include <string.h>
21 #include <stdlib.h>
23 #include <rtl/random.h>
24 #include <rtl/uuid.h>
25 #include <rtl/digest.h>
27 #define SWAP_INT16_TO_NETWORK(x)\
28 { sal_uInt16 y = x;\
29 sal_uInt8 *p = reinterpret_cast<sal_uInt8 *>(&(x)); \
30 p[0] = static_cast<sal_uInt8>( ( y >> 8 ) & 0xff );\
31 p[1] = static_cast<sal_uInt8>( ( y ) & 0xff);\
34 #define SWAP_NETWORK_TO_INT16(x)\
35 { sal_uInt16 y = x;\
36 sal_uInt8 *p = reinterpret_cast<sal_uInt8 *>(&(y));\
37 x = ( ( (static_cast<sal_uInt16>(p[0])) & 0xff) << 8 ) |\
38 ( ( static_cast<sal_uInt16>(p[1])) & 0xff);\
40 #define SWAP_NETWORK_TO_INT32(x)\
41 { sal_uInt32 y = x;\
42 sal_uInt8 *p = reinterpret_cast<sal_uInt8 *>(&(y)); \
43 x = ( ( (static_cast<sal_uInt32>(p[0])) & 0xff) << 24 ) |\
44 ( ( (static_cast<sal_uInt32>(p[1])) & 0xff) << 16 ) |\
45 ( ( (static_cast<sal_uInt32>(p[2])) & 0xff) << 8 ) |\
46 ( ( static_cast<sal_uInt32>(p[3])) & 0xff);\
49 namespace {
51 struct UUID
53 sal_uInt32 time_low;
54 sal_uInt16 time_mid;
55 sal_uInt16 time_hi_and_version;
56 sal_uInt8 clock_seq_hi_and_reserved;
57 sal_uInt8 clock_seq_low;
58 sal_uInt8 node[6];
63 static void write_v3( sal_uInt8 *pUuid )
65 UUID uuid;
66 // copy to avoid alignment problems
67 memcpy(&uuid, pUuid, 16);
69 SWAP_NETWORK_TO_INT16(uuid.time_hi_and_version);
71 /* put in the variant and version bits */
72 uuid.time_hi_and_version &= 0x0FFF;
73 uuid.time_hi_and_version |= (3 << 12);
74 uuid.clock_seq_hi_and_reserved &= 0x3F;
75 uuid.clock_seq_hi_and_reserved |= 0x80;
77 SWAP_INT16_TO_NETWORK(uuid.time_hi_and_version);
79 memcpy(pUuid, &uuid, 16);
82 extern "C" void SAL_CALL rtl_createUuid(sal_uInt8 *pTargetUUID ,
83 SAL_UNUSED_PARAMETER const sal_uInt8 *,
84 SAL_UNUSED_PARAMETER sal_Bool)
86 if (rtl_random_getBytes(nullptr, pTargetUUID, 16) != rtl_Random_E_None)
88 abort();
89 // only possible way to signal failure here (rtl_createUuid
90 // being part of a fixed C API)
93 // See ITU-T Recommendation X.667:
94 pTargetUUID[6] &= 0x0F;
95 pTargetUUID[6] |= 0x40;
96 pTargetUUID[8] &= 0x3F;
97 pTargetUUID[8] |= 0x80;
100 extern "C" void SAL_CALL rtl_createNamedUuid(sal_uInt8 *pTargetUUID,
101 const sal_uInt8 *pNameSpaceUUID,
102 const rtl_String *pName )
104 rtlDigest digest = rtl_digest_createMD5();
106 rtl_digest_updateMD5(digest, pNameSpaceUUID, 16);
107 rtl_digest_updateMD5(digest, pName->buffer, pName->length);
109 rtl_digest_getMD5(digest, pTargetUUID, 16);
110 rtl_digest_destroyMD5(digest);
112 write_v3(pTargetUUID);
115 extern "C" sal_Int32 SAL_CALL rtl_compareUuid(const sal_uInt8 *pUUID1, const sal_uInt8 *pUUID2)
117 int i;
118 UUID u1;
119 UUID u2;
120 memcpy(&u1, pUUID1, 16 );
121 memcpy(&u2, pUUID2, 16 );
123 SWAP_NETWORK_TO_INT32(u1.time_low);
124 SWAP_NETWORK_TO_INT16(u1.time_mid);
125 SWAP_NETWORK_TO_INT16(u1.time_hi_and_version);
127 SWAP_NETWORK_TO_INT32(u2.time_low);
128 SWAP_NETWORK_TO_INT16(u2.time_mid);
129 SWAP_NETWORK_TO_INT16(u2.time_hi_and_version);
131 #define CHECK(f1, f2) if (f1 != f2) return f1 < f2 ? -1 : 1;
132 CHECK(u1.time_low, u2.time_low);
133 CHECK(u1.time_mid, u2.time_mid);
134 CHECK(u1.time_hi_and_version, u2.time_hi_and_version);
135 CHECK(u1.clock_seq_hi_and_reserved, u2.clock_seq_hi_and_reserved);
136 CHECK(u1.clock_seq_low, u2.clock_seq_low);
137 for (i = 0; i < 6; i++)
139 if (u1.node[i] < u2.node[i])
140 return -1;
141 if (u1.node[i] > u2.node[i])
142 return 1;
144 return 0;
147 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */