sal/rtl/uuid.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   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/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  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 .
  18  */
  19
  20 #include <string.h>
  21 #include <stdlib.h>
  22
  23 #include <osl/mutex.hxx>
  24 #include <rtl/random.h>
  25 #include <rtl/uuid.h>
  26 #include <rtl/digest.h>
  27
  28 #define SWAP_INT32_TO_NETWORK(x)\
  29                { sal_uInt32 y = x;\
  30                  sal_uInt8 *p = reinterpret_cast<sal_uInt8 *>(&(x)); \
  31                  p[0] = (sal_uInt8) ( ( y >> 24 ) & 0xff );\
  32                  p[1] = (sal_uInt8) ( ( y >> 16 ) & 0xff );\
  33                  p[2] = (sal_uInt8) ( ( y >> 8 )  & 0xff );\
  34                  p[3] = (sal_uInt8) ( ( y ) & 0xff);\
  35                }
  36 #define SWAP_INT16_TO_NETWORK(x)\
  37                { sal_uInt16 y = x;\
  38                  sal_uInt8 *p = reinterpret_cast<sal_uInt8 *>(&(x)); \
  39                  p[0] = (sal_uInt8) ( ( y >> 8 )  & 0xff );\
  40                  p[1] = (sal_uInt8) ( ( y ) & 0xff);\
  41                }
  42
  43 #define SWAP_NETWORK_TO_INT16(x)\
  44                { sal_uInt16 y = x;\
  45                  sal_uInt8 *p = reinterpret_cast<sal_uInt8 *>(&(y));\
  46                  x = ( ( ((sal_uInt16)p[0]) & 0xff) << 8 ) |\
  47                      ( (  (sal_uInt16)p[1]) & 0xff);\
  48                }
  49 #define SWAP_NETWORK_TO_INT32(x)\
  50                { sal_uInt32 y = x;\
  51                  sal_uInt8 *p = reinterpret_cast<sal_uInt8 *>(&(y)); \
  52                  x = ( ( ((sal_uInt32)p[0]) & 0xff) << 24 ) |\
  53                      ( ( ((sal_uInt32)p[1]) & 0xff) << 16 ) |\
  54                      ( ( ((sal_uInt32)p[2]) & 0xff) << 8  ) |\
  55                      ( (  (sal_uInt32)p[3]) & 0xff);\
  56                }
  57
  58 struct UUID
  59 {
  60       sal_uInt32          time_low;
  61       sal_uInt16          time_mid;
  62       sal_uInt16          time_hi_and_version;
  63       sal_uInt8           clock_seq_hi_and_reserved;
  64       sal_uInt8           clock_seq_low;
  65       sal_uInt8           node[6];
  66 };
  67
  68 static  void write_v3( sal_uInt8 *pUuid  )
  69 {
  70     UUID uuid;
  71     // copy to avoid alignment problems
  72     memcpy( &uuid , pUuid , 16 );
  73
  74     SWAP_NETWORK_TO_INT32( uuid.time_low );
  75     SWAP_NETWORK_TO_INT16( uuid.time_mid );
  76     SWAP_NETWORK_TO_INT16( uuid.time_hi_and_version );
  77
  78     /* put in the variant and version bits */
  79     uuid.time_hi_and_version       &= 0x0FFF;
  80     uuid.time_hi_and_version       |= (3 << 12);
  81     uuid.clock_seq_hi_and_reserved &= 0x3F;
  82     uuid.clock_seq_hi_and_reserved |= 0x80;
  83
  84     SWAP_INT32_TO_NETWORK( uuid.time_low );
  85     SWAP_INT16_TO_NETWORK( uuid.time_mid );
  86     SWAP_INT16_TO_NETWORK( uuid.time_hi_and_version );
  87
  88     memcpy( pUuid , &uuid , 16 );
  89 }
  90
  91 extern "C" void SAL_CALL rtl_createUuid( sal_uInt8 *pTargetUUID ,
  92                                          SAL_UNUSED_PARAMETER const sal_uInt8 *,
  93                                          SAL_UNUSED_PARAMETER sal_Bool )
  94 {
  95     {
  96         osl::MutexGuard g(osl::Mutex::getGlobalMutex());
  97         static rtlRandomPool pool = NULL;
  98         if (pool == NULL) {
  99             pool = rtl_random_createPool();
 100             if (pool == NULL) {
 101                 abort();
 102                     // only possible way to signal failure here (rtl_createUuid
 103                     // being part of a fixed C API)
 104             }
 105         }
 106         if (rtl_random_getBytes(pool, pTargetUUID, 16) != rtl_Random_E_None) {
 107             abort();
 108                 // only possible way to signal failure here (rtl_createUuid
 109                 // being part of a fixed C API)
 110         }
 111     }
 112     // See ITU-T Recommendation X.667:
 113     pTargetUUID[6] &= 0x0F;
 114     pTargetUUID[6] |= 0x40;
 115     pTargetUUID[8] &= 0x3F;
 116     pTargetUUID[8] |= 0x80;
 117 }
 118
 119 extern "C" void SAL_CALL rtl_createNamedUuid( sal_uInt8  *pTargetUUID,
 120                                               const sal_uInt8  *pNameSpaceUUID,
 121                                               const rtl_String *pName )
 122 {
 123     rtlDigest digest = rtl_digest_createMD5  ();
 124
 125     rtl_digest_updateMD5( digest, pNameSpaceUUID , 16 );
 126     rtl_digest_updateMD5( digest, pName->buffer , pName->length );
 127
 128     rtl_digest_getMD5( digest, pTargetUUID , 16 );
 129     rtl_digest_destroyMD5 (digest);
 130
 131     write_v3(pTargetUUID);
 132 }
 133
 134 extern "C" sal_Int32 SAL_CALL rtl_compareUuid( const sal_uInt8 *pUUID1 , const sal_uInt8 *pUUID2 )
 135 {
 136     int i;
 137     UUID u1;
 138     UUID u2;
 139     memcpy( &u1 , pUUID1 , 16 );
 140     memcpy( &u2 , pUUID2 , 16 );
 141
 142     SWAP_NETWORK_TO_INT32( u1.time_low );
 143     SWAP_NETWORK_TO_INT16( u1.time_mid );
 144     SWAP_NETWORK_TO_INT16( u1.time_hi_and_version );
 145
 146     SWAP_NETWORK_TO_INT32( u2.time_low );
 147     SWAP_NETWORK_TO_INT16( u2.time_mid );
 148     SWAP_NETWORK_TO_INT16( u2.time_hi_and_version );
 149
 150 #define CHECK(f1, f2) if (f1 != f2) return f1 < f2 ? -1 : 1;
 151     CHECK(u1.time_low, u2.time_low);
 152     CHECK(u1.time_mid, u2.time_mid);
 153     CHECK(u1.time_hi_and_version, u2.time_hi_and_version);
 154     CHECK(u1.clock_seq_hi_and_reserved, u2.clock_seq_hi_and_reserved);
 155     CHECK(u1.clock_seq_low, u2.clock_seq_low);
 156     for (i = 0; i < 6; i++)
 157     {
 158         if (u1.node[i] < u2.node[i])
 159             return -1;
 160         if (u1.node[i] > u2.node[i])
 161             return 1;
 162     }
 163     return 0;
 164
 165 }
 166
 167 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */