OLD | NEW |
(Empty) | |
| 1 /* |
| 2 * Copyright (C) 2007,2008,2009 Red Hat, Inc. |
| 3 * |
| 4 * This is part of HarfBuzz, a text shaping library. |
| 5 * |
| 6 * Permission is hereby granted, without written agreement and without |
| 7 * license or royalty fees, to use, copy, modify, and distribute this |
| 8 * software and its documentation for any purpose, provided that the |
| 9 * above copyright notice and the following two paragraphs appear in |
| 10 * all copies of this software. |
| 11 * |
| 12 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR |
| 13 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
| 14 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN |
| 15 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH |
| 16 * DAMAGE. |
| 17 * |
| 18 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, |
| 19 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
| 20 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS |
| 21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
| 22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
| 23 * |
| 24 * Red Hat Author(s): Behdad Esfahbod |
| 25 */ |
| 26 |
| 27 #ifndef HB_PRIVATE_H |
| 28 #define HB_PRIVATE_H |
| 29 |
| 30 #if HAVE_CONFIG_H |
| 31 #include "config.h" |
| 32 #endif |
| 33 |
| 34 #include "hb-common.h" |
| 35 |
| 36 #include <stdlib.h> |
| 37 #include <string.h> |
| 38 #include <assert.h> |
| 39 |
| 40 /* We only use these two for debug output. However, the debug code is |
| 41 * always seen by the compiler (and optimized out in non-debug builds. |
| 42 * If including these becomes a problem, we can start thinking about |
| 43 * someway around that. */ |
| 44 #include <stdio.h> |
| 45 #include <errno.h> |
| 46 |
| 47 HB_BEGIN_DECLS |
| 48 |
| 49 |
| 50 /* Essentials */ |
| 51 |
| 52 #ifndef NULL |
| 53 # define NULL ((void *) 0) |
| 54 #endif |
| 55 |
| 56 #undef FALSE |
| 57 #define FALSE 0 |
| 58 |
| 59 #undef TRUE |
| 60 #define TRUE 1 |
| 61 |
| 62 |
| 63 /* Basics */ |
| 64 |
| 65 #undef MIN |
| 66 #define MIN(a,b) ((a) < (b) ? (a) : (b)) |
| 67 |
| 68 #undef MAX |
| 69 #define MAX(a,b) ((a) > (b) ? (a) : (b)) |
| 70 |
| 71 #undef ARRAY_LENGTH |
| 72 #define ARRAY_LENGTH(__array) ((signed int) (sizeof (__array) / sizeof (__array[
0]))) |
| 73 |
| 74 #define HB_STMT_START do |
| 75 #define HB_STMT_END while (0) |
| 76 |
| 77 #define _ASSERT_STATIC1(_line, _cond) typedef int _static_assert_on_line_##_line
##_failed[(_cond)?1:-1] |
| 78 #define _ASSERT_STATIC0(_line, _cond) _ASSERT_STATIC1 (_line, (_cond)) |
| 79 #define ASSERT_STATIC(_cond) _ASSERT_STATIC0 (__LINE__, (_cond)) |
| 80 |
| 81 |
| 82 /* Misc */ |
| 83 |
| 84 |
| 85 #if defined(__GNUC__) && (__GNUC__ > 2) && defined(__OPTIMIZE__) |
| 86 #define _HB_BOOLEAN_EXPR(expr) ((expr) ? 1 : 0) |
| 87 #define likely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 1)) |
| 88 #define unlikely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 0)) |
| 89 #else |
| 90 #define likely(expr) (expr) |
| 91 #define unlikely(expr) (expr) |
| 92 #endif |
| 93 |
| 94 #ifndef __GNUC__ |
| 95 #undef __attribute__ |
| 96 #define __attribute__(x) |
| 97 #endif |
| 98 |
| 99 #if __GNUC__ >= 3 |
| 100 #define HB_PURE_FUNC __attribute__((pure)) |
| 101 #define HB_CONST_FUNC __attribute__((const)) |
| 102 #else |
| 103 #define HB_PURE_FUNC |
| 104 #define HB_CONST_FUNC |
| 105 #endif |
| 106 #if __GNUC__ >= 4 |
| 107 #define HB_UNUSED __attribute__((unused)) |
| 108 #else |
| 109 #define HB_UNUSED |
| 110 #endif |
| 111 |
| 112 #ifndef HB_INTERNAL |
| 113 # define HB_INTERNAL __attribute__((__visibility__("hidden"))) |
| 114 #endif |
| 115 |
| 116 |
| 117 #if (defined(__WIN32__) && !defined(__WINE__)) || defined(_MSC_VER) |
| 118 #define snprintf _snprintf |
| 119 #endif |
| 120 |
| 121 #ifdef _MSC_VER |
| 122 #undef inline |
| 123 #define inline __inline |
| 124 #endif |
| 125 |
| 126 #ifdef __STRICT_ANSI__ |
| 127 #undef inline |
| 128 #define inline __inline__ |
| 129 #endif |
| 130 |
| 131 |
| 132 #if __GNUC__ >= 3 |
| 133 #define HB_FUNC __PRETTY_FUNCTION__ |
| 134 #elif defined(_MSC_VER) |
| 135 #define HB_FUNC __FUNCSIG__ |
| 136 #else |
| 137 #define HB_FUNC __func__ |
| 138 #endif |
| 139 |
| 140 |
| 141 /* Return the number of 1 bits in mask. */ |
| 142 static inline HB_CONST_FUNC unsigned int |
| 143 _hb_popcount32 (uint32_t mask) |
| 144 { |
| 145 #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4) |
| 146 return __builtin_popcount (mask); |
| 147 #else |
| 148 /* "HACKMEM 169" */ |
| 149 register uint32_t y; |
| 150 y = (mask >> 1) &033333333333; |
| 151 y = mask - y - ((y >>1) & 033333333333); |
| 152 return (((y + (y >> 3)) & 030707070707) % 077); |
| 153 #endif |
| 154 } |
| 155 |
| 156 /* Returns the number of bits needed to store number */ |
| 157 static inline HB_CONST_FUNC unsigned int |
| 158 _hb_bit_storage (unsigned int number) |
| 159 { |
| 160 #if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__) |
| 161 return likely (number) ? (sizeof (unsigned int) * 8 - __builtin_clz (number))
: 0; |
| 162 #else |
| 163 register unsigned int n_bits = 0; |
| 164 while (number) { |
| 165 n_bits++; |
| 166 number >>= 1; |
| 167 } |
| 168 return n_bits; |
| 169 #endif |
| 170 } |
| 171 |
| 172 /* Returns the number of zero bits in the least significant side of number */ |
| 173 static inline HB_CONST_FUNC unsigned int |
| 174 _hb_ctz (unsigned int number) |
| 175 { |
| 176 #if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__) |
| 177 return likely (number) ? __builtin_ctz (number) : 0; |
| 178 #else |
| 179 register unsigned int n_bits = 0; |
| 180 if (unlikely (!number)) return 0; |
| 181 while (!(number & 1)) { |
| 182 n_bits++; |
| 183 number >>= 1; |
| 184 } |
| 185 return n_bits; |
| 186 #endif |
| 187 } |
| 188 |
| 189 /* Type of bsearch() / qsort() compare function */ |
| 190 typedef int (*hb_compare_func_t) (const void *, const void *); |
| 191 |
| 192 |
| 193 /* We need external help for these */ |
| 194 |
| 195 #ifdef HAVE_GLIB |
| 196 |
| 197 #include <glib.h> |
| 198 |
| 199 typedef int hb_atomic_int_t; |
| 200 #define hb_atomic_int_fetch_and_add(AI, V) g_atomic_int_exchange_and_add (&
(AI), V) |
| 201 #define hb_atomic_int_get(AI) g_atomic_int_get (&(AI)) |
| 202 #define hb_atomic_int_set(AI, V) g_atomic_int_set (&(AI), V) |
| 203 |
| 204 typedef GStaticMutex hb_mutex_t; |
| 205 #define HB_MUTEX_INIT G_STATIC_MUTEX_INIT |
| 206 #define hb_mutex_init(M) g_static_mutex_init (&M) |
| 207 #define hb_mutex_lock(M) g_static_mutex_lock (&M) |
| 208 #define hb_mutex_trylock(M) g_static_mutex_trylock (&M) |
| 209 #define hb_mutex_unlock(M) g_static_mutex_unlock (&M) |
| 210 |
| 211 #else |
| 212 |
| 213 #ifdef _MSC_VER |
| 214 #pragma message(__LOC__"Could not find any system to define platform macros, lib
rary will NOT be thread-safe") |
| 215 #else |
| 216 #warning "Could not find any system to define platform macros, library will NOT
be thread-safe" |
| 217 #endif |
| 218 |
| 219 typedef int hb_atomic_int_t; |
| 220 #define hb_atomic_int_fetch_and_add(AI, V) ((AI) += (V), (AI) - (V)) |
| 221 #define hb_atomic_int_get(AI) (AI) |
| 222 #define hb_atomic_int_set(AI, V) HB_STMT_START { (AI) = (V); } HB
_STMT_END |
| 223 |
| 224 typedef int hb_mutex_t; |
| 225 #define HB_MUTEX_INIT 0 |
| 226 #define hb_mutex_init(M) HB_STMT_START { (M) = 0; } HB_ST
MT_END |
| 227 #define hb_mutex_lock(M) HB_STMT_START { (M) = 1; } HB_ST
MT_END |
| 228 #define hb_mutex_trylock(M) ((M) = 1, 1) |
| 229 #define hb_mutex_unlock(M) HB_STMT_START { (M) = 0; } HB_ST
MT_END |
| 230 |
| 231 #endif |
| 232 |
| 233 |
| 234 /* Big-endian handling */ |
| 235 |
| 236 #define hb_be_uint16(v) ((uint16_t) ((((const uint8_t *)&(v))[0] << 8) +
(((const uint8_t *)&(v))[1]))) |
| 237 |
| 238 #define hb_be_uint16_put(v,V) HB_STMT_START { v[0] = (V>>8); v[1] = (V); } HB_
STMT_END |
| 239 #define hb_be_uint16_get(v) (uint16_t) ((v[0] << 8) + v[1]) |
| 240 #define hb_be_uint16_cmp(a,b) (a[0] == b[0] && a[1] == b[1]) |
| 241 |
| 242 #define hb_be_uint32_put(v,V) HB_STMT_START { v[0] = (V>>24); v[1] = (V>>16);
v[2] = (V>>8); v[3] = (V); } HB_STMT_END |
| 243 #define hb_be_uint32_get(v) (uint32_t) ((v[0] << 24) + (v[1] << 16) + (v[2]
<< 8) + v[3]) |
| 244 #define hb_be_uint32_cmp(a,b) (a[0] == b[0] && a[1] == b[1] && a[2] == b[2] &&
a[3] == b[3]) |
| 245 |
| 246 |
| 247 /* Debug */ |
| 248 |
| 249 #ifndef HB_DEBUG |
| 250 #define HB_DEBUG 0 |
| 251 #endif |
| 252 |
| 253 static inline hb_bool_t /* always returns TRUE */ |
| 254 _hb_trace (const char *what, |
| 255 const char *function, |
| 256 const void *obj, |
| 257 unsigned int depth, |
| 258 unsigned int max_depth) |
| 259 { |
| 260 (void) ((depth < max_depth) && fprintf (stderr, "%s(%p) %-*d-> %s\n", what, ob
j, depth, depth, function)); |
| 261 return TRUE; |
| 262 } |
| 263 |
| 264 |
| 265 #include "hb-object-private.h" |
| 266 |
| 267 |
| 268 HB_END_DECLS |
| 269 |
| 270 #endif /* HB_PRIVATE_H */ |
OLD | NEW |