2018-08-06 19:04:53 +02:00
|
|
|
/*
|
|
|
|
* Copyright © 2018 Adobe Systems Incorporated.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* Adobe Author(s): Michiharu Ariza
|
|
|
|
*/
|
|
|
|
|
2018-08-29 22:36:39 +02:00
|
|
|
#ifndef HB_SUBSET_CFF_COMMON_HH
|
|
|
|
#define HB_SUBSET_CFF_COMMON_HH
|
2018-08-06 19:04:53 +02:00
|
|
|
|
2018-08-29 22:26:17 +02:00
|
|
|
#include "hb.hh"
|
2018-08-06 19:04:53 +02:00
|
|
|
|
|
|
|
#include "hb-subset-plan.hh"
|
2018-08-29 22:26:17 +02:00
|
|
|
#include "hb-cff-interp-cs-common.hh"
|
2018-08-15 21:00:19 +02:00
|
|
|
|
|
|
|
namespace CFF {
|
|
|
|
|
2018-08-29 21:14:30 +02:00
|
|
|
/* Used for writing a temporary charstring */
|
|
|
|
struct ByteStrBuff : hb_vector_t<char, 1>
|
|
|
|
{
|
|
|
|
inline bool encode_byte (unsigned char b)
|
|
|
|
{
|
|
|
|
return (push ((const char)b) != &Crap(char));
|
|
|
|
}
|
|
|
|
|
2018-09-04 19:25:21 +02:00
|
|
|
inline bool encode_int (int v)
|
2018-08-29 21:14:30 +02:00
|
|
|
{
|
2018-09-04 19:25:21 +02:00
|
|
|
if ((-1131 <= v) && (v <= 1131))
|
2018-08-29 21:14:30 +02:00
|
|
|
{
|
2018-09-04 19:25:21 +02:00
|
|
|
if ((-107 <= v) && (v <= 107))
|
|
|
|
return encode_byte (v + 139);
|
|
|
|
else if (v > 0)
|
2018-08-29 21:14:30 +02:00
|
|
|
{
|
2018-09-04 19:25:21 +02:00
|
|
|
v -= 108;
|
|
|
|
return encode_byte ((v >> 8) + OpCode_TwoBytePosInt0) && encode_byte (v & 0xFF);
|
2018-08-29 21:14:30 +02:00
|
|
|
}
|
2018-09-04 19:25:21 +02:00
|
|
|
else
|
|
|
|
{
|
|
|
|
v = -v - 108;
|
|
|
|
return encode_byte ((v >> 8) + OpCode_TwoByteNegInt0) && encode_byte (v & 0xFF);
|
|
|
|
}
|
|
|
|
}
|
2018-10-12 23:14:21 +02:00
|
|
|
if (unlikely (v < -32768))
|
|
|
|
v = -32768;
|
|
|
|
else if (unlikely (v > 32767))
|
|
|
|
v = 32767;
|
2018-09-04 19:25:21 +02:00
|
|
|
return encode_byte (OpCode_shortint) &&
|
|
|
|
encode_byte ((v >> 8) & 0xFF) &&
|
|
|
|
encode_byte (v & 0xFF);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool encode_num (const Number& n)
|
|
|
|
{
|
|
|
|
if (n.in_int_range ())
|
|
|
|
{
|
|
|
|
return encode_int (n.to_int ());
|
2018-08-29 21:14:30 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
int32_t v = n.to_fixed ();
|
|
|
|
return encode_byte (OpCode_fixedcs) &&
|
|
|
|
encode_byte ((v >> 24) & 0xFF) &&
|
|
|
|
encode_byte ((v >> 16) & 0xFF) &&
|
|
|
|
encode_byte ((v >> 8) & 0xFF) &&
|
|
|
|
encode_byte (v & 0xFF);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
inline bool encode_op (OpCode op)
|
|
|
|
{
|
|
|
|
if (Is_OpCode_ESC (op))
|
|
|
|
return encode_byte (OpCode_escape) &&
|
|
|
|
encode_byte (Unmake_OpCode_ESC (op));
|
|
|
|
else
|
|
|
|
return encode_byte (op);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct ByteStrBuffArray : hb_vector_t<ByteStrBuff, 1>
|
|
|
|
{
|
|
|
|
inline void fini (void)
|
|
|
|
{
|
|
|
|
for (unsigned int i = 0; i < len; i++)
|
|
|
|
hb_vector_t<ByteStrBuff, 1>::operator[] (i).fini ();
|
|
|
|
hb_vector_t<ByteStrBuff, 1>::fini ();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2018-08-30 03:18:18 +02:00
|
|
|
struct CFFSubTableOffsets {
|
|
|
|
inline CFFSubTableOffsets (void)
|
|
|
|
: privateDictsOffset (0)
|
|
|
|
|
|
|
|
{
|
|
|
|
topDictInfo.init ();
|
|
|
|
FDSelectInfo.init ();
|
|
|
|
FDArrayInfo.init ();
|
|
|
|
charStringsInfo.init ();
|
|
|
|
globalSubrsInfo.init ();
|
|
|
|
localSubrsInfos.init ();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline ~CFFSubTableOffsets (void)
|
|
|
|
{
|
|
|
|
localSubrsInfos.fini ();
|
|
|
|
}
|
|
|
|
|
|
|
|
TableInfo topDictInfo;
|
|
|
|
TableInfo FDSelectInfo;
|
|
|
|
TableInfo FDArrayInfo;
|
|
|
|
TableInfo charStringsInfo;
|
|
|
|
unsigned int privateDictsOffset;
|
|
|
|
TableInfo globalSubrsInfo;
|
|
|
|
hb_vector_t<TableInfo> localSubrsInfos;
|
|
|
|
};
|
|
|
|
|
2018-09-11 01:00:20 +02:00
|
|
|
template <typename OPSTR=OpStr>
|
2018-08-30 03:18:18 +02:00
|
|
|
struct CFFTopDict_OpSerializer : OpSerializer
|
|
|
|
{
|
|
|
|
inline bool serialize (hb_serialize_context_t *c,
|
2018-09-11 01:00:20 +02:00
|
|
|
const OPSTR &opstr,
|
2018-08-30 03:18:18 +02:00
|
|
|
const CFFSubTableOffsets &offsets) const
|
|
|
|
{
|
|
|
|
TRACE_SERIALIZE (this);
|
|
|
|
|
|
|
|
switch (opstr.op)
|
|
|
|
{
|
|
|
|
case OpCode_CharStrings:
|
|
|
|
return_trace (FontDict::serialize_offset4_op(c, opstr.op, offsets.charStringsInfo.offset));
|
|
|
|
|
|
|
|
case OpCode_FDArray:
|
|
|
|
return_trace (FontDict::serialize_offset4_op(c, opstr.op, offsets.FDArrayInfo.offset));
|
|
|
|
|
|
|
|
case OpCode_FDSelect:
|
|
|
|
return_trace (FontDict::serialize_offset4_op(c, opstr.op, offsets.FDSelectInfo.offset));
|
|
|
|
|
|
|
|
default:
|
|
|
|
return_trace (copy_opstr (c, opstr));
|
|
|
|
}
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
|
2018-09-11 01:00:20 +02:00
|
|
|
inline unsigned int calculate_serialized_size (const OPSTR &opstr) const
|
2018-08-30 03:18:18 +02:00
|
|
|
{
|
|
|
|
switch (opstr.op)
|
|
|
|
{
|
|
|
|
case OpCode_CharStrings:
|
|
|
|
case OpCode_FDArray:
|
|
|
|
case OpCode_FDSelect:
|
|
|
|
return OpCode_Size (OpCode_longintdict) + 4 + OpCode_Size (opstr.op);
|
2018-09-11 01:00:20 +02:00
|
|
|
|
2018-08-30 03:18:18 +02:00
|
|
|
default:
|
|
|
|
return opstr.str.len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct CFFFontDict_OpSerializer : OpSerializer
|
|
|
|
{
|
|
|
|
inline bool serialize (hb_serialize_context_t *c,
|
|
|
|
const OpStr &opstr,
|
|
|
|
const TableInfo &privateDictInfo) const
|
|
|
|
{
|
|
|
|
TRACE_SERIALIZE (this);
|
|
|
|
|
|
|
|
if (opstr.op == OpCode_Private)
|
|
|
|
{
|
2018-09-11 01:00:20 +02:00
|
|
|
/* serialize the private dict size & offset as 2-byte & 4-byte integers */
|
|
|
|
if (unlikely (!UnsizedByteStr::serialize_int2 (c, privateDictInfo.size) ||
|
|
|
|
!UnsizedByteStr::serialize_int4 (c, privateDictInfo.offset)))
|
2018-08-30 03:18:18 +02:00
|
|
|
return_trace (false);
|
|
|
|
|
|
|
|
/* serialize the opcode */
|
|
|
|
HBUINT8 *p = c->allocate_size<HBUINT8> (1);
|
|
|
|
if (unlikely (p == nullptr)) return_trace (false);
|
|
|
|
p->set (OpCode_Private);
|
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
HBUINT8 *d = c->allocate_size<HBUINT8> (opstr.str.len);
|
|
|
|
if (unlikely (d == nullptr)) return_trace (false);
|
|
|
|
memcpy (d, &opstr.str.str[0], opstr.str.len);
|
|
|
|
}
|
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
|
|
|
|
inline unsigned int calculate_serialized_size (const OpStr &opstr) const
|
|
|
|
{
|
|
|
|
if (opstr.op == OpCode_Private)
|
|
|
|
return OpCode_Size (OpCode_longintdict) + 4 + OpCode_Size (OpCode_shortint) + 2 + OpCode_Size (OpCode_Private);
|
|
|
|
else
|
|
|
|
return opstr.str.len;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct CFFPrivateDict_OpSerializer : OpSerializer
|
|
|
|
{
|
2018-09-11 01:27:49 +02:00
|
|
|
inline CFFPrivateDict_OpSerializer (bool drop_hints_=false)
|
|
|
|
: drop_hints (drop_hints_) {}
|
2018-08-30 03:18:18 +02:00
|
|
|
|
|
|
|
inline bool serialize (hb_serialize_context_t *c,
|
|
|
|
const OpStr &opstr,
|
|
|
|
const unsigned int subrsOffset) const
|
|
|
|
{
|
|
|
|
TRACE_SERIALIZE (this);
|
|
|
|
|
2018-09-04 20:29:15 +02:00
|
|
|
if (drop_hints && DictOpSet::is_hint_op (opstr.op))
|
2018-08-30 03:18:18 +02:00
|
|
|
return true;
|
|
|
|
if (opstr.op == OpCode_Subrs)
|
2018-09-11 01:27:49 +02:00
|
|
|
return_trace (true);
|
2018-08-30 03:18:18 +02:00
|
|
|
else
|
|
|
|
return_trace (copy_opstr (c, opstr));
|
|
|
|
}
|
|
|
|
|
|
|
|
inline unsigned int calculate_serialized_size (const OpStr &opstr) const
|
|
|
|
{
|
2018-09-04 20:29:15 +02:00
|
|
|
if (drop_hints && DictOpSet::is_hint_op (opstr.op))
|
2018-08-30 03:18:18 +02:00
|
|
|
return 0;
|
|
|
|
if (opstr.op == OpCode_Subrs)
|
2018-09-11 01:27:49 +02:00
|
|
|
return 0;
|
2018-08-30 03:18:18 +02:00
|
|
|
else
|
|
|
|
return opstr.str.len;
|
|
|
|
}
|
|
|
|
|
|
|
|
protected:
|
|
|
|
const bool drop_hints;
|
|
|
|
};
|
|
|
|
|
2018-08-31 02:21:56 +02:00
|
|
|
struct FlattenParam
|
|
|
|
{
|
|
|
|
ByteStrBuff &flatStr;
|
|
|
|
bool drop_hints;
|
|
|
|
};
|
2018-08-29 21:14:30 +02:00
|
|
|
|
2018-09-04 19:25:21 +02:00
|
|
|
template <typename ACC, typename ENV, typename OPSET>
|
2018-08-29 21:14:30 +02:00
|
|
|
struct SubrFlattener
|
|
|
|
{
|
2018-09-04 19:25:21 +02:00
|
|
|
inline SubrFlattener (const ACC &acc_,
|
2018-08-31 02:21:56 +02:00
|
|
|
const hb_vector_t<hb_codepoint_t> &glyphs_,
|
|
|
|
bool drop_hints_)
|
2018-08-29 21:14:30 +02:00
|
|
|
: acc (acc_),
|
2018-08-31 02:21:56 +02:00
|
|
|
glyphs (glyphs_),
|
|
|
|
drop_hints (drop_hints_)
|
2018-08-29 21:14:30 +02:00
|
|
|
{}
|
|
|
|
|
|
|
|
inline bool flatten (ByteStrBuffArray &flat_charstrings)
|
|
|
|
{
|
|
|
|
if (!flat_charstrings.resize (glyphs.len))
|
|
|
|
return false;
|
|
|
|
for (unsigned int i = 0; i < glyphs.len; i++)
|
|
|
|
flat_charstrings[i].init ();
|
|
|
|
for (unsigned int i = 0; i < glyphs.len; i++)
|
|
|
|
{
|
|
|
|
hb_codepoint_t glyph = glyphs[i];
|
|
|
|
const ByteStr str = (*acc.charStrings)[glyph];
|
|
|
|
unsigned int fd = acc.fdSelect->get_fd (glyph);
|
2018-08-31 02:21:56 +02:00
|
|
|
CSInterpreter<ENV, OPSET, FlattenParam> interp;
|
2018-09-04 19:25:21 +02:00
|
|
|
interp.env.init (str, acc, fd);
|
2018-08-31 02:21:56 +02:00
|
|
|
FlattenParam param = { flat_charstrings[i], drop_hints };
|
|
|
|
if (unlikely (!interp.interpret (param)))
|
2018-08-29 21:14:30 +02:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-09-04 19:25:21 +02:00
|
|
|
const ACC &acc;
|
2018-08-29 21:14:30 +02:00
|
|
|
const hb_vector_t<hb_codepoint_t> &glyphs;
|
2018-08-31 02:21:56 +02:00
|
|
|
bool drop_hints;
|
2018-08-29 21:14:30 +02:00
|
|
|
};
|
2018-08-15 21:00:19 +02:00
|
|
|
}; /* namespace CFF */
|
2018-08-06 19:04:53 +02:00
|
|
|
|
|
|
|
HB_INTERNAL bool
|
|
|
|
hb_plan_subset_cff_fdselect (const hb_vector_t<hb_codepoint_t> &glyphs,
|
|
|
|
unsigned int fdCount,
|
2018-08-10 20:07:07 +02:00
|
|
|
const CFF::FDSelect &src, /* IN */
|
2018-08-06 19:04:53 +02:00
|
|
|
unsigned int &subset_fd_count /* OUT */,
|
2018-09-13 01:08:54 +02:00
|
|
|
unsigned int &subset_fdselect_size /* OUT */,
|
|
|
|
unsigned int &subset_fdselect_format /* OUT */,
|
|
|
|
hb_vector_t<CFF::code_pair> &fdselect_ranges /* OUT */,
|
2018-09-11 01:00:20 +02:00
|
|
|
CFF::Remap &fdmap /* OUT */);
|
2018-08-06 19:04:53 +02:00
|
|
|
|
|
|
|
HB_INTERNAL bool
|
|
|
|
hb_serialize_cff_fdselect (hb_serialize_context_t *c,
|
2018-09-13 01:08:54 +02:00
|
|
|
unsigned int num_glyphs,
|
2018-08-10 20:07:07 +02:00
|
|
|
const CFF::FDSelect &src,
|
2018-08-06 19:04:53 +02:00
|
|
|
unsigned int fd_count,
|
|
|
|
unsigned int fdselect_format,
|
|
|
|
unsigned int size,
|
2018-09-13 01:08:54 +02:00
|
|
|
const hb_vector_t<CFF::code_pair> &fdselect_ranges,
|
2018-09-11 01:00:20 +02:00
|
|
|
const CFF::Remap &fdmap);
|
2018-08-06 19:04:53 +02:00
|
|
|
|
2018-08-29 22:36:39 +02:00
|
|
|
#endif /* HB_SUBSET_CFF_COMMON_HH */
|