2014-05-09 21:35:56 +02:00
|
|
|
/*
|
|
|
|
* Copyright © 2014 Google, Inc.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* Google Author(s): Behdad Esfahbod
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef HB_OT_CMAP_TABLE_HH
|
|
|
|
#define HB_OT_CMAP_TABLE_HH
|
|
|
|
|
2018-08-26 07:36:36 +02:00
|
|
|
#include "hb-open-type.hh"
|
|
|
|
#include "hb-set.hh"
|
2014-05-09 21:35:56 +02:00
|
|
|
|
|
|
|
/*
|
2018-04-12 11:10:45 +02:00
|
|
|
* cmap -- Character to Glyph Index Mapping
|
|
|
|
* https://docs.microsoft.com/en-us/typography/opentype/spec/cmap
|
2014-05-09 21:35:56 +02:00
|
|
|
*/
|
|
|
|
#define HB_OT_TAG_cmap HB_TAG('c','m','a','p')
|
|
|
|
|
2018-04-12 11:10:45 +02:00
|
|
|
namespace OT {
|
|
|
|
|
|
|
|
|
2014-05-14 03:47:51 +02:00
|
|
|
struct CmapSubtableFormat0
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_glyph (hb_codepoint_t codepoint, hb_codepoint_t *glyph) const
|
2014-05-14 03:47:51 +02:00
|
|
|
{
|
|
|
|
hb_codepoint_t gid = codepoint < 256 ? glyphIdArray[codepoint] : 0;
|
|
|
|
if (!gid)
|
|
|
|
return false;
|
|
|
|
*glyph = gid;
|
2018-08-30 01:38:04 +02:00
|
|
|
return true;
|
2014-05-14 03:47:51 +02:00
|
|
|
}
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-08-25 18:35:45 +02:00
|
|
|
{
|
|
|
|
for (unsigned int i = 0; i < 256; i++)
|
|
|
|
if (glyphIdArray[i])
|
2018-11-15 20:40:56 +01:00
|
|
|
out->add (i);
|
2018-08-25 18:35:45 +02:00
|
|
|
}
|
2014-05-14 03:47:51 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-05-14 03:47:51 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this));
|
2014-05-14 03:47:51 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 format; /* Format number is set to 0. */
|
2018-05-02 20:59:14 +02:00
|
|
|
HBUINT16 length; /* Byte length of this subtable. */
|
|
|
|
HBUINT16 language; /* Ignore. */
|
2018-02-12 02:00:42 +01:00
|
|
|
HBUINT8 glyphIdArray[256];/* An array that maps character
|
2014-05-14 03:47:51 +02:00
|
|
|
* code to glyph index values. */
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (6 + 256);
|
|
|
|
};
|
|
|
|
|
2014-05-09 21:35:56 +02:00
|
|
|
struct CmapSubtableFormat4
|
|
|
|
{
|
2018-05-03 01:12:04 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
HBUINT16* serialize_endcode_array (hb_serialize_context_t *c,
|
2019-08-24 15:27:14 +02:00
|
|
|
Iterator it)
|
2018-05-03 01:12:04 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
HBUINT16 *endCode = c->start_embed<HBUINT16> ();
|
|
|
|
hb_codepoint_t prev_endcp = 0xFFFF;
|
|
|
|
|
|
|
|
+ it
|
|
|
|
| hb_apply ([&] (const hb_item_type<Iterator> _)
|
2019-08-24 15:27:14 +02:00
|
|
|
{
|
|
|
|
if (prev_endcp != 0xFFFF && prev_endcp + 1u != _.first)
|
|
|
|
{
|
|
|
|
HBUINT16 end_code;
|
|
|
|
end_code = prev_endcp;
|
|
|
|
c->copy<HBUINT16> (end_code);
|
|
|
|
}
|
|
|
|
prev_endcp = _.first;
|
|
|
|
})
|
2019-06-25 22:17:30 +02:00
|
|
|
;
|
2018-05-03 03:50:56 +02:00
|
|
|
|
2018-05-03 02:11:18 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
// last endCode
|
|
|
|
HBUINT16 endcode;
|
|
|
|
endcode = prev_endcp;
|
|
|
|
if (unlikely (!c->copy<HBUINT16> (endcode))) return nullptr;
|
|
|
|
// There must be a final entry with end_code == 0xFFFF.
|
|
|
|
if (prev_endcp != 0xFFFF)
|
2018-05-03 02:11:18 +02:00
|
|
|
{
|
2019-08-24 15:27:14 +02:00
|
|
|
HBUINT16 finalcode;
|
|
|
|
finalcode = 0xFFFF;
|
|
|
|
if (unlikely (!c->copy<HBUINT16> (finalcode))) return nullptr;
|
2018-05-03 02:11:18 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
return endCode;
|
2018-05-03 01:12:04 +02:00
|
|
|
}
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
HBUINT16* serialize_startcode_array (hb_serialize_context_t *c,
|
2019-08-24 15:27:14 +02:00
|
|
|
Iterator it)
|
2018-05-03 01:12:04 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
HBUINT16 *startCode = c->start_embed<HBUINT16> ();
|
|
|
|
hb_codepoint_t prev_cp = 0xFFFF;
|
2019-08-24 15:27:14 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
+ it
|
|
|
|
| hb_apply ([&] (const hb_item_type<Iterator> _)
|
2019-08-24 15:27:14 +02:00
|
|
|
{
|
|
|
|
if (prev_cp == 0xFFFF || prev_cp + 1u != _.first)
|
|
|
|
{
|
|
|
|
HBUINT16 start_code;
|
|
|
|
start_code = _.first;
|
|
|
|
c->copy<HBUINT16> (start_code);
|
|
|
|
}
|
|
|
|
|
|
|
|
prev_cp = _.first;
|
|
|
|
})
|
2019-06-25 22:17:30 +02:00
|
|
|
;
|
|
|
|
|
|
|
|
// There must be a final entry with end_code == 0xFFFF.
|
|
|
|
if (it.len () == 0 || prev_cp != 0xFFFF)
|
2018-05-03 01:12:04 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
HBUINT16 finalcode;
|
|
|
|
finalcode = 0xFFFF;
|
|
|
|
if (unlikely (!c->copy<HBUINT16> (finalcode))) return nullptr;
|
2018-05-03 01:12:04 +02:00
|
|
|
}
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
return startCode;
|
2018-05-03 01:12:04 +02:00
|
|
|
}
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
HBINT16* serialize_idDelta_array (hb_serialize_context_t *c,
|
2019-08-24 15:27:14 +02:00
|
|
|
Iterator it,
|
|
|
|
HBUINT16 *endCode,
|
|
|
|
HBUINT16 *startCode,
|
|
|
|
unsigned segcount)
|
2018-05-03 01:12:04 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
unsigned i = 0;
|
|
|
|
hb_codepoint_t last_gid = 0, start_gid = 0, last_cp = 0xFFFF;
|
|
|
|
bool use_delta = true;
|
2019-08-24 15:27:14 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
HBINT16 *idDelta = c->start_embed<HBINT16> ();
|
|
|
|
if ((char *)idDelta - (char *)startCode != (int) segcount * (int) HBINT16::static_size)
|
|
|
|
return nullptr;
|
2018-05-30 21:23:51 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
+ it
|
|
|
|
| hb_apply ([&] (const hb_item_type<Iterator> _)
|
2019-08-24 15:27:14 +02:00
|
|
|
{
|
|
|
|
if (_.first == startCode[i])
|
|
|
|
{
|
|
|
|
use_delta = true;
|
|
|
|
start_gid = _.second;
|
|
|
|
}
|
|
|
|
else if (_.second != last_gid + 1) use_delta = false;
|
|
|
|
|
|
|
|
if (_.first == endCode[i])
|
|
|
|
{
|
|
|
|
HBINT16 delta;
|
|
|
|
if (use_delta) delta = (int)start_gid - (int)startCode[i];
|
|
|
|
else delta = 0;
|
|
|
|
c->copy<HBINT16> (delta);
|
|
|
|
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
|
|
|
|
last_gid = _.second;
|
|
|
|
last_cp = _.first;
|
|
|
|
})
|
2019-06-25 22:17:30 +02:00
|
|
|
;
|
2018-05-03 01:37:38 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
if (it.len () == 0 || last_cp != 0xFFFF)
|
|
|
|
{
|
|
|
|
HBINT16 delta;
|
|
|
|
delta = 1;
|
|
|
|
if (unlikely (!c->copy<HBINT16> (delta))) return nullptr;
|
|
|
|
}
|
2018-05-03 01:37:38 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
return idDelta;
|
|
|
|
}
|
2018-05-03 01:37:38 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
HBUINT16* serialize_rangeoffset_glyid (hb_serialize_context_t *c,
|
2019-08-24 15:27:14 +02:00
|
|
|
Iterator it,
|
|
|
|
HBUINT16 *endCode,
|
|
|
|
HBUINT16 *startCode,
|
|
|
|
HBINT16 *idDelta,
|
|
|
|
unsigned segcount)
|
2019-06-25 22:17:30 +02:00
|
|
|
{
|
|
|
|
HBUINT16 *idRangeOffset = c->allocate_size<HBUINT16> (HBUINT16::static_size * segcount);
|
|
|
|
if (unlikely (!c->check_success (idRangeOffset))) return nullptr;
|
|
|
|
if (unlikely ((char *)idRangeOffset - (char *)idDelta != (int) segcount * (int) HBINT16::static_size)) return nullptr;
|
2019-08-24 15:27:14 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
+ hb_range (segcount)
|
|
|
|
| hb_filter ([&] (const unsigned _) { return idDelta[_] == 0; })
|
|
|
|
| hb_apply ([&] (const unsigned i)
|
2019-08-24 15:27:14 +02:00
|
|
|
{
|
|
|
|
idRangeOffset[i] = 2 * (c->start_embed<HBUINT16> () - idRangeOffset - i);
|
2019-06-25 22:17:30 +02:00
|
|
|
|
2019-08-24 15:27:14 +02:00
|
|
|
+ it
|
|
|
|
| hb_filter ([&] (const hb_item_type<Iterator> _) { return _.first >= startCode[i] && _.first <= endCode[i]; })
|
|
|
|
| hb_apply ([&] (const hb_item_type<Iterator> _)
|
|
|
|
{
|
|
|
|
HBUINT16 glyID;
|
|
|
|
glyID = _.second;
|
|
|
|
c->copy<HBUINT16> (glyID);
|
|
|
|
})
|
|
|
|
;
|
2019-06-25 22:17:30 +02:00
|
|
|
|
|
|
|
|
2019-08-24 15:27:14 +02:00
|
|
|
})
|
2019-06-25 22:17:30 +02:00
|
|
|
;
|
2018-05-03 03:50:56 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
return idRangeOffset;
|
|
|
|
}
|
2018-05-03 03:50:56 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
void serialize (hb_serialize_context_t *c,
|
|
|
|
Iterator it)
|
|
|
|
{
|
|
|
|
unsigned table_initpos = c->length ();
|
|
|
|
if (unlikely (!c->extend_min (*this))) return;
|
|
|
|
this->format = 4;
|
|
|
|
|
|
|
|
//serialize endCode[]
|
|
|
|
HBUINT16 *endCode = serialize_endcode_array (c, it);
|
|
|
|
if (unlikely (!endCode)) return;
|
|
|
|
|
|
|
|
unsigned segcount = (c->length () - min_size) / HBUINT16::static_size;
|
2019-08-24 15:27:14 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
// 2 bytes of padding.
|
|
|
|
if (unlikely (!c->allocate_size<HBUINT16> (HBUINT16::static_size))) return; // 2 bytes of padding.
|
|
|
|
|
|
|
|
// serialize startCode[]
|
|
|
|
HBUINT16 *startCode = serialize_startcode_array (c, it);
|
|
|
|
if (unlikely (!startCode)) return;
|
2019-08-24 15:27:14 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
//serialize idDelta[]
|
|
|
|
HBINT16 *idDelta = serialize_idDelta_array (c, it, endCode, startCode, segcount);
|
|
|
|
if (unlikely (!idDelta)) return;
|
|
|
|
|
|
|
|
HBUINT16 *idRangeOffset = serialize_rangeoffset_glyid (c, it, endCode, startCode, idDelta, segcount);
|
|
|
|
if (unlikely (!c->check_success (idRangeOffset))) return;
|
2019-08-24 15:27:14 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
if (unlikely (!c->check_assign(this->length, c->length () - table_initpos))) return;
|
|
|
|
this->segCountX2 = segcount * 2;
|
|
|
|
this->entrySelector = hb_max (1u, hb_bit_storage (segcount)) - 1;
|
|
|
|
this->searchRange = 2 * (1u << this->entrySelector);
|
|
|
|
this->rangeShift = segcount * 2 > this->searchRange
|
|
|
|
? 2 * segcount - this->searchRange
|
|
|
|
: 0;
|
2018-05-03 01:12:04 +02:00
|
|
|
}
|
|
|
|
|
2016-02-24 12:27:13 +01:00
|
|
|
struct accelerator_t
|
2014-05-09 21:35:56 +02:00
|
|
|
{
|
2018-12-17 19:01:01 +01:00
|
|
|
accelerator_t () {}
|
2018-12-16 20:08:10 +01:00
|
|
|
accelerator_t (const CmapSubtableFormat4 *subtable) { init (subtable); }
|
2018-12-17 19:01:01 +01:00
|
|
|
~accelerator_t () { fini (); }
|
2018-10-30 06:35:44 +01:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void init (const CmapSubtableFormat4 *subtable)
|
2016-02-24 12:27:13 +01:00
|
|
|
{
|
|
|
|
segCount = subtable->segCountX2 / 2;
|
2018-09-10 23:29:26 +02:00
|
|
|
endCount = subtable->values.arrayZ;
|
2016-02-24 12:27:13 +01:00
|
|
|
startCount = endCount + segCount + 1;
|
|
|
|
idDelta = startCount + segCount;
|
|
|
|
idRangeOffset = idDelta + segCount;
|
|
|
|
glyphIdArray = idRangeOffset + segCount;
|
|
|
|
glyphIdArrayLength = (subtable->length - 16 - 8 * segCount) / 2;
|
|
|
|
}
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini () {}
|
2014-05-10 01:55:51 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_glyph (hb_codepoint_t codepoint, hb_codepoint_t *glyph) const
|
2014-05-10 01:55:51 +02:00
|
|
|
{
|
2016-02-24 12:27:13 +01:00
|
|
|
/* Custom two-array bsearch. */
|
2018-08-26 00:25:03 +02:00
|
|
|
int min = 0, max = (int) this->segCount - 1;
|
|
|
|
const HBUINT16 *startCount = this->startCount;
|
|
|
|
const HBUINT16 *endCount = this->endCount;
|
2016-02-24 12:27:13 +01:00
|
|
|
unsigned int i;
|
|
|
|
while (min <= max)
|
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
int mid = ((unsigned int) min + (unsigned int) max) / 2;
|
2016-02-24 12:27:13 +01:00
|
|
|
if (codepoint < startCount[mid])
|
|
|
|
max = mid - 1;
|
|
|
|
else if (codepoint > endCount[mid])
|
|
|
|
min = mid + 1;
|
|
|
|
else
|
|
|
|
{
|
|
|
|
i = mid;
|
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
|
|
|
|
found:
|
|
|
|
hb_codepoint_t gid;
|
2018-08-26 00:25:03 +02:00
|
|
|
unsigned int rangeOffset = this->idRangeOffset[i];
|
2016-02-24 12:27:13 +01:00
|
|
|
if (rangeOffset == 0)
|
2018-08-26 00:25:03 +02:00
|
|
|
gid = codepoint + this->idDelta[i];
|
2014-05-10 01:55:51 +02:00
|
|
|
else
|
|
|
|
{
|
2016-02-24 12:27:13 +01:00
|
|
|
/* Somebody has been smoking... */
|
2018-08-26 00:25:03 +02:00
|
|
|
unsigned int index = rangeOffset / 2 + (codepoint - this->startCount[i]) + i - this->segCount;
|
|
|
|
if (unlikely (index >= this->glyphIdArrayLength))
|
2016-02-24 12:27:13 +01:00
|
|
|
return false;
|
2018-08-26 00:25:03 +02:00
|
|
|
gid = this->glyphIdArray[index];
|
2016-02-24 12:27:13 +01:00
|
|
|
if (unlikely (!gid))
|
|
|
|
return false;
|
2018-08-26 00:25:03 +02:00
|
|
|
gid += this->idDelta[i];
|
2014-05-10 01:55:51 +02:00
|
|
|
}
|
2018-08-30 01:38:04 +02:00
|
|
|
gid &= 0xFFFFu;
|
|
|
|
if (!gid)
|
|
|
|
return false;
|
|
|
|
*glyph = gid;
|
|
|
|
return true;
|
2014-05-10 01:55:51 +02:00
|
|
|
}
|
2019-04-12 23:50:03 +02:00
|
|
|
HB_INTERNAL static bool get_glyph_func (const void *obj, hb_codepoint_t codepoint, hb_codepoint_t *glyph)
|
2019-09-21 12:03:43 +02:00
|
|
|
{ return ((const accelerator_t *) obj)->get_glyph (codepoint, glyph); }
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-08-26 00:25:03 +02:00
|
|
|
{
|
2018-08-26 01:14:32 +02:00
|
|
|
unsigned int count = this->segCount;
|
|
|
|
if (count && this->startCount[count - 1] == 0xFFFFu)
|
2018-11-15 20:40:56 +01:00
|
|
|
count--; /* Skip sentinel segment. */
|
2018-08-26 01:14:32 +02:00
|
|
|
for (unsigned int i = 0; i < count; i++)
|
2018-08-26 00:25:03 +02:00
|
|
|
{
|
2018-08-26 06:23:43 +02:00
|
|
|
unsigned int rangeOffset = this->idRangeOffset[i];
|
|
|
|
if (rangeOffset == 0)
|
|
|
|
out->add_range (this->startCount[i], this->endCount[i]);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
for (hb_codepoint_t codepoint = this->startCount[i];
|
|
|
|
codepoint <= this->endCount[i];
|
|
|
|
codepoint++)
|
|
|
|
{
|
|
|
|
unsigned int index = rangeOffset / 2 + (codepoint - this->startCount[i]) + i - this->segCount;
|
|
|
|
if (unlikely (index >= this->glyphIdArrayLength))
|
|
|
|
break;
|
|
|
|
hb_codepoint_t gid = this->glyphIdArray[index];
|
|
|
|
if (unlikely (!gid))
|
|
|
|
continue;
|
|
|
|
out->add (codepoint);
|
|
|
|
}
|
|
|
|
}
|
2018-08-26 00:25:03 +02:00
|
|
|
}
|
|
|
|
}
|
2014-05-10 01:55:51 +02:00
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
const HBUINT16 *endCount;
|
|
|
|
const HBUINT16 *startCount;
|
|
|
|
const HBUINT16 *idDelta;
|
|
|
|
const HBUINT16 *idRangeOffset;
|
|
|
|
const HBUINT16 *glyphIdArray;
|
2016-02-24 12:27:13 +01:00
|
|
|
unsigned int segCount;
|
|
|
|
unsigned int glyphIdArrayLength;
|
|
|
|
};
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_glyph (hb_codepoint_t codepoint, hb_codepoint_t *glyph) const
|
2016-02-24 12:27:13 +01:00
|
|
|
{
|
2018-10-30 06:35:44 +01:00
|
|
|
accelerator_t accel (this);
|
2016-02-24 12:27:13 +01:00
|
|
|
return accel.get_glyph_func (&accel, codepoint, glyph);
|
2014-05-09 21:35:56 +02:00
|
|
|
}
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-08-25 18:33:30 +02:00
|
|
|
{
|
2018-10-30 06:35:44 +01:00
|
|
|
accelerator_t accel (this);
|
2018-08-26 00:25:03 +02:00
|
|
|
accel.collect_unicodes (out);
|
2018-08-25 18:33:30 +02:00
|
|
|
}
|
2014-05-09 21:35:56 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2014-06-05 00:47:55 +02:00
|
|
|
{
|
2014-05-09 21:35:56 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2014-06-05 00:47:55 +02:00
|
|
|
if (unlikely (!c->check_struct (this)))
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (false);
|
2014-06-05 00:47:55 +02:00
|
|
|
|
|
|
|
if (unlikely (!c->check_range (this, length)))
|
|
|
|
{
|
|
|
|
/* Some broken fonts have too long of a "length" value.
|
|
|
|
* If that is the case, just change the value to truncate
|
|
|
|
* the subtable at the end of the blob. */
|
2019-05-08 05:54:31 +02:00
|
|
|
uint16_t new_length = (uint16_t) hb_min ((uintptr_t) 65535,
|
2014-06-05 00:47:55 +02:00
|
|
|
(uintptr_t) (c->end -
|
|
|
|
(char *) this));
|
|
|
|
if (!c->try_set (&length, new_length))
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (false);
|
2014-06-05 00:47:55 +02:00
|
|
|
}
|
|
|
|
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (16 + 4 * (unsigned int) segCountX2 <= length);
|
2014-05-09 21:35:56 +02:00
|
|
|
}
|
|
|
|
|
2018-05-03 01:12:04 +02:00
|
|
|
|
|
|
|
|
2014-05-09 21:35:56 +02:00
|
|
|
protected:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 format; /* Format number is set to 4. */
|
|
|
|
HBUINT16 length; /* This is the length in bytes of the
|
2014-05-09 21:35:56 +02:00
|
|
|
* subtable. */
|
2018-05-02 20:59:14 +02:00
|
|
|
HBUINT16 language; /* Ignore. */
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 segCountX2; /* 2 x segCount. */
|
2018-05-02 20:59:14 +02:00
|
|
|
HBUINT16 searchRange; /* 2 * (2**floor(log2(segCount))) */
|
|
|
|
HBUINT16 entrySelector; /* log2(searchRange/2) */
|
|
|
|
HBUINT16 rangeShift; /* 2 x segCount - searchRange */
|
2014-05-09 21:35:56 +02:00
|
|
|
|
2018-09-10 23:29:26 +02:00
|
|
|
UnsizedArrayOf<HBUINT16>
|
|
|
|
values;
|
2014-05-09 21:35:56 +02:00
|
|
|
#if 0
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 endCount[segCount]; /* End characterCode for each segment,
|
2014-07-11 20:54:42 +02:00
|
|
|
* last=0xFFFFu. */
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 reservedPad; /* Set to 0. */
|
|
|
|
HBUINT16 startCount[segCount]; /* Start character code for each segment. */
|
|
|
|
HBINT16 idDelta[segCount]; /* Delta for all character codes in segment. */
|
|
|
|
HBUINT16 idRangeOffset[segCount];/* Offsets into glyphIdArray or 0 */
|
2018-09-10 23:29:26 +02:00
|
|
|
UnsizedArrayOf<HBUINT16>
|
|
|
|
glyphIdArray; /* Glyph index array (arbitrary length) */
|
2014-05-09 21:35:56 +02:00
|
|
|
#endif
|
|
|
|
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_ARRAY (14, values);
|
|
|
|
};
|
|
|
|
|
2014-05-12 23:58:31 +02:00
|
|
|
struct CmapSubtableLongGroup
|
2014-05-12 23:51:15 +02:00
|
|
|
{
|
|
|
|
friend struct CmapSubtableFormat12;
|
2014-05-12 23:58:31 +02:00
|
|
|
friend struct CmapSubtableFormat13;
|
2018-04-17 15:00:23 +02:00
|
|
|
template<typename U>
|
|
|
|
friend struct CmapSubtableLongSegmented;
|
2018-02-09 04:39:57 +01:00
|
|
|
friend struct cmap;
|
2014-05-12 23:51:15 +02:00
|
|
|
|
|
|
|
int cmp (hb_codepoint_t codepoint) const
|
|
|
|
{
|
|
|
|
if (codepoint < startCharCode) return -1;
|
|
|
|
if (codepoint > endCharCode) return +1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-05-12 23:51:15 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this));
|
2014-05-12 23:51:15 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT32 startCharCode; /* First character code in this group. */
|
|
|
|
HBUINT32 endCharCode; /* Last character code in this group. */
|
|
|
|
HBUINT32 glyphID; /* Glyph index; interpretation depends on
|
2018-08-25 18:35:45 +02:00
|
|
|
* subtable format. */
|
2014-05-12 23:51:15 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (12);
|
|
|
|
};
|
2018-11-24 01:58:49 +01:00
|
|
|
DECLARE_NULL_NAMESPACE_BYTES (OT, CmapSubtableLongGroup);
|
2014-05-12 23:51:15 +02:00
|
|
|
|
2014-05-14 03:17:28 +02:00
|
|
|
template <typename UINT>
|
|
|
|
struct CmapSubtableTrimmed
|
2014-05-13 00:19:29 +02:00
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_glyph (hb_codepoint_t codepoint, hb_codepoint_t *glyph) const
|
2014-05-13 00:19:29 +02:00
|
|
|
{
|
|
|
|
/* Rely on our implicit array bound-checking. */
|
|
|
|
hb_codepoint_t gid = glyphIdArray[codepoint - startCharCode];
|
|
|
|
if (!gid)
|
|
|
|
return false;
|
|
|
|
*glyph = gid;
|
2018-08-30 01:38:04 +02:00
|
|
|
return true;
|
2014-05-13 00:19:29 +02:00
|
|
|
}
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-08-25 18:35:45 +02:00
|
|
|
{
|
|
|
|
hb_codepoint_t start = startCharCode;
|
|
|
|
unsigned int count = glyphIdArray.len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
if (glyphIdArray[i])
|
2018-11-15 20:40:56 +01:00
|
|
|
out->add (start + i);
|
2018-08-25 18:35:45 +02:00
|
|
|
}
|
2014-05-13 00:19:29 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-05-13 00:19:29 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this) && glyphIdArray.sanitize (c));
|
2014-05-13 00:19:29 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2014-05-14 03:17:28 +02:00
|
|
|
UINT formatReserved; /* Subtable format and (maybe) padding. */
|
2018-05-02 20:59:14 +02:00
|
|
|
UINT length; /* Byte length of this subtable. */
|
|
|
|
UINT language; /* Ignore. */
|
2014-05-14 03:17:28 +02:00
|
|
|
UINT startCharCode; /* First character code covered. */
|
2019-09-14 08:06:29 +02:00
|
|
|
ArrayOf<HBGlyphID, UINT>
|
2014-05-13 00:19:29 +02:00
|
|
|
glyphIdArray; /* Array of glyph index values for character
|
|
|
|
* codes in the range. */
|
|
|
|
public:
|
2014-05-14 03:17:28 +02:00
|
|
|
DEFINE_SIZE_ARRAY (5 * sizeof (UINT), glyphIdArray);
|
2014-05-13 00:19:29 +02:00
|
|
|
};
|
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
struct CmapSubtableFormat6 : CmapSubtableTrimmed<HBUINT16> {};
|
|
|
|
struct CmapSubtableFormat10 : CmapSubtableTrimmed<HBUINT32 > {};
|
2014-05-13 00:19:29 +02:00
|
|
|
|
2014-05-14 03:26:34 +02:00
|
|
|
template <typename T>
|
|
|
|
struct CmapSubtableLongSegmented
|
2014-05-12 23:51:15 +02:00
|
|
|
{
|
2018-02-10 02:33:34 +01:00
|
|
|
friend struct cmap;
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_glyph (hb_codepoint_t codepoint, hb_codepoint_t *glyph) const
|
2014-05-12 23:51:15 +02:00
|
|
|
{
|
2018-11-24 06:35:31 +01:00
|
|
|
hb_codepoint_t gid = T::group_get_glyph (groups.bsearch (codepoint), codepoint);
|
2018-08-30 01:38:04 +02:00
|
|
|
if (!gid)
|
|
|
|
return false;
|
|
|
|
*glyph = gid;
|
|
|
|
return true;
|
2014-05-12 23:51:15 +02:00
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-04-17 15:00:23 +02:00
|
|
|
{
|
|
|
|
for (unsigned int i = 0; i < this->groups.len; i++) {
|
2018-08-26 01:11:26 +02:00
|
|
|
out->add_range (this->groups[i].startCharCode,
|
2019-05-08 05:54:31 +02:00
|
|
|
hb_min ((hb_codepoint_t) this->groups[i].endCharCode,
|
2018-08-26 07:07:17 +02:00
|
|
|
(hb_codepoint_t) HB_UNICODE_MAX));
|
2018-04-17 15:00:23 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-05-12 23:51:15 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this) && groups.sanitize (c));
|
2014-05-12 23:51:15 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 format; /* Subtable format; set to 12. */
|
2018-05-02 20:59:14 +02:00
|
|
|
HBUINT16 reserved; /* Reserved; set to 0. */
|
|
|
|
HBUINT32 length; /* Byte length of this subtable. */
|
|
|
|
HBUINT32 language; /* Ignore. */
|
2018-01-10 03:07:30 +01:00
|
|
|
SortedArrayOf<CmapSubtableLongGroup, HBUINT32>
|
2014-05-12 23:58:31 +02:00
|
|
|
groups; /* Groupings. */
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_ARRAY (16, groups);
|
|
|
|
};
|
|
|
|
|
2014-05-14 03:26:34 +02:00
|
|
|
struct CmapSubtableFormat12 : CmapSubtableLongSegmented<CmapSubtableFormat12>
|
2014-05-12 23:58:31 +02:00
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
static hb_codepoint_t group_get_glyph (const CmapSubtableLongGroup &group,
|
|
|
|
hb_codepoint_t u)
|
2018-11-24 06:35:31 +01:00
|
|
|
{ return likely (group.startCharCode <= group.endCharCode) ?
|
|
|
|
group.glyphID + (u - group.startCharCode) : 0; }
|
2018-05-03 00:42:43 +02:00
|
|
|
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
void serialize (hb_serialize_context_t *c,
|
|
|
|
Iterator it)
|
2018-05-03 00:42:43 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
if (it.len () == 0) return;
|
|
|
|
unsigned table_initpos = c->length ();
|
|
|
|
if (unlikely (!c->extend_min (*this))) return;
|
|
|
|
|
|
|
|
hb_codepoint_t startCharCode = 0xFFFF, endCharCode = 0xFFFF;
|
|
|
|
hb_codepoint_t glyphID = 0;
|
|
|
|
|
|
|
|
+ it
|
|
|
|
| hb_apply ([&] (const hb_item_type<Iterator> _)
|
2019-08-24 15:27:14 +02:00
|
|
|
{
|
|
|
|
if (startCharCode == 0xFFFF)
|
|
|
|
{
|
|
|
|
startCharCode = _.first;
|
|
|
|
endCharCode = _.first;
|
|
|
|
glyphID = _.second;
|
|
|
|
}
|
|
|
|
else if (!_is_gid_consecutive (endCharCode, startCharCode, glyphID, _.first, _.second))
|
|
|
|
{
|
|
|
|
CmapSubtableLongGroup grouprecord;
|
|
|
|
grouprecord.startCharCode = startCharCode;
|
|
|
|
grouprecord.endCharCode = endCharCode;
|
|
|
|
grouprecord.glyphID = glyphID;
|
|
|
|
c->copy<CmapSubtableLongGroup> (grouprecord);
|
|
|
|
|
|
|
|
startCharCode = _.first;
|
|
|
|
endCharCode = _.first;
|
|
|
|
glyphID = _.second;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
endCharCode = _.first;
|
|
|
|
}
|
|
|
|
})
|
2019-06-25 22:17:30 +02:00
|
|
|
;
|
|
|
|
|
|
|
|
CmapSubtableLongGroup record;
|
|
|
|
record.startCharCode = startCharCode;
|
|
|
|
record.endCharCode = endCharCode;
|
|
|
|
record.glyphID = glyphID;
|
|
|
|
c->copy<CmapSubtableLongGroup> (record);
|
2018-05-03 00:42:43 +02:00
|
|
|
|
2019-03-30 04:17:46 +01:00
|
|
|
this->format = 12;
|
|
|
|
this->reserved = 0;
|
2019-06-25 22:17:30 +02:00
|
|
|
this->length = c->length () - table_initpos;
|
|
|
|
this->groups.len = (this->length - min_size)/CmapSubtableLongGroup::static_size;
|
2018-05-03 00:42:43 +02:00
|
|
|
}
|
|
|
|
|
2019-05-13 23:57:40 +02:00
|
|
|
static size_t get_sub_table_size (const hb_sorted_vector_t<CmapSubtableLongGroup> &groups_data)
|
2019-09-21 12:03:43 +02:00
|
|
|
{ return 16 + 12 * groups_data.length; }
|
2018-05-03 00:42:43 +02:00
|
|
|
|
2019-09-21 12:03:43 +02:00
|
|
|
private:
|
2019-06-25 22:17:30 +02:00
|
|
|
static bool _is_gid_consecutive (hb_codepoint_t endCharCode,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_codepoint_t startCharCode,
|
|
|
|
hb_codepoint_t glyphID,
|
2018-12-16 20:08:10 +01:00
|
|
|
hb_codepoint_t cp,
|
|
|
|
hb_codepoint_t new_gid)
|
2018-05-03 00:42:43 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
return (cp - 1 == endCharCode) &&
|
|
|
|
new_gid == glyphID + (cp - startCharCode);
|
2018-05-03 00:42:43 +02:00
|
|
|
}
|
|
|
|
|
2014-05-14 03:26:34 +02:00
|
|
|
};
|
2014-05-12 23:58:31 +02:00
|
|
|
|
2014-05-14 03:26:34 +02:00
|
|
|
struct CmapSubtableFormat13 : CmapSubtableLongSegmented<CmapSubtableFormat13>
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
static hb_codepoint_t group_get_glyph (const CmapSubtableLongGroup &group,
|
|
|
|
hb_codepoint_t u HB_UNUSED)
|
2014-05-14 03:26:34 +02:00
|
|
|
{ return group.glyphID; }
|
2014-05-12 23:51:15 +02:00
|
|
|
};
|
|
|
|
|
2014-06-27 23:03:22 +02:00
|
|
|
typedef enum
|
|
|
|
{
|
|
|
|
GLYPH_VARIANT_NOT_FOUND = 0,
|
|
|
|
GLYPH_VARIANT_FOUND = 1,
|
|
|
|
GLYPH_VARIANT_USE_DEFAULT = 2
|
|
|
|
} glyph_variant_t;
|
|
|
|
|
|
|
|
struct UnicodeValueRange
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
int cmp (const hb_codepoint_t &codepoint) const
|
2014-06-27 23:03:22 +02:00
|
|
|
{
|
|
|
|
if (codepoint < startUnicodeValue) return -1;
|
|
|
|
if (codepoint > startUnicodeValue + additionalCount) return +1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-06-27 23:03:22 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this));
|
2014-06-27 23:03:22 +02:00
|
|
|
}
|
|
|
|
|
2018-04-15 18:48:48 +02:00
|
|
|
HBUINT24 startUnicodeValue; /* First value in this range. */
|
2018-08-26 00:56:07 +02:00
|
|
|
HBUINT8 additionalCount; /* Number of additional values in this
|
2014-06-27 23:03:22 +02:00
|
|
|
* range. */
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (4);
|
|
|
|
};
|
|
|
|
|
2018-08-26 01:11:26 +02:00
|
|
|
struct DefaultUVS : SortedArrayOf<UnicodeValueRange, HBUINT32>
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-08-26 01:11:26 +02:00
|
|
|
{
|
|
|
|
unsigned int count = len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
{
|
|
|
|
hb_codepoint_t first = arrayZ[i].startUnicodeValue;
|
2019-05-08 05:54:31 +02:00
|
|
|
hb_codepoint_t last = hb_min ((hb_codepoint_t) (first + arrayZ[i].additionalCount),
|
2018-08-26 07:07:17 +02:00
|
|
|
(hb_codepoint_t) HB_UNICODE_MAX);
|
2018-08-26 01:11:26 +02:00
|
|
|
out->add_range (first, last);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
DefaultUVS* copy (hb_serialize_context_t *c,
|
2019-09-21 11:49:14 +02:00
|
|
|
const hb_set_t *unicodes) const
|
2019-08-16 22:54:24 +02:00
|
|
|
{
|
|
|
|
DefaultUVS *out = c->start_embed<DefaultUVS> ();
|
|
|
|
if (unlikely (!out)) return nullptr;
|
|
|
|
auto snap = c->snapshot ();
|
|
|
|
|
|
|
|
HBUINT32 len;
|
|
|
|
len = 0;
|
|
|
|
if (unlikely (!c->copy<HBUINT32> (len))) return nullptr;
|
|
|
|
unsigned init_len = c->length ();
|
|
|
|
|
|
|
|
hb_codepoint_t lastCode = HB_MAP_VALUE_INVALID;
|
|
|
|
int count = -1;
|
|
|
|
|
2019-09-21 12:56:14 +02:00
|
|
|
for (const UnicodeValueRange& _ : as_array ())
|
|
|
|
{
|
|
|
|
for (const unsigned addcnt : hb_range ((unsigned) _.additionalCount + 1))
|
|
|
|
{
|
|
|
|
unsigned curEntry = (unsigned) _.startUnicodeValue + addcnt;
|
|
|
|
if (!unicodes->has (curEntry)) continue;
|
|
|
|
count += 1;
|
|
|
|
if (lastCode == HB_MAP_VALUE_INVALID)
|
|
|
|
lastCode = curEntry;
|
|
|
|
else if (lastCode + count != curEntry)
|
|
|
|
{
|
|
|
|
UnicodeValueRange rec;
|
|
|
|
rec.startUnicodeValue = lastCode;
|
|
|
|
rec.additionalCount = count - 1;
|
|
|
|
c->copy<UnicodeValueRange> (rec);
|
|
|
|
|
|
|
|
lastCode = curEntry;
|
|
|
|
count = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2019-08-16 22:54:24 +02:00
|
|
|
|
|
|
|
if (lastCode != HB_MAP_VALUE_INVALID)
|
|
|
|
{
|
|
|
|
UnicodeValueRange rec;
|
|
|
|
rec.startUnicodeValue = lastCode;
|
|
|
|
rec.additionalCount = count;
|
|
|
|
c->copy<UnicodeValueRange> (rec);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (c->length () - init_len == 0)
|
|
|
|
{
|
|
|
|
c->revert (snap);
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (unlikely (!c->check_assign (out->len, (c->length () - init_len) / UnicodeValueRange::static_size))) return nullptr;
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-08-26 01:11:26 +02:00
|
|
|
public:
|
2018-11-11 01:54:08 +01:00
|
|
|
DEFINE_SIZE_ARRAY (4, *this);
|
2018-08-26 01:11:26 +02:00
|
|
|
};
|
2014-06-27 23:03:22 +02:00
|
|
|
|
|
|
|
struct UVSMapping
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
int cmp (const hb_codepoint_t &codepoint) const
|
2019-10-01 12:19:55 +02:00
|
|
|
{ return unicodeValue.cmp (codepoint); }
|
2014-06-27 23:03:22 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-06-27 23:03:22 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this));
|
2014-06-27 23:03:22 +02:00
|
|
|
}
|
|
|
|
|
2018-04-15 18:48:48 +02:00
|
|
|
HBUINT24 unicodeValue; /* Base Unicode value of the UVS */
|
2019-09-14 08:06:29 +02:00
|
|
|
HBGlyphID glyphID; /* Glyph ID of the UVS */
|
2014-06-27 23:03:22 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (5);
|
|
|
|
};
|
|
|
|
|
2018-08-26 01:11:26 +02:00
|
|
|
struct NonDefaultUVS : SortedArrayOf<UVSMapping, HBUINT32>
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-08-26 01:11:26 +02:00
|
|
|
{
|
|
|
|
unsigned int count = len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
out->add (arrayZ[i].glyphID);
|
|
|
|
}
|
|
|
|
|
2019-08-07 22:17:26 +02:00
|
|
|
void closure_glyphs (const hb_set_t *unicodes,
|
2019-09-21 11:49:14 +02:00
|
|
|
hb_set_t *glyphset) const
|
2019-08-07 22:17:26 +02:00
|
|
|
{
|
|
|
|
+ as_array ()
|
2019-08-29 20:17:20 +02:00
|
|
|
| hb_filter (unicodes, &UVSMapping::unicodeValue)
|
2019-08-07 22:17:26 +02:00
|
|
|
| hb_map (&UVSMapping::glyphID)
|
|
|
|
| hb_sink (glyphset)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
NonDefaultUVS* copy (hb_serialize_context_t *c,
|
2019-09-21 11:49:14 +02:00
|
|
|
const hb_set_t *unicodes,
|
|
|
|
const hb_set_t *glyphs,
|
|
|
|
const hb_map_t *glyph_map) const
|
2019-08-16 22:54:24 +02:00
|
|
|
{
|
|
|
|
NonDefaultUVS *out = c->start_embed<NonDefaultUVS> ();
|
|
|
|
if (unlikely (!out)) return nullptr;
|
|
|
|
|
|
|
|
auto it =
|
|
|
|
+ as_array ()
|
|
|
|
| hb_filter ([&] (const UVSMapping& _)
|
2019-09-21 11:49:14 +02:00
|
|
|
{
|
2019-09-21 11:55:11 +02:00
|
|
|
return unicodes->has (_.unicodeValue) || glyphs->has (_.glyphID);
|
2019-09-21 11:49:14 +02:00
|
|
|
})
|
2019-08-16 22:54:24 +02:00
|
|
|
;
|
|
|
|
|
|
|
|
if (!it) return nullptr;
|
|
|
|
|
|
|
|
HBUINT32 len;
|
|
|
|
len = it.len ();
|
|
|
|
if (unlikely (!c->copy<HBUINT32> (len))) return nullptr;
|
|
|
|
|
2019-09-21 12:56:14 +02:00
|
|
|
for (const UVSMapping& _ : it)
|
|
|
|
{
|
|
|
|
UVSMapping mapping;
|
|
|
|
mapping.unicodeValue = _.unicodeValue;
|
|
|
|
mapping.glyphID = glyph_map->get (_.glyphID);
|
|
|
|
c->copy<UVSMapping> (mapping);
|
|
|
|
}
|
2019-08-16 22:54:24 +02:00
|
|
|
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
2018-08-26 01:11:26 +02:00
|
|
|
public:
|
2018-11-11 01:54:08 +01:00
|
|
|
DEFINE_SIZE_ARRAY (4, *this);
|
2018-08-26 01:11:26 +02:00
|
|
|
};
|
2014-06-27 23:03:22 +02:00
|
|
|
|
|
|
|
struct VariationSelectorRecord
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
glyph_variant_t get_glyph (hb_codepoint_t codepoint,
|
|
|
|
hb_codepoint_t *glyph,
|
|
|
|
const void *base) const
|
2014-06-27 23:03:22 +02:00
|
|
|
{
|
2018-11-24 06:35:31 +01:00
|
|
|
if ((base+defaultUVS).bfind (codepoint))
|
2014-06-27 23:03:22 +02:00
|
|
|
return GLYPH_VARIANT_USE_DEFAULT;
|
2018-11-24 06:35:31 +01:00
|
|
|
const UVSMapping &nonDefault = (base+nonDefaultUVS).bsearch (codepoint);
|
|
|
|
if (nonDefault.glyphID)
|
2014-06-27 23:03:22 +02:00
|
|
|
{
|
2018-11-24 06:35:31 +01:00
|
|
|
*glyph = nonDefault.glyphID;
|
2014-06-27 23:03:22 +02:00
|
|
|
return GLYPH_VARIANT_FOUND;
|
|
|
|
}
|
|
|
|
return GLYPH_VARIANT_NOT_FOUND;
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out, const void *base) const
|
2018-08-26 01:11:26 +02:00
|
|
|
{
|
|
|
|
(base+defaultUVS).collect_unicodes (out);
|
|
|
|
(base+nonDefaultUVS).collect_unicodes (out);
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
int cmp (const hb_codepoint_t &variation_selector) const
|
2019-09-21 12:03:43 +02:00
|
|
|
{ return varSelector.cmp (variation_selector); }
|
2014-06-27 23:03:22 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c, const void *base) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-06-27 23:03:22 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this) &&
|
|
|
|
defaultUVS.sanitize (c, base) &&
|
|
|
|
nonDefaultUVS.sanitize (c, base));
|
2014-06-27 23:03:22 +02:00
|
|
|
}
|
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
VariationSelectorRecord* copy (hb_serialize_context_t *c,
|
2019-09-21 11:49:14 +02:00
|
|
|
const hb_set_t *unicodes,
|
|
|
|
const hb_set_t *glyphs,
|
|
|
|
const hb_map_t *glyph_map,
|
|
|
|
const void *src_base,
|
|
|
|
const void *dst_base) const
|
2019-08-16 22:54:24 +02:00
|
|
|
{
|
|
|
|
auto snap = c->snapshot ();
|
|
|
|
auto *out = c->embed<VariationSelectorRecord> (*this);
|
|
|
|
if (unlikely (!out)) return nullptr;
|
2019-09-21 11:49:14 +02:00
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
out->defaultUVS = 0;
|
|
|
|
out->nonDefaultUVS = 0;
|
|
|
|
|
|
|
|
bool drop = true;
|
|
|
|
|
|
|
|
if (defaultUVS != 0)
|
|
|
|
{
|
|
|
|
c->push ();
|
|
|
|
if (c->copy (src_base+defaultUVS, unicodes))
|
|
|
|
{
|
2019-09-21 11:49:14 +02:00
|
|
|
c->add_link (out->defaultUVS, c->pop_pack (), dst_base);
|
|
|
|
drop = false;
|
2019-08-16 22:54:24 +02:00
|
|
|
}
|
|
|
|
else c->pop_discard ();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (nonDefaultUVS != 0)
|
|
|
|
{
|
|
|
|
c->push ();
|
|
|
|
if (c->copy (src_base+nonDefaultUVS, unicodes, glyphs, glyph_map))
|
|
|
|
{
|
2019-09-21 11:49:14 +02:00
|
|
|
c->add_link (out->nonDefaultUVS, c->pop_pack (), dst_base);
|
|
|
|
drop = false;
|
2019-08-16 22:54:24 +02:00
|
|
|
}
|
|
|
|
else c->pop_discard ();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (drop)
|
|
|
|
{
|
|
|
|
c->revert (snap);
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
else return out;
|
|
|
|
}
|
|
|
|
|
2018-04-15 18:48:48 +02:00
|
|
|
HBUINT24 varSelector; /* Variation selector. */
|
2017-01-23 05:28:56 +01:00
|
|
|
LOffsetTo<DefaultUVS>
|
2018-10-13 12:30:05 +02:00
|
|
|
defaultUVS; /* Offset to Default UVS Table. May be 0. */
|
2017-01-23 05:28:56 +01:00
|
|
|
LOffsetTo<NonDefaultUVS>
|
2018-10-13 12:30:05 +02:00
|
|
|
nonDefaultUVS; /* Offset to Non-Default UVS Table. May be 0. */
|
2014-06-27 23:03:22 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (11);
|
|
|
|
};
|
|
|
|
|
|
|
|
struct CmapSubtableFormat14
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
glyph_variant_t get_glyph_variant (hb_codepoint_t codepoint,
|
|
|
|
hb_codepoint_t variation_selector,
|
|
|
|
hb_codepoint_t *glyph) const
|
2019-09-21 12:03:43 +02:00
|
|
|
{ return record.bsearch (variation_selector).get_glyph (codepoint, glyph, this); }
|
2014-06-27 23:03:22 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_variation_selectors (hb_set_t *out) const
|
2018-08-26 00:56:07 +02:00
|
|
|
{
|
|
|
|
unsigned int count = record.len;
|
|
|
|
for (unsigned int i = 0; i < count; i++)
|
|
|
|
out->add (record.arrayZ[i].varSelector);
|
|
|
|
}
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_variation_unicodes (hb_codepoint_t variation_selector,
|
|
|
|
hb_set_t *out) const
|
2019-09-21 12:03:43 +02:00
|
|
|
{ record.bsearch (variation_selector).collect_unicodes (out, this); }
|
2018-08-26 00:56:07 +02:00
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
void serialize (hb_serialize_context_t *c,
|
2019-09-21 11:49:14 +02:00
|
|
|
const hb_set_t *unicodes,
|
|
|
|
const hb_set_t *glyphs,
|
|
|
|
const hb_map_t *glyph_map,
|
|
|
|
const void *src_base)
|
2019-08-16 22:54:24 +02:00
|
|
|
{
|
|
|
|
auto snap = c->snapshot ();
|
|
|
|
unsigned table_initpos = c->length ();
|
|
|
|
const char* init_tail = c->tail;
|
|
|
|
|
|
|
|
if (unlikely (!c->extend_min (*this))) return;
|
|
|
|
this->format = 14;
|
|
|
|
|
|
|
|
const CmapSubtableFormat14 *src_tbl = reinterpret_cast<const CmapSubtableFormat14*> (src_base);
|
2019-09-21 12:56:14 +02:00
|
|
|
for (const VariationSelectorRecord& _ : src_tbl->record)
|
|
|
|
c->copy (_, unicodes, glyphs, glyph_map, src_base, this);
|
2019-08-16 22:54:24 +02:00
|
|
|
|
2019-09-21 12:56:14 +02:00
|
|
|
if (c->length () - table_initpos == CmapSubtableFormat14::min_size)
|
2019-08-16 22:54:24 +02:00
|
|
|
c->revert (snap);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
int tail_len = init_tail - c->tail;
|
|
|
|
c->check_assign (this->length, c->length () - table_initpos + tail_len);
|
|
|
|
c->check_assign (this->record.len, (c->length () - table_initpos - CmapSubtableFormat14::min_size) / VariationSelectorRecord::static_size);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-08-07 22:17:26 +02:00
|
|
|
void closure_glyphs (const hb_set_t *unicodes,
|
2019-09-21 11:49:14 +02:00
|
|
|
hb_set_t *glyphset) const
|
2019-08-07 22:17:26 +02:00
|
|
|
{
|
|
|
|
+ hb_iter (record)
|
2019-08-29 20:17:20 +02:00
|
|
|
| hb_filter (hb_bool, &VariationSelectorRecord::nonDefaultUVS)
|
2019-08-07 22:17:26 +02:00
|
|
|
| hb_map (&VariationSelectorRecord::nonDefaultUVS)
|
|
|
|
| hb_map (hb_add (this))
|
|
|
|
| hb_apply ([=] (const NonDefaultUVS& _) { _.closure_glyphs (unicodes, glyphset); })
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-06-27 23:03:22 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this) &&
|
|
|
|
record.sanitize (c, this));
|
2014-06-27 23:03:22 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 format; /* Format number is set to 14. */
|
2018-05-02 20:59:14 +02:00
|
|
|
HBUINT32 length; /* Byte length of this subtable. */
|
2018-01-10 03:07:30 +01:00
|
|
|
SortedArrayOf<VariationSelectorRecord, HBUINT32>
|
2014-06-27 23:03:22 +02:00
|
|
|
record; /* Variation selector records; sorted
|
|
|
|
* in increasing order of `varSelector'. */
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_ARRAY (10, record);
|
|
|
|
};
|
|
|
|
|
2014-05-09 21:35:56 +02:00
|
|
|
struct CmapSubtable
|
|
|
|
{
|
2014-05-14 06:42:18 +02:00
|
|
|
/* Note: We intentionally do NOT implement subtable formats 2 and 8. */
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_glyph (hb_codepoint_t codepoint,
|
|
|
|
hb_codepoint_t *glyph) const
|
2014-05-09 21:35:56 +02:00
|
|
|
{
|
|
|
|
switch (u.format) {
|
2018-02-15 04:36:33 +01:00
|
|
|
case 0: return u.format0 .get_glyph (codepoint, glyph);
|
2019-06-25 22:17:30 +02:00
|
|
|
case 4: return u.format4 .get_glyph (codepoint, glyph);
|
2018-02-15 04:36:33 +01:00
|
|
|
case 6: return u.format6 .get_glyph (codepoint, glyph);
|
|
|
|
case 10: return u.format10.get_glyph (codepoint, glyph);
|
|
|
|
case 12: return u.format12.get_glyph (codepoint, glyph);
|
|
|
|
case 13: return u.format13.get_glyph (codepoint, glyph);
|
2014-06-27 23:03:22 +02:00
|
|
|
case 14:
|
|
|
|
default: return false;
|
|
|
|
}
|
|
|
|
}
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2018-08-25 18:33:30 +02:00
|
|
|
{
|
|
|
|
switch (u.format) {
|
2018-08-25 18:35:45 +02:00
|
|
|
case 0: u.format0 .collect_unicodes (out); return;
|
2019-06-25 22:17:30 +02:00
|
|
|
case 4: u.format4 .collect_unicodes (out); return;
|
2018-08-25 18:35:45 +02:00
|
|
|
case 6: u.format6 .collect_unicodes (out); return;
|
|
|
|
case 10: u.format10.collect_unicodes (out); return;
|
2018-08-25 18:33:30 +02:00
|
|
|
case 12: u.format12.collect_unicodes (out); return;
|
|
|
|
case 13: u.format13.collect_unicodes (out); return;
|
|
|
|
case 14:
|
|
|
|
default: return;
|
|
|
|
}
|
|
|
|
}
|
2014-06-27 23:03:22 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
void serialize (hb_serialize_context_t *c,
|
|
|
|
Iterator it,
|
2019-09-21 11:49:14 +02:00
|
|
|
unsigned format,
|
|
|
|
const hb_subset_plan_t *plan,
|
|
|
|
const void *src_base)
|
2019-06-25 22:17:30 +02:00
|
|
|
{
|
|
|
|
switch (format) {
|
|
|
|
case 4: u.format4.serialize (c, it); return;
|
|
|
|
case 12: u.format12.serialize (c, it); return;
|
2019-08-29 20:17:20 +02:00
|
|
|
case 14: u.format14.serialize (c, plan->unicodes, plan->_glyphset, plan->glyph_map, src_base); return;
|
2019-06-25 22:17:30 +02:00
|
|
|
default: return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-05-09 21:35:56 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
if (!u.format.sanitize (c)) return_trace (false);
|
2014-05-09 21:35:56 +02:00
|
|
|
switch (u.format) {
|
2015-09-29 15:57:02 +02:00
|
|
|
case 0: return_trace (u.format0 .sanitize (c));
|
2019-06-25 22:17:30 +02:00
|
|
|
case 4: return_trace (u.format4 .sanitize (c));
|
2015-09-29 15:57:02 +02:00
|
|
|
case 6: return_trace (u.format6 .sanitize (c));
|
|
|
|
case 10: return_trace (u.format10.sanitize (c));
|
|
|
|
case 12: return_trace (u.format12.sanitize (c));
|
|
|
|
case 13: return_trace (u.format13.sanitize (c));
|
|
|
|
case 14: return_trace (u.format14.sanitize (c));
|
|
|
|
default:return_trace (true);
|
2014-05-09 21:35:56 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-24 11:32:43 +01:00
|
|
|
public:
|
2014-05-09 21:35:56 +02:00
|
|
|
union {
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 format; /* Format identifier */
|
2014-05-14 03:47:51 +02:00
|
|
|
CmapSubtableFormat0 format0;
|
2019-06-25 22:17:30 +02:00
|
|
|
CmapSubtableFormat4 format4;
|
2014-05-13 00:19:29 +02:00
|
|
|
CmapSubtableFormat6 format6;
|
|
|
|
CmapSubtableFormat10 format10;
|
2014-05-12 23:51:15 +02:00
|
|
|
CmapSubtableFormat12 format12;
|
2014-05-12 23:58:31 +02:00
|
|
|
CmapSubtableFormat13 format13;
|
2014-06-27 23:03:22 +02:00
|
|
|
CmapSubtableFormat14 format14;
|
2014-05-09 21:35:56 +02:00
|
|
|
} u;
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_UNION (2, format);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
struct EncodingRecord
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
int cmp (const EncodingRecord &other) const
|
2014-05-09 21:35:56 +02:00
|
|
|
{
|
|
|
|
int ret;
|
2014-06-05 01:00:29 +02:00
|
|
|
ret = platformID.cmp (other.platformID);
|
2014-05-09 21:35:56 +02:00
|
|
|
if (ret) return ret;
|
2014-06-05 01:00:29 +02:00
|
|
|
ret = encodingID.cmp (other.encodingID);
|
2014-05-09 21:35:56 +02:00
|
|
|
if (ret) return ret;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c, const void *base) const
|
2015-02-17 15:27:44 +01:00
|
|
|
{
|
2014-05-09 21:35:56 +02:00
|
|
|
TRACE_SANITIZE (this);
|
2015-09-29 15:57:02 +02:00
|
|
|
return_trace (c->check_struct (this) &&
|
|
|
|
subtable.sanitize (c, base));
|
2014-05-09 21:35:56 +02:00
|
|
|
}
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
template<typename Iterator,
|
2019-08-24 15:27:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
EncodingRecord* copy (hb_serialize_context_t *c,
|
2019-09-21 11:49:14 +02:00
|
|
|
Iterator it,
|
|
|
|
unsigned format,
|
|
|
|
const void *src_base,
|
|
|
|
const void *dst_base,
|
|
|
|
const hb_subset_plan_t *plan,
|
|
|
|
/* INOUT */ unsigned *objidx) const
|
2019-06-25 22:17:30 +02:00
|
|
|
{
|
|
|
|
TRACE_SERIALIZE (this);
|
2019-08-16 22:54:24 +02:00
|
|
|
auto snap = c->snapshot ();
|
2019-06-25 22:17:30 +02:00
|
|
|
auto *out = c->embed (this);
|
|
|
|
if (unlikely (!out)) return_trace (nullptr);
|
|
|
|
out->subtable = 0;
|
|
|
|
|
|
|
|
if (*objidx == 0)
|
|
|
|
{
|
|
|
|
CmapSubtable *cmapsubtable = c->push<CmapSubtable> ();
|
|
|
|
unsigned origin_length = c->length ();
|
2019-08-29 20:17:20 +02:00
|
|
|
cmapsubtable->serialize (c, it, format, plan, &(src_base+subtable));
|
2019-06-25 22:17:30 +02:00
|
|
|
if (c->length () - origin_length > 0) *objidx = c->pop_pack ();
|
|
|
|
else c->pop_discard ();
|
|
|
|
}
|
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
if (*objidx == 0)
|
|
|
|
{
|
|
|
|
c->revert (snap);
|
|
|
|
return_trace (nullptr);
|
|
|
|
}
|
2019-09-21 11:49:14 +02:00
|
|
|
|
2019-08-29 20:17:20 +02:00
|
|
|
c->add_link (out->subtable, *objidx, dst_base);
|
|
|
|
return_trace (out);
|
2019-06-25 22:17:30 +02:00
|
|
|
}
|
|
|
|
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 platformID; /* Platform ID. */
|
|
|
|
HBUINT16 encodingID; /* Platform-specific encoding ID. */
|
2017-01-23 05:28:56 +01:00
|
|
|
LOffsetTo<CmapSubtable>
|
2014-05-09 21:35:56 +02:00
|
|
|
subtable; /* Byte offset from beginning of table to the subtable for this encoding. */
|
|
|
|
public:
|
|
|
|
DEFINE_SIZE_STATIC (8);
|
|
|
|
};
|
|
|
|
|
|
|
|
struct cmap
|
|
|
|
{
|
2019-01-22 12:08:57 +01:00
|
|
|
static constexpr hb_tag_t tableTag = HB_OT_TAG_cmap;
|
2014-05-09 21:35:56 +02:00
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
template<typename Iterator, typename EncodingRecIter,
|
2019-09-21 11:49:14 +02:00
|
|
|
hb_requires (hb_is_iterator (Iterator))>
|
2019-06-25 22:17:30 +02:00
|
|
|
void serialize (hb_serialize_context_t *c,
|
2019-09-21 11:49:14 +02:00
|
|
|
Iterator it,
|
|
|
|
EncodingRecIter encodingrec_iter,
|
|
|
|
const void *src_base,
|
|
|
|
const hb_subset_plan_t *plan)
|
2018-08-26 09:21:29 +02:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
if (unlikely (!c->extend_min ((*this)))) return;
|
|
|
|
this->version = 0;
|
2018-05-03 00:42:43 +02:00
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
unsigned format4objidx = 0, format12objidx = 0, format14objidx = 0;
|
2018-05-03 00:42:43 +02:00
|
|
|
|
2019-09-21 12:56:14 +02:00
|
|
|
for (const EncodingRecord& _ : encodingrec_iter)
|
|
|
|
{
|
|
|
|
unsigned format = (src_base+_.subtable).u.format;
|
2019-07-10 23:05:06 +02:00
|
|
|
|
2019-09-21 12:56:14 +02:00
|
|
|
if (format == 4) c->copy (_, it, 4u, src_base, this, plan, &format4objidx);
|
|
|
|
else if (format == 12) c->copy (_, it, 12u, src_base, this, plan, &format12objidx);
|
|
|
|
else if (format == 14) c->copy (_, it, 14u, src_base, this, plan, &format14objidx);
|
|
|
|
}
|
2019-08-16 22:54:24 +02:00
|
|
|
|
|
|
|
c->check_assign(this->encodingRecord.len, (c->length () - cmap::min_size)/EncodingRecord::static_size);
|
2018-02-10 02:33:34 +01:00
|
|
|
}
|
|
|
|
|
2019-08-07 22:17:26 +02:00
|
|
|
void closure_glyphs (const hb_set_t *unicodes,
|
2019-09-21 11:49:14 +02:00
|
|
|
hb_set_t *glyphset) const
|
2019-08-07 22:17:26 +02:00
|
|
|
{
|
|
|
|
+ hb_iter (encodingRecord)
|
|
|
|
| hb_map (&EncodingRecord::subtable)
|
|
|
|
| hb_map (hb_add (this))
|
|
|
|
| hb_filter ([&] (const CmapSubtable& _) { return _.u.format == 14; })
|
|
|
|
| hb_apply ([=] (const CmapSubtable& _) { _.u.format14.closure_glyphs (unicodes, glyphset); })
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
bool subset (hb_subset_context_t *c) const
|
2018-02-10 02:33:34 +01:00
|
|
|
{
|
2019-06-25 22:17:30 +02:00
|
|
|
TRACE_SUBSET (this);
|
2018-02-12 19:12:11 +01:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
cmap *cmap_prime = c->serializer->start_embed<cmap> ();
|
|
|
|
if (unlikely (!c->serializer->check_success (cmap_prime))) return_trace (false);
|
2018-02-10 02:33:34 +01:00
|
|
|
|
2019-08-16 22:54:24 +02:00
|
|
|
auto encodingrec_iter =
|
|
|
|
+ hb_iter (encodingRecord)
|
|
|
|
| hb_filter ([&] (const EncodingRecord& _)
|
2019-09-21 12:56:14 +02:00
|
|
|
{
|
|
|
|
if ((_.platformID == 0 && _.encodingID == 3) ||
|
|
|
|
(_.platformID == 0 && _.encodingID == 4) ||
|
|
|
|
(_.platformID == 3 && _.encodingID == 1) ||
|
|
|
|
(_.platformID == 3 && _.encodingID == 10) ||
|
|
|
|
(this + _.subtable).u.format == 14)
|
|
|
|
return true;
|
|
|
|
|
|
|
|
return false;
|
2019-10-01 12:19:55 +02:00
|
|
|
})
|
2019-08-29 20:17:20 +02:00
|
|
|
;
|
2019-09-21 11:49:14 +02:00
|
|
|
|
|
|
|
|
2019-08-29 20:17:20 +02:00
|
|
|
if (unlikely (!encodingrec_iter.len ())) return_trace (false);
|
|
|
|
|
|
|
|
const EncodingRecord *unicode_bmp= nullptr, *unicode_ucs4 = nullptr, *ms_bmp = nullptr, *ms_ucs4 = nullptr;
|
2019-09-23 19:21:43 +02:00
|
|
|
bool has_format12 = false;
|
2019-09-21 11:49:14 +02:00
|
|
|
|
2019-09-21 12:56:14 +02:00
|
|
|
for (const EncodingRecord& _ : encodingrec_iter)
|
|
|
|
{
|
|
|
|
unsigned format = (this + _.subtable).u.format;
|
|
|
|
if (format == 12) has_format12 = true;
|
|
|
|
|
|
|
|
const EncodingRecord *table = hb_addressof (_);
|
2019-09-23 19:21:43 +02:00
|
|
|
if (_.platformID == 0 && _.encodingID == 3) unicode_bmp = table;
|
|
|
|
else if (_.platformID == 0 && _.encodingID == 4) unicode_ucs4 = table;
|
|
|
|
else if (_.platformID == 3 && _.encodingID == 1) ms_bmp = table;
|
2019-09-21 12:56:14 +02:00
|
|
|
else if (_.platformID == 3 && _.encodingID == 10) ms_ucs4 = table;
|
|
|
|
}
|
2019-09-21 11:49:14 +02:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
if (unlikely (!unicode_bmp && !ms_bmp)) return_trace (false);
|
|
|
|
if (unlikely (has_format12 && (!unicode_ucs4 && !ms_ucs4))) return_trace (false);
|
2018-02-12 19:12:11 +01:00
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
auto it =
|
|
|
|
+ hb_iter (c->plan->unicodes)
|
|
|
|
| hb_map ([&] (hb_codepoint_t _)
|
2019-08-24 15:27:14 +02:00
|
|
|
{
|
2019-09-21 12:03:43 +02:00
|
|
|
hb_codepoint_t new_gid = HB_MAP_VALUE_INVALID;
|
|
|
|
c->plan->new_gid_for_codepoint (_, &new_gid);
|
|
|
|
return hb_pair_t<hb_codepoint_t, hb_codepoint_t> (_, new_gid);
|
2019-08-24 15:27:14 +02:00
|
|
|
})
|
2019-09-21 12:03:43 +02:00
|
|
|
| hb_filter ([&] (const hb_pair_t<hb_codepoint_t, hb_codepoint_t> _)
|
|
|
|
{ return (_.second != HB_MAP_VALUE_INVALID); })
|
2019-06-25 22:17:30 +02:00
|
|
|
;
|
2018-02-10 02:33:34 +01:00
|
|
|
|
2019-08-29 20:17:20 +02:00
|
|
|
cmap_prime->serialize (c->serializer, it, encodingrec_iter, this, c->plan);
|
2019-06-25 22:17:30 +02:00
|
|
|
return_trace (true);
|
2018-02-10 02:33:34 +01:00
|
|
|
}
|
|
|
|
|
2018-08-26 00:33:05 +02:00
|
|
|
const CmapSubtable *find_best_subtable (bool *symbol = nullptr) const
|
|
|
|
{
|
|
|
|
if (symbol) *symbol = false;
|
|
|
|
|
|
|
|
const CmapSubtable *subtable;
|
|
|
|
|
2019-08-21 21:30:22 +02:00
|
|
|
/* Symbol subtable.
|
|
|
|
* Prefer symbol if available.
|
|
|
|
* https://github.com/harfbuzz/harfbuzz/issues/1918 */
|
|
|
|
if ((subtable = this->find_subtable (3, 0)))
|
|
|
|
{
|
|
|
|
if (symbol) *symbol = true;
|
|
|
|
return subtable;
|
|
|
|
}
|
|
|
|
|
2018-08-26 00:33:05 +02:00
|
|
|
/* 32-bit subtables. */
|
|
|
|
if ((subtable = this->find_subtable (3, 10))) return subtable;
|
|
|
|
if ((subtable = this->find_subtable (0, 6))) return subtable;
|
|
|
|
if ((subtable = this->find_subtable (0, 4))) return subtable;
|
|
|
|
|
|
|
|
/* 16-bit subtables. */
|
|
|
|
if ((subtable = this->find_subtable (3, 1))) return subtable;
|
|
|
|
if ((subtable = this->find_subtable (0, 3))) return subtable;
|
|
|
|
if ((subtable = this->find_subtable (0, 2))) return subtable;
|
|
|
|
if ((subtable = this->find_subtable (0, 1))) return subtable;
|
|
|
|
if ((subtable = this->find_subtable (0, 0))) return subtable;
|
|
|
|
|
|
|
|
/* Meh. */
|
2018-11-15 20:40:56 +01:00
|
|
|
return &Null (CmapSubtable);
|
2018-08-26 00:33:05 +02:00
|
|
|
}
|
|
|
|
|
2017-11-15 05:06:19 +01:00
|
|
|
struct accelerator_t
|
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
void init (hb_face_t *face)
|
2017-11-15 05:06:19 +01:00
|
|
|
{
|
2018-11-15 20:40:56 +01:00
|
|
|
this->table = hb_sanitize_context_t ().reference_table<cmap> (face);
|
2018-08-26 00:33:05 +02:00
|
|
|
bool symbol;
|
2018-11-06 01:46:29 +01:00
|
|
|
this->subtable = table->find_best_subtable (&symbol);
|
2018-11-15 20:40:56 +01:00
|
|
|
this->subtable_uvs = &Null (CmapSubtableFormat14);
|
2017-11-15 05:06:19 +01:00
|
|
|
{
|
2018-07-23 21:00:02 +02:00
|
|
|
const CmapSubtable *st = table->find_subtable (0, 5);
|
2017-11-15 05:06:19 +01:00
|
|
|
if (st && st->u.format == 14)
|
2018-11-06 01:46:29 +01:00
|
|
|
subtable_uvs = &st->u.format14;
|
2017-11-15 05:06:19 +01:00
|
|
|
}
|
|
|
|
|
2018-11-06 01:46:29 +01:00
|
|
|
this->get_glyph_data = subtable;
|
2017-11-15 05:06:19 +01:00
|
|
|
if (unlikely (symbol))
|
2018-11-05 19:45:12 +01:00
|
|
|
this->get_glyph_funcZ = get_glyph_from_symbol<CmapSubtable>;
|
2019-09-21 12:03:43 +02:00
|
|
|
else
|
|
|
|
{
|
2018-11-06 01:46:29 +01:00
|
|
|
switch (subtable->u.format) {
|
2017-11-15 05:06:19 +01:00
|
|
|
/* Accelerate format 4 and format 12. */
|
2018-04-11 00:40:24 +02:00
|
|
|
default:
|
2018-11-05 19:45:12 +01:00
|
|
|
this->get_glyph_funcZ = get_glyph_from<CmapSubtable>;
|
2018-04-11 00:40:24 +02:00
|
|
|
break;
|
|
|
|
case 12:
|
2018-11-05 19:45:12 +01:00
|
|
|
this->get_glyph_funcZ = get_glyph_from<CmapSubtableFormat12>;
|
2018-04-11 00:40:24 +02:00
|
|
|
break;
|
2017-11-15 05:06:19 +01:00
|
|
|
case 4:
|
2019-09-21 12:03:43 +02:00
|
|
|
{
|
|
|
|
this->format4_accel.init (&subtable->u.format4);
|
|
|
|
this->get_glyph_data = &this->format4_accel;
|
|
|
|
this->get_glyph_funcZ = this->format4_accel.get_glyph_func;
|
2017-11-15 05:06:19 +01:00
|
|
|
break;
|
|
|
|
}
|
2019-09-21 12:03:43 +02:00
|
|
|
}
|
2018-04-11 00:40:24 +02:00
|
|
|
}
|
2017-11-15 05:06:19 +01:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini () { this->table.destroy (); }
|
2017-11-15 05:06:19 +01:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_nominal_glyph (hb_codepoint_t unicode,
|
2019-09-21 12:03:43 +02:00
|
|
|
hb_codepoint_t *glyph) const
|
2017-11-15 05:06:19 +01:00
|
|
|
{
|
2018-11-05 19:45:12 +01:00
|
|
|
if (unlikely (!this->get_glyph_funcZ)) return false;
|
|
|
|
return this->get_glyph_funcZ (this->get_glyph_data, unicode, glyph);
|
2017-11-15 05:06:19 +01:00
|
|
|
}
|
2018-12-16 20:08:10 +01:00
|
|
|
unsigned int get_nominal_glyphs (unsigned int count,
|
|
|
|
const hb_codepoint_t *first_unicode,
|
|
|
|
unsigned int unicode_stride,
|
|
|
|
hb_codepoint_t *first_glyph,
|
|
|
|
unsigned int glyph_stride) const
|
2018-11-06 01:49:54 +01:00
|
|
|
{
|
|
|
|
if (unlikely (!this->get_glyph_funcZ)) return 0;
|
|
|
|
|
|
|
|
hb_cmap_get_glyph_func_t get_glyph_funcZ = this->get_glyph_funcZ;
|
|
|
|
const void *get_glyph_data = this->get_glyph_data;
|
|
|
|
|
|
|
|
unsigned int done;
|
|
|
|
for (done = 0;
|
|
|
|
done < count && get_glyph_funcZ (get_glyph_data, *first_unicode, first_glyph);
|
|
|
|
done++)
|
|
|
|
{
|
2019-01-22 12:45:40 +01:00
|
|
|
first_unicode = &StructAtOffsetUnaligned<hb_codepoint_t> (first_unicode, unicode_stride);
|
|
|
|
first_glyph = &StructAtOffsetUnaligned<hb_codepoint_t> (first_glyph, glyph_stride);
|
2018-11-06 01:49:54 +01:00
|
|
|
}
|
|
|
|
return done;
|
|
|
|
}
|
2017-11-15 05:06:19 +01:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool get_variation_glyph (hb_codepoint_t unicode,
|
|
|
|
hb_codepoint_t variation_selector,
|
|
|
|
hb_codepoint_t *glyph) const
|
2017-11-15 05:06:19 +01:00
|
|
|
{
|
2018-11-06 01:46:29 +01:00
|
|
|
switch (this->subtable_uvs->get_glyph_variant (unicode,
|
|
|
|
variation_selector,
|
|
|
|
glyph))
|
2017-11-15 05:06:19 +01:00
|
|
|
{
|
2018-07-23 20:57:45 +02:00
|
|
|
case GLYPH_VARIANT_NOT_FOUND: return false;
|
|
|
|
case GLYPH_VARIANT_FOUND: return true;
|
|
|
|
case GLYPH_VARIANT_USE_DEFAULT: break;
|
2017-11-15 05:06:19 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return get_nominal_glyph (unicode, glyph);
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_unicodes (hb_set_t *out) const
|
2019-10-28 20:56:04 +01:00
|
|
|
{
|
|
|
|
subtable->collect_unicodes (out);
|
|
|
|
// Never include unicode codepoint 0 in the set.
|
|
|
|
// This is assumed to be the notdef glyph.
|
|
|
|
out->del (0);
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_variation_selectors (hb_set_t *out) const
|
2019-09-21 12:03:43 +02:00
|
|
|
{ subtable_uvs->collect_variation_selectors (out); }
|
2018-12-16 20:08:10 +01:00
|
|
|
void collect_variation_unicodes (hb_codepoint_t variation_selector,
|
|
|
|
hb_set_t *out) const
|
2019-09-21 12:03:43 +02:00
|
|
|
{ subtable_uvs->collect_variation_unicodes (variation_selector, out); }
|
2018-04-11 00:40:24 +02:00
|
|
|
|
2017-11-15 05:06:19 +01:00
|
|
|
protected:
|
|
|
|
typedef bool (*hb_cmap_get_glyph_func_t) (const void *obj,
|
|
|
|
hb_codepoint_t codepoint,
|
|
|
|
hb_codepoint_t *glyph);
|
2018-04-11 00:40:24 +02:00
|
|
|
|
2017-11-15 05:06:19 +01:00
|
|
|
template <typename Type>
|
2019-04-12 23:50:03 +02:00
|
|
|
HB_INTERNAL static bool get_glyph_from (const void *obj,
|
|
|
|
hb_codepoint_t codepoint,
|
|
|
|
hb_codepoint_t *glyph)
|
2017-11-15 05:06:19 +01:00
|
|
|
{
|
|
|
|
const Type *typed_obj = (const Type *) obj;
|
|
|
|
return typed_obj->get_glyph (codepoint, glyph);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename Type>
|
2019-04-12 23:50:03 +02:00
|
|
|
HB_INTERNAL static bool get_glyph_from_symbol (const void *obj,
|
|
|
|
hb_codepoint_t codepoint,
|
|
|
|
hb_codepoint_t *glyph)
|
2017-11-15 05:06:19 +01:00
|
|
|
{
|
|
|
|
const Type *typed_obj = (const Type *) obj;
|
|
|
|
if (likely (typed_obj->get_glyph (codepoint, glyph)))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
if (codepoint <= 0x00FFu)
|
|
|
|
{
|
|
|
|
/* For symbol-encoded OpenType fonts, we duplicate the
|
|
|
|
* U+F000..F0FF range at U+0000..U+00FF. That's what
|
|
|
|
* Windows seems to do, and that's hinted about at:
|
2018-04-12 11:10:45 +02:00
|
|
|
* https://docs.microsoft.com/en-us/typography/opentype/spec/recom
|
2017-11-15 05:06:19 +01:00
|
|
|
* under "Non-Standard (Symbol) Fonts". */
|
|
|
|
return typed_obj->get_glyph (0xF000u + codepoint, glyph);
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
2018-11-06 01:46:29 +01:00
|
|
|
hb_nonnull_ptr_t<const CmapSubtable> subtable;
|
|
|
|
hb_nonnull_ptr_t<const CmapSubtableFormat14> subtable_uvs;
|
2018-08-26 00:56:07 +02:00
|
|
|
|
2018-11-05 19:45:12 +01:00
|
|
|
hb_cmap_get_glyph_func_t get_glyph_funcZ;
|
2017-11-15 05:06:19 +01:00
|
|
|
const void *get_glyph_data;
|
2018-04-11 00:40:24 +02:00
|
|
|
|
2018-07-23 20:57:45 +02:00
|
|
|
CmapSubtableFormat4::accelerator_t format4_accel;
|
2017-11-15 05:06:19 +01:00
|
|
|
|
2019-08-07 22:17:26 +02:00
|
|
|
public:
|
2018-11-11 06:28:47 +01:00
|
|
|
hb_blob_ptr_t<cmap> table;
|
2017-11-15 05:06:19 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
const CmapSubtable *find_subtable (unsigned int platform_id,
|
|
|
|
unsigned int encoding_id) const
|
2014-05-09 21:35:56 +02:00
|
|
|
{
|
|
|
|
EncodingRecord key;
|
2019-03-30 04:17:46 +01:00
|
|
|
key.platformID = platform_id;
|
|
|
|
key.encodingID = encoding_id;
|
2014-05-09 21:35:56 +02:00
|
|
|
|
2018-11-24 06:35:31 +01:00
|
|
|
const EncodingRecord &result = encodingRecord.bsearch (key);
|
|
|
|
if (!result.subtable)
|
2017-10-15 12:11:08 +02:00
|
|
|
return nullptr;
|
2014-05-12 19:46:29 +02:00
|
|
|
|
2018-11-24 06:35:31 +01:00
|
|
|
return &(this+result.subtable);
|
2014-05-09 21:35:56 +02:00
|
|
|
}
|
|
|
|
|
2019-06-25 22:17:30 +02:00
|
|
|
const EncodingRecord *find_encodingrec (unsigned int platform_id,
|
2019-08-24 15:27:14 +02:00
|
|
|
unsigned int encoding_id) const
|
2019-06-25 22:17:30 +02:00
|
|
|
{
|
|
|
|
EncodingRecord key;
|
|
|
|
key.platformID = platform_id;
|
|
|
|
key.encodingID = encoding_id;
|
|
|
|
|
|
|
|
return encodingRecord.as_array ().bsearch (key);
|
|
|
|
}
|
|
|
|
|
2019-05-14 22:55:11 +02:00
|
|
|
bool find_subtable (unsigned format) const
|
|
|
|
{
|
|
|
|
auto it =
|
|
|
|
+ hb_iter (encodingRecord)
|
|
|
|
| hb_map (&EncodingRecord::subtable)
|
|
|
|
| hb_map (hb_add (this))
|
|
|
|
| hb_filter ([&] (const CmapSubtable& _) { return _.u.format == format; })
|
|
|
|
;
|
|
|
|
|
|
|
|
return it.len ();
|
|
|
|
}
|
|
|
|
|
2018-11-23 04:17:49 +01:00
|
|
|
public:
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool sanitize (hb_sanitize_context_t *c) const
|
2018-11-23 04:17:49 +01:00
|
|
|
{
|
|
|
|
TRACE_SANITIZE (this);
|
|
|
|
return_trace (c->check_struct (this) &&
|
|
|
|
likely (version == 0) &&
|
|
|
|
encodingRecord.sanitize (c, this));
|
|
|
|
}
|
|
|
|
|
2017-11-15 05:06:19 +01:00
|
|
|
protected:
|
2018-01-10 03:07:30 +01:00
|
|
|
HBUINT16 version; /* Table version number (0). */
|
2014-06-19 21:39:18 +02:00
|
|
|
SortedArrayOf<EncodingRecord>
|
2014-06-05 01:00:29 +02:00
|
|
|
encodingRecord; /* Encoding tables. */
|
2014-05-09 21:35:56 +02:00
|
|
|
public:
|
|
|
|
DEFINE_SIZE_ARRAY (4, encodingRecord);
|
|
|
|
};
|
|
|
|
|
2018-08-27 00:11:24 +02:00
|
|
|
struct cmap_accelerator_t : cmap::accelerator_t {};
|
2014-05-09 21:35:56 +02:00
|
|
|
|
|
|
|
} /* namespace OT */
|
|
|
|
|
|
|
|
|
|
|
|
#endif /* HB_OT_CMAP_TABLE_HH */
|