harfbuzz/src/hb-private.hh

399 lines
9.5 KiB
C++
Raw Normal View History

2008-01-23 22:14:38 +01:00
/*
2011-04-21 23:14:28 +02:00
* Copyright © 2007,2008,2009 Red Hat, Inc.
* Copyright © 2011 Google, Inc.
2008-01-23 22:14:38 +01:00
*
2010-04-22 06:11:43 +02:00
* This is part of HarfBuzz, a text shaping library.
2008-01-23 22:14:38 +01:00
*
* Permission is hereby granted, without written agreement and without
* license or royalty fees, to use, copy, modify, and distribute this
* software and its documentation for any purpose, provided that the
* above copyright notice and the following two paragraphs appear in
* all copies of this software.
*
* IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
* ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
* IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
* DAMAGE.
*
* THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
* BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
* FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
* ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
* PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
*
* Red Hat Author(s): Behdad Esfahbod
2011-04-21 23:14:28 +02:00
* Google Author(s): Behdad Esfahbod
2008-01-23 22:14:38 +01:00
*/
#ifndef HB_PRIVATE_HH
#define HB_PRIVATE_HH
2006-12-28 12:42:37 +01:00
2009-08-02 02:46:02 +02:00
#if HAVE_CONFIG_H
#include "config.h"
#endif
2009-05-21 18:46:29 +02:00
2010-04-29 07:40:26 +02:00
#include "hb-common.h"
2009-08-05 04:35:36 +02:00
2009-05-21 18:46:29 +02:00
#include <stdlib.h>
2009-07-30 21:33:57 +02:00
#include <string.h>
#include <assert.h>
2010-04-28 19:18:41 +02:00
/* We only use these two for debug output. However, the debug code is
* always seen by the compiler (and optimized out in non-debug builds.
* If including these becomes a problem, we can start thinking about
* someway around that. */
#include <stdio.h>
#include <errno.h>
2009-05-21 18:46:29 +02:00
2010-07-23 21:11:18 +02:00
HB_BEGIN_DECLS
2010-04-29 07:40:26 +02:00
/* Essentials */
#ifndef NULL
# define NULL ((void *) 0)
#endif
#undef FALSE
#define FALSE 0
#undef TRUE
#define TRUE 1
2009-08-02 02:46:02 +02:00
2009-08-06 18:32:35 +02:00
2009-05-21 18:46:29 +02:00
/* Basics */
HB_END_DECLS
2009-05-21 18:46:29 +02:00
#undef MIN
template <typename Type> static inline Type MIN (const Type &a, const Type &b) { return a < b ? a : b; }
2008-01-24 00:02:28 +01:00
#undef MAX
template <typename Type> static inline Type MAX (const Type &a, const Type &b) { return a > b ? a : b; }
HB_BEGIN_DECLS
2009-11-05 00:15:59 +01:00
#undef ARRAY_LENGTH
#define ARRAY_LENGTH(__array) ((signed int) (sizeof (__array) / sizeof (__array[0])))
2009-08-02 01:30:31 +02:00
#define HB_STMT_START do
#define HB_STMT_END while (0)
2006-12-28 12:42:37 +01:00
2008-01-23 06:20:48 +01:00
#define _ASSERT_STATIC1(_line, _cond) typedef int _static_assert_on_line_##_line##_failed[(_cond)?1:-1]
#define _ASSERT_STATIC0(_line, _cond) _ASSERT_STATIC1 (_line, (_cond))
#define ASSERT_STATIC(_cond) _ASSERT_STATIC0 (__LINE__, (_cond))
#define ASSERT_STATIC_EXPR(_cond) ((void) sizeof (char[(_cond) ? 1 : -1]))
2010-04-29 07:40:26 +02:00
2011-04-11 17:47:14 +02:00
/* Lets assert int types. Saves trouble down the road. */
ASSERT_STATIC (sizeof (int8_t) == 1);
ASSERT_STATIC (sizeof (uint8_t) == 1);
ASSERT_STATIC (sizeof (int16_t) == 2);
ASSERT_STATIC (sizeof (uint16_t) == 2);
ASSERT_STATIC (sizeof (int32_t) == 4);
ASSERT_STATIC (sizeof (uint32_t) == 4);
ASSERT_STATIC (sizeof (int64_t) == 8);
ASSERT_STATIC (sizeof (uint64_t) == 8);
2011-04-11 18:29:31 +02:00
ASSERT_STATIC (sizeof (hb_codepoint_t) == 4);
ASSERT_STATIC (sizeof (hb_position_t) == 4);
ASSERT_STATIC (sizeof (hb_mask_t) == 4);
ASSERT_STATIC (sizeof (hb_var_int_t) == 4);
2011-04-11 17:47:14 +02:00
2010-04-29 07:40:26 +02:00
/* Misc */
2009-05-21 18:46:29 +02:00
2009-08-02 02:46:02 +02:00
#if defined(__GNUC__) && (__GNUC__ > 2) && defined(__OPTIMIZE__)
#define _HB_BOOLEAN_EXPR(expr) ((expr) ? 1 : 0)
#define likely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 1))
#define unlikely(expr) (__builtin_expect (_HB_BOOLEAN_EXPR(expr), 0))
2009-08-02 02:46:02 +02:00
#else
#define likely(expr) (expr)
#define unlikely(expr) (expr)
2009-08-02 02:46:02 +02:00
#endif
#ifndef __GNUC__
#undef __attribute__
#define __attribute__(x)
#endif
#if __GNUC__ >= 3
2010-04-29 19:56:44 +02:00
#define HB_PURE_FUNC __attribute__((pure))
#define HB_CONST_FUNC __attribute__((const))
2009-08-02 02:46:02 +02:00
#else
2010-04-29 19:56:44 +02:00
#define HB_PURE_FUNC
#define HB_CONST_FUNC
2009-08-02 02:46:02 +02:00
#endif
#if __GNUC__ >= 4
2010-04-29 19:56:44 +02:00
#define HB_UNUSED __attribute__((unused))
#else
2010-04-29 19:56:44 +02:00
#define HB_UNUSED
#endif
2009-08-02 02:46:02 +02:00
2010-05-13 05:22:55 +02:00
#ifndef HB_INTERNAL
# define HB_INTERNAL __attribute__((__visibility__("hidden")))
2010-05-13 05:22:55 +02:00
#endif
2009-08-02 02:46:02 +02:00
#if (defined(__WIN32__) && !defined(__WINE__)) || defined(_MSC_VER)
#define snprintf _snprintf
#endif
#ifdef _MSC_VER
#undef inline
#define inline __inline
#endif
#ifdef __STRICT_ANSI__
#undef inline
#define inline __inline__
#endif
#if __GNUC__ >= 3
#define HB_FUNC __PRETTY_FUNCTION__
#elif defined(_MSC_VER)
#define HB_FUNC __FUNCSIG__
#else
#define HB_FUNC __func__
#endif
2010-05-20 16:31:12 +02:00
/* Return the number of 1 bits in mask. */
2010-05-11 06:11:36 +02:00
static inline HB_CONST_FUNC unsigned int
2009-05-21 18:46:29 +02:00
_hb_popcount32 (uint32_t mask)
{
#if __GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 4)
2010-05-20 16:31:12 +02:00
return __builtin_popcount (mask);
2009-05-21 18:46:29 +02:00
#else
2010-05-20 16:31:12 +02:00
/* "HACKMEM 169" */
register uint32_t y;
y = (mask >> 1) &033333333333;
y = mask - y - ((y >>1) & 033333333333);
return (((y + (y >> 3)) & 030707070707) % 077);
2009-05-21 18:46:29 +02:00
#endif
}
2010-05-20 16:31:12 +02:00
/* Returns the number of bits needed to store number */
static inline HB_CONST_FUNC unsigned int
_hb_bit_storage (unsigned int number)
{
#if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
return likely (number) ? (sizeof (unsigned int) * 8 - __builtin_clz (number)) : 0;
2010-05-20 16:31:12 +02:00
#else
register unsigned int n_bits = 0;
while (number) {
n_bits++;
number >>= 1;
}
return n_bits;
#endif
}
2009-08-02 02:46:02 +02:00
/* Returns the number of zero bits in the least significant side of number */
static inline HB_CONST_FUNC unsigned int
_hb_ctz (unsigned int number)
{
#if defined(__GNUC__) && (__GNUC__ >= 4) && defined(__OPTIMIZE__)
return likely (number) ? __builtin_ctz (number) : 0;
#else
register unsigned int n_bits = 0;
if (unlikely (!number)) return 0;
while (!(number & 1)) {
n_bits++;
number >>= 1;
}
return n_bits;
#endif
}
2011-04-28 22:01:01 +02:00
static inline bool
_hb_unsigned_int_mul_overflows (unsigned int count, unsigned int size)
{
return (size > 0) && (count >= ((unsigned int) -1) / size);
}
2010-10-09 01:43:48 +02:00
/* Type of bsearch() / qsort() compare function */
typedef int (*hb_compare_func_t) (const void *, const void *);
2011-04-28 03:45:51 +02:00
HB_END_DECLS
/* arrays and maps */
template <typename Type, unsigned int StaticSize>
2011-05-05 19:24:07 +02:00
struct hb_prealloced_array_t {
2011-04-28 03:45:51 +02:00
unsigned int len;
unsigned int allocated;
Type *array;
Type static_array[StaticSize];
inline Type& operator [] (unsigned int i)
{
return array[i];
}
inline Type *push (void)
{
if (!array) {
array = static_array;
allocated = ARRAY_LENGTH (static_array);
}
if (likely (len < allocated))
return &array[len++];
2011-04-28 03:45:51 +02:00
/* Need to reallocate */
unsigned int new_allocated = allocated + (allocated >> 1) + 8;
Type *new_array = NULL;
2011-04-28 03:45:51 +02:00
if (array == static_array) {
new_array = (Type *) calloc (new_allocated, sizeof (Type));
if (new_array)
2011-04-28 03:45:51 +02:00
memcpy (new_array, array, len * sizeof (Type));
} else {
2011-04-28 22:01:01 +02:00
bool overflows = (new_allocated < allocated) || _hb_unsigned_int_mul_overflows (new_allocated, sizeof (Type));
if (likely (!overflows)) {
2011-04-28 03:45:51 +02:00
new_array = (Type *) realloc (array, new_allocated * sizeof (Type));
}
}
if (unlikely (!new_array))
2011-04-28 03:45:51 +02:00
return NULL;
array = new_array;
allocated = new_allocated;
return &array[len++];
2011-04-28 03:45:51 +02:00
}
inline void pop (void)
{
len--;
/* TODO: shrink array if needed */
}
};
template <typename Type>
2011-05-05 19:24:07 +02:00
struct hb_array_t : hb_prealloced_array_t<Type, 2> {};
template <typename item_t>
struct hb_set_t
2011-04-28 03:45:51 +02:00
{
hb_array_t <item_t> items;
private:
template <typename T>
inline item_t *find (T v) {
2011-04-28 03:45:51 +02:00
for (unsigned int i = 0; i < items.len; i++)
if (items[i] == v)
2011-04-28 03:45:51 +02:00
return &items[i];
return NULL;
}
public:
template <typename T>
inline bool insert (T v)
2011-04-28 03:45:51 +02:00
{
item_t *item = find (v);
2011-04-28 03:45:51 +02:00
if (item)
item->finish ();
else
item = items.push ();
if (unlikely (!item)) return false;
*item = v;
2011-04-28 03:45:51 +02:00
return true;
}
template <typename T>
inline void remove (T v)
2011-04-28 03:45:51 +02:00
{
item_t *item = find (v);
2011-04-28 03:45:51 +02:00
if (!item) return;
2011-04-28 03:45:51 +02:00
item->finish ();
2011-05-03 01:54:17 +02:00
*item = items[items.len - 1];
2011-04-28 03:45:51 +02:00
items.pop ();
}
template <typename T>
inline item_t *get (T v)
2011-04-28 03:45:51 +02:00
{
return find (v);
}
void finish (void) {
for (unsigned i = 0; i < items.len; i++)
items[i].finish ();
2011-04-28 03:45:51 +02:00
}
2011-04-28 03:45:51 +02:00
};
HB_BEGIN_DECLS
2010-04-21 08:12:45 +02:00
/* Big-endian handling */
static inline uint16_t hb_be_uint16 (const uint16_t v)
{
const uint8_t *V = (const uint8_t *) &v;
return (uint16_t) (V[0] << 8) + V[1];
}
2010-04-21 08:14:44 +02:00
2010-04-21 09:11:46 +02:00
#define hb_be_uint16_put(v,V) HB_STMT_START { v[0] = (V>>8); v[1] = (V); } HB_STMT_END
2010-04-21 08:14:44 +02:00
#define hb_be_uint16_get(v) (uint16_t) ((v[0] << 8) + v[1])
#define hb_be_uint16_eq(a,b) (a[0] == b[0] && a[1] == b[1])
2010-04-21 08:14:44 +02:00
2010-04-21 09:11:46 +02:00
#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
2010-04-21 08:14:44 +02:00
#define hb_be_uint32_get(v) (uint32_t) ((v[0] << 24) + (v[1] << 16) + (v[2] << 8) + v[3])
#define hb_be_uint32_eq(a,b) (a[0] == b[0] && a[1] == b[1] && a[2] == b[2] && a[3] == b[3])
2010-04-21 08:12:45 +02:00
/* ASCII tag/character handling */
2011-04-11 19:16:08 +02:00
static inline unsigned char ISALPHA (unsigned char c)
{ return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'); }
static inline unsigned char ISALNUM (unsigned char c)
{ return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9'); }
static inline unsigned char TOUPPER (unsigned char c)
{ return (c >= 'a' && c <= 'z') ? c - 'a' + 'A' : c; }
static inline unsigned char TOLOWER (unsigned char c)
{ return (c >= 'A' && c <= 'Z') ? c - 'A' + 'a' : c; }
2011-04-11 19:16:08 +02:00
#define HB_TAG_CHAR4(s) (HB_TAG(((const char *) s)[0], \
((const char *) s)[1], \
((const char *) s)[2], \
((const char *) s)[3]))
2011-04-11 19:16:08 +02:00
2010-04-29 07:40:26 +02:00
/* Debug */
#ifndef HB_DEBUG
#define HB_DEBUG 0
#endif
static inline bool /* always returns TRUE */
2010-04-29 07:40:26 +02:00
_hb_trace (const char *what,
const char *function,
const void *obj,
unsigned int depth,
unsigned int max_depth)
{
(void) ((depth < max_depth) && fprintf (stderr, "%s(%p) %-*d-> %s\n", what, obj, depth, depth, function));
2010-04-29 07:40:26 +02:00
return TRUE;
}
2010-04-21 08:12:45 +02:00
2010-07-23 21:11:18 +02:00
HB_END_DECLS
#endif /* HB_PRIVATE_HH */