2008-01-23 21:14:38 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2007,2008 Red Hat, Inc.
|
|
|
|
*
|
|
|
|
* 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
|
|
|
|
*/
|
|
|
|
|
2008-01-23 10:00:30 +00:00
|
|
|
#ifndef HB_OT_LAYOUT_OPEN_PRIVATE_H
|
|
|
|
#define HB_OT_LAYOUT_OPEN_PRIVATE_H
|
2006-12-28 11:10:59 +00:00
|
|
|
|
2008-01-28 02:19:51 +00:00
|
|
|
#ifndef HB_OT_LAYOUT_CC
|
|
|
|
#error "This file should only be included from hb-ot-layout.c"
|
|
|
|
#endif
|
|
|
|
|
2008-01-24 08:11:09 +00:00
|
|
|
#include "hb-ot-layout-private.h"
|
2006-12-28 11:10:59 +00:00
|
|
|
|
2008-01-23 22:01:55 +00:00
|
|
|
|
2006-12-22 07:21:55 +00:00
|
|
|
/*
|
|
|
|
* Int types
|
|
|
|
*/
|
|
|
|
|
2008-01-24 08:54:09 +00:00
|
|
|
/* XXX define these as structs of chars on machines that do not allow
|
|
|
|
* unaligned access */
|
2006-12-22 03:31:10 +00:00
|
|
|
#define DEFINE_INT_TYPE1(NAME, TYPE, BIG_ENDIAN) \
|
2006-12-22 07:21:55 +00:00
|
|
|
inline NAME& operator = (TYPE i) { v = BIG_ENDIAN(i); return *this; } \
|
|
|
|
inline operator TYPE(void) const { return BIG_ENDIAN(v); } \
|
|
|
|
inline bool operator== (NAME o) const { return v == o.v; } \
|
2006-12-22 03:31:10 +00:00
|
|
|
private: TYPE v; \
|
2006-12-26 23:53:55 +00:00
|
|
|
public:
|
2006-12-22 03:31:10 +00:00
|
|
|
#define DEFINE_INT_TYPE0(NAME, type) DEFINE_INT_TYPE1 (NAME, type, hb_be_##type)
|
|
|
|
#define DEFINE_INT_TYPE(NAME, u, w) DEFINE_INT_TYPE0 (NAME, u##int##w##_t)
|
2006-12-26 23:53:55 +00:00
|
|
|
#define DEFINE_INT_TYPE_STRUCT(NAME, u, w) \
|
|
|
|
struct NAME { \
|
|
|
|
DEFINE_INT_TYPE(NAME, u, w) \
|
|
|
|
}
|
2006-12-22 07:21:55 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Array types
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* get_len() is a method returning the number of items in an array-like object */
|
|
|
|
#define DEFINE_LEN(Type, array, num) \
|
|
|
|
inline unsigned int get_len(void) const { return num; } \
|
|
|
|
|
|
|
|
/* get_size() is a method returning the size in bytes of an array-like object */
|
|
|
|
#define DEFINE_SIZE(Type, array, num) \
|
|
|
|
inline unsigned int get_size(void) const { return sizeof (*this) + sizeof (Type) * num; }
|
|
|
|
|
|
|
|
#define DEFINE_LEN_AND_SIZE(Type, array, num) \
|
|
|
|
DEFINE_LEN(Type, array, num) \
|
|
|
|
DEFINE_SIZE(Type, array, num)
|
|
|
|
|
|
|
|
/* An array type is one that contains a variable number of objects
|
|
|
|
* as its last item. An array object is extended with len() and size()
|
|
|
|
* methods, as well as overloaded [] operator. */
|
|
|
|
#define DEFINE_ARRAY_TYPE(Type, array, num) \
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_INDEX_OPERATOR(Type, array, num) \
|
2006-12-22 07:21:55 +00:00
|
|
|
DEFINE_LEN_AND_SIZE(Type, array, num)
|
2008-01-23 09:36:40 +00:00
|
|
|
#define DEFINE_INDEX_OPERATOR(Type, array, num) \
|
2006-12-22 07:21:55 +00:00
|
|
|
inline const Type& operator[] (unsigned int i) const { \
|
2008-01-23 20:50:38 +00:00
|
|
|
if (HB_UNLIKELY (i >= num)) return Null##Type; \
|
2006-12-22 07:21:55 +00:00
|
|
|
return array[i]; \
|
|
|
|
}
|
|
|
|
|
|
|
|
/* An offset array type is like an array type, but it contains a table
|
|
|
|
* of offsets to the objects, relative to the beginning of the current
|
|
|
|
* object. */
|
|
|
|
#define DEFINE_OFFSET_ARRAY_TYPE(Type, array, num) \
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_OFFSET_INDEX_OPERATOR(Type, array, num) \
|
2006-12-22 07:21:55 +00:00
|
|
|
DEFINE_LEN_AND_SIZE(Offset, array, num)
|
2008-01-23 09:36:40 +00:00
|
|
|
#define DEFINE_OFFSET_INDEX_OPERATOR(Type, array, num) \
|
2006-12-22 07:21:55 +00:00
|
|
|
inline const Type& operator[] (unsigned int i) const { \
|
2008-01-23 20:50:38 +00:00
|
|
|
if (HB_UNLIKELY (i >= num)) return Null##Type; \
|
|
|
|
if (HB_UNLIKELY (!array[i])) return Null##Type; \
|
2006-12-22 07:21:55 +00:00
|
|
|
return *(const Type *)((const char*)this + array[i]); \
|
|
|
|
}
|
|
|
|
|
2008-01-24 08:11:09 +00:00
|
|
|
/* A record array type is like an array type, but it contains a table
|
|
|
|
* of records to the objects. Each record has a tag, and an offset
|
|
|
|
* relative to the beginning of the current object. */
|
2006-12-22 07:21:55 +00:00
|
|
|
#define DEFINE_RECORD_ARRAY_TYPE(Type, array, num) \
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_RECORD_ACCESSOR(Type, array, num) \
|
2006-12-22 07:21:55 +00:00
|
|
|
DEFINE_LEN_AND_SIZE(Record, array, num)
|
2008-01-23 09:36:40 +00:00
|
|
|
#define DEFINE_RECORD_ACCESSOR(Type, array, num) \
|
2006-12-22 07:21:55 +00:00
|
|
|
inline const Type& operator[] (unsigned int i) const { \
|
2008-01-23 20:50:38 +00:00
|
|
|
if (HB_UNLIKELY (i >= num)) return Null##Type; \
|
|
|
|
if (HB_UNLIKELY (!array[i].offset)) return Null##Type; \
|
2006-12-22 07:21:55 +00:00
|
|
|
return *(const Type *)((const char*)this + array[i].offset); \
|
|
|
|
} \
|
2008-01-28 07:30:48 +00:00
|
|
|
inline const Tag& get_tag (unsigned int i) const { \
|
|
|
|
if (HB_UNLIKELY (i >= num)) return NullTag; \
|
|
|
|
return array[i].tag; \
|
|
|
|
}
|
|
|
|
/* TODO: implement bsearch find_tag() and use it */
|
2006-12-22 07:21:55 +00:00
|
|
|
|
2008-01-24 08:11:09 +00:00
|
|
|
|
|
|
|
#define DEFINE_ARRAY_INTERFACE(Type, name) \
|
|
|
|
inline const Type& get_##name (unsigned int i) const { \
|
|
|
|
return (*this)[i]; \
|
|
|
|
} \
|
|
|
|
inline unsigned int get_##name##_count (void) const { \
|
|
|
|
return this->get_len (); \
|
|
|
|
}
|
|
|
|
#define DEFINE_INDEX_ARRAY_INTERFACE(name) \
|
|
|
|
inline unsigned int get_##name##_index (unsigned int i) const { \
|
|
|
|
return (*this)[i]; \
|
|
|
|
} \
|
|
|
|
inline unsigned int get_##name##_count (void) const { \
|
|
|
|
return this->get_len (); \
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-01-23 09:36:40 +00:00
|
|
|
/*
|
|
|
|
* List types
|
|
|
|
*/
|
2006-12-22 07:21:55 +00:00
|
|
|
|
2008-01-28 07:30:48 +00:00
|
|
|
#define DEFINE_LIST_ARRAY(Type, name) \
|
2008-01-23 09:36:40 +00:00
|
|
|
inline const Type##List& get_##name##_list (void) const { \
|
2008-01-23 20:50:38 +00:00
|
|
|
if (HB_UNLIKELY (!name##List)) return Null##Type##List; \
|
2008-01-23 09:36:40 +00:00
|
|
|
return *(const Type##List *)((const char*)this + name##List); \
|
2008-01-28 07:30:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#define DEFINE_LIST_INTERFACE(Type, name) \
|
2008-01-23 09:36:40 +00:00
|
|
|
inline const Type& get_##name (unsigned int i) const { \
|
2008-01-28 07:30:48 +00:00
|
|
|
return get_##name##_list ()[i]; \
|
|
|
|
} \
|
|
|
|
inline unsigned int get_##name##_count (void) const { \
|
|
|
|
return get_##name##_list ().get_len (); \
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Tag types
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define DEFINE_TAG_ARRAY_INTERFACE(Type, name) \
|
|
|
|
DEFINE_ARRAY_INTERFACE (Type, name); \
|
|
|
|
inline hb_tag_t get_##name##_tag (unsigned int i) const { \
|
|
|
|
return (*this)[i].tag; \
|
|
|
|
}
|
|
|
|
#define DEFINE_TAG_LIST_INTERFACE(Type, name) \
|
|
|
|
DEFINE_LIST_INTERFACE (Type, name); \
|
|
|
|
inline const Tag& get_##name##_tag (unsigned int i) const { \
|
|
|
|
return get_##name##_list ().get_tag (i); \
|
|
|
|
}
|
|
|
|
|
|
|
|
#define DEFINE_TAG_FIND_INTERFACE(Type, name) \
|
|
|
|
inline const Type* find_##name (hb_tag_t tag) const { \
|
|
|
|
for (unsigned int i = 0; i < get_##name##_count (); i++) \
|
|
|
|
if (tag == get_##name##_tag (i)) \
|
|
|
|
return &get_##name (i); \
|
|
|
|
return NULL; \
|
|
|
|
} \
|
|
|
|
inline const Type& get_##name##_by_tag (hb_tag_t tag) const { \
|
|
|
|
const Type* res = find_##name (tag); \
|
|
|
|
if (res) \
|
|
|
|
return *res; \
|
|
|
|
else \
|
|
|
|
return Null##Type; \
|
2008-01-23 09:36:40 +00:00
|
|
|
}
|
2008-01-23 07:01:37 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Class features
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* makes class uninstantiable. should be used for union classes that don't
|
|
|
|
* contain any complete type */
|
|
|
|
#define DEFINE_NON_INSTANTIABLE(Type) \
|
|
|
|
private: inline Type() {} /* cannot be instantiated */ \
|
|
|
|
public:
|
|
|
|
|
2008-01-28 02:19:51 +00:00
|
|
|
/* TODO use a global nul-array for most Null's */
|
2008-01-23 09:36:40 +00:00
|
|
|
/* defines Null##Type as a safe nil instance of Type */
|
|
|
|
#define DEFINE_NULL_DATA(Type, size, data) \
|
|
|
|
static const unsigned char Null##Type##Data[size] = data; \
|
|
|
|
DEFINE_NULL_ALIAS (Type, Type)
|
|
|
|
#define DEFINE_NULL(Type, size) \
|
|
|
|
DEFINE_NULL_DATA(Type, size, "")
|
|
|
|
#define DEFINE_NULL_ASSERT_SIZE(Type, size) \
|
|
|
|
DEFINE_NULL_ASSERT_SIZE_DATA(Type, size, "")
|
|
|
|
#define DEFINE_NULL_ASSERT_SIZE_DATA(Type, size, data) \
|
|
|
|
ASSERT_SIZE (Type, size); \
|
|
|
|
DEFINE_NULL_DATA (Type, size, data)
|
|
|
|
#define DEFINE_NULL_ALIAS(NewType, OldType) \
|
2008-01-28 02:19:51 +00:00
|
|
|
/* XXX static */ const NewType &Null##NewType = *(NewType *)Null##OldType##Data
|
2008-01-23 09:36:40 +00:00
|
|
|
|
2008-01-23 07:01:37 +00: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 02:19:51 +00:00
|
|
|
* fancy, NULL-safe, cast! */
|
2008-01-24 08:11:09 +00:00
|
|
|
#define STATIC_DEFINE_GET_FOR_DATA(Type) \
|
2008-01-23 07:01:37 +00:00
|
|
|
static inline const Type& get_for_data (const char *data) { \
|
2008-01-24 08:11:09 +00:00
|
|
|
extern const Type &Null##Type; \
|
|
|
|
if (HB_UNLIKELY (data == NULL)) return Null##Type; \
|
2008-01-23 07:01:37 +00:00
|
|
|
return *(const Type*)data; \
|
2008-01-24 08:11:09 +00:00
|
|
|
} \
|
|
|
|
static inline Type& get_for_data (char *data) { \
|
|
|
|
return *(Type*)data; \
|
2008-01-23 07:01:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2008-01-25 00:13:50 +00:00
|
|
|
#define DEFINE_GET_ACCESSOR(Type, name, Name) \
|
|
|
|
inline const Type& get_##name (void) const { \
|
2008-01-23 20:50:38 +00:00
|
|
|
if (HB_UNLIKELY (!Name)) return Null##Type; \
|
2008-01-23 09:36:40 +00:00
|
|
|
return *(const Type*)((const char*)this + Name); \
|
|
|
|
}
|
2008-01-25 00:13:50 +00:00
|
|
|
#define DEFINE_GET_HAS_ACCESSOR(Type, name, Name) \
|
|
|
|
DEFINE_GET_ACCESSOR (Type, name, Name); \
|
|
|
|
inline bool has_##name (void) const { \
|
|
|
|
return Name != 0; \
|
|
|
|
}
|
2008-01-23 09:36:40 +00:00
|
|
|
|
|
|
|
|
2008-01-23 07:01:37 +00:00
|
|
|
|
2006-12-22 07:21:55 +00:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* The OpenType Font File
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Data Types
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
/* "The following data types are used in the OpenType font file.
|
|
|
|
* All OpenType fonts use Motorola-style byte ordering (Big Endian):" */
|
|
|
|
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (BYTE, u, 8); /* 8-bit unsigned integer. */
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (BYTE, 1);
|
2008-01-23 05:20:48 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (CHAR, , 8); /* 8-bit signed integer. */
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (CHAR, 1);
|
2008-01-23 05:20:48 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (USHORT, u, 16); /* 16-bit unsigned integer. */
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (USHORT, 2);
|
2006-12-26 23:53:55 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (SHORT, , 16); /* 16-bit signed integer. */
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (SHORT, 2);
|
2006-12-26 23:53:55 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (ULONG, u, 32); /* 32-bit unsigned integer. */
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (ULONG, 4);
|
2006-12-26 23:53:55 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (LONG, , 32); /* 32-bit signed integer. */
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (LONG, 4);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* Date represented in number of seconds since 12:00 midnight, January 1,
|
|
|
|
* 1904. The value is represented as a signed 64-bit integer. */
|
2006-12-26 23:53:55 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (LONGDATETIME, , 64);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* 32-bit signed fixed-point number (16.16) */
|
2008-01-23 05:20:48 +00:00
|
|
|
struct Fixed {
|
|
|
|
inline Fixed& operator = (int32_t v) { i = (int16_t) (v >> 16); f = (uint16_t) v; return *this; } \
|
|
|
|
inline operator int32_t(void) const { return (((int32_t) i) << 16) + (uint16_t) f; } \
|
|
|
|
inline bool operator== (Fixed o) const { return i == o.i && f == o.f; } \
|
|
|
|
|
2006-12-22 07:21:55 +00:00
|
|
|
inline operator double(void) const { return (uint32_t) this / 65536.; }
|
2008-01-23 05:20:48 +00:00
|
|
|
inline int16_t int_part (void) const { return i; }
|
|
|
|
inline uint16_t frac_part (void) const { return f; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
SHORT i;
|
|
|
|
USHORT f;
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Fixed, 4);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* Smallest measurable distance in the em space. */
|
2006-12-22 03:31:31 +00:00
|
|
|
struct FUNIT;
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* 16-bit signed integer (SHORT) that describes a quantity in FUnits. */
|
2006-12-22 03:31:31 +00:00
|
|
|
struct FWORD : SHORT {
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (FWORD, 2);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* 16-bit unsigned integer (USHORT) that describes a quantity in FUnits. */
|
2006-12-22 03:31:31 +00:00
|
|
|
struct UFWORD : USHORT {
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (UFWORD, 2);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* 16-bit signed fixed number with the low 14 bits of fraction (2.14). */
|
2006-12-22 03:31:31 +00:00
|
|
|
struct F2DOT14 : SHORT {
|
2006-12-22 07:21:55 +00:00
|
|
|
inline operator double() const { return (uint32_t) this / 16384.; }
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (F2DOT14, 2);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* Array of four uint8s (length = 32 bits) used to identify a script, language
|
|
|
|
* system, feature, or baseline */
|
2006-12-22 07:21:55 +00:00
|
|
|
struct Tag {
|
|
|
|
inline Tag (void) { v[0] = v[1] = v[2] = v[3] = 0; }
|
2006-12-25 14:14:52 +00:00
|
|
|
inline Tag (uint32_t v) { (ULONG&)(*this) = v; }
|
2006-12-25 10:39:20 +00:00
|
|
|
inline Tag (const char *c) { v[0] = c[0]; v[1] = c[1]; v[2] = c[2]; v[3] = c[3]; }
|
2006-12-25 14:14:52 +00:00
|
|
|
inline bool operator== (Tag o) const { return v[0]==o.v[0]&&v[1]==o.v[1]&&v[2]==o.v[2]&&v[3]==o.v[3]; }
|
2006-12-27 06:29:24 +00:00
|
|
|
inline bool operator== (const char *c) const { return v[0]==c[0]&&v[1]==c[1]&&v[2]==c[2]&&v[3]==c[3]; }
|
2008-01-23 06:38:10 +00:00
|
|
|
inline bool operator== (uint32_t i) const { return i == (uint32_t) *this; }
|
2006-12-25 14:14:52 +00:00
|
|
|
inline operator uint32_t(void) const { return (v[0]<<24)+(v[1]<<16) +(v[2]<<8)+v[3]; }
|
|
|
|
/* What the char* converters return is NOT nul-terminated. Print using "%.4s" */
|
2006-12-25 11:18:52 +00:00
|
|
|
inline operator const char* (void) const { return (const char *)this; }
|
|
|
|
inline operator char* (void) { return (char *)this; }
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
|
|
|
char v[4];
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 05:20:48 +00:00
|
|
|
ASSERT_SIZE (Tag, 4);
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_DATA (Tag, 5, " ");
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* Glyph index number, same as uint16 (length = 16 bits) */
|
2006-12-26 23:53:55 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (GlyphID, u, 16);
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (GlyphID, 2);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
2008-01-23 09:36:40 +00:00
|
|
|
/* Offset to a table, same as uint16 (length = 16 bits), Null offset = 0x0000 */
|
2006-12-26 23:53:55 +00:00
|
|
|
DEFINE_INT_TYPE_STRUCT (Offset, u, 16);
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Offset, 2);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/* CheckSum */
|
2006-12-22 03:31:31 +00:00
|
|
|
struct CheckSum : ULONG {
|
|
|
|
static uint32_t CalcTableChecksum (ULONG *Table, uint32_t Length) {
|
2006-12-22 03:31:10 +00:00
|
|
|
uint32_t Sum = 0L;
|
2006-12-22 03:31:31 +00:00
|
|
|
ULONG *EndPtr = Table+((Length+3) & ~3) / sizeof(ULONG);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
while (Table < EndPtr)
|
|
|
|
Sum += *Table++;
|
|
|
|
return Sum;
|
|
|
|
}
|
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (CheckSum, 4);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Version Numbers
|
|
|
|
*/
|
|
|
|
|
2006-12-22 03:31:31 +00:00
|
|
|
struct USHORT_Version : USHORT {
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (USHORT_Version, 2);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
2006-12-22 03:31:31 +00:00
|
|
|
struct Fixed_Version : Fixed {
|
2006-12-22 07:21:55 +00:00
|
|
|
inline int16_t major (void) const { return this->int_part(); }
|
|
|
|
inline int16_t minor (void) const { return this->frac_part(); }
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Fixed_Version, 4);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Organization of an OpenType Font
|
|
|
|
*/
|
|
|
|
|
2006-12-28 01:08:07 +00:00
|
|
|
struct OpenTypeFontFile;
|
2006-12-25 10:39:20 +00:00
|
|
|
struct OffsetTable;
|
|
|
|
struct TTCHeader;
|
|
|
|
|
2006-12-25 11:18:52 +00:00
|
|
|
typedef struct TableDirectory {
|
2008-01-23 05:20:48 +00:00
|
|
|
|
2008-01-24 08:54:09 +00:00
|
|
|
friend struct OpenTypeFontFile;
|
2008-01-24 08:11:09 +00:00
|
|
|
friend struct OffsetTable;
|
2008-01-23 05:20:48 +00:00
|
|
|
|
2008-01-24 08:11:09 +00:00
|
|
|
inline bool is_null (void) const { return length == 0; }
|
2008-01-28 07:30:48 +00:00
|
|
|
inline const Tag& get_tag (void) const { return tag; }
|
2008-01-23 05:20:48 +00:00
|
|
|
inline unsigned long get_checksum (void) const { return checkSum; }
|
|
|
|
inline unsigned long get_offset (void) const { return offset; }
|
|
|
|
inline unsigned long get_length (void) const { return length; }
|
|
|
|
|
|
|
|
private:
|
2006-12-22 03:31:31 +00:00
|
|
|
Tag tag; /* 4-byte identifier. */
|
|
|
|
CheckSum checkSum; /* CheckSum for this table. */
|
|
|
|
ULONG offset; /* Offset from beginning of TrueType font
|
2006-12-22 03:31:10 +00:00
|
|
|
* file. */
|
2006-12-22 03:31:31 +00:00
|
|
|
ULONG length; /* Length of this table. */
|
2006-12-25 11:18:52 +00:00
|
|
|
} OpenTypeTable;
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (TableDirectory, 16);
|
2008-01-24 08:11:09 +00:00
|
|
|
DEFINE_NULL_ALIAS (OpenTypeTable, TableDirectory);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
2006-12-25 11:18:52 +00:00
|
|
|
typedef struct OffsetTable {
|
2008-01-23 23:02:28 +00:00
|
|
|
|
|
|
|
friend struct OpenTypeFontFile;
|
|
|
|
friend struct TTCHeader;
|
|
|
|
|
2008-01-28 07:30:48 +00:00
|
|
|
DEFINE_TAG_ARRAY_INTERFACE (OpenTypeTable, table); /* get_table_count(), get_table(i), get_table_tag(i) */
|
|
|
|
DEFINE_TAG_FIND_INTERFACE (OpenTypeTable, table); /* find_table(tag), get_table_by_tag(tag) */
|
2008-01-24 08:11:09 +00:00
|
|
|
|
|
|
|
private:
|
2006-12-25 14:14:52 +00:00
|
|
|
/* OpenTypeTables, in no particular order */
|
2006-12-22 07:21:55 +00:00
|
|
|
DEFINE_ARRAY_TYPE (TableDirectory, tableDir, numTables);
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-22 07:21:55 +00:00
|
|
|
Tag sfnt_version; /* '\0\001\0\00' if TrueType / 'OTTO' if CFF */
|
|
|
|
USHORT numTables; /* Number of tables. */
|
|
|
|
USHORT searchRange; /* (Maximum power of 2 <= numTables) x 16 */
|
|
|
|
USHORT entrySelector; /* Log2(maximum power of 2 <= numTables). */
|
|
|
|
USHORT rangeShift; /* NumTables x 16-searchRange. */
|
|
|
|
TableDirectory tableDir[]; /* TableDirectory entries. numTables items */
|
2006-12-28 00:58:32 +00:00
|
|
|
} OpenTypeFontFace;
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (OffsetTable, 12);
|
|
|
|
DEFINE_NULL_ALIAS (OpenTypeFontFace, OffsetTable);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* TrueType Collections
|
|
|
|
*/
|
|
|
|
|
2006-12-22 03:31:31 +00:00
|
|
|
struct TTCHeader {
|
2008-01-23 23:02:28 +00:00
|
|
|
|
|
|
|
friend struct OpenTypeFontFile;
|
|
|
|
|
|
|
|
private:
|
2006-12-28 00:58:32 +00:00
|
|
|
/* OpenTypeFontFaces, in no particular order */
|
2006-12-22 07:21:55 +00:00
|
|
|
DEFINE_OFFSET_ARRAY_TYPE (OffsetTable, offsetTable, numFonts);
|
2008-01-23 22:25:29 +00:00
|
|
|
/* XXX check version here? */
|
2006-12-22 07:21:55 +00:00
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-25 14:58:02 +00:00
|
|
|
Tag ttcTag; /* TrueType Collection ID string: 'ttcf' */
|
2006-12-22 03:31:31 +00:00
|
|
|
ULONG version; /* Version of the TTC Header (1.0 or 2.0),
|
2007-07-06 06:03:26 +00:00
|
|
|
* 0x00010000 or 0x00020000 */
|
2006-12-22 03:31:31 +00:00
|
|
|
ULONG numFonts; /* Number of fonts in TTC */
|
2006-12-22 07:21:55 +00:00
|
|
|
ULONG offsetTable[]; /* Array of offsets to the OffsetTable for each font
|
2006-12-27 01:00:33 +00:00
|
|
|
* from the beginning of the file */
|
2006-12-22 03:31:10 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (TTCHeader, 12);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
|
2006-12-25 10:39:20 +00:00
|
|
|
/*
|
|
|
|
* OpenType Font File
|
|
|
|
*/
|
|
|
|
|
2006-12-28 01:08:07 +00:00
|
|
|
struct OpenTypeFontFile {
|
|
|
|
DEFINE_NON_INSTANTIABLE(OpenTypeFontFile);
|
2006-12-25 11:22:08 +00:00
|
|
|
static const hb_tag_t TrueTypeTag = HB_TAG ( 0 , 1 , 0 , 0 );
|
|
|
|
static const hb_tag_t CFFTag = HB_TAG ('O','T','T','O');
|
|
|
|
static const hb_tag_t TTCTag = HB_TAG ('t','t','c','f');
|
2006-12-25 10:39:20 +00:00
|
|
|
|
2008-01-23 07:01:37 +00:00
|
|
|
STATIC_DEFINE_GET_FOR_DATA (OpenTypeFontFile);
|
2006-12-25 11:18:52 +00:00
|
|
|
|
2008-01-28 07:30:48 +00:00
|
|
|
DEFINE_ARRAY_INTERFACE (OpenTypeFontFace, face); /* get_face_count(), get_face(i) */
|
2008-01-24 08:54:09 +00:00
|
|
|
|
2008-01-28 07:30:48 +00:00
|
|
|
inline const Tag& get_tag (void) const { return tag; }
|
2008-01-24 08:54:09 +00:00
|
|
|
|
2006-12-27 06:29:24 +00:00
|
|
|
/* This is how you get a table */
|
2008-01-24 08:54:09 +00:00
|
|
|
inline const char* get_table_data (const OpenTypeTable& table) const {
|
|
|
|
return (*this)[table];
|
2006-12-27 06:29:24 +00:00
|
|
|
}
|
2008-01-24 08:54:09 +00:00
|
|
|
inline char* get_table_data (const OpenTypeTable& table) {
|
|
|
|
return (*this)[table];
|
2006-12-27 06:29:24 +00:00
|
|
|
}
|
2008-01-24 08:54:09 +00:00
|
|
|
|
|
|
|
private:
|
2006-12-27 06:29:24 +00:00
|
|
|
inline const char* operator[] (const OpenTypeTable& table) const {
|
2008-01-24 08:54:09 +00:00
|
|
|
if (G_UNLIKELY (table.offset == 0)) return NULL;
|
2006-12-27 06:29:24 +00:00
|
|
|
return ((const char*)this) + table.offset;
|
|
|
|
}
|
|
|
|
inline char* operator[] (const OpenTypeTable& table) {
|
2008-01-24 08:54:09 +00:00
|
|
|
if (G_UNLIKELY (table.offset == 0)) return NULL;
|
2006-12-27 06:29:24 +00:00
|
|
|
return ((char*)this) + table.offset;
|
|
|
|
}
|
|
|
|
|
2006-12-25 11:18:52 +00:00
|
|
|
/* Array interface sans get_size() */
|
2008-01-23 23:02:28 +00:00
|
|
|
unsigned int get_len (void) const {
|
2006-12-25 10:39:20 +00:00
|
|
|
switch (tag) {
|
2006-12-25 11:18:52 +00:00
|
|
|
default: return 0;
|
2006-12-25 11:22:08 +00:00
|
|
|
case TrueTypeTag: case CFFTag: return 1;
|
|
|
|
case TTCTag: return ((const TTCHeader&)*this).get_len();
|
2006-12-25 10:39:20 +00:00
|
|
|
}
|
|
|
|
}
|
2008-01-23 23:02:28 +00:00
|
|
|
const OpenTypeFontFace& operator[] (unsigned int i) const {
|
2008-01-23 20:50:38 +00:00
|
|
|
if (HB_UNLIKELY (i >= get_len ())) return NullOpenTypeFontFace;
|
2006-12-25 10:39:20 +00:00
|
|
|
switch (tag) {
|
2006-12-25 11:22:08 +00:00
|
|
|
default: case TrueTypeTag: case CFFTag: return (const OffsetTable&)*this;
|
|
|
|
case TTCTag: return ((const TTCHeader&)*this)[i];
|
2006-12-25 10:39:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-25 11:18:52 +00:00
|
|
|
Tag tag; /* 4-byte identifier. */
|
2006-12-25 10:39:20 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (OpenTypeFontFile, 4);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
*
|
|
|
|
* OpenType Layout Common Table Formats
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2006-12-27 00:29:08 +00:00
|
|
|
/*
|
2006-12-28 00:58:32 +00:00
|
|
|
* Script, ScriptList, LangSys, Feature, FeatureList, Lookup, LookupList
|
2006-12-27 00:29:08 +00:00
|
|
|
*/
|
|
|
|
|
2006-12-22 07:21:55 +00:00
|
|
|
typedef struct Record {
|
|
|
|
Tag tag; /* 4-byte Tag identifier */
|
|
|
|
Offset offset; /* Offset from beginning of object holding
|
|
|
|
* the Record */
|
|
|
|
} ScriptRecord, LangSysRecord, FeatureRecord;
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Record, 6);
|
2006-12-22 03:31:10 +00:00
|
|
|
|
2006-12-22 07:21:55 +00:00
|
|
|
struct LangSys {
|
2008-01-24 08:11:09 +00:00
|
|
|
|
|
|
|
DEFINE_INDEX_ARRAY_INTERFACE (feature);
|
|
|
|
|
2006-12-25 14:14:52 +00:00
|
|
|
/* Returns -1 if none */
|
|
|
|
inline int get_required_feature_index (void) const {
|
|
|
|
if (reqFeatureIndex == 0xffff)
|
|
|
|
return -1;
|
|
|
|
return reqFeatureIndex;;
|
|
|
|
}
|
2006-12-22 03:31:10 +00:00
|
|
|
|
2008-01-24 08:11:09 +00:00
|
|
|
private:
|
|
|
|
/* Feature indices, in no particular order */
|
|
|
|
DEFINE_ARRAY_TYPE (USHORT, featureIndex, featureCount);
|
2008-01-23 06:38:10 +00:00
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2008-01-23 09:36:40 +00:00
|
|
|
Offset lookupOrder; /* = Null (reserved for an offset to a
|
2006-12-25 14:14:52 +00:00
|
|
|
* reordering table) */
|
|
|
|
USHORT reqFeatureIndex;/* Index of a feature required for this
|
|
|
|
* language system--if no required features
|
|
|
|
* = 0xFFFF */
|
|
|
|
USHORT featureCount; /* Number of FeatureIndex values for this
|
|
|
|
* language system--excludes the required
|
|
|
|
* feature */
|
|
|
|
USHORT featureIndex[]; /* Array of indices into the FeatureList--in
|
2006-12-25 14:35:06 +00:00
|
|
|
* arbitrary order. featureCount entires long */
|
2006-12-22 07:21:55 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE_DATA (LangSys, 6, "\0\0\xFF\xFF");
|
2006-12-22 03:30:38 +00:00
|
|
|
|
2008-01-23 09:36:40 +00:00
|
|
|
struct Script {
|
|
|
|
|
2008-01-28 07:30:48 +00:00
|
|
|
DEFINE_ARRAY_INTERFACE (LangSys, lang_sys); /* get_lang_sys_count(), get_lang_sys(i) */
|
|
|
|
|
|
|
|
inline const Tag& get_lang_sys_tag (unsigned int i) const {
|
|
|
|
return get_tag (i);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* TODO bsearch */
|
|
|
|
DEFINE_TAG_FIND_INTERFACE (LangSys, lang_sys); /* find_lang_sys (), get_lang_sys_by_tag (tag) */
|
|
|
|
|
|
|
|
inline const bool has_default_lang_sys (void) const {
|
2008-01-23 09:36:40 +00:00
|
|
|
return defaultLangSys != 0;
|
|
|
|
}
|
2008-01-28 07:30:48 +00:00
|
|
|
inline const LangSys& get_default_lang_sys (void) const {
|
2008-01-23 20:50:38 +00:00
|
|
|
if (HB_UNLIKELY (!defaultLangSys))
|
2008-01-23 09:36:40 +00:00
|
|
|
return NullLangSys;
|
|
|
|
return *(LangSys*)((const char*)this + defaultLangSys);
|
|
|
|
}
|
|
|
|
|
2008-01-28 07:30:48 +00:00
|
|
|
private:
|
|
|
|
/* LangSys', in sorted alphabetical tag order */
|
|
|
|
DEFINE_RECORD_ARRAY_TYPE (LangSys, langSysRecord, langSysCount);
|
2006-12-25 14:35:06 +00:00
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2008-01-23 09:36:40 +00:00
|
|
|
Offset defaultLangSys; /* Offset to DefaultLangSys table--from
|
|
|
|
* beginning of Script table--may be Null */
|
|
|
|
USHORT langSysCount; /* Number of LangSysRecords for this script--
|
|
|
|
* excluding the DefaultLangSys */
|
|
|
|
LangSysRecord langSysRecord[];/* Array of LangSysRecords--listed
|
|
|
|
* alphabetically by LangSysTag */
|
2006-12-25 14:35:06 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Script, 4);
|
|
|
|
|
|
|
|
struct ScriptList {
|
2008-01-28 07:30:48 +00:00
|
|
|
|
|
|
|
friend struct GSUBGPOS;
|
|
|
|
|
|
|
|
private:
|
2008-01-23 09:36:40 +00:00
|
|
|
/* Scripts, in sorted alphabetical tag order */
|
|
|
|
DEFINE_RECORD_ARRAY_TYPE (Script, scriptRecord, scriptCount);
|
|
|
|
|
|
|
|
private:
|
|
|
|
USHORT scriptCount; /* Number of ScriptRecords */
|
|
|
|
ScriptRecord scriptRecord[]; /* Array of ScriptRecords--listed alphabetically
|
|
|
|
* by ScriptTag */
|
|
|
|
};
|
|
|
|
DEFINE_NULL_ASSERT_SIZE (ScriptList, 2);
|
2006-12-25 14:35:06 +00:00
|
|
|
|
|
|
|
struct Feature {
|
2008-01-24 08:11:09 +00:00
|
|
|
|
|
|
|
DEFINE_INDEX_ARRAY_INTERFACE (lookup);
|
|
|
|
|
|
|
|
private:
|
2006-12-25 14:35:06 +00:00
|
|
|
/* LookupList indices, in no particular order */
|
|
|
|
DEFINE_ARRAY_TYPE (USHORT, lookupIndex, lookupCount);
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-25 14:35:06 +00:00
|
|
|
Offset featureParams; /* Offset to Feature Parameters table (if one
|
|
|
|
* has been defined for the feature), relative
|
2008-01-23 09:36:40 +00:00
|
|
|
* to the beginning of the Feature Table; = Null
|
2006-12-25 14:35:06 +00:00
|
|
|
* if not required */
|
|
|
|
USHORT lookupCount; /* Number of LookupList indices for this
|
|
|
|
* feature */
|
|
|
|
USHORT lookupIndex[]; /* Array of LookupList indices for this
|
|
|
|
* feature--zero-based (first lookup is
|
2006-12-27 01:00:33 +00:00
|
|
|
* LookupListIndex = 0) */
|
2006-12-25 14:35:06 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Feature, 4);
|
2006-12-25 14:35:06 +00:00
|
|
|
|
2008-01-23 09:36:40 +00:00
|
|
|
struct FeatureList {
|
2008-01-28 07:30:48 +00:00
|
|
|
|
|
|
|
friend struct GSUBGPOS;
|
|
|
|
|
|
|
|
private:
|
2008-01-23 09:36:40 +00:00
|
|
|
/* Feature indices, in sorted alphabetical tag order */
|
|
|
|
DEFINE_RECORD_ARRAY_TYPE (Feature, featureRecord, featureCount);
|
2006-12-25 14:58:02 +00:00
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2008-01-23 09:36:40 +00:00
|
|
|
USHORT featureCount; /* Number of FeatureRecords in this table */
|
|
|
|
FeatureRecord featureRecord[];/* Array of FeatureRecords--zero-based (first
|
|
|
|
* feature has FeatureIndex = 0)--listed
|
|
|
|
* alphabetically by FeatureTag */
|
2006-12-25 14:58:02 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (FeatureList, 2);
|
2006-12-25 14:58:02 +00:00
|
|
|
|
|
|
|
struct LookupFlag : USHORT {
|
|
|
|
static const uint16_t RightToLeft = 0x0001u;
|
|
|
|
static const uint16_t IgnoreBaseGlyphs = 0x0002u;
|
|
|
|
static const uint16_t IgnoreLigatures = 0x0004u;
|
|
|
|
static const uint16_t IgnoreMarks = 0x0008u;
|
|
|
|
static const uint16_t Reserved = 0x00F0u;
|
|
|
|
static const uint16_t MarkAttachmentType = 0xFF00u;
|
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (LookupFlag, 2);
|
|
|
|
|
|
|
|
struct LookupSubTable {
|
|
|
|
DEFINE_NON_INSTANTIABLE(LookupSubTable);
|
|
|
|
|
|
|
|
private:
|
|
|
|
USHORT format; /* Subtable format. Different for GSUB and GPOS */
|
|
|
|
};
|
|
|
|
DEFINE_NULL_ASSERT_SIZE (LookupSubTable, 2);
|
|
|
|
|
2006-12-25 14:58:02 +00:00
|
|
|
|
|
|
|
struct Lookup {
|
|
|
|
/* SubTables, in the desired order */
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_OFFSET_ARRAY_TYPE (LookupSubTable, subTableOffset, subTableCount);
|
2006-12-25 14:58:02 +00:00
|
|
|
|
|
|
|
inline bool is_right_to_left (void) const { return lookupFlag & LookupFlag::RightToLeft; }
|
|
|
|
inline bool ignore_base_glyphs(void) const { return lookupFlag & LookupFlag::IgnoreBaseGlyphs; }
|
|
|
|
inline bool ignore_ligatures (void) const { return lookupFlag & LookupFlag::IgnoreLigatures; }
|
|
|
|
inline bool ignore_marks (void) const { return lookupFlag & LookupFlag::IgnoreMarks; }
|
2006-12-28 11:31:18 +00:00
|
|
|
inline bool get_mark_attachment_type (void) const { return lookupFlag & LookupFlag::MarkAttachmentType; }
|
2006-12-25 14:58:02 +00:00
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
inline uint16_t get_type (void) const { return lookupType; }
|
|
|
|
inline uint16_t get_flag (void) const { return lookupFlag; }
|
|
|
|
|
|
|
|
private:
|
2006-12-25 14:58:02 +00:00
|
|
|
USHORT lookupType; /* Different enumerations for GSUB and GPOS */
|
|
|
|
USHORT lookupFlag; /* Lookup qualifiers */
|
|
|
|
USHORT subTableCount; /* Number of SubTables for this lookup */
|
|
|
|
Offset subTableOffset[];/* Array of offsets to SubTables-from
|
2006-12-27 01:00:33 +00:00
|
|
|
* beginning of Lookup table */
|
2006-12-25 14:58:02 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Lookup, 6);
|
|
|
|
|
|
|
|
struct LookupList {
|
2008-01-28 07:30:48 +00:00
|
|
|
|
|
|
|
friend struct GSUBGPOS;
|
|
|
|
|
|
|
|
private:
|
2008-01-23 09:36:40 +00:00
|
|
|
/* Lookup indices, in sorted alphabetical tag order */
|
|
|
|
DEFINE_OFFSET_ARRAY_TYPE (Lookup, lookupOffset, lookupCount);
|
|
|
|
|
|
|
|
private:
|
|
|
|
USHORT lookupCount; /* Number of lookups in this table */
|
|
|
|
Offset lookupOffset[]; /* Array of offsets to Lookup tables--from
|
|
|
|
* beginning of LookupList--zero based (first
|
|
|
|
* lookup is Lookup index = 0) */
|
|
|
|
};
|
|
|
|
DEFINE_NULL_ASSERT_SIZE (LookupList, 2);
|
2006-12-25 14:58:02 +00:00
|
|
|
|
2006-12-27 00:29:08 +00:00
|
|
|
/*
|
2006-12-27 01:55:37 +00:00
|
|
|
* Coverage Table
|
2006-12-27 00:29:08 +00:00
|
|
|
*/
|
|
|
|
|
2006-12-26 20:29:38 +00:00
|
|
|
struct CoverageFormat1 {
|
2008-01-23 23:02:28 +00:00
|
|
|
|
|
|
|
friend struct Coverage;
|
|
|
|
|
|
|
|
private:
|
2006-12-26 20:29:38 +00:00
|
|
|
/* GlyphIDs, in sorted numerical order */
|
|
|
|
DEFINE_ARRAY_TYPE (GlyphID, glyphArray, glyphCount);
|
|
|
|
|
2008-01-25 00:13:50 +00:00
|
|
|
inline hb_ot_layout_coverage_t get_coverage (hb_glyph_t glyph_id) const {
|
2006-12-28 01:05:16 +00:00
|
|
|
GlyphID gid;
|
|
|
|
gid = glyph_id;
|
2006-12-26 20:29:38 +00:00
|
|
|
// TODO: bsearch
|
2008-01-23 20:50:38 +00:00
|
|
|
for (unsigned int i = 0; i < glyphCount; i++)
|
2006-12-26 20:29:38 +00:00
|
|
|
if (gid == glyphArray[i])
|
|
|
|
return i;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-27 01:00:33 +00:00
|
|
|
USHORT coverageFormat; /* Format identifier--format = 1 */
|
|
|
|
USHORT glyphCount; /* Number of glyphs in the GlyphArray */
|
|
|
|
GlyphID glyphArray[]; /* Array of GlyphIDs--in numerical order */
|
2006-12-26 20:29:38 +00:00
|
|
|
};
|
2008-01-23 05:20:48 +00:00
|
|
|
ASSERT_SIZE (CoverageFormat1, 4);
|
2006-12-26 20:29:38 +00:00
|
|
|
|
2006-12-26 23:53:55 +00:00
|
|
|
struct CoverageRangeRecord {
|
2006-12-27 01:00:33 +00:00
|
|
|
|
2008-01-23 23:02:28 +00:00
|
|
|
friend struct CoverageFormat2;
|
|
|
|
|
|
|
|
private:
|
2008-01-25 00:13:50 +00:00
|
|
|
inline hb_ot_layout_coverage_t get_coverage (hb_glyph_t glyph_id) const {
|
2006-12-26 20:29:38 +00:00
|
|
|
if (glyph_id >= start && glyph_id <= end)
|
|
|
|
return startCoverageIndex + (glyph_id - start);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-26 20:29:38 +00:00
|
|
|
GlyphID start; /* First GlyphID in the range */
|
|
|
|
GlyphID end; /* Last GlyphID in the range */
|
|
|
|
USHORT startCoverageIndex; /* Coverage Index of first GlyphID in
|
|
|
|
* range */
|
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE_DATA (CoverageRangeRecord, 6, "\001");
|
2006-12-26 20:29:38 +00:00
|
|
|
|
|
|
|
struct CoverageFormat2 {
|
2008-01-23 23:02:28 +00:00
|
|
|
|
|
|
|
friend struct Coverage;
|
|
|
|
|
|
|
|
private:
|
2006-12-26 23:53:55 +00:00
|
|
|
/* CoverageRangeRecords, in sorted numerical start order */
|
|
|
|
DEFINE_ARRAY_TYPE (CoverageRangeRecord, rangeRecord, rangeCount);
|
2006-12-26 20:29:38 +00:00
|
|
|
|
2008-01-25 00:13:50 +00:00
|
|
|
inline hb_ot_layout_coverage_t get_coverage (hb_glyph_t glyph_id) const {
|
2006-12-26 20:29:38 +00:00
|
|
|
// TODO: bsearch
|
2008-01-23 20:50:38 +00:00
|
|
|
for (unsigned int i = 0; i < rangeCount; i++) {
|
2006-12-26 20:29:38 +00:00
|
|
|
int coverage = rangeRecord[i].get_coverage (glyph_id);
|
|
|
|
if (coverage >= 0)
|
|
|
|
return coverage;
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-27 01:00:33 +00:00
|
|
|
USHORT coverageFormat; /* Format identifier--format = 2 */
|
|
|
|
USHORT rangeCount; /* Number of CoverageRangeRecords */
|
|
|
|
CoverageRangeRecord rangeRecord[]; /* Array of glyph ranges--ordered by
|
2006-12-26 20:29:38 +00:00
|
|
|
* Start GlyphID. rangeCount entries
|
|
|
|
* long */
|
|
|
|
};
|
2008-01-23 05:20:48 +00:00
|
|
|
ASSERT_SIZE (CoverageFormat2, 4);
|
2006-12-26 20:29:38 +00:00
|
|
|
|
2007-07-06 06:03:26 +00:00
|
|
|
struct Coverage {
|
2006-12-27 00:29:08 +00:00
|
|
|
DEFINE_NON_INSTANTIABLE(Coverage);
|
2006-12-26 20:29:38 +00:00
|
|
|
|
2008-01-23 23:02:28 +00:00
|
|
|
unsigned int get_size (void) const {
|
2007-07-06 06:03:26 +00:00
|
|
|
switch (u.coverageFormat) {
|
|
|
|
case 1: return u.format1.get_size ();
|
|
|
|
case 2: return u.format2.get_size ();
|
|
|
|
default:return sizeof (u.coverageFormat);
|
2006-12-26 20:29:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-25 00:13:50 +00:00
|
|
|
hb_ot_layout_coverage_t get_coverage (hb_glyph_t glyph_id) const {
|
2007-07-06 06:03:26 +00:00
|
|
|
switch (u.coverageFormat) {
|
|
|
|
case 1: return u.format1.get_coverage(glyph_id);
|
|
|
|
case 2: return u.format2.get_coverage(glyph_id);
|
2006-12-27 01:00:33 +00:00
|
|
|
default:return -1;
|
2006-12-26 20:29:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2007-07-06 06:03:26 +00:00
|
|
|
union {
|
2006-12-28 01:05:16 +00:00
|
|
|
USHORT coverageFormat; /* Format identifier */
|
|
|
|
CoverageFormat1 format1;
|
|
|
|
CoverageFormat2 format2;
|
2007-07-06 06:03:26 +00:00
|
|
|
} u;
|
2006-12-26 20:29:38 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL (Coverage, 2);
|
2006-12-25 14:35:06 +00:00
|
|
|
|
2006-12-27 01:00:33 +00:00
|
|
|
/*
|
2006-12-27 01:55:37 +00:00
|
|
|
* Class Definition Table
|
2006-12-27 01:00:33 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
struct ClassDefFormat1 {
|
2008-01-23 23:02:28 +00:00
|
|
|
|
|
|
|
friend struct ClassDef;
|
|
|
|
|
|
|
|
private:
|
2006-12-27 01:00:33 +00:00
|
|
|
/* GlyphIDs, in sorted numerical order */
|
|
|
|
DEFINE_ARRAY_TYPE (USHORT, classValueArray, glyphCount);
|
|
|
|
|
2008-01-25 00:13:50 +00:00
|
|
|
inline hb_ot_layout_class_t get_class (hb_glyph_t glyph_id) const {
|
2008-01-24 08:54:09 +00:00
|
|
|
if (glyph_id >= startGlyph && glyph_id - startGlyph < glyphCount)
|
2006-12-27 01:00:33 +00:00
|
|
|
return classValueArray[glyph_id - startGlyph];
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-27 01:00:33 +00:00
|
|
|
USHORT classFormat; /* Format identifier--format = 1 */
|
|
|
|
GlyphID startGlyph; /* First GlyphID of the classValueArray */
|
|
|
|
USHORT glyphCount; /* Size of the classValueArray */
|
|
|
|
USHORT classValueArray[]; /* Array of Class Values--one per GlyphID */
|
|
|
|
};
|
2008-01-23 05:20:48 +00:00
|
|
|
ASSERT_SIZE (ClassDefFormat1, 6);
|
2006-12-27 01:00:33 +00:00
|
|
|
|
|
|
|
struct ClassRangeRecord {
|
|
|
|
|
2008-01-23 23:02:28 +00:00
|
|
|
friend struct ClassDefFormat2;
|
|
|
|
|
|
|
|
private:
|
2008-01-25 00:13:50 +00:00
|
|
|
inline hb_ot_layout_class_t get_class (hb_glyph_t glyph_id) const {
|
2006-12-27 01:00:33 +00:00
|
|
|
if (glyph_id >= start && glyph_id <= end)
|
|
|
|
return classValue;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-27 01:00:33 +00:00
|
|
|
GlyphID start; /* First GlyphID in the range */
|
|
|
|
GlyphID end; /* Last GlyphID in the range */
|
2008-01-23 05:20:48 +00:00
|
|
|
USHORT classValue; /* Applied to all glyphs in the range */
|
2006-12-27 01:00:33 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE_DATA (ClassRangeRecord, 6, "\001");
|
2006-12-27 01:00:33 +00:00
|
|
|
|
|
|
|
struct ClassDefFormat2 {
|
2008-01-23 23:02:28 +00:00
|
|
|
|
|
|
|
friend struct ClassDef;
|
|
|
|
|
|
|
|
private:
|
2006-12-27 01:00:33 +00:00
|
|
|
/* ClassRangeRecords, in sorted numerical start order */
|
|
|
|
DEFINE_ARRAY_TYPE (ClassRangeRecord, rangeRecord, rangeCount);
|
|
|
|
|
2008-01-25 00:13:50 +00:00
|
|
|
inline hb_ot_layout_class_t get_class (hb_glyph_t glyph_id) const {
|
2006-12-27 01:00:33 +00:00
|
|
|
// TODO: bsearch
|
|
|
|
for (int i = 0; i < rangeCount; i++) {
|
|
|
|
int classValue = rangeRecord[i].get_class (glyph_id);
|
|
|
|
if (classValue > 0)
|
|
|
|
return classValue;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-27 01:00:33 +00:00
|
|
|
USHORT classFormat; /* Format identifier--format = 2 */
|
|
|
|
USHORT rangeCount; /* Number of Number of ClassRangeRecords */
|
|
|
|
ClassRangeRecord rangeRecord[]; /* Array of glyph ranges--ordered by
|
|
|
|
* Start GlyphID */
|
|
|
|
};
|
2008-01-23 05:20:48 +00:00
|
|
|
ASSERT_SIZE (ClassDefFormat2, 4);
|
2006-12-27 01:00:33 +00:00
|
|
|
|
|
|
|
struct ClassDef {
|
|
|
|
DEFINE_NON_INSTANTIABLE(ClassDef);
|
|
|
|
|
2008-01-23 23:02:28 +00:00
|
|
|
unsigned int get_size (void) const {
|
2007-07-06 06:03:26 +00:00
|
|
|
switch (u.classFormat) {
|
|
|
|
case 1: return u.format1.get_size ();
|
|
|
|
case 2: return u.format2.get_size ();
|
|
|
|
default:return sizeof (u.classFormat);
|
2006-12-27 01:00:33 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-25 00:13:50 +00:00
|
|
|
hb_ot_layout_class_t get_class (hb_glyph_t glyph_id) const {
|
2007-07-06 06:03:26 +00:00
|
|
|
switch (u.classFormat) {
|
2008-01-23 06:38:10 +00:00
|
|
|
case 1: return u.format1.get_class(glyph_id);
|
|
|
|
case 2: return u.format2.get_class(glyph_id);
|
2006-12-27 01:00:33 +00:00
|
|
|
default:return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2007-07-06 06:03:26 +00:00
|
|
|
union {
|
2006-12-27 01:00:33 +00:00
|
|
|
USHORT classFormat; /* Format identifier */
|
2006-12-28 01:06:42 +00:00
|
|
|
ClassDefFormat1 format1;
|
|
|
|
ClassDefFormat2 format2;
|
2007-07-06 06:03:26 +00:00
|
|
|
} u;
|
2006-12-27 01:00:33 +00:00
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL (ClassDef, 2);
|
2006-12-27 01:00:33 +00:00
|
|
|
|
2006-12-27 01:55:37 +00:00
|
|
|
/*
|
|
|
|
* Device Tables
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct Device {
|
2008-01-23 23:02:28 +00:00
|
|
|
DEFINE_NON_INSTANTIABLE(Device);
|
2006-12-27 01:55:37 +00:00
|
|
|
|
2008-01-23 23:02:28 +00:00
|
|
|
unsigned int get_size (void) const {
|
2006-12-27 01:55:37 +00:00
|
|
|
int count = endSize - startSize + 1;
|
|
|
|
if (count < 0) count = 0;
|
|
|
|
switch (deltaFormat) {
|
|
|
|
case 1: return sizeof (Device) + sizeof (USHORT) * ((count+7)/8);
|
|
|
|
case 2: return sizeof (Device) + sizeof (USHORT) * ((count+3)/4);
|
|
|
|
case 3: return sizeof (Device) + sizeof (USHORT) * ((count+1)/2);
|
|
|
|
default:return sizeof (Device);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-23 23:02:28 +00:00
|
|
|
int get_delta (int ppem_size) const {
|
2006-12-27 01:55:37 +00:00
|
|
|
if (ppem_size >= startSize && ppem_size <= endSize &&
|
|
|
|
deltaFormat >= 1 && deltaFormat <= 3) {
|
|
|
|
int s = ppem_size - startSize;
|
|
|
|
int f = deltaFormat;
|
2006-12-27 01:00:33 +00:00
|
|
|
|
2006-12-27 01:55:37 +00:00
|
|
|
uint16_t byte = deltaValue[s >> (4 - f)];
|
|
|
|
uint16_t bits = byte >> (16 - (((s & ((1 << (4 - f)) - 1)) + 1) << f));
|
|
|
|
uint16_t mask = 0xFFFF >> (16 - (1 << f));
|
|
|
|
|
|
|
|
int delta = bits & mask;
|
|
|
|
|
|
|
|
if (delta >= ((mask + 1) >> 1))
|
|
|
|
delta -= mask + 1;
|
|
|
|
|
|
|
|
return delta;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2008-01-23 05:20:48 +00:00
|
|
|
private:
|
2006-12-27 01:55:37 +00:00
|
|
|
USHORT startSize; /* Smallest size to correct--in ppem */
|
|
|
|
USHORT endSize; /* Largest size to correct--in ppem */
|
|
|
|
USHORT deltaFormat; /* Format of DeltaValue array data: 1, 2, or 3 */
|
|
|
|
USHORT deltaValue[]; /* Array of compressed data */
|
|
|
|
};
|
2008-01-23 09:36:40 +00:00
|
|
|
DEFINE_NULL_ASSERT_SIZE (Device, 6);
|
2006-12-25 14:35:06 +00:00
|
|
|
|
2008-01-23 09:36:40 +00:00
|
|
|
/*
|
2008-01-23 22:25:29 +00:00
|
|
|
* GSUB/GPOS Common
|
2008-01-23 09:36:40 +00:00
|
|
|
*/
|
2006-12-27 06:29:24 +00:00
|
|
|
|
2008-01-23 22:25:29 +00:00
|
|
|
typedef struct GSUBGPOS {
|
2008-01-23 07:01:37 +00:00
|
|
|
static const hb_tag_t GSUBTag = HB_TAG ('G','S','U','B');
|
|
|
|
static const hb_tag_t GPOSTag = HB_TAG ('G','P','O','S');
|
|
|
|
|
2008-01-23 22:25:29 +00:00
|
|
|
STATIC_DEFINE_GET_FOR_DATA (GSUBGPOS);
|
|
|
|
/* XXX check version here? */
|
2006-12-27 06:29:24 +00:00
|
|
|
|
2008-01-28 07:30:48 +00:00
|
|
|
DEFINE_TAG_LIST_INTERFACE (Script, script ); /* get_script_count (), get_script (i), get_script_tag (i) */
|
|
|
|
DEFINE_TAG_LIST_INTERFACE (Feature, feature); /* get_feature_count(), get_feature(i), get_feature_tag(i) */
|
|
|
|
DEFINE_LIST_INTERFACE (Lookup, lookup ); /* get_lookup_count (), get_lookup (i) */
|
|
|
|
|
|
|
|
/* TODO bsearch */
|
|
|
|
DEFINE_TAG_FIND_INTERFACE (Script, script ); /* find_script (), get_script_by_tag (tag) */
|
|
|
|
DEFINE_TAG_FIND_INTERFACE (Feature, feature); /* find_feature(), get_feature_by_tag(tag) */
|
|
|
|
|
|
|
|
private:
|
|
|
|
DEFINE_LIST_ARRAY(Script, script);
|
|
|
|
DEFINE_LIST_ARRAY(Feature, feature);
|
|
|
|
DEFINE_LIST_ARRAY(Lookup, lookup);
|
2008-01-23 05:20:48 +00:00
|
|
|
|
|
|
|
private:
|
2007-07-06 06:03:26 +00:00
|
|
|
Fixed_Version version; /* Version of the GSUB/GPOS table--initially set
|
|
|
|
* to 0x00010000 */
|
|
|
|
Offset scriptList; /* Offset to ScriptList table--from beginning of
|
|
|
|
* GSUB/GPOS table */
|
|
|
|
Offset featureList; /* Offset to FeatureList table--from beginning of
|
|
|
|
* GSUB/GPOS table */
|
|
|
|
Offset lookupList; /* Offset to LookupList table--from beginning of
|
|
|
|
* GSUB/GPOS table */
|
2008-01-23 22:25:29 +00:00
|
|
|
};
|
|
|
|
DEFINE_NULL_ASSERT_SIZE (GSUBGPOS, 10);
|
2006-12-27 06:29:24 +00:00
|
|
|
|
2008-01-23 10:00:30 +00:00
|
|
|
#endif /* HB_OT_LAYOUT_OPEN_PRIVATE_H */
|