2 * Copyright © 2007,2008,2009 Red Hat, Inc.
3 * Copyright © 2011 Google, Inc.
5 * This is part of HarfBuzz, a text shaping library.
7 * Permission is hereby granted, without written agreement and without
8 * license or royalty fees, to use, copy, modify, and distribute this
9 * software and its documentation for any purpose, provided that the
10 * above copyright notice and the following two paragraphs appear in
11 * all copies of this software.
13 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
14 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
15 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
16 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
19 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
20 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
21 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
22 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
23 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
25 * Red Hat Author(s): Behdad Esfahbod
26 * Google Author(s): Behdad Esfahbod
36 #include "hb-common.h"
42 /* We only use these two for debug output. However, the debug code is
43 * always seen by the compiler (and optimized out in non-debug builds.
44 * If including these becomes a problem, we can start thinking about
45 * someway around that. */
55 # define NULL ((void *) 0)
70 template <typename Type> static inline Type MIN (const Type &a, const Type &b) { return a < b ? a : b; }
73 template <typename Type> static inline Type MAX (const Type &a, const Type &b) { return a > b ? a : b; }
78 #define ARRAY_LENGTH(__array) ((signed int) (sizeof (__array) / sizeof (__array[0])))
80 #define HB_STMT_START do
81 #define HB_STMT_END while (0)
83 #define _ASSERT_STATIC1(_line, _cond) typedef int _static_assert_on_line_##_line##_failed[(_cond)?1:-1]
84 #define _ASSERT_STATIC0(_line, _cond) _ASSERT_STATIC1 (_line, (_cond))
85 #define ASSERT_STATIC(_cond) _ASSERT_STATIC0 (__LINE__, (_cond))
87 #define ASSERT_STATIC_EXPR(_cond) ((void) sizeof (char[(_cond) ? 1 : -1]))
90 /* Lets assert int types. Saves trouble down the road. */
92 ASSERT_STATIC (sizeof (int8_t) == 1);
93 ASSERT_STATIC (sizeof (uint8_t) == 1);
94 ASSERT_STATIC (sizeof (int16_t) == 2);
95 ASSERT_STATIC (sizeof (uint16_t) == 2);
96 ASSERT_STATIC (sizeof (int32_t) == 4);
97 ASSERT_STATIC (sizeof (uint32_t) == 4);
98 ASSERT_STATIC (sizeof (int64_t) == 8);
99 ASSERT_STATIC (sizeof (uint64_t) == 8);
101 ASSERT_STATIC (sizeof (hb_codepoint_t) == 4);
102 ASSERT_STATIC (sizeof (hb_position_t) == 4);
103 ASSERT_STATIC (sizeof (hb_mask_t) == 4);
104 ASSERT_STATIC (sizeof (hb_var_int_t) == 4);
109 #if defined(__GNUC__) && (__GNUC__ > 2) && defined(__OPTIMIZE__)
110 #define _HB_BOOLEAN_EXPR(expr) ((expr) ? 1 : 0)
111 #define likely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 1))
112 #define unlikely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 0))
114 #define likely(expr) (expr)
115 #define unlikely(expr) (expr)
120 #define __attribute__(x)
124 #define HB_PURE_FUNC __attribute__((pure))
125 #define HB_CONST_FUNC __attribute__((const))
128 #define HB_CONST_FUNC
131 #define HB_UNUSED __attribute__((unused))
137 # define HB_INTERNAL __attribute__((__visibility__("hidden")))
141 #if (defined(__WIN32__) && !defined(__WINE__)) || defined(_MSC_VER)
142 #define snprintf _snprintf
147 #define inline __inline
150 #ifdef __STRICT_ANSI__
152 #define inline __inline__
157 #define HB_FUNC __PRETTY_FUNCTION__
158 #elif defined(_MSC_VER)
159 #define HB_FUNC __FUNCSIG__
161 #define HB_FUNC __func__
165 /* Return the number of 1 bits in mask. */
166 static inline HB_CONST_FUNC unsigned int
167 _hb_popcount32 (uint32_t mask)
169 #if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
170 return __builtin_popcount (mask);
174 y = (mask >> 1) &033333333333;
175 y = mask - y - ((y >>1) & 033333333333);
176 return (((y + (y >> 3)) & 030707070707) % 077);
180 /* Returns the number of bits needed to store number */
181 static inline HB_CONST_FUNC unsigned int
182 _hb_bit_storage (unsigned int number)
184 #if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
185 return likely (number) ? (sizeof (unsigned int) * 8 - __builtin_clz (number)) : 0;
187 register unsigned int n_bits = 0;
196 /* Returns the number of zero bits in the least significant side of number */
197 static inline HB_CONST_FUNC unsigned int
198 _hb_ctz (unsigned int number)
200 #if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
201 return likely (number) ? __builtin_ctz (number) : 0;
203 register unsigned int n_bits = 0;
204 if (unlikely (!number)) return 0;
205 while (!(number & 1)) {
214 _hb_unsigned_int_mul_overflows (unsigned int count, unsigned int size)
216 return (size > 0) && (count >= ((unsigned int) -1) / size);
220 /* Type of bsearch() / qsort() compare function */
221 typedef int (*hb_compare_func_t) (const void *, const void *);
227 /* arrays and maps */
230 template <typename Type, unsigned int StaticSize>
231 struct hb_prealloced_array_t {
234 unsigned int allocated;
236 Type static_array[StaticSize];
238 inline Type& operator [] (unsigned int i)
243 inline Type *push (void)
246 array = static_array;
247 allocated = ARRAY_LENGTH (static_array);
249 if (likely (len < allocated))
250 return &array[len++];
252 /* Need to reallocate */
253 unsigned int new_allocated = allocated + (allocated >> 1) + 8;
254 Type *new_array = NULL;
256 if (array == static_array) {
257 new_array = (Type *) calloc (new_allocated, sizeof (Type));
259 memcpy (new_array, array, len * sizeof (Type));
261 bool overflows = (new_allocated < allocated) || _hb_unsigned_int_mul_overflows (new_allocated, sizeof (Type));
262 if (likely (!overflows)) {
263 new_array = (Type *) realloc (array, new_allocated * sizeof (Type));
267 if (unlikely (!new_array))
271 allocated = new_allocated;
272 return &array[len++];
275 inline void pop (void)
278 /* TODO: shrink array if needed */
281 inline void shrink (unsigned int l)
285 /* TODO: shrink array if needed */
288 template <typename T>
289 inline Type *find (T v) {
290 for (unsigned int i = 0; i < len; i++)
295 template <typename T>
296 inline const Type *find (T v) const {
297 for (unsigned int i = 0; i < len; i++)
303 inline void sort (void)
305 qsort (array, len, sizeof (Type), (hb_compare_func_t) Type::cmp);
308 template <typename T>
309 inline Type *bsearch (T *key)
311 return (Type *) ::bsearch (key, array, len, sizeof (Type), (hb_compare_func_t) Type::cmp);
313 template <typename T>
314 inline const Type *bsearch (T *key) const
316 return (const Type *) ::bsearch (key, array, len, sizeof (Type), (hb_compare_func_t) Type::cmp);
320 template <typename Type>
321 struct hb_array_t : hb_prealloced_array_t<Type, 2> {};
324 template <typename item_t>
327 hb_array_t <item_t> items;
331 template <typename T>
332 inline bool insert (T v)
334 item_t *item = items.find (v);
338 item = items.push ();
339 if (unlikely (!item)) return false;
344 template <typename T>
345 inline void remove (T v)
347 item_t *item = items.find (v);
351 *item = items[items.len - 1];
355 template <typename T>
356 inline item_t *get (T v)
358 return items.find (v);
362 for (unsigned i = 0; i < items.len; i++)
372 /* Big-endian handling */
374 static inline uint16_t hb_be_uint16 (const uint16_t v)
376 const uint8_t *V = (const uint8_t *) &v;
377 return (uint16_t) (V[0] << 8) + V[1];
380 #define hb_be_uint16_put(v,V) HB_STMT_START { v[0] = (V>>8); v[1] = (V); } HB_STMT_END
381 #define hb_be_uint16_get(v) (uint16_t) ((v[0] << 8) + v[1])
382 #define hb_be_uint16_eq(a,b) (a[0] == b[0] && a[1] == b[1])
384 #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
385 #define hb_be_uint32_get(v) (uint32_t) ((v[0] << 24) + (v[1] << 16) + (v[2] << 8) + v[3])
386 #define hb_be_uint32_eq(a,b) (a[0] == b[0] && a[1] == b[1] && a[2] == b[2] && a[3] == b[3])
389 /* ASCII tag/character handling */
391 static inline unsigned char ISALPHA (unsigned char c)
392 { return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'); }
393 static inline unsigned char ISALNUM (unsigned char c)
394 { return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9'); }
395 static inline unsigned char TOUPPER (unsigned char c)
396 { return (c >= 'a' && c <= 'z') ? c - 'a' + 'A' : c; }
397 static inline unsigned char TOLOWER (unsigned char c)
398 { return (c >= 'A' && c <= 'Z') ? c - 'A' + 'a' : c; }
400 #define HB_TAG_CHAR4(s) (HB_TAG(((const char *) s)[0], \
401 ((const char *) s)[1], \
402 ((const char *) s)[2], \
403 ((const char *) s)[3]))
412 static inline bool /* always returns TRUE */
413 _hb_trace (const char *what,
414 const char *function,
417 unsigned int max_depth)
419 (void) ((depth < max_depth) && fprintf (stderr, "%s(%p) %-*d-> %s\n", what, obj, depth, depth, function));
426 #endif /* HB_PRIVATE_HH */