1 /****************************************************************************
5 * CFF token stream parser (body)
7 * Copyright (C) 1996-2019 by
8 * David Turner, Robert Wilhelm, and Werner Lemberg.
10 * This file is part of the FreeType project, and may only be used,
11 * modified, and distributed under the terms of the FreeType project
12 * license, LICENSE.TXT. By continuing to use, modify, or distribute
13 * this file you indicate that you have read the license and
14 * understand and accept it fully.
21 #include FT_INTERNAL_STREAM_H
22 #include FT_INTERNAL_DEBUG_H
23 #include FT_INTERNAL_CALC_H
24 #include FT_INTERNAL_POSTSCRIPT_AUX_H
31 /**************************************************************************
33 * The macro FT_COMPONENT is used in trace mode. It is an implicit
34 * parameter of the FT_TRACE() and FT_ERROR() macros, used to print/log
35 * messages during execution.
38 #define FT_COMPONENT cffparse
41 FT_LOCAL_DEF( FT_Error )
42 cff_parser_init( CFF_Parser parser,
47 FT_UShort num_designs,
50 FT_Memory memory = library->memory; /* for FT_NEW_ARRAY */
51 FT_Error error; /* for FT_NEW_ARRAY */
57 parser->top = parser->stack;
59 parser->object_code = code;
60 parser->object = object;
61 parser->library = library;
62 parser->num_designs = num_designs;
63 parser->num_axes = num_axes;
65 /* allocate the stack buffer */
66 if ( FT_NEW_ARRAY( parser->stack, stackSize ) )
68 FT_FREE( parser->stack );
72 parser->stackSize = stackSize;
73 parser->top = parser->stack; /* empty stack */
80 #ifdef CFF_CONFIG_OPTION_OLD_ENGINE
82 finalize_t2_strings( FT_Memory memory,
86 CFF_T2_String t2 = (CFF_T2_String)data;
91 memory->free( memory, t2->start );
92 memory->free( memory, data );
94 #endif /* CFF_CONFIG_OPTION_OLD_ENGINE */
98 cff_parser_done( CFF_Parser parser )
100 FT_Memory memory = parser->library->memory; /* for FT_FREE */
103 FT_FREE( parser->stack );
105 #ifdef CFF_CONFIG_OPTION_OLD_ENGINE
106 FT_List_Finalize( &parser->t2_strings,
114 /* Assuming `first >= last'. */
117 cff_parser_within_limits( CFF_Parser parser,
121 #ifndef CFF_CONFIG_OPTION_OLD_ENGINE
123 /* Fast path for regular FreeType builds with the "new" engine; */
124 /* `first >= parser->start' can be assumed. */
128 return last < parser->limit ? FT_Err_Ok : FT_THROW( Invalid_Argument );
130 #else /* CFF_CONFIG_OPTION_OLD_ENGINE */
135 if ( first >= parser->start &&
136 last < parser->limit )
139 node = parser->t2_strings.head;
143 CFF_T2_String t2 = (CFF_T2_String)node->data;
146 if ( first >= t2->start &&
153 return FT_THROW( Invalid_Argument );
155 #endif /* CFF_CONFIG_OPTION_OLD_ENGINE */
159 /* read an integer */
161 cff_parse_integer( CFF_Parser parser,
171 if ( cff_parser_within_limits( parser, p, p + 1 ) )
174 val = (FT_Short)( ( (FT_UShort)p[0] << 8 ) | p[1] );
178 if ( cff_parser_within_limits( parser, p, p + 3 ) )
181 val = (FT_Long)( ( (FT_ULong)p[0] << 24 ) |
182 ( (FT_ULong)p[1] << 16 ) |
183 ( (FT_ULong)p[2] << 8 ) |
192 if ( cff_parser_within_limits( parser, p, p ) )
195 val = ( v - 247 ) * 256 + p[0] + 108;
199 if ( cff_parser_within_limits( parser, p, p ) )
202 val = -( v - 251 ) * 256 - p[0] - 108;
210 FT_TRACE4(( "!!!END OF DATA:!!!" ));
215 static const FT_Long power_tens[] =
229 /* maximum values allowed for multiplying */
230 /* with the corresponding `power_tens' element */
231 static const FT_Long power_ten_limits[] =
237 FT_LONG_MAX / 10000L,
238 FT_LONG_MAX / 100000L,
239 FT_LONG_MAX / 1000000L,
240 FT_LONG_MAX / 10000000L,
241 FT_LONG_MAX / 100000000L,
242 FT_LONG_MAX / 1000000000L,
248 cff_parse_real( CFF_Parser parser,
257 FT_Long result, number, exponent;
258 FT_Int sign = 0, exponent_sign = 0, have_overflow = 0;
259 FT_Long exponent_add, integer_length, fraction_length;
274 /* First of all, read the integer part. */
279 /* If we entered this iteration with phase == 4, we need to */
280 /* read a new byte. This also skips past the initial 0x1E. */
285 /* Make sure we don't read past the end. */
286 if ( cff_parser_within_limits( parser, p, p ) )
290 /* Get the nibble. */
291 nib = (FT_Int)( p[0] >> phase ) & 0xF;
300 /* Increase exponent if we can't add the digit. */
301 if ( number >= 0xCCCCCCCL )
303 /* Skip leading zeros. */
304 else if ( nib || number )
307 number = number * 10 + nib;
312 /* Read fraction part, if any. */
316 /* If we entered this iteration with phase == 4, we need */
317 /* to read a new byte. */
322 /* Make sure we don't read past the end. */
323 if ( cff_parser_within_limits( parser, p, p ) )
327 /* Get the nibble. */
328 nib = ( p[0] >> phase ) & 0xF;
333 /* Skip leading zeros if possible. */
334 if ( !nib && !number )
336 /* Only add digit if we don't overflow. */
337 else if ( number < 0xCCCCCCCL && fraction_length < 9 )
340 number = number * 10 + nib;
344 /* Read exponent, if any. */
355 /* If we entered this iteration with phase == 4, */
356 /* we need to read a new byte. */
361 /* Make sure we don't read past the end. */
362 if ( cff_parser_within_limits( parser, p, p ) )
366 /* Get the nibble. */
367 nib = ( p[0] >> phase ) & 0xF;
372 /* Arbitrarily limit exponent. */
373 if ( exponent > 1000 )
376 exponent = exponent * 10 + nib;
380 exponent = -exponent;
394 /* We don't check `power_ten' and `exponent_add'. */
395 exponent += power_ten + exponent_add;
399 /* Only use `fraction_length'. */
400 fraction_length += integer_length;
401 exponent += integer_length;
403 if ( fraction_length <= 5 )
405 if ( number > 0x7FFFL )
407 result = FT_DivFix( number, 10 );
408 *scaling = exponent - fraction_length + 1;
414 FT_Long new_fraction_length, shift;
417 /* Make `scaling' as small as possible. */
418 new_fraction_length = FT_MIN( exponent, 5 );
419 shift = new_fraction_length - fraction_length;
423 exponent -= new_fraction_length;
424 number *= power_tens[shift];
425 if ( number > 0x7FFFL )
432 exponent -= fraction_length;
435 exponent -= fraction_length;
437 result = (FT_Long)( (FT_ULong)number << 16 );
443 if ( ( number / power_tens[fraction_length - 5] ) > 0x7FFFL )
445 result = FT_DivFix( number, power_tens[fraction_length - 4] );
446 *scaling = exponent - 4;
450 result = FT_DivFix( number, power_tens[fraction_length - 5] );
451 *scaling = exponent - 5;
457 integer_length += exponent;
458 fraction_length -= exponent;
460 if ( integer_length > 5 )
462 if ( integer_length < -5 )
465 /* Remove non-significant digits. */
466 if ( integer_length < 0 )
468 number /= power_tens[-integer_length];
469 fraction_length += integer_length;
472 /* this can only happen if exponent was non-zero */
473 if ( fraction_length == 10 )
476 fraction_length -= 1;
479 /* Convert into 16.16 format. */
480 if ( fraction_length > 0 )
482 if ( ( number / power_tens[fraction_length] ) > 0x7FFFL )
485 result = FT_DivFix( number, power_tens[fraction_length] );
489 number *= power_tens[-fraction_length];
491 if ( number > 0x7FFFL )
494 result = (FT_Long)( (FT_ULong)number << 16 );
505 result = 0x7FFFFFFFL;
506 FT_TRACE4(( "!!!OVERFLOW:!!!" ));
511 FT_TRACE4(( "!!!UNDERFLOW:!!!" ));
516 FT_TRACE4(( "!!!END OF DATA:!!!" ));
521 /* read a number, either integer or real */
522 FT_LOCAL_DEF( FT_Long )
523 cff_parse_num( CFF_Parser parser,
528 /* binary-coded decimal is truncated to integer */
529 return cff_parse_real( parser, *d, 0, NULL ) >> 16;
532 else if ( **d == 255 )
534 /* 16.16 fixed point is used internally for CFF2 blend results. */
535 /* Since these are trusted values, a limit check is not needed. */
537 /* After the 255, 4 bytes give the number. */
538 /* The blend value is converted to integer, with rounding; */
539 /* due to the right-shift we don't need the lowest byte. */
542 ( ( ( (FT_UInt32)*( d[0] + 1 ) << 24 ) |
543 ( (FT_UInt32)*( d[0] + 2 ) << 16 ) |
544 ( (FT_UInt32)*( d[0] + 3 ) << 8 ) |
545 (FT_UInt32)*( d[0] + 4 ) ) + 0x8000U ) >> 16 );
548 ( ( ( (FT_UInt32)*( d[0] + 1 ) << 16 ) |
549 ( (FT_UInt32)*( d[0] + 2 ) << 8 ) |
550 (FT_UInt32)*( d[0] + 3 ) ) + 0x80U ) >> 8 );
555 return cff_parse_integer( parser, *d );
559 /* read a floating point number, either integer or real */
561 do_fixed( CFF_Parser parser,
566 return cff_parse_real( parser, *d, scaling, NULL );
569 FT_Long val = cff_parse_integer( parser, *d );
574 if ( FT_ABS( val ) > power_ten_limits[scaling] )
576 val = val > 0 ? 0x7FFFFFFFL : -0x7FFFFFFFL;
580 val *= power_tens[scaling];
588 else if ( val < -0x7FFF )
594 return (FT_Long)( (FT_ULong)val << 16 );
597 FT_TRACE4(( "!!!OVERFLOW:!!!" ));
603 /* read a floating point number, either integer or real */
605 cff_parse_fixed( CFF_Parser parser,
608 return do_fixed( parser, d, 0 );
612 /* read a floating point number, either integer or real, */
613 /* but return `10^scaling' times the number read in */
615 cff_parse_fixed_scaled( CFF_Parser parser,
619 return do_fixed( parser, d, scaling );
623 /* read a floating point number, either integer or real, */
624 /* and return it as precise as possible -- `scaling' returns */
625 /* the scaling factor (as a power of 10) */
627 cff_parse_fixed_dynamic( CFF_Parser parser,
631 FT_ASSERT( scaling );
634 return cff_parse_real( parser, *d, 0, scaling );
638 FT_Int integer_length;
641 number = cff_parse_integer( parser, d[0] );
643 if ( number > 0x7FFFL )
645 for ( integer_length = 5; integer_length < 10; integer_length++ )
646 if ( number < power_tens[integer_length] )
649 if ( ( number / power_tens[integer_length - 5] ) > 0x7FFFL )
651 *scaling = integer_length - 4;
652 return FT_DivFix( number, power_tens[integer_length - 4] );
656 *scaling = integer_length - 5;
657 return FT_DivFix( number, power_tens[integer_length - 5] );
663 return (FT_Long)( (FT_ULong)number << 16 );
670 cff_parse_font_matrix( CFF_Parser parser )
672 CFF_FontRecDict dict = (CFF_FontRecDict)parser->object;
673 FT_Matrix* matrix = &dict->font_matrix;
674 FT_Vector* offset = &dict->font_offset;
675 FT_ULong* upm = &dict->units_per_em;
676 FT_Byte** data = parser->stack;
679 if ( parser->top >= parser->stack + 6 )
684 FT_Long min_scaling, max_scaling;
688 dict->has_font_matrix = TRUE;
690 /* We expect a well-formed font matrix, this is, the matrix elements */
691 /* `xx' and `yy' are of approximately the same magnitude. To avoid */
692 /* loss of precision, we use the magnitude of the largest matrix */
693 /* element to scale all other elements. The scaling factor is then */
694 /* contained in the `units_per_em' value. */
696 max_scaling = FT_LONG_MIN;
697 min_scaling = FT_LONG_MAX;
699 for ( i = 0; i < 6; i++ )
701 values[i] = cff_parse_fixed_dynamic( parser, data++, &scalings[i] );
704 if ( scalings[i] > max_scaling )
705 max_scaling = scalings[i];
706 if ( scalings[i] < min_scaling )
707 min_scaling = scalings[i];
711 if ( max_scaling < -9 ||
713 ( max_scaling - min_scaling ) < 0 ||
714 ( max_scaling - min_scaling ) > 9 )
716 FT_TRACE1(( "cff_parse_font_matrix:"
717 " strange scaling values (minimum %d, maximum %d),\n"
719 " using default matrix\n", min_scaling, max_scaling ));
723 for ( i = 0; i < 6; i++ )
725 FT_Fixed value = values[i];
726 FT_Long divisor, half_divisor;
732 divisor = power_tens[max_scaling - scalings[i]];
733 half_divisor = divisor >> 1;
737 if ( FT_LONG_MIN + half_divisor < value )
738 values[i] = ( value - half_divisor ) / divisor;
740 values[i] = FT_LONG_MIN / divisor;
744 if ( FT_LONG_MAX - half_divisor > value )
745 values[i] = ( value + half_divisor ) / divisor;
747 values[i] = FT_LONG_MAX / divisor;
751 matrix->xx = values[0];
752 matrix->yx = values[1];
753 matrix->xy = values[2];
754 matrix->yy = values[3];
755 offset->x = values[4];
756 offset->y = values[5];
758 *upm = (FT_ULong)power_tens[-max_scaling];
760 FT_TRACE4(( " [%f %f %f %f %f %f]\n",
761 (double)matrix->xx / *upm / 65536,
762 (double)matrix->xy / *upm / 65536,
763 (double)matrix->yx / *upm / 65536,
764 (double)matrix->yy / *upm / 65536,
765 (double)offset->x / *upm / 65536,
766 (double)offset->y / *upm / 65536 ));
768 if ( !FT_Matrix_Check( matrix ) )
770 FT_TRACE1(( "cff_parse_font_matrix:"
771 " degenerate values, using default matrix\n" ));
778 return FT_THROW( Stack_Underflow );
781 /* Return default matrix in case of unlikely values. */
783 matrix->xx = 0x10000L;
786 matrix->yy = 0x10000L;
796 cff_parse_font_bbox( CFF_Parser parser )
798 CFF_FontRecDict dict = (CFF_FontRecDict)parser->object;
799 FT_BBox* bbox = &dict->font_bbox;
800 FT_Byte** data = parser->stack;
804 error = FT_ERR( Stack_Underflow );
806 if ( parser->top >= parser->stack + 4 )
808 bbox->xMin = FT_RoundFix( cff_parse_fixed( parser, data++ ) );
809 bbox->yMin = FT_RoundFix( cff_parse_fixed( parser, data++ ) );
810 bbox->xMax = FT_RoundFix( cff_parse_fixed( parser, data++ ) );
811 bbox->yMax = FT_RoundFix( cff_parse_fixed( parser, data ) );
814 FT_TRACE4(( " [%d %d %d %d]\n",
818 bbox->yMax / 65536 ));
826 cff_parse_private_dict( CFF_Parser parser )
828 CFF_FontRecDict dict = (CFF_FontRecDict)parser->object;
829 FT_Byte** data = parser->stack;
833 error = FT_ERR( Stack_Underflow );
835 if ( parser->top >= parser->stack + 2 )
840 tmp = cff_parse_num( parser, data++ );
843 FT_ERROR(( "cff_parse_private_dict: Invalid dictionary size\n" ));
844 error = FT_THROW( Invalid_File_Format );
847 dict->private_size = (FT_ULong)tmp;
849 tmp = cff_parse_num( parser, data );
852 FT_ERROR(( "cff_parse_private_dict: Invalid dictionary offset\n" ));
853 error = FT_THROW( Invalid_File_Format );
856 dict->private_offset = (FT_ULong)tmp;
858 FT_TRACE4(( " %lu %lu\n",
859 dict->private_size, dict->private_offset ));
869 /* The `MultipleMaster' operator comes before any */
870 /* top DICT operators that contain T2 charstrings. */
873 cff_parse_multiple_master( CFF_Parser parser )
875 CFF_FontRecDict dict = (CFF_FontRecDict)parser->object;
879 #ifdef FT_DEBUG_LEVEL_TRACE
880 /* beautify tracing message */
881 if ( ft_trace_levels[FT_TRACE_COMP( FT_COMPONENT )] < 4 )
882 FT_TRACE1(( "Multiple Master CFFs not supported yet,"
883 " handling first master design only\n" ));
885 FT_TRACE1(( " (not supported yet,"
886 " handling first master design only)\n" ));
889 error = FT_ERR( Stack_Underflow );
891 /* currently, we handle only the first argument */
892 if ( parser->top >= parser->stack + 5 )
894 FT_Long num_designs = cff_parse_num( parser, parser->stack );
897 if ( num_designs > 16 || num_designs < 2 )
899 FT_ERROR(( "cff_parse_multiple_master:"
900 " Invalid number of designs\n" ));
901 error = FT_THROW( Invalid_File_Format );
905 dict->num_designs = (FT_UShort)num_designs;
906 dict->num_axes = (FT_UShort)( parser->top - parser->stack - 4 );
908 parser->num_designs = dict->num_designs;
909 parser->num_axes = dict->num_axes;
920 cff_parse_cid_ros( CFF_Parser parser )
922 CFF_FontRecDict dict = (CFF_FontRecDict)parser->object;
923 FT_Byte** data = parser->stack;
927 error = FT_ERR( Stack_Underflow );
929 if ( parser->top >= parser->stack + 3 )
931 dict->cid_registry = (FT_UInt)cff_parse_num( parser, data++ );
932 dict->cid_ordering = (FT_UInt)cff_parse_num( parser, data++ );
934 FT_TRACE1(( "cff_parse_cid_ros: real supplement is rounded\n" ));
935 dict->cid_supplement = cff_parse_num( parser, data );
936 if ( dict->cid_supplement < 0 )
937 FT_TRACE1(( "cff_parse_cid_ros: negative supplement %d is found\n",
938 dict->cid_supplement ));
941 FT_TRACE4(( " %d %d %d\n",
944 dict->cid_supplement ));
952 cff_parse_vsindex( CFF_Parser parser )
954 /* vsindex operator can only be used in a Private DICT */
955 CFF_Private priv = (CFF_Private)parser->object;
956 FT_Byte** data = parser->stack;
961 if ( !priv || !priv->subfont )
963 error = FT_THROW( Invalid_File_Format );
967 blend = &priv->subfont->blend;
971 FT_ERROR(( " cff_parse_vsindex: vsindex not allowed after blend\n" ));
972 error = FT_THROW( Syntax_Error );
976 priv->vsindex = (FT_UInt)cff_parse_num( parser, data++ );
978 FT_TRACE4(( " %d\n", priv->vsindex ));
988 cff_parse_blend( CFF_Parser parser )
990 /* blend operator can only be used in a Private DICT */
991 CFF_Private priv = (CFF_Private)parser->object;
998 if ( !priv || !priv->subfont )
1000 error = FT_THROW( Invalid_File_Format );
1004 subFont = priv->subfont;
1005 blend = &subFont->blend;
1007 if ( cff_blend_check_vector( blend,
1012 error = cff_blend_build_vector( blend,
1020 numBlends = (FT_UInt)cff_parse_num( parser, parser->top - 1 );
1021 if ( numBlends > parser->stackSize )
1023 FT_ERROR(( "cff_parse_blend: Invalid number of blends\n" ));
1024 error = FT_THROW( Invalid_File_Format );
1028 FT_TRACE4(( " %d value%s blended\n",
1030 numBlends == 1 ? "" : "s" ));
1032 error = cff_blend_doBlend( subFont, parser, numBlends );
1034 blend->usedBV = TRUE;
1041 /* maxstack operator increases parser and operand stacks for CFF2 */
1043 cff_parse_maxstack( CFF_Parser parser )
1045 /* maxstack operator can only be used in a Top DICT */
1046 CFF_FontRecDict dict = (CFF_FontRecDict)parser->object;
1047 FT_Byte** data = parser->stack;
1048 FT_Error error = FT_Err_Ok;
1053 error = FT_THROW( Invalid_File_Format );
1057 dict->maxstack = (FT_UInt)cff_parse_num( parser, data++ );
1058 if ( dict->maxstack > CFF2_MAX_STACK )
1059 dict->maxstack = CFF2_MAX_STACK;
1060 if ( dict->maxstack < CFF2_DEFAULT_STACK )
1061 dict->maxstack = CFF2_DEFAULT_STACK;
1063 FT_TRACE4(( " %d\n", dict->maxstack ));
1070 #define CFF_FIELD_NUM( code, name, id ) \
1071 CFF_FIELD( code, name, id, cff_kind_num )
1072 #define CFF_FIELD_FIXED( code, name, id ) \
1073 CFF_FIELD( code, name, id, cff_kind_fixed )
1074 #define CFF_FIELD_FIXED_1000( code, name, id ) \
1075 CFF_FIELD( code, name, id, cff_kind_fixed_thousand )
1076 #define CFF_FIELD_STRING( code, name, id ) \
1077 CFF_FIELD( code, name, id, cff_kind_string )
1078 #define CFF_FIELD_BOOL( code, name, id ) \
1079 CFF_FIELD( code, name, id, cff_kind_bool )
1083 #undef CFF_FIELD_DELTA
1086 #ifndef FT_DEBUG_LEVEL_TRACE
1089 #define CFF_FIELD_CALLBACK( code, name, id ) \
1091 cff_kind_callback, \
1094 cff_parse_ ## name, \
1098 #define CFF_FIELD_BLEND( code, id ) \
1107 #define CFF_FIELD( code, name, id, kind ) \
1111 FT_FIELD_OFFSET( name ), \
1112 FT_FIELD_SIZE( name ), \
1116 #define CFF_FIELD_DELTA( code, name, max, id ) \
1120 FT_FIELD_OFFSET( name ), \
1121 FT_FIELD_SIZE_DELTA( name ), \
1124 FT_FIELD_OFFSET( num_ ## name ) \
1127 static const CFF_Field_Handler cff_field_handlers[] =
1130 #include "cfftoken.h"
1132 { 0, 0, 0, 0, 0, 0, 0 }
1136 #else /* FT_DEBUG_LEVEL_TRACE */
1140 #define CFF_FIELD_CALLBACK( code, name, id ) \
1142 cff_kind_callback, \
1145 cff_parse_ ## name, \
1150 #define CFF_FIELD_BLEND( code, id ) \
1160 #define CFF_FIELD( code, name, id, kind ) \
1164 FT_FIELD_OFFSET( name ), \
1165 FT_FIELD_SIZE( name ), \
1170 #define CFF_FIELD_DELTA( code, name, max, id ) \
1174 FT_FIELD_OFFSET( name ), \
1175 FT_FIELD_SIZE_DELTA( name ), \
1178 FT_FIELD_OFFSET( num_ ## name ), \
1182 static const CFF_Field_Handler cff_field_handlers[] =
1185 #include "cfftoken.h"
1187 { 0, 0, 0, 0, 0, 0, 0, 0 }
1191 #endif /* FT_DEBUG_LEVEL_TRACE */
1194 FT_LOCAL_DEF( FT_Error )
1195 cff_parser_run( CFF_Parser parser,
1200 FT_Error error = FT_Err_Ok;
1202 #ifdef CFF_CONFIG_OPTION_OLD_ENGINE
1203 PSAux_Service psaux;
1205 FT_Library library = parser->library;
1206 FT_Memory memory = library->memory;
1209 parser->top = parser->stack;
1210 parser->start = start;
1211 parser->limit = limit;
1212 parser->cursor = start;
1219 /* Opcode 31 is legacy MM T2 operator, not a number. */
1220 /* Opcode 255 is reserved and should not appear in fonts; */
1221 /* it is used internally for CFF2 blends. */
1222 if ( v >= 27 && v != 31 && v != 255 )
1224 /* it's a number; we will push its position on the stack */
1225 if ( (FT_UInt)( parser->top - parser->stack ) >= parser->stackSize )
1226 goto Stack_Overflow;
1233 /* skip real number */
1237 /* An unterminated floating point number at the */
1238 /* end of a dictionary is invalid but harmless. */
1257 #ifdef CFF_CONFIG_OPTION_OLD_ENGINE
1260 /* a Type 2 charstring */
1262 CFF_Decoder decoder;
1263 CFF_FontRec cff_rec;
1264 FT_Byte* charstring_base;
1265 FT_ULong charstring_len;
1274 charstring_base = ++p;
1276 /* search `endchar' operator */
1286 charstring_len = (FT_ULong)( p - charstring_base ) + 1;
1288 /* construct CFF_Decoder object */
1289 FT_ZERO( &decoder );
1290 FT_ZERO( &cff_rec );
1292 cff_rec.top_font.font_dict.num_designs = parser->num_designs;
1293 cff_rec.top_font.font_dict.num_axes = parser->num_axes;
1294 decoder.cff = &cff_rec;
1296 psaux = (PSAux_Service)FT_Get_Module_Interface( library, "psaux" );
1299 FT_ERROR(( "cff_parser_run: cannot access `psaux' module\n" ));
1300 error = FT_THROW( Missing_Module );
1304 error = psaux->cff_decoder_funcs->parse_charstrings_old(
1305 &decoder, charstring_base, charstring_len, 1 );
1309 /* Now copy the stack data in the temporary decoder object, */
1310 /* converting it back to charstring number representations */
1311 /* (this is ugly, I know). */
1313 node = (FT_ListNode)memory->alloc( memory,
1314 sizeof ( FT_ListNodeRec ) );
1316 goto Out_Of_Memory_Error;
1318 FT_List_Add( &parser->t2_strings, node );
1320 t2 = (CFF_T2_String)memory->alloc( memory,
1321 sizeof ( CFF_T2_StringRec ) );
1323 goto Out_Of_Memory_Error;
1327 /* `5' is the conservative upper bound of required bytes per stack */
1330 t2_size = 5 * ( decoder.top - decoder.stack );
1332 q = (FT_Byte*)memory->alloc( memory, t2_size );
1334 goto Out_Of_Memory_Error;
1337 t2->limit = q + t2_size;
1339 stack = decoder.stack;
1341 while ( stack < decoder.top )
1347 if ( (FT_UInt)( parser->top - parser->stack ) >= parser->stackSize )
1348 goto Stack_Overflow;
1354 num = (FT_ULong)NEG_LONG( *stack );
1359 num = (FT_ULong)*stack;
1363 if ( num & 0xFFFFU )
1366 num = (FT_ULong)-num;
1369 *q++ = ( num & 0xFF000000U ) >> 24;
1370 *q++ = ( num & 0x00FF0000U ) >> 16;
1371 *q++ = ( num & 0x0000FF00U ) >> 8;
1372 *q++ = num & 0x000000FFU;
1381 *q++ = (FT_Byte)( 139 - num );
1382 else if ( num <= 1131 )
1384 *q++ = (FT_Byte)( ( ( num - 108 ) >> 8 ) + 251 );
1385 *q++ = (FT_Byte)( ( num - 108 ) & 0xFF );
1389 num = (FT_ULong)-num;
1392 *q++ = (FT_Byte)( num >> 8 );
1393 *q++ = (FT_Byte)( num & 0xFF );
1399 *q++ = (FT_Byte)( num + 139 );
1400 else if ( num <= 1131 )
1402 *q++ = (FT_Byte)( ( ( num - 108 ) >> 8 ) + 247 );
1403 *q++ = (FT_Byte)( ( num - 108 ) & 0xFF );
1408 *q++ = (FT_Byte)( num >> 8 );
1409 *q++ = (FT_Byte)( num & 0xFF );
1417 #endif /* CFF_CONFIG_OPTION_OLD_ENGINE */
1420 /* This is not a number, hence it's an operator. Compute its code */
1421 /* and look for it in our current list. */
1425 const CFF_Field_Handler* field;
1428 if ( (FT_UInt)( parser->top - parser->stack ) >= parser->stackSize )
1429 goto Stack_Overflow;
1431 num_args = (FT_UInt)( parser->top - parser->stack );
1437 /* two byte operator */
1442 code = 0x100 | p[0];
1444 code = code | parser->object_code;
1446 for ( field = cff_field_handlers; field->kind; field++ )
1448 if ( field->code == (FT_Int)code )
1450 /* we found our field's handler; read it */
1452 FT_Byte* q = (FT_Byte*)parser->object + field->offset;
1455 #ifdef FT_DEBUG_LEVEL_TRACE
1456 FT_TRACE4(( " %s", field->id ));
1459 /* check that we have enough arguments -- except for */
1460 /* delta encoded arrays, which can be empty */
1461 if ( field->kind != cff_kind_delta && num_args < 1 )
1462 goto Stack_Underflow;
1464 switch ( field->kind )
1467 case cff_kind_string:
1469 val = cff_parse_num( parser, parser->stack );
1472 case cff_kind_fixed:
1473 val = cff_parse_fixed( parser, parser->stack );
1476 case cff_kind_fixed_thousand:
1477 val = cff_parse_fixed_scaled( parser, parser->stack, 3 );
1480 switch ( field->size )
1482 case (8 / FT_CHAR_BIT):
1483 *(FT_Byte*)q = (FT_Byte)val;
1486 case (16 / FT_CHAR_BIT):
1487 *(FT_Short*)q = (FT_Short)val;
1490 case (32 / FT_CHAR_BIT):
1491 *(FT_Int32*)q = (FT_Int)val;
1494 default: /* for 64-bit systems */
1498 #ifdef FT_DEBUG_LEVEL_TRACE
1499 switch ( field->kind )
1502 FT_TRACE4(( " %s\n", val ? "true" : "false" ));
1505 case cff_kind_string:
1506 FT_TRACE4(( " %ld (SID)\n", val ));
1510 FT_TRACE4(( " %ld\n", val ));
1513 case cff_kind_fixed:
1514 FT_TRACE4(( " %f\n", (double)val / 65536 ));
1517 case cff_kind_fixed_thousand:
1518 FT_TRACE4(( " %f\n", (double)val / 65536 / 1000 ));
1521 ; /* never reached */
1527 case cff_kind_delta:
1529 FT_Byte* qcount = (FT_Byte*)parser->object +
1530 field->count_offset;
1532 FT_Byte** data = parser->stack;
1535 if ( num_args > field->array_max )
1536 num_args = field->array_max;
1538 FT_TRACE4(( " [" ));
1541 *qcount = (FT_Byte)num_args;
1544 while ( num_args > 0 )
1546 val = ADD_LONG( val, cff_parse_num( parser, data++ ) );
1547 switch ( field->size )
1549 case (8 / FT_CHAR_BIT):
1550 *(FT_Byte*)q = (FT_Byte)val;
1553 case (16 / FT_CHAR_BIT):
1554 *(FT_Short*)q = (FT_Short)val;
1557 case (32 / FT_CHAR_BIT):
1558 *(FT_Int32*)q = (FT_Int)val;
1561 default: /* for 64-bit systems */
1565 FT_TRACE4(( " %ld", val ));
1571 FT_TRACE4(( "]\n" ));
1575 default: /* callback or blend */
1576 error = field->reader( parser );
1584 /* this is an unknown operator, or it is unsupported; */
1585 /* we will ignore it for now. */
1589 /* TODO: could clear blend stack here, */
1590 /* but we don't have access to subFont */
1591 if ( field->kind != cff_kind_blend )
1592 parser->top = parser->stack;
1595 } /* while ( p < limit ) */
1600 #ifdef CFF_CONFIG_OPTION_OLD_ENGINE
1601 Out_Of_Memory_Error:
1602 error = FT_THROW( Out_Of_Memory );
1607 error = FT_THROW( Invalid_Argument );
1611 error = FT_THROW( Invalid_Argument );
1615 error = FT_THROW( Invalid_Argument );