harfbuzz/src/hb-ot-layout-base-table.hh

560 lines
15 KiB
C++
Raw Normal View History

2017-02-18 19:54:33 +01:00
/*
* Copyright © 2016 Elie Roux <elie.roux@telecom-bretagne.eu>
*
* This is part of HarfBuzz, a text shaping 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.
*
*/
#ifndef HB_OT_BASE_TABLE_HH
#define HB_OT_BASE_TABLE_HH
#include "hb-open-type-private.hh"
#include "hb-ot-layout-common-private.hh"
#define HB_OT_TAG_BASE HB_TAG('B','A','S','E')
// https://www.microsoft.com/typography/otspec/baselinetags.htm
#define HB_OT_TAG_BASE_HANG HB_TAG('h','a','n','g')
#define HB_OT_TAG_BASE_ICFB HB_TAG('i','c','f','b')
#define HB_OT_TAG_BASE_ICFT HB_TAG('i','c','f','t')
#define HB_OT_TAG_BASE_IDEO HB_TAG('i','d','e','o')
#define HB_OT_TAG_BASE_IDTB HB_TAG('i','d','t','b')
#define HB_OT_TAG_BASE_MATH HB_TAG('m','a','t','h')
#define HB_OT_TAG_BASE_ROMN HB_TAG('r','o','m','n')
namespace OT {
2017-02-25 20:41:05 +01:00
#define NO_COORD -32767
2017-02-18 19:54:33 +01:00
/*
* BASE -- The BASE Table
*/
struct BaseCoordFormat1 {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline SHORT get_coord () const
{ return coordinate; }
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this));
}
2017-02-18 19:54:33 +01:00
protected:
USHORT baseCoordFormat;
2017-02-25 17:08:01 +01:00
SHORT coordinate;
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_STATIC (4);
};
struct BaseCoordFormat2 {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline SHORT get_coord () const
{ return coordinate; }
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this));
}
2017-02-18 19:54:33 +01:00
protected:
USHORT baseCoordFormat;
2017-02-25 17:08:01 +01:00
SHORT coordinate;
2017-02-18 19:54:33 +01:00
USHORT referenceGlyph;
USHORT baseCoordPoint;
public:
DEFINE_SIZE_STATIC (8);
};
struct BaseCoordFormat3 {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline SHORT get_coord (void ) const
{ return coordinate; }
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) && deviceTable.sanitize (c, this));
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
USHORT baseCoordFormat;
SHORT coordinate;
OffsetTo<Device> deviceTable;
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_STATIC (6);
};
struct BaseCoord {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline hb_position_t get_value (hb_font_t *font, hb_direction_t dir) const
{
SHORT coord;
switch (u.baseCoordFormat) {
case 1: coord = u.format1.get_coord();
case 2: coord = u.format2.get_coord();
case 3: coord = u.format3.get_coord();
default: return 0;
}
return font->em_scale (coord, dir);
}
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
if (!u.baseCoordFormat.sanitize (c)) return_trace (false);
switch (u.baseCoordFormat) {
case 1: return_trace (u.format1.sanitize (c));
case 2: return_trace (u.format2.sanitize (c));
case 3: return_trace (u.format3.sanitize (c));
default:return_trace (true);
}
}
2017-02-18 19:54:33 +01:00
protected:
union {
2017-02-25 17:08:01 +01:00
USHORT baseCoordFormat;
2017-02-18 19:54:33 +01:00
BaseCoordFormat1 format1;
BaseCoordFormat2 format2;
BaseCoordFormat3 format3;
} u;
public:
DEFINE_SIZE_MIN (4);
};
struct FeatMinMaxRecord {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir) const
{
if (unlikely(minCoord == Null(OffsetTo<BaseCoord>))) return NO_COORD;
return (this+minCoord).get_value(font, dir);
}
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir) const
{
if (unlikely(maxCoord == Null(OffsetTo<BaseCoord>))) return NO_COORD;
return (this+maxCoord).get_value(font, dir);
}
inline Tag get_tag () const
{ return featureTableTag; }
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
minCoord.sanitize (c, base) &&
maxCoord.sanitize (c, base));
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
Tag featureTableTag;
2017-02-18 19:54:33 +01:00
OffsetTo<BaseCoord> minCoord;
OffsetTo<BaseCoord> maxCoord;
public:
DEFINE_SIZE_STATIC (8);
};
struct MinMax {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir) const
{
if (unlikely(minCoord == Null(OffsetTo<BaseCoord>))) return NO_COORD;
return (this+minCoord).get_value(font, dir);
}
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir) const
{
if (unlikely(maxCoord == Null(OffsetTo<BaseCoord>))) return NO_COORD;
return (this+maxCoord).get_value(font, dir);
}
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir, Tag featureTableTag) const
{
for (unsigned int i = 0; i < featMinMaxCount; i++)
{
if (featMinMaxRecords[i].get_tag() == featureTableTag)
return featMinMaxRecords[i].get_min_value(font, dir);
// we could take advantage of alphabetical order by comparing Tags, not currently possible
//if (featMinMaxRecords[i].get_tag() > featureTableTag)
// break;
}
return get_min_value (font, dir);
}
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir, Tag featureTableTag) const
{
for (unsigned int i = 0; i < featMinMaxCount; i++)
{
if (featMinMaxRecords[i].get_tag() == featureTableTag)
return featMinMaxRecords[i].get_max_value(font, dir);
// we could use alphabetical order to break here
}
return get_min_value (font, dir);
}
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
minCoord.sanitize (c, this) &&
maxCoord.sanitize (c, this) &&
featMinMaxRecords.sanitize (c, this));
2017-02-25 20:41:05 +01:00
// TODO: test alphabetical order?
2017-02-25 16:19:35 +01:00
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
OffsetTo<BaseCoord> minCoord;
OffsetTo<BaseCoord> maxCoord;
USHORT featMinMaxCount;
2017-02-25 20:41:05 +01:00
ArrayOf<FeatMinMaxRecord> featMinMaxRecords; /* All FeatMinMaxRecords are listed alphabetically */
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_ARRAY (8, featMinMaxRecords);
2017-02-18 19:54:33 +01:00
};
struct BaseLangSysRecord {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline Tag get_tag(void) const
{ return baseLangSysTag; }
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir) const
{ return (this+minMax).get_min_value(font, dir); }
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir) const
{ return (this+minMax).get_max_value(font, dir); }
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir, Tag featureTableTag) const
{ return (this+minMax).get_min_value(font, dir, featureTableTag); }
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir, Tag featureTableTag) const
{ return (this+minMax).get_max_value(font, dir, featureTableTag); }
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
2017-02-25 20:41:05 +01:00
minMax != Null(OffsetTo<MinMax>) &&
2017-02-25 16:19:35 +01:00
minMax.sanitize (c, base));
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
Tag baseLangSysTag;
2017-02-25 20:41:05 +01:00
OffsetTo<MinMax> minMax; // not supposed to be NULL
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_STATIC (6);
};
struct BaseValues {
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
baseCoords.sanitize (c, this));
2017-02-25 16:19:35 +01:00
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
USHORT defaultIndex;
USHORT baseCoordCount;
OffsetArrayOf<BaseCoord> baseCoords;
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_ARRAY (6, baseCoords);
2017-02-18 19:54:33 +01:00
};
struct BaseScript {
2017-02-25 16:19:35 +01:00
2017-02-25 20:41:05 +01:00
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir) const
{
if (unlikely(defaultMinMax == Null(OffsetTo<MinMax>))) return NO_COORD;
return (this+defaultMinMax).get_min_value(font, dir);
}
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir) const
{
if (unlikely(defaultMinMax == Null(OffsetTo<MinMax>))) return NO_COORD;
return (this+defaultMinMax).get_max_value(font, dir);
}
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir, Tag baseLangSysTag) const
{
for (unsigned int i = 0; i < baseLangSysCount; i++)
{
if (baseLangSysRecords[i].get_tag() == baseLangSysTag)
return baseLangSysRecords[i].get_min_value(font, dir);
// we could use alphabetical order to break here
}
return get_min_value (font, dir);
}
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir, Tag baseLangSysTag) const
{
for (unsigned int i = 0; i < baseLangSysCount; i++)
{
if (baseLangSysRecords[i].get_tag() == baseLangSysTag)
return baseLangSysRecords[i].get_max_value(font, dir);
// we could use alphabetical order to break here
}
return get_max_value (font, dir);
}
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir, Tag baseLangSysTag, Tag featureTableTag) const
{
for (unsigned int i = 0; i < baseLangSysCount; i++)
{
if (baseLangSysRecords[i].get_tag() == baseLangSysTag)
return baseLangSysRecords[i].get_min_value(font, dir, featureTableTag);
// we could use alphabetical order to break here
}
return get_min_value (font, dir);
}
inline hb_position_t get_max_value (hb_font_t *font, hb_direction_t dir, Tag baseLangSysTag, Tag featureTableTag) const
{
for (unsigned int i = 0; i < baseLangSysCount; i++)
{
if (baseLangSysRecords[i].get_tag() == baseLangSysTag)
return baseLangSysRecords[i].get_max_value(font, dir);
// we could use alphabetical order to break here
}
return get_max_value (font, dir);
}
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
baseValues.sanitize (c, this) &&
defaultMinMax.sanitize (c, this) &&
baseLangSysRecords.sanitize (c, this));
2017-02-25 16:19:35 +01:00
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
OffsetTo<BaseValues> baseValues;
OffsetTo<MinMax> defaultMinMax;
USHORT baseLangSysCount;
ArrayOf<BaseLangSysRecord> baseLangSysRecords;
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_ARRAY (8, baseLangSysRecords);
2017-02-18 19:54:33 +01:00
};
struct BaseScriptRecord {
2017-02-25 20:41:05 +01:00
inline const BaseScript *get_baseScript (void) const
{
return &(this+baseScript);
}
inline bool get_tag (void) const
{
return baseScriptTag;
}
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
baseScript.sanitize (c, base));
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
Tag baseScriptTag;
OffsetTo<BaseScript> baseScript;
2017-02-18 19:54:33 +01:00
public:
2017-02-19 10:12:22 +01:00
DEFINE_SIZE_STATIC (6);
2017-02-18 19:54:33 +01:00
};
struct BaseScriptList {
2017-02-25 20:41:05 +01:00
inline const BaseScript *get_baseScript_from_tag (Tag baseScriptTag) const
{
for (unsigned int i = 0; i < baseScriptCount; i++)
if (baseScriptRecords[i].get_tag() == baseScriptTag)
return baseScriptRecords[i].get_baseScript();
// we could use alphabetical order to break here
return NULL;
}
inline hb_position_t get_min_value (hb_font_t *font, hb_direction_t dir, Tag baseScriptTag) const
{
const BaseScript *baseScript = get_baseScript_from_tag (baseScriptTag);
if (baseScript == NULL) return NO_COORD;
return baseScript->get_min_value(font, dir);
}
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
baseScriptRecords.sanitize (c, this));
2017-02-25 16:19:35 +01:00
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
USHORT baseScriptCount;
ArrayOf<BaseScriptRecord> baseScriptRecords;
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_ARRAY (4, baseScriptRecords);
2017-02-18 19:54:33 +01:00
};
2017-02-25 20:41:05 +01:00
struct BaseTagList
{
2017-02-18 19:54:33 +01:00
2017-02-25 20:41:05 +01:00
inline bool hasTag(Tag tag) const
2017-02-25 16:19:35 +01:00
{
2017-02-25 20:41:05 +01:00
for (unsigned int i = 0; i < baseTagCount; i++)
if (baselineTags[i] == tag)
return true;
return false;
2017-02-25 16:19:35 +01:00
}
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
2017-02-25 20:41:05 +01:00
return_trace (c->check_struct (this));
2017-02-25 16:19:35 +01:00
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 20:41:05 +01:00
USHORT baseTagCount;
ArrayOf<Tag> baselineTags; // must be in alphabetical order
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_ARRAY (4, baselineTags);
2017-02-18 19:54:33 +01:00
};
2017-02-25 16:34:58 +01:00
struct Axis
2017-02-18 19:54:33 +01:00
{
2017-02-25 20:41:05 +01:00
inline bool hasTag(Tag tag) const
{
if (unlikely(baseTagList == Null(OffsetTo<BaseTagList>))) return false;
return (this+baseTagList).hasTag(tag);
}
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
baseTagList.sanitize (c, this) &&
baseScriptList.sanitize (c, this));
}
2017-02-18 19:54:33 +01:00
protected:
2017-02-25 17:08:01 +01:00
OffsetTo<BaseTagList> baseTagList;
OffsetTo<BaseScriptList> baseScriptList;
2017-02-18 19:54:33 +01:00
public:
DEFINE_SIZE_STATIC (4);
};
2017-02-19 10:12:22 +01:00
struct BASEFormat1_1
{
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
horizAxis.sanitize (c, this) &&
vertAxis.sanitize (c, this) &&
itemVarStore.sanitize (c, this));
}
2017-02-19 10:12:22 +01:00
protected:
2017-02-25 17:08:01 +01:00
FixedVersion<> version;
OffsetTo<Axis> horizAxis;
OffsetTo<Axis> vertAxis;
2017-02-19 10:12:22 +01:00
LOffsetTo<VariationStore> itemVarStore;
public:
DEFINE_SIZE_STATIC (12);
};
struct BASEFormat1_0
{
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c) const
{
TRACE_SANITIZE (this);
return_trace (c->check_struct (this) &&
horizAxis.sanitize (c, this) &&
vertAxis.sanitize (c, this));
}
2017-02-19 10:12:22 +01:00
protected:
2017-02-25 17:08:01 +01:00
FixedVersion<> version;
OffsetTo<Axis> horizAxis;
OffsetTo<Axis> vertAxis;
2017-02-19 10:12:22 +01:00
public:
DEFINE_SIZE_STATIC (8);
};
2017-02-18 19:54:33 +01:00
struct BASE
{
static const hb_tag_t tableTag = HB_OT_TAG_BASE;
2017-02-25 16:19:35 +01:00
inline bool sanitize (hb_sanitize_context_t *c, const void *base) const
2017-02-18 19:54:33 +01:00
{
TRACE_SANITIZE (this);
2017-02-25 16:19:35 +01:00
if (!u.version.sanitize (c)) return_trace (false);
if (!likely(u.version.major == 1)) return_trace (false);
switch (u.version.minor) {
case 0: return_trace (u.format1_0.sanitize (c));
case 1: return_trace (u.format1_1.sanitize (c));
default:return_trace (true);
}
2017-02-18 19:54:33 +01:00
}
protected:
2017-02-19 10:12:22 +01:00
union {
2017-02-25 17:08:01 +01:00
FixedVersion<> version; /* Version of the BASE table: 1.0 or 1.1 */
BASEFormat1_0 format1_0;
BASEFormat1_1 format1_1;
2017-02-19 10:12:22 +01:00
} u;
2017-02-18 19:54:33 +01:00
public:
2017-02-19 10:12:22 +01:00
DEFINE_SIZE_UNION (4, version);
2017-02-18 19:54:33 +01:00
};
} /* namespace OT */
#endif /* HB_OT_BASE_TABLE_HH */