blob: 9b7ccf06a53954ce76fca37faa2f9276b3dc69e2 [file] [log] [blame]
Michiharu Ariza633ce882018-08-15 12:00:19 -07001/*
2 * Copyright © 2018 Adobe Systems Incorporated.
3 *
4 * This is part of HarfBuzz, a text shaping library.
5 *
6 * Permission is hereby granted, without written agreement and without
7 * license or royalty fees, to use, copy, modify, and distribute this
8 * software and its documentation for any purpose, provided that the
9 * above copyright notice and the following two paragraphs appear in
10 * all copies of this software.
11 *
12 * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR
13 * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
14 * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN
15 * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
16 * DAMAGE.
17 *
18 * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING,
19 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
20 * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS
21 * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO
22 * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
23 *
24 * Adobe Author(s): Michiharu Ariza
25 */
Michiharu Ariza1d1afdd2018-08-29 13:36:39 -070026#ifndef HB_CFF_INTERP_COMMON_HH
27#define HB_CFF_INTERP_COMMON_HH
Michiharu Ariza633ce882018-08-15 12:00:19 -070028
Michiharu Ariza633ce882018-08-15 12:00:19 -070029namespace CFF {
30
31using namespace OT;
32
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070033typedef unsigned int OpCode;
34/* === Dict operators === */
Michiharu Ariza633ce882018-08-15 12:00:19 -070035
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070036/* One byte operators (0-31) */
37#define OpCode_version 0 /* CFF Top */
38#define OpCode_Notice 1 /* CFF Top */
39#define OpCode_FullName 2 /* CFF Top */
40#define OpCode_FamilyName 3 /* CFF Top */
41#define OpCode_Weight 4 /* CFF Top */
42#define OpCode_FontBBox 5 /* CFF Top */
43#define OpCode_BlueValues 6 /* CFF Private, CFF2 Private */
44#define OpCode_OtherBlues 7 /* CFF Private, CFF2 Private */
45#define OpCode_FamilyBlues 8 /* CFF Private, CFF2 Private */
46#define OpCode_FamilyOtherBlues 9 /* CFF Private, CFF2 Private */
47#define OpCode_StdHW 10 /* CFF Private, CFF2 Private */
48#define OpCode_StdVW 11 /* CFF Private, CFF2 Private */
49#define OpCode_escape 12 /* All. Shared with CS */
50#define OpCode_UniqueID 13 /* CFF Top */
51#define OpCode_XUID 14 /* CFF Top */
52#define OpCode_charset 15 /* CFF Top (0) */
53#define OpCode_Encoding 16 /* CFF Top (0) */
54#define OpCode_CharStrings 17 /* CFF Top, CFF2 Top */
55#define OpCode_Private 18 /* CFF Top, CFF2 FD */
56#define OpCode_Subrs 19 /* CFF Private, CFF2 Private */
57#define OpCode_defaultWidthX 20 /* CFF Private (0) */
58#define OpCode_nominalWidthX 21 /* CFF Private (0) */
59#define OpCode_vsindexdict 22 /* CFF2 Private/CS */
60#define OpCode_blenddict 23 /* CFF2 Private/CS */
61#define OpCode_vstore 24 /* CFF2 Top */
62#define OpCode_reserved25 25
63#define OpCode_reserved26 26
64#define OpCode_reserved27 27
Michiharu Ariza633ce882018-08-15 12:00:19 -070065
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070066/* Numbers */
67#define OpCode_shortint 28 /* 16-bit integer, All */
68#define OpCode_longintdict 29 /* 32-bit integer, All */
69#define OpCode_BCD 30 /* real number, CFF2 Top/FD */
70#define OpCode_reserved31 31
Michiharu Ariza633ce882018-08-15 12:00:19 -070071
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070072/* 1-byte integers */
73#define OpCode_OneByteIntFirst 32 /* All. beginning of the range of first byte ints */
74#define OpCode_OneByteIntLast 246 /* All. ending of the range of first byte int */
Michiharu Ariza633ce882018-08-15 12:00:19 -070075
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070076/* 2-byte integers */
77#define OpCode_TwoBytePosInt0 247 /* All. first byte of two byte positive int (+108 to +1131) */
78#define OpCode_TwoBytePosInt1 248
79#define OpCode_TwoBytePosInt2 249
80#define OpCode_TwoBytePosInt3 250
Michiharu Ariza633ce882018-08-15 12:00:19 -070081
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070082#define OpCode_TwoByteNegInt0 251 /* All. first byte of two byte negative int (-1131 to -108) */
83#define OpCode_TwoByteNegInt1 252
84#define OpCode_TwoByteNegInt2 253
85#define OpCode_TwoByteNegInt3 254
Michiharu Ariza633ce882018-08-15 12:00:19 -070086
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070087/* Two byte escape operators 12, (0-41) */
88#define OpCode_ESC_Base 256
89#define Make_OpCode_ESC(byte2) ((OpCode)(OpCode_ESC_Base + (byte2)))
Michiharu Ariza633ce882018-08-15 12:00:19 -070090
Michiharu Arizaa11420b2018-08-29 12:14:30 -070091inline OpCode Unmake_OpCode_ESC (OpCode op) { return (OpCode)(op - OpCode_ESC_Base); }
92inline bool Is_OpCode_ESC (OpCode op) { return op >= OpCode_ESC_Base; }
93inline unsigned int OpCode_Size (OpCode op) { return Is_OpCode_ESC (op)? 2: 1; }
Michiharu Ariza633ce882018-08-15 12:00:19 -070094
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -070095#define OpCode_Copyright Make_OpCode_ESC(0) /* CFF Top */
96#define OpCode_isFixedPitch Make_OpCode_ESC(1) /* CFF Top (false) */
97#define OpCode_ItalicAngle Make_OpCode_ESC(2) /* CFF Top (0) */
98#define OpCode_UnderlinePosition Make_OpCode_ESC(3) /* CFF Top (-100) */
99#define OpCode_UnderlineThickness Make_OpCode_ESC(4) /* CFF Top (50) */
100#define OpCode_PaintType Make_OpCode_ESC(5) /* CFF Top (0) */
101#define OpCode_CharstringType Make_OpCode_ESC(6) /* CFF Top (2) */
102#define OpCode_FontMatrix Make_OpCode_ESC(7) /* CFF Top, CFF2 Top (.001 0 0 .001 0 0)*/
103#define OpCode_StrokeWidth Make_OpCode_ESC(8) /* CFF Top (0) */
104#define OpCode_BlueScale Make_OpCode_ESC(9) /* CFF Private, CFF2 Private (0.039625) */
105#define OpCode_BlueShift Make_OpCode_ESC(10) /* CFF Private, CFF2 Private (7) */
106#define OpCode_BlueFuzz Make_OpCode_ESC(11) /* CFF Private, CFF2 Private (1) */
107#define OpCode_StemSnapH Make_OpCode_ESC(12) /* CFF Private, CFF2 Private */
108#define OpCode_StemSnapV Make_OpCode_ESC(13) /* CFF Private, CFF2 Private */
109#define OpCode_ForceBold Make_OpCode_ESC(14) /* CFF Private (false) */
110#define OpCode_reservedESC15 Make_OpCode_ESC(15)
111#define OpCode_reservedESC16 Make_OpCode_ESC(16)
112#define OpCode_LanguageGroup Make_OpCode_ESC(17) /* CFF Private, CFF2 Private (0) */
113#define OpCode_ExpansionFactor Make_OpCode_ESC(18) /* CFF Private, CFF2 Private (0.06) */
114#define OpCode_initialRandomSeed Make_OpCode_ESC(19) /* CFF Private (0) */
115#define OpCode_SyntheticBase Make_OpCode_ESC(20) /* CFF Top */
116#define OpCode_PostScript Make_OpCode_ESC(21) /* CFF Top */
117#define OpCode_BaseFontName Make_OpCode_ESC(22) /* CFF Top */
118#define OpCode_BaseFontBlend Make_OpCode_ESC(23) /* CFF Top */
119#define OpCode_reservedESC24 Make_OpCode_ESC(24)
120#define OpCode_reservedESC25 Make_OpCode_ESC(25)
121#define OpCode_reservedESC26 Make_OpCode_ESC(26)
122#define OpCode_reservedESC27 Make_OpCode_ESC(27)
123#define OpCode_reservedESC28 Make_OpCode_ESC(28)
124#define OpCode_reservedESC29 Make_OpCode_ESC(29)
125#define OpCode_ROS Make_OpCode_ESC(30) /* CFF Top_CID */
126#define OpCode_CIDFontVersion Make_OpCode_ESC(31) /* CFF Top_CID (0) */
127#define OpCode_CIDFontRevision Make_OpCode_ESC(32) /* CFF Top_CID (0) */
128#define OpCode_CIDFontType Make_OpCode_ESC(33) /* CFF Top_CID (0) */
129#define OpCode_CIDCount Make_OpCode_ESC(34) /* CFF Top_CID (8720) */
130#define OpCode_UIDBase Make_OpCode_ESC(35) /* CFF Top_CID */
131#define OpCode_FDArray Make_OpCode_ESC(36) /* CFF Top_CID, CFF2 Top */
132#define OpCode_FDSelect Make_OpCode_ESC(37) /* CFF Top_CID, CFF2 Top */
133#define OpCode_FontName Make_OpCode_ESC(38) /* CFF Top_CID */
134
135 /* === CharString operators === */
136
137#define OpCode_hstem 1 /* CFF, CFF2 */
138#define OpCode_Reserved2 2
139#define OpCode_vstem 3 /* CFF, CFF2 */
140#define OpCode_vmoveto 4 /* CFF, CFF2 */
141#define OpCode_rlineto 5 /* CFF, CFF2 */
142#define OpCode_hlineto 6 /* CFF, CFF2 */
143#define OpCode_vlineto 7 /* CFF, CFF2 */
144#define OpCode_rrcurveto 8 /* CFF, CFF2 */
145#define OpCode_Reserved9 9
146#define OpCode_callsubr 10 /* CFF, CFF2 */
147#define OpCode_return 11 /* CFF */
148// #define OpCode_escape 12 /* CFF, CFF2 */
149#define OpCode_Reserved13 13
150#define OpCode_endchar 14 /* CFF */
151#define OpCode_vsindexcs 15 /* CFF2 */
152#define OpCode_blendcs 16 /* CFF2 */
153#define OpCode_Reserved17 17
154#define OpCode_hstemhm 18 /* CFF, CFF2 */
155#define OpCode_hintmask 19 /* CFF, CFF2 */
156#define OpCode_cntrmask 20 /* CFF, CFF2 */
157#define OpCode_rmoveto 21 /* CFF, CFF2 */
158#define OpCode_hmoveto 22 /* CFF, CFF2 */
159#define OpCode_vstemhm 23 /* CFF, CFF2 */
160#define OpCode_rcurveline 24 /* CFF, CFF2 */
161#define OpCode_rlinecurve 25 /* CFF, CFF2 */
162#define OpCode_vvcurveto 26 /* CFF, CFF2 */
163#define OpCode_hhcurveto 27 /* CFF, CFF2 */
164// #define OpCode_shortint 28 /* CFF, CFF2 */
165#define OpCode_callgsubr 29 /* CFF, CFF2 */
166#define OpCode_vhcurveto 30 /* CFF, CFF2 */
167#define OpCode_hvcurveto 31 /* CFF, CFF2 */
168
169#define OpCode_fixedcs 255 /* 32-bit fixed */
170
171/* Two byte escape operators 12, (0-41) */
172#define OpCode_ReservedESC0 Make_OpCode_ESC(0)
173#define OpCode_ReservedESC1 Make_OpCode_ESC(1)
174#define OpCode_ReservedESC2 Make_OpCode_ESC(2)
175#define OpCode_and Make_OpCode_ESC(3) /* CFF */
176#define OpCode_or Make_OpCode_ESC(4) /* CFF */
177#define OpCode_not Make_OpCode_ESC(5) /* CFF */
178#define OpCode_ReservedESC6 Make_OpCode_ESC(6)
179#define OpCode_ReservedESC7 Make_OpCode_ESC(7)
180#define OpCode_ReservedESC8 Make_OpCode_ESC(8)
181#define OpCode_abs Make_OpCode_ESC(9) /* CFF */
182#define OpCode_add Make_OpCode_ESC(10) /* CFF */
183#define OpCode_sub Make_OpCode_ESC(11) /* CFF */
184#define OpCode_div Make_OpCode_ESC(12) /* CFF */
185#define OpCode_ReservedESC13 Make_OpCode_ESC(13)
186#define OpCode_neg Make_OpCode_ESC(14) /* CFF */
187#define OpCode_eq Make_OpCode_ESC(15) /* CFF */
188#define OpCode_ReservedESC16 Make_OpCode_ESC(16)
189#define OpCode_ReservedESC17 Make_OpCode_ESC(17)
190#define OpCode_drop Make_OpCode_ESC(18) /* CFF */
191#define OpCode_ReservedESC19 Make_OpCode_ESC(19)
192#define OpCode_put Make_OpCode_ESC(20) /* CFF */
193#define OpCode_get Make_OpCode_ESC(21) /* CFF */
194#define OpCode_ifelse Make_OpCode_ESC(22) /* CFF */
195#define OpCode_random Make_OpCode_ESC(23) /* CFF */
196#define OpCode_mul Make_OpCode_ESC(24) /* CFF */
197// #define OpCode_reservedESC25 Make_OpCode_ESC(25)
198#define OpCode_sqrt Make_OpCode_ESC(26) /* CFF */
199#define OpCode_dup Make_OpCode_ESC(27) /* CFF */
200#define OpCode_exch Make_OpCode_ESC(28) /* CFF */
201#define OpCode_index Make_OpCode_ESC(29) /* CFF */
202#define OpCode_roll Make_OpCode_ESC(30) /* CFF */
203#define OpCode_reservedESC31 Make_OpCode_ESC(31)
204#define OpCode_reservedESC32 Make_OpCode_ESC(32)
205#define OpCode_reservedESC33 Make_OpCode_ESC(33)
206#define OpCode_hflex Make_OpCode_ESC(34) /* CFF, CFF2 */
207#define OpCode_flex Make_OpCode_ESC(35) /* CFF, CFF2 */
208#define OpCode_hflex1 Make_OpCode_ESC(36) /* CFF, CFF2 */
209#define OpCode_flex1 Make_OpCode_ESC(37) /* CFF, CFF2 */
210
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700211#define OpCode_Invalid 65535
212
Michiharu Ariza633ce882018-08-15 12:00:19 -0700213struct Number
214{
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700215 inline void init (void)
216 { set_int (0); }
217 inline void fini (void)
218 {}
Michiharu Ariza633ce882018-08-15 12:00:19 -0700219
Michiharu Arizaa11420b2018-08-29 12:14:30 -0700220 inline void set_int (int v) { format = NumInt; u.int_val = v; };
221 inline int to_int (void) const { return is_int ()? u.int_val: (int)to_real (); }
222 inline void set_fixed (int32_t v) { format = NumFixed; u.fixed_val = v; };
223 inline int32_t to_fixed (void) const
224 {
225 if (is_fixed ())
226 return u.fixed_val;
227 else if (is_real ())
Michiharu Ariza0222d572018-10-04 09:37:57 -0700228 return (int32_t)(u.real_val * 65536.0f);
Michiharu Arizaa11420b2018-08-29 12:14:30 -0700229 else
230 return (int32_t)(u.int_val << 16);
231 }
232 inline void set_real (float v) { format = NumReal; u.real_val = v; };
233 inline float to_real (void) const
234 {
235 if (is_real ())
236 return u.real_val;
237 if (is_fixed ())
Michiharu Ariza0222d572018-10-04 09:37:57 -0700238 return u.fixed_val / 65536.0f;
Michiharu Arizaa11420b2018-08-29 12:14:30 -0700239 else
240 return (float)u.int_val;
241 }
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700242
243 inline int ceil (void) const
244 {
245 switch (format)
246 {
247 default:
248 case NumInt:
249 return u.int_val;
250 case NumFixed:
251 return (u.fixed_val + 0xFFFF) >> 16;
252 case NumReal:
253 return (int)ceilf (u.real_val);
254 }
255 }
256
257 inline int floor (void) const
258 {
259 switch (format)
260 {
261 default:
262 case NumInt:
263 return u.int_val;
264 case NumFixed:
265 return u.fixed_val >> 16;
266 case NumReal:
267 return (int)floorf (u.real_val);
268 }
269 }
270
Michiharu Arizaa11420b2018-08-29 12:14:30 -0700271 inline bool in_int_range (void) const
272 {
273 if (is_int ())
274 return true;
275 if (is_fixed () && ((u.fixed_val & 0xFFFF) == 0))
276 return true;
277 else
278 return ((float)(int16_t)to_int () == u.real_val);
279 }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700280
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700281 inline bool operator > (const Number &n) const
282 {
283 switch (format)
284 {
285 default:
286 case NumInt: return u.int_val > n.to_int ();
287 case NumFixed: return u.fixed_val > n.to_fixed ();
288 case NumReal: return u.real_val > n.to_real ();
289 }
290 }
291
292 inline bool operator < (const Number &n) const
293 { return n > *this; }
294
295 inline bool operator >= (const Number &n) const
296 { return ! (*this < n); }
297
298 inline bool operator <= (const Number &n) const
299 { return ! (*this > n); }
300
301 inline const Number &operator += (const Number &n)
302 {
Michiharu Arizab51418f2018-10-08 15:05:36 -0700303 if (format == NumReal || n.format == NumReal)
304 set_real (to_real () + n.to_real ());
305 else if (format == NumFixed || n.format == NumFixed)
306 set_fixed (to_fixed () + n.to_fixed ());
307 else
308 set_int (to_int () + n.to_int ());
309
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700310 return *this;
311 }
312
Michiharu Ariza633ce882018-08-15 12:00:19 -0700313protected:
Michiharu Arizaa11420b2018-08-29 12:14:30 -0700314 enum NumFormat {
315 NumInt,
316 NumFixed,
317 NumReal
318 };
319 NumFormat format;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700320 union {
321 int int_val;
Michiharu Arizaa11420b2018-08-29 12:14:30 -0700322 int32_t fixed_val;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700323 float real_val;
324 } u;
Michiharu Arizaa11420b2018-08-29 12:14:30 -0700325
326 inline bool is_int (void) const { return format == NumInt; }
327 inline bool is_fixed (void) const { return format == NumFixed; }
328 inline bool is_real (void) const { return format == NumReal; }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700329};
330
331/* byte string */
332struct UnsizedByteStr : UnsizedArrayOf <HBUINT8>
333{
334 // encode 2-byte int (Dict/CharString) or 4-byte int (Dict)
335 template <typename INTTYPE, int minVal, int maxVal>
336 inline static bool serialize_int (hb_serialize_context_t *c, OpCode intOp, int value)
337 {
338 TRACE_SERIALIZE (this);
339
340 if (unlikely ((value < minVal || value > maxVal)))
341 return_trace (false);
342
343 HBUINT8 *p = c->allocate_size<HBUINT8> (1);
344 if (unlikely (p == nullptr)) return_trace (false);
345 p->set (intOp);
346
347 INTTYPE *ip = c->allocate_size<INTTYPE> (INTTYPE::static_size);
348 if (unlikely (ip == nullptr)) return_trace (false);
349 ip->set ((unsigned int)value);
350
351 return_trace (true);
352 }
353
354 inline static bool serialize_int4 (hb_serialize_context_t *c, int value)
355 { return serialize_int<HBUINT32, 0, 0x7FFFFFFF> (c, OpCode_longintdict, value); }
356
357 inline static bool serialize_int2 (hb_serialize_context_t *c, int value)
358 { return serialize_int<HBUINT16, 0, 0x7FFF> (c, OpCode_shortint, value); }
359};
360
361struct ByteStr
362{
363 inline ByteStr (void)
364 : str (&Null(UnsizedByteStr)), len (0) {}
365 inline ByteStr (const UnsizedByteStr& s, unsigned int l)
366 : str (&s), len (l) {}
367 inline ByteStr (const char *s, unsigned int l=0)
368 : str ((const UnsizedByteStr *)s), len (l) {}
369 /* sub-string */
370 inline ByteStr (const ByteStr &bs, unsigned int offset, unsigned int len_)
371 {
372 str = (const UnsizedByteStr *)&bs.str[offset];
373 len = len_;
374 }
375
376 inline bool sanitize (hb_sanitize_context_t *c) const { return str->sanitize (c, len); }
377
378 inline const HBUINT8& operator [] (unsigned int i) const {
379 assert (str && (i < len));
380 return (*str)[i];
381 }
382
383 inline bool serialize (hb_serialize_context_t *c, const ByteStr &src)
384 {
385 TRACE_SERIALIZE (this);
386 HBUINT8 *dest = c->allocate_size<HBUINT8> (src.len);
387 if (unlikely (dest == nullptr))
388 return_trace (false);
389 memcpy (dest, src.str, src.len);
390 return_trace (true);
391 }
392
393 inline unsigned int get_size (void) const { return len; }
394
395 inline bool check_limit (unsigned int offset, unsigned int count) const
396 { return (offset + count <= len); }
397
398 const UnsizedByteStr *str;
399 unsigned int len;
400};
401
402struct SubByteStr
403{
404 inline SubByteStr (void)
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700405 { init (); }
406
407 inline void init (void)
408 {
409 str = ByteStr (0);
410 offset = 0;
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700411 error = false;
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700412 }
413
414 inline void fini (void) {}
Michiharu Ariza633ce882018-08-15 12:00:19 -0700415
416 inline SubByteStr (const ByteStr &str_, unsigned int offset_ = 0)
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700417 : str (str_), offset (offset_), error (false) {}
Michiharu Ariza633ce882018-08-15 12:00:19 -0700418
419 inline void reset (const ByteStr &str_, unsigned int offset_ = 0)
420 {
421 str = str_;
422 offset = offset_;
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700423 error = false;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700424 }
425
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700426 inline const HBUINT8& operator [] (int i) {
427 if (unlikely ((unsigned int)(offset + i) >= str.len))
428 {
429 set_error ();
430 return Null(HBUINT8);
431 }
432 else
433 return str[offset + i];
Michiharu Ariza633ce882018-08-15 12:00:19 -0700434 }
435
436 inline operator ByteStr (void) const { return ByteStr (str, offset, str.len - offset); }
437
438 inline bool avail (unsigned int count=1) const { return str.check_limit (offset, count); }
439 inline void inc (unsigned int count=1) { offset += count; assert (count <= str.len); }
440
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700441 inline void set_error (void) { error = true; }
442 inline bool in_error (void) const { return error; }
443
Michiharu Ariza633ce882018-08-15 12:00:19 -0700444 ByteStr str;
445 unsigned int offset; /* beginning of the sub-string within str */
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700446
447 protected:
448 bool error;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700449};
450
Michiharu Ariza633ce882018-08-15 12:00:19 -0700451/* stack */
452template <typename ELEM, int LIMIT>
453struct Stack
454{
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700455 inline void init (void)
456 {
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700457 error = false;
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700458 count = 0;
459 elements.init ();
460 elements.resize (kSizeLimit);
461 for (unsigned int i = 0; i < elements.len; i++)
462 elements[i].init ();
463 }
464
465 inline void fini (void)
466 {
Michiharu Arizab51418f2018-10-08 15:05:36 -0700467 elements.fini_deep ();
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700468 }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700469
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700470 inline ELEM& operator [] (unsigned int i)
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700471 {
472 if (unlikely (i >= count)) set_error ();
473 return elements[i];
474 }
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700475
Michiharu Ariza633ce882018-08-15 12:00:19 -0700476 inline void push (const ELEM &v)
477 {
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700478 if (likely (count < elements.len))
Michiharu Ariza968168b2018-08-31 13:28:16 -0700479 elements[count++] = v;
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700480 else
481 set_error ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700482 }
483
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700484 inline ELEM &push (void)
485 {
486 if (likely (count < elements.len))
487 return elements[count++];
488 else
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700489 {
490 set_error ();
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700491 return Crap(ELEM);
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700492 }
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700493 }
494
Michiharu Arizab51418f2018-10-08 15:05:36 -0700495 inline ELEM& pop (void)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700496 {
Michiharu Ariza968168b2018-08-31 13:28:16 -0700497 if (likely (count > 0))
498 return elements[--count];
Michiharu Ariza633ce882018-08-15 12:00:19 -0700499 else
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700500 {
501 set_error ();
Michiharu Arizab51418f2018-10-08 15:05:36 -0700502 return Crap(ELEM);
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700503 }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700504 }
505
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700506 inline void pop (unsigned int n)
507 {
508 if (likely (count >= n))
509 count -= n;
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700510 else
511 set_error ();
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700512 }
513
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700514 inline const ELEM& peek (void)
515 {
516 if (likely (count > 0))
Michiharu Ariza76e54d22018-09-21 12:16:36 -0700517 return elements[count-1];
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700518 else
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700519 {
520 set_error ();
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700521 return Null(ELEM);
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700522 }
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700523 }
524
Michiharu Ariza633ce882018-08-15 12:00:19 -0700525 inline void unpop (void)
526 {
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700527 if (likely (count < elements.len))
Michiharu Ariza968168b2018-08-31 13:28:16 -0700528 count++;
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700529 else
530 set_error ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700531 }
532
Michiharu Ariza968168b2018-08-31 13:28:16 -0700533 inline void clear (void) { count = 0; }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700534
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700535 inline bool in_error (void) const { return (error || elements.in_error ()); }
536 inline void set_error (void) { error = true; }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700537
Michiharu Ariza968168b2018-08-31 13:28:16 -0700538 inline unsigned int get_count (void) const { return count; }
539 inline bool is_empty (void) const { return count == 0; }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700540
541 static const unsigned int kSizeLimit = LIMIT;
542
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700543 protected:
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700544 bool error;
Michiharu Ariza968168b2018-08-31 13:28:16 -0700545 unsigned int count;
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700546 hb_vector_t<ELEM, kSizeLimit> elements;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700547};
548
549/* argument stack */
Michiharu Arizafcf17782018-08-31 16:28:47 -0700550template <typename ARG=Number>
551struct ArgStack : Stack<ARG, 513>
Michiharu Ariza633ce882018-08-15 12:00:19 -0700552{
553 inline void push_int (int v)
554 {
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700555 ARG &n = S::push ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700556 n.set_int (v);
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700557 }
558
559 inline void push_fixed (int32_t v)
560 {
561 ARG &n = S::push ();
562 n.set_fixed (v);
Michiharu Ariza633ce882018-08-15 12:00:19 -0700563 }
564
565 inline void push_real (float v)
566 {
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700567 ARG &n = S::push ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700568 n.set_real (v);
Michiharu Ariza633ce882018-08-15 12:00:19 -0700569 }
570
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700571 inline ARG& pop_num (void)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700572 {
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700573 return this->pop ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700574 }
575
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700576 inline void pop_num2 (ARG& n1, ARG& n2)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700577 {
Michiharu Ariza633ce882018-08-15 12:00:19 -0700578 n2 = this->pop ();
579 n1 = this->pop ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700580 }
581
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700582 inline int pop_int (void)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700583 {
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700584 return this->pop ().to_int ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700585 }
586
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700587 inline unsigned int pop_uint (void)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700588 {
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700589
590 int i = pop_int ();
591 if (unlikely (i < 0))
592 {
593 i = 0;
594 S::set_error ();
595 }
596 return (unsigned)i;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700597 }
598
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700599 inline void pop_delta (hb_vector_t<ARG>& vec, bool even=false)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700600 {
Michiharu Ariza968168b2018-08-31 13:28:16 -0700601 if (even && unlikely ((this->count & 1) != 0))
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700602 {
603 S::set_error ();
604 return;
605 }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700606
607 float val = 0.0f;
Michiharu Arizafcf17782018-08-31 16:28:47 -0700608 for (unsigned int i = 0; i < S::count; i++) {
609 val += S::elements[i].to_real ();
610 ARG *n = vec.push ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700611 n->set_real (val);
612 }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700613 }
614
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700615 inline void push_longint_from_substr (SubByteStr& substr)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700616 {
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700617 push_int ((substr[0] << 24) | (substr[1] << 16) | (substr[2] << 8) | (substr[3]));
Michiharu Ariza633ce882018-08-15 12:00:19 -0700618 substr.inc (4);
Michiharu Ariza633ce882018-08-15 12:00:19 -0700619 }
620
Michiharu Ariza27c32d82018-08-22 11:36:39 -0700621 inline bool push_fixed_from_substr (SubByteStr& substr)
622 {
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700623 if (unlikely (!substr.avail (4)))
Michiharu Ariza27c32d82018-08-22 11:36:39 -0700624 return false;
Michiharu Arizaf2d299b2018-09-04 10:25:21 -0700625 push_fixed ((int32_t)*(const HBUINT32*)&substr[0]);
Michiharu Ariza27c32d82018-08-22 11:36:39 -0700626 substr.inc (4);
627 return true;
628 }
629
Michiharu Ariza633ce882018-08-15 12:00:19 -0700630 inline void reverse_range (int i, int j)
631 {
Michiharu Ariza83c52982018-10-09 21:59:36 -0700632 assert (i >= 0 && i <= j);
Michiharu Arizafcf17782018-08-31 16:28:47 -0700633 ARG tmp;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700634 while (i < j)
635 {
Michiharu Arizafcf17782018-08-31 16:28:47 -0700636 tmp = S::elements[i];
637 S::elements[i++] = S::elements[j];
Michiharu Ariza83c52982018-10-09 21:59:36 -0700638 S::elements[j--] = tmp;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700639 }
640 }
Michiharu Arizafcf17782018-08-31 16:28:47 -0700641
642 private:
643 typedef Stack<ARG, 513> S;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700644};
645
646/* an operator prefixed by its operands in a byte string */
647struct OpStr
648{
Michiharu Arizae7a045e2018-10-04 14:16:07 -0700649 inline void init (void) {}
650 inline void fini (void) {}
651
Michiharu Ariza633ce882018-08-15 12:00:19 -0700652 OpCode op;
653 ByteStr str;
654};
655
656/* base of OP_SERIALIZER */
657struct OpSerializer
658{
659 protected:
660 inline bool copy_opstr (hb_serialize_context_t *c, const OpStr& opstr) const
661 {
662 TRACE_SERIALIZE (this);
663
664 HBUINT8 *d = c->allocate_size<HBUINT8> (opstr.str.len);
665 if (unlikely (d == nullptr)) return_trace (false);
666 memcpy (d, &opstr.str.str[0], opstr.str.len);
667 return_trace (true);
668 }
669};
670
Michiharu Arizafcf17782018-08-31 16:28:47 -0700671template <typename ARG=Number>
Michiharu Ariza633ce882018-08-15 12:00:19 -0700672struct InterpEnv
673{
674 inline void init (const ByteStr &str_)
675 {
676 substr.reset (str_);
677 argStack.init ();
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700678 error = false;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700679 }
680
681 inline void fini (void)
682 {
683 argStack.fini ();
684 }
685
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700686 inline bool in_error (void) const
Michiharu Arizacef75ea2018-08-17 13:13:18 -0700687 {
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700688 return error || substr.in_error () || argStack.in_error ();
689 }
690
691 inline void set_error (void) { error = true; }
692
693 inline OpCode fetch_op (void)
694 {
695 OpCode op = OpCode_Reserved2;
Michiharu Arizacef75ea2018-08-17 13:13:18 -0700696 if (unlikely (!substr.avail ()))
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700697 return OpCode_Invalid;
Michiharu Arizacef75ea2018-08-17 13:13:18 -0700698 op = (OpCode)(unsigned char)substr[0];
699 if (op == OpCode_escape) {
700 if (unlikely (!substr.avail ()))
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700701 return OpCode_Invalid;
Michiharu Arizaeed7e6b2018-10-02 13:45:14 -0700702 op = Make_OpCode_ESC(substr[1]);
Michiharu Arizacef75ea2018-08-17 13:13:18 -0700703 substr.inc ();
704 }
705 substr.inc ();
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700706 return op;
Michiharu Arizacef75ea2018-08-17 13:13:18 -0700707 }
708
Michiharu Arizab51418f2018-10-08 15:05:36 -0700709 inline const ARG& eval_arg (unsigned int i)
710 {
711 return argStack[i];
712 }
713
714 inline ARG& pop_arg (void)
715 {
716 return argStack.pop ();
717 }
718
Michiharu Ariza968168b2018-08-31 13:28:16 -0700719 inline void pop_n_args (unsigned int n)
720 {
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700721 assert (n <= argStack.get_count ());
722 argStack.pop (n);
Michiharu Ariza968168b2018-08-31 13:28:16 -0700723 }
724
725 inline void clear_args (void)
726 {
Michiharu Arizac0c85b82018-09-17 11:14:56 -0700727 pop_n_args (argStack.get_count ());
Michiharu Ariza968168b2018-08-31 13:28:16 -0700728 }
729
Michiharu Ariza633ce882018-08-15 12:00:19 -0700730 SubByteStr substr;
Michiharu Arizafcf17782018-08-31 16:28:47 -0700731 ArgStack<ARG> argStack;
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700732 protected:
733 bool error;
Michiharu Ariza633ce882018-08-15 12:00:19 -0700734};
735
Michiharu Arizafcf17782018-08-31 16:28:47 -0700736typedef InterpEnv<> NumInterpEnv;
737
738template <typename ARG=Number>
Michiharu Ariza633ce882018-08-15 12:00:19 -0700739struct OpSet
740{
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700741 static inline void process_op (OpCode op, InterpEnv<ARG>& env)
Michiharu Ariza633ce882018-08-15 12:00:19 -0700742 {
743 switch (op) {
744 case OpCode_shortint:
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700745 env.argStack.push_int ((env.substr[0] << 8) | env.substr[1]);
Michiharu Ariza633ce882018-08-15 12:00:19 -0700746 env.substr.inc (2);
747 break;
748
749 case OpCode_TwoBytePosInt0: case OpCode_TwoBytePosInt1:
750 case OpCode_TwoBytePosInt2: case OpCode_TwoBytePosInt3:
Michiharu Ariza633ce882018-08-15 12:00:19 -0700751 env.argStack.push_int ((int16_t)((op - OpCode_TwoBytePosInt0) * 256 + env.substr[0] + 108));
752 env.substr.inc ();
753 break;
754
755 case OpCode_TwoByteNegInt0: case OpCode_TwoByteNegInt1:
756 case OpCode_TwoByteNegInt2: case OpCode_TwoByteNegInt3:
Michiharu Ariza633ce882018-08-15 12:00:19 -0700757 env.argStack.push_int ((int16_t)(-(op - OpCode_TwoByteNegInt0) * 256 - env.substr[0] - 108));
758 env.substr.inc ();
759 break;
760
761 default:
762 /* 1-byte integer */
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700763 if (likely ((OpCode_OneByteIntFirst <= op) && (op <= OpCode_OneByteIntLast)))
Michiharu Ariza633ce882018-08-15 12:00:19 -0700764 {
765 env.argStack.push_int ((int)op - 139);
766 } else {
767 /* invalid unknown operator */
Michiharu Ariza968168b2018-08-31 13:28:16 -0700768 env.clear_args ();
Michiharu Ariza7d99a6c2018-10-12 02:16:07 -0700769 env.set_error ();
Michiharu Ariza633ce882018-08-15 12:00:19 -0700770 }
771 break;
772 }
Michiharu Ariza633ce882018-08-15 12:00:19 -0700773 }
774};
775
776template <typename ENV>
777struct Interpreter {
778
779 inline ~Interpreter(void) { fini (); }
780
781 inline void fini (void) { env.fini (); }
782
Michiharu Ariza633ce882018-08-15 12:00:19 -0700783 ENV env;
784};
785
786} /* namespace CFF */
787
Michiharu Ariza1d1afdd2018-08-29 13:36:39 -0700788#endif /* HB_CFF_INTERP_COMMON_HH */