2018-08-15 21:00:19 +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-15 22:04:43 +02:00
|
|
|
#ifndef HB_CFF_INTERP_DICT_COMMON_PRIVATE_HH
|
|
|
|
#define HB_CFF_INTERP_DICT_COMMON_PRIVATE_HH
|
2018-08-15 21:00:19 +02:00
|
|
|
|
|
|
|
#include "hb-cff-interp-common-private.hh"
|
|
|
|
|
|
|
|
namespace CFF {
|
|
|
|
|
|
|
|
using namespace OT;
|
|
|
|
|
|
|
|
/* an opstr and the parsed out dict value(s) */
|
|
|
|
struct DictVal : OpStr
|
|
|
|
{
|
|
|
|
inline void init (void)
|
|
|
|
{
|
|
|
|
single_val.set_int (0);
|
|
|
|
multi_val.init ();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void fini (void)
|
|
|
|
{
|
|
|
|
multi_val.fini ();
|
|
|
|
}
|
|
|
|
|
|
|
|
Number single_val;
|
|
|
|
hb_vector_t<Number> multi_val;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename VAL>
|
|
|
|
struct DictValues
|
|
|
|
{
|
|
|
|
inline void init (void)
|
|
|
|
{
|
|
|
|
opStart = 0;
|
|
|
|
values.init ();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void fini (void)
|
|
|
|
{
|
|
|
|
values.fini ();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void pushVal (OpCode op, const SubByteStr& substr)
|
|
|
|
{
|
|
|
|
VAL *val = values.push ();
|
|
|
|
val->op = op;
|
|
|
|
val->str = ByteStr (substr.str, opStart, substr.offset - opStart);
|
|
|
|
opStart = substr.offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void pushVal (OpCode op, const SubByteStr& substr, const VAL &v)
|
|
|
|
{
|
|
|
|
VAL *val = values.push (v);
|
|
|
|
val->op = op;
|
|
|
|
val->str = ByteStr (substr.str, opStart, substr.offset - opStart);
|
|
|
|
opStart = substr.offset;
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int opStart;
|
|
|
|
hb_vector_t<VAL> values;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct TopDictValues : DictValues<OpStr>
|
|
|
|
{
|
|
|
|
inline void init (void)
|
|
|
|
{
|
|
|
|
DictValues<OpStr>::init ();
|
|
|
|
charStringsOffset = 0;
|
|
|
|
FDArrayOffset = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline void fini (void)
|
|
|
|
{
|
|
|
|
DictValues<OpStr>::fini ();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline unsigned int calculate_serialized_op_size (const OpStr& opstr) const
|
|
|
|
{
|
|
|
|
switch (opstr.op)
|
|
|
|
{
|
|
|
|
case OpCode_CharStrings:
|
|
|
|
case OpCode_FDArray:
|
|
|
|
return OpCode_Size (OpCode_longintdict) + 4 + OpCode_Size (opstr.op);
|
|
|
|
|
|
|
|
default:
|
|
|
|
return opstr.str.len;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
unsigned int charStringsOffset;
|
|
|
|
unsigned int FDArrayOffset;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct DictOpSet : OpSet
|
|
|
|
{
|
|
|
|
static inline bool process_op (OpCode op, InterpEnv& env)
|
|
|
|
{
|
|
|
|
switch (op) {
|
|
|
|
case OpCode_longintdict: /* 5-byte integer */
|
|
|
|
return env.argStack.push_longint_from_substr (env.substr);
|
|
|
|
case OpCode_BCD: /* real number */
|
|
|
|
float v;
|
|
|
|
if (unlikely (!env.argStack.check_overflow (1) || !parse_bcd (env.substr, v)))
|
|
|
|
return false;
|
|
|
|
env.argStack.push_real (v);
|
|
|
|
return true;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return OpSet::process_op (op, env);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
struct TopDictOpSet : DictOpSet
|
|
|
|
{
|
|
|
|
static inline bool process_op (OpCode op, InterpEnv& env, TopDictValues& dictval)
|
|
|
|
{
|
|
|
|
switch (op) {
|
|
|
|
case OpCode_CharStrings:
|
|
|
|
if (unlikely (!env.argStack.check_pop_uint (dictval.charStringsOffset)))
|
|
|
|
return false;
|
|
|
|
env.argStack.clear ();
|
|
|
|
break;
|
|
|
|
case OpCode_FDArray:
|
|
|
|
if (unlikely (!env.argStack.check_pop_uint (dictval.FDArrayOffset)))
|
|
|
|
return false;
|
|
|
|
env.argStack.clear ();
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return DictOpSet::process_op (op, env);
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename OPSET, typename PARAM>
|
|
|
|
struct DictInterpreter : Interpreter<InterpEnv>
|
|
|
|
{
|
|
|
|
inline bool interpret (PARAM& param)
|
|
|
|
{
|
|
|
|
param.init ();
|
|
|
|
Interpreter<InterpEnv> &super = *this;
|
|
|
|
do
|
|
|
|
{
|
|
|
|
OpCode op;
|
|
|
|
if (unlikely (!super.fetch_op (op) || !OPSET::process_op (op, super.env, param)))
|
|
|
|
return false;
|
|
|
|
} while (super.env.substr.avail ());
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
} /* namespace CFF */
|
|
|
|
|
2018-08-15 22:04:43 +02:00
|
|
|
#endif /* HB_CFF_INTERP_DICT_COMMON_PRIVATE_HH */
|