harfbuzz/src/hb-open-type-private.hh

1314 lines
36 KiB
C++
Raw Normal View History

2008-01-23 22:14:38 +01:00
/*
2011-04-21 23:14:28 +02:00
* Copyright © 2007,2008,2009,2010 Red Hat, Inc.
* 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
* 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
#include "hb-private.hh"
#include "hb-blob-private.hh"
2017-01-10 07:45:25 +01:00
#include "hb-face-private.hh"
2008-01-23 23:01:55 +01:00
namespace OT {
2012-11-23 19:27:16 +01:00
/*
* Casts
*/
/* Cast to struct T, reference to reference */
template<typename Type, typename TObject>
static inline const Type& CastR(const TObject &X)
{ return reinterpret_cast<const Type&> (X); }
template<typename Type, typename TObject>
static inline Type& CastR(TObject &X)
{ return reinterpret_cast<Type&> (X); }
/* Cast to struct T, pointer to pointer */
template<typename Type, typename TObject>
static inline const Type* CastP(const TObject *X)
{ return reinterpret_cast<const Type*> (X); }
template<typename Type, typename TObject>
static inline Type* CastP(TObject *X)
{ return reinterpret_cast<Type*> (X); }
/* StructAtOffset<T>(P,Ofs) returns the struct T& that is placed at memory
* location pointed to by P plus Ofs bytes. */
template<typename Type>
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); }
template<typename Type>
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
/* 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() */
template<typename Type, typename TObject>
static inline const Type& StructAfter(const TObject &X)
{ return StructAtOffset<Type>(&X, X.get_size()); }
template<typename Type, typename TObject>
static inline Type& StructAfter(TObject &X)
{ return StructAtOffset<Type>(&X, X.get_size()); }
/*
* 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 \
{ \
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
#define DEFINE_SIZE_STATIC(size) \
2012-06-06 09:07:01 +02:00
DEFINE_INSTANCE_ASSERTION (sizeof (*this) == (size)); \
static const unsigned int static_size = (size); \
static const unsigned int min_size = (size); \
inline unsigned int get_size (void) const { return (size); }
2010-05-11 00:47:48 +02:00
#define DEFINE_SIZE_UNION(size, _member) \
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)); \
static const unsigned int min_size = (size)
#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) \
static const unsigned int min_size = (size)
#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) \
static const unsigned int min_size = (size)
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; }
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
*/
/* This limits sanitizing time on really broken fonts. */
#ifndef HB_SANITIZE_MAX_EDITS
#define HB_SANITIZE_MAX_EDITS 32
#endif
#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),
writable (false), edit_count (0), max_ops (0),
blob (nullptr),
num_glyphs (65536),
num_glyphs_set (false) {}
2015-10-09 18:20:58 +02:00
inline const char *get_name (void) { return "SANITIZE"; }
template <typename T, typename F>
inline bool may_dispatch (const T *obj, const F *format)
{ return format->sanitize (this); }
template <typename T>
inline return_t dispatch (const T &obj) { return obj.sanitize (this); }
static return_t default_return_value (void) { return true; }
static return_t no_dispatch_return_value (void) { return false; }
bool stop_sublookup_iteration (const return_t r) const { return !r; }
2011-06-15 15:49:58 +02:00
inline void init (hb_blob_t *b)
{
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;
}
inline void set_num_glyphs (unsigned int num_glyphs_)
{
num_glyphs = num_glyphs_;
num_glyphs_set = true;
}
2018-07-17 18:45:25 +02:00
inline unsigned int get_num_glyphs (void) { return num_glyphs; }
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);
2018-05-08 11:53:03 +02:00
this->end = this->start + this->blob->length;
assert (this->start <= this->end); /* Must not overflow. */
this->max_ops = MAX ((unsigned int) (this->end - this->start) * HB_SANITIZE_MAX_OPS_FACTOR,
(unsigned) HB_SANITIZE_MAX_OPS_MIN);
this->edit_count = 0;
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));
}
2012-05-11 03:16:57 +02:00
inline void end_processing (void)
{
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
hb_blob_destroy (this->blob);
2017-10-15 12:11:08 +02:00
this->blob = nullptr;
this->start = this->end = nullptr;
}
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-10 23:55:03 +02:00
const char *p = (const char *) base;
bool ok = this->max_ops-- > 0 &&
this->start <= p &&
p <= this->end &&
(unsigned int) (this->end - p) >= len;
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,
this->start, this->end,
ok ? "OK" : "OUT-OF-RANGE");
return likely (ok);
}
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-10 23:55:03 +02:00
const char *p = (const char *) base;
bool overflows = hb_unsigned_mul_overflows (len, record_size);
unsigned int array_size = record_size * len;
bool ok = !overflows && this->check_range (base, array_size);
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");
return likely (ok);
}
template <typename Type>
inline bool check_struct (const Type *obj) const
{
return likely (this->check_range (obj, obj->min_size));
}
inline bool may_edit (const void *base, unsigned int len)
{
if (this->edit_count >= HB_SANITIZE_MAX_EDITS)
return false;
2010-05-10 23:55:03 +02:00
const char *p = (const char *) base;
this->edit_count++;
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");
return this->writable;
}
2014-06-05 00:42:32 +02:00
template <typename Type, typename ValueType>
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)) {
const_cast<Type *> (obj)->set (v);
2014-06-05 00:42:32 +02:00
return true;
}
return false;
}
2018-07-17 18:45:25 +02:00
template <typename Type>
inline hb_blob_t *sanitize_blob (hb_blob_t *blob)
{
2009-08-05 02:52:47 +02:00
bool sane;
2018-07-17 18:45:25 +02:00
init (blob);
2011-05-07 04:28:26 +02:00
2009-08-05 02:52:47 +02:00
retry:
2018-07-17 18:45:25 +02:00
DEBUG_MSG_FUNC (SANITIZE, start, "start");
2009-08-05 05:01:23 +02:00
2018-07-17 18:45:25 +02:00
start_processing ();
2009-08-05 02:52:47 +02:00
2018-07-17 18:45:25 +02:00
if (unlikely (!start))
{
end_processing ();
2010-05-11 02:07:56 +02:00
return blob;
}
2018-07-17 18:45:25 +02:00
Type *t = CastP<Type> (const_cast<char *> (start));
2009-08-05 02:52:47 +02:00
2018-07-17 18:45:25 +02:00
sane = t->sanitize (this);
if (sane)
{
if (edit_count)
{
DEBUG_MSG_FUNC (SANITIZE, start, "passed first round with %d edits; going for second round", edit_count);
2009-08-20 00:16:50 +02:00
/* sanitize again to ensure no toe-stepping */
2018-07-17 18:45:25 +02:00
edit_count = 0;
sane = t->sanitize (this);
if (edit_count) {
DEBUG_MSG_FUNC (SANITIZE, start, "requested %d edits in second round; FAILLING", edit_count);
2009-08-05 02:52:47 +02:00
sane = false;
}
}
2018-07-17 18:45:25 +02:00
}
else
{
if (edit_count && !writable) {
start = hb_blob_get_data_writable (blob, nullptr);
end = start + blob->length;
if (start)
{
writable = true;
2011-05-07 04:28:26 +02:00
/* ok, we made it writable by relocating. try again */
2018-07-17 18:45:25 +02:00
DEBUG_MSG_FUNC (SANITIZE, start, "retry");
2011-05-07 04:28:26 +02:00
goto retry;
}
2009-08-05 02:52:47 +02:00
}
}
2018-07-17 18:45:25 +02:00
end_processing ();
2011-05-11 20:30:56 +02:00
2018-07-17 18:45:25 +02:00
DEBUG_MSG_FUNC (SANITIZE, start, sane ? "PASSED" : "FAILED");
2009-08-05 02:52:47 +02:00
if (sane)
{
blob->lock ();
2009-08-05 02:52:47 +02:00
return blob;
}
else
{
2009-08-05 02:52:47 +02:00
hb_blob_destroy (blob);
return hb_blob_get_empty ();
2009-08-05 02:52:47 +02:00
}
}
2010-05-11 01:51:57 +02:00
template <typename Type>
2018-07-23 07:40:32 +02:00
inline hb_blob_t *reference_table (const hb_face_t *face, hb_tag_t tableTag = Type::tableTag)
{
if (!num_glyphs_set)
set_num_glyphs (face->get_num_glyphs ());
return sanitize_blob<Type> (face->reference_table (tableTag));
}
2018-07-17 18:45:25 +02:00
mutable unsigned int debug_depth;
const char *start, *end;
private:
bool writable;
unsigned int edit_count;
mutable int max_ops;
hb_blob_t *blob;
unsigned int num_glyphs;
bool num_glyphs_set;
2018-07-17 18:45:25 +02:00
};
2012-08-30 02:26:08 +02:00
/*
* Serialize
*/
struct hb_serialize_context_t
{
inline hb_serialize_context_t (void *start_, unsigned int size)
2012-08-30 02:26:08 +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-08-30 02:26:08 +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));
return start_embed<Type> ();
2012-08-30 02:26:08 +02:00
}
inline void end_serialize (void)
2012-08-30 02:26:08 +02:00
{
DEBUG_MSG_LEVEL (SERIALIZE, this->start, 0, -1,
"end [%p..%p] serialized %d bytes; %s",
2012-08-30 02:26:08 +02:00
this->start, this->end,
(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");
}
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>
inline Type *allocate_size (unsigned int size)
2012-08-30 02:26:08 +02: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
}
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>
inline Type *allocate_min (void)
2012-08-30 03:08:59 +02:00
{
return this->allocate_size<Type> (Type::min_size);
2012-08-30 03:08:59 +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>
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 ();
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>
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;
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>
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
}
inline void truncate (void *new_head)
2012-08-30 02:26:08 +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;
};
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))
{
head = array;
len = len_;
2018-02-08 04:13:10 +01:00
stride = stride_;
}
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);
}
inline Supplier<Type> & operator += (unsigned int count)
{
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);
return *this;
}
private:
inline Supplier (const Supplier<Type> &); /* Disallow copy */
inline Supplier<Type>& operator= (const Supplier<Type> &); /* Disallow copy */
unsigned int len;
2018-02-08 04:13:10 +01:00
unsigned int stride;
const Type *head;
};
2006-12-22 08:21:55 +01: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
*/
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:
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:
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;
}
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: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:
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;
}
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: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
{
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); }
template <typename Type2>
inline int cmp (Type2 a) const
{
Type b = v;
if (sizeof (Type) < sizeof (int) && sizeof (Type2) < sizeof (int))
return (int) a - (int) b;
else
return a < b ? -1 : a == b ? 0 : +1;
}
inline bool sanitize (hb_sanitize_context_t *c) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
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
};
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. */
typedef IntType<uint32_t, 3> HBUINT24; /* 24-bit unsigned integer. */
2010-04-21 09:11:46 +02:00
/* 16-bit signed integer (HBINT16) that describes a quantity in FUnits. */
typedef HBINT16 FWORD;
2011-08-17 14:43:45 +02: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). */
struct F2DOT14 : HBINT16
2016-03-01 08:41:53 +01:00
{
// 16384 means 1<<14
inline float to_float (void) const { return ((int32_t) v) / 16384.f; }
inline void set_float (float f) { v.set (round (f * 16384.f)); }
2016-03-01 08:41:53 +01:00
public:
DEFINE_SIZE_STATIC (2);
};
/* 32-bit signed fixed-point number (16.16). */
struct Fixed : HBINT32
{
// 65536 means 1<<16
inline float to_float (void) const { return ((int32_t) v) / 65536.f; }
inline void set_float (float f) { v.set (round (f * 65536.f)); }
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
{
inline bool sanitize (hb_sanitize_context_t *c) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
return_trace (likely (c->check_struct (this)));
2010-05-19 17:47:17 +02:00
}
protected:
HBINT32 major;
HBUINT32 minor;
2010-05-19 17:47:17 +02:00
public:
DEFINE_SIZE_STATIC (8);
};
/* Array of four uint8s (length = 32 bits) used to identify a script, language
* system, feature, or baseline */
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); }
public:
DEFINE_SIZE_STATIC (4);
};
DEFINE_NULL_DATA (OT, Tag, " ");
/* Glyph index number, same as uint16 (length = 16 bits) */
typedef HBUINT16 GlyphID;
2018-03-14 16:31:53 +01:00
/* Name-table index, same as uint16 (length = 16 bits) */
typedef HBUINT16 NameID;
2010-05-11 04:22:22 +02:00
/* Script/language-system/feature index */
struct Index : HBUINT16 {
static const unsigned int NOT_FOUND_INDEX = 0xFFFFu;
2010-05-11 04:22:22 +02:00
};
DEFINE_NULL_DATA (OT, Index, "\xff\xff");
2010-05-11 04:22:22 +02:00
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
{
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));
};
2009-05-25 08:27:29 +02:00
typedef Offset<HBUINT16> Offset16;
typedef Offset<HBUINT32> Offset32;
2017-11-15 06:09:03 +01:00
/* CheckSum */
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. */
static inline uint32_t CalcTableChecksum (const HBUINT32 *Table, uint32_t Length)
2009-05-20 05:58:54 +02:00
{
uint32_t Sum = 0L;
assert (0 == (Length & 3));
const HBUINT32 *EndPtr = Table + Length / HBUINT32::static_size;
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)
{ set (CalcTableChecksum ((const HBUINT32 *) data, length)); }
2013-07-21 23:05:02 +02:00
public:
DEFINE_SIZE_STATIC (4);
};
/*
* Version Numbers
*/
template <typename FixedType=HBUINT16>
2009-05-24 07:03:24 +02:00
struct FixedVersion
2009-05-20 05:58:54 +02:00
{
inline uint32_t to_int (void) const { return (major << (sizeof(FixedType) * 8)) + minor; }
2009-05-24 18:30:40 +02:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
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;
public:
2016-02-22 03:44:45 +01:00
DEFINE_SIZE_STATIC (2 * sizeof(FixedType));
};
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
*/
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;
if (unlikely (!offset)) return Null(Type);
return StructAtOffset<const Type> (base, offset);
}
inline Type& operator () (void *base) const
{
unsigned int offset = *this;
if (unlikely (!offset)) return Crap(Type);
return StructAtOffset<Type> (base, offset);
2009-08-04 16:41:32 +02:00
}
2012-09-02 02:48:22 +02: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
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
if (unlikely (!c->check_struct (this))) return_trace (false);
2009-08-04 16:41:32 +02:00
unsigned int offset = *this;
if (unlikely (!offset)) return_trace (true);
if (unlikely (!c->check_range (base, offset))) return_trace (false);
const Type &obj = StructAtOffset<Type> (base, offset);
return_trace (likely (obj.sanitize (c)) || neuter (c));
2009-08-04 16:41:32 +02:00
}
template <typename T>
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);
if (unlikely (!c->check_struct (this))) return_trace (false);
2009-08-04 19:30:49 +02:00
unsigned int offset = *this;
if (unlikely (!offset)) return_trace (true);
if (unlikely (!c->check_range (base, offset))) return_trace (false);
const Type &obj = StructAtOffset<Type> (base, offset);
return_trace (likely (obj.sanitize (c, user_data)) || neuter (c));
}
/* Set the offset to Null */
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
};
template <typename Type> struct LOffsetTo : OffsetTo<Type, HBUINT32> {};
2009-08-04 16:41:32 +02:00
template <typename Base, typename OffsetType, typename Type>
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>
static inline Type& operator + (Base &base, OffsetTo<Type, OffsetType> &offset) { return offset (base); }
2009-08-04 16:41:32 +02:00
2009-08-04 16:41:32 +02:00
/*
* Array Types
*/
2018-03-14 16:18:42 +01:00
/* TODO Use it in ArrayOf, HeadlessArrayOf, and other places around the code base?? */
template <typename Type>
struct UnsizedArrayOf
{
inline const Type& operator [] (unsigned int i) const { return arrayZ[i]; }
inline Type& operator [] (unsigned int i) { return arrayZ[i]; }
inline bool sanitize (hb_sanitize_context_t *c, unsigned int count) const
{
TRACE_SANITIZE (this);
if (unlikely (!sanitize_shallow (c, count))) return_trace (false);
/* Note: for structs that do not reference other structs,
* we do not need to call their sanitize() as we already did
* 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.
*/
(void) (false && arrayZ[0].sanitize (c));
return_trace (true);
}
inline bool sanitize (hb_sanitize_context_t *c, unsigned int count, const void *base) const
{
TRACE_SANITIZE (this);
if (unlikely (!sanitize_shallow (c, count))) return_trace (false);
for (unsigned int i = 0; i < count; i++)
if (unlikely (!arrayZ[i].sanitize (c, base)))
return_trace (false);
return_trace (true);
}
template <typename T>
inline bool sanitize (hb_sanitize_context_t *c, unsigned int count, const void *base, T user_data) const
{
TRACE_SANITIZE (this);
if (unlikely (!sanitize_shallow (c, count))) return_trace (false);
for (unsigned int i = 0; i < count; i++)
if (unlikely (!arrayZ[i].sanitize (c, base, user_data)))
return_trace (false);
return_trace (true);
}
inline bool sanitize_shallow (hb_sanitize_context_t *c, unsigned int count) const
{
TRACE_SANITIZE (this);
return_trace (c->check_array (arrayZ, arrayZ[0].static_size, count));
}
public:
Type arrayZ[VAR];
public:
DEFINE_SIZE_ARRAY (0, arrayZ);
};
/* Unsized array of offset's */
template <typename Type, typename OffsetType>
struct UnsizedOffsetArrayOf : UnsizedArrayOf<OffsetTo<Type, OffsetType> > {};
/* Unsized array of offsets relative to the beginning of the array itself. */
template <typename Type, typename OffsetType>
struct UnsizedOffsetListOf : UnsizedOffsetArrayOf<Type, OffsetType>
{
inline const Type& operator [] (unsigned int i) const
{
return this+this->arrayZ[i];
}
inline bool sanitize (hb_sanitize_context_t *c, unsigned int count) const
{
TRACE_SANITIZE (this);
return_trace ((UnsizedOffsetArrayOf<Type, OffsetType>::sanitize (c, count, this)));
}
template <typename T>
inline bool sanitize (hb_sanitize_context_t *c, unsigned int count, T user_data) const
{
TRACE_SANITIZE (this);
return_trace ((UnsizedOffsetArrayOf<Type, OffsetType>::sanitize (c, count, this, user_data)));
}
};
/* An array with a number of elements. */
template <typename Type, typename LenType=HBUINT16>
struct ArrayOf
2009-05-20 05:58:54 +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;
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;
2018-05-09 01:56:11 +02:00
return arrayZ + 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
{
if (unlikely (i >= len)) return Null(Type);
2018-05-09 01:56:11 +02:00
return arrayZ[i];
2009-05-17 06:54:25 +02:00
}
2012-08-30 03:08:59 +02:00
inline Type& operator [] (unsigned int i)
{
if (unlikely (i >= len)) return Crap(Type);
2018-05-09 01:56:11 +02:00
return arrayZ[i];
2012-08-30 03:08:59 +02:00
}
2010-10-02 00:58:50 +02:00
inline unsigned int get_size (void) const
{ return len.static_size + len * Type::static_size; }
2009-05-18 08:03:58 +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);
if (unlikely (!c->extend_min (*this))) return_trace (false);
len.set (items_len); /* TODO(serialize) Overflow? */
if (unlikely (!c->extend (*this))) return_trace (false);
return_trace (true);
}
2012-09-02 03:43:38 +02:00
inline bool serialize (hb_serialize_context_t *c,
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);
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++)
2018-05-09 01:56:11 +02:00
arrayZ[i] = items[i];
items += items_len;
return_trace (true);
2012-09-02 03:43:38 +02:00
}
inline bool sanitize (hb_sanitize_context_t *c) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
if (unlikely (!sanitize_shallow (c))) return_trace (false);
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
* 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
*/
2018-05-09 01:56:11 +02:00
(void) (false && arrayZ[0].sanitize (c));
return_trace (true);
2009-08-04 06:58:28 +02:00
}
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
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++)
2018-05-09 01:56:11 +02:00
if (unlikely (!arrayZ[i].sanitize (c, base)))
return_trace (false);
return_trace (true);
2009-08-04 16:23:01 +02:00
}
template <typename T>
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);
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++)
2018-05-09 01:56:11 +02:00
if (unlikely (!arrayZ[i].sanitize (c, base, user_data)))
return_trace (false);
return_trace (true);
2009-08-04 19:30:49 +02:00
}
2009-08-04 06:58:28 +02:00
template <typename SearchType>
inline int lsearch (const SearchType &x) const
{
unsigned int count = len;
for (unsigned int i = 0; i < count; i++)
2018-05-09 01:56:11 +02:00
if (!this->arrayZ[i].cmp (x))
return i;
return -1;
}
2018-02-08 04:13:10 +01:00
inline void qsort (void)
{
2018-05-09 01:56:11 +02:00
::qsort (arrayZ, len, sizeof (Type), Type::cmp);
2018-02-08 04:13:10 +01:00
}
2010-05-04 20:28:18 +02:00
private:
inline bool sanitize_shallow (hb_sanitize_context_t *c) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
2018-05-09 01:56:11 +02:00
return_trace (len.sanitize (c) && c->check_array (arrayZ, Type::static_size, len));
2010-05-04 20:28:18 +02:00
}
public:
2009-08-04 16:41:32 +02:00
LenType len;
2018-05-09 01:56:11 +02:00
Type arrayZ[VAR];
public:
2018-05-09 01:56:11 +02:00
DEFINE_SIZE_ARRAY (sizeof (LenType), arrayZ);
2009-05-18 08:03:58 +02:00
};
template <typename Type> struct LArrayOf : ArrayOf<Type, HBUINT32> {};
2018-07-01 12:02:00 +02:00
typedef ArrayOf<HBUINT8, HBUINT8> PString;
2009-05-18 08:03:58 +02:00
2009-08-04 16:41:32 +02:00
/* Array of Offset's */
template <typename Type, typename OffsetType=HBUINT16>
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
{
if (unlikely (i >= this->len)) return Null(Type);
2018-05-09 01:56:11 +02:00
return this+this->arrayZ[i];
2009-08-15 00:40:56 +02:00
}
inline const Type& operator [] (unsigned int i)
{
if (unlikely (i >= this->len)) return Crap(Type);
return this+this->arrayZ[i];
}
2009-08-15 00:40:56 +02:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
return_trace (OffsetArrayOf<Type>::sanitize (c, this));
2009-08-15 00:40:56 +02:00
}
template <typename T>
inline bool sanitize (hb_sanitize_context_t *c, T user_data) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
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. */
template <typename Type, typename LenType=HBUINT16>
2009-05-20 05:58:54 +02:00
struct HeadlessArrayOf
{
inline const Type& operator [] (unsigned int i) const
{
if (unlikely (i >= len || !i)) return Null(Type);
2018-05-09 01:56:11 +02:00
return arrayZ[i-1];
2009-05-18 08:03:58 +02:00
}
inline Type& operator [] (unsigned int i)
{
if (unlikely (i >= len || !i)) return Crap(Type);
return arrayZ[i-1];
}
2010-10-02 00:58:50 +02:00
inline unsigned int get_size (void) const
{ return len.static_size + (len ? len - 1 : 0) * Type::static_size; }
2009-05-17 06:54:25 +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);
if (unlikely (!c->extend_min (*this))) return_trace (false);
len.set (items_len); /* TODO(serialize) Overflow? */
if (unlikely (!items_len)) return_trace (true);
if (unlikely (!c->extend (*this))) return_trace (false);
for (unsigned int i = 0; i < items_len - 1; i++)
2018-05-09 01:56:11 +02:00
arrayZ[i] = items[i];
items += items_len - 1;
return_trace (true);
}
inline bool sanitize (hb_sanitize_context_t *c) const
{
2012-11-23 21:32:14 +01:00
TRACE_SANITIZE (this);
if (unlikely (!sanitize_shallow (c))) return_trace (false);
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
* 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
*/
2018-05-09 01:56:11 +02:00
(void) (false && arrayZ[0].sanitize (c));
return_trace (true);
2009-08-04 06:58:28 +02:00
}
private:
inline bool sanitize_shallow (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (len.sanitize (c) &&
2018-05-09 01:56:11 +02:00
(!len || c->check_array (arrayZ, Type::static_size, len - 1)));
}
public:
2014-06-27 21:27:15 +02:00
LenType len;
2018-05-09 01:56:11 +02:00
Type arrayZ[VAR];
2010-05-11 00:08:46 +02:00
public:
2018-05-09 01:56:11 +02:00
DEFINE_SIZE_ARRAY (sizeof (LenType), arrayZ);
2009-05-17 06:54:25 +02:00
};
2017-11-01 03:05:37 +01:00
/*
* An array with sorted elements. Supports binary searching.
*/
template <typename Type, typename LenType=HBUINT16>
struct SortedArrayOf : ArrayOf<Type, LenType>
2014-05-09 00:21:04 +02:00
{
2010-07-08 06:40:04 +02:00
template <typename SearchType>
inline int bsearch (const SearchType &x) const
{
/* Hand-coded bsearch here since this is in the hot inner loop. */
2018-05-09 01:56:11 +02:00
const Type *arr = this->arrayZ;
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);
if (c < 0)
max = mid - 1;
else if (c > 0)
min = mid + 1;
else
return mid;
}
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);
entrySelector.set (MAX (1u, hb_bit_storage (v)) - 1);
searchRange.set (16 * (1u << entrySelector));
rangeShift.set (v * 16 > searchRange
? 16 * v - searchRange
: 0);
2018-02-08 04:13:10 +01:00
}
2017-11-01 03:05:37 +01:00
protected:
HBUINT16 len;
HBUINT16 searchRange;
HBUINT16 entrySelector;
HBUINT16 rangeShift;
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. */
2018-05-08 11:55:20 +02:00
/* Logic is shared between hb_lazy_loader_t and hb_table_lazy_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)
{
2018-05-08 11:23:36 +02:00
if (instance && instance != &Null(T))
2017-01-10 07:22:37 +01:00
{
instance->fini();
free (instance);
}
}
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))
2018-05-08 11:23:36 +02:00
p = const_cast<T *> (&Null(T));
2017-01-10 07:22:37 +01:00
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
{
2018-05-08 11:23:36 +02:00
if (p != &Null(T))
2017-01-10 07:22:37 +01:00
p->fini ();
goto retry;
}
}
return p;
}
inline const T* operator-> (void) const
{
return get ();
}
2017-01-10 07:22:37 +01:00
private:
hb_face_t *face;
mutable T *instance;
2017-01-10 07:22:37 +01:00
};
2018-05-08 11:55:20 +02:00
/* Logic is shared between hb_lazy_loader_t and hb_table_lazy_loader_t */
2017-01-10 07:45:25 +01:00
template <typename T>
2018-05-08 11:55:20 +02:00
struct hb_table_lazy_loader_t
2017-01-10 07:45:25 +01:00
{
inline void init (hb_face_t *face_)
{
face = face_;
2017-10-15 12:11:08 +02:00
blob = nullptr;
2017-01-10 07:45:25 +01:00
}
inline void fini (void)
{
hb_blob_destroy (blob);
}
inline hb_blob_t* get_blob (void) const
2017-01-10 07:45:25 +01:00
{
retry:
hb_blob_t *b = (hb_blob_t *) hb_atomic_ptr_get (&blob);
if (unlikely (!b))
2017-01-10 07:45:25 +01:00
{
2018-07-23 07:50:58 +02:00
b = OT::hb_sanitize_context_t().reference_table<T> (face);
if (!hb_atomic_ptr_cmpexch (&blob, nullptr, b))
2017-01-10 07:45:25 +01:00
{
hb_blob_destroy (b);
2017-01-10 07:45:25 +01:00
goto retry;
}
blob = b;
2017-01-10 07:45:25 +01:00
}
return b;
}
inline const T* get (void) const
{
hb_blob_t *b = get_blob ();
return b->as<T> ();
2017-01-10 07:45:25 +01:00
}
inline const T* operator-> (void) const
{
return get();
}
private:
2017-01-10 07:45:25 +01:00
hb_face_t *face;
mutable hb_blob_t *blob;
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 */
2010-07-23 21:11:18 +02:00
2009-11-05 00:12:09 +01:00
#endif /* HB_OPEN_TYPE_PRIVATE_HH */