sal/rtl/alloc_impl.hxx

   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 #ifndef INCLUDED_SAL_RTL_ALLOC_IMPL_HXX
  21 #define INCLUDED_SAL_RTL_ALLOC_IMPL_HXX
  22
  23 #include <sal/types.h>
  24
  25 /** Alignment macros
  26  */
  27 #if SAL_TYPES_ALIGNMENT4 > 1
  28 #define RTL_MEMORY_ALIGNMENT_4 SAL_TYPES_ALIGNMENT4
  29 #else
  30 #define RTL_MEMORY_ALIGNMENT_4 sizeof(int)
  31 #endif /* SAL_TYPES_ALIGNMENT4 */
  32
  33 #if SAL_TYPES_ALIGNMENT8 > 1
  34 #define RTL_MEMORY_ALIGNMENT_8 SAL_TYPES_ALIGNMENT8
  35 #else
  36 #define RTL_MEMORY_ALIGNMENT_8 sizeof(void*)
  37 #endif /* SAL_TYPES_ALIGNMENT8 */
  38
  39 #if 0  /* @@@ */
  40 #define RTL_MEMORY_ALIGNMENT_1 8
  41 #define RTL_MEMORY_ALIGNMENT_2 (sizeof(void*) * 2)
  42 #endif /* @@@ */
  43
  44 #define RTL_MEMORY_ALIGN(value, align) (((value) + ((align) - 1)) & ~((align) - 1))
  45
  46 #define RTL_MEMORY_ISP2(value) (((value) & ((value) - 1)) == 0)
  47 #define RTL_MEMORY_P2ALIGN(value, align) ((value) & -static_cast<sal_IntPtr>(align))
  48
  49 #define RTL_MEMORY_P2ROUNDUP(value, align) \
  50     (-(-static_cast<sal_IntPtr>(value) & -static_cast<sal_IntPtr>(align)))
  51 #define RTL_MEMORY_P2END(value, align) \
  52     (-(~static_cast<sal_IntPtr>(value) & -static_cast<sal_IntPtr>(align)))
  53
  54 /** highbit(): log2() + 1
  55     (complexity O(1))
  56 */
  57 static inline unsigned int highbit(sal_Size n)
  58 {
  59   unsigned int k = 1;
  60
  61   if (n == 0)
  62     return 0;
  63 #if SAL_TYPES_SIZEOFLONG == 8
  64   if (n & 0xffffffff00000000ul)
  65   {
  66     k |= 32;
  67     n >>= 32;
  68   }
  69 #endif
  70   if (n & 0xffff0000)
  71   {
  72     k |= 16;
  73     n >>= 16;
  74   }
  75   if (n & 0xff00)
  76   {
  77     k |= 8;
  78     n >>= 8;
  79   }
  80   if (n & 0xf0)
  81   {
  82     k |= 4;
  83     n >>= 4;
  84   }
  85   if (n & 0x0c)
  86   {
  87     k |= 2;
  88     n >>= 2;
  89   }
  90   if (n & 0x02)
  91     k++;
  92
  93   return k;
  94 }
  95
  96 /** find first bit set
  97     (complexity O(1))
  98 */
  99 static inline unsigned int lowbit(sal_Size n)
 100 {
 101   unsigned int k = 1;
 102
 103   if (n == 0)
 104     return 0;
 105
 106 #if SAL_TYPES_SIZEOFLONG == 8
 107   if (!(n & 0xffffffff))
 108   {
 109     k |= 32;
 110     n >>= 32;
 111   }
 112 #endif
 113
 114   if (!(n & 0xffff))
 115   {
 116     k |= 16;
 117     n >>= 16;
 118   }
 119
 120   if (!(n & 0xff))
 121   {
 122     k |= 8;
 123     n >>= 8;
 124   }
 125
 126   if (!(n & 0xf))
 127   {
 128     k |= 4;
 129     n >>= 4;
 130   }
 131
 132   if (!(n & 0x3))
 133   {
 134     k |= 2;
 135     n >>= 2;
 136   }
 137
 138   if (!(n & 0x1))
 139     k++;
 140
 141   return k;
 142 }
 143
 144 /** Queue manipulation macros
 145     (doubly linked circular list)
 146     (complexity O(1))
 147 */
 148 #define QUEUE_STARTED_NAMED(entry, name) \
 149   (((entry)->m_##name##next == (entry)) && ((entry)->m_##name##prev == (entry)))
 150
 151 #define QUEUE_START_NAMED(entry, name) \
 152 { \
 153   (entry)->m_##name##next = (entry); \
 154   (entry)->m_##name##prev = (entry); \
 155 }
 156
 157 #define QUEUE_REMOVE_NAMED(entry, name) \
 158 { \
 159   (entry)->m_##name##prev->m_##name##next = (entry)->m_##name##next; \
 160   (entry)->m_##name##next->m_##name##prev = (entry)->m_##name##prev; \
 161   QUEUE_START_NAMED(entry, name); \
 162 }
 163
 164 #define QUEUE_INSERT_HEAD_NAMED(head, entry, name) \
 165 { \
 166   (entry)->m_##name##prev = (head); \
 167   (entry)->m_##name##next = (head)->m_##name##next; \
 168   (head)->m_##name##next = (entry); \
 169   (entry)->m_##name##next->m_##name##prev = (entry); \
 170 }
 171
 172 #define QUEUE_INSERT_TAIL_NAMED(head, entry, name) \
 173 { \
 174   (entry)->m_##name##next = (head); \
 175   (entry)->m_##name##prev = (head)->m_##name##prev; \
 176   (head)->m_##name##prev = (entry); \
 177   (entry)->m_##name##prev->m_##name##next = (entry); \
 178 }
 179
 180 #if defined(SAL_UNX)
 181
 182 #include <unistd.h>
 183 #include <pthread.h>
 184
 185 typedef pthread_mutex_t rtl_memory_lock_type;
 186
 187 #define RTL_MEMORY_LOCK_INIT(lock)    pthread_mutex_init((lock), nullptr)
 188 #define RTL_MEMORY_LOCK_DESTROY(lock) pthread_mutex_destroy((lock))
 189
 190 #define RTL_MEMORY_LOCK_ACQUIRE(lock) pthread_mutex_lock((lock))
 191 #define RTL_MEMORY_LOCK_RELEASE(lock) pthread_mutex_unlock((lock))
 192
 193 #elif defined(_WIN32)
 194
 195 #define WIN32_LEAN_AND_MEAN
 196 #include <windows.h>
 197
 198 typedef CRITICAL_SECTION rtl_memory_lock_type;
 199
 200 #define RTL_MEMORY_LOCK_INIT(lock)    InitializeCriticalSection((lock))
 201 #define RTL_MEMORY_LOCK_DESTROY(lock) DeleteCriticalSection((lock))
 202
 203 #define RTL_MEMORY_LOCK_ACQUIRE(lock) EnterCriticalSection((lock))
 204 #define RTL_MEMORY_LOCK_RELEASE(lock) LeaveCriticalSection((lock))
 205
 206 #else
 207 #error Unknown platform
 208 #endif /* SAL_UNX | _WIN32 */
 209
 210 /** Cache creation flags.
 211     @internal
 212 */
 213 #define RTL_CACHE_FLAG_NOMAGAZINE   (1 << 13) /* w/o magazine layer */
 214
 215 #endif // INCLUDED_SAL_RTL_ALLOC_IMPL_HXX
 216
 217 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */