2018-08-15 21:00:19 +02:00
|
|
|
/*
|
2018-11-12 17:47:07 +01:00
|
|
|
* Copyright © 2018 Adobe Inc.
|
2018-08-15 21:00:19 +02:00
|
|
|
*
|
|
|
|
* 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_CFF_INTERP_COMMON_HH
|
|
|
|
#define HB_CFF_INTERP_COMMON_HH
|
2018-08-15 21:00:19 +02:00
|
|
|
|
|
|
|
namespace CFF {
|
|
|
|
|
|
|
|
using namespace OT;
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
typedef unsigned int op_code_t;
|
2018-12-01 05:04:59 +01:00
|
|
|
|
|
|
|
|
2018-10-02 22:45:14 +02:00
|
|
|
/* === Dict operators === */
|
|
|
|
|
|
|
|
/* One byte operators (0-31) */
|
2018-12-01 05:04:59 +01:00
|
|
|
#define OpCode_version 0 /* CFF Top */
|
|
|
|
#define OpCode_Notice 1 /* CFF Top */
|
|
|
|
#define OpCode_FullName 2 /* CFF Top */
|
|
|
|
#define OpCode_FamilyName 3 /* CFF Top */
|
|
|
|
#define OpCode_Weight 4 /* CFF Top */
|
|
|
|
#define OpCode_FontBBox 5 /* CFF Top */
|
|
|
|
#define OpCode_BlueValues 6 /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_OtherBlues 7 /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_FamilyBlues 8 /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_FamilyOtherBlues 9 /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_StdHW 10 /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_StdVW 11 /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_escape 12 /* All. Shared with CS */
|
|
|
|
#define OpCode_UniqueID 13 /* CFF Top */
|
|
|
|
#define OpCode_XUID 14 /* CFF Top */
|
|
|
|
#define OpCode_charset 15 /* CFF Top (0) */
|
|
|
|
#define OpCode_Encoding 16 /* CFF Top (0) */
|
|
|
|
#define OpCode_CharStrings 17 /* CFF Top, CFF2 Top */
|
|
|
|
#define OpCode_Private 18 /* CFF Top, CFF2 FD */
|
|
|
|
#define OpCode_Subrs 19 /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_defaultWidthX 20 /* CFF Private (0) */
|
|
|
|
#define OpCode_nominalWidthX 21 /* CFF Private (0) */
|
|
|
|
#define OpCode_vsindexdict 22 /* CFF2 Private/CS */
|
|
|
|
#define OpCode_blenddict 23 /* CFF2 Private/CS */
|
|
|
|
#define OpCode_vstore 24 /* CFF2 Top */
|
|
|
|
#define OpCode_reserved25 25
|
|
|
|
#define OpCode_reserved26 26
|
|
|
|
#define OpCode_reserved27 27
|
2018-10-02 22:45:14 +02:00
|
|
|
|
|
|
|
/* Numbers */
|
2018-12-01 05:04:59 +01:00
|
|
|
#define OpCode_shortint 28 /* 16-bit integer, All */
|
|
|
|
#define OpCode_longintdict 29 /* 32-bit integer, All */
|
|
|
|
#define OpCode_BCD 30 /* Real number, CFF2 Top/FD */
|
|
|
|
#define OpCode_reserved31 31
|
2018-10-02 22:45:14 +02:00
|
|
|
|
|
|
|
/* 1-byte integers */
|
2018-12-01 05:04:59 +01:00
|
|
|
#define OpCode_OneByteIntFirst 32 /* All. beginning of the range of first byte ints */
|
|
|
|
#define OpCode_OneByteIntLast 246 /* All. ending of the range of first byte int */
|
2018-10-02 22:45:14 +02:00
|
|
|
|
|
|
|
/* 2-byte integers */
|
2018-12-01 05:04:59 +01:00
|
|
|
#define OpCode_TwoBytePosInt0 247 /* All. first byte of two byte positive int (+108 to +1131) */
|
|
|
|
#define OpCode_TwoBytePosInt1 248
|
|
|
|
#define OpCode_TwoBytePosInt2 249
|
|
|
|
#define OpCode_TwoBytePosInt3 250
|
2018-10-02 22:45:14 +02:00
|
|
|
|
2018-12-01 05:04:59 +01:00
|
|
|
#define OpCode_TwoByteNegInt0 251 /* All. first byte of two byte negative int (-1131 to -108) */
|
|
|
|
#define OpCode_TwoByteNegInt1 252
|
|
|
|
#define OpCode_TwoByteNegInt2 253
|
|
|
|
#define OpCode_TwoByteNegInt3 254
|
2018-10-02 22:45:14 +02:00
|
|
|
|
|
|
|
/* Two byte escape operators 12, (0-41) */
|
2018-12-01 05:04:59 +01:00
|
|
|
#define OpCode_ESC_Base 256
|
2018-12-22 16:47:04 +01:00
|
|
|
#define Make_OpCode_ESC(byte2) ((op_code_t)(OpCode_ESC_Base + (byte2)))
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
inline op_code_t Unmake_OpCode_ESC (op_code_t op) { return (op_code_t)(op - OpCode_ESC_Base); }
|
|
|
|
inline bool Is_OpCode_ESC (op_code_t op) { return op >= OpCode_ESC_Base; }
|
|
|
|
inline unsigned int OpCode_Size (op_code_t op) { return Is_OpCode_ESC (op) ? 2: 1; }
|
2018-12-01 05:04:59 +01:00
|
|
|
|
|
|
|
#define OpCode_Copyright Make_OpCode_ESC(0) /* CFF Top */
|
|
|
|
#define OpCode_isFixedPitch Make_OpCode_ESC(1) /* CFF Top (false) */
|
|
|
|
#define OpCode_ItalicAngle Make_OpCode_ESC(2) /* CFF Top (0) */
|
|
|
|
#define OpCode_UnderlinePosition Make_OpCode_ESC(3) /* CFF Top (-100) */
|
|
|
|
#define OpCode_UnderlineThickness Make_OpCode_ESC(4) /* CFF Top (50) */
|
|
|
|
#define OpCode_PaintType Make_OpCode_ESC(5) /* CFF Top (0) */
|
|
|
|
#define OpCode_CharstringType Make_OpCode_ESC(6) /* CFF Top (2) */
|
|
|
|
#define OpCode_FontMatrix Make_OpCode_ESC(7) /* CFF Top, CFF2 Top (.001 0 0 .001 0 0)*/
|
|
|
|
#define OpCode_StrokeWidth Make_OpCode_ESC(8) /* CFF Top (0) */
|
|
|
|
#define OpCode_BlueScale Make_OpCode_ESC(9) /* CFF Private, CFF2 Private (0.039625) */
|
|
|
|
#define OpCode_BlueShift Make_OpCode_ESC(10) /* CFF Private, CFF2 Private (7) */
|
|
|
|
#define OpCode_BlueFuzz Make_OpCode_ESC(11) /* CFF Private, CFF2 Private (1) */
|
|
|
|
#define OpCode_StemSnapH Make_OpCode_ESC(12) /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_StemSnapV Make_OpCode_ESC(13) /* CFF Private, CFF2 Private */
|
|
|
|
#define OpCode_ForceBold Make_OpCode_ESC(14) /* CFF Private (false) */
|
|
|
|
#define OpCode_reservedESC15 Make_OpCode_ESC(15)
|
|
|
|
#define OpCode_reservedESC16 Make_OpCode_ESC(16)
|
|
|
|
#define OpCode_LanguageGroup Make_OpCode_ESC(17) /* CFF Private, CFF2 Private (0) */
|
|
|
|
#define OpCode_ExpansionFactor Make_OpCode_ESC(18) /* CFF Private, CFF2 Private (0.06) */
|
|
|
|
#define OpCode_initialRandomSeed Make_OpCode_ESC(19) /* CFF Private (0) */
|
|
|
|
#define OpCode_SyntheticBase Make_OpCode_ESC(20) /* CFF Top */
|
|
|
|
#define OpCode_PostScript Make_OpCode_ESC(21) /* CFF Top */
|
|
|
|
#define OpCode_BaseFontName Make_OpCode_ESC(22) /* CFF Top */
|
|
|
|
#define OpCode_BaseFontBlend Make_OpCode_ESC(23) /* CFF Top */
|
|
|
|
#define OpCode_reservedESC24 Make_OpCode_ESC(24)
|
|
|
|
#define OpCode_reservedESC25 Make_OpCode_ESC(25)
|
|
|
|
#define OpCode_reservedESC26 Make_OpCode_ESC(26)
|
|
|
|
#define OpCode_reservedESC27 Make_OpCode_ESC(27)
|
|
|
|
#define OpCode_reservedESC28 Make_OpCode_ESC(28)
|
|
|
|
#define OpCode_reservedESC29 Make_OpCode_ESC(29)
|
|
|
|
#define OpCode_ROS Make_OpCode_ESC(30) /* CFF Top_CID */
|
|
|
|
#define OpCode_CIDFontVersion Make_OpCode_ESC(31) /* CFF Top_CID (0) */
|
|
|
|
#define OpCode_CIDFontRevision Make_OpCode_ESC(32) /* CFF Top_CID (0) */
|
|
|
|
#define OpCode_CIDFontType Make_OpCode_ESC(33) /* CFF Top_CID (0) */
|
|
|
|
#define OpCode_CIDCount Make_OpCode_ESC(34) /* CFF Top_CID (8720) */
|
|
|
|
#define OpCode_UIDBase Make_OpCode_ESC(35) /* CFF Top_CID */
|
|
|
|
#define OpCode_FDArray Make_OpCode_ESC(36) /* CFF Top_CID, CFF2 Top */
|
|
|
|
#define OpCode_FDSelect Make_OpCode_ESC(37) /* CFF Top_CID, CFF2 Top */
|
|
|
|
#define OpCode_FontName Make_OpCode_ESC(38) /* CFF Top_CID */
|
|
|
|
|
|
|
|
|
|
|
|
/* === CharString operators === */
|
|
|
|
|
|
|
|
#define OpCode_hstem 1 /* CFF, CFF2 */
|
|
|
|
#define OpCode_Reserved2 2
|
|
|
|
#define OpCode_vstem 3 /* CFF, CFF2 */
|
|
|
|
#define OpCode_vmoveto 4 /* CFF, CFF2 */
|
|
|
|
#define OpCode_rlineto 5 /* CFF, CFF2 */
|
|
|
|
#define OpCode_hlineto 6 /* CFF, CFF2 */
|
|
|
|
#define OpCode_vlineto 7 /* CFF, CFF2 */
|
|
|
|
#define OpCode_rrcurveto 8 /* CFF, CFF2 */
|
|
|
|
#define OpCode_Reserved9 9
|
|
|
|
#define OpCode_callsubr 10 /* CFF, CFF2 */
|
|
|
|
#define OpCode_return 11 /* CFF */
|
|
|
|
//#define OpCode_escape 12 /* CFF, CFF2 */
|
|
|
|
#define OpCode_Reserved13 13
|
|
|
|
#define OpCode_endchar 14 /* CFF */
|
|
|
|
#define OpCode_vsindexcs 15 /* CFF2 */
|
|
|
|
#define OpCode_blendcs 16 /* CFF2 */
|
|
|
|
#define OpCode_Reserved17 17
|
|
|
|
#define OpCode_hstemhm 18 /* CFF, CFF2 */
|
|
|
|
#define OpCode_hintmask 19 /* CFF, CFF2 */
|
|
|
|
#define OpCode_cntrmask 20 /* CFF, CFF2 */
|
|
|
|
#define OpCode_rmoveto 21 /* CFF, CFF2 */
|
|
|
|
#define OpCode_hmoveto 22 /* CFF, CFF2 */
|
|
|
|
#define OpCode_vstemhm 23 /* CFF, CFF2 */
|
|
|
|
#define OpCode_rcurveline 24 /* CFF, CFF2 */
|
|
|
|
#define OpCode_rlinecurve 25 /* CFF, CFF2 */
|
|
|
|
#define OpCode_vvcurveto 26 /* CFF, CFF2 */
|
|
|
|
#define OpCode_hhcurveto 27 /* CFF, CFF2 */
|
|
|
|
//#define OpCode_shortint 28 /* CFF, CFF2 */
|
|
|
|
#define OpCode_callgsubr 29 /* CFF, CFF2 */
|
|
|
|
#define OpCode_vhcurveto 30 /* CFF, CFF2 */
|
|
|
|
#define OpCode_hvcurveto 31 /* CFF, CFF2 */
|
|
|
|
|
|
|
|
#define OpCode_fixedcs 255 /* 32-bit fixed */
|
2018-10-02 22:45:14 +02:00
|
|
|
|
|
|
|
/* Two byte escape operators 12, (0-41) */
|
2018-12-01 05:04:59 +01:00
|
|
|
#define OpCode_dotsection Make_OpCode_ESC(0) /* CFF (obsoleted) */
|
|
|
|
#define OpCode_ReservedESC1 Make_OpCode_ESC(1)
|
|
|
|
#define OpCode_ReservedESC2 Make_OpCode_ESC(2)
|
|
|
|
#define OpCode_and Make_OpCode_ESC(3) /* CFF */
|
|
|
|
#define OpCode_or Make_OpCode_ESC(4) /* CFF */
|
|
|
|
#define OpCode_not Make_OpCode_ESC(5) /* CFF */
|
|
|
|
#define OpCode_ReservedESC6 Make_OpCode_ESC(6)
|
|
|
|
#define OpCode_ReservedESC7 Make_OpCode_ESC(7)
|
|
|
|
#define OpCode_ReservedESC8 Make_OpCode_ESC(8)
|
|
|
|
#define OpCode_abs Make_OpCode_ESC(9) /* CFF */
|
|
|
|
#define OpCode_add Make_OpCode_ESC(10) /* CFF */
|
|
|
|
#define OpCode_sub Make_OpCode_ESC(11) /* CFF */
|
|
|
|
#define OpCode_div Make_OpCode_ESC(12) /* CFF */
|
|
|
|
#define OpCode_ReservedESC13 Make_OpCode_ESC(13)
|
|
|
|
#define OpCode_neg Make_OpCode_ESC(14) /* CFF */
|
|
|
|
#define OpCode_eq Make_OpCode_ESC(15) /* CFF */
|
|
|
|
#define OpCode_ReservedESC16 Make_OpCode_ESC(16)
|
|
|
|
#define OpCode_ReservedESC17 Make_OpCode_ESC(17)
|
|
|
|
#define OpCode_drop Make_OpCode_ESC(18) /* CFF */
|
|
|
|
#define OpCode_ReservedESC19 Make_OpCode_ESC(19)
|
|
|
|
#define OpCode_put Make_OpCode_ESC(20) /* CFF */
|
|
|
|
#define OpCode_get Make_OpCode_ESC(21) /* CFF */
|
|
|
|
#define OpCode_ifelse Make_OpCode_ESC(22) /* CFF */
|
|
|
|
#define OpCode_random Make_OpCode_ESC(23) /* CFF */
|
|
|
|
#define OpCode_mul Make_OpCode_ESC(24) /* CFF */
|
|
|
|
//#define OpCode_reservedESC25 Make_OpCode_ESC(25)
|
|
|
|
#define OpCode_sqrt Make_OpCode_ESC(26) /* CFF */
|
|
|
|
#define OpCode_dup Make_OpCode_ESC(27) /* CFF */
|
|
|
|
#define OpCode_exch Make_OpCode_ESC(28) /* CFF */
|
|
|
|
#define OpCode_index Make_OpCode_ESC(29) /* CFF */
|
|
|
|
#define OpCode_roll Make_OpCode_ESC(30) /* CFF */
|
|
|
|
#define OpCode_reservedESC31 Make_OpCode_ESC(31)
|
|
|
|
#define OpCode_reservedESC32 Make_OpCode_ESC(32)
|
|
|
|
#define OpCode_reservedESC33 Make_OpCode_ESC(33)
|
|
|
|
#define OpCode_hflex Make_OpCode_ESC(34) /* CFF, CFF2 */
|
|
|
|
#define OpCode_flex Make_OpCode_ESC(35) /* CFF, CFF2 */
|
|
|
|
#define OpCode_hflex1 Make_OpCode_ESC(36) /* CFF, CFF2 */
|
|
|
|
#define OpCode_flex1 Make_OpCode_ESC(37) /* CFF, CFF2 */
|
|
|
|
|
|
|
|
|
|
|
|
#define OpCode_Invalid 0xFFFFu
|
|
|
|
|
2018-10-12 11:16:07 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
struct number_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-17 19:01:01 +01:00
|
|
|
void init () { set_real (0.0); }
|
|
|
|
void fini () {}
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void set_int (int v) { value = (double) v; }
|
2018-12-17 19:01:01 +01:00
|
|
|
int to_int () const { return (int) value; }
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void set_fixed (int32_t v) { value = v / 65536.0; }
|
2018-12-17 19:01:01 +01:00
|
|
|
int32_t to_fixed () const { return (int32_t) (value * 65536.0); }
|
|
|
|
|
|
|
|
void set_real (double v) { value = v; }
|
|
|
|
double to_real () const { return value; }
|
2018-09-17 20:14:56 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
int ceil () const { return (int) ::ceil (value); }
|
|
|
|
int floor () const { return (int) ::floor (value); }
|
2018-09-17 20:14:56 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
bool in_int_range () const
|
2018-12-16 20:08:10 +01:00
|
|
|
{ return ((double) (int16_t) to_int () == value); }
|
2018-09-17 20:14:56 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
bool operator > (const number_t &n) const
|
2018-12-16 20:08:10 +01:00
|
|
|
{ return value > n.to_real (); }
|
2018-09-17 20:14:56 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
bool operator < (const number_t &n) const
|
2018-09-17 20:14:56 +02:00
|
|
|
{ return n > *this; }
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
bool operator >= (const number_t &n) const
|
2018-12-16 20:08:10 +01:00
|
|
|
{ return !(*this < n); }
|
2018-09-17 20:14:56 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
bool operator <= (const number_t &n) const
|
2018-12-16 20:08:10 +01:00
|
|
|
{ return !(*this > n); }
|
2018-09-17 20:14:56 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
const number_t &operator += (const number_t &n)
|
2018-09-17 20:14:56 +02:00
|
|
|
{
|
2018-12-03 23:48:46 +01:00
|
|
|
set_real (to_real () + n.to_real ());
|
2018-10-09 00:05:36 +02:00
|
|
|
|
2018-09-17 20:14:56 +02:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
protected:
|
2018-12-03 23:48:46 +01:00
|
|
|
double value;
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* byte string */
|
|
|
|
struct UnsizedByteStr : UnsizedArrayOf <HBUINT8>
|
|
|
|
{
|
|
|
|
// encode 2-byte int (Dict/CharString) or 4-byte int (Dict)
|
|
|
|
template <typename INTTYPE, int minVal, int maxVal>
|
2018-12-22 16:47:04 +01:00
|
|
|
static bool serialize_int (hb_serialize_context_t *c, op_code_t intOp, int value)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
|
|
|
TRACE_SERIALIZE (this);
|
|
|
|
|
|
|
|
if (unlikely ((value < minVal || value > maxVal)))
|
|
|
|
return_trace (false);
|
|
|
|
|
|
|
|
HBUINT8 *p = c->allocate_size<HBUINT8> (1);
|
|
|
|
if (unlikely (p == nullptr)) return_trace (false);
|
|
|
|
p->set (intOp);
|
|
|
|
|
|
|
|
INTTYPE *ip = c->allocate_size<INTTYPE> (INTTYPE::static_size);
|
|
|
|
if (unlikely (ip == nullptr)) return_trace (false);
|
|
|
|
ip->set ((unsigned int)value);
|
|
|
|
|
|
|
|
return_trace (true);
|
|
|
|
}
|
2018-12-01 04:54:57 +01:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
static bool serialize_int4 (hb_serialize_context_t *c, int value)
|
2018-08-15 21:00:19 +02:00
|
|
|
{ return serialize_int<HBUINT32, 0, 0x7FFFFFFF> (c, OpCode_longintdict, value); }
|
2018-12-01 04:54:57 +01:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
static bool serialize_int2 (hb_serialize_context_t *c, int value)
|
2018-08-15 21:00:19 +02:00
|
|
|
{ return serialize_int<HBUINT16, 0, 0x7FFF> (c, OpCode_shortint, value); }
|
2018-11-29 02:06:11 +01:00
|
|
|
|
|
|
|
/* Defining null_size allows a Null object may be created. Should be safe because:
|
|
|
|
* A descendent struct Dict uses a Null pointer to indicate a missing table,
|
|
|
|
* checked before access.
|
2018-12-22 16:47:04 +01:00
|
|
|
* byte_str_t, a wrapper struct pairing a byte pointer along with its length, always
|
2018-11-29 02:06:11 +01:00
|
|
|
* checks the length before access. A Null pointer is used as the initial pointer
|
|
|
|
* along with zero length by the default ctor.
|
|
|
|
*/
|
|
|
|
DEFINE_SIZE_MIN(0);
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
/* Holder of a section of byte string within a CFFIndex entry */
|
|
|
|
struct byte_str_t : hb_ubytes_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
byte_str_t ()
|
|
|
|
: hb_ubytes_t () {}
|
|
|
|
byte_str_t (const UnsizedByteStr& s, unsigned int l)
|
|
|
|
: hb_ubytes_t ((const unsigned char*)&s, l) {}
|
|
|
|
byte_str_t (const unsigned char *s, unsigned int l)
|
|
|
|
: hb_ubytes_t (s, l) {}
|
|
|
|
byte_str_t (const hb_ubytes_t &ub) /* conversion from hb_ubytes_t */
|
|
|
|
: hb_ubytes_t (ub) {}
|
|
|
|
|
2018-08-15 21:00:19 +02:00
|
|
|
/* sub-string */
|
2018-12-22 16:47:04 +01:00
|
|
|
byte_str_t sub_str (unsigned int offset, unsigned int len_) const
|
|
|
|
{ return byte_str_t (hb_ubytes_t::sub_array (offset, len_)); }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool check_limit (unsigned int offset, unsigned int count) const
|
2018-12-22 16:47:04 +01:00
|
|
|
{ return (offset + count <= length); }
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
/* A byte string associated with the current offset and an error condition */
|
|
|
|
struct byte_str_ref_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
byte_str_ref_t ()
|
2018-09-04 19:25:21 +02:00
|
|
|
{ init (); }
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void init ()
|
2018-09-04 19:25:21 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
str = byte_str_t ();
|
2018-09-04 19:25:21 +02:00
|
|
|
offset = 0;
|
2018-10-12 11:16:07 +02:00
|
|
|
error = false;
|
2018-09-04 19:25:21 +02:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini () {}
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
byte_str_ref_t (const byte_str_t &str_, unsigned int offset_ = 0)
|
2018-10-12 11:16:07 +02:00
|
|
|
: str (str_), offset (offset_), error (false) {}
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
void reset (const byte_str_t &str_, unsigned int offset_ = 0)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
|
|
|
str = str_;
|
|
|
|
offset = offset_;
|
2018-10-12 11:16:07 +02:00
|
|
|
error = false;
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
const unsigned char& operator [] (int i) {
|
|
|
|
if (unlikely ((unsigned int)(offset + i) >= str.length))
|
2018-10-12 11:16:07 +02:00
|
|
|
{
|
|
|
|
set_error ();
|
2018-12-22 16:47:04 +01:00
|
|
|
return Null(unsigned char);
|
2018-10-12 11:16:07 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
return str[offset + i];
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
/* Conversion to byte_str_t */
|
|
|
|
operator byte_str_t () const { return str.sub_str (offset, str.length - offset); }
|
|
|
|
|
|
|
|
byte_str_t sub_str (unsigned int offset_, unsigned int len_) const
|
|
|
|
{ return str.sub_str (offset_, len_); }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
bool avail (unsigned int count=1) const
|
2018-12-05 21:51:18 +01:00
|
|
|
{
|
|
|
|
return (!in_error () && str.check_limit (offset, count));
|
|
|
|
}
|
2018-12-16 20:08:10 +01:00
|
|
|
void inc (unsigned int count=1)
|
2018-12-05 21:51:18 +01:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
if (likely (!in_error () && (offset <= str.length) && (offset + count <= str.length)))
|
2018-12-05 21:51:18 +01:00
|
|
|
{
|
|
|
|
offset += count;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
offset = str.length;
|
2018-12-05 21:51:18 +01:00
|
|
|
set_error ();
|
|
|
|
}
|
|
|
|
}
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void set_error () { error = true; }
|
|
|
|
bool in_error () const { return error; }
|
2018-10-12 11:16:07 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
byte_str_t str;
|
2018-08-15 21:00:19 +02:00
|
|
|
unsigned int offset; /* beginning of the sub-string within str */
|
2018-10-12 11:16:07 +02:00
|
|
|
|
|
|
|
protected:
|
2018-12-01 05:04:59 +01:00
|
|
|
bool error;
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
typedef hb_vector_t<byte_str_t> byte_str_array_t;
|
2018-11-01 06:30:34 +01:00
|
|
|
|
2018-08-15 21:00:19 +02:00
|
|
|
/* stack */
|
|
|
|
template <typename ELEM, int LIMIT>
|
2018-12-22 16:47:04 +01:00
|
|
|
struct stack_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-17 19:01:01 +01:00
|
|
|
void init ()
|
2018-09-04 19:25:21 +02:00
|
|
|
{
|
2018-10-12 11:16:07 +02:00
|
|
|
error = false;
|
2018-09-04 19:25:21 +02:00
|
|
|
count = 0;
|
|
|
|
elements.init ();
|
|
|
|
elements.resize (kSizeLimit);
|
2018-12-22 00:46:51 +01:00
|
|
|
for (unsigned int i = 0; i < elements.length; i++)
|
2018-09-04 19:25:21 +02:00
|
|
|
elements[i].init ();
|
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini ()
|
2018-09-04 19:25:21 +02:00
|
|
|
{
|
2018-10-09 00:05:36 +02:00
|
|
|
elements.fini_deep ();
|
2018-09-04 19:25:21 +02:00
|
|
|
}
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
ELEM& operator [] (unsigned int i)
|
2018-10-12 11:16:07 +02:00
|
|
|
{
|
|
|
|
if (unlikely (i >= count)) set_error ();
|
|
|
|
return elements[i];
|
|
|
|
}
|
2018-09-17 20:14:56 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void push (const ELEM &v)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 00:46:51 +01:00
|
|
|
if (likely (count < elements.length))
|
2018-08-31 22:28:16 +02:00
|
|
|
elements[count++] = v;
|
2018-10-12 11:16:07 +02:00
|
|
|
else
|
|
|
|
set_error ();
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
ELEM &push ()
|
2018-09-04 19:25:21 +02:00
|
|
|
{
|
2018-12-22 00:46:51 +01:00
|
|
|
if (likely (count < elements.length))
|
2018-09-04 19:25:21 +02:00
|
|
|
return elements[count++];
|
|
|
|
else
|
2018-10-12 11:16:07 +02:00
|
|
|
{
|
|
|
|
set_error ();
|
2018-09-04 19:25:21 +02:00
|
|
|
return Crap(ELEM);
|
2018-10-12 11:16:07 +02:00
|
|
|
}
|
2018-09-04 19:25:21 +02:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
ELEM& pop ()
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-08-31 22:28:16 +02:00
|
|
|
if (likely (count > 0))
|
|
|
|
return elements[--count];
|
2018-08-15 21:00:19 +02:00
|
|
|
else
|
2018-10-12 11:16:07 +02:00
|
|
|
{
|
|
|
|
set_error ();
|
2018-10-09 00:05:36 +02:00
|
|
|
return Crap(ELEM);
|
2018-10-12 11:16:07 +02:00
|
|
|
}
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void pop (unsigned int n)
|
2018-09-17 20:14:56 +02:00
|
|
|
{
|
|
|
|
if (likely (count >= n))
|
|
|
|
count -= n;
|
2018-10-12 11:16:07 +02:00
|
|
|
else
|
|
|
|
set_error ();
|
2018-09-17 20:14:56 +02:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
const ELEM& peek ()
|
2018-09-04 19:25:21 +02:00
|
|
|
{
|
|
|
|
if (likely (count > 0))
|
2018-09-21 21:16:36 +02:00
|
|
|
return elements[count-1];
|
2018-09-04 19:25:21 +02:00
|
|
|
else
|
2018-10-12 11:16:07 +02:00
|
|
|
{
|
|
|
|
set_error ();
|
2018-09-04 19:25:21 +02:00
|
|
|
return Null(ELEM);
|
2018-10-12 11:16:07 +02:00
|
|
|
}
|
2018-09-04 19:25:21 +02:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void unpop ()
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 00:46:51 +01:00
|
|
|
if (likely (count < elements.length))
|
2018-08-31 22:28:16 +02:00
|
|
|
count++;
|
2018-10-12 11:16:07 +02:00
|
|
|
else
|
|
|
|
set_error ();
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void clear () { count = 0; }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
bool in_error () const { return (error || elements.in_error ()); }
|
|
|
|
void set_error () { error = true; }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
unsigned int get_count () const { return count; }
|
|
|
|
bool is_empty () const { return count == 0; }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2019-01-22 12:15:23 +01:00
|
|
|
static constexpr unsigned kSizeLimit = LIMIT;
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-09-17 20:14:56 +02:00
|
|
|
protected:
|
2018-10-12 11:16:07 +02:00
|
|
|
bool error;
|
2018-08-31 22:28:16 +02:00
|
|
|
unsigned int count;
|
2018-12-27 23:56:22 +01:00
|
|
|
hb_vector_t<ELEM> elements;
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* argument stack */
|
2018-12-22 16:47:04 +01:00
|
|
|
template <typename ARG=number_t>
|
|
|
|
struct arg_stack_t : stack_t<ARG, 513>
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-16 20:08:10 +01:00
|
|
|
void push_int (int v)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-09-04 19:25:21 +02:00
|
|
|
ARG &n = S::push ();
|
2018-08-15 21:00:19 +02:00
|
|
|
n.set_int (v);
|
2018-09-04 19:25:21 +02:00
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void push_fixed (int32_t v)
|
2018-09-04 19:25:21 +02:00
|
|
|
{
|
|
|
|
ARG &n = S::push ();
|
|
|
|
n.set_fixed (v);
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void push_real (double v)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-09-04 19:25:21 +02:00
|
|
|
ARG &n = S::push ();
|
2018-08-15 21:00:19 +02:00
|
|
|
n.set_real (v);
|
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
ARG& pop_num () { return this->pop (); }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
int pop_int () { return this->pop ().to_int (); }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
unsigned int pop_uint ()
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-17 19:01:01 +01:00
|
|
|
int i = pop_int ();
|
2018-10-12 11:16:07 +02:00
|
|
|
if (unlikely (i < 0))
|
|
|
|
{
|
|
|
|
i = 0;
|
|
|
|
S::set_error ();
|
|
|
|
}
|
|
|
|
return (unsigned)i;
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
void push_longint_from_substr (byte_str_ref_t& str_ref)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
push_int ((str_ref[0] << 24) | (str_ref[1] << 16) | (str_ref[2] << 8) | (str_ref[3]));
|
|
|
|
str_ref.inc (4);
|
2018-08-22 20:36:39 +02:00
|
|
|
}
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
bool push_fixed_from_substr (byte_str_ref_t& str_ref)
|
2018-08-22 20:36:39 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
if (unlikely (!str_ref.avail (4)))
|
2018-08-22 20:36:39 +02:00
|
|
|
return false;
|
2018-12-22 16:47:04 +01:00
|
|
|
push_fixed ((int32_t)*(const HBUINT32*)&str_ref[0]);
|
|
|
|
str_ref.inc (4);
|
2018-08-15 21:00:19 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
hb_array_t<const ARG> get_subarray (unsigned int start) const
|
2018-12-06 22:36:26 +01:00
|
|
|
{
|
|
|
|
return S::elements.sub_array (start);
|
|
|
|
}
|
|
|
|
|
2018-09-01 01:28:47 +02:00
|
|
|
private:
|
2018-12-22 16:47:04 +01:00
|
|
|
typedef stack_t<ARG, 513> S;
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* an operator prefixed by its operands in a byte string */
|
2018-12-22 16:47:04 +01:00
|
|
|
struct op_str_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-17 19:01:01 +01:00
|
|
|
void init () {}
|
|
|
|
void fini () {}
|
2018-10-04 23:16:07 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
op_code_t op;
|
|
|
|
byte_str_t str;
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
/* base of OP_SERIALIZER */
|
2018-12-22 16:47:04 +01:00
|
|
|
struct op_serializer_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
|
|
|
protected:
|
2018-12-22 16:47:04 +01:00
|
|
|
bool copy_opstr (hb_serialize_context_t *c, const op_str_t& opstr) const
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
|
|
|
TRACE_SERIALIZE (this);
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
HBUINT8 *d = c->allocate_size<HBUINT8> (opstr.str.length);
|
2018-08-15 21:00:19 +02:00
|
|
|
if (unlikely (d == nullptr)) return_trace (false);
|
2018-12-22 16:47:04 +01:00
|
|
|
memcpy (d, &opstr.str[0], opstr.str.length);
|
2018-08-15 21:00:19 +02:00
|
|
|
return_trace (true);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2018-11-01 06:30:34 +01:00
|
|
|
template <typename VAL>
|
2018-12-22 16:47:04 +01:00
|
|
|
struct parsed_values_t
|
2018-11-01 06:30:34 +01:00
|
|
|
{
|
2018-12-17 19:01:01 +01:00
|
|
|
void init ()
|
2018-11-01 06:30:34 +01:00
|
|
|
{
|
|
|
|
opStart = 0;
|
|
|
|
values.init ();
|
|
|
|
}
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini () { values.fini_deep (); }
|
2018-11-01 06:30:34 +01:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
void add_op (op_code_t op, const byte_str_ref_t& str_ref = byte_str_ref_t ())
|
2018-11-01 06:30:34 +01:00
|
|
|
{
|
|
|
|
VAL *val = values.push ();
|
|
|
|
val->op = op;
|
2018-12-22 16:47:04 +01:00
|
|
|
val->str = str_ref.str.sub_str (opStart, str_ref.offset - opStart);
|
|
|
|
opStart = str_ref.offset;
|
2018-11-01 06:30:34 +01:00
|
|
|
}
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
void add_op (op_code_t op, const byte_str_ref_t& str_ref, const VAL &v)
|
2018-11-01 06:30:34 +01:00
|
|
|
{
|
|
|
|
VAL *val = values.push (v);
|
|
|
|
val->op = op;
|
2018-12-22 16:47:04 +01:00
|
|
|
val->str = str_ref.sub_str ( opStart, str_ref.offset - opStart);
|
|
|
|
opStart = str_ref.offset;
|
2018-11-01 06:30:34 +01:00
|
|
|
}
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
bool has_op (op_code_t op) const
|
2018-11-01 06:30:34 +01:00
|
|
|
{
|
|
|
|
for (unsigned int i = 0; i < get_count (); i++)
|
|
|
|
if (get_value (i).op == op) return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2018-12-22 00:46:51 +01:00
|
|
|
unsigned get_count () const { return values.length; }
|
2018-12-16 20:08:10 +01:00
|
|
|
const VAL &get_value (unsigned int i) const { return values[i]; }
|
|
|
|
const VAL &operator [] (unsigned int i) const { return get_value (i); }
|
2018-11-01 06:30:34 +01:00
|
|
|
|
|
|
|
unsigned int opStart;
|
|
|
|
hb_vector_t<VAL> values;
|
|
|
|
};
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
template <typename ARG=number_t>
|
|
|
|
struct interp_env_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
void init (const byte_str_t &str_)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
str_ref.reset (str_);
|
2018-08-15 21:00:19 +02:00
|
|
|
argStack.init ();
|
2018-10-12 11:16:07 +02:00
|
|
|
error = false;
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini () { argStack.fini (); }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
bool in_error () const
|
2018-12-22 16:47:04 +01:00
|
|
|
{ return error || str_ref.in_error () || argStack.in_error (); }
|
2018-10-12 11:16:07 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void set_error () { error = true; }
|
2018-10-12 11:16:07 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
op_code_t fetch_op ()
|
2018-08-17 22:13:18 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
op_code_t op = OpCode_Invalid;
|
|
|
|
if (unlikely (!str_ref.avail ()))
|
2018-10-12 11:16:07 +02:00
|
|
|
return OpCode_Invalid;
|
2018-12-22 16:47:04 +01:00
|
|
|
op = (op_code_t)(unsigned char)str_ref[0];
|
2018-08-17 22:13:18 +02:00
|
|
|
if (op == OpCode_escape) {
|
2018-12-22 16:47:04 +01:00
|
|
|
if (unlikely (!str_ref.avail ()))
|
2018-12-01 05:04:59 +01:00
|
|
|
return OpCode_Invalid;
|
2018-12-22 16:47:04 +01:00
|
|
|
op = Make_OpCode_ESC(str_ref[1]);
|
|
|
|
str_ref.inc ();
|
2018-08-17 22:13:18 +02:00
|
|
|
}
|
2018-12-22 16:47:04 +01:00
|
|
|
str_ref.inc ();
|
2018-10-12 11:16:07 +02:00
|
|
|
return op;
|
2018-08-17 22:13:18 +02:00
|
|
|
}
|
2018-10-09 00:05:36 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
const ARG& eval_arg (unsigned int i)
|
2018-10-09 00:05:36 +02:00
|
|
|
{
|
|
|
|
return argStack[i];
|
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
ARG& pop_arg ()
|
2018-10-09 00:05:36 +02:00
|
|
|
{
|
|
|
|
return argStack.pop ();
|
|
|
|
}
|
2018-08-17 22:13:18 +02:00
|
|
|
|
2018-12-16 20:08:10 +01:00
|
|
|
void pop_n_args (unsigned int n)
|
2018-08-31 22:28:16 +02:00
|
|
|
{
|
2018-09-17 20:14:56 +02:00
|
|
|
argStack.pop (n);
|
2018-08-31 22:28:16 +02:00
|
|
|
}
|
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void clear_args ()
|
2018-08-31 22:28:16 +02:00
|
|
|
{
|
2018-09-17 20:14:56 +02:00
|
|
|
pop_n_args (argStack.get_count ());
|
2018-08-31 22:28:16 +02:00
|
|
|
}
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
byte_str_ref_t str_ref;
|
|
|
|
arg_stack_t<ARG> argStack;
|
2018-10-12 11:16:07 +02:00
|
|
|
protected:
|
2018-12-01 05:04:59 +01:00
|
|
|
bool error;
|
2018-08-15 21:00:19 +02:00
|
|
|
};
|
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
typedef interp_env_t<> num_interp_env_t;
|
2018-09-01 01:28:47 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
template <typename ARG=number_t>
|
|
|
|
struct opset_t
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
2018-12-22 16:47:04 +01:00
|
|
|
static void process_op (op_code_t op, interp_env_t<ARG>& env)
|
2018-08-15 21:00:19 +02:00
|
|
|
{
|
|
|
|
switch (op) {
|
|
|
|
case OpCode_shortint:
|
2018-12-22 16:47:04 +01:00
|
|
|
env.argStack.push_int ((int16_t)((env.str_ref[0] << 8) | env.str_ref[1]));
|
|
|
|
env.str_ref.inc (2);
|
2018-12-01 05:04:59 +01:00
|
|
|
break;
|
2018-08-15 21:00:19 +02:00
|
|
|
|
|
|
|
case OpCode_TwoBytePosInt0: case OpCode_TwoBytePosInt1:
|
|
|
|
case OpCode_TwoBytePosInt2: case OpCode_TwoBytePosInt3:
|
2018-12-22 16:47:04 +01:00
|
|
|
env.argStack.push_int ((int16_t)((op - OpCode_TwoBytePosInt0) * 256 + env.str_ref[0] + 108));
|
|
|
|
env.str_ref.inc ();
|
2018-12-01 05:04:59 +01:00
|
|
|
break;
|
2018-12-01 04:54:57 +01:00
|
|
|
|
2018-08-15 21:00:19 +02:00
|
|
|
case OpCode_TwoByteNegInt0: case OpCode_TwoByteNegInt1:
|
|
|
|
case OpCode_TwoByteNegInt2: case OpCode_TwoByteNegInt3:
|
2018-12-22 16:47:04 +01:00
|
|
|
env.argStack.push_int ((int16_t)(-(op - OpCode_TwoByteNegInt0) * 256 - env.str_ref[0] - 108));
|
|
|
|
env.str_ref.inc ();
|
2018-12-01 05:04:59 +01:00
|
|
|
break;
|
2018-08-15 21:00:19 +02:00
|
|
|
|
|
|
|
default:
|
2018-12-01 05:04:59 +01:00
|
|
|
/* 1-byte integer */
|
|
|
|
if (likely ((OpCode_OneByteIntFirst <= op) && (op <= OpCode_OneByteIntLast)))
|
|
|
|
{
|
|
|
|
env.argStack.push_int ((int)op - 139);
|
|
|
|
} else {
|
|
|
|
/* invalid unknown operator */
|
|
|
|
env.clear_args ();
|
|
|
|
env.set_error ();
|
|
|
|
}
|
|
|
|
break;
|
2018-08-15 21:00:19 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename ENV>
|
2018-12-22 16:47:04 +01:00
|
|
|
struct interpreter_t {
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-22 16:47:04 +01:00
|
|
|
~interpreter_t() { fini (); }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
2018-12-17 19:01:01 +01:00
|
|
|
void fini () { env.fini (); }
|
2018-08-15 21:00:19 +02:00
|
|
|
|
|
|
|
ENV env;
|
|
|
|
};
|
|
|
|
|
|
|
|
} /* namespace CFF */
|
|
|
|
|
2018-08-29 22:36:39 +02:00
|
|
|
#endif /* HB_CFF_INTERP_COMMON_HH */
|