2008-01-23 22:14:38 +01:00
|
|
|
/*
|
2011-04-21 23:14:28 +02:00
|
|
|
* Copyright © 2007,2008,2009,2010 Red Hat, Inc.
|
2012-05-11 01:25:34 +02:00
|
|
|
* Copyright © 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
|
2012-05-11 01:25:34 +02:00
|
|
|
* Google Author(s): Behdad Esfahbod
|
2008-01-23 22:14:38 +01:00
|
|
|
*/
|
|
|
|
|
2010-06-09 12:32:56 +02:00
|
|
|
#ifndef HB_OPEN_TYPE_PRIVATE_HH
|
|
|
|
#define HB_OPEN_TYPE_PRIVATE_HH
|
2006-12-28 12:10:59 +01:00
|
|
|
|
2011-04-21 00:50:27 +02:00
|
|
|
#include "hb-private.hh"
|
2017-11-03 21:57:30 +01:00
|
|
|
#include "hb-debug.hh"
|
2017-01-10 07:45:25 +01:00
|
|
|
#include "hb-face-private.hh"
|
2006-12-28 12:10:59 +01:00
|
|
|
|
2008-01-23 23:01:55 +01:00
|
|
|
|
2012-08-28 23:57:49 +02:00
|
|
|
namespace OT {
|
|
|
|
|
2010-04-23 00:29:09 +02:00
|
|
|
|
2012-11-23 19:27:16 +01:00
|
|
|
|
2009-08-04 17:04:32 +02:00
|
|
|
/*
|
|
|
|
* Casts
|
|
|
|
*/
|
|
|
|
|
2010-04-23 22:35:01 +02:00
|
|
|
/* Cast to struct T, reference to reference */
|
2010-04-23 00:29:09 +02:00
|
|
|
template<typename Type, typename TObject>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline const Type& CastR(const TObject &X)
|
2010-04-23 00:29:09 +02:00
|
|
|
{ return reinterpret_cast<const Type&> (X); }
|
|
|
|
template<typename Type, typename TObject>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline Type& CastR(TObject &X)
|
2010-04-23 00:29:09 +02:00
|
|
|
{ return reinterpret_cast<Type&> (X); }
|
2009-08-04 17:04:32 +02:00
|
|
|
|
2010-04-23 22:35:01 +02:00
|
|
|
/* Cast to struct T, pointer to pointer */
|
|
|
|
template<typename Type, typename TObject>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline const Type* CastP(const TObject *X)
|
2010-04-23 22:35:01 +02:00
|
|
|
{ return reinterpret_cast<const Type*> (X); }
|
|
|
|
template<typename Type, typename TObject>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline Type* CastP(TObject *X)
|
2010-04-23 22:35:01 +02:00
|
|
|
{ return reinterpret_cast<Type*> (X); }
|
|
|
|
|
2010-05-10 23:36:03 +02:00
|
|
|
/* StructAtOffset<T>(P,Ofs) returns the struct T& that is placed at memory
|
|
|
|
* location pointed to by P plus Ofs bytes. */
|
|
|
|
template<typename Type>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline const Type& StructAtOffset(const void *P, unsigned int offset)
|
2010-05-10 23:55:03 +02:00
|
|
|
{ return * reinterpret_cast<const Type*> ((const char *) P + offset); }
|
2010-05-10 23:36:03 +02:00
|
|
|
template<typename Type>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline Type& StructAtOffset(void *P, unsigned int offset)
|
2010-05-10 23:55:03 +02:00
|
|
|
{ return * reinterpret_cast<Type*> ((char *) P + offset); }
|
2009-08-04 06:58:28 +02:00
|
|
|
|
2010-04-22 04:30:36 +02:00
|
|
|
/* StructAfter<T>(X) returns the struct T& that is placed after X.
|
2010-04-22 05:01:00 +02:00
|
|
|
* Works with X of variable size also. X must implement get_size() */
|
2010-04-21 21:56:11 +02:00
|
|
|
template<typename Type, typename TObject>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline const Type& StructAfter(const TObject &X)
|
2010-05-10 23:36:03 +02:00
|
|
|
{ return StructAtOffset<Type>(&X, X.get_size()); }
|
2010-04-21 21:56:11 +02:00
|
|
|
template<typename Type, typename TObject>
|
2014-04-28 23:29:39 +02:00
|
|
|
static inline Type& StructAfter(TObject &X)
|
2010-05-10 23:36:03 +02:00
|
|
|
{ return StructAtOffset<Type>(&X, X.get_size()); }
|
2010-04-23 00:29:09 +02:00
|
|
|
|
2010-04-21 21:56:11 +02:00
|
|
|
|
2009-11-03 16:47:29 +01:00
|
|
|
|
2010-05-07 01:33:31 +02:00
|
|
|
/*
|
|
|
|
* Size checking
|
|
|
|
*/
|
|
|
|
|
2010-05-13 19:34:17 +02:00
|
|
|
/* Check _assertion in a method environment */
|
2012-06-06 09:07:01 +02:00
|
|
|
#define _DEFINE_INSTANCE_ASSERTION1(_line, _assertion) \
|
|
|
|
inline void _instance_assertion_on_line_##_line (void) const \
|
|
|
|
{ \
|
2017-10-15 12:02:00 +02:00
|
|
|
static_assert ((_assertion), ""); \
|
2012-06-06 09:07:01 +02:00
|
|
|
ASSERT_INSTANCE_POD (*this); /* Make sure it's POD. */ \
|
|
|
|
}
|
|
|
|
# define _DEFINE_INSTANCE_ASSERTION0(_line, _assertion) _DEFINE_INSTANCE_ASSERTION1 (_line, _assertion)
|
|
|
|
# define DEFINE_INSTANCE_ASSERTION(_assertion) _DEFINE_INSTANCE_ASSERTION0 (__LINE__, _assertion)
|
|
|
|
|
2010-05-13 19:34:17 +02:00
|
|
|
/* Check that _code compiles in a method environment */
|
2012-06-06 09:07:01 +02:00
|
|
|
#define _DEFINE_COMPILES_ASSERTION1(_line, _code) \
|
|
|
|
inline void _compiles_assertion_on_line_##_line (void) const \
|
2010-05-13 19:34:17 +02:00
|
|
|
{ _code; }
|
2012-06-06 09:07:01 +02:00
|
|
|
# define _DEFINE_COMPILES_ASSERTION0(_line, _code) _DEFINE_COMPILES_ASSERTION1 (_line, _code)
|
|
|
|
# define DEFINE_COMPILES_ASSERTION(_code) _DEFINE_COMPILES_ASSERTION0 (__LINE__, _code)
|
2010-05-10 23:04:20 +02:00
|
|
|
|
|
|
|
|
2010-05-07 01:33:31 +02:00
|
|
|
#define DEFINE_SIZE_STATIC(size) \
|
2012-06-06 09:07:01 +02:00
|
|
|
DEFINE_INSTANCE_ASSERTION (sizeof (*this) == (size)); \
|
2010-05-07 01:33:31 +02:00
|
|
|
static const unsigned int static_size = (size); \
|
2016-04-30 19:20:56 +02:00
|
|
|
static const unsigned int min_size = (size); \
|
|
|
|
inline unsigned int get_size (void) const { return (size); }
|
2010-05-07 01:33:31 +02:00
|
|
|
|
2010-05-11 00:47:48 +02:00
|
|
|
#define DEFINE_SIZE_UNION(size, _member) \
|
2016-12-24 02:46:37 +01:00
|
|
|
DEFINE_INSTANCE_ASSERTION (0*sizeof(this->u._member.static_size) + sizeof(this->u._member) == (size)); \
|
2010-05-11 00:47:48 +02:00
|
|
|
static const unsigned int min_size = (size)
|
|
|
|
|
2010-05-10 23:28:16 +02:00
|
|
|
#define DEFINE_SIZE_MIN(size) \
|
2012-06-06 09:07:01 +02:00
|
|
|
DEFINE_INSTANCE_ASSERTION (sizeof (*this) >= (size)); \
|
2010-05-10 22:57:29 +02:00
|
|
|
static const unsigned int min_size = (size)
|
|
|
|
|
2010-05-11 01:01:17 +02:00
|
|
|
#define DEFINE_SIZE_ARRAY(size, array) \
|
2012-06-06 09:07:01 +02:00
|
|
|
DEFINE_INSTANCE_ASSERTION (sizeof (*this) == (size) + sizeof (array[0])); \
|
|
|
|
DEFINE_COMPILES_ASSERTION ((void) array[0].static_size) \
|
2010-05-07 01:33:31 +02:00
|
|
|
static const unsigned int min_size = (size)
|
|
|
|
|
2010-05-11 01:01:17 +02:00
|
|
|
#define DEFINE_SIZE_ARRAY2(size, array1, array2) \
|
2012-06-06 09:07:01 +02:00
|
|
|
DEFINE_INSTANCE_ASSERTION (sizeof (*this) == (size) + sizeof (this->array1[0]) + sizeof (this->array2[0])); \
|
|
|
|
DEFINE_COMPILES_ASSERTION ((void) array1[0].static_size; (void) array2[0].static_size) \
|
2010-05-07 01:33:31 +02:00
|
|
|
static const unsigned int min_size = (size)
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-01-23 08:01:37 +01:00
|
|
|
/*
|
2010-05-03 00:14:25 +02:00
|
|
|
* Null objects
|
2008-01-23 08:01:37 +01:00
|
|
|
*/
|
|
|
|
|
2009-05-17 04:48:14 +02:00
|
|
|
/* Global nul-content Null pool. Enlarge as necessary. */
|
2017-10-27 23:01:40 +02:00
|
|
|
|
|
|
|
#define HB_NULL_POOL_SIZE 264
|
|
|
|
static_assert (HB_NULL_POOL_SIZE % sizeof (void *) == 0, "Align HB_NULL_POOL_SIZE.");
|
2018-02-12 02:34:05 +01:00
|
|
|
|
|
|
|
#ifdef HB_NO_VISIBILITY
|
|
|
|
static
|
|
|
|
#else
|
|
|
|
extern HB_INTERNAL
|
|
|
|
#endif
|
2018-02-12 03:24:22 +01:00
|
|
|
const void * const _hb_NullPool[HB_NULL_POOL_SIZE / sizeof (void *)]
|
|
|
|
#ifdef HB_NO_VISIBILITY
|
|
|
|
= {}
|
|
|
|
#endif
|
|
|
|
;
|
2009-05-17 04:48:14 +02:00
|
|
|
|
2010-05-11 01:58:25 +02:00
|
|
|
/* Generic nul-content Null objects. */
|
2009-05-17 04:48:14 +02:00
|
|
|
template <typename Type>
|
2010-10-02 00:58:50 +02:00
|
|
|
static inline const Type& Null (void) {
|
2017-10-27 23:01:40 +02:00
|
|
|
static_assert (sizeof (Type) <= HB_NULL_POOL_SIZE, "Increase HB_NULL_POOL_SIZE.");
|
|
|
|
return *CastP<Type> (_hb_NullPool);
|
2010-04-21 06:32:47 +02:00
|
|
|
}
|
2009-05-17 04:48:14 +02:00
|
|
|
|
|
|
|
/* Specializaiton for arbitrary-content arbitrary-sized Null objects. */
|
2010-05-07 01:35:19 +02:00
|
|
|
#define DEFINE_NULL_DATA(Type, data) \
|
2012-11-15 19:47:14 +01:00
|
|
|
static const char _Null##Type[sizeof (Type) + 1] = data; /* +1 is for nul-termination in data */ \
|
2009-05-17 04:48:14 +02:00
|
|
|
template <> \
|
2014-04-28 23:29:39 +02:00
|
|
|
/*static*/ inline const Type& Null<Type> (void) { \
|
2010-04-23 22:35:01 +02:00
|
|
|
return *CastP<Type> (_Null##Type); \
|
2010-04-22 16:26:35 +02:00
|
|
|
} /* The following line really exists such that we end in a place needing semicolon */ \
|
2017-10-15 12:02:00 +02:00
|
|
|
static_assert (Type::min_size + 1 <= sizeof (_Null##Type), "Null pool too small. Enlarge.")
|
2009-05-17 04:48:14 +02:00
|
|
|
|
|
|
|
/* Accessor macro. */
|
2010-04-21 06:32:47 +02:00
|
|
|
#define Null(Type) Null<Type>()
|
2009-05-17 04:48:14 +02:00
|
|
|
|
|
|
|
|
2015-10-09 18:20:58 +02:00
|
|
|
/*
|
|
|
|
* Dispatch
|
|
|
|
*/
|
|
|
|
|
|
|
|
template <typename Context, typename Return, unsigned int MaxDebugDepth>
|
|
|
|
struct hb_dispatch_context_t
|
|
|
|
{
|
|
|
|
static const unsigned int max_debug_depth = MaxDebugDepth;
|
|
|
|
typedef Return return_t;
|
|
|
|
template <typename T, typename F>
|
|
|
|
inline bool may_dispatch (const T *obj, const F *format) { return true; }
|
2015-10-09 18:25:55 +02:00
|
|
|
static return_t no_dispatch_return_value (void) { return Context::default_return_value (); }
|
2015-10-09 18:20:58 +02:00
|
|
|
};
|
|
|
|
|
2008-01-23 08:01:37 +01:00
|
|
|
|
2009-08-05 01:31:02 +02:00
|
|
|
/*
|
|
|
|
* Sanitize
|
|
|
|
*/
|
|
|
|
|
2013-02-26 01:09:57 +01:00
|
|
|
/* This limits sanitizing time on really broken fonts. */
|
|
|
|
#ifndef HB_SANITIZE_MAX_EDITS
|
2016-01-05 14:26:20 +01:00
|
|
|
#define HB_SANITIZE_MAX_EDITS 32
|
2013-02-26 01:09:57 +01:00
|
|
|
#endif
|
2018-02-19 02:28:53 +01:00
|
|
|
#ifndef HB_SANITIZE_MAX_OPS_FACTOR
|
|
|
|
#define HB_SANITIZE_MAX_OPS_FACTOR 8
|
|
|
|
#endif
|
|
|
|
#ifndef HB_SANITIZE_MAX_OPS_MIN
|
|
|
|
#define HB_SANITIZE_MAX_OPS_MIN 16384
|
|
|
|
#endif
|
2009-08-05 04:35:36 +02:00
|
|
|
|
2015-10-09 18:20:58 +02:00
|
|
|
struct hb_sanitize_context_t :
|
|
|
|
hb_dispatch_context_t<hb_sanitize_context_t, bool, HB_DEBUG_SANITIZE>
|
2009-08-05 01:31:02 +02:00
|
|
|
{
|
2015-10-09 18:20:58 +02:00
|
|
|
inline hb_sanitize_context_t (void) :
|
|
|
|
debug_depth (0),
|
2017-10-15 12:11:08 +02:00
|
|
|
start (nullptr), end (nullptr),
|
2018-02-19 02:28:53 +01:00
|
|
|
writable (false), edit_count (0), max_ops (0),
|
2018-01-09 15:48:51 +01:00
|
|
|
blob (nullptr),
|
|
|
|
num_glyphs (0) {}
|
2015-10-09 18:20:58 +02:00
|
|
|
|
2012-11-23 23:29:05 +01:00
|
|
|
inline const char *get_name (void) { return "SANITIZE"; }
|
2015-02-19 08:29:41 +01:00
|
|
|
template <typename T, typename F>
|
|
|
|
inline bool may_dispatch (const T *obj, const F *format)
|
|
|
|
{ return format->sanitize (this); }
|
2012-11-23 23:29:05 +01:00
|
|
|
template <typename T>
|
2013-03-09 07:55:04 +01:00
|
|
|
inline return_t dispatch (const T &obj) { return obj.sanitize (this); }
|
2012-11-23 23:29:05 +01:00
|
|
|
static return_t default_return_value (void) { return true; }
|
2015-10-09 18:25:55 +02:00
|
|
|
static return_t no_dispatch_return_value (void) { return false; }
|
2015-02-19 08:29:41 +01:00
|
|
|
bool stop_sublookup_iteration (const return_t r) const { return !r; }
|
2012-11-23 23:29:05 +01:00
|
|
|
|
2011-06-15 15:49:58 +02:00
|
|
|
inline void init (hb_blob_t *b)
|
2010-05-05 04:42:49 +02:00
|
|
|
{
|
2011-06-15 15:49:58 +02:00
|
|
|
this->blob = hb_blob_reference (b);
|
2011-05-07 04:28:26 +02:00
|
|
|
this->writable = false;
|
|
|
|
}
|
|
|
|
|
2012-05-11 03:16:57 +02:00
|
|
|
inline void start_processing (void)
|
2011-05-07 04:28:26 +02:00
|
|
|
{
|
2017-10-15 12:11:08 +02:00
|
|
|
this->start = hb_blob_get_data (this->blob, nullptr);
|
2011-05-11 20:30:56 +02:00
|
|
|
this->end = this->start + hb_blob_get_length (this->blob);
|
2014-12-19 03:09:41 +01:00
|
|
|
assert (this->start <= this->end); /* Must not overflow. */
|
2018-02-19 02:28:53 +01:00
|
|
|
this->max_ops = MAX ((unsigned int) (this->end - this->start) * HB_SANITIZE_MAX_OPS_FACTOR,
|
|
|
|
(unsigned) HB_SANITIZE_MAX_OPS_MIN);
|
2010-05-05 04:42:49 +02:00
|
|
|
this->edit_count = 0;
|
2010-05-05 05:21:57 +02:00
|
|
|
this->debug_depth = 0;
|
2009-08-05 01:31:02 +02:00
|
|
|
|
2014-12-13 03:23:20 +01:00
|
|
|
DEBUG_MSG_LEVEL (SANITIZE, start, 0, +1,
|
2012-05-11 03:16:57 +02:00
|
|
|
"start [%p..%p] (%lu bytes)",
|
2012-05-11 00:16:40 +02:00
|
|
|
this->start, this->end,
|
|
|
|
(unsigned long) (this->end - this->start));
|
2010-05-05 04:42:49 +02:00
|
|
|
}
|
2010-04-29 08:19:21 +02:00
|
|
|
|
2012-05-11 03:16:57 +02:00
|
|
|
inline void end_processing (void)
|
2010-05-05 04:42:49 +02:00
|
|
|
{
|
2014-12-13 03:23:20 +01:00
|
|
|
DEBUG_MSG_LEVEL (SANITIZE, this->start, 0, -1,
|
2012-05-11 03:16:57 +02:00
|
|
|
"end [%p..%p] %u edit requests",
|
2012-05-11 00:16:40 +02:00
|
|
|
this->start, this->end, this->edit_count);
|
2009-08-05 01:31:02 +02:00
|
|
|
|
2010-05-05 04:42:49 +02:00
|
|
|
hb_blob_destroy (this->blob);
|
2017-10-15 12:11:08 +02:00
|
|
|
this->blob = nullptr;
|
|
|
|
this->start = this->end = nullptr;
|
2010-05-05 04:42:49 +02:00
|
|
|
}
|
2009-08-05 05:01:23 +02:00
|
|
|
|
2010-05-06 15:24:24 +02:00
|
|
|
inline bool check_range (const void *base, unsigned int len) const
|
2010-05-05 04:42:49 +02:00
|
|
|
{
|
2010-05-10 23:55:03 +02:00
|
|
|
const char *p = (const char *) base;
|
2018-02-19 02:28:53 +01:00
|
|
|
bool ok = this->max_ops-- > 0 &&
|
|
|
|
this->start <= p &&
|
|
|
|
p <= this->end &&
|
|
|
|
(unsigned int) (this->end - p) >= len;
|
2010-05-05 04:42:49 +02:00
|
|
|
|
2014-12-13 04:32:46 +01:00
|
|
|
DEBUG_MSG_LEVEL (SANITIZE, p, this->debug_depth+1, 0,
|
|
|
|
"check_range [%p..%p] (%d bytes) in [%p..%p] -> %s",
|
2012-11-23 21:06:59 +01:00
|
|
|
p, p + len, len,
|
2014-12-13 04:32:46 +01:00
|
|
|
this->start, this->end,
|
|
|
|
ok ? "OK" : "OUT-OF-RANGE");
|
2010-05-05 04:42:49 +02:00
|
|
|
|
2014-12-13 04:32:46 +01:00
|
|
|
return likely (ok);
|
2010-05-05 04:42:49 +02:00
|
|
|
}
|
2009-08-05 01:31:02 +02:00
|
|
|
|
2010-05-06 02:15:14 +02:00
|
|
|
inline bool check_array (const void *base, unsigned int record_size, unsigned int len) const
|
2010-05-05 04:42:49 +02:00
|
|
|
{
|
2010-05-10 23:55:03 +02:00
|
|
|
const char *p = (const char *) base;
|
2011-04-28 22:01:01 +02:00
|
|
|
bool overflows = _hb_unsigned_int_mul_overflows (len, record_size);
|
2014-12-13 04:32:46 +01:00
|
|
|
unsigned int array_size = record_size * len;
|
|
|
|
bool ok = !overflows && this->check_range (base, array_size);
|
2009-08-14 22:25:33 +02:00
|
|
|
|
2014-12-13 04:32:46 +01:00
|
|
|
DEBUG_MSG_LEVEL (SANITIZE, p, this->debug_depth+1, 0,
|
|
|
|
"check_array [%p..%p] (%d*%d=%d bytes) in [%p..%p] -> %s",
|
|
|
|
p, p + (record_size * len), record_size, len, (unsigned int) array_size,
|
|
|
|
this->start, this->end,
|
|
|
|
overflows ? "OVERFLOWS" : ok ? "OK" : "OUT-OF-RANGE");
|
2010-04-29 19:48:26 +02:00
|
|
|
|
2014-12-13 04:32:46 +01:00
|
|
|
return likely (ok);
|
2010-05-05 04:42:49 +02:00
|
|
|
}
|
2010-04-23 19:57:10 +02:00
|
|
|
|
2010-05-06 20:48:27 +02:00
|
|
|
template <typename Type>
|
|
|
|
inline bool check_struct (const Type *obj) const
|
|
|
|
{
|
2010-05-11 00:13:32 +02:00
|
|
|
return likely (this->check_range (obj, obj->min_size));
|
2010-05-06 20:48:27 +02:00
|
|
|
}
|
|
|
|
|
2012-05-11 03:16:57 +02:00
|
|
|
inline bool may_edit (const void *base HB_UNUSED, unsigned int len HB_UNUSED)
|
2010-05-05 04:42:49 +02:00
|
|
|
{
|
2013-02-26 01:09:57 +01:00
|
|
|
if (this->edit_count >= HB_SANITIZE_MAX_EDITS)
|
|
|
|
return false;
|
|
|
|
|
2010-05-10 23:55:03 +02:00
|
|
|
const char *p = (const char *) base;
|
2010-05-05 04:42:49 +02:00
|
|
|
this->edit_count++;
|
|
|
|
|
2014-12-13 04:32:46 +01:00
|
|
|
DEBUG_MSG_LEVEL (SANITIZE, p, this->debug_depth+1, 0,
|
2012-11-23 21:06:59 +01:00
|
|
|
"may_edit(%u) [%p..%p] (%d bytes) in [%p..%p] -> %s",
|
|
|
|
this->edit_count,
|
|
|
|
p, p + len, len,
|
2012-12-18 00:42:59 +01:00
|
|
|
this->start, this->end,
|
|
|
|
this->writable ? "GRANTED" : "DENIED");
|
2010-05-05 04:42:49 +02:00
|
|
|
|
2014-12-13 04:32:46 +01:00
|
|
|
return this->writable;
|
2010-05-05 04:42:49 +02:00
|
|
|
}
|
|
|
|
|
2014-06-05 00:42:32 +02:00
|
|
|
template <typename Type, typename ValueType>
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool try_set (const Type *obj, const ValueType &v) {
|
2014-06-05 00:42:32 +02:00
|
|
|
if (this->may_edit (obj, obj->static_size)) {
|
2015-02-17 15:27:44 +01:00
|
|
|
const_cast<Type *> (obj)->set (v);
|
2014-06-05 00:42:32 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2012-05-11 03:16:57 +02:00
|
|
|
mutable unsigned int debug_depth;
|
2010-05-05 04:42:49 +02:00
|
|
|
const char *start, *end;
|
|
|
|
bool writable;
|
|
|
|
unsigned int edit_count;
|
2018-02-19 02:28:53 +01:00
|
|
|
mutable int max_ops;
|
2010-05-05 04:42:49 +02:00
|
|
|
hb_blob_t *blob;
|
2018-01-09 15:48:51 +01:00
|
|
|
unsigned int num_glyphs;
|
2010-05-05 04:42:49 +02:00
|
|
|
};
|
2009-08-14 23:31:16 +02:00
|
|
|
|
2009-08-05 01:31:02 +02:00
|
|
|
|
|
|
|
|
2009-08-05 02:52:47 +02:00
|
|
|
/* Template to sanitize an object. */
|
|
|
|
template <typename Type>
|
|
|
|
struct Sanitizer
|
|
|
|
{
|
2018-01-09 15:48:51 +01:00
|
|
|
inline Sanitizer (void) {}
|
|
|
|
|
|
|
|
inline hb_blob_t *sanitize (hb_blob_t *blob) {
|
2009-08-05 02:52:47 +02:00
|
|
|
bool sane;
|
|
|
|
|
2009-08-07 00:34:47 +02:00
|
|
|
/* TODO is_sane() stuff */
|
2009-08-05 02:52:47 +02:00
|
|
|
|
2011-05-07 04:28:26 +02:00
|
|
|
c->init (blob);
|
|
|
|
|
2009-08-05 02:52:47 +02:00
|
|
|
retry:
|
2014-12-13 03:23:20 +01:00
|
|
|
DEBUG_MSG_FUNC (SANITIZE, c->start, "start");
|
2009-08-05 05:01:23 +02:00
|
|
|
|
2012-05-11 03:16:57 +02:00
|
|
|
c->start_processing ();
|
2009-08-05 02:52:47 +02:00
|
|
|
|
2010-05-13 20:18:49 +02:00
|
|
|
if (unlikely (!c->start)) {
|
2012-05-11 03:16:57 +02:00
|
|
|
c->end_processing ();
|
2010-05-11 02:07:56 +02:00
|
|
|
return blob;
|
|
|
|
}
|
|
|
|
|
2010-05-13 20:18:49 +02:00
|
|
|
Type *t = CastP<Type> (const_cast<char *> (c->start));
|
2009-08-05 02:52:47 +02:00
|
|
|
|
2010-05-13 20:18:49 +02:00
|
|
|
sane = t->sanitize (c);
|
2009-08-05 02:52:47 +02:00
|
|
|
if (sane) {
|
2010-05-13 20:18:49 +02:00
|
|
|
if (c->edit_count) {
|
2014-12-13 03:23:20 +01:00
|
|
|
DEBUG_MSG_FUNC (SANITIZE, c->start, "passed first round with %d edits; going for second round", c->edit_count);
|
2010-04-29 19:48:26 +02:00
|
|
|
|
2009-08-20 00:16:50 +02:00
|
|
|
/* sanitize again to ensure no toe-stepping */
|
2010-05-13 20:18:49 +02:00
|
|
|
c->edit_count = 0;
|
|
|
|
sane = t->sanitize (c);
|
|
|
|
if (c->edit_count) {
|
2014-12-13 03:23:20 +01:00
|
|
|
DEBUG_MSG_FUNC (SANITIZE, c->start, "requested %d edits in second round; FAILLING", c->edit_count);
|
2009-08-05 02:52:47 +02:00
|
|
|
sane = false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2010-05-13 20:18:49 +02:00
|
|
|
unsigned int edit_count = c->edit_count;
|
2011-05-07 04:28:26 +02:00
|
|
|
if (edit_count && !c->writable) {
|
2017-10-15 12:11:08 +02:00
|
|
|
c->start = hb_blob_get_data_writable (blob, nullptr);
|
2011-05-07 04:28:26 +02:00
|
|
|
c->end = c->start + hb_blob_get_length (blob);
|
|
|
|
|
|
|
|
if (c->start) {
|
|
|
|
c->writable = true;
|
|
|
|
/* ok, we made it writable by relocating. try again */
|
2014-12-13 03:23:20 +01:00
|
|
|
DEBUG_MSG_FUNC (SANITIZE, c->start, "retry");
|
2011-05-07 04:28:26 +02:00
|
|
|
goto retry;
|
|
|
|
}
|
2009-08-05 02:52:47 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-05-11 03:16:57 +02:00
|
|
|
c->end_processing ();
|
2011-05-11 20:30:56 +02:00
|
|
|
|
2014-12-13 03:23:20 +01:00
|
|
|
DEBUG_MSG_FUNC (SANITIZE, c->start, sane ? "PASSED" : "FAILED");
|
2009-08-05 02:52:47 +02:00
|
|
|
if (sane)
|
|
|
|
return blob;
|
|
|
|
else {
|
|
|
|
hb_blob_destroy (blob);
|
2011-05-03 01:36:39 +02:00
|
|
|
return hb_blob_get_empty ();
|
2009-08-05 02:52:47 +02:00
|
|
|
}
|
|
|
|
}
|
2010-05-11 01:51:57 +02:00
|
|
|
|
|
|
|
static const Type* lock_instance (hb_blob_t *blob) {
|
2011-05-07 04:28:26 +02:00
|
|
|
hb_blob_make_immutable (blob);
|
2017-10-15 12:11:08 +02:00
|
|
|
const char *base = hb_blob_get_data (blob, nullptr);
|
2010-05-11 01:51:57 +02:00
|
|
|
return unlikely (!base) ? &Null(Type) : CastP<Type> (base);
|
|
|
|
}
|
2018-01-09 15:48:51 +01:00
|
|
|
|
|
|
|
inline void set_num_glyphs (unsigned int num_glyphs) { c->num_glyphs = num_glyphs; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
hb_sanitize_context_t c[1];
|
2009-08-05 02:52:47 +02:00
|
|
|
};
|
|
|
|
|
2009-04-16 01:50:16 +02:00
|
|
|
|
2010-05-03 00:14:25 +02:00
|
|
|
|
2012-08-30 02:26:08 +02:00
|
|
|
/*
|
|
|
|
* Serialize
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
struct hb_serialize_context_t
|
|
|
|
{
|
2015-10-21 15:23:12 +02:00
|
|
|
inline hb_serialize_context_t (void *start_, unsigned int size)
|
2012-08-30 02:26:08 +02:00
|
|
|
{
|
2015-10-21 15:23:12 +02:00
|
|
|
this->start = (char *) start_;
|
2012-08-30 02:26:08 +02:00
|
|
|
this->end = this->start + size;
|
|
|
|
|
|
|
|
this->ran_out_of_room = false;
|
|
|
|
this->head = this->start;
|
|
|
|
this->debug_depth = 0;
|
2012-09-06 04:19:28 +02:00
|
|
|
}
|
2012-08-30 02:26:08 +02:00
|
|
|
|
2012-09-06 04:19:28 +02:00
|
|
|
template <typename Type>
|
|
|
|
inline Type *start_serialize (void)
|
|
|
|
{
|
2012-08-30 02:26:08 +02:00
|
|
|
DEBUG_MSG_LEVEL (SERIALIZE, this->start, 0, +1,
|
|
|
|
"start [%p..%p] (%lu bytes)",
|
|
|
|
this->start, this->end,
|
|
|
|
(unsigned long) (this->end - this->start));
|
2012-09-06 04:19:28 +02:00
|
|
|
|
|
|
|
return start_embed<Type> ();
|
2012-08-30 02:26:08 +02:00
|
|
|
}
|
|
|
|
|
2012-09-06 04:19:28 +02:00
|
|
|
inline void end_serialize (void)
|
2012-08-30 02:26:08 +02:00
|
|
|
{
|
|
|
|
DEBUG_MSG_LEVEL (SERIALIZE, this->start, 0, -1,
|
2012-09-06 04:19:28 +02:00
|
|
|
"end [%p..%p] serialized %d bytes; %s",
|
2012-08-30 02:26:08 +02:00
|
|
|
this->start, this->end,
|
2012-09-06 04:19:28 +02:00
|
|
|
(int) (this->head - this->start),
|
2012-08-30 02:26:08 +02:00
|
|
|
this->ran_out_of_room ? "RAN OUT OF ROOM" : "did not ran out of room");
|
|
|
|
|
2012-09-06 04:19:28 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template <typename Type>
|
|
|
|
inline Type *copy (void)
|
|
|
|
{
|
|
|
|
assert (!this->ran_out_of_room);
|
|
|
|
unsigned int len = this->head - this->start;
|
|
|
|
void *p = malloc (len);
|
|
|
|
if (p)
|
|
|
|
memcpy (p, this->start, len);
|
|
|
|
return reinterpret_cast<Type *> (p);
|
2012-08-30 02:26:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template <typename Type>
|
2012-09-02 03:56:06 +02:00
|
|
|
inline Type *allocate_size (unsigned int size)
|
2012-08-30 02:26:08 +02:00
|
|
|
{
|
2013-02-26 05:57:51 +01:00
|
|
|
if (unlikely (this->ran_out_of_room || this->end - this->head < ptrdiff_t (size))) {
|
2012-08-30 02:26:08 +02:00
|
|
|
this->ran_out_of_room = true;
|
2017-10-15 12:11:08 +02:00
|
|
|
return nullptr;
|
2012-08-30 02:26:08 +02:00
|
|
|
}
|
2012-09-02 03:56:06 +02:00
|
|
|
memset (this->head, 0, size);
|
2012-08-30 03:08:59 +02:00
|
|
|
char *ret = this->head;
|
2012-08-30 02:26:08 +02:00
|
|
|
this->head += size;
|
|
|
|
return reinterpret_cast<Type *> (ret);
|
|
|
|
}
|
|
|
|
|
2012-08-30 03:08:59 +02:00
|
|
|
template <typename Type>
|
2012-09-02 03:56:06 +02:00
|
|
|
inline Type *allocate_min (void)
|
2012-08-30 03:08:59 +02:00
|
|
|
{
|
2012-09-02 03:56:06 +02:00
|
|
|
return this->allocate_size<Type> (Type::min_size);
|
2012-08-30 03:08:59 +02:00
|
|
|
}
|
|
|
|
|
2012-09-06 04:19:28 +02:00
|
|
|
template <typename Type>
|
|
|
|
inline Type *start_embed (void)
|
|
|
|
{
|
|
|
|
Type *ret = reinterpret_cast<Type *> (this->head);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2012-08-30 02:26:08 +02:00
|
|
|
template <typename Type>
|
2012-09-02 03:56:06 +02:00
|
|
|
inline Type *embed (const Type &obj)
|
2012-08-30 02:26:08 +02:00
|
|
|
{
|
2012-09-02 02:48:22 +02:00
|
|
|
unsigned int size = obj.get_size ();
|
2012-09-02 03:56:06 +02:00
|
|
|
Type *ret = this->allocate_size<Type> (size);
|
2017-10-15 12:11:08 +02:00
|
|
|
if (unlikely (!ret)) return nullptr;
|
2012-09-02 02:48:22 +02:00
|
|
|
memcpy (ret, obj, size);
|
|
|
|
return ret;
|
2012-08-30 03:08:59 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template <typename Type>
|
2012-09-02 03:56:06 +02:00
|
|
|
inline Type *extend_min (Type &obj)
|
2012-08-30 03:08:59 +02:00
|
|
|
{
|
2012-09-02 02:48:22 +02:00
|
|
|
unsigned int size = obj.min_size;
|
2012-09-06 04:19:28 +02:00
|
|
|
assert (this->start <= (char *) &obj && (char *) &obj <= this->head && (char *) &obj + size >= this->head);
|
2017-10-15 12:11:08 +02:00
|
|
|
if (unlikely (!this->allocate_size<Type> (((char *) &obj) + size - this->head))) return nullptr;
|
2012-08-30 03:08:59 +02:00
|
|
|
return reinterpret_cast<Type *> (&obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename Type>
|
2012-09-02 03:56:06 +02:00
|
|
|
inline Type *extend (Type &obj)
|
2012-08-30 03:08:59 +02:00
|
|
|
{
|
2012-09-02 02:48:22 +02:00
|
|
|
unsigned int size = obj.get_size ();
|
|
|
|
assert (this->start < (char *) &obj && (char *) &obj <= this->head && (char *) &obj + size >= this->head);
|
2017-10-15 12:11:08 +02:00
|
|
|
if (unlikely (!this->allocate_size<Type> (((char *) &obj) + size - this->head))) return nullptr;
|
2012-09-02 02:48:22 +02:00
|
|
|
return reinterpret_cast<Type *> (&obj);
|
2012-08-30 02:26:08 +02:00
|
|
|
}
|
|
|
|
|
2015-10-21 15:23:12 +02:00
|
|
|
inline void truncate (void *new_head)
|
2012-08-30 02:26:08 +02:00
|
|
|
{
|
2015-10-21 15:23:12 +02:00
|
|
|
assert (this->start < new_head && new_head <= this->head);
|
|
|
|
this->head = (char *) new_head;
|
2012-08-30 02:26:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int debug_depth;
|
|
|
|
char *start, *end, *head;
|
|
|
|
bool ran_out_of_room;
|
|
|
|
};
|
|
|
|
|
2012-09-05 00:17:57 +02:00
|
|
|
template <typename Type>
|
|
|
|
struct Supplier
|
|
|
|
{
|
2018-02-08 04:13:10 +01:00
|
|
|
inline Supplier (const Type *array, unsigned int len_, unsigned int stride_=sizeof(Type))
|
2012-09-05 00:17:57 +02:00
|
|
|
{
|
|
|
|
head = array;
|
|
|
|
len = len_;
|
2018-02-08 04:13:10 +01:00
|
|
|
stride = stride_;
|
2012-09-05 00:17:57 +02:00
|
|
|
}
|
|
|
|
inline const Type operator [] (unsigned int i) const
|
|
|
|
{
|
|
|
|
if (unlikely (i >= len)) return Type ();
|
2018-02-10 17:20:11 +01:00
|
|
|
return * (const Type *) (const void *) ((const char *) head + stride * i);
|
2012-09-05 00:17:57 +02:00
|
|
|
}
|
|
|
|
|
2018-02-10 20:15:57 +01:00
|
|
|
inline Supplier<Type> & operator += (unsigned int count)
|
2012-09-06 04:19:28 +02:00
|
|
|
{
|
2012-09-05 00:17:57 +02:00
|
|
|
if (unlikely (count > len))
|
|
|
|
count = len;
|
|
|
|
len -= count;
|
2018-02-10 17:20:11 +01:00
|
|
|
head = (const Type *) (const void *) ((const char *) head + stride * count);
|
2018-02-10 20:15:57 +01:00
|
|
|
return *this;
|
2012-09-05 00:17:57 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2012-09-06 04:19:28 +02:00
|
|
|
inline Supplier (const Supplier<Type> &); /* Disallow copy */
|
|
|
|
inline Supplier<Type>& operator= (const Supplier<Type> &); /* Disallow copy */
|
|
|
|
|
2012-09-05 00:17:57 +02:00
|
|
|
unsigned int len;
|
2018-02-08 04:13:10 +01:00
|
|
|
unsigned int stride;
|
2012-09-05 00:17:57 +02:00
|
|
|
const Type *head;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2006-12-22 08:21:55 +01:00
|
|
|
/*
|
|
|
|
*
|
2009-08-08 01:46:30 +02:00
|
|
|
* The OpenType Font File: Data Types
|
2006-12-22 08:21:55 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
/* "The following data types are used in the OpenType font file.
|
|
|
|
* All OpenType fonts use Motorola-style byte ordering (Big Endian):" */
|
|
|
|
|
2009-05-17 06:54:25 +02:00
|
|
|
/*
|
|
|
|
* Int types
|
|
|
|
*/
|
|
|
|
|
2006-12-22 04:31:10 +01:00
|
|
|
|
2011-08-06 00:18:21 +02:00
|
|
|
template <typename Type, int Bytes> struct BEInt;
|
2010-04-21 09:11:46 +02:00
|
|
|
|
2015-08-21 13:44:36 +02:00
|
|
|
template <typename Type>
|
|
|
|
struct BEInt<Type, 1>
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
inline void set (Type V)
|
|
|
|
{
|
|
|
|
v = V;
|
|
|
|
}
|
|
|
|
inline operator Type (void) const
|
|
|
|
{
|
|
|
|
return v;
|
|
|
|
}
|
|
|
|
private: uint8_t v;
|
|
|
|
};
|
2010-04-21 09:11:46 +02:00
|
|
|
template <typename Type>
|
2011-08-06 00:18:21 +02:00
|
|
|
struct BEInt<Type, 2>
|
2010-04-21 09:11:46 +02:00
|
|
|
{
|
|
|
|
public:
|
2014-10-15 06:24:59 +02:00
|
|
|
inline void set (Type V)
|
|
|
|
{
|
|
|
|
v[0] = (V >> 8) & 0xFF;
|
|
|
|
v[1] = (V ) & 0xFF;
|
|
|
|
}
|
|
|
|
inline operator Type (void) const
|
|
|
|
{
|
|
|
|
return (v[0] << 8)
|
|
|
|
+ (v[1] );
|
|
|
|
}
|
2010-04-21 09:11:46 +02:00
|
|
|
private: uint8_t v[2];
|
|
|
|
};
|
|
|
|
template <typename Type>
|
2014-10-15 06:26:13 +02:00
|
|
|
struct BEInt<Type, 3>
|
2010-04-21 09:11:46 +02:00
|
|
|
{
|
|
|
|
public:
|
2014-10-15 06:24:59 +02:00
|
|
|
inline void set (Type V)
|
|
|
|
{
|
2014-10-15 06:26:13 +02:00
|
|
|
v[0] = (V >> 16) & 0xFF;
|
|
|
|
v[1] = (V >> 8) & 0xFF;
|
|
|
|
v[2] = (V ) & 0xFF;
|
2014-10-15 06:24:59 +02:00
|
|
|
}
|
|
|
|
inline operator Type (void) const
|
|
|
|
{
|
2014-10-15 06:26:13 +02:00
|
|
|
return (v[0] << 16)
|
|
|
|
+ (v[1] << 8)
|
|
|
|
+ (v[2] );
|
2014-10-15 06:24:59 +02:00
|
|
|
}
|
2014-10-15 06:26:13 +02:00
|
|
|
private: uint8_t v[3];
|
2010-04-21 09:11:46 +02:00
|
|
|
};
|
2012-12-11 22:00:43 +01:00
|
|
|
template <typename Type>
|
2014-10-15 06:26:13 +02:00
|
|
|
struct BEInt<Type, 4>
|
2012-12-11 22:00:43 +01:00
|
|
|
{
|
|
|
|
public:
|
2014-10-15 06:24:59 +02:00
|
|
|
inline void set (Type V)
|
|
|
|
{
|
2014-10-15 06:26:13 +02:00
|
|
|
v[0] = (V >> 24) & 0xFF;
|
|
|
|
v[1] = (V >> 16) & 0xFF;
|
|
|
|
v[2] = (V >> 8) & 0xFF;
|
|
|
|
v[3] = (V ) & 0xFF;
|
2014-10-15 06:24:59 +02:00
|
|
|
}
|
|
|
|
inline operator Type (void) const
|
|
|
|
{
|
2014-10-15 06:26:13 +02:00
|
|
|
return (v[0] << 24)
|
|
|
|
+ (v[1] << 16)
|
|
|
|
+ (v[2] << 8)
|
|
|
|
+ (v[3] );
|
2014-10-15 06:24:59 +02:00
|
|
|
}
|
2014-10-15 06:26:13 +02:00
|
|
|
private: uint8_t v[4];
|
2012-12-11 22:00:43 +01:00
|
|
|
};
|
2010-04-21 09:11:46 +02:00
|
|
|
|
2010-04-22 05:11:45 +02:00
|
|
|
/* Integer types in big-endian order and no alignment requirement */
|
2012-12-11 22:00:43 +01:00
|
|
|
template <typename Type, unsigned int Size>
|
2010-04-21 09:11:46 +02:00
|
|
|
struct IntType
|
|
|
|
{
|
2010-07-23 20:46:57 +02:00
|
|
|
inline void set (Type i) { v.set (i); }
|
2010-04-22 04:49:56 +02:00
|
|
|
inline operator Type(void) const { return v; }
|
2015-02-19 15:03:02 +01:00
|
|
|
inline bool operator == (const IntType<Type,Size> &o) const { return (Type) v == (Type) o.v; }
|
|
|
|
inline bool operator != (const IntType<Type,Size> &o) const { return !(*this == o); }
|
2012-12-11 22:00:43 +01:00
|
|
|
static inline int cmp (const IntType<Type,Size> *a, const IntType<Type,Size> *b) { return b->cmp (*a); }
|
2017-10-27 22:29:12 +02:00
|
|
|
template <typename Type2>
|
|
|
|
inline int cmp (Type2 a) const
|
2015-02-19 14:57:12 +01:00
|
|
|
{
|
|
|
|
Type b = v;
|
2017-10-27 22:29:12 +02:00
|
|
|
if (sizeof (Type) < sizeof (int) && sizeof (Type2) < sizeof (int))
|
2015-02-19 14:57:12 +01:00
|
|
|
return (int) a - (int) b;
|
|
|
|
else
|
|
|
|
return a < b ? -1 : a == b ? 0 : +1;
|
|
|
|
}
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (likely (c->check_struct (this)));
|
2010-04-21 09:11:46 +02:00
|
|
|
}
|
2010-05-10 23:55:03 +02:00
|
|
|
protected:
|
2012-12-11 22:00:43 +01:00
|
|
|
BEInt<Type, Size> v;
|
2010-05-10 22:38:32 +02:00
|
|
|
public:
|
2012-12-11 22:00:43 +01:00
|
|
|
DEFINE_SIZE_STATIC (Size);
|
2010-04-21 09:11:46 +02:00
|
|
|
};
|
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
typedef IntType<uint8_t, 1> HBUINT8; /* 8-bit unsigned integer. */
|
|
|
|
typedef IntType<int8_t, 1> HBINT8; /* 8-bit signed integer. */
|
|
|
|
typedef IntType<uint16_t, 2> HBUINT16; /* 16-bit unsigned integer. */
|
|
|
|
typedef IntType<int16_t, 2> HBINT16; /* 16-bit signed integer. */
|
|
|
|
typedef IntType<uint32_t, 4> HBUINT32; /* 32-bit unsigned integer. */
|
|
|
|
typedef IntType<int32_t, 4> HBINT32; /* 32-bit signed integer. */
|
2012-12-11 22:00:43 +01:00
|
|
|
typedef IntType<uint32_t, 3> UINT24; /* 24-bit unsigned integer. */
|
2010-04-21 09:11:46 +02:00
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
/* 16-bit signed integer (HBINT16) that describes a quantity in FUnits. */
|
|
|
|
typedef HBINT16 FWORD;
|
2011-08-17 14:43:45 +02:00
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
/* 16-bit unsigned integer (HBUINT16) that describes a quantity in FUnits. */
|
|
|
|
typedef HBUINT16 UFWORD;
|
2011-08-17 14:43:45 +02:00
|
|
|
|
2016-03-01 08:41:53 +01:00
|
|
|
/* 16-bit signed fixed number with the low 14 bits of fraction (2.14). */
|
2018-01-10 03:07:30 +01:00
|
|
|
struct F2DOT14 : HBINT16
|
2016-03-01 08:41:53 +01:00
|
|
|
{
|
|
|
|
//inline float to_float (void) const { return ???; }
|
|
|
|
//inline void set_float (float f) { v.set (f * ???); }
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (2);
|
|
|
|
};
|
|
|
|
|
2016-04-30 19:20:56 +02:00
|
|
|
/* 32-bit signed fixed-point number (16.16). */
|
2018-01-10 03:07:30 +01:00
|
|
|
struct Fixed: HBINT32
|
2016-04-30 19:20:56 +02:00
|
|
|
{
|
2018-02-24 10:19:42 +01:00
|
|
|
inline float to_float (void) const { return ((int32_t) v) / 65536.0; }
|
|
|
|
inline void set_float (float f) { v.set (round (f * 65536.0)); }
|
2016-04-30 19:20:56 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (4);
|
|
|
|
};
|
|
|
|
|
2010-05-19 17:47:17 +02:00
|
|
|
/* Date represented in number of seconds since 12:00 midnight, January 1,
|
|
|
|
* 1904. The value is represented as a signed 64-bit integer. */
|
|
|
|
struct LONGDATETIME
|
|
|
|
{
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (likely (c->check_struct (this)));
|
2010-05-19 17:47:17 +02:00
|
|
|
}
|
2014-01-23 20:18:49 +01:00
|
|
|
protected:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBINT32 major;
|
|
|
|
HBUINT32 minor;
|
2010-05-19 17:47:17 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (8);
|
|
|
|
};
|
|
|
|
|
2006-12-22 04:31:10 +01:00
|
|
|
/* Array of four uint8s (length = 32 bits) used to identify a script, language
|
|
|
|
* system, feature, or baseline */
|
2018-01-10 03:07:30 +01:00
|
|
|
struct Tag : HBUINT32
|
2009-05-20 05:58:54 +02:00
|
|
|
{
|
2006-12-25 15:14:52 +01:00
|
|
|
/* What the char* converters return is NOT nul-terminated. Print using "%.4s" */
|
2010-05-10 23:55:03 +02:00
|
|
|
inline operator const char* (void) const { return reinterpret_cast<const char *> (&this->v); }
|
|
|
|
inline operator char* (void) { return reinterpret_cast<char *> (&this->v); }
|
2010-05-10 22:57:29 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (4);
|
2006-12-22 04:31:10 +01:00
|
|
|
};
|
2010-05-07 01:35:19 +02:00
|
|
|
DEFINE_NULL_DATA (Tag, " ");
|
2006-12-22 04:31:10 +01:00
|
|
|
|
|
|
|
/* Glyph index number, same as uint16 (length = 16 bits) */
|
2018-01-10 03:07:30 +01:00
|
|
|
typedef HBUINT16 GlyphID;
|
2006-12-22 04:31:10 +01:00
|
|
|
|
2010-05-11 04:22:22 +02:00
|
|
|
/* Script/language-system/feature index */
|
2018-01-10 03:07:30 +01:00
|
|
|
struct Index : HBUINT16 {
|
2014-07-11 20:54:42 +02:00
|
|
|
static const unsigned int NOT_FOUND_INDEX = 0xFFFFu;
|
2010-05-11 04:22:22 +02:00
|
|
|
};
|
|
|
|
DEFINE_NULL_DATA (Index, "\xff\xff");
|
|
|
|
|
2014-06-27 21:12:52 +02:00
|
|
|
/* Offset, Null offset = 0 */
|
2017-11-15 06:09:03 +01:00
|
|
|
template <typename Type>
|
2014-06-27 21:12:52 +02:00
|
|
|
struct Offset : Type
|
2013-01-08 23:15:46 +01:00
|
|
|
{
|
|
|
|
inline bool is_null (void) const { return 0 == *this; }
|
2018-02-08 04:13:10 +01:00
|
|
|
|
|
|
|
inline void *serialize (hb_serialize_context_t *c, const void *base)
|
|
|
|
{
|
|
|
|
void *t = c->start_embed<void> ();
|
|
|
|
this->set ((char *) t - (char *) base); /* TODO(serialize) Overflow? */
|
|
|
|
return t;
|
|
|
|
}
|
2018-02-26 04:06:25 +01:00
|
|
|
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (sizeof(Type));
|
2013-01-08 23:15:46 +01:00
|
|
|
};
|
2009-05-25 08:27:29 +02:00
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
typedef Offset<HBUINT16> Offset16;
|
|
|
|
typedef Offset<HBUINT32> Offset32;
|
2017-11-15 06:09:03 +01:00
|
|
|
|
2006-12-22 04:31:10 +01:00
|
|
|
|
|
|
|
/* CheckSum */
|
2018-01-10 03:07:30 +01:00
|
|
|
struct CheckSum : HBUINT32
|
2009-05-20 05:58:54 +02:00
|
|
|
{
|
2013-07-21 23:05:02 +02:00
|
|
|
/* This is reference implementation from the spec. */
|
2018-01-10 03:07:30 +01:00
|
|
|
static inline uint32_t CalcTableChecksum (const HBUINT32 *Table, uint32_t Length)
|
2009-05-20 05:58:54 +02:00
|
|
|
{
|
2006-12-22 04:31:10 +01:00
|
|
|
uint32_t Sum = 0L;
|
2018-02-24 00:51:26 +01:00
|
|
|
assert (0 == (Length & 3));
|
|
|
|
const HBUINT32 *EndPtr = Table + Length / HBUINT32::static_size;
|
2006-12-22 04:31:10 +01:00
|
|
|
|
|
|
|
while (Table < EndPtr)
|
|
|
|
Sum += *Table++;
|
|
|
|
return Sum;
|
|
|
|
}
|
2013-07-21 23:05:02 +02:00
|
|
|
|
|
|
|
/* Note: data should be 4byte aligned and have 4byte padding at the end. */
|
|
|
|
inline void set_for_data (const void *data, unsigned int length)
|
2018-01-10 03:07:30 +01:00
|
|
|
{ set (CalcTableChecksum ((const HBUINT32 *) data, length)); }
|
2013-07-21 23:05:02 +02:00
|
|
|
|
2010-05-10 22:57:29 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (4);
|
2006-12-22 04:31:10 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Version Numbers
|
|
|
|
*/
|
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename FixedType=HBUINT16>
|
2009-05-24 07:03:24 +02:00
|
|
|
struct FixedVersion
|
2009-05-20 05:58:54 +02:00
|
|
|
{
|
2016-04-04 23:34:25 +02:00
|
|
|
inline uint32_t to_int (void) const { return (major << (sizeof(FixedType) * 8)) + minor; }
|
2009-05-24 18:30:40 +02:00
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this));
|
2009-08-04 08:09:34 +02:00
|
|
|
}
|
|
|
|
|
2016-02-22 03:44:45 +01:00
|
|
|
FixedType major;
|
|
|
|
FixedType minor;
|
2010-05-10 22:57:29 +02:00
|
|
|
public:
|
2016-02-22 03:44:45 +01:00
|
|
|
DEFINE_SIZE_STATIC (2 * sizeof(FixedType));
|
2006-12-22 04:31:10 +01:00
|
|
|
};
|
|
|
|
|
2009-08-04 16:41:32 +02:00
|
|
|
|
|
|
|
|
2009-05-17 06:54:25 +02:00
|
|
|
/*
|
2014-06-27 21:12:52 +02:00
|
|
|
* Template subclasses of Offset that do the dereferencing.
|
2010-05-03 00:14:25 +02:00
|
|
|
* Use: (base+offset)
|
2009-05-17 06:54:25 +02:00
|
|
|
*/
|
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename Type, typename OffsetType=HBUINT16>
|
2014-06-27 21:12:52 +02:00
|
|
|
struct OffsetTo : Offset<OffsetType>
|
2009-08-04 16:41:32 +02:00
|
|
|
{
|
2010-04-21 05:50:45 +02:00
|
|
|
inline const Type& operator () (const void *base) const
|
2009-08-04 16:41:32 +02:00
|
|
|
{
|
|
|
|
unsigned int offset = *this;
|
2010-05-04 04:51:19 +02:00
|
|
|
if (unlikely (!offset)) return Null(Type);
|
2010-05-10 23:36:03 +02:00
|
|
|
return StructAtOffset<Type> (base, offset);
|
2009-08-04 16:41:32 +02:00
|
|
|
}
|
2012-09-02 02:48:22 +02:00
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline Type& serialize (hb_serialize_context_t *c, const void *base)
|
2012-09-02 02:48:22 +02:00
|
|
|
{
|
2018-02-08 04:13:10 +01:00
|
|
|
return * (Type *) Offset<OffsetType>::serialize (c, base);
|
2012-09-02 02:48:22 +02:00
|
|
|
}
|
2009-08-04 16:41:32 +02:00
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!c->check_struct (this))) return_trace (false);
|
2009-08-04 16:41:32 +02:00
|
|
|
unsigned int offset = *this;
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!offset)) return_trace (true);
|
2016-12-03 04:51:23 +01:00
|
|
|
if (unlikely (!c->check_range (base, offset))) return_trace (false);
|
2015-02-17 15:27:44 +01:00
|
|
|
const Type &obj = StructAtOffset<Type> (base, offset);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (likely (obj.sanitize (c)) || neuter (c));
|
2009-08-04 16:41:32 +02:00
|
|
|
}
|
2010-05-05 04:46:21 +02:00
|
|
|
template <typename T>
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c, const void *base, T user_data) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!c->check_struct (this))) return_trace (false);
|
2009-08-04 19:30:49 +02:00
|
|
|
unsigned int offset = *this;
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!offset)) return_trace (true);
|
2016-12-03 04:51:23 +01:00
|
|
|
if (unlikely (!c->check_range (base, offset))) return_trace (false);
|
2015-02-17 15:27:44 +01:00
|
|
|
const Type &obj = StructAtOffset<Type> (base, offset);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (likely (obj.sanitize (c, user_data)) || neuter (c));
|
2010-05-04 20:38:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Set the offset to Null */
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool neuter (hb_sanitize_context_t *c) const {
|
2014-06-05 00:42:32 +02:00
|
|
|
return c->try_set (this, 0);
|
2009-08-04 19:30:49 +02:00
|
|
|
}
|
2014-06-27 21:39:47 +02:00
|
|
|
DEFINE_SIZE_STATIC (sizeof(OffsetType));
|
2009-08-04 16:41:32 +02:00
|
|
|
};
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename Type> struct LOffsetTo : OffsetTo<Type, HBUINT32> {};
|
2009-08-04 16:41:32 +02:00
|
|
|
template <typename Base, typename OffsetType, typename Type>
|
2014-06-27 01:13:34 +02:00
|
|
|
static inline const Type& operator + (const Base &base, const OffsetTo<Type, OffsetType> &offset) { return offset (base); }
|
2012-09-02 02:48:22 +02:00
|
|
|
template <typename Base, typename OffsetType, typename Type>
|
2014-06-27 01:13:34 +02:00
|
|
|
static inline Type& operator + (Base &base, OffsetTo<Type, OffsetType> &offset) { return offset (base); }
|
2009-08-04 16:41:32 +02:00
|
|
|
|
2009-08-08 01:46:30 +02:00
|
|
|
|
2009-08-04 16:41:32 +02:00
|
|
|
/*
|
|
|
|
* Array Types
|
|
|
|
*/
|
|
|
|
|
2014-06-27 21:09:42 +02:00
|
|
|
/* An array with a number of elements. */
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename Type, typename LenType=HBUINT16>
|
2014-06-27 21:09:42 +02:00
|
|
|
struct ArrayOf
|
2009-05-20 05:58:54 +02:00
|
|
|
{
|
2010-04-22 06:27:39 +02:00
|
|
|
const Type *sub_array (unsigned int start_offset, unsigned int *pcount /* IN/OUT */) const
|
2009-11-04 22:59:50 +01:00
|
|
|
{
|
|
|
|
unsigned int count = len;
|
2010-05-04 04:51:19 +02:00
|
|
|
if (unlikely (start_offset > count))
|
2009-11-04 22:59:50 +01:00
|
|
|
count = 0;
|
|
|
|
else
|
|
|
|
count -= start_offset;
|
|
|
|
count = MIN (count, *pcount);
|
|
|
|
*pcount = count;
|
2010-05-11 00:20:54 +02:00
|
|
|
return array + start_offset;
|
2009-11-04 22:59:50 +01:00
|
|
|
}
|
|
|
|
|
2009-05-20 05:58:54 +02:00
|
|
|
inline const Type& operator [] (unsigned int i) const
|
|
|
|
{
|
2010-05-04 04:51:19 +02:00
|
|
|
if (unlikely (i >= len)) return Null(Type);
|
2010-05-11 00:20:54 +02:00
|
|
|
return array[i];
|
2009-05-17 06:54:25 +02:00
|
|
|
}
|
2012-08-30 03:08:59 +02:00
|
|
|
inline Type& operator [] (unsigned int i)
|
|
|
|
{
|
|
|
|
return array[i];
|
|
|
|
}
|
2010-10-02 00:58:50 +02:00
|
|
|
inline unsigned int get_size (void) const
|
2010-05-07 01:33:31 +02:00
|
|
|
{ return len.static_size + len * Type::static_size; }
|
2009-05-18 08:03:58 +02:00
|
|
|
|
2012-09-04 05:28:34 +02:00
|
|
|
inline bool serialize (hb_serialize_context_t *c,
|
|
|
|
unsigned int items_len)
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SERIALIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!c->extend_min (*this))) return_trace (false);
|
2012-09-04 05:28:34 +02:00
|
|
|
len.set (items_len); /* TODO(serialize) Overflow? */
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!c->extend (*this))) return_trace (false);
|
|
|
|
return_trace (true);
|
2012-09-04 05:28:34 +02:00
|
|
|
}
|
|
|
|
|
2012-09-02 03:43:38 +02:00
|
|
|
inline bool serialize (hb_serialize_context_t *c,
|
2012-09-05 00:17:57 +02:00
|
|
|
Supplier<Type> &items,
|
2012-09-02 03:43:38 +02:00
|
|
|
unsigned int items_len)
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SERIALIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!serialize (c, items_len))) return_trace (false);
|
2012-09-05 02:10:17 +02:00
|
|
|
for (unsigned int i = 0; i < items_len; i++)
|
2012-09-06 04:19:28 +02:00
|
|
|
array[i] = items[i];
|
2018-02-10 20:15:57 +01:00
|
|
|
items += items_len;
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (true);
|
2012-09-02 03:43:38 +02:00
|
|
|
}
|
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!sanitize_shallow (c))) return_trace (false);
|
2010-11-03 20:11:04 +01:00
|
|
|
|
2010-04-21 06:49:40 +02:00
|
|
|
/* Note: for structs that do not reference other structs,
|
|
|
|
* we do not need to call their sanitize() as we already did
|
2010-11-03 20:11:04 +01:00
|
|
|
* a bound check on the aggregate array size. We just include
|
|
|
|
* a small unreachable expression to make sure the structs
|
|
|
|
* pointed to do have a simple sanitize(), ie. they do not
|
|
|
|
* reference other structs via offsets.
|
2010-04-21 06:49:40 +02:00
|
|
|
*/
|
2010-11-03 20:11:04 +01:00
|
|
|
(void) (false && array[0].sanitize (c));
|
|
|
|
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (true);
|
2009-08-04 06:58:28 +02:00
|
|
|
}
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!sanitize_shallow (c))) return_trace (false);
|
2009-08-04 16:23:01 +02:00
|
|
|
unsigned int count = len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
2010-05-13 20:18:49 +02:00
|
|
|
if (unlikely (!array[i].sanitize (c, base)))
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (false);
|
|
|
|
return_trace (true);
|
2009-08-04 16:23:01 +02:00
|
|
|
}
|
2010-05-05 04:46:21 +02:00
|
|
|
template <typename T>
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c, const void *base, T user_data) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!sanitize_shallow (c))) return_trace (false);
|
2009-08-04 19:30:49 +02:00
|
|
|
unsigned int count = len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
2010-05-13 20:18:49 +02:00
|
|
|
if (unlikely (!array[i].sanitize (c, base, user_data)))
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (false);
|
|
|
|
return_trace (true);
|
2009-08-04 19:30:49 +02:00
|
|
|
}
|
2009-08-04 06:58:28 +02:00
|
|
|
|
2014-05-09 00:24:31 +02:00
|
|
|
template <typename SearchType>
|
2014-06-19 21:39:18 +02:00
|
|
|
inline int lsearch (const SearchType &x) const
|
2014-05-09 00:24:31 +02:00
|
|
|
{
|
|
|
|
unsigned int count = len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
if (!this->array[i].cmp (x))
|
|
|
|
return i;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2018-02-08 04:13:10 +01:00
|
|
|
inline void qsort (void)
|
|
|
|
{
|
|
|
|
::qsort (array, len, sizeof (Type), Type::cmp);
|
|
|
|
}
|
|
|
|
|
2010-05-04 20:28:18 +02:00
|
|
|
private:
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize_shallow (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2017-11-01 01:11:10 +01:00
|
|
|
return_trace (len.sanitize (c) && c->check_array (array, Type::static_size, len));
|
2010-05-04 20:28:18 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
2009-08-04 16:41:32 +02:00
|
|
|
LenType len;
|
2010-05-11 00:20:54 +02:00
|
|
|
Type array[VAR];
|
2010-05-10 22:57:29 +02:00
|
|
|
public:
|
2010-05-11 01:01:17 +02:00
|
|
|
DEFINE_SIZE_ARRAY (sizeof (LenType), array);
|
2009-05-18 08:03:58 +02:00
|
|
|
};
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename Type> struct LArrayOf : ArrayOf<Type, HBUINT32> {};
|
2009-05-18 08:03:58 +02:00
|
|
|
|
2009-08-04 16:41:32 +02:00
|
|
|
/* Array of Offset's */
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename Type, typename OffsetType=HBUINT16>
|
2016-09-10 00:39:52 +02:00
|
|
|
struct OffsetArrayOf : ArrayOf<OffsetTo<Type, OffsetType> > {};
|
2009-08-04 16:41:32 +02:00
|
|
|
|
2009-08-15 00:40:56 +02:00
|
|
|
/* Array of offsets relative to the beginning of the array itself. */
|
|
|
|
template <typename Type>
|
|
|
|
struct OffsetListOf : OffsetArrayOf<Type>
|
|
|
|
{
|
|
|
|
inline const Type& operator [] (unsigned int i) const
|
|
|
|
{
|
2010-05-04 04:51:19 +02:00
|
|
|
if (unlikely (i >= this->len)) return Null(Type);
|
2010-05-11 00:20:54 +02:00
|
|
|
return this+this->array[i];
|
2009-08-15 00:40:56 +02:00
|
|
|
}
|
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (OffsetArrayOf<Type>::sanitize (c, this));
|
2009-08-15 00:40:56 +02:00
|
|
|
}
|
2010-05-05 04:46:21 +02:00
|
|
|
template <typename T>
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c, T user_data) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (OffsetArrayOf<Type>::sanitize (c, this, user_data));
|
2009-08-15 00:40:56 +02:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2014-06-27 21:27:15 +02:00
|
|
|
/* An array starting at second element. */
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename Type, typename LenType=HBUINT16>
|
2009-05-20 05:58:54 +02:00
|
|
|
struct HeadlessArrayOf
|
|
|
|
{
|
|
|
|
inline const Type& operator [] (unsigned int i) const
|
|
|
|
{
|
2010-05-04 04:51:19 +02:00
|
|
|
if (unlikely (i >= len || !i)) return Null(Type);
|
2010-05-11 00:20:54 +02:00
|
|
|
return array[i-1];
|
2009-05-18 08:03:58 +02:00
|
|
|
}
|
2010-10-02 00:58:50 +02:00
|
|
|
inline unsigned int get_size (void) const
|
2010-05-07 01:33:31 +02:00
|
|
|
{ return len.static_size + (len ? len - 1 : 0) * Type::static_size; }
|
2009-05-17 06:54:25 +02:00
|
|
|
|
2012-09-05 00:17:57 +02:00
|
|
|
inline bool serialize (hb_serialize_context_t *c,
|
|
|
|
Supplier<Type> &items,
|
|
|
|
unsigned int items_len)
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SERIALIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!c->extend_min (*this))) return_trace (false);
|
2012-09-05 00:17:57 +02:00
|
|
|
len.set (items_len); /* TODO(serialize) Overflow? */
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!items_len)) return_trace (true);
|
|
|
|
if (unlikely (!c->extend (*this))) return_trace (false);
|
2012-09-06 04:19:28 +02:00
|
|
|
for (unsigned int i = 0; i < items_len - 1; i++)
|
|
|
|
array[i] = items[i];
|
2018-02-10 20:15:57 +01:00
|
|
|
items += items_len - 1;
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (true);
|
2012-09-05 00:17:57 +02:00
|
|
|
}
|
|
|
|
|
2015-02-17 15:27:44 +01:00
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
2012-11-23 21:32:14 +01:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (unlikely (!sanitize_shallow (c))) return_trace (false);
|
2010-11-03 20:11:04 +01:00
|
|
|
|
2010-04-21 06:49:40 +02:00
|
|
|
/* Note: for structs that do not reference other structs,
|
|
|
|
* we do not need to call their sanitize() as we already did
|
2010-11-03 20:11:04 +01:00
|
|
|
* a bound check on the aggregate array size. We just include
|
|
|
|
* a small unreachable expression to make sure the structs
|
|
|
|
* pointed to do have a simple sanitize(), ie. they do not
|
|
|
|
* reference other structs via offsets.
|
2010-04-21 06:49:40 +02:00
|
|
|
*/
|
2010-11-03 20:11:04 +01:00
|
|
|
(void) (false && array[0].sanitize (c));
|
|
|
|
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (true);
|
2009-08-04 06:58:28 +02:00
|
|
|
}
|
|
|
|
|
2017-11-01 01:10:40 +01:00
|
|
|
private:
|
|
|
|
inline bool sanitize_shallow (hb_sanitize_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
2017-11-01 01:11:10 +01:00
|
|
|
return_trace (len.sanitize (c) &&
|
2017-11-01 01:10:40 +01:00
|
|
|
(!len || c->check_array (array, Type::static_size, len - 1)));
|
|
|
|
}
|
|
|
|
|
|
|
|
public:
|
2014-06-27 21:27:15 +02:00
|
|
|
LenType len;
|
2010-05-11 00:20:54 +02:00
|
|
|
Type array[VAR];
|
2010-05-11 00:08:46 +02:00
|
|
|
public:
|
2014-06-27 21:27:15 +02:00
|
|
|
DEFINE_SIZE_ARRAY (sizeof (LenType), array);
|
2009-05-17 06:54:25 +02:00
|
|
|
};
|
|
|
|
|
2006-12-22 04:31:10 +01:00
|
|
|
|
2017-11-01 03:05:37 +01:00
|
|
|
/*
|
|
|
|
* An array with sorted elements. Supports binary searching.
|
|
|
|
*/
|
2018-01-10 03:07:30 +01:00
|
|
|
template <typename Type, typename LenType=HBUINT16>
|
2014-06-27 21:09:42 +02:00
|
|
|
struct SortedArrayOf : ArrayOf<Type, LenType>
|
2014-05-09 00:21:04 +02:00
|
|
|
{
|
2010-07-08 06:40:04 +02:00
|
|
|
template <typename SearchType>
|
2014-06-19 21:39:18 +02:00
|
|
|
inline int bsearch (const SearchType &x) const
|
2013-04-19 20:33:17 +02:00
|
|
|
{
|
|
|
|
/* Hand-coded bsearch here since this is in the hot inner loop. */
|
2018-01-11 18:19:42 +01:00
|
|
|
const Type *arr = this->array;
|
2013-04-19 20:33:17 +02:00
|
|
|
int min = 0, max = (int) this->len - 1;
|
|
|
|
while (min <= max)
|
|
|
|
{
|
|
|
|
int mid = (min + max) / 2;
|
2018-01-11 18:19:42 +01:00
|
|
|
int c = arr[mid].cmp (x);
|
2013-04-19 20:33:17 +02:00
|
|
|
if (c < 0)
|
|
|
|
max = mid - 1;
|
|
|
|
else if (c > 0)
|
|
|
|
min = mid + 1;
|
|
|
|
else
|
|
|
|
return mid;
|
2012-06-09 06:50:40 +02:00
|
|
|
}
|
2013-04-19 20:33:17 +02:00
|
|
|
return -1;
|
2010-07-08 06:40:04 +02:00
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2017-11-01 03:05:37 +01:00
|
|
|
/*
|
|
|
|
* Binary-search arrays
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct BinSearchHeader
|
|
|
|
{
|
|
|
|
inline operator uint32_t (void) const { return len; }
|
|
|
|
|
|
|
|
inline bool sanitize (hb_sanitize_context_t *c) const
|
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
|
|
|
return_trace (c->check_struct (this));
|
|
|
|
}
|
|
|
|
|
2018-02-08 04:13:10 +01:00
|
|
|
inline void set (unsigned int v)
|
|
|
|
{
|
|
|
|
len.set (v);
|
|
|
|
assert (len == v);
|
|
|
|
entrySelectorZ.set (MAX (1u, _hb_bit_storage (v)) - 1);
|
|
|
|
searchRangeZ.set (16 * (1u << entrySelectorZ));
|
2018-02-21 03:13:41 +01:00
|
|
|
rangeShiftZ.set (v * 16 > searchRangeZ
|
|
|
|
? 16 * v - searchRangeZ
|
|
|
|
: 0);
|
2018-02-08 04:13:10 +01:00
|
|
|
}
|
|
|
|
|
2017-11-01 03:05:37 +01:00
|
|
|
protected:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 len;
|
|
|
|
HBUINT16 searchRangeZ;
|
|
|
|
HBUINT16 entrySelectorZ;
|
|
|
|
HBUINT16 rangeShiftZ;
|
2017-11-01 03:05:37 +01:00
|
|
|
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (8);
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename Type>
|
2017-11-04 17:01:11 +01:00
|
|
|
struct BinSearchArrayOf : SortedArrayOf<Type, BinSearchHeader> {};
|
2017-11-01 03:05:37 +01:00
|
|
|
|
2010-07-08 06:40:04 +02:00
|
|
|
|
2017-01-10 07:22:37 +01:00
|
|
|
/* Lazy struct and blob loaders. */
|
|
|
|
|
2017-01-10 08:50:56 +01:00
|
|
|
/* Logic is shared between hb_lazy_loader_t and hb_lazy_table_loader_t */
|
2017-01-10 07:22:37 +01:00
|
|
|
template <typename T>
|
|
|
|
struct hb_lazy_loader_t
|
|
|
|
{
|
|
|
|
inline void init (hb_face_t *face_)
|
|
|
|
{
|
|
|
|
face = face_;
|
2017-10-15 12:11:08 +02:00
|
|
|
instance = nullptr;
|
2017-01-10 07:22:37 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
inline void fini (void)
|
|
|
|
{
|
|
|
|
if (instance && instance != &OT::Null(T))
|
|
|
|
{
|
|
|
|
instance->fini();
|
|
|
|
free (instance);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-10 08:50:56 +01:00
|
|
|
inline const T* get (void) const
|
2017-01-10 07:22:37 +01:00
|
|
|
{
|
|
|
|
retry:
|
|
|
|
T *p = (T *) hb_atomic_ptr_get (&instance);
|
|
|
|
if (unlikely (!p))
|
|
|
|
{
|
|
|
|
p = (T *) calloc (1, sizeof (T));
|
|
|
|
if (unlikely (!p))
|
|
|
|
p = const_cast<T *> (&OT::Null(T));
|
|
|
|
else
|
|
|
|
p->init (face);
|
2017-10-15 12:11:08 +02:00
|
|
|
if (unlikely (!hb_atomic_ptr_cmpexch (const_cast<T **>(&instance), nullptr, p)))
|
2017-01-10 07:22:37 +01:00
|
|
|
{
|
|
|
|
if (p != &OT::Null(T))
|
|
|
|
p->fini ();
|
|
|
|
goto retry;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2017-01-10 08:50:56 +01:00
|
|
|
inline const T* operator-> (void) const
|
|
|
|
{
|
|
|
|
return get ();
|
|
|
|
}
|
|
|
|
|
2017-01-10 07:22:37 +01:00
|
|
|
private:
|
|
|
|
hb_face_t *face;
|
|
|
|
T *instance;
|
|
|
|
};
|
|
|
|
|
2017-01-10 08:50:56 +01:00
|
|
|
/* Logic is shared between hb_lazy_loader_t and hb_lazy_table_loader_t */
|
2017-01-10 07:45:25 +01:00
|
|
|
template <typename T>
|
|
|
|
struct hb_lazy_table_loader_t
|
|
|
|
{
|
|
|
|
inline void init (hb_face_t *face_)
|
|
|
|
{
|
|
|
|
face = face_;
|
2017-10-15 12:11:08 +02:00
|
|
|
blob = nullptr;
|
2018-01-15 21:37:55 +01:00
|
|
|
instance = nullptr;
|
2017-01-10 07:45:25 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
inline void fini (void)
|
|
|
|
{
|
|
|
|
hb_blob_destroy (blob);
|
|
|
|
}
|
|
|
|
|
2017-01-10 08:50:56 +01:00
|
|
|
inline const T* get (void) const
|
2017-01-10 07:45:25 +01:00
|
|
|
{
|
|
|
|
retry:
|
2017-01-11 20:58:13 +01:00
|
|
|
T *p = (T *) hb_atomic_ptr_get (&instance);
|
2017-01-10 07:45:25 +01:00
|
|
|
if (unlikely (!p))
|
|
|
|
{
|
2018-01-09 15:48:51 +01:00
|
|
|
hb_blob_t *blob_ = OT::Sanitizer<T>().sanitize (face->reference_table (T::tableTag));
|
2017-01-11 20:58:13 +01:00
|
|
|
p = const_cast<T *>(OT::Sanitizer<T>::lock_instance (blob_));
|
2017-10-15 12:11:08 +02:00
|
|
|
if (!hb_atomic_ptr_cmpexch (const_cast<T **>(&instance), nullptr, p))
|
2017-01-10 07:45:25 +01:00
|
|
|
{
|
|
|
|
hb_blob_destroy (blob_);
|
|
|
|
goto retry;
|
|
|
|
}
|
|
|
|
blob = blob_;
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
2017-01-10 08:50:56 +01:00
|
|
|
inline const T* operator-> (void) const
|
|
|
|
{
|
|
|
|
return get();
|
|
|
|
}
|
|
|
|
|
2017-01-10 07:45:25 +01:00
|
|
|
hb_face_t *face;
|
2017-01-10 08:50:56 +01:00
|
|
|
mutable hb_blob_t *blob;
|
2018-01-15 21:37:55 +01:00
|
|
|
private:
|
|
|
|
mutable T *instance;
|
2017-01-10 07:45:25 +01:00
|
|
|
};
|
|
|
|
|
2017-01-10 07:22:37 +01:00
|
|
|
|
2012-11-17 03:49:54 +01:00
|
|
|
} /* namespace OT */
|
2012-08-28 23:57:49 +02:00
|
|
|
|
2010-07-23 21:11:18 +02:00
|
|
|
|
2009-11-05 00:12:09 +01:00
|
|
|
#endif /* HB_OPEN_TYPE_PRIVATE_HH */
|