2 * Copyright (C) 2007,2008,2009 Red Hat, Inc.
4 * This is part of HarfBuzz, a text shaping library.
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.
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
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.
24 * Red Hat Author(s): Behdad Esfahbod
34 #include "hb-common.h"
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. */
51 # define NULL ((void *) 0)
64 #define MIN(a,b) ((a) < (b) ? (a) : (b))
67 #define MAX(a,b) ((a) > (b) ? (a) : (b))
70 # define HB_INTERNAL extern
74 #define ARRAY_LENGTH(__array) ((signed int) (sizeof (__array) / sizeof (__array[0])))
76 #define HB_STMT_START do
77 #define HB_STMT_END while (0)
79 #define _ASSERT_STATIC1(_line, _cond) typedef int _static_assert_on_line_##_line##_failed[(_cond)?1:-1]
80 #define _ASSERT_STATIC0(_line, _cond) _ASSERT_STATIC1 (_line, (_cond))
81 #define ASSERT_STATIC(_cond) _ASSERT_STATIC0 (__LINE__, (_cond))
87 #if defined(__GNUC__) && (__GNUC__ > 2) && defined(__OPTIMIZE__)
88 #define _HB_BOOLEAN_EXPR(expr) \
90 int _hb_boolean_var_; \
92 _hb_boolean_var_ = 1; \
94 _hb_boolean_var_ = 0; \
97 #define likely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 1))
98 #define unlikely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 0))
100 #define likely(expr) (expr)
101 #define unlikely(expr) (expr)
106 #define __attribute__(x)
110 #define HB_PURE_FUNC __attribute__((pure))
111 #define HB_CONST_FUNC __attribute__((const))
114 #define HB_CONST_FUNC
117 #define HB_UNUSED __attribute__((unused))
123 #if (defined(__WIN32__) && !defined(__WINE__)) || defined(_MSC_VER)
124 #define snprintf _snprintf
129 #define inline __inline
132 #ifdef __STRICT_ANSI__
134 #define inline __inline__
139 #define HB_FUNC __PRETTY_FUNCTION__
140 #elif defined(_MSC_VER)
141 #define HB_FUNC __FUNCSIG__
143 #define HB_FUNC __func__
147 /* Return the number of 1 bits in mask.
149 * GCC 3.4 supports a "population count" builtin, which on many targets is
150 * implemented with a single instruction. There is a fallback definition
151 * in libgcc in case a target does not have one, which should be just as
152 * good as the open-coded solution below, (which is "HACKMEM 169").
154 static inline unsigned int
155 _hb_popcount32 (uint32_t mask)
157 #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
158 return __builtin_popcount (mask);
162 y = (mask >> 1) &033333333333;
163 y = mask - y - ((y >>1) & 033333333333);
164 return (((y + (y >> 3)) & 030707070707) % 077);
169 /* Multiplies a 16dot16 value by another value, then truncates the result */
170 #define _hb_16dot16_mul_round(A,B) (((int64_t) (A) * (B) + 0x8000) / 0x10000)
173 /* We need external help for these */
179 typedef int hb_atomic_int_t;
180 #define hb_atomic_int_fetch_and_add(AI, V) g_atomic_int_exchange_and_add (&(AI), V)
181 #define hb_atomic_int_get(AI) g_atomic_int_get (&(AI))
182 #define hb_atomic_int_set(AI, V) g_atomic_int_set (&(AI), V)
184 typedef GStaticMutex hb_mutex_t;
185 #define HB_MUTEX_INIT G_STATIC_MUTEX_INIT
186 #define hb_mutex_init(M) g_static_mutex_init (&M)
187 #define hb_mutex_lock(M) g_static_mutex_lock (&M)
188 #define hb_mutex_trylock(M) g_static_mutex_trylock (&M)
189 #define hb_mutex_unlock(M) g_static_mutex_unlock (&M)
194 #pragma message(__LOC__"Could not find any system to define platform macros, library will NOT be thread-safe")
196 #warning "Could not find any system to define platform macros, library will NOT be thread-safe"
199 typedef int hb_atomic_int_t;
200 #define hb_atomic_int_fetch_and_add(AI, V) ((AI) += (V), (AI) - (V))
201 #define hb_atomic_int_get(AI) (AI)
202 #define hb_atomic_int_set(AI, V) HB_STMT_START { (AI) = (V); } HB_STMT_END
204 typedef int hb_mutex_t;
205 #define HB_MUTEX_INIT 0
206 #define hb_mutex_init(M) HB_STMT_START { (M) = 0; } HB_STMT_END
207 #define hb_mutex_lock(M) HB_STMT_START { (M) = 1; } HB_STMT_END
208 #define hb_mutex_trylock(M) ((M) = 1, 1)
209 #define hb_mutex_unlock(M) HB_STMT_START { (M) = 0; } HB_STMT_END
214 /* Big-endian handling */
216 #define hb_be_uint16(v) ((uint16_t) ((((const uint8_t *)&(v))[0] << 8) + (((const uint8_t *)&(v))[1])))
218 #define hb_be_uint16_put(v,V) HB_STMT_START { v[0] = (V>>8); v[1] = (V); } HB_STMT_END
219 #define hb_be_uint16_get(v) (uint16_t) ((v[0] << 8) + v[1])
220 #define hb_be_uint16_cmp(a,b) (a[0] == b[0] && a[1] == b[1])
222 #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
223 #define hb_be_uint32_get(v) (uint32_t) ((v[0] << 24) + (v[1] << 16) + (v[2] << 8) + v[3])
224 #define hb_be_uint32_cmp(a,b) (a[0] == b[0] && a[1] == b[1] && a[2] == b[2] && a[3] == b[3])
233 static inline hb_bool_t /* always returns TRUE */
234 _hb_trace (const char *what,
235 const char *function,
238 unsigned int max_depth)
240 if (depth < max_depth)
241 fprintf (stderr, "%s(%p) %-*d-> %s\n", what, obj, depth, depth, function);
246 #include "hb-object-private.h"
248 #endif /* HB_PRIVATE_H */