2 * Copyright (C) 2007,2008,2009 Red Hat, Inc.
4 * This is part of HarfBuzz, an OpenType Layout engine 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 /* #define HB_DEBUG 1 */
47 #include "hb-common.h"
50 /* We need external help for these */
56 typedef int hb_atomic_int_t;
57 #define hb_atomic_int_fetch_and_add(AI, V) g_atomic_int_exchange_and_add (&(AI), V)
58 #define hb_atomic_int_get(AI) g_atomic_int_get (&(AI))
59 #define hb_atomic_int_set(AI, V) g_atomic_int_set (&(AI), V)
61 typedef GStaticMutex hb_mutex_t;
62 #define HB_MUTEX_INIT G_STATIC_MUTEX_INIT
63 #define hb_mutex_init(M) g_static_mutex_init (&M)
64 #define hb_mutex_lock(M) g_static_mutex_lock (&M)
65 #define hb_mutex_trylock(M) g_static_mutex_trylock (&M)
66 #define hb_mutex_unlock(M) g_static_mutex_unlock (&M)
69 #error "Could not find any system to define platform macros, see hb-private.h"
73 #define hb_be_uint16(v) ((uint16_t) ((((const uint8_t *)&(v))[0] >> 8) + (((const uint8_t *)&(v))[1] << 8)))
75 #define hb_be_uint8_put_unaligned(v,V) (v[0] = (V), 0)
76 #define hb_be_uint8_get_unaligned(v) (uint8_t) (v[0])
77 #define hb_be_uint8_cmp_unaligned(a,b) (a[0] == b[0])
78 #define hb_be_int8_put_unaligned hb_be_uint8_put_unaligned
79 #define hb_be_int8_get_unaligned (int8_t) hb_be_uint8_get_unaligned
80 #define hb_be_int8_cmp_unaligned hb_be_uint8_cmp_unaligned
82 #define hb_be_uint16_put_unaligned(v,V) (v[0] = (V>>8), v[1] = (V), 0)
83 #define hb_be_uint16_get_unaligned(v) (uint16_t) ((v[0] << 8) + v[1])
84 #define hb_be_uint16_cmp_unaligned(a,b) (a[0] == b[0] && a[1] == b[1])
85 #define hb_be_int16_put_unaligned hb_be_uint16_put_unaligned
86 #define hb_be_int16_get_unaligned (int16_t) hb_be_uint16_get_unaligned
87 #define hb_be_int16_cmp_unaligned hb_be_uint16_cmp_unaligned
89 #define hb_be_uint32_put_unaligned(v,V) (v[0] = (V>>24), v[1] = (V>>16), v[2] = (V>>8), v[3] = (V), 0)
90 #define hb_be_uint32_get_unaligned(v) (uint32_t) ((v[0] << 24) + (v[1] << 16) + (v[2] << 8) + v[3])
91 #define hb_be_uint32_cmp_unaligned(a,b) (a[0] == b[0] && a[1] == b[1] && a[2] == b[2] && a[3] == b[3])
92 #define hb_be_int32_put_unaligned hb_be_uint32_put_unaligned
93 #define hb_be_int32_get_unaligned (int32_t) hb_be_uint32_get_unaligned
94 #define hb_be_int32_cmp_unaligned hb_be_uint32_cmp_unaligned
100 #define MIN(a,b) ((a) < (b) ? (a) : (b))
103 # define HB_INTERNAL extern
107 # define NULL ((void *)0)
118 #define HB_STMT_START do
119 #define HB_STMT_END while (0)
121 #define _ASSERT_STATIC1(_line, _cond) typedef int _static_assert_on_line_##_line##_failed[(_cond)?1:-1]
122 #define _ASSERT_STATIC0(_line, _cond) _ASSERT_STATIC1 (_line, (_cond))
123 #define ASSERT_STATIC(_cond) _ASSERT_STATIC0 (__LINE__, (_cond))
125 #define ASSERT_SIZE(_type, _size) ASSERT_STATIC (sizeof (_type) == (_size))
128 #if defined(__GNUC__) && (__GNUC__ > 2) && defined(__OPTIMIZE__)
129 #define _HB_BOOLEAN_EXPR(expr) \
131 int _cairo_boolean_var_; \
133 _cairo_boolean_var_ = 1; \
135 _cairo_boolean_var_ = 0; \
136 _cairo_boolean_var_; \
138 #define HB_LIKELY(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 1))
139 #define HB_UNLIKELY(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 0))
141 #define HB_LIKELY(expr) (expr)
142 #define HB_UNLIKELY(expr) (expr)
147 #define __attribute__(x)
151 #define HB_GNUC_UNUSED __attribute__((unused))
152 #define HB_GNUC_PURE __attribute__((pure))
153 #define HB_GNUC_CONST __attribute__((const))
155 #define HB_GNUC_UNUSED
157 #define HB_GNUC_CONST
161 #if (defined(__WIN32__) && !defined(__WINE__)) || defined(_MSC_VER)
162 #define snprintf _snprintf
167 #define inline __inline
170 #ifdef __STRICT_ANSI__
172 #define inline __inline__
176 /* Return the number of 1 bits in mask.
178 * GCC 3.4 supports a "population count" builtin, which on many targets is
179 * implemented with a single instruction. There is a fallback definition
180 * in libgcc in case a target does not have one, which should be just as
181 * good as the open-coded solution below, (which is "HACKMEM 169").
183 static HB_GNUC_UNUSED inline unsigned int
184 _hb_popcount32 (uint32_t mask)
186 #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
187 return __builtin_popcount (mask);
191 y = (mask >> 1) &033333333333;
192 y = mask - y - ((y >>1) & 033333333333);
193 return (((y + (y >> 3)) & 030707070707) % 077);
198 /* Multiplies a 16dot16 value by another value, then truncates the result */
199 #define _hb_16dot16_mul_trunc(A,B) ((int64_t) (A) * (B) / 0x10000)
201 #include "hb-object-private.h"
203 #endif /* HB_PRIVATE_H */