2000-06-16 08:49:56 +02:00
|
|
|
/***************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* cidparse.c */
|
|
|
|
/* */
|
|
|
|
/* CID-keyed Type1 parser (body). */
|
|
|
|
/* */
|
|
|
|
/* Copyright 1996-2000 by */
|
|
|
|
/* David Turner, Robert Wilhelm, and Werner Lemberg. */
|
|
|
|
/* */
|
|
|
|
/* This file is part of the FreeType project, and may only be used, */
|
|
|
|
/* modified, and distributed under the terms of the FreeType project */
|
|
|
|
/* license, LICENSE.TXT. By continuing to use, modify, or distribute */
|
|
|
|
/* this file you indicate that you have read the license and */
|
|
|
|
/* understand and accept it fully. */
|
|
|
|
/* */
|
|
|
|
/***************************************************************************/
|
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
#include <freetype/internal/ftdebug.h>
|
|
|
|
#include <freetype/internal/ftcalc.h>
|
|
|
|
#include <freetype/internal/ftobjs.h>
|
|
|
|
#include <freetype/internal/ftstream.h>
|
2000-06-07 06:48:12 +02:00
|
|
|
#include <freetype/internal/t1errors.h>
|
2000-06-01 05:27:48 +02:00
|
|
|
#include <cidparse.h>
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
#include <string.h> /* for strncmp() */
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* The macro FT_COMPONENT is used in trace mode. It is an implicit */
|
|
|
|
/* parameter of the FT_TRACE() and FT_ERROR() macros, used to print/log */
|
|
|
|
/* messages during execution. */
|
|
|
|
/* */
|
2000-06-01 05:27:48 +02:00
|
|
|
#undef FT_COMPONENT
|
2000-06-16 08:49:56 +02:00
|
|
|
#define FT_COMPONENT trace_cidparse
|
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
#if 0
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
|
|
/***** *****/
|
2000-06-29 05:14:25 +02:00
|
|
|
/***** IMPLEMENTATION OF CID_TABLE OBJECT *****/
|
2000-06-16 08:49:56 +02:00
|
|
|
/***** *****/
|
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
2000-06-29 05:14:25 +02:00
|
|
|
/* CID_New_Table */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* */
|
|
|
|
/* <Description> */
|
2000-06-29 05:14:25 +02:00
|
|
|
/* Initializes a CID_Table. */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* table :: The address of the target table. */
|
|
|
|
/* */
|
|
|
|
/* <Input> */
|
|
|
|
/* count :: The table size, i.e., the maximal number of elements. */
|
|
|
|
/* */
|
|
|
|
/* memory :: The memory object to be used for all subsequent */
|
|
|
|
/* reallocations. */
|
|
|
|
/* */
|
|
|
|
/* <Return> */
|
2000-06-25 08:47:11 +02:00
|
|
|
/* FreeType error code. 0 means success. */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* */
|
2000-06-01 05:27:48 +02:00
|
|
|
LOCAL_FUNC
|
2000-06-28 01:20:35 +02:00
|
|
|
FT_Error CID_New_Table( CID_Table* table,
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Int count,
|
|
|
|
FT_Memory memory )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Error error;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
table->memory = memory;
|
2000-06-16 21:34:52 +02:00
|
|
|
if ( ALLOC_ARRAY( table->elements, count, FT_Byte* ) ||
|
|
|
|
ALLOC_ARRAY( table->lengths, count, FT_Byte* ) )
|
2000-06-16 08:49:56 +02:00
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
table->max_elems = count;
|
|
|
|
table->init = 0xDEADBEEFL;
|
|
|
|
table->num_elems = 0;
|
|
|
|
table->block = 0;
|
|
|
|
table->capacity = 0;
|
|
|
|
table->cursor = 0;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
Exit:
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( error )
|
|
|
|
FREE( table->elements );
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
return error;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
static
|
2000-06-28 01:20:35 +02:00
|
|
|
void shift_elements( CID_Table* table,
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Byte* old_base )
|
2000-06-16 08:49:56 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Long delta = table->block - old_base;
|
|
|
|
FT_Byte** offset = table->elements;
|
|
|
|
FT_Byte** limit = offset + table->max_elems;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( delta )
|
|
|
|
for ( ; offset < limit; offset++ )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( offset[0] )
|
|
|
|
offset[0] += delta;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
}
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
static
|
2000-06-28 01:20:35 +02:00
|
|
|
FT_Error reallocate_t1_table( CID_Table* table,
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Int new_size )
|
2000-06-16 08:49:56 +02:00
|
|
|
{
|
|
|
|
FT_Memory memory = table->memory;
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* old_base = table->block;
|
|
|
|
FT_Error error;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/* realloc the base block */
|
|
|
|
if ( REALLOC( table->block, table->capacity, new_size ) )
|
|
|
|
return error;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
table->capacity = new_size;
|
|
|
|
|
|
|
|
/* shift all offsets when needed */
|
|
|
|
if ( old_base )
|
|
|
|
shift_elements( table, old_base );
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
return T1_Err_Ok;
|
|
|
|
}
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
2000-06-29 05:14:25 +02:00
|
|
|
/* CID_Add_Table */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* */
|
|
|
|
/* <Description> */
|
2000-06-29 05:14:25 +02:00
|
|
|
/* Adds an object to a CID_Table, possibly growing its memory block. */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* table :: The target table. */
|
|
|
|
/* */
|
|
|
|
/* <Input> */
|
|
|
|
/* index :: The index of the object in the table. */
|
|
|
|
/* */
|
|
|
|
/* object :: The address of the object to copy in the memory. */
|
|
|
|
/* */
|
|
|
|
/* length :: The length in bytes of the source object. */
|
|
|
|
/* */
|
|
|
|
/* <Return> */
|
2000-06-25 08:47:11 +02:00
|
|
|
/* FreeType error code. 0 means success. An error is returned if */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* reallocation fails. */
|
|
|
|
/* */
|
2000-06-01 05:27:48 +02:00
|
|
|
LOCAL_FUNC
|
2000-06-28 01:20:35 +02:00
|
|
|
FT_Error CID_Add_Table( CID_Table* table,
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Int index,
|
|
|
|
void* object,
|
|
|
|
FT_Int length )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( index < 0 || index > table->max_elems )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-28 01:20:35 +02:00
|
|
|
FT_ERROR(( "CID_Add_Table: invalid index\n" ));
|
2000-06-16 08:49:56 +02:00
|
|
|
return T1_Err_Syntax_Error;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* grow the base block if needed */
|
|
|
|
if ( table->cursor + length > table->capacity )
|
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Error error;
|
|
|
|
FT_Int new_size = table->capacity;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
while ( new_size < table->cursor + length )
|
2000-06-01 05:27:48 +02:00
|
|
|
new_size += 1024;
|
|
|
|
|
|
|
|
error = reallocate_t1_table( table, new_size );
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( error )
|
|
|
|
return error;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* add the object to the base block and adjust offset */
|
2000-06-16 08:49:56 +02:00
|
|
|
table->elements[index] = table->block + table->cursor;
|
|
|
|
table->lengths [index] = length;
|
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
MEM_Copy( table->block + table->cursor, object, length );
|
|
|
|
|
|
|
|
table->cursor += length;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
return T1_Err_Ok;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* <Function> */
|
2000-06-29 05:14:25 +02:00
|
|
|
/* CID_Done_Table */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* */
|
|
|
|
/* <Description> */
|
2000-06-29 05:14:25 +02:00
|
|
|
/* Finalizes a CID_Table (reallocate it to its current cursor). */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* */
|
|
|
|
/* <InOut> */
|
|
|
|
/* table :: The target table. */
|
|
|
|
/* */
|
|
|
|
/* <Note> */
|
|
|
|
/* This function does NOT release the heap's memory block. It is up */
|
|
|
|
/* to the caller to clean it, or reference it in its own structures. */
|
|
|
|
/* */
|
2000-06-01 05:27:48 +02:00
|
|
|
LOCAL_FUNC
|
2000-06-28 01:20:35 +02:00
|
|
|
void CID_Done_Table( CID_Table* table )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
FT_Memory memory = table->memory;
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Error error;
|
|
|
|
FT_Byte* old_base;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
/* should never fail, as rec.cursor <= rec.size */
|
|
|
|
old_base = table->block;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( !old_base )
|
2000-06-01 05:27:48 +02:00
|
|
|
return;
|
|
|
|
|
|
|
|
(void)REALLOC( table->block, table->capacity, table->cursor );
|
|
|
|
table->capacity = table->cursor;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( old_base != table->block )
|
2000-06-01 05:27:48 +02:00
|
|
|
shift_elements( table, old_base );
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
LOCAL_FUNC
|
2000-06-28 01:20:35 +02:00
|
|
|
void CID_Release_Table( CID_Table* table )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
FT_Memory memory = table->memory;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
if ( table->init == 0xDEADBEEFL )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
FREE( table->block );
|
|
|
|
FREE( table->elements );
|
|
|
|
FREE( table->lengths );
|
|
|
|
table->init = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
#endif /* 0 */
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
|
|
/***** *****/
|
|
|
|
/***** INPUT STREAM PARSER *****/
|
|
|
|
/***** *****/
|
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
|
|
|
/*************************************************************************/
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
2000-06-28 01:20:35 +02:00
|
|
|
#define IS_CID_WHITESPACE( c ) ( (c) == ' ' || (c) == '\t' )
|
|
|
|
#define IS_CID_LINESPACE( c ) ( (c) == '\r' || (c) == '\n' )
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-28 01:20:35 +02:00
|
|
|
#define IS_CID_SPACE( c ) ( IS_CID_WHITESPACE( c ) || IS_CID_LINESPACE( c ) )
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
|
|
|
LOCAL_FUNC
|
2000-06-16 08:49:56 +02:00
|
|
|
void CID_Skip_Spaces( CID_Parser* parser )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* cur = parser->cursor;
|
|
|
|
FT_Byte* limit = parser->limit;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
while ( cur < limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte c = *cur;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
|
2000-06-28 01:20:35 +02:00
|
|
|
if ( !IS_CID_SPACE( c ) )
|
2000-06-01 05:27:48 +02:00
|
|
|
break;
|
|
|
|
cur++;
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
parser->cursor = cur;
|
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
LOCAL_FUNC
|
2000-06-29 05:14:25 +02:00
|
|
|
void CID_ToToken( CID_Parser* parser,
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Token_Rec* token )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* cur;
|
|
|
|
FT_Byte* limit;
|
|
|
|
FT_Byte starter, ender;
|
|
|
|
FT_Int embed;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
token->type = t1_token_none;
|
|
|
|
token->start = 0;
|
|
|
|
token->limit = 0;
|
|
|
|
|
|
|
|
/* first of all, skip space */
|
2000-06-16 08:49:56 +02:00
|
|
|
CID_Skip_Spaces( parser );
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
cur = parser->cursor;
|
|
|
|
limit = parser->limit;
|
|
|
|
|
|
|
|
if ( cur < limit )
|
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
switch ( *cur )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
/************* check for strings ***********************/
|
2000-06-16 08:49:56 +02:00
|
|
|
case '(':
|
|
|
|
token->type = t1_token_string;
|
|
|
|
ender = ')';
|
|
|
|
goto Lookup_Ender;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
/************* check for programs/array ****************/
|
2000-06-16 08:49:56 +02:00
|
|
|
case '{':
|
|
|
|
token->type = t1_token_array;
|
|
|
|
ender = '}';
|
|
|
|
goto Lookup_Ender;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
/************* check for table/array ******************/
|
2000-06-16 08:49:56 +02:00
|
|
|
case '[':
|
|
|
|
token->type = t1_token_array;
|
|
|
|
ender = ']';
|
|
|
|
|
|
|
|
Lookup_Ender:
|
|
|
|
embed = 1;
|
|
|
|
starter = *cur++;
|
|
|
|
token->start = cur;
|
|
|
|
|
|
|
|
while ( cur < limit )
|
|
|
|
{
|
|
|
|
if ( *cur == starter )
|
|
|
|
embed++;
|
|
|
|
else if ( *cur == ender )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
embed--;
|
|
|
|
if ( embed <= 0 )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
token->limit = cur++;
|
|
|
|
break;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
cur++;
|
|
|
|
}
|
|
|
|
break;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-07-01 00:24:36 +02:00
|
|
|
/* **************** otherwise, it is any token **********/
|
2000-06-16 08:49:56 +02:00
|
|
|
default:
|
|
|
|
token->start = cur++;
|
|
|
|
token->type = t1_token_any;
|
2000-06-28 01:20:35 +02:00
|
|
|
while ( cur < limit && !IS_CID_SPACE( *cur ) )
|
2000-06-16 08:49:56 +02:00
|
|
|
cur++;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
token->limit = cur;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( !token->limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
token->start = 0;
|
|
|
|
token->type = t1_token_none;
|
|
|
|
}
|
|
|
|
|
|
|
|
parser->cursor = cur;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LOCAL_FUNC
|
2000-06-29 05:14:25 +02:00
|
|
|
void CID_ToTokenArray( CID_Parser* parser,
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Token_Rec* tokens,
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_UInt max_tokens,
|
|
|
|
FT_Int* pnum_tokens )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Token_Rec master;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
*pnum_tokens = -1;
|
|
|
|
|
|
|
|
CID_ToToken( parser, &master );
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
if ( master.type == t1_token_array )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Byte* old_cursor = parser->cursor;
|
|
|
|
FT_Byte* old_limit = parser->limit;
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Token_Rec* cur = tokens;
|
|
|
|
CID_Token_Rec* limit = cur + max_tokens;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
parser->cursor = master.start;
|
|
|
|
parser->limit = master.limit;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
while ( parser->cursor < parser->limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Token_Rec token;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
CID_ToToken( parser, &token );
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( !token.type )
|
2000-06-01 05:27:48 +02:00
|
|
|
break;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
if ( cur < limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
*cur = token;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
cur++;
|
|
|
|
}
|
|
|
|
|
|
|
|
*pnum_tokens = cur - tokens;
|
|
|
|
|
|
|
|
parser->cursor = old_cursor;
|
|
|
|
parser->limit = old_limit;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Long t1_toint( FT_Byte** cursor,
|
|
|
|
FT_Byte* limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Long result = 0;
|
|
|
|
FT_Byte* cur = *cursor;
|
|
|
|
FT_Byte c, d;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
for ( ; cur < limit; cur++ )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
c = *cur;
|
2000-06-16 21:34:52 +02:00
|
|
|
d = (FT_Byte)( c - '0' );
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( d < 10 )
|
|
|
|
break;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c == '-' )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
cur++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur < limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
do
|
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
d = (FT_Byte)( cur[0] - '0' );
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( d >= 10 )
|
2000-06-01 05:27:48 +02:00
|
|
|
break;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
result = result * 10 + d;
|
2000-06-01 05:27:48 +02:00
|
|
|
cur++;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
} while ( cur < limit );
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c == '-' )
|
2000-06-01 05:27:48 +02:00
|
|
|
result = -result;
|
|
|
|
}
|
|
|
|
|
|
|
|
*cursor = cur;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Long t1_tofixed( FT_Byte** cursor,
|
|
|
|
FT_Byte* limit,
|
|
|
|
FT_Long power_ten )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* cur = *cursor;
|
|
|
|
FT_Long num, divider, result;
|
|
|
|
FT_Int sign = 0;
|
|
|
|
FT_Byte d;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
if ( cur >= limit )
|
|
|
|
return 0;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
/* first of all, read the integer part */
|
|
|
|
result = t1_toint( &cur, limit ) << 16;
|
|
|
|
num = 0;
|
|
|
|
divider = 1;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( result < 0 )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
sign = 1;
|
|
|
|
result = -result;
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
if ( cur >= limit )
|
|
|
|
goto Exit;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
/* read decimal part, if any */
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( *cur == '.' && cur + 1 < limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
cur++;
|
|
|
|
|
|
|
|
for (;;)
|
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
d = (FT_Byte)( *cur - '0' );
|
2000-07-01 00:24:36 +02:00
|
|
|
if ( d >= 10 )
|
|
|
|
break;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( divider < 10000000L )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
num = num * 10 + d;
|
2000-06-01 05:27:48 +02:00
|
|
|
divider *= 10;
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
cur++;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur >= limit )
|
|
|
|
break;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* read exponent, if any */
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur + 1 < limit && ( *cur == 'e' || *cur == 'E' ) )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
cur++;
|
|
|
|
power_ten += t1_toint( &cur, limit );
|
|
|
|
}
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
/* raise to power of ten if needed */
|
2000-06-16 08:49:56 +02:00
|
|
|
while ( power_ten > 0 )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
result = result * 10;
|
|
|
|
num = num * 10;
|
2000-06-01 05:27:48 +02:00
|
|
|
power_ten--;
|
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
while ( power_ten < 0 )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
result = result / 10;
|
|
|
|
divider = divider * 10;
|
2000-06-01 05:27:48 +02:00
|
|
|
power_ten++;
|
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( num )
|
2000-06-01 05:27:48 +02:00
|
|
|
result += FT_DivFix( num, divider );
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( sign )
|
2000-06-01 05:27:48 +02:00
|
|
|
result = -result;
|
|
|
|
|
|
|
|
*cursor = cur;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static
|
2000-06-16 21:34:52 +02:00
|
|
|
int t1_tobool( FT_Byte** cursor,
|
|
|
|
FT_Byte* limit )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* cur = *cursor;
|
|
|
|
FT_Bool result = 0;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
/* return 1 if we find a "true", 0 otherwise */
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur + 3 < limit &&
|
|
|
|
cur[0] == 't' &&
|
|
|
|
cur[1] == 'r' &&
|
|
|
|
cur[2] == 'u' &&
|
|
|
|
cur[3] == 'e' )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
result = 1;
|
|
|
|
cur += 5;
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
else if ( cur + 4 < limit &&
|
|
|
|
cur[0] == 'f' &&
|
|
|
|
cur[1] == 'a' &&
|
|
|
|
cur[2] == 'l' &&
|
|
|
|
cur[3] == 's' &&
|
|
|
|
cur[4] == 'e' )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
result = 0;
|
|
|
|
cur += 6;
|
|
|
|
}
|
|
|
|
*cursor = cur;
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Int t1_tocoordarray( FT_Byte** cursor,
|
|
|
|
FT_Byte* limit,
|
|
|
|
FT_Int max_coords,
|
|
|
|
FT_Short* coords )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* cur = *cursor;
|
|
|
|
FT_Int count = 0;
|
|
|
|
FT_Byte c, ender;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur >= limit )
|
|
|
|
goto Exit;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/* check for the beginning of an array. */
|
|
|
|
/* If not, only one number will be read */
|
2000-06-01 05:27:48 +02:00
|
|
|
c = *cur;
|
|
|
|
ender = 0;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c == '[' )
|
2000-06-01 05:27:48 +02:00
|
|
|
ender = ']';
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c == '{' )
|
2000-06-01 05:27:48 +02:00
|
|
|
ender = '}';
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( ender )
|
2000-06-01 05:27:48 +02:00
|
|
|
cur++;
|
|
|
|
|
|
|
|
/* now, read the coordinates */
|
|
|
|
for ( ; cur < limit; )
|
|
|
|
{
|
|
|
|
/* skip whitespace in front of data */
|
|
|
|
for (;;)
|
|
|
|
{
|
|
|
|
c = *cur;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c != ' ' && c != '\t' )
|
|
|
|
break;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
cur++;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur >= limit )
|
|
|
|
goto Exit;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( count >= max_coords || c == ender )
|
2000-06-01 05:27:48 +02:00
|
|
|
break;
|
|
|
|
|
2000-06-16 21:34:52 +02:00
|
|
|
coords[count] = (FT_Short)( t1_tofixed( &cur, limit, 0 ) >> 16 );
|
2000-06-01 05:27:48 +02:00
|
|
|
count++;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( !ender )
|
2000-06-01 05:27:48 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
*cursor = cur;
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Int t1_tofixedarray( FT_Byte** cursor,
|
|
|
|
FT_Byte* limit,
|
|
|
|
FT_Int max_values,
|
|
|
|
FT_Fixed* values,
|
|
|
|
FT_Int power_ten )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* cur = *cursor;
|
|
|
|
FT_Int count = 0;
|
|
|
|
FT_Byte c, ender;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur >= limit )
|
|
|
|
goto Exit;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/* check for the beginning of an array. */
|
|
|
|
/* If not, only one number will be read */
|
2000-06-01 05:27:48 +02:00
|
|
|
c = *cur;
|
|
|
|
ender = 0;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c == '[' )
|
2000-06-01 05:27:48 +02:00
|
|
|
ender = ']';
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c == '{' )
|
2000-06-01 05:27:48 +02:00
|
|
|
ender = '}';
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( ender )
|
2000-06-01 05:27:48 +02:00
|
|
|
cur++;
|
|
|
|
|
|
|
|
/* now, read the values */
|
|
|
|
for ( ; cur < limit; )
|
|
|
|
{
|
|
|
|
/* skip whitespace in front of data */
|
|
|
|
for (;;)
|
|
|
|
{
|
|
|
|
c = *cur;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( c != ' ' && c != '\t' )
|
|
|
|
break;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
cur++;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( cur >= limit )
|
|
|
|
goto Exit;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( count >= max_values || c == ender )
|
2000-06-01 05:27:48 +02:00
|
|
|
break;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
values[count] = t1_tofixed( &cur, limit, power_ten );
|
2000-06-01 05:27:48 +02:00
|
|
|
count++;
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( !ender )
|
2000-06-01 05:27:48 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
*cursor = cur;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/* Loads a simple field (i.e. non-table) into the current */
|
|
|
|
/* list of objects */
|
2000-06-01 05:27:48 +02:00
|
|
|
LOCAL_FUNC
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Error CID_Load_Field( CID_Parser* parser,
|
2000-06-28 01:20:35 +02:00
|
|
|
const CID_Field_Rec* field,
|
2000-06-29 05:14:25 +02:00
|
|
|
void* object )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Token_Rec token;
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* cur;
|
|
|
|
FT_Byte* limit;
|
|
|
|
FT_UInt count;
|
|
|
|
FT_UInt index;
|
|
|
|
FT_Error error;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
CID_ToToken( parser, &token );
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( !token.type )
|
2000-06-01 05:27:48 +02:00
|
|
|
goto Fail;
|
|
|
|
|
|
|
|
count = 1;
|
|
|
|
index = 0;
|
|
|
|
cur = token.start;
|
|
|
|
limit = token.limit;
|
|
|
|
|
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Byte* q = (FT_Byte*)object + field->offset;
|
|
|
|
FT_Long val;
|
|
|
|
FT_String* string;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
switch ( field->type )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
case t1_field_bool:
|
|
|
|
val = t1_tobool( &cur, limit );
|
|
|
|
goto Store_Integer;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
case t1_field_fixed:
|
|
|
|
val = t1_tofixed( &cur, limit, 0 );
|
|
|
|
goto Store_Integer;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
case t1_field_integer:
|
|
|
|
val = t1_toint( &cur, limit );
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
Store_Integer:
|
|
|
|
switch ( field->size )
|
|
|
|
{
|
|
|
|
case 1:
|
2000-06-16 21:34:52 +02:00
|
|
|
*(FT_Byte*)q = (FT_Byte)val;
|
2000-06-16 08:49:56 +02:00
|
|
|
break;
|
|
|
|
|
|
|
|
case 2:
|
2000-06-16 21:34:52 +02:00
|
|
|
*(FT_UShort*)q = (FT_UShort)val;
|
2000-06-16 08:49:56 +02:00
|
|
|
break;
|
|
|
|
|
2000-07-01 00:24:36 +02:00
|
|
|
case 4:
|
2000-07-04 20:12:13 +02:00
|
|
|
*(FT_Int32*)q = (FT_Int)val;
|
2000-07-01 00:24:36 +02:00
|
|
|
break;
|
|
|
|
|
2000-07-04 20:12:13 +02:00
|
|
|
default: /* for 64-bit systems */
|
2000-06-16 21:34:52 +02:00
|
|
|
*(FT_Long*)q = val;
|
2000-06-16 08:49:56 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case t1_field_string:
|
|
|
|
{
|
|
|
|
FT_Memory memory = parser->memory;
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_UInt len = limit-cur;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
|
|
|
|
if ( ALLOC( string, len + 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
MEM_Copy( string, cur, len );
|
|
|
|
string[len] = 0;
|
|
|
|
|
2000-06-16 21:34:52 +02:00
|
|
|
*(FT_String**)q = string;
|
2000-06-16 08:49:56 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
2000-07-01 00:24:36 +02:00
|
|
|
/* an error occurred */
|
2000-06-16 08:49:56 +02:00
|
|
|
goto Fail;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
error = 0;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
Fail:
|
|
|
|
error = T1_Err_Invalid_File_Format;
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2000-06-28 01:20:35 +02:00
|
|
|
#define T1_MAX_TABLE_ELEMENTS 32
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
LOCAL_FUNC
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Error CID_Load_Field_Table( CID_Parser* parser,
|
2000-06-28 01:20:35 +02:00
|
|
|
const CID_Field_Rec* field,
|
2000-06-29 05:14:25 +02:00
|
|
|
void* object )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Token_Rec elements[T1_MAX_TABLE_ELEMENTS];
|
|
|
|
CID_Token_Rec* token;
|
2000-06-29 05:14:25 +02:00
|
|
|
FT_Int num_elements;
|
|
|
|
FT_Error error = 0;
|
|
|
|
FT_Byte* old_cursor;
|
|
|
|
FT_Byte* old_limit;
|
2000-06-28 01:20:35 +02:00
|
|
|
CID_Field_Rec fieldrec = *(CID_Field_Rec*)field;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
fieldrec.type = t1_field_integer;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( field->type == t1_field_fixed_array )
|
|
|
|
fieldrec.type = t1_field_fixed;
|
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
CID_ToTokenArray( parser, elements, 32, &num_elements );
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( num_elements < 0 )
|
2000-06-01 05:27:48 +02:00
|
|
|
goto Fail;
|
|
|
|
|
2000-06-28 01:20:35 +02:00
|
|
|
if ( num_elements > T1_MAX_TABLE_ELEMENTS )
|
|
|
|
num_elements = T1_MAX_TABLE_ELEMENTS;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
old_cursor = parser->cursor;
|
|
|
|
old_limit = parser->limit;
|
|
|
|
|
|
|
|
/* we store the elements count */
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( field->count_offset )
|
2000-06-16 21:34:52 +02:00
|
|
|
*(FT_Byte*)( (FT_Byte*)object + field->count_offset ) = num_elements;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
/* we now load each element, adjusting the field.offset on each one */
|
|
|
|
token = elements;
|
|
|
|
for ( ; num_elements > 0; num_elements--, token++ )
|
|
|
|
{
|
|
|
|
parser->cursor = token->start;
|
|
|
|
parser->limit = token->limit;
|
|
|
|
CID_Load_Field( parser, &fieldrec, object );
|
|
|
|
fieldrec.offset += fieldrec.size;
|
|
|
|
}
|
|
|
|
|
|
|
|
parser->cursor = old_cursor;
|
|
|
|
parser->limit = old_limit;
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
Fail:
|
|
|
|
error = T1_Err_Invalid_File_Format;
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LOCAL_FUNC
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Long CID_ToInt( CID_Parser* parser )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
return t1_toint( &parser->cursor, parser->limit );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LOCAL_FUNC
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Int CID_ToCoordArray( CID_Parser* parser,
|
|
|
|
FT_Int max_coords,
|
|
|
|
FT_Short* coords )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
return t1_tocoordarray( &parser->cursor, parser->limit,
|
|
|
|
max_coords, coords );
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LOCAL_FUNC
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Int CID_ToFixedArray( CID_Parser* parser,
|
|
|
|
FT_Int max_values,
|
|
|
|
FT_Fixed* values,
|
|
|
|
FT_Int power_ten )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
2000-06-16 08:49:56 +02:00
|
|
|
return t1_tofixedarray( &parser->cursor, parser->limit,
|
|
|
|
max_values, values, power_ten );
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/* return the value of an hexadecimal digit */
|
|
|
|
static
|
|
|
|
int hexa_value( char c )
|
|
|
|
{
|
|
|
|
unsigned int d;
|
|
|
|
|
|
|
|
|
|
|
|
d = (unsigned int)( c - '0' );
|
|
|
|
if ( d <= 9 )
|
|
|
|
return (int)d;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
d = (unsigned int)( c - 'a' );
|
|
|
|
if ( d <= 5 )
|
|
|
|
return (int)( d + 10 );
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
d = (unsigned int)( c - 'A' );
|
|
|
|
if ( d <= 5 )
|
|
|
|
return (int)( d + 10 );
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
#endif /* 0 */
|
2000-06-01 05:27:48 +02:00
|
|
|
|
|
|
|
|
|
|
|
LOCAL_FUNC
|
|
|
|
FT_Error CID_New_Parser( CID_Parser* parser,
|
|
|
|
FT_Stream stream,
|
|
|
|
FT_Memory memory )
|
|
|
|
{
|
2000-06-16 21:34:52 +02:00
|
|
|
FT_Error error;
|
|
|
|
FT_ULong base_offset, offset, ps_len;
|
|
|
|
FT_Byte buffer[256 + 10];
|
|
|
|
FT_Int buff_len;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
MEM_Set( parser, 0, sizeof ( *parser ) );
|
2000-06-01 05:27:48 +02:00
|
|
|
parser->stream = stream;
|
|
|
|
parser->memory = memory;
|
|
|
|
|
|
|
|
base_offset = FILE_Pos();
|
|
|
|
|
|
|
|
/* first of all, check the font format in the header */
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( ACCESS_Frame( 31 ) )
|
2000-06-01 05:27:48 +02:00
|
|
|
goto Exit;
|
|
|
|
|
2000-07-05 06:32:02 +02:00
|
|
|
if ( strncmp( (char *)stream->cursor,
|
|
|
|
"%!PS-Adobe-3.0 Resource-CIDFont", 31 ) )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
- MAJOR INTERNAL REDESIGN:
A lot of internal modifications have been performed lately on the
source in order to provide the following enhancements:
- more generic module support:
The FT_Module type is now defined to represent a handle to a given
module. The file <freetype/ftmodule.h> contains the FT_Module_Class
definition, as well as the module-loading public API
The FT_Driver type is still defined, and still represents a pointer
to a font driver. Note that FT_Add_Driver is replaced by FT_Add_Module,
FT_Get_Driver by FT_Get_Module, etc..
- support for generic glyph image types:
The FT_Renderer type is a pointer to a module used to perform various
operations on glyph image.
Each renderer is capable of handling images in a single format
(e.g. ft_glyph_format_outline). Its functions are used to:
- transform an glyph image
- render a glyph image into a bitmap
- return the control box (dimensions) of a given glyph image
The scan converters "ftraster.c" and "ftgrays.c" have been moved
to the new directory "src/renderer", and are used to provide two
default renderer modules.
One corresponds to the "standard" scan-converter, the other to the
"smooth" one.
The current renderer can be set through the new function
FT_Set_Renderer.
The old raster-related function FT_Set_Raster, FT_Get_Raster and
FT_Set_Raster_Mode have now disappeared, in favor of the new:
FT_Get_Renderer
FT_Set_Renderer
see the file <freetype/ftrender.h> for more details..
These changes were necessary to properly support different scalable
formats in the future, like bi-color glyphs, etc..
- glyph loader object:
A new internal object, called a 'glyph loader' has been introduced
in the base layer. It is used by all scalable format font drivers
to load glyphs and composites.
This object has been created to reduce the code size of each driver,
as each one of them basically re-implemented its functionality.
See <freetype/internal/ftobjs.h> and the FT_GlyphLoader type for
more information..
- FT_GlyphSlot had new fields:
In order to support extended features (see below), the FT_GlyphSlot
structure has a few new fields:
linearHoriAdvance: this field gives the linearly scaled (i.e.
scaled but unhinted) advance width for the glyph,
expressed as a 16.16 fixed pixel value. This
is useful to perform WYSIWYG text.
linearVertAdvance: this field gives the linearly scaled advance
height for the glyph (relevant in vertical glyph
layouts only). This is useful to perform
WYSIWYG text.
Note that the two above field replace the removed "metrics2" field
in the glyph slot.
advance: this field is a vector that gives the transformed
advance for the glyph. By default, it corresponds
to the advance width, unless FT_LOAD_VERTICAL_LAYOUT
was specified when calling FT_Load_Glyph or FT_Load_Char
bitmap_left: this field gives the distance in integer pixels from
the current pen position to the left-most pixel of
a glyph image WHEN IT IS A BITMAP. It is only valid
when the "format" field is set to
"ft_glyph_format_bitmap", for example, after calling
the new function FT_Render_Glyph.
bitmap_top: this field gives the distance in integer pixels from
the current pen position (located on the baseline) to
the top-most pixel of the glyph image WHEN IT IS A
BITMAP. Positive values correspond to upwards Y.
loader: this is a new private field for the glyph slot. Client
applications should not touch it..
- support for transforms and direct rendering in FT_Load_Glyph:
Most of the functionality found in <freetype/ftglyph.h> has been
moved to the core library. Hence, the following:
- a transform can be specified for a face through FT_Set_Transform.
this transform is applied by FT_Load_Glyph to scalable glyph images
(i.e. NOT TO BITMAPS) before the function returns, unless the
bit flag FT_LOAD_IGNORE_TRANSFORM was set in the load flags..
- once a glyph image has been loaded, it can be directly converted to
a bitmap by using the new FT_Render_Glyph function. Note that this
function takes the glyph image from the glyph slot, and converts
it to a bitmap whose properties are returned in "face.glyph.bitmap",
"face.glyph.bitmap_left" and "face.glyph.bitmap_top". The original
native image might be lost after the conversion.
- when using the new bit flag FT_LOAD_RENDER, the FT_Load_Glyph
and FT_Load_Char functions will call FT_Render_Glyph automatically
when needed.
2000-06-22 02:17:42 +02:00
|
|
|
FT_TRACE2(( "[not a valid CID-keyed font]\n" ));
|
2000-06-01 05:27:48 +02:00
|
|
|
error = FT_Err_Unknown_File_Format;
|
|
|
|
}
|
|
|
|
|
|
|
|
FORGET_Frame();
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2000-06-01 05:27:48 +02:00
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
/* now, read the rest of the file, until we find a `StartData' */
|
2000-06-01 05:27:48 +02:00
|
|
|
buff_len = 256;
|
|
|
|
for (;;)
|
|
|
|
{
|
2000-07-05 06:32:02 +02:00
|
|
|
FT_Byte *p, *limit = buffer + 256;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
/* fill input buffer */
|
|
|
|
buff_len -= 256;
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( buff_len > 0 )
|
2000-06-01 05:27:48 +02:00
|
|
|
MEM_Move( buffer, limit, buff_len );
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
if ( FILE_Read( buffer, 256 + 10 - buff_len ) )
|
2000-06-01 05:27:48 +02:00
|
|
|
goto Exit;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
buff_len = 256 + 10;
|
|
|
|
|
2000-07-01 00:24:36 +02:00
|
|
|
/* look for `StartData' */
|
2000-06-01 05:27:48 +02:00
|
|
|
for ( p = buffer; p < limit; p++ )
|
|
|
|
{
|
|
|
|
if ( p[0] == 'S' && strncmp( (char*)p, "StartData", 9 ) == 0 )
|
|
|
|
{
|
2000-07-01 00:24:36 +02:00
|
|
|
/* save offset of binary data after `StartData' */
|
2000-06-16 08:49:56 +02:00
|
|
|
offset = FILE_Pos() - ( limit - p ) + 10;
|
2000-06-01 05:27:48 +02:00
|
|
|
goto Found;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2000-06-16 08:49:56 +02:00
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
Found:
|
2000-07-01 00:24:36 +02:00
|
|
|
/* we have found the start of the binary data. We will now */
|
2000-06-16 08:49:56 +02:00
|
|
|
/* rewind and extract the frame of corresponding to the Postscript */
|
|
|
|
/* section */
|
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
ps_len = offset - base_offset;
|
|
|
|
if ( FILE_Seek( base_offset ) ||
|
|
|
|
EXTRACT_Frame( ps_len, parser->postscript ) )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
parser->data_offset = offset;
|
|
|
|
parser->postscript_len = ps_len;
|
|
|
|
parser->cursor = parser->postscript;
|
|
|
|
parser->limit = parser->cursor + ps_len;
|
|
|
|
parser->num_dict = -1;
|
|
|
|
|
|
|
|
Exit:
|
2000-06-16 08:49:56 +02:00
|
|
|
return error;
|
2000-06-01 05:27:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
LOCAL_FUNC
|
|
|
|
void CID_Done_Parser( CID_Parser* parser )
|
|
|
|
{
|
|
|
|
/* always free the private dictionary */
|
2000-06-16 08:49:56 +02:00
|
|
|
if ( parser->postscript )
|
2000-06-01 05:27:48 +02:00
|
|
|
{
|
|
|
|
FT_Stream stream = parser->stream;
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
|
2000-06-01 05:27:48 +02:00
|
|
|
RELEASE_Frame( parser->postscript );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-06-16 08:49:56 +02:00
|
|
|
|
|
|
|
/* END */
|