harfbuzz/src/harfbuzz-ng.cc

803 lines
25 KiB
C++
Raw Normal View History

2006-12-22 04:30:38 +01:00
#include <stdint.h>
2006-12-22 08:21:55 +01:00
#include <assert.h>
#include <glib.h>
2006-12-22 04:30:38 +01:00
2006-12-25 11:39:20 +01:00
/* Public header */
2006-12-25 11:39:20 +01:00
typedef uint32_t hb_tag_t;
#define HB_TAG(a,b,c,d) ((hb_tag_t)(((uint8_t)a<<24)|((uint8_t)b<<16)|((uint8_t)c<<8)|(uint8_t)d))
/* Implementation */
/* Macros to convert to/from BigEndian */
#define hb_be_uint8_t
#define hb_be_int8_t
#define hb_be_uint16_t GUINT16_TO_BE
#define hb_be_int16_t GINT16_TO_BE
#define hb_be_uint32_t GUINT32_TO_BE
#define hb_be_int32_t GINT32_TO_BE
#define hb_be_uint64_t GUINT64_TO_BE
#define hb_be_int64_t GINT64_TO_BE
2006-12-22 08:21:55 +01:00
/*
* Int types
*/
#define DEFINE_INT_TYPE1(NAME, TYPE, BIG_ENDIAN) \
2006-12-22 08:21:55 +01: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; } \
private: TYPE v; \
public:
#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)
#define DEFINE_INT_TYPE_STRUCT(NAME, u, w) \
struct NAME { \
DEFINE_INT_TYPE(NAME, u, w) \
}
2006-12-22 08:21:55 +01: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)
#define DEFINE_NON_INSTANTIABLE(Type) \
2006-12-25 12:18:52 +01:00
private: inline Type() {} /* cannot be instantiated */ \
public:
2006-12-22 08:21:55 +01:00
/* 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) \
DEFINE_INDEX_OPERATOR(const, Type, array, num) \
DEFINE_INDEX_OPERATOR( , Type, array, num) \
DEFINE_LEN_AND_SIZE(Type, array, num)
#define DEFINE_INDEX_OPERATOR(const, Type, array, num) \
inline const Type& operator[] (unsigned int i) const { \
assert (i < num); \
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) \
DEFINE_OFFSET_INDEX_OPERATOR(const, Type, array, num) \
DEFINE_OFFSET_INDEX_OPERATOR( , Type, array, num) \
DEFINE_LEN_AND_SIZE(Offset, array, num)
#define DEFINE_OFFSET_INDEX_OPERATOR(const, Type, array, num) \
inline const Type& operator[] (unsigned int i) const { \
assert (i < num); \
2006-12-27 02:55:37 +01:00
assert (array[i]); /* TODO: should just skip them */ \
2006-12-22 08:21:55 +01:00
return *(const Type *)((const char*)this + array[i]); \
}
#define DEFINE_RECORD_ARRAY_TYPE(Type, array, num) \
DEFINE_RECORD_ACCESSOR(const, Type, array, num) \
DEFINE_RECORD_ACCESSOR( , Type, array, num) \
DEFINE_LEN_AND_SIZE(Record, array, num)
#define DEFINE_RECORD_ACCESSOR(const, Type, array, num) \
inline const Type& operator[] (unsigned int i) const { \
assert (i < num); \
2006-12-27 02:55:37 +01:00
assert (array[i].offset); /* TODO: should just skip them */ \
2006-12-22 08:21:55 +01:00
return *(const Type *)((const char*)this + array[i].offset); \
} \
inline const Tag& get_tag (unsigned int i) const { \
assert (i < num); \
return array[i].tag; \
} \
/* TODO: implement find_tag() */
/*
*
* 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):" */
DEFINE_INT_TYPE_STRUCT (BYTE, u, 8); /* 8-bit unsigned integer. */
DEFINE_INT_TYPE_STRUCT (CHAR, , 8); /* 8-bit signed integer. */
2006-12-27 06:21:31 +01:00
DEFINE_INT_TYPE_STRUCT (USHORT, u, 16); /* 16-bit unsigned integer. */
DEFINE_INT_TYPE_STRUCT (SHORT, , 16); /* 16-bit signed integer. */
DEFINE_INT_TYPE_STRUCT (ULONG, u, 32); /* 32-bit unsigned integer. */
DEFINE_INT_TYPE_STRUCT (LONG, , 32); /* 32-bit signed integer. */
/* Date represented in number of seconds since 12:00 midnight, January 1,
* 1904. The value is represented as a signed 64-bit integer. */
DEFINE_INT_TYPE_STRUCT (LONGDATETIME, , 64);
/* 32-bit signed fixed-point number (16.16) */
2006-12-22 04:31:31 +01:00
struct Fixed : LONG {
2006-12-22 08:21:55 +01:00
inline operator double(void) const { return (uint32_t) this / 65536.; }
inline int16_t int_part (void) const { return (uint32_t) this >> 16; }
inline int16_t frac_part (void) const { return (uint32_t) this & 0xffff; }
};
/* Smallest measurable distance in the em space. */
2006-12-22 04:31:31 +01:00
struct FUNIT;
/* 16-bit signed integer (SHORT) that describes a quantity in FUnits. */
2006-12-22 04:31:31 +01:00
struct FWORD : SHORT {
};
/* 16-bit unsigned integer (USHORT) that describes a quantity in FUnits. */
2006-12-22 04:31:31 +01:00
struct UFWORD : USHORT {
};
/* 16-bit signed fixed number with the low 14 bits of fraction (2.14). */
2006-12-22 04:31:31 +01:00
struct F2DOT14 : SHORT {
2006-12-22 08:21:55 +01:00
inline operator double() const { return (uint32_t) this / 16384.; }
};
/* Array of four uint8s (length = 32 bits) used to identify a script, language
* system, feature, or baseline */
2006-12-22 08:21:55 +01:00
struct Tag {
inline Tag (void) { v[0] = v[1] = v[2] = v[3] = 0; }
2006-12-25 15:14:52 +01:00
inline Tag (uint32_t v) { (ULONG&)(*this) = v; }
2006-12-25 11:39:20 +01: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 15:14:52 +01: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 07:29:24 +01: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]; }
2006-12-25 15:14:52 +01: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 12:18:52 +01:00
inline operator const char* (void) const { return (const char *)this; }
inline operator char* (void) { return (char *)this; }
2006-12-22 08:21:55 +01:00
private: char v[4];
};
/* Glyph index number, same as uint16 (length = 16 bits) */
DEFINE_INT_TYPE_STRUCT (GlyphID, u, 16);
/* Offset to a table, same as uint16 (length = 16 bits), NULL offset = 0x0000 */
DEFINE_INT_TYPE_STRUCT (Offset, u, 16);
/* CheckSum */
2006-12-22 04:31:31 +01: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;
}
};
/*
* Version Numbers
*/
2006-12-22 04:31:31 +01:00
struct USHORT_Version : USHORT {
};
2006-12-22 04:31:31 +01:00
struct Fixed_Version : Fixed {
2006-12-22 08:21:55 +01:00
inline int16_t major (void) const { return this->int_part(); }
inline int16_t minor (void) const { return this->frac_part(); }
};
/*
* Organization of an OpenType Font
*/
2006-12-28 01:58:32 +01:00
struct OpenTypeFontFaceFile;
2006-12-25 11:39:20 +01:00
struct OffsetTable;
struct TTCHeader;
2006-12-25 12:18:52 +01:00
typedef struct TableDirectory {
2006-12-22 04:31:31 +01:00
Tag tag; /* 4-byte identifier. */
CheckSum checkSum; /* CheckSum for this table. */
ULONG offset; /* Offset from beginning of TrueType font
* file. */
2006-12-22 04:31:31 +01:00
ULONG length; /* Length of this table. */
2006-12-25 12:18:52 +01:00
} OpenTypeTable;
2006-12-25 12:18:52 +01:00
typedef struct OffsetTable {
2006-12-25 15:14:52 +01:00
/* OpenTypeTables, in no particular order */
2006-12-22 08:21:55 +01:00
DEFINE_ARRAY_TYPE (TableDirectory, tableDir, numTables);
2006-12-25 12:18:52 +01:00
// TODO: Implement find_table
2006-12-22 08:21:55 +01: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 01:58:32 +01:00
} OpenTypeFontFace;
/*
* TrueType Collections
*/
2006-12-22 04:31:31 +01:00
struct TTCHeader {
2006-12-28 01:58:32 +01:00
/* OpenTypeFontFaces, in no particular order */
2006-12-22 08:21:55 +01:00
DEFINE_OFFSET_ARRAY_TYPE (OffsetTable, offsetTable, numFonts);
2006-12-25 15:58:02 +01:00
Tag ttcTag; /* TrueType Collection ID string: 'ttcf' */
2006-12-22 04:31:31 +01:00
ULONG version; /* Version of the TTC Header (1.0 or 2.0),
* 0x00010000 or 0x00020000 */
2006-12-22 04:31:31 +01:00
ULONG numFonts; /* Number of fonts in TTC */
2006-12-22 08:21:55 +01:00
ULONG offsetTable[]; /* Array of offsets to the OffsetTable for each font
2006-12-27 02:00:33 +01:00
* from the beginning of the file */
};
2006-12-25 11:39:20 +01:00
/*
* OpenType Font File
*/
2006-12-28 01:58:32 +01:00
struct OpenTypeFontFaceFile {
DEFINE_NON_INSTANTIABLE(OpenTypeFontFaceFile);
2006-12-25 12:22:08 +01: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 11:39:20 +01:00
2006-12-25 12:18:52 +01:00
/* Factory: ::get(font_data)
* This is how you get a handle to one of these
*/
2006-12-28 01:58:32 +01:00
static inline const OpenTypeFontFaceFile& get (const char *font_data) {
return (const OpenTypeFontFaceFile&)*font_data;
2006-12-25 12:18:52 +01:00
}
2006-12-28 01:58:32 +01:00
static inline OpenTypeFontFaceFile& get (char *font_data) {
return (OpenTypeFontFaceFile&)*font_data;
2006-12-25 12:18:52 +01:00
}
2006-12-27 07:29:24 +01:00
/* This is how you get a table */
inline const char* get_table (const OpenTypeTable& table) const {
return ((const char*)this) + table.offset;
}
inline char* get_table (const OpenTypeTable& table) {
return ((char*)this) + table.offset;
}
inline const char* operator[] (const OpenTypeTable& table) const {
return ((const char*)this) + table.offset;
}
inline char* operator[] (const OpenTypeTable& table) {
return ((char*)this) + table.offset;
}
2006-12-25 12:18:52 +01:00
/* Array interface sans get_size() */
inline unsigned int get_len (void) const {
2006-12-25 11:39:20 +01:00
switch (tag) {
2006-12-25 12:18:52 +01:00
default: return 0;
2006-12-25 12:22:08 +01:00
case TrueTypeTag: case CFFTag: return 1;
case TTCTag: return ((const TTCHeader&)*this).get_len();
2006-12-25 11:39:20 +01:00
}
}
2006-12-28 01:58:32 +01:00
inline const OpenTypeFontFace& operator[] (unsigned int i) const {
2006-12-25 11:39:20 +01:00
assert (i < get_len ());
switch (tag) {
2006-12-25 12:22:08 +01:00
default: case TrueTypeTag: case CFFTag: return (const OffsetTable&)*this;
case TTCTag: return ((const TTCHeader&)*this)[i];
2006-12-25 11:39:20 +01:00
}
}
2006-12-28 01:58:32 +01:00
inline OpenTypeFontFace& operator[] (unsigned int i) {
2006-12-25 11:39:20 +01:00
assert (i < get_len ());
switch (tag) {
2006-12-25 12:22:08 +01:00
default: case TrueTypeTag: case CFFTag: return (OffsetTable&)*this;
case TTCTag: return ((TTCHeader&)*this)[i];
2006-12-25 11:39:20 +01:00
}
}
2006-12-25 12:18:52 +01:00
Tag tag; /* 4-byte identifier. */
2006-12-25 11:39:20 +01:00
};
/*
*
* OpenType Layout Common Table Formats
*
*/
2006-12-27 01:29:08 +01:00
/*
2006-12-28 01:58:32 +01:00
* Script, ScriptList, LangSys, Feature, FeatureList, Lookup, LookupList
2006-12-27 01:29:08 +01:00
*/
2006-12-22 08:21:55 +01:00
struct Script;
2006-12-25 15:58:02 +01:00
struct ScriptList;
2006-12-22 08:21:55 +01:00
struct LangSys;
2006-12-25 15:58:02 +01:00
struct Feature;
struct FeatureList;
struct Lookup;
struct LookupList;
2006-12-22 08:21:55 +01:00
typedef struct Record {
Tag tag; /* 4-byte Tag identifier */
Offset offset; /* Offset from beginning of object holding
* the Record */
} ScriptRecord, LangSysRecord, FeatureRecord;
struct ScriptList {
2006-12-25 15:35:06 +01:00
/* Scripts, in sorted alphabetical tag order */
2006-12-22 08:21:55 +01:00
DEFINE_RECORD_ARRAY_TYPE (Script, scriptRecord, scriptCount);
USHORT scriptCount; /* Number of ScriptRecords */
ScriptRecord scriptRecord[]; /* Array of ScriptRecords--listed alphabetically
2006-12-27 02:00:33 +01:00
* by ScriptTag */
};
2006-12-22 08:21:55 +01:00
struct Script {
2006-12-25 15:35:06 +01:00
/* LangSys', in sorted alphabetical tag order */
2006-12-22 08:21:55 +01:00
DEFINE_RECORD_ARRAY_TYPE (LangSys, langSysRecord, langSysCount);
2006-12-25 15:14:52 +01:00
/* Return NULL if none */
inline const LangSys* get_default_language_system (void) const {
if (!defaultLangSys)
return NULL;
return (const LangSys *)((const char*)this + defaultLangSys);
}
inline LangSys* get_default_language_system (void) {
if (!defaultLangSys)
return NULL;
return (LangSys *)((char*)this + defaultLangSys);
}
2006-12-22 08:21:55 +01: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-22 08:21:55 +01:00
struct LangSys {
2006-12-25 15:35:06 +01:00
/* Feature indices, in no particular order */
2006-12-25 15:14:52 +01:00
DEFINE_ARRAY_TYPE (USHORT, featureIndex, featureCount);
2006-12-25 11:39:20 +01:00
2006-12-25 15:14:52 +01:00
/* Returns -1 if none */
inline int get_required_feature_index (void) const {
if (reqFeatureIndex == 0xffff)
return -1;
return reqFeatureIndex;;
}
2006-12-25 15:14:52 +01:00
Offset lookupOrder; /* = NULL (reserved for an offset to a
* 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 15:35:06 +01:00
* arbitrary order. featureCount entires long */
2006-12-22 08:21:55 +01:00
};
2006-12-22 04:30:38 +01:00
2006-12-25 15:35:06 +01:00
struct FeatureList {
/* Feature indices, in sorted alphabetical tag order */
DEFINE_RECORD_ARRAY_TYPE (Feature, featureRecord, featureCount);
USHORT featureCount; /* Number of FeatureRecords in this table */
FeatureRecord featureRecord[];/* Array of FeatureRecords--zero-based (first
* feature has FeatureIndex = 0)--listed
2006-12-27 02:00:33 +01:00
* alphabetically by FeatureTag */
2006-12-25 15:35:06 +01:00
};
struct Feature {
/* LookupList indices, in no particular order */
DEFINE_ARRAY_TYPE (USHORT, lookupIndex, lookupCount);
// TODO: implement get_feature_params()
Offset featureParams; /* Offset to Feature Parameters table (if one
* has been defined for the feature), relative
* to the beginning of the Feature Table; = NULL
* 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 02:00:33 +01:00
* LookupListIndex = 0) */
2006-12-25 15:35:06 +01:00
};
2006-12-25 15:58:02 +01:00
struct LookupList {
/* Lookup indices, in sorted alphabetical tag order */
DEFINE_OFFSET_ARRAY_TYPE (Lookup, lookupOffset, lookupCount);
USHORT lookupCount; /* Number of lookups in this table */
Offset lookupOffset[]; /* Array of offsets to Lookup tables--from
* beginning of LookupList--zero based (first
2006-12-27 02:00:33 +01:00
* lookup is Lookup index = 0) */
2006-12-25 15:58:02 +01: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;
};
struct Lookup {
/* SubTables, in the desired order */
2006-12-28 01:58:32 +01:00
DEFINE_OFFSET_ARRAY_TYPE (char*, subTableOffset, subTableCount);
2006-12-25 15:58:02 +01: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; }
inline bool get_mark_attachment_type (void) const { return (lookupFlag & LookupFlag::MarkAttachmentType) >> 8; }
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 02:00:33 +01:00
* beginning of Lookup table */
2006-12-25 15:58:02 +01:00
};
2006-12-27 01:29:08 +01:00
/*
2006-12-27 02:55:37 +01:00
* Coverage Table
2006-12-27 01:29:08 +01:00
*/
2006-12-26 21:29:38 +01:00
struct CoverageFormat1 {
/* GlyphIDs, in sorted numerical order */
DEFINE_ARRAY_TYPE (GlyphID, glyphArray, glyphCount);
2006-12-27 02:00:33 +01:00
inline int get_coverage (uint16_t glyph_id) const {
2006-12-28 02:05:16 +01:00
GlyphID gid;
gid = glyph_id;
2006-12-26 21:29:38 +01:00
// TODO: bsearch
for (int i = 0; i < glyphCount; i++)
if (gid == glyphArray[i])
return i;
return -1;
}
2006-12-27 02:00:33 +01: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 21:29:38 +01:00
};
struct CoverageRangeRecord {
2006-12-27 02:00:33 +01:00
inline int get_coverage (uint16_t glyph_id) const {
2006-12-26 21:29:38 +01:00
if (glyph_id >= start && glyph_id <= end)
return startCoverageIndex + (glyph_id - start);
return -1;
}
GlyphID start; /* First GlyphID in the range */
GlyphID end; /* Last GlyphID in the range */
USHORT startCoverageIndex; /* Coverage Index of first GlyphID in
* range */
};
struct CoverageFormat2 {
/* CoverageRangeRecords, in sorted numerical start order */
DEFINE_ARRAY_TYPE (CoverageRangeRecord, rangeRecord, rangeCount);
2006-12-26 21:29:38 +01:00
2006-12-27 02:00:33 +01:00
inline int get_coverage (uint16_t glyph_id) const {
2006-12-26 21:29:38 +01:00
// TODO: bsearch
for (int i = 0; i < rangeCount; i++) {
int coverage = rangeRecord[i].get_coverage (glyph_id);
if (coverage >= 0)
return coverage;
}
return -1;
}
2006-12-27 02:00:33 +01:00
USHORT coverageFormat; /* Format identifier--format = 2 */
USHORT rangeCount; /* Number of CoverageRangeRecords */
CoverageRangeRecord rangeRecord[]; /* Array of glyph ranges--ordered by
2006-12-26 21:29:38 +01:00
* Start GlyphID. rangeCount entries
* long */
};
2006-12-28 02:05:16 +01:00
union Coverage {
2006-12-27 01:29:08 +01:00
DEFINE_NON_INSTANTIABLE(Coverage);
2006-12-26 21:29:38 +01:00
inline unsigned int get_size (void) const {
switch (coverageFormat) {
2006-12-28 02:05:16 +01:00
case 1: return format1.get_size ();
case 2: return format2.get_size ();
default:return sizeof (coverageFormat);
2006-12-26 21:29:38 +01:00
}
}
/* Returns -1 if not covered. */
2006-12-27 02:00:33 +01:00
inline int get_coverage (uint16_t glyph_id) const {
2006-12-26 21:29:38 +01:00
switch (coverageFormat) {
2006-12-28 02:05:16 +01:00
case 1: return format1.get_coverage(glyph_id);
case 2: return format2.get_coverage(glyph_id);
2006-12-27 02:00:33 +01:00
default:return -1;
2006-12-26 21:29:38 +01:00
}
}
2006-12-28 02:05:16 +01:00
USHORT coverageFormat; /* Format identifier */
CoverageFormat1 format1;
CoverageFormat2 format2;
2006-12-26 21:29:38 +01:00
};
2006-12-25 15:35:06 +01:00
2006-12-27 02:00:33 +01:00
/*
2006-12-27 02:55:37 +01:00
* Class Definition Table
2006-12-27 02:00:33 +01:00
*/
struct ClassDefFormat1 {
/* GlyphIDs, in sorted numerical order */
DEFINE_ARRAY_TYPE (USHORT, classValueArray, glyphCount);
inline int get_class (uint16_t glyph_id) const {
if (glyph_id >= startGlyph && glyph_id < startGlyph + glyphCount)
return classValueArray[glyph_id - startGlyph];
return 0;
}
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 */
};
struct ClassRangeRecord {
inline int get_class (uint16_t glyph_id) const {
if (glyph_id >= start && glyph_id <= end)
return classValue;
return 0;
}
GlyphID start; /* First GlyphID in the range */
GlyphID end; /* Last GlyphID in the range */
USHORT classValue; /* Applied to all glyphs in the range
*/
};
struct ClassDefFormat2 {
/* ClassRangeRecords, in sorted numerical start order */
DEFINE_ARRAY_TYPE (ClassRangeRecord, rangeRecord, rangeCount);
inline int get_class (uint16_t glyph_id) const {
// TODO: bsearch
for (int i = 0; i < rangeCount; i++) {
int classValue = rangeRecord[i].get_class (glyph_id);
if (classValue > 0)
return classValue;
}
return 0;
}
USHORT classFormat; /* Format identifier--format = 2 */
USHORT rangeCount; /* Number of Number of ClassRangeRecords */
ClassRangeRecord rangeRecord[]; /* Array of glyph ranges--ordered by
* Start GlyphID */
};
struct ClassDef {
DEFINE_NON_INSTANTIABLE(ClassDef);
inline unsigned int get_size (void) const {
switch (classFormat) {
2006-12-28 02:06:42 +01:00
case 1: return format1.get_size ();
case 2: return format2.get_size ();
default:return sizeof (classFormat);
2006-12-27 02:00:33 +01:00
}
}
/* Returns 0 if not found. */
inline int get_class (uint16_t glyph_id) const {
switch (classFormat) {
2006-12-28 02:06:42 +01:00
case 1: format1.get_class(glyph_id);
case 2: format2.get_class(glyph_id);
2006-12-27 02:00:33 +01:00
default:return 0;
}
}
USHORT classFormat; /* Format identifier */
2006-12-28 02:06:42 +01:00
ClassDefFormat1 format1;
ClassDefFormat2 format2;
2006-12-27 02:00:33 +01:00
};
2006-12-27 02:55:37 +01:00
/*
* Device Tables
*/
struct Device {
inline unsigned int get_size (void) const {
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);
}
}
inline int get_delta (int ppem_size) {
if (ppem_size >= startSize && ppem_size <= endSize &&
deltaFormat >= 1 && deltaFormat <= 3) {
int s = ppem_size - startSize;
int f = deltaFormat;
2006-12-27 02:00:33 +01:00
2006-12-27 02:55:37 +01: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;
}
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 */
};
2006-12-25 15:35:06 +01:00
2006-12-27 07:29:24 +01:00
/*
*
* The Glyph Substitution Table
*
*/
#define DEFINE_LIST_ACCESSOR0(const, Type, name) \
inline const Type##List* get_##name##_list (void) const { \
assert (name##List); \
return (const Type##List *)((const char*)this + name##List); \
} \
inline const Type& name (unsigned int i) const { \
return (*get_##name##_list())[i]; \
}
#define DEFINE_LIST_ACCESSOR(Type, name) \
DEFINE_LIST_ACCESSOR0(const, Type, name) \
DEFINE_LIST_ACCESSOR0( , Type, name)
struct GSUBGPOSHeader {
DEFINE_LIST_ACCESSOR(Script, script); /* get_script_list and script(i) */
DEFINE_LIST_ACCESSOR(Feature, feature);/* get_feature_list and feature(i) */
DEFINE_LIST_ACCESSOR(Lookup, lookup); /* get_lookup_list and lookup(i) */
Fixed_Version version; /* Version of the GSUB table-initially set to
* 0x00010000 */
Offset scriptList; /* Offset to ScriptList table-from beginning of
* GSUB table */
Offset featureList; /* Offset to FeatureList table-from beginning of
* GSUB table */
Offset lookupList; /* Offset to LookupList table-from beginning of
* GSUB table */
};
struct GSUB : GSUBGPOSHeader {
};
2006-12-22 04:30:38 +01:00
2006-12-28 01:59:07 +01:00
struct GPOS : GSUBGPOSHeader {
};
2006-12-27 01:29:08 +01:00
2006-12-25 11:39:20 +01:00
#include <stdlib.h>
2006-12-22 04:30:38 +01:00
#include <stdio.h>
int
2006-12-25 11:39:20 +01:00
main (int argc, char **argv)
2006-12-22 04:30:38 +01:00
{
2006-12-25 11:39:20 +01:00
if (argc != 2) {
fprintf (stderr, "usage: %s font-file.ttf\n", argv[0]);
exit (1);
}
GMappedFile *mf = g_mapped_file_new (argv[1], FALSE, NULL);
const char *font_data = g_mapped_file_get_contents (mf);
int len = g_mapped_file_get_length (mf);
printf ("Opened font file %s: %d bytes long\n", argv[1], len);
2006-12-28 01:58:32 +01:00
const OpenTypeFontFaceFile &ot = OpenTypeFontFaceFile::get (font_data);
2006-12-25 11:39:20 +01:00
switch (ot.tag) {
2006-12-28 01:58:32 +01:00
case OpenTypeFontFaceFile::TrueTypeTag:
2006-12-25 11:39:20 +01:00
printf ("OpenType font with TrueType outlines\n");
break;
2006-12-28 01:58:32 +01:00
case OpenTypeFontFaceFile::CFFTag:
2006-12-25 11:39:20 +01:00
printf ("OpenType font with CFF (Type1) outlines\n");
break;
2006-12-28 01:58:32 +01:00
case OpenTypeFontFaceFile::TTCTag:
2006-12-25 11:39:20 +01:00
printf ("TrueType Collection of OpenType fonts\n");
break;
default:
2006-12-25 12:22:08 +01:00
printf ("Unknown font format\n");
2006-12-25 11:39:20 +01:00
break;
}
int num_fonts = ot.get_len ();
printf ("%d font(s) found in file\n", num_fonts);
2006-12-25 12:18:52 +01:00
for (int n_font = 0; n_font < num_fonts; n_font++) {
2006-12-28 01:58:32 +01:00
const OpenTypeFontFace &font = ot[n_font];
2006-12-25 12:22:08 +01:00
printf ("Font %d of %d:\n", n_font+1, num_fonts);
2006-12-25 12:18:52 +01:00
int num_tables = font.get_len ();
2006-12-27 07:29:24 +01:00
printf (" %d table(s) found in font\n", num_tables);
2006-12-25 12:18:52 +01:00
for (int n_table = 0; n_table < num_tables; n_table++) {
const OpenTypeTable &table = font[n_table];
2006-12-27 07:29:24 +01:00
printf (" Table %2d of %2d: %.4s (0x%06x+0x%06x)\n", n_table+1, num_tables,
2006-12-25 12:18:52 +01:00
(const char *)table.tag, (int)table.offset, (int)table.length);
2006-12-27 07:29:24 +01:00
if (table.tag == "GSUB" || table.tag == "GPOS") {
const GSUBGPOSHeader &g = (const GSUBGPOSHeader&)*ot[table];
const ScriptList &scripts = *g.get_script_list();
int num_scripts = scripts.get_len ();
printf (" %d script(s) found in table\n", num_scripts);
for (int n_script = 0; n_script < num_scripts; n_script++) {
const Script &script = scripts[n_script];
printf (" Script %2d of %2d: %.4s\n", n_script+1, num_scripts,
(const char *)scripts.get_tag(n_script));
if (script.get_default_language_system () == NULL)
printf (" No default language system\n");
int num_langsys = script.get_len ();
printf (" %d language system(s) found in script\n", num_langsys);
for (int n_langsys = 0; n_langsys < num_langsys; n_langsys++) {
const LangSys &langsys = script[n_langsys];
2006-12-28 01:58:32 +01:00
printf (" Language System %2d of %2d: %.4s; %d features\n", n_langsys+1, num_langsys,
(const char *)script.get_tag(n_langsys),
langsys.get_len ());
if (!langsys.get_required_feature_index ())
printf (" No required feature\n");
2006-12-27 07:29:24 +01:00
}
}
const FeatureList &features = *g.get_feature_list();
int num_features = features.get_len ();
printf (" %d feature(s) found in table\n", num_features);
for (int n_feature = 0; n_feature < num_features; n_feature++) {
const Feature &feature = features[n_feature];
printf (" Feature %2d of %2d: %.4s; %d lookup(s)\n", n_feature+1, num_features,
(const char *)features.get_tag(n_feature),
(int)feature.lookupCount);
}
const LookupList &lookups = *g.get_lookup_list();
int num_lookups = lookups.get_len ();
printf (" %d lookup(s) found in table\n", num_lookups);
for (int n_lookup = 0; n_lookup < num_lookups; n_lookup++) {
const Lookup &lookup = lookups[n_lookup];
printf (" Lookup %2d of %2d: type %d, flags %04x\n", n_lookup+1, num_lookups,
(int)lookup.lookupType, (unsigned int)lookup.lookupFlag);
}
}
2006-12-25 12:18:52 +01:00
}
2006-12-25 11:39:20 +01:00
}
2006-12-22 04:30:38 +01:00
return 0;
}