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

587 lines
17 KiB
C++
Raw Normal View History

2008-01-23 22:14:38 +01:00
/*
2009-05-17 11:14:33 +02:00
* Copyright (C) 2007,2008,2009 Red Hat, Inc.
2008-01-23 22:14:38 +01:00
*
* This is part of HarfBuzz, an OpenType Layout engine library.
*
* 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
*/
#ifndef HB_OPEN_TYPES_PRIVATE_HH
#define HB_OPEN_TYPES_PRIVATE_HH
#include "hb-private.h"
2009-08-04 06:58:28 +02:00
#include "hb-blob.h"
2008-01-23 23:01:55 +01:00
#define NO_INDEX ((unsigned int) 0xFFFF)
#define NO_CONTEXT ((unsigned int) 0x110000)
#define NOT_COVERED ((unsigned int) 0x110000)
#define MAX_NESTING_LEVEL 8
/*
* Casts
*/
2009-08-04 17:38:50 +02:00
#define CONST_CHARP(X) (reinterpret_cast<const char *>(X))
#define DECONST_CHARP(X) ((char *)reinterpret_cast<const char *>(X))
#define CHARP(X) (reinterpret_cast<char *>(X))
#define CONST_CAST(T,X,Ofs) (*(reinterpret_cast<const T *>(CONST_CHARP(&(X)) + Ofs)))
#define DECONST_CAST(T,X,Ofs) (*(reinterpret_cast<T *>((char *)CONST_CHARP(&(X)) + Ofs)))
#define CAST(T,X,Ofs) (*(reinterpret_cast<T *>(CHARP(&(X)) + Ofs)))
2009-08-10 04:10:39 +02:00
#define CONST_NEXT(T,X) (*(reinterpret_cast<const T *>(CONST_CHARP(&(X)) + (X).get_size ())))
#define NEXT(T,X) (*(reinterpret_cast<T *>(CHARP(&(X)) + (X).get_size ())))
2009-08-04 06:58:28 +02:00
2008-01-23 08:01:37 +01:00
/*
* Class features
*/
/* Null objects */
/* Global nul-content Null pool. Enlarge as necessary. */
static const char NullPool[16] = "";
/* Generic template for nul-content sizeof-sized Null objects. */
template <typename Type>
2009-05-20 05:58:54 +02:00
struct Null
{
2009-05-18 01:47:54 +02:00
ASSERT_STATIC (sizeof (Type) <= sizeof (NullPool));
static inline const Type &get () { return *(const Type*)NullPool; }
};
/* Specializaiton for arbitrary-content arbitrary-sized Null objects. */
#define DEFINE_NULL_DATA(Type, size, data) \
2009-05-25 09:10:06 +02:00
static const char _Null##Type[size] = data; \
template <> \
2009-05-20 05:58:54 +02:00
struct Null <Type> \
{ \
static inline const Type &get () { return *(const Type*)_Null##Type; } \
}
/* Accessor macro. */
#define Null(Type) (Null<Type>::get())
#define ASSERT_SIZE_DATA(Type, size, data) \
ASSERT_SIZE (Type, size); \
DEFINE_NULL_DATA (Type, size, data)
2008-01-23 08:01:37 +01:00
/* get_for_data() is a static class method returning a reference to an
* instance of Type located at the input data location. It's just a
2008-01-28 03:19:51 +01:00
* fancy, NULL-safe, cast! */
2008-01-24 09:11:09 +01:00
#define STATIC_DEFINE_GET_FOR_DATA(Type) \
2009-05-20 05:58:54 +02:00
static inline const Type& get_for_data (const char *data) \
{ \
if (HB_UNLIKELY (data == NULL)) return Null(Type); \
return *(const Type*)data; \
2009-05-24 06:50:27 +02:00
}
/* Like get_for_data(), but checks major version first. */
2009-08-04 08:09:34 +02:00
#define STATIC_DEFINE_GET_FOR_DATA_CHECK_MAJOR_VERSION(Type, MajorMin, MajorMax) \
2009-05-24 06:50:27 +02:00
static inline const Type& get_for_data (const char *data) \
{ \
if (HB_UNLIKELY (data == NULL)) return Null(Type); \
const Type& t = *(const Type*)data; \
2009-08-04 08:09:34 +02:00
if (HB_UNLIKELY (t.version.major < MajorMin || t.version.major > MajorMax)) return Null(Type); \
2009-05-24 06:50:27 +02:00
return t; \
}
2008-01-23 08:01:37 +01:00
2009-08-05 01:31:02 +02:00
/*
* Sanitize
*/
2009-08-06 16:27:38 +02:00
#if HB_DEBUG
2009-08-05 04:35:36 +02:00
#define SANITIZE_DEBUG_ARG_DEF , unsigned int sanitize_depth
#define SANITIZE_DEBUG_ARG , sanitize_depth + 1
2009-08-06 16:27:38 +02:00
#define SANITIZE_DEBUG_ARG_INIT , 1
2009-08-05 04:35:36 +02:00
#define SANITIZE_DEBUG() \
HB_STMT_START { \
2009-08-06 16:27:38 +02:00
if (sanitize_depth < HB_DEBUG) \
fprintf (stderr, "SANITIZE(%p) %-*d-> %s\n", \
(CONST_CHARP (this) == NullPool) ? 0 : this, \
2009-08-06 16:27:38 +02:00
sanitize_depth, sanitize_depth, \
__PRETTY_FUNCTION__); \
2009-08-05 04:35:36 +02:00
} HB_STMT_END
#else
#define SANITIZE_DEBUG_ARG_DEF
#define SANITIZE_DEBUG_ARG
#define SANITIZE_DEBUG_ARG_INIT
#define SANITIZE_DEBUG() HB_STMT_START {} HB_STMT_END
#endif
#define SANITIZE_ARG_DEF \
hb_sanitize_context_t *context SANITIZE_DEBUG_ARG_DEF
#define SANITIZE_ARG \
context SANITIZE_DEBUG_ARG
#define SANITIZE_ARG_INIT \
&context SANITIZE_DEBUG_ARG_INIT
2009-08-05 01:31:02 +02:00
typedef struct _hb_sanitize_context_t hb_sanitize_context_t;
struct _hb_sanitize_context_t
{
const char *start, *end;
int edit_count;
hb_blob_t *blob;
};
static HB_GNUC_UNUSED void
2009-08-05 02:52:47 +02:00
_hb_sanitize_init (hb_sanitize_context_t *context,
hb_blob_t *blob)
2009-08-05 01:31:02 +02:00
{
context->blob = blob;
context->start = hb_blob_lock (blob);
context->end = context->start + hb_blob_get_length (blob);
context->edit_count = 0;
2009-08-05 05:01:23 +02:00
#if HB_DEBUG
fprintf (stderr, "sanitize %p init [%p..%p] (%u bytes)\n",
2009-08-08 22:37:22 +02:00
context->blob, context->start, context->end, context->end - context->start);
2009-08-05 05:01:23 +02:00
#endif
2009-08-05 01:31:02 +02:00
}
static HB_GNUC_UNUSED void
2009-08-05 02:52:47 +02:00
_hb_sanitize_fini (hb_sanitize_context_t *context,
bool unlock)
2009-08-05 01:31:02 +02:00
{
2009-08-05 05:01:23 +02:00
#if HB_DEBUG
fprintf (stderr, "sanitize %p fini [%p..%p] %u edit requests\n",
context->blob, context->start, context->end, context->edit_count);
2009-08-05 05:01:23 +02:00
#endif
2009-08-05 01:31:02 +02:00
if (unlock)
hb_blob_unlock (context->blob);
}
2009-08-05 05:01:23 +02:00
static HB_GNUC_UNUSED inline bool
_hb_sanitize_check (SANITIZE_ARG_DEF,
const char *base,
unsigned int len)
{
2009-08-14 22:41:00 +02:00
bool ret = context->start <= base &&
base <= context->end &&
(unsigned int) (context->end - base) >= len;
#if HB_DEBUG
if (sanitize_depth < HB_DEBUG) \
fprintf (stderr, "SANITIZE(%p) %-*d-> check [%p..%p] (%d bytes) in [%p..%p] -> %s\n", \
base,
sanitize_depth, sanitize_depth,
base, base+len, len,
context->start, context->end,
ret ? "pass" : "FAIL");
#endif
return ret;
}
static HB_GNUC_UNUSED inline bool
_hb_sanitize_edit (SANITIZE_ARG_DEF,
2009-08-05 05:01:23 +02:00
const char *base HB_GNUC_UNUSED,
unsigned int len HB_GNUC_UNUSED)
2009-08-05 01:31:02 +02:00
{
2009-08-05 05:01:23 +02:00
bool perm = hb_blob_try_writeable_inplace (context->blob);
2009-08-05 03:47:29 +02:00
context->edit_count++;
2009-08-05 05:01:23 +02:00
#if HB_DEBUG
2009-08-14 22:41:00 +02:00
fprintf (stderr, "SANITIZE(%p) %-*d-> edit(%u) [%p..%p] (%d bytes) in [%p..%p] -> %s\n", \
base,
sanitize_depth, sanitize_depth,
context->edit_count,
base, base+len, len,
context->start, context->end,
perm ? "granted" : "REJECTED");
2009-08-05 05:01:23 +02:00
#endif
return perm;
2009-08-05 01:31:02 +02:00
}
#define SANITIZE(X) HB_LIKELY ((X).sanitize (SANITIZE_ARG))
#define SANITIZE2(X,Y) (SANITIZE (X) && SANITIZE (Y))
#define SANITIZE_THIS(X) HB_LIKELY ((X).sanitize (SANITIZE_ARG, CONST_CHARP(this)))
#define SANITIZE_THIS2(X,Y) (SANITIZE_THIS (X) && SANITIZE_THIS (Y))
#define SANITIZE_THIS3(X,Y,Z) (SANITIZE_THIS (X) && SANITIZE_THIS (Y) && SANITIZE_THIS(Z))
#define SANITIZE_BASE(X,B) HB_LIKELY ((X).sanitize (SANITIZE_ARG, B))
#define SANITIZE_BASE2(X,Y,B) (SANITIZE_BASE (X,B) && SANITIZE_BASE (Y,B))
#define SANITIZE_SELF() SANITIZE_OBJ (*this)
#define SANITIZE_OBJ(X) SANITIZE_MEM(&(X), sizeof (X))
#define SANITIZE_GET_SIZE() SANITIZE_SELF() && SANITIZE_MEM (this, this->get_size ())
2009-08-07 00:34:47 +02:00
/* TODO Optimize this if L is fixed (gcc magic) */
#define SANITIZE_MEM(B,L) HB_LIKELY (_hb_sanitize_check (SANITIZE_ARG, CONST_CHARP(B), (L)))
2009-08-05 01:31:02 +02:00
2009-08-07 00:34:47 +02:00
#define NEUTER(Var, Val) \
(SANITIZE_OBJ (Var) && \
_hb_sanitize_edit (SANITIZE_ARG, CONST_CHARP(&(Var)), sizeof (Var)) && \
2009-08-07 00:34:47 +02:00
((Var) = (Val), true))
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
{
static hb_blob_t *sanitize (hb_blob_t *blob) {
hb_sanitize_context_t context;
bool sane;
2009-08-07 00:34:47 +02:00
/* TODO is_sane() stuff */
2009-08-05 02:52:47 +02:00
retry:
2009-08-05 05:01:23 +02:00
#if HB_DEBUG
fprintf (stderr, "Sanitizer %p start %s\n", blob, __PRETTY_FUNCTION__);
2009-08-05 05:01:23 +02:00
#endif
2009-08-05 02:52:47 +02:00
_hb_sanitize_init (&context, blob);
2009-08-05 04:55:44 +02:00
Type *t = &CAST (Type, *DECONST_CHARP(context.start), 0);
2009-08-05 02:52:47 +02:00
2009-08-05 04:35:36 +02:00
sane = t->sanitize (SANITIZE_ARG_INIT);
2009-08-05 02:52:47 +02:00
if (sane) {
if (context.edit_count) {
2009-08-05 21:27:42 +02:00
#if HB_DEBUG
fprintf (stderr, "Sanitizer %p passed first round with %d edits; going a second round %s\n",
blob, context.edit_count, __PRETTY_FUNCTION__);
#endif
2009-08-05 02:52:47 +02:00
/* sanitize again to ensure not toe-stepping */
context.edit_count = 0;
2009-08-05 04:35:36 +02:00
sane = t->sanitize (SANITIZE_ARG_INIT);
2009-08-05 02:52:47 +02:00
if (context.edit_count) {
2009-08-05 21:27:42 +02:00
#if HB_DEBUG
2009-08-14 22:41:00 +02:00
fprintf (stderr, "Sanitizer %p requested %d edits in second round; FAILLING %s\n",
2009-08-05 21:27:42 +02:00
blob, context.edit_count, __PRETTY_FUNCTION__);
#endif
2009-08-05 02:52:47 +02:00
sane = false;
}
}
_hb_sanitize_fini (&context, true);
} else {
2009-08-05 05:01:23 +02:00
unsigned int edit_count = context.edit_count;
2009-08-05 02:52:47 +02:00
_hb_sanitize_fini (&context, true);
2009-08-05 05:01:23 +02:00
if (edit_count && !hb_blob_is_writeable (blob) && hb_blob_try_writeable (blob)) {
2009-08-05 02:52:47 +02:00
/* ok, we made it writeable by relocating. try again */
2009-08-05 05:01:23 +02:00
#if HB_DEBUG
fprintf (stderr, "Sanitizer %p retry %s\n", blob, __PRETTY_FUNCTION__);
2009-08-05 05:01:23 +02:00
#endif
2009-08-05 02:52:47 +02:00
goto retry;
}
}
2009-08-05 05:01:23 +02:00
#if HB_DEBUG
2009-08-14 22:41:00 +02:00
fprintf (stderr, "Sanitizer %p %s %s\n", blob, sane ? "passed" : "FAILED", __PRETTY_FUNCTION__);
2009-08-05 05:01:23 +02:00
#endif
2009-08-05 02:52:47 +02:00
if (sane)
return blob;
else {
hb_blob_destroy (blob);
return hb_blob_create_empty ();
}
}
static const Type& lock_instance (hb_blob_t *blob) {
2009-08-05 02:52:47 +02:00
return Type::get_for_data (hb_blob_lock (blob));
}
};
2009-04-16 01:50:16 +02:00
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
*/
2009-08-07 00:24:55 +02:00
/* TODO On machines that allow unaligned access, use this version. */
#define _DEFINE_INT_TYPE1_UNALIGNED(NAME, TYPE, BIG_ENDIAN, BYTES) \
2009-05-20 05:58:54 +02:00
struct NAME \
{ \
2009-05-25 08:41:49 +02:00
inline NAME& operator = (TYPE i) { (TYPE&) v = BIG_ENDIAN (i); return *this; } \
inline operator TYPE(void) const { return BIG_ENDIAN ((TYPE&) v); } \
inline bool operator== (NAME o) const { return (TYPE&) v == (TYPE&) o.v; } \
2009-08-05 04:35:36 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) { \
SANITIZE_DEBUG (); \
return SANITIZE_SELF (); \
} \
2009-08-07 00:24:55 +02:00
private: unsigned char v[BYTES]; \
}; \
ASSERT_SIZE (NAME, BYTES)
#define DEFINE_INT_TYPE1(NAME, TYPE, BIG_ENDIAN, BYTES) \
struct NAME \
{ \
inline NAME& operator = (TYPE i) { BIG_ENDIAN##_put_unaligned(v, i); return *this; } \
inline operator TYPE(void) const { return BIG_ENDIAN##_get_unaligned (v); } \
inline bool operator== (NAME o) const { return BIG_ENDIAN##_cmp_unaligned (v, o.v); } \
inline bool sanitize (SANITIZE_ARG_DEF) { \
SANITIZE_DEBUG (); \
return SANITIZE_SELF (); \
} \
private: unsigned char v[BYTES]; \
2009-05-17 06:54:25 +02:00
}; \
2009-05-25 08:41:49 +02:00
ASSERT_SIZE (NAME, BYTES)
2009-08-02 02:46:02 +02:00
#define DEFINE_INT_TYPE0(NAME, type, b) DEFINE_INT_TYPE1 (NAME, type##_t, hb_be_##type, b)
#define DEFINE_INT_TYPE(NAME, u, w) DEFINE_INT_TYPE0 (NAME, u##int##w, (w / 8))
2009-05-17 06:54:25 +02:00
2006-12-22 08:21:55 +01:00
2009-05-25 08:41:49 +02:00
DEFINE_INT_TYPE (USHORT, u, 16); /* 16-bit unsigned integer. */
DEFINE_INT_TYPE (SHORT, , 16); /* 16-bit signed integer. */
DEFINE_INT_TYPE (ULONG, u, 32); /* 32-bit unsigned integer. */
DEFINE_INT_TYPE (LONG, , 32); /* 32-bit signed integer. */
/* Array of four uint8s (length = 32 bits) used to identify a script, language
* system, feature, or baseline */
2009-05-25 08:41:49 +02:00
struct Tag : ULONG
2009-05-20 05:58:54 +02:00
{
inline Tag (const Tag &o) { *(ULONG*)this = (ULONG&) o; }
inline Tag (uint32_t i) { *(ULONG*)this = i; }
inline Tag (const char *c) { *(ULONG*)this = *(ULONG*)c; }
inline bool operator== (const char *c) const { return *(ULONG*)this == *(ULONG*)c; }
2006-12-25 15:14:52 +01:00
/* What the char* converters return is NOT nul-terminated. Print using "%.4s" */
2009-08-04 17:38:50 +02:00
inline operator const char* (void) const { return CONST_CHARP(this); }
inline operator char* (void) { return CHARP(this); }
2009-08-04 20:42:46 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 20:42:46 +02:00
/* Note: Only accept ASCII-visible tags (mind DEL)
* This is one of the few times (only time?) we check
* for data integrity, as opposed o just boundary checks
*/
return SANITIZE_SELF () && (((uint32_t) *this) & 0x80808080) == 0;
}
};
2008-01-23 06:20:48 +01:00
ASSERT_SIZE (Tag, 4);
#define _NULL_TAG_INIT {' ', ' ', ' ', ' '}
DEFINE_NULL_DATA (Tag, 4, _NULL_TAG_INIT);
#undef _NULL_TAG_INIT
/* Glyph index number, same as uint16 (length = 16 bits) */
2009-05-25 08:27:29 +02:00
typedef USHORT GlyphID;
/* Offset to a table, same as uint16 (length = 16 bits), Null offset = 0x0000 */
2009-05-25 08:27:29 +02:00
typedef USHORT Offset;
/* LongOffset to a table, same as uint32 (length = 32 bits), Null offset = 0x00000000 */
typedef ULONG LongOffset;
/* CheckSum */
2009-05-20 05:58:54 +02:00
struct CheckSum : ULONG
{
static uint32_t CalcTableChecksum (ULONG *Table, uint32_t Length)
{
uint32_t Sum = 0L;
2006-12-22 04:31:31 +01:00
ULONG *EndPtr = Table+((Length+3) & ~3) / sizeof(ULONG);
while (Table < EndPtr)
Sum += *Table++;
return Sum;
}
};
ASSERT_SIZE (CheckSum, 4);
/*
* Version Numbers
*/
2009-05-24 07:03:24 +02:00
struct FixedVersion
2009-05-20 05:58:54 +02:00
{
2009-05-27 01:48:16 +02:00
inline operator uint32_t (void) const { return (major << 16) + minor; }
2009-05-24 18:30:40 +02:00
2009-08-04 08:09:34 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 08:09:34 +02:00
return SANITIZE_SELF ();
}
2009-05-25 08:27:29 +02:00
USHORT major;
2009-05-24 07:03:24 +02:00
USHORT minor;
};
2009-05-24 07:03:24 +02:00
ASSERT_SIZE (FixedVersion, 4);
2009-08-04 16:41:32 +02:00
2009-05-17 06:54:25 +02:00
/*
2009-08-04 16:41:32 +02:00
* Template subclasses of Offset and LongOffset that do the dereferencing.
* Use: (this+memberName)
2009-05-17 06:54:25 +02:00
*/
2009-08-04 16:41:32 +02:00
template <typename OffsetType, typename Type>
struct GenericOffsetTo : OffsetType
{
inline const Type& operator() (const void *base) const
{
unsigned int offset = *this;
if (HB_UNLIKELY (!offset)) return Null(Type);
2009-08-04 18:05:24 +02:00
return CONST_CAST(Type, *CONST_CHARP(base), offset);
2009-08-04 16:41:32 +02:00
}
inline bool sanitize (SANITIZE_ARG_DEF, const void *base) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
if (!SANITIZE_SELF ()) return false;
2009-08-04 16:41:32 +02:00
unsigned int offset = *this;
if (HB_UNLIKELY (!offset)) return true;
2009-08-04 20:10:39 +02:00
return SANITIZE (CAST(Type, *DECONST_CHARP(base), offset)) || NEUTER (DECONST_CAST(OffsetType,*this,0), 0);
2009-08-04 16:41:32 +02:00
}
inline bool sanitize (SANITIZE_ARG_DEF, const void *base, const void *base2) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
if (!SANITIZE_SELF ()) return false;
2009-08-04 21:07:24 +02:00
unsigned int offset = *this;
if (HB_UNLIKELY (!offset)) return true;
return SANITIZE_BASE (CAST(Type, *DECONST_CHARP(base), offset), base2) || NEUTER (DECONST_CAST(OffsetType,*this,0), 0);
}
inline bool sanitize (SANITIZE_ARG_DEF, const void *base, unsigned int user_data) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
if (!SANITIZE_SELF ()) return false;
2009-08-04 19:30:49 +02:00
unsigned int offset = *this;
if (HB_UNLIKELY (!offset)) return true;
2009-08-04 20:10:39 +02:00
return SANITIZE_BASE (CAST(Type, *DECONST_CHARP(base), offset), user_data) || NEUTER (DECONST_CAST(OffsetType,*this,0), 0);
2009-08-04 19:30:49 +02:00
}
2009-08-04 16:41:32 +02:00
};
template <typename Base, typename OffsetType, typename Type>
inline const Type& operator + (const Base &base, GenericOffsetTo<OffsetType, Type> offset) { return offset (base); }
2009-05-17 06:54:25 +02:00
template <typename Type>
2009-08-04 16:41:32 +02:00
struct OffsetTo : GenericOffsetTo<Offset, Type> {};
template <typename Type>
struct LongOffsetTo : GenericOffsetTo<LongOffset, Type> {};
2009-08-04 16:41:32 +02:00
/*
* Array Types
*/
template <typename LenType, typename Type>
struct GenericArrayOf
2009-05-20 05:58:54 +02:00
{
inline const Type& operator [] (unsigned int i) const
{
2009-05-17 06:54:25 +02:00
if (HB_UNLIKELY (i >= len)) return Null(Type);
return array[i];
}
2009-05-20 05:58:54 +02:00
inline unsigned int get_size () const
2009-05-26 18:24:16 +02:00
{ return sizeof (len) + len * sizeof (array[0]); }
2009-05-18 08:03:58 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 18:26:26 +02:00
if (!SANITIZE_GET_SIZE()) return false;
2009-08-04 08:10:48 +02:00
/* Note; for non-recursive types, this is not much needed
2009-08-04 06:58:28 +02:00
unsigned int count = len;
for (unsigned int i = 0; i < count; i++)
if (!SANITIZE (array[i]))
return false;
2009-08-04 08:10:48 +02:00
*/
2009-08-05 03:42:23 +02:00
return true;
2009-08-04 06:58:28 +02:00
}
inline bool sanitize (SANITIZE_ARG_DEF, const void *base) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 18:26:26 +02:00
if (!SANITIZE_GET_SIZE()) return false;
2009-08-04 16:23:01 +02:00
unsigned int count = len;
for (unsigned int i = 0; i < count; i++)
2009-08-04 18:05:24 +02:00
if (!array[i].sanitize (SANITIZE_ARG, base))
2009-08-04 16:23:01 +02:00
return false;
2009-08-05 03:42:23 +02:00
return true;
2009-08-04 16:23:01 +02:00
}
inline bool sanitize (SANITIZE_ARG_DEF, const void *base, const void *base2) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 21:07:24 +02:00
if (!SANITIZE_GET_SIZE()) return false;
unsigned int count = len;
for (unsigned int i = 0; i < count; i++)
if (!array[i].sanitize (SANITIZE_ARG, base, base2))
return false;
2009-08-05 03:42:23 +02:00
return true;
2009-08-04 21:07:24 +02:00
}
inline bool sanitize (SANITIZE_ARG_DEF, const void *base, unsigned int user_data) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 19:30:49 +02:00
if (!SANITIZE_GET_SIZE()) return false;
unsigned int count = len;
for (unsigned int i = 0; i < count; i++)
if (!array[i].sanitize (SANITIZE_ARG, base, user_data))
return false;
2009-08-05 03:42:23 +02:00
return true;
2009-08-04 19:30:49 +02:00
}
2009-08-04 06:58:28 +02:00
2009-08-04 16:41:32 +02:00
LenType len;
2009-05-18 08:03:58 +02:00
Type array[];
};
2009-08-04 16:41:32 +02:00
/* An array with a USHORT number of elements. */
template <typename Type>
struct ArrayOf : GenericArrayOf<USHORT, Type> {};
/* An array with a ULONG number of elements. */
template <typename Type>
struct LongArrayOf : GenericArrayOf<ULONG, Type> {};
/* Array of Offset's */
template <typename Type>
struct OffsetArrayOf : ArrayOf<OffsetTo<Type> > {};
/* Array of LongOffset's */
template <typename Type>
struct LongOffsetArrayOf : ArrayOf<LongOffsetTo<Type> > {};
/* LongArray of LongOffset's */
template <typename Type>
struct LongOffsetLongArrayOf : LongArrayOf<LongOffsetTo<Type> > {};
2009-05-18 08:03:58 +02:00
/* An array with a USHORT number of elements,
* starting at second element. */
template <typename Type>
2009-05-20 05:58:54 +02:00
struct HeadlessArrayOf
{
inline const Type& operator [] (unsigned int i) const
{
2009-05-18 08:03:58 +02:00
if (HB_UNLIKELY (i >= len || !i)) return Null(Type);
return array[i-1];
}
2009-05-20 05:58:54 +02:00
inline unsigned int get_size () const
2009-05-26 18:24:16 +02:00
{ return sizeof (len) + (len ? len - 1 : 0) * sizeof (array[0]); }
2009-05-17 06:54:25 +02:00
inline bool sanitize (SANITIZE_ARG_DEF) {
2009-08-05 04:35:36 +02:00
SANITIZE_DEBUG ();
2009-08-04 18:26:26 +02:00
if (!SANITIZE_GET_SIZE()) return false;
2009-08-04 08:10:48 +02:00
/* Note; for non-recursive types, this is not much needed
2009-08-04 19:57:41 +02:00
unsigned int count = len ? len - 1 : 0;
2009-08-04 06:58:28 +02:00
for (unsigned int i = 0; i < count; i++)
if (!SANITIZE (array[i]))
return false;
2009-08-04 08:10:48 +02:00
*/
2009-08-05 03:42:23 +02:00
return true;
2009-08-04 06:58:28 +02:00
}
2009-05-17 06:54:25 +02:00
USHORT len;
Type array[];
};
#endif /* HB_OPEN_TYPES_PRIVATE_HH */