2008-01-23 22:14:38 +01:00
|
|
|
/*
|
2011-04-21 23:14:28 +02:00
|
|
|
* Copyright © 2007,2008,2009 Red Hat, Inc.
|
2012-05-11 01:25:34 +02:00
|
|
|
* Copyright © 2011,2012 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
|
|
|
*/
|
|
|
|
|
2011-04-21 00:50:27 +02:00
|
|
|
#ifndef HB_PRIVATE_HH
|
|
|
|
#define HB_PRIVATE_HH
|
2006-12-28 12:42:37 +01:00
|
|
|
|
2011-09-16 22:40:44 +02:00
|
|
|
#ifdef HAVE_CONFIG_H
|
2009-08-02 02:46:02 +02:00
|
|
|
#include "config.h"
|
|
|
|
#endif
|
2009-05-21 18:46:29 +02:00
|
|
|
|
2012-04-12 19:17:44 +02:00
|
|
|
#include "hb.h"
|
|
|
|
#define HB_H_IN
|
2012-04-23 19:20:52 +02:00
|
|
|
#ifdef HAVE_OT
|
|
|
|
#include "hb-ot.h"
|
2012-04-12 19:17:44 +02:00
|
|
|
#define HB_OT_H_IN
|
2012-04-23 19:20:52 +02:00
|
|
|
#endif
|
2009-08-05 04:35:36 +02:00
|
|
|
|
2009-05-21 18:46:29 +02:00
|
|
|
#include <stdlib.h>
|
2011-07-28 22:48:43 +02:00
|
|
|
#include <stddef.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. */
|
2009-08-05 21:20:34 +02:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <errno.h>
|
2011-07-26 02:25:44 +02:00
|
|
|
#include <stdarg.h>
|
2009-05-21 18:46:29 +02:00
|
|
|
|
2010-07-23 21:11:18 +02:00
|
|
|
|
2015-10-03 14:20:55 +02:00
|
|
|
/* Compile-time custom allocator support. */
|
|
|
|
|
|
|
|
#if defined(hb_malloc_impl) \
|
|
|
|
&& defined(hb_calloc_impl) \
|
|
|
|
&& defined(hb_realloc_impl) \
|
|
|
|
&& defined(hb_free_impl)
|
2015-10-12 23:21:52 +02:00
|
|
|
extern "C" void* hb_malloc_impl(size_t size);
|
|
|
|
extern "C" void* hb_calloc_impl(size_t nmemb, size_t size);
|
|
|
|
extern "C" void* hb_realloc_impl(void *ptr, size_t size);
|
|
|
|
extern "C" void hb_free_impl(void *ptr);
|
2015-10-03 14:20:55 +02:00
|
|
|
#define malloc hb_malloc_impl
|
|
|
|
#define calloc hb_calloc_impl
|
|
|
|
#define realloc hb_realloc_impl
|
|
|
|
#define free hb_free_impl
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
2014-06-03 22:59:09 +02:00
|
|
|
/* Compiler attributes */
|
2010-04-29 07:40:26 +02:00
|
|
|
|
|
|
|
|
2014-06-03 22:59:09 +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))
|
|
|
|
#else
|
|
|
|
#define likely(expr) (expr)
|
|
|
|
#define unlikely(expr) (expr)
|
2010-04-29 07:40:26 +02:00
|
|
|
#endif
|
|
|
|
|
2014-06-03 22:59:09 +02:00
|
|
|
#ifndef __GNUC__
|
|
|
|
#undef __attribute__
|
|
|
|
#define __attribute__(x)
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if __GNUC__ >= 3
|
|
|
|
#define HB_PURE_FUNC __attribute__((pure))
|
|
|
|
#define HB_CONST_FUNC __attribute__((const))
|
|
|
|
#define HB_PRINTF_FUNC(format_idx, arg_idx) __attribute__((__format__ (__printf__, format_idx, arg_idx)))
|
|
|
|
#else
|
|
|
|
#define HB_PURE_FUNC
|
|
|
|
#define HB_CONST_FUNC
|
|
|
|
#define HB_PRINTF_FUNC(format_idx, arg_idx)
|
|
|
|
#endif
|
|
|
|
#if __GNUC__ >= 4
|
|
|
|
#define HB_UNUSED __attribute__((unused))
|
|
|
|
#else
|
|
|
|
#define HB_UNUSED
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef HB_INTERNAL
|
2014-07-19 22:52:32 +02:00
|
|
|
# if !defined(__MINGW32__) && !defined(__CYGWIN__)
|
2014-06-03 22:59:09 +02:00
|
|
|
# define HB_INTERNAL __attribute__((__visibility__("hidden")))
|
|
|
|
# else
|
|
|
|
# define HB_INTERNAL
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if __GNUC__ >= 3
|
|
|
|
#define HB_FUNC __PRETTY_FUNCTION__
|
|
|
|
#elif defined(_MSC_VER)
|
|
|
|
#define HB_FUNC __FUNCSIG__
|
|
|
|
#else
|
|
|
|
#define HB_FUNC __func__
|
|
|
|
#endif
|
2009-08-06 18:32:35 +02:00
|
|
|
|
2015-10-21 15:04:28 +02:00
|
|
|
/*
|
|
|
|
* Borrowed from https://bugzilla.mozilla.org/show_bug.cgi?id=1215411
|
|
|
|
* HB_FALLTHROUGH is an annotation to suppress compiler warnings about switch
|
|
|
|
* cases that fall through without a break or return statement. HB_FALLTHROUGH
|
|
|
|
* is only needed on cases that have code:
|
|
|
|
*
|
|
|
|
* switch (foo) {
|
|
|
|
* case 1: // These cases have no code. No fallthrough annotations are needed.
|
|
|
|
* case 2:
|
|
|
|
* case 3:
|
|
|
|
* foo = 4; // This case has code, so a fallthrough annotation is needed:
|
|
|
|
* HB_FALLTHROUGH;
|
|
|
|
* default:
|
|
|
|
* return foo;
|
|
|
|
* }
|
|
|
|
*/
|
|
|
|
#if defined(__clang__) && __cplusplus >= 201103L
|
|
|
|
/* clang's fallthrough annotations are only available starting in C++11. */
|
|
|
|
# define HB_FALLTHROUGH [[clang::fallthrough]]
|
|
|
|
#elif defined(_MSC_VER)
|
|
|
|
/*
|
|
|
|
* MSVC's __fallthrough annotations are checked by /analyze (Code Analysis):
|
|
|
|
* https://msdn.microsoft.com/en-us/library/ms235402%28VS.80%29.aspx
|
|
|
|
*/
|
|
|
|
# include <sal.h>
|
|
|
|
# define HB_FALLTHROUGH __fallthrough
|
|
|
|
#else
|
|
|
|
# define HB_FALLTHROUGH /* FALLTHROUGH */
|
|
|
|
#endif
|
|
|
|
|
2014-07-21 17:12:54 +02:00
|
|
|
#if defined(_WIN32) || defined(__CYGWIN__)
|
2014-07-19 22:32:04 +02:00
|
|
|
/* We need Windows Vista for both Uniscribe backend and for
|
|
|
|
* MemoryBarrier. We don't support compiling on Windows XP,
|
|
|
|
* though we run on it fine. */
|
|
|
|
# if defined(_WIN32_WINNT) && _WIN32_WINNT < 0x0600
|
|
|
|
# undef _WIN32_WINNT
|
|
|
|
# endif
|
|
|
|
# ifndef _WIN32_WINNT
|
|
|
|
# define _WIN32_WINNT 0x0600
|
|
|
|
# endif
|
2014-08-15 20:28:04 +02:00
|
|
|
# ifndef WIN32_LEAN_AND_MEAN
|
|
|
|
# define WIN32_LEAN_AND_MEAN 1
|
|
|
|
# endif
|
|
|
|
# ifndef STRICT
|
|
|
|
# define STRICT 1
|
|
|
|
# endif
|
2012-11-23 20:21:35 +01:00
|
|
|
|
2015-01-25 06:50:51 +01:00
|
|
|
# if defined(_WIN32_WCE)
|
|
|
|
/* Some things not defined on Windows CE. */
|
2015-04-01 20:04:33 +02:00
|
|
|
# define strdup _strdup
|
2015-01-25 06:50:51 +01:00
|
|
|
# define getenv(Name) NULL
|
2015-04-10 15:18:01 +02:00
|
|
|
# if _WIN32_WCE < 0x800
|
|
|
|
# define setlocale(Category, Locale) "C"
|
2014-08-11 00:04:50 +02:00
|
|
|
static int errno = 0; /* Use something better? */
|
2015-04-10 15:18:01 +02:00
|
|
|
# endif
|
2015-01-25 06:50:51 +01:00
|
|
|
# elif defined(WINAPI_FAMILY) && (WINAPI_FAMILY==WINAPI_FAMILY_PC_APP || WINAPI_FAMILY==WINAPI_FAMILY_PHONE_APP)
|
|
|
|
# define getenv(Name) NULL
|
|
|
|
# endif
|
2015-04-01 20:05:59 +02:00
|
|
|
# if defined(_MSC_VER) && _MSC_VER < 1900
|
2015-01-25 06:50:51 +01:00
|
|
|
# define snprintf _snprintf
|
2015-06-23 15:07:17 +02:00
|
|
|
# elif defined(_MSC_VER) && _MSC_VER >= 1900
|
2015-06-23 15:09:24 +02:00
|
|
|
# /* Covers VC++ Error for strdup being a deprecated POSIX name and to instead use _strdup instead */
|
2015-06-23 15:07:17 +02:00
|
|
|
# define strdup _strdup
|
2015-01-25 06:50:51 +01:00
|
|
|
# endif
|
2014-08-11 00:04:50 +02:00
|
|
|
#endif
|
|
|
|
|
2014-08-06 19:34:49 +02:00
|
|
|
#if HAVE_ATEXIT
|
|
|
|
/* atexit() is only safe to be called from shared libraries on certain
|
|
|
|
* platforms. Whitelist.
|
|
|
|
* https://bugs.freedesktop.org/show_bug.cgi?id=82246 */
|
|
|
|
# if defined(__linux) && defined(__GLIBC_PREREQ)
|
|
|
|
# if __GLIBC_PREREQ(2,3)
|
|
|
|
/* From atexit() manpage, it's safe with glibc 2.2.3 on Linux. */
|
|
|
|
# define HB_USE_ATEXIT 1
|
|
|
|
# endif
|
|
|
|
# elif defined(_MSC_VER) || defined(__MINGW32__)
|
|
|
|
/* For MSVC:
|
|
|
|
* http://msdn.microsoft.com/en-ca/library/tze57ck3.aspx
|
|
|
|
* http://msdn.microsoft.com/en-ca/library/zk17ww08.aspx
|
|
|
|
* mingw32 headers say atexit is safe to use in shared libraries.
|
|
|
|
*/
|
|
|
|
# define HB_USE_ATEXIT 1
|
|
|
|
# elif defined(__ANDROID__) && (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6))
|
|
|
|
/* This was fixed in Android NKD r8 or r8b:
|
|
|
|
* https://code.google.com/p/android/issues/detail?id=6455
|
|
|
|
* which introduced GCC 4.6:
|
|
|
|
* https://developer.android.com/tools/sdk/ndk/index.html
|
|
|
|
*/
|
|
|
|
# define HB_USE_ATEXIT 1
|
|
|
|
# endif
|
|
|
|
#endif
|
2012-11-23 20:21:35 +01:00
|
|
|
|
2009-05-21 18:46:29 +02:00
|
|
|
/* Basics */
|
|
|
|
|
2011-04-27 07:49:03 +02:00
|
|
|
|
2014-06-03 22:59:09 +02:00
|
|
|
#ifndef NULL
|
|
|
|
# define NULL ((void *) 0)
|
|
|
|
#endif
|
|
|
|
|
2009-05-21 18:46:29 +02:00
|
|
|
#undef MIN
|
2012-08-05 01:43:18 +02:00
|
|
|
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
|
|
|
|
2009-11-05 01:45:39 +01:00
|
|
|
#undef MAX
|
2012-08-05 01:43:18 +02:00
|
|
|
template <typename Type>
|
|
|
|
static inline Type MAX (const Type &a, const Type &b) { return a > b ? a : b; }
|
2011-04-27 07:49:03 +02:00
|
|
|
|
2013-11-12 23:22:49 +01:00
|
|
|
static inline unsigned int DIV_CEIL (const unsigned int a, unsigned int b)
|
|
|
|
{ return (a + (b - 1)) / b; }
|
|
|
|
|
2009-11-05 01:45:39 +01:00
|
|
|
|
2009-11-05 00:15:59 +01:00
|
|
|
#undef ARRAY_LENGTH
|
2012-08-05 01:43:18 +02:00
|
|
|
template <typename Type, unsigned int n>
|
2012-12-06 00:46:04 +01:00
|
|
|
static inline unsigned int ARRAY_LENGTH (const Type (&)[n]) { return n; }
|
2012-09-06 04:19:28 +02:00
|
|
|
/* A const version, but does not detect erratically being called on pointers. */
|
|
|
|
#define ARRAY_LENGTH_CONST(__array) ((signed int) (sizeof (__array) / sizeof (__array[0])))
|
2008-01-23 21:50:38 +01:00
|
|
|
|
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
|
|
|
|
2014-06-03 22:59:41 +02:00
|
|
|
#define _ASSERT_STATIC1(_line, _cond) HB_UNUSED typedef int _static_assert_on_line_##_line##_failed[(_cond)?1:-1]
|
2012-06-06 17:29:25 +02:00
|
|
|
#define _ASSERT_STATIC0(_line, _cond) _ASSERT_STATIC1 (_line, (_cond))
|
|
|
|
#define ASSERT_STATIC(_cond) _ASSERT_STATIC0 (__LINE__, (_cond))
|
2008-01-23 06:20:48 +01:00
|
|
|
|
2015-10-26 22:05:05 +01:00
|
|
|
template <unsigned int cond> class hb_assert_constant_t {};
|
|
|
|
|
|
|
|
#define ASSERT_STATIC_EXPR_ZERO(_cond) (0 * (unsigned int) sizeof (hb_assert_constant_t<_cond>))
|
2011-04-21 22:34:22 +02:00
|
|
|
|
2012-05-11 14:39:01 +02:00
|
|
|
#define _PASTE1(a,b) a##b
|
|
|
|
#define PASTE(a,b) _PASTE1(a,b)
|
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);
|
2011-04-11 17:49:08 +02:00
|
|
|
ASSERT_STATIC (sizeof (hb_var_int_t) == 4);
|
2011-04-11 17:47:14 +02:00
|
|
|
|
2012-06-06 09:07:01 +02:00
|
|
|
|
|
|
|
/* We like our types POD */
|
|
|
|
|
2012-06-06 17:29:25 +02:00
|
|
|
#define _ASSERT_TYPE_POD1(_line, _type) union _type_##_type##_on_line_##_line##_is_not_POD { _type instance; }
|
|
|
|
#define _ASSERT_TYPE_POD0(_line, _type) _ASSERT_TYPE_POD1 (_line, _type)
|
|
|
|
#define ASSERT_TYPE_POD(_type) _ASSERT_TYPE_POD0 (__LINE__, _type)
|
2012-06-06 09:07:01 +02:00
|
|
|
|
|
|
|
#ifdef __GNUC__
|
2012-06-06 17:27:17 +02:00
|
|
|
# define _ASSERT_INSTANCE_POD1(_line, _instance) \
|
|
|
|
HB_STMT_START { \
|
|
|
|
typedef __typeof__(_instance) _type_##_line; \
|
|
|
|
_ASSERT_TYPE_POD1 (_line, _type_##_line); \
|
|
|
|
} HB_STMT_END
|
2012-06-06 09:07:01 +02:00
|
|
|
#else
|
2012-06-06 17:29:25 +02:00
|
|
|
# define _ASSERT_INSTANCE_POD1(_line, _instance) typedef int _assertion_on_line_##_line##_not_tested
|
2012-06-06 09:07:01 +02:00
|
|
|
#endif
|
2012-06-06 17:29:25 +02:00
|
|
|
# define _ASSERT_INSTANCE_POD0(_line, _instance) _ASSERT_INSTANCE_POD1 (_line, _instance)
|
|
|
|
# define ASSERT_INSTANCE_POD(_instance) _ASSERT_INSTANCE_POD0 (__LINE__, _instance)
|
2012-06-06 09:07:01 +02:00
|
|
|
|
|
|
|
/* Check _assertion in a method environment */
|
|
|
|
#define _ASSERT_POD1(_line) \
|
2014-06-03 23:57:00 +02:00
|
|
|
HB_UNUSED inline void _static_assertion_on_line_##_line (void) const \
|
2012-06-06 17:29:25 +02:00
|
|
|
{ _ASSERT_INSTANCE_POD1 (_line, *this); /* Make sure it's POD. */ }
|
|
|
|
# define _ASSERT_POD0(_line) _ASSERT_POD1 (_line)
|
|
|
|
# define ASSERT_POD() _ASSERT_POD0 (__LINE__)
|
2012-06-06 09:07:01 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
2010-04-29 07:40:26 +02:00
|
|
|
/* Misc */
|
|
|
|
|
2014-06-03 22:59:09 +02:00
|
|
|
/* Void! */
|
|
|
|
struct _hb_void_t {};
|
2015-06-10 19:57:46 +02:00
|
|
|
typedef const _hb_void_t *hb_void_t;
|
|
|
|
#define HB_VOID ((const _hb_void_t *) NULL)
|
2010-04-29 19:54:01 +02:00
|
|
|
|
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" */
|
2014-03-17 04:22:42 +01:00
|
|
|
uint32_t y;
|
2010-05-20 16:31:12 +02:00
|
|
|
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__)
|
2010-05-20 18:26:35 +02:00
|
|
|
return likely (number) ? (sizeof (unsigned int) * 8 - __builtin_clz (number)) : 0;
|
2010-05-20 16:31:12 +02:00
|
|
|
#else
|
2014-03-17 04:22:42 +01:00
|
|
|
unsigned int n_bits = 0;
|
2010-05-20 16:31:12 +02:00
|
|
|
while (number) {
|
|
|
|
n_bits++;
|
|
|
|
number >>= 1;
|
|
|
|
}
|
|
|
|
return n_bits;
|
|
|
|
#endif
|
|
|
|
}
|
2009-08-02 02:46:02 +02:00
|
|
|
|
2010-05-20 18:26:35 +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
|
2014-03-17 04:22:42 +01:00
|
|
|
unsigned int n_bits = 0;
|
2010-05-20 18:26:35 +02:00
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
/* arrays and maps */
|
|
|
|
|
|
|
|
|
2014-07-25 17:18:11 +02:00
|
|
|
#define HB_PREALLOCED_ARRAY_INIT {0, 0, NULL}
|
2014-06-27 01:10:21 +02:00
|
|
|
template <typename Type, unsigned int StaticSize=16>
|
2012-06-05 21:37:19 +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];
|
|
|
|
|
2012-06-05 20:17:32 +02:00
|
|
|
void init (void) { memset (this, 0, sizeof (*this)); }
|
2011-08-23 00:04:57 +02:00
|
|
|
|
2011-05-05 20:38:16 +02:00
|
|
|
inline Type& operator [] (unsigned int i) { return array[i]; }
|
|
|
|
inline const Type& operator [] (unsigned int i) const { return array[i]; }
|
2011-04-28 03:45:51 +02:00
|
|
|
|
|
|
|
inline Type *push (void)
|
|
|
|
{
|
|
|
|
if (!array) {
|
|
|
|
array = static_array;
|
|
|
|
allocated = ARRAY_LENGTH (static_array);
|
|
|
|
}
|
|
|
|
if (likely (len < allocated))
|
|
|
|
return &array[len++];
|
2011-05-03 01:54:29 +02:00
|
|
|
|
2011-04-28 03:45:51 +02:00
|
|
|
/* Need to reallocate */
|
|
|
|
unsigned int new_allocated = allocated + (allocated >> 1) + 8;
|
2011-05-03 01:54:29 +02:00
|
|
|
Type *new_array = NULL;
|
|
|
|
|
2011-04-28 03:45:51 +02:00
|
|
|
if (array == static_array) {
|
|
|
|
new_array = (Type *) calloc (new_allocated, sizeof (Type));
|
2011-05-03 01:54:29 +02:00
|
|
|
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));
|
2011-05-03 01:54:29 +02:00
|
|
|
if (likely (!overflows)) {
|
2011-04-28 03:45:51 +02:00
|
|
|
new_array = (Type *) realloc (array, new_allocated * sizeof (Type));
|
|
|
|
}
|
|
|
|
}
|
2011-05-03 01:54:29 +02:00
|
|
|
|
|
|
|
if (unlikely (!new_array))
|
2011-04-28 03:45:51 +02:00
|
|
|
return NULL;
|
2011-05-03 01:54:29 +02:00
|
|
|
|
|
|
|
array = new_array;
|
|
|
|
allocated = new_allocated;
|
|
|
|
return &array[len++];
|
2011-04-28 03:45:51 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
inline void pop (void)
|
|
|
|
{
|
|
|
|
len--;
|
2013-08-06 20:28:12 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
inline void remove (unsigned int i)
|
|
|
|
{
|
|
|
|
if (unlikely (i >= len))
|
|
|
|
return;
|
|
|
|
memmove (static_cast<void *> (&array[i]),
|
|
|
|
static_cast<void *> (&array[i + 1]),
|
|
|
|
(len - i - 1) * sizeof (Type));
|
|
|
|
len--;
|
2011-04-28 03:45:51 +02:00
|
|
|
}
|
2011-05-05 19:42:19 +02:00
|
|
|
|
|
|
|
inline void shrink (unsigned int l)
|
|
|
|
{
|
|
|
|
if (l < len)
|
|
|
|
len = l;
|
|
|
|
}
|
|
|
|
|
2011-05-05 20:12:37 +02:00
|
|
|
template <typename T>
|
|
|
|
inline Type *find (T v) {
|
|
|
|
for (unsigned int i = 0; i < len; i++)
|
|
|
|
if (array[i] == v)
|
|
|
|
return &array[i];
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
template <typename T>
|
|
|
|
inline const Type *find (T v) const {
|
|
|
|
for (unsigned int i = 0; i < len; i++)
|
|
|
|
if (array[i] == v)
|
|
|
|
return &array[i];
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2014-06-19 21:30:18 +02:00
|
|
|
inline void qsort (void)
|
2011-05-05 19:42:19 +02:00
|
|
|
{
|
2014-06-19 21:30:18 +02:00
|
|
|
::qsort (array, len, sizeof (Type), (hb_compare_func_t) Type::cmp);
|
2011-05-05 19:42:19 +02:00
|
|
|
}
|
2011-05-05 20:12:37 +02:00
|
|
|
|
2014-06-19 21:30:18 +02:00
|
|
|
inline void qsort (unsigned int start, unsigned int end)
|
2011-07-08 03:07:41 +02:00
|
|
|
{
|
2014-06-19 21:30:18 +02:00
|
|
|
::qsort (array + start, end - start, sizeof (Type), (hb_compare_func_t) Type::cmp);
|
2011-07-08 03:07:41 +02:00
|
|
|
}
|
|
|
|
|
2011-05-05 20:12:37 +02:00
|
|
|
template <typename T>
|
|
|
|
inline Type *bsearch (T *key)
|
|
|
|
{
|
|
|
|
return (Type *) ::bsearch (key, array, len, sizeof (Type), (hb_compare_func_t) Type::cmp);
|
|
|
|
}
|
|
|
|
template <typename T>
|
|
|
|
inline const Type *bsearch (T *key) const
|
|
|
|
{
|
|
|
|
return (const Type *) ::bsearch (key, array, len, sizeof (Type), (hb_compare_func_t) Type::cmp);
|
|
|
|
}
|
2011-05-11 20:19:18 +02:00
|
|
|
|
|
|
|
inline void finish (void)
|
|
|
|
{
|
|
|
|
if (array != static_array)
|
|
|
|
free (array);
|
|
|
|
array = NULL;
|
|
|
|
allocated = len = 0;
|
|
|
|
}
|
2011-04-28 03:45:51 +02:00
|
|
|
};
|
|
|
|
|
2013-03-09 10:34:21 +01:00
|
|
|
template <typename Type>
|
2014-06-27 01:10:21 +02:00
|
|
|
struct hb_auto_array_t : hb_prealloced_array_t <Type>
|
2013-03-09 10:34:21 +01:00
|
|
|
{
|
2014-06-27 01:10:21 +02:00
|
|
|
hb_auto_array_t (void) { hb_prealloced_array_t<Type>::init (); }
|
|
|
|
~hb_auto_array_t (void) { hb_prealloced_array_t<Type>::finish (); }
|
2013-03-09 10:34:21 +01:00
|
|
|
};
|
|
|
|
|
2011-04-21 23:18:22 +02:00
|
|
|
|
2012-06-05 21:37:19 +02:00
|
|
|
#define HB_LOCKABLE_SET_INIT {HB_PREALLOCED_ARRAY_INIT}
|
2011-05-11 01:12:49 +02:00
|
|
|
template <typename item_t, typename lock_t>
|
|
|
|
struct hb_lockable_set_t
|
2011-04-28 03:45:51 +02:00
|
|
|
{
|
2012-06-05 21:37:19 +02:00
|
|
|
hb_prealloced_array_t <item_t, 2> items;
|
2011-04-28 03:45:51 +02:00
|
|
|
|
2012-06-05 20:17:32 +02:00
|
|
|
inline void init (void) { items.init (); }
|
|
|
|
|
2011-05-05 18:39:51 +02:00
|
|
|
template <typename T>
|
2011-08-09 00:43:24 +02:00
|
|
|
inline item_t *replace_or_insert (T v, lock_t &l, bool replace)
|
2011-04-28 03:45:51 +02:00
|
|
|
{
|
2011-05-11 01:12:49 +02:00
|
|
|
l.lock ();
|
2011-05-05 20:12:37 +02:00
|
|
|
item_t *item = items.find (v);
|
2011-05-11 01:12:49 +02:00
|
|
|
if (item) {
|
2011-08-09 00:43:24 +02:00
|
|
|
if (replace) {
|
|
|
|
item_t old = *item;
|
|
|
|
*item = v;
|
|
|
|
l.unlock ();
|
|
|
|
old.finish ();
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
item = NULL;
|
|
|
|
l.unlock ();
|
|
|
|
}
|
2011-05-11 01:12:49 +02:00
|
|
|
} else {
|
2011-04-28 03:45:51 +02:00
|
|
|
item = items.push ();
|
2011-05-11 01:12:49 +02:00
|
|
|
if (likely (item))
|
|
|
|
*item = v;
|
|
|
|
l.unlock ();
|
|
|
|
}
|
2011-05-05 21:00:43 +02:00
|
|
|
return item;
|
2011-04-28 03:45:51 +02:00
|
|
|
}
|
|
|
|
|
2011-05-05 19:21:04 +02:00
|
|
|
template <typename T>
|
2011-05-11 01:12:49 +02:00
|
|
|
inline void remove (T v, lock_t &l)
|
2011-04-28 03:45:51 +02:00
|
|
|
{
|
2011-05-11 01:12:49 +02:00
|
|
|
l.lock ();
|
2011-05-05 20:12:37 +02:00
|
|
|
item_t *item = items.find (v);
|
2011-05-11 01:12:49 +02:00
|
|
|
if (item) {
|
|
|
|
item_t old = *item;
|
|
|
|
*item = items[items.len - 1];
|
|
|
|
items.pop ();
|
|
|
|
l.unlock ();
|
|
|
|
old.finish ();
|
|
|
|
} else {
|
|
|
|
l.unlock ();
|
|
|
|
}
|
2011-04-28 03:45:51 +02:00
|
|
|
}
|
2011-04-21 23:18:22 +02:00
|
|
|
|
2011-05-05 18:39:51 +02:00
|
|
|
template <typename T>
|
2011-05-11 01:12:49 +02:00
|
|
|
inline bool find (T v, item_t *i, lock_t &l)
|
2011-04-28 03:45:51 +02:00
|
|
|
{
|
2011-05-11 01:12:49 +02:00
|
|
|
l.lock ();
|
|
|
|
item_t *item = items.find (v);
|
|
|
|
if (item)
|
|
|
|
*i = *item;
|
|
|
|
l.unlock ();
|
|
|
|
return !!item;
|
2011-05-05 19:21:04 +02:00
|
|
|
}
|
|
|
|
|
2011-05-05 21:00:43 +02:00
|
|
|
template <typename T>
|
2011-05-11 01:12:49 +02:00
|
|
|
inline item_t *find_or_insert (T v, lock_t &l)
|
|
|
|
{
|
|
|
|
l.lock ();
|
|
|
|
item_t *item = items.find (v);
|
2011-05-05 21:00:43 +02:00
|
|
|
if (!item) {
|
|
|
|
item = items.push ();
|
|
|
|
if (likely (item))
|
|
|
|
*item = v;
|
|
|
|
}
|
2011-05-11 01:12:49 +02:00
|
|
|
l.unlock ();
|
2011-05-05 21:00:43 +02:00
|
|
|
return item;
|
|
|
|
}
|
|
|
|
|
2011-05-11 01:12:49 +02:00
|
|
|
inline void finish (lock_t &l)
|
|
|
|
{
|
2012-07-30 16:06:42 +02:00
|
|
|
if (!items.len) {
|
|
|
|
/* No need for locking. */
|
|
|
|
items.finish ();
|
|
|
|
return;
|
|
|
|
}
|
2011-05-11 01:12:49 +02:00
|
|
|
l.lock ();
|
|
|
|
while (items.len) {
|
|
|
|
item_t old = items[items.len - 1];
|
|
|
|
items.pop ();
|
|
|
|
l.unlock ();
|
|
|
|
old.finish ();
|
|
|
|
l.lock ();
|
|
|
|
}
|
2011-05-11 20:19:18 +02:00
|
|
|
items.finish ();
|
2011-05-11 01:12:49 +02:00
|
|
|
l.unlock ();
|
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
2011-04-28 03:45:51 +02:00
|
|
|
|
2011-04-11 20:58:28 +02:00
|
|
|
/* ASCII tag/character handling */
|
2011-04-11 19:16:08 +02:00
|
|
|
|
2013-02-28 00:39:37 +01:00
|
|
|
static inline bool ISALPHA (unsigned char c)
|
2011-04-27 07:49:03 +02:00
|
|
|
{ return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'); }
|
2013-02-28 00:39:37 +01:00
|
|
|
static inline bool ISALNUM (unsigned char c)
|
2011-04-27 07:49:03 +02:00
|
|
|
{ return (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9'); }
|
2013-02-28 00:39:37 +01:00
|
|
|
static inline bool ISSPACE (unsigned char c)
|
|
|
|
{ return c == ' ' || c =='\f'|| c =='\n'|| c =='\r'|| c =='\t'|| c =='\v'; }
|
2011-04-27 07:49:03 +02:00
|
|
|
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
|
|
|
|
2011-04-11 20:58:28 +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
|
|
|
|
2011-05-12 03:27:52 +02:00
|
|
|
/* C++ helpers */
|
|
|
|
|
|
|
|
/* Makes class uncopyable. Use in private: section. */
|
|
|
|
#define NO_COPY(T) \
|
|
|
|
T (const T &o); \
|
2011-06-14 20:35:44 +02:00
|
|
|
T &operator = (const T &o)
|
2011-05-12 03:27:52 +02:00
|
|
|
|
|
|
|
|
2010-04-29 07:40:26 +02:00
|
|
|
/* Debug */
|
|
|
|
|
2011-07-26 02:25:44 +02:00
|
|
|
|
2010-04-29 07:40:26 +02:00
|
|
|
#ifndef HB_DEBUG
|
|
|
|
#define HB_DEBUG 0
|
|
|
|
#endif
|
|
|
|
|
2011-07-26 02:25:44 +02:00
|
|
|
static inline bool
|
|
|
|
_hb_debug (unsigned int level,
|
|
|
|
unsigned int max_level)
|
|
|
|
{
|
|
|
|
return level < max_level;
|
|
|
|
}
|
|
|
|
|
2013-04-30 17:34:00 +02:00
|
|
|
#define DEBUG_LEVEL_ENABLED(WHAT, LEVEL) (_hb_debug ((LEVEL), HB_DEBUG_##WHAT))
|
|
|
|
#define DEBUG_ENABLED(WHAT) (DEBUG_LEVEL_ENABLED (WHAT, 0))
|
2011-07-25 23:35:24 +02:00
|
|
|
|
2015-02-21 14:51:17 +01:00
|
|
|
static inline void
|
|
|
|
_hb_print_func (const char *func)
|
|
|
|
{
|
|
|
|
if (func)
|
|
|
|
{
|
|
|
|
unsigned int func_len = strlen (func);
|
|
|
|
/* Skip "static" */
|
|
|
|
if (0 == strncmp (func, "static ", 7))
|
|
|
|
func += 7;
|
|
|
|
/* Skip "typename" */
|
|
|
|
if (0 == strncmp (func, "typename ", 9))
|
|
|
|
func += 9;
|
|
|
|
/* Skip return type */
|
|
|
|
const char *space = strchr (func, ' ');
|
|
|
|
if (space)
|
|
|
|
func = space + 1;
|
|
|
|
/* Skip parameter list */
|
|
|
|
const char *paren = strchr (func, '(');
|
|
|
|
if (paren)
|
|
|
|
func_len = paren - func;
|
|
|
|
fprintf (stderr, "%.*s", func_len, func);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-08-12 23:02:59 +02:00
|
|
|
template <int max_level> static inline void
|
|
|
|
_hb_debug_msg_va (const char *what,
|
|
|
|
const void *obj,
|
|
|
|
const char *func,
|
|
|
|
bool indented,
|
|
|
|
unsigned int level,
|
|
|
|
int level_dir,
|
|
|
|
const char *message,
|
|
|
|
va_list ap) HB_PRINTF_FUNC(7, 0);
|
2012-10-07 23:13:46 +02:00
|
|
|
template <int max_level> static inline void
|
2012-05-10 23:06:58 +02:00
|
|
|
_hb_debug_msg_va (const char *what,
|
2012-05-11 00:16:40 +02:00
|
|
|
const void *obj,
|
|
|
|
const char *func,
|
|
|
|
bool indented,
|
|
|
|
unsigned int level,
|
|
|
|
int level_dir,
|
|
|
|
const char *message,
|
|
|
|
va_list ap)
|
2012-05-10 23:06:58 +02:00
|
|
|
{
|
2012-05-11 00:50:38 +02:00
|
|
|
if (!_hb_debug (level, max_level))
|
2012-05-11 00:52:16 +02:00
|
|
|
return;
|
2012-05-11 00:50:38 +02:00
|
|
|
|
|
|
|
fprintf (stderr, "%-10s", what ? what : "");
|
|
|
|
|
|
|
|
if (obj)
|
2012-05-11 02:19:41 +02:00
|
|
|
fprintf (stderr, "(%0*lx) ", (unsigned int) (2 * sizeof (void *)), (unsigned long) obj);
|
2012-05-11 00:50:38 +02:00
|
|
|
else
|
|
|
|
fprintf (stderr, " %*s ", (unsigned int) (2 * sizeof (void *)), "");
|
|
|
|
|
2012-05-11 02:46:26 +02:00
|
|
|
if (indented) {
|
2012-06-26 16:46:31 +02:00
|
|
|
/* One may want to add ASCII version of these. See:
|
|
|
|
* https://bugs.freedesktop.org/show_bug.cgi?id=50970 */
|
|
|
|
#define VBAR "\342\224\202" /* U+2502 BOX DRAWINGS LIGHT VERTICAL */
|
|
|
|
#define VRBAR "\342\224\234" /* U+251C BOX DRAWINGS LIGHT VERTICAL AND RIGHT */
|
|
|
|
#define DLBAR "\342\225\256" /* U+256E BOX DRAWINGS LIGHT ARC DOWN AND LEFT */
|
|
|
|
#define ULBAR "\342\225\257" /* U+256F BOX DRAWINGS LIGHT ARC UP AND LEFT */
|
|
|
|
#define LBAR "\342\225\264" /* U+2574 BOX DRAWINGS LIGHT LEFT */
|
|
|
|
static const char bars[] = VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR VBAR;
|
2013-06-10 20:39:51 +02:00
|
|
|
fprintf (stderr, "%2u %s" VRBAR "%s",
|
2012-05-11 00:50:38 +02:00
|
|
|
level,
|
2012-06-26 16:46:31 +02:00
|
|
|
bars + sizeof (bars) - 1 - MIN ((unsigned int) sizeof (bars), (unsigned int) (sizeof (VBAR) - 1) * level),
|
|
|
|
level_dir ? (level_dir > 0 ? DLBAR : ULBAR) : LBAR);
|
2012-05-11 02:46:26 +02:00
|
|
|
} else
|
2012-06-26 16:46:31 +02:00
|
|
|
fprintf (stderr, " " VRBAR LBAR);
|
2012-05-11 00:50:38 +02:00
|
|
|
|
2015-02-21 14:51:17 +01:00
|
|
|
_hb_print_func (func);
|
2012-05-11 00:50:38 +02:00
|
|
|
|
|
|
|
if (message)
|
2015-02-21 14:51:17 +01:00
|
|
|
{
|
|
|
|
fprintf (stderr, ": ");
|
2012-05-11 00:50:38 +02:00
|
|
|
vfprintf (stderr, message, ap);
|
2015-02-21 14:51:17 +01:00
|
|
|
}
|
2012-05-11 00:50:38 +02:00
|
|
|
|
|
|
|
fprintf (stderr, "\n");
|
2012-05-10 23:06:58 +02:00
|
|
|
}
|
2012-05-11 00:52:16 +02:00
|
|
|
template <> inline void
|
2012-05-13 16:01:08 +02:00
|
|
|
_hb_debug_msg_va<0> (const char *what HB_UNUSED,
|
|
|
|
const void *obj HB_UNUSED,
|
|
|
|
const char *func HB_UNUSED,
|
|
|
|
bool indented HB_UNUSED,
|
|
|
|
unsigned int level HB_UNUSED,
|
|
|
|
int level_dir HB_UNUSED,
|
|
|
|
const char *message HB_UNUSED,
|
|
|
|
va_list ap HB_UNUSED) {}
|
2012-05-10 23:06:58 +02:00
|
|
|
|
2012-10-07 23:13:46 +02:00
|
|
|
template <int max_level> static inline void
|
2011-07-26 02:25:44 +02:00
|
|
|
_hb_debug_msg (const char *what,
|
|
|
|
const void *obj,
|
|
|
|
const char *func,
|
|
|
|
bool indented,
|
2012-05-11 00:16:40 +02:00
|
|
|
unsigned int level,
|
|
|
|
int level_dir,
|
2011-07-26 02:25:44 +02:00
|
|
|
const char *message,
|
2012-05-11 00:16:40 +02:00
|
|
|
...) HB_PRINTF_FUNC(7, 8);
|
2012-10-07 23:13:46 +02:00
|
|
|
template <int max_level> static inline void
|
2011-07-26 02:25:44 +02:00
|
|
|
_hb_debug_msg (const char *what,
|
|
|
|
const void *obj,
|
|
|
|
const char *func,
|
|
|
|
bool indented,
|
2012-05-11 00:16:40 +02:00
|
|
|
unsigned int level,
|
|
|
|
int level_dir,
|
2011-07-26 02:25:44 +02:00
|
|
|
const char *message,
|
|
|
|
...)
|
|
|
|
{
|
|
|
|
va_list ap;
|
|
|
|
va_start (ap, message);
|
2012-05-11 00:52:16 +02:00
|
|
|
_hb_debug_msg_va<max_level> (what, obj, func, indented, level, level_dir, message, ap);
|
2011-07-26 02:25:44 +02:00
|
|
|
va_end (ap);
|
|
|
|
}
|
2012-05-11 00:52:16 +02:00
|
|
|
template <> inline void
|
2012-05-13 16:01:08 +02:00
|
|
|
_hb_debug_msg<0> (const char *what HB_UNUSED,
|
|
|
|
const void *obj HB_UNUSED,
|
|
|
|
const char *func HB_UNUSED,
|
|
|
|
bool indented HB_UNUSED,
|
|
|
|
unsigned int level HB_UNUSED,
|
|
|
|
int level_dir HB_UNUSED,
|
|
|
|
const char *message HB_UNUSED,
|
2012-05-11 00:16:40 +02:00
|
|
|
...) HB_PRINTF_FUNC(7, 8);
|
2012-05-11 00:52:16 +02:00
|
|
|
template <> inline void
|
2012-05-13 16:01:08 +02:00
|
|
|
_hb_debug_msg<0> (const char *what HB_UNUSED,
|
|
|
|
const void *obj HB_UNUSED,
|
|
|
|
const char *func HB_UNUSED,
|
|
|
|
bool indented HB_UNUSED,
|
|
|
|
unsigned int level HB_UNUSED,
|
|
|
|
int level_dir HB_UNUSED,
|
|
|
|
const char *message HB_UNUSED,
|
2012-05-11 00:52:16 +02:00
|
|
|
...) {}
|
2010-04-29 07:40:26 +02:00
|
|
|
|
2012-06-06 02:35:40 +02:00
|
|
|
#define DEBUG_MSG_LEVEL(WHAT, OBJ, LEVEL, LEVEL_DIR, ...) _hb_debug_msg<HB_DEBUG_##WHAT> (#WHAT, (OBJ), NULL, true, (LEVEL), (LEVEL_DIR), __VA_ARGS__)
|
|
|
|
#define DEBUG_MSG(WHAT, OBJ, ...) _hb_debug_msg<HB_DEBUG_##WHAT> (#WHAT, (OBJ), NULL, false, 0, 0, __VA_ARGS__)
|
|
|
|
#define DEBUG_MSG_FUNC(WHAT, OBJ, ...) _hb_debug_msg<HB_DEBUG_##WHAT> (#WHAT, (OBJ), HB_FUNC, false, 0, 0, __VA_ARGS__)
|
2011-07-26 02:25:44 +02:00
|
|
|
|
|
|
|
|
2012-11-23 20:21:35 +01:00
|
|
|
/*
|
|
|
|
* Printer
|
|
|
|
*/
|
|
|
|
|
|
|
|
template <typename T>
|
2014-12-13 05:28:49 +01:00
|
|
|
struct hb_printer_t {
|
|
|
|
const char *print (const T&) { return "something"; }
|
|
|
|
};
|
2012-11-23 20:21:35 +01:00
|
|
|
|
|
|
|
template <>
|
|
|
|
struct hb_printer_t<bool> {
|
|
|
|
const char *print (bool v) { return v ? "true" : "false"; }
|
|
|
|
};
|
|
|
|
|
|
|
|
template <>
|
2012-12-05 22:49:47 +01:00
|
|
|
struct hb_printer_t<hb_void_t> {
|
2012-12-06 00:46:04 +01:00
|
|
|
const char *print (hb_void_t) { return ""; }
|
2012-11-23 20:21:35 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2011-07-26 02:25:44 +02:00
|
|
|
/*
|
|
|
|
* Trace
|
|
|
|
*/
|
|
|
|
|
2012-11-23 21:06:59 +01:00
|
|
|
template <typename T>
|
|
|
|
static inline void _hb_warn_no_return (bool returned)
|
|
|
|
{
|
|
|
|
if (unlikely (!returned)) {
|
2015-09-29 15:57:02 +02:00
|
|
|
fprintf (stderr, "OUCH, returned with no call to return_trace(). This is a bug, please report.\n");
|
2012-11-23 21:06:59 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
template <>
|
2014-04-28 23:29:39 +02:00
|
|
|
/*static*/ inline void _hb_warn_no_return<hb_void_t> (bool returned HB_UNUSED)
|
2012-11-23 21:06:59 +01:00
|
|
|
{}
|
|
|
|
|
|
|
|
template <int max_level, typename ret_t>
|
2011-07-26 02:25:44 +02:00
|
|
|
struct hb_auto_trace_t {
|
|
|
|
explicit inline hb_auto_trace_t (unsigned int *plevel_,
|
2012-05-11 03:33:36 +02:00
|
|
|
const char *what_,
|
|
|
|
const void *obj_,
|
2011-07-26 02:25:44 +02:00
|
|
|
const char *func,
|
2012-05-10 23:06:58 +02:00
|
|
|
const char *message,
|
2012-05-11 03:33:36 +02:00
|
|
|
...) : plevel (plevel_), what (what_), obj (obj_), returned (false)
|
2011-07-26 02:25:44 +02:00
|
|
|
{
|
2012-05-11 00:16:40 +02:00
|
|
|
if (plevel) ++*plevel;
|
2012-05-10 23:06:58 +02:00
|
|
|
|
|
|
|
va_list ap;
|
|
|
|
va_start (ap, message);
|
2012-06-06 02:35:40 +02:00
|
|
|
_hb_debug_msg_va<max_level> (what, obj, func, true, plevel ? *plevel : 0, +1, message, ap);
|
2012-05-10 23:06:58 +02:00
|
|
|
va_end (ap);
|
2011-07-26 02:25:44 +02:00
|
|
|
}
|
2012-05-11 01:25:34 +02:00
|
|
|
inline ~hb_auto_trace_t (void)
|
2012-05-11 00:16:40 +02:00
|
|
|
{
|
2012-11-23 21:06:59 +01:00
|
|
|
_hb_warn_no_return<ret_t> (returned);
|
|
|
|
if (!returned) {
|
2012-06-06 02:35:40 +02:00
|
|
|
_hb_debug_msg<max_level> (what, obj, NULL, true, plevel ? *plevel : 1, -1, " ");
|
2012-05-11 01:25:34 +02:00
|
|
|
}
|
2012-05-11 00:16:40 +02:00
|
|
|
if (plevel) --*plevel;
|
|
|
|
}
|
2011-07-26 02:25:44 +02:00
|
|
|
|
2012-11-23 22:49:19 +01:00
|
|
|
inline ret_t ret (ret_t v, unsigned int line = 0)
|
2012-05-11 01:25:34 +02:00
|
|
|
{
|
|
|
|
if (unlikely (returned)) {
|
2015-09-29 15:57:02 +02:00
|
|
|
fprintf (stderr, "OUCH, double calls to return_trace(). This is a bug, please report.\n");
|
2012-05-11 01:25:34 +02:00
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
2012-11-23 21:06:59 +01:00
|
|
|
_hb_debug_msg<max_level> (what, obj, NULL, true, plevel ? *plevel : 1, -1,
|
|
|
|
"return %s (line %d)",
|
|
|
|
hb_printer_t<ret_t>().print (v), line);
|
2012-05-11 01:25:34 +02:00
|
|
|
if (plevel) --*plevel;
|
|
|
|
plevel = NULL;
|
|
|
|
returned = true;
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
|
2011-07-26 02:25:44 +02:00
|
|
|
private:
|
|
|
|
unsigned int *plevel;
|
2012-05-11 03:33:36 +02:00
|
|
|
const char *what;
|
|
|
|
const void *obj;
|
2012-11-23 20:07:24 +01:00
|
|
|
bool returned;
|
2011-07-26 02:25:44 +02:00
|
|
|
};
|
2012-11-23 21:06:59 +01:00
|
|
|
template <typename ret_t> /* Optimize when tracing is disabled */
|
|
|
|
struct hb_auto_trace_t<0, ret_t> {
|
2012-05-13 16:01:08 +02:00
|
|
|
explicit inline hb_auto_trace_t (unsigned int *plevel_ HB_UNUSED,
|
|
|
|
const char *what HB_UNUSED,
|
|
|
|
const void *obj HB_UNUSED,
|
|
|
|
const char *func HB_UNUSED,
|
|
|
|
const char *message HB_UNUSED,
|
2012-05-10 23:06:58 +02:00
|
|
|
...) {}
|
2012-05-11 01:25:34 +02:00
|
|
|
|
2012-12-06 00:46:04 +01:00
|
|
|
inline ret_t ret (ret_t v, unsigned int line HB_UNUSED = 0) { return v; }
|
2011-07-26 02:25:44 +02:00
|
|
|
};
|
|
|
|
|
2015-09-29 15:57:02 +02:00
|
|
|
#define return_trace(RET) return trace.ret (RET, __LINE__)
|
2011-07-26 02:25:44 +02:00
|
|
|
|
|
|
|
/* Misc */
|
|
|
|
|
2014-07-11 20:18:01 +02:00
|
|
|
template <typename T> class hb_assert_unsigned_t;
|
|
|
|
template <> class hb_assert_unsigned_t<unsigned char> {};
|
2014-07-17 13:40:34 +02:00
|
|
|
template <> class hb_assert_unsigned_t<unsigned short> {};
|
2014-07-11 20:18:01 +02:00
|
|
|
template <> class hb_assert_unsigned_t<unsigned int> {};
|
|
|
|
template <> class hb_assert_unsigned_t<unsigned long> {};
|
2010-04-21 08:12:45 +02:00
|
|
|
|
2012-07-13 15:45:54 +02:00
|
|
|
template <typename T> static inline bool
|
2011-07-29 23:02:48 +02:00
|
|
|
hb_in_range (T u, T lo, T hi)
|
2011-07-21 05:59:07 +02:00
|
|
|
{
|
2014-07-18 00:22:07 +02:00
|
|
|
/* The sizeof() is here to force template instantiation.
|
|
|
|
* I'm sure there are better ways to do this but can't think of
|
|
|
|
* one right now. Declaring a variable won't work as HB_UNUSED
|
2015-02-21 14:30:28 +01:00
|
|
|
* is unusable on some platforms and unused types are less likely
|
2014-07-18 00:22:07 +02:00
|
|
|
* to generate a warning than unused variables. */
|
|
|
|
ASSERT_STATIC (sizeof (hb_assert_unsigned_t<T>) >= 0);
|
|
|
|
|
2014-08-11 00:52:07 +02:00
|
|
|
/* The casts below are important as if T is smaller than int,
|
|
|
|
* the subtract results will become a signed int! */
|
|
|
|
return (T)(u - lo) <= (T)(hi - lo);
|
2011-07-21 05:59:07 +02:00
|
|
|
}
|
|
|
|
|
2013-12-31 08:55:40 +01:00
|
|
|
template <typename T> static inline bool
|
|
|
|
hb_in_ranges (T u, T lo1, T hi1, T lo2, T hi2)
|
|
|
|
{
|
|
|
|
return hb_in_range (u, lo1, hi1) || hb_in_range (u, lo2, hi2);
|
|
|
|
}
|
|
|
|
|
2012-07-23 19:15:33 +02:00
|
|
|
template <typename T> static inline bool
|
2012-07-23 20:04:42 +02:00
|
|
|
hb_in_ranges (T u, T lo1, T hi1, T lo2, T hi2, T lo3, T hi3)
|
2012-07-23 19:15:33 +02:00
|
|
|
{
|
2012-07-23 20:04:42 +02:00
|
|
|
return hb_in_range (u, lo1, hi1) || hb_in_range (u, lo2, hi2) || hb_in_range (u, lo3, hi3);
|
2012-07-23 19:15:33 +02:00
|
|
|
}
|
|
|
|
|
2011-07-21 05:59:07 +02:00
|
|
|
|
2015-11-05 01:25:57 +01:00
|
|
|
/* Enable bitwise ops on enums marked as flags_t */
|
2015-11-05 03:46:22 +01:00
|
|
|
/* To my surprise, looks like the function resolver is happy to silently cast
|
|
|
|
* one enum to another... So this doesn't provide the type-checking that I
|
2015-11-18 03:42:13 +01:00
|
|
|
* originally had in mind... :(.
|
|
|
|
*
|
2015-11-20 22:21:29 +01:00
|
|
|
* For MSVC warnings, see: https://github.com/behdad/harfbuzz/pull/163
|
2015-11-18 03:42:13 +01:00
|
|
|
*/
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
# pragma warning(disable:4200)
|
|
|
|
# pragma warning(disable:4800)
|
2015-11-09 10:17:56 +01:00
|
|
|
#endif
|
2015-11-20 22:24:19 +01:00
|
|
|
#define HB_MARK_AS_FLAG_T(T) \
|
|
|
|
extern "C++" { \
|
|
|
|
static inline T operator | (T l, T r) { return T ((unsigned) l | (unsigned) r); } \
|
|
|
|
static inline T operator & (T l, T r) { return T ((unsigned) l & (unsigned) r); } \
|
|
|
|
static inline T operator ^ (T l, T r) { return T ((unsigned) l ^ (unsigned) r); } \
|
|
|
|
static inline T operator ~ (T r) { return T (~(unsigned int) r); } \
|
|
|
|
static inline T& operator |= (T &l, T r) { l = l | r; return l; } \
|
|
|
|
static inline T& operator &= (T& l, T r) { l = l & r; return l; } \
|
|
|
|
static inline T& operator ^= (T& l, T r) { l = l ^ r; return l; } \
|
|
|
|
}
|
2015-11-05 01:25:57 +01:00
|
|
|
|
|
|
|
|
2011-07-30 20:44:30 +02:00
|
|
|
/* Useful for set-operations on small enums.
|
|
|
|
* For example, for testing "x ∈ {x1, x2, x3}" use:
|
2015-07-21 16:50:02 +02:00
|
|
|
* (FLAG_SAFE(x) & (FLAG(x1) | FLAG(x2) | FLAG(x3)))
|
2011-07-30 20:44:30 +02:00
|
|
|
*/
|
2015-07-21 16:50:02 +02:00
|
|
|
#define FLAG(x) (ASSERT_STATIC_EXPR_ZERO ((x) < 32) + (1U << (x)))
|
|
|
|
#define FLAG_SAFE(x) (1U << (x))
|
2015-07-21 16:52:15 +02:00
|
|
|
#define FLAG_UNSAFE(x) ((x) < 32 ? FLAG_SAFE(x) : 0)
|
2012-07-20 19:37:48 +02:00
|
|
|
#define FLAG_RANGE(x,y) (ASSERT_STATIC_EXPR_ZERO ((x) < (y)) + FLAG(y+1) - FLAG(x))
|
2011-07-21 05:59:07 +02:00
|
|
|
|
2011-07-29 23:02:48 +02:00
|
|
|
|
2014-10-01 17:07:08 +02:00
|
|
|
template <typename T, typename T2> static inline void
|
2015-09-01 16:07:52 +02:00
|
|
|
hb_stable_sort (T *array, unsigned int len, int(*compar)(const T *, const T *), T2 *array2)
|
2011-07-30 20:44:30 +02:00
|
|
|
{
|
2015-09-01 16:07:52 +02:00
|
|
|
for (unsigned int i = 1; i < len; i++)
|
|
|
|
{
|
|
|
|
unsigned int j = i;
|
|
|
|
while (j && compar (&array[j - 1], &array[i]) > 0)
|
|
|
|
j--;
|
|
|
|
if (i == j)
|
|
|
|
continue;
|
|
|
|
/* Move item i to occupy place for item j, shift what's in between. */
|
|
|
|
{
|
2015-09-01 17:11:27 +02:00
|
|
|
T t = array[i];
|
2015-09-01 16:07:52 +02:00
|
|
|
memmove (&array[j + 1], &array[j], (i - j) * sizeof (T));
|
|
|
|
array[j] = t;
|
|
|
|
}
|
|
|
|
if (array2)
|
|
|
|
{
|
2015-09-01 17:11:27 +02:00
|
|
|
T2 t = array2[i];
|
2015-09-01 16:07:52 +02:00
|
|
|
memmove (&array2[j + 1], &array2[j], (i - j) * sizeof (T2));
|
|
|
|
array2[j] = t;
|
|
|
|
}
|
|
|
|
}
|
2011-07-30 20:44:30 +02:00
|
|
|
}
|
|
|
|
|
2014-10-01 17:28:01 +02:00
|
|
|
template <typename T> static inline void
|
2015-09-01 16:07:52 +02:00
|
|
|
hb_stable_sort (T *array, unsigned int len, int(*compar)(const T *, const T *))
|
2012-07-17 23:09:29 +02:00
|
|
|
{
|
2015-09-01 16:07:52 +02:00
|
|
|
hb_stable_sort (array, len, compar, (int *) NULL);
|
2012-07-17 23:09:29 +02:00
|
|
|
}
|
2011-07-30 20:44:30 +02:00
|
|
|
|
2012-08-08 04:13:25 +02:00
|
|
|
static inline hb_bool_t
|
|
|
|
hb_codepoint_parse (const char *s, unsigned int len, int base, hb_codepoint_t *out)
|
|
|
|
{
|
|
|
|
/* Pain because we don't know whether s is nul-terminated. */
|
|
|
|
char buf[64];
|
2013-02-27 23:59:28 +01:00
|
|
|
len = MIN (ARRAY_LENGTH (buf) - 1, len);
|
|
|
|
strncpy (buf, s, len);
|
|
|
|
buf[len] = '\0';
|
2012-08-08 04:13:25 +02:00
|
|
|
|
|
|
|
char *end;
|
|
|
|
errno = 0;
|
|
|
|
unsigned long v = strtoul (buf, &end, base);
|
|
|
|
if (errno) return false;
|
|
|
|
if (*end) return false;
|
|
|
|
*out = v;
|
|
|
|
return true;
|
|
|
|
}
|
2011-07-30 20:44:30 +02:00
|
|
|
|
2010-07-23 21:11:18 +02:00
|
|
|
|
2013-02-12 21:26:45 +01:00
|
|
|
/* Global runtime options. */
|
|
|
|
|
|
|
|
struct hb_options_t
|
|
|
|
{
|
2014-10-15 05:07:31 +02:00
|
|
|
unsigned int initialized : 1;
|
|
|
|
unsigned int uniscribe_bug_compatible : 1;
|
2013-02-12 21:26:45 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
union hb_options_union_t {
|
2014-10-15 05:07:31 +02:00
|
|
|
unsigned int i;
|
2013-02-12 21:26:45 +01:00
|
|
|
hb_options_t opts;
|
|
|
|
};
|
|
|
|
ASSERT_STATIC (sizeof (int) == sizeof (hb_options_union_t));
|
|
|
|
|
|
|
|
HB_INTERNAL void
|
|
|
|
_hb_options_init (void);
|
|
|
|
|
|
|
|
extern HB_INTERNAL hb_options_union_t _hb_options;
|
|
|
|
|
|
|
|
static inline hb_options_t
|
|
|
|
hb_options (void)
|
|
|
|
{
|
|
|
|
if (unlikely (!_hb_options.i))
|
|
|
|
_hb_options_init ();
|
|
|
|
|
|
|
|
return _hb_options.opts;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-04-21 00:50:27 +02:00
|
|
|
#endif /* HB_PRIVATE_HH */
|