2002-05-18 14:03:43 +02:00
|
|
|
/*
|
|
|
|
* Copyright 2000 Computing Research Labs, New Mexico State University
|
2002-05-21 16:13:01 +02:00
|
|
|
* Copyright 2001, 2002 Francesco Zappa Nardelli
|
2002-05-18 14:03:43 +02:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
* copy of this software and associated documentation files (the "Software"),
|
|
|
|
* to deal in the Software without restriction, including without limitation
|
|
|
|
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
|
* and/or sell copies of the Software, and to permit persons to whom the
|
|
|
|
* Software is furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE COMPUTING RESEARCH LAB OR NEW MEXICO STATE UNIVERSITY BE LIABLE FOR ANY
|
|
|
|
* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT
|
|
|
|
* OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR
|
|
|
|
* THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
*/
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* This file is based on bdf.c,v 1.22 2000/03/16 20:08:50 */
|
|
|
|
/* */
|
|
|
|
/* taken from Mark Leisher's xmbdfed package */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
#include <ft2build.h>
|
|
|
|
|
2002-05-29 00:38:05 +02:00
|
|
|
#include FT_FREETYPE_H
|
2002-05-18 14:03:43 +02:00
|
|
|
#include FT_INTERNAL_DEBUG_H
|
|
|
|
#include FT_INTERNAL_STREAM_H
|
|
|
|
#include FT_INTERNAL_OBJECTS_H
|
|
|
|
|
|
|
|
#include "bdf.h"
|
|
|
|
#include "bdferror.h"
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* 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. */
|
|
|
|
/* */
|
|
|
|
#undef FT_COMPONENT
|
|
|
|
#define FT_COMPONENT trace_bdflib
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* Default BDF font options. */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
static const bdf_options_t _bdf_opts =
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
1, /* Correct metrics. */
|
|
|
|
1, /* Preserve unencoded glyphs. */
|
2002-05-21 16:13:01 +02:00
|
|
|
0, /* Preserve comments. */
|
|
|
|
BDF_PROPORTIONAL /* Default spacing. */
|
|
|
|
};
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* Builtin BDF font properties. */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* List of most properties that might appear in a font. Doesn't include */
|
|
|
|
/* the RAW_* and AXIS_* properties in X11R6 polymorphic fonts. */
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
static const bdf_property_t _bdf_properties[] =
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
|
|
|
{ (char *)"ADD_STYLE_NAME", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"AVERAGE_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"AVG_CAPITAL_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"AVG_LOWERCASE_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"CAP_HEIGHT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"CHARSET_COLLECTIONS", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"CHARSET_ENCODING", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"CHARSET_REGISTRY", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"COMMENT", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"COPYRIGHT", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"DEFAULT_CHAR", BDF_CARDINAL, 1, { 0 } },
|
|
|
|
{ (char *)"DESTINATION", BDF_CARDINAL, 1, { 0 } },
|
|
|
|
{ (char *)"DEVICE_FONT_NAME", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"END_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"FACE_NAME", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"FAMILY_NAME", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"FIGURE_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"FONT", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"FONTNAME_REGISTRY", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"FONT_ASCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"FONT_DESCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"FOUNDRY", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"FULL_NAME", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"ITALIC_ANGLE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"MAX_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"MIN_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"NORM_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"NOTICE", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"PIXEL_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"POINT_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"QUAD_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_ASCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_AVERAGE_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_AVG_CAPITAL_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_AVG_LOWERCASE_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_CAP_HEIGHT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_DESCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_END_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_FIGURE_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_MAX_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_MIN_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_NORM_SPACE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_PIXEL_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_POINT_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_PIXELSIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_POINTSIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_QUAD_WIDTH", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_SMALL_CAP_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_STRIKEOUT_ASCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_STRIKEOUT_DESCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_SUBSCRIPT_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_SUBSCRIPT_X", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_SUBSCRIPT_Y", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_SUPERSCRIPT_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_SUPERSCRIPT_X", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_SUPERSCRIPT_Y", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_UNDERLINE_POSITION", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_UNDERLINE_THICKNESS", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RAW_X_HEIGHT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RELATIVE_SETWIDTH", BDF_CARDINAL, 1, { 0 } },
|
|
|
|
{ (char *)"RELATIVE_WEIGHT", BDF_CARDINAL, 1, { 0 } },
|
|
|
|
{ (char *)"RESOLUTION", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"RESOLUTION_X", BDF_CARDINAL, 1, { 0 } },
|
|
|
|
{ (char *)"RESOLUTION_Y", BDF_CARDINAL, 1, { 0 } },
|
|
|
|
{ (char *)"SETWIDTH_NAME", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"SLANT", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"SMALL_CAP_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"SPACING", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"STRIKEOUT_ASCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"STRIKEOUT_DESCENT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"SUBSCRIPT_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"SUBSCRIPT_X", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"SUBSCRIPT_Y", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"SUPERSCRIPT_SIZE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"SUPERSCRIPT_X", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"SUPERSCRIPT_Y", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"UNDERLINE_POSITION", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"UNDERLINE_THICKNESS", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"WEIGHT", BDF_CARDINAL, 1, { 0 } },
|
|
|
|
{ (char *)"WEIGHT_NAME", BDF_ATOM, 1, { 0 } },
|
|
|
|
{ (char *)"X_HEIGHT", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"_MULE_BASELINE_OFFSET", BDF_INTEGER, 1, { 0 } },
|
|
|
|
{ (char *)"_MULE_RELATIVE_COMPOSE", BDF_INTEGER, 1, { 0 } },
|
|
|
|
};
|
|
|
|
|
|
|
|
static unsigned long
|
|
|
|
_num_bdf_properties = sizeof ( _bdf_properties ) /
|
|
|
|
sizeof ( _bdf_properties[0] );
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* Hash table utilities for the properties. */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
|
|
|
|
|
|
|
/* XXX: Replace this with FreeType's hash functions */
|
|
|
|
|
|
|
|
|
|
|
|
#define INITIAL_HT_SIZE 241
|
|
|
|
|
|
|
|
typedef void
|
|
|
|
(*hash_free_func)( hashnode node );
|
|
|
|
|
|
|
|
static hashnode*
|
|
|
|
hash_bucket( char* key,
|
|
|
|
hashtable* ht )
|
|
|
|
{
|
|
|
|
char* kp = key;
|
|
|
|
unsigned long res = 0;
|
|
|
|
hashnode* bp = ht->table, *ndp;
|
|
|
|
|
|
|
|
|
|
|
|
/* Mocklisp hash function. */
|
|
|
|
while ( *kp )
|
|
|
|
res = ( res << 5 ) - res + *kp++;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
ndp = bp + ( res % ht->size );
|
|
|
|
while ( *ndp )
|
|
|
|
{
|
|
|
|
kp = (*ndp)->key;
|
|
|
|
if ( kp[0] == key[0] && ft_strcmp( kp, key ) == 0 )
|
|
|
|
break;
|
|
|
|
ndp--;
|
|
|
|
if ( ndp < bp )
|
|
|
|
ndp = bp + ( ht->size - 1 );
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
return ndp;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static FT_Error
|
|
|
|
hash_rehash( hashtable* ht,
|
|
|
|
FT_Memory memory )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
hashnode* obp = ht->table, *bp, *nbp;
|
|
|
|
int i, sz = ht->size;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
ht->size <<= 1;
|
|
|
|
ht->limit = ht->size / 3;
|
|
|
|
|
|
|
|
if ( FT_NEW_ARRAY( ht->table, ht->size ) )
|
|
|
|
goto Exit;
|
|
|
|
FT_MEM_SET( ht->table, 0, sizeof ( hashnode ) * ht->size );
|
|
|
|
|
|
|
|
for ( i = 0, bp = obp; i < sz; i++, bp++ )
|
|
|
|
{
|
|
|
|
if ( *bp )
|
|
|
|
{
|
|
|
|
nbp = hash_bucket( (*bp)->key, ht );
|
|
|
|
*nbp = *bp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
FT_FREE( obp );
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static FT_Error
|
|
|
|
hash_init( hashtable* ht,
|
|
|
|
FT_Memory memory )
|
|
|
|
{
|
|
|
|
int sz = INITIAL_HT_SIZE;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
|
|
|
|
|
|
|
|
|
|
|
ht->size = sz;
|
|
|
|
ht->limit = sz / 3;
|
|
|
|
ht->used = 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( FT_NEW_ARRAY( ht->table, sz ) )
|
|
|
|
goto Exit;
|
|
|
|
FT_MEM_SET( ht->table, 0, sizeof ( hashnode ) * sz );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
Exit:
|
2002-05-18 14:03:43 +02:00
|
|
|
return error;
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
static void
|
|
|
|
hash_free( hashtable* ht,
|
|
|
|
FT_Memory memory )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( ht != 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
int i, sz = ht->size;
|
|
|
|
hashnode* bp = ht->table;
|
|
|
|
|
|
|
|
|
|
|
|
for ( i = 0; i < sz; i++, bp++ )
|
|
|
|
FT_FREE( *bp );
|
|
|
|
|
|
|
|
FT_FREE( ht->table );
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static FT_Error
|
|
|
|
hash_insert( char* key,
|
|
|
|
void* data,
|
|
|
|
hashtable* ht,
|
|
|
|
FT_Memory memory )
|
|
|
|
{
|
|
|
|
hashnode nn, *bp = hash_bucket( key, ht );
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
nn = *bp;
|
|
|
|
if ( !nn )
|
|
|
|
{
|
|
|
|
if ( FT_NEW( nn ) )
|
|
|
|
goto Exit;
|
|
|
|
*bp = nn;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
nn->key = key;
|
|
|
|
nn->data = data;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( ht->used >= ht->limit )
|
|
|
|
{
|
|
|
|
error = hash_rehash( ht, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
ht->used++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
nn->data = data;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
Exit:
|
|
|
|
return error;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static hashnode
|
|
|
|
hash_lookup( char* key,
|
|
|
|
hashtable* ht )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
hashnode *np = hash_bucket( key, ht );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
return *np;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* Utility types and functions. */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Function type for parsing lines of a BDF font. */
|
|
|
|
|
|
|
|
typedef FT_Error
|
|
|
|
(*_bdf_line_func_t)( char* line,
|
|
|
|
unsigned long linelen,
|
|
|
|
unsigned long lineno,
|
|
|
|
void* call_data,
|
|
|
|
void* client_data );
|
|
|
|
|
|
|
|
|
|
|
|
/* List structure for splitting lines into fields. */
|
|
|
|
|
|
|
|
typedef struct _bdf_list_t_
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
char** field;
|
|
|
|
unsigned long size;
|
|
|
|
unsigned long used;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
} _bdf_list_t;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Structure used while loading BDF fonts. */
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
typedef struct _bdf_parse_t_
|
|
|
|
{
|
|
|
|
unsigned long flags;
|
|
|
|
unsigned long cnt;
|
|
|
|
unsigned long row;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
short minlb;
|
|
|
|
short maxlb;
|
|
|
|
short maxrb;
|
|
|
|
short maxas;
|
|
|
|
short maxds;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
short rbearing;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
char* glyph_name;
|
|
|
|
long glyph_enc;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
bdf_font_t* font;
|
|
|
|
bdf_options_t* opts;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
unsigned long have[2048];
|
|
|
|
_bdf_list_t list;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_Memory memory;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
} _bdf_parse_t;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
#define setsbit( m, cc ) ( m[(cc) >> 3] |= (FT_Byte)( 1 << ( (cc) & 7 ) ) )
|
2002-05-21 16:13:01 +02:00
|
|
|
#define sbitset( m, cc ) ( m[(cc) >> 3] & ( 1 << ( (cc) & 7 ) ) )
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* An empty string for empty fields. */
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static char empty[1] = { 0 }; /* XXX eliminate this */
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Assume the line is NULL-terminated and that the `list' parameter */
|
|
|
|
/* was initialized the first time it was used. */
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static FT_Error
|
|
|
|
_bdf_split( char* separators,
|
|
|
|
char* line,
|
|
|
|
unsigned long linelen,
|
|
|
|
_bdf_list_t* list,
|
|
|
|
FT_Memory memory )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
int mult, final_empty;
|
|
|
|
char *sp, *ep, *end;
|
|
|
|
char seps[32];
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
|
|
|
|
|
|
|
|
|
|
|
/* Initialize the list. */
|
|
|
|
list->used = 0;
|
|
|
|
|
|
|
|
/* If the line is empty, then simply return. */
|
|
|
|
if ( linelen == 0 || line[0] == 0 )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
/* In the original code, if the `separators' parameter is NULL or */
|
|
|
|
/* empty, the list is split into individual bytes. We don't need */
|
|
|
|
/* this, so an error is signaled. */
|
|
|
|
if ( separators == 0 || *separators == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
error = BDF_Err_Invalid_Argument;
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Prepare the separator bitmap. */
|
|
|
|
FT_MEM_SET( seps, 0, 32 );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* If the very last character of the separator string is a plus, then */
|
|
|
|
/* set the `mult' flag to indicate that multiple separators should be */
|
|
|
|
/* collapsed into one. */
|
|
|
|
for ( mult = 0, sp = separators; sp && *sp; sp++ )
|
|
|
|
{
|
|
|
|
if ( *sp == '+' && *( sp + 1 ) == 0 )
|
|
|
|
mult = 1;
|
|
|
|
else
|
|
|
|
setsbit( seps, *sp );
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Break the line up into fields. */
|
|
|
|
for ( final_empty = 0, sp = ep = line, end = sp + linelen;
|
|
|
|
sp < end && *sp; )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Collect everything that is not a separator. */
|
|
|
|
for ( ; *ep && !sbitset( seps, *ep ); ep++ )
|
|
|
|
;
|
|
|
|
|
|
|
|
/* Resize the list if necessary. */
|
|
|
|
if ( list->used == list->size )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( list->size == 0 )
|
|
|
|
{
|
|
|
|
if ( FT_NEW_ARRAY( list->field, 5 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( FT_RENEW_ARRAY ( list->field ,
|
|
|
|
list->size,
|
|
|
|
list->size + 5 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
list->size += 5;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
/* Assign the field appropriately. */
|
|
|
|
list->field[list->used++] = ( ep > sp ) ? sp : empty;
|
|
|
|
|
|
|
|
sp = ep;
|
|
|
|
|
|
|
|
if ( mult )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
/* If multiple separators should be collapsed, do it now by */
|
|
|
|
/* setting all the separator characters to 0. */
|
|
|
|
for ( ; *ep && sbitset( seps, *ep ); ep++ )
|
|
|
|
*ep = 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
else if ( *ep != 0 )
|
|
|
|
/* Don't collapse multiple separators by making them 0, so just */
|
|
|
|
/* make the one encountered 0. */
|
|
|
|
*ep++ = 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
final_empty = ( ep > sp && *ep == 0 );
|
|
|
|
sp = ep;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Finally, NULL-terminate the list. */
|
|
|
|
if ( list->used + final_empty + 1 >= list->size )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( list->used == list->size )
|
|
|
|
{
|
|
|
|
if ( list->size == 0 )
|
|
|
|
{
|
|
|
|
if ( FT_NEW_ARRAY( list->field, 5 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( FT_RENEW_ARRAY( list->field,
|
|
|
|
list->size,
|
|
|
|
list->size + 5 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
list->size += 5;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( final_empty )
|
|
|
|
list->field[list->used++] = empty;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
if ( list->used == list->size )
|
|
|
|
{
|
|
|
|
if ( list->size == 0 )
|
|
|
|
{
|
|
|
|
if ( FT_NEW_ARRAY( list->field, 5 ) )
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( FT_RENEW_ARRAY( list->field,
|
|
|
|
list->size,
|
|
|
|
list->size + 5 ) )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
list->size += 5;
|
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
list->field[list->used] = 0;
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static void
|
|
|
|
_bdf_shift( unsigned long n,
|
|
|
|
_bdf_list_t* list )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
unsigned long i, u;
|
|
|
|
|
|
|
|
|
|
|
|
if ( list == 0 || list->used == 0 || n == 0 )
|
|
|
|
return;
|
|
|
|
|
|
|
|
if ( n >= list->used )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
list->used = 0;
|
|
|
|
return;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
for ( u = n, i = 0; u < list->used; i++, u++ )
|
|
|
|
list->field[i] = list->field[u];
|
|
|
|
list->used -= n;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static char *
|
|
|
|
_bdf_join( int c,
|
|
|
|
unsigned long* len,
|
|
|
|
_bdf_list_t* list )
|
|
|
|
{
|
|
|
|
unsigned long i, j;
|
|
|
|
char *fp, *dp;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( list == 0 || list->used == 0 )
|
|
|
|
return 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
*len = 0;
|
|
|
|
|
|
|
|
dp = list->field[0];
|
|
|
|
for ( i = j = 0; i < list->used; i++ )
|
|
|
|
{
|
|
|
|
fp = list->field[i];
|
|
|
|
while ( *fp )
|
|
|
|
dp[j++] = *fp++;
|
|
|
|
|
|
|
|
if ( i + 1 < list->used )
|
2002-05-21 23:17:43 +02:00
|
|
|
dp[j++] = (char)c;
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
|
|
|
dp[j] = 0;
|
|
|
|
|
|
|
|
*len = j;
|
|
|
|
return dp;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* High speed file reader that passes each line to a callback. */
|
|
|
|
static FT_Error
|
|
|
|
bdf_internal_readstream( FT_Stream stream,
|
|
|
|
char* buffer,
|
|
|
|
int count,
|
|
|
|
int *read_bytes )
|
|
|
|
{
|
|
|
|
int rbytes;
|
|
|
|
unsigned long pos = stream->pos;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( pos > stream->size )
|
|
|
|
{
|
|
|
|
FT_ERROR(( "bdf_internal_readstream:" ));
|
|
|
|
FT_ERROR(( " invalid i/o; pos = 0x%lx, size = 0x%lx\n",
|
|
|
|
pos, stream->size ));
|
|
|
|
error = BDF_Err_Invalid_Stream_Operation;
|
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( stream->read )
|
|
|
|
rbytes = stream->read( stream, pos,
|
|
|
|
(unsigned char *)buffer, count );
|
|
|
|
else
|
|
|
|
{
|
|
|
|
rbytes = stream->size - pos;
|
|
|
|
if ( rbytes > count )
|
|
|
|
rbytes = count;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_MEM_COPY( buffer, stream->base + pos, rbytes );
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
stream->pos = pos + rbytes;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
*read_bytes = rbytes;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
Exit:
|
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
static FT_Error
|
|
|
|
_bdf_readstream( FT_Stream stream,
|
|
|
|
_bdf_line_func_t callback,
|
|
|
|
void* client_data,
|
|
|
|
unsigned long *lno )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
_bdf_line_func_t cb;
|
|
|
|
unsigned long lineno;
|
|
|
|
int n, res, done, refill, bytes, hold;
|
|
|
|
char *ls, *le, *pp, *pe, *hp;
|
2002-05-30 21:29:41 +02:00
|
|
|
char *buf = 0;
|
|
|
|
FT_Memory memory = stream->memory;
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( callback == 0 )
|
|
|
|
{
|
|
|
|
error = BDF_Err_Invalid_Argument;
|
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-30 21:29:41 +02:00
|
|
|
if ( FT_NEW_ARRAY( buf, 65536L ) )
|
|
|
|
goto Exit;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
cb = callback;
|
|
|
|
lineno = 1;
|
|
|
|
buf[0] = 0;
|
|
|
|
|
|
|
|
res = done = 0;
|
|
|
|
pp = ls = le = buf;
|
|
|
|
|
|
|
|
bytes = 65536L;
|
|
|
|
|
|
|
|
while ( !done )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
error = bdf_internal_readstream( stream, pp, bytes, &n );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( n == 0 )
|
|
|
|
break;
|
|
|
|
|
|
|
|
/* Determine the new end of the buffer pages. */
|
|
|
|
pe = pp + n;
|
|
|
|
|
|
|
|
for ( refill = 0; done == 0 && refill == 0; )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
while ( le < pe && *le != '\n' && *le != '\r' )
|
|
|
|
le++;
|
|
|
|
|
|
|
|
if ( le == pe )
|
|
|
|
{
|
|
|
|
/* Hit the end of the last page in the buffer. Need to find */
|
|
|
|
/* out how many pages to shift and how many pages need to be */
|
|
|
|
/* read in. Adjust the line start and end pointers down to */
|
|
|
|
/* point to the right places in the pages. */
|
|
|
|
|
|
|
|
pp = buf + ( ( ( ls - buf ) >> 13 ) << 13 );
|
|
|
|
n = pp - buf;
|
|
|
|
ls -= n;
|
|
|
|
le -= n;
|
|
|
|
n = pe - pp;
|
|
|
|
|
|
|
|
FT_MEM_COPY( buf, pp, n );
|
|
|
|
|
|
|
|
pp = buf + n;
|
|
|
|
bytes = 65536L - n;
|
|
|
|
refill = 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Temporarily NULL-terminate the line. */
|
|
|
|
hp = le;
|
|
|
|
hold = *le;
|
|
|
|
*le = 0;
|
|
|
|
|
|
|
|
/* XXX: Use encoding independent value for 0x1a */
|
|
|
|
if ( *ls != '#' && *ls != 0x1a &&
|
|
|
|
le > ls &&
|
|
|
|
( error = (*cb)( ls, le - ls, lineno, (void *)&cb,
|
|
|
|
client_data ) ) != BDF_Err_Ok )
|
|
|
|
done = 1;
|
|
|
|
else
|
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
ls = ++le;
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Handle the case of DOS crlf sequences. */
|
|
|
|
if ( le < pe && hold == '\n' && *le =='\r' )
|
2002-05-18 14:03:43 +02:00
|
|
|
ls = ++le;
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Increment the line number. */
|
|
|
|
lineno++;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Restore the character at the end of the line. */
|
2002-05-21 23:17:43 +02:00
|
|
|
*hp = (char)hold;
|
2002-05-29 01:40:37 +02:00
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
*lno = lineno;
|
|
|
|
|
|
|
|
Exit:
|
2002-05-30 21:29:41 +02:00
|
|
|
FT_FREE( buf );
|
2002-05-21 16:13:01 +02:00
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
/* XXX: make this work with EBCDIC also */
|
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
static const unsigned char a2i[128] =
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
|
2002-05-21 16:13:01 +02:00
|
|
|
};
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
static const unsigned char odigits[32] =
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
2002-05-21 16:13:01 +02:00
|
|
|
};
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
static const unsigned char ddigits[32] =
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0x03,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
2002-05-21 16:13:01 +02:00
|
|
|
};
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
static const unsigned char hdigits[32] =
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0x03,
|
|
|
|
0x7e, 0x00, 0x00, 0x00, 0x7e, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
|
|
|
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
|
2002-05-21 16:13:01 +02:00
|
|
|
};
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
#define isdigok( m, d ) (m[(d) >> 3] & ( 1 << ( (d) & 7 ) ) )
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Routine to convert an ASCII string into an unsigned long integer. */
|
|
|
|
static unsigned long
|
|
|
|
_bdf_atoul( char* s,
|
|
|
|
char** end,
|
|
|
|
int base )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 23:17:43 +02:00
|
|
|
unsigned long v;
|
|
|
|
const unsigned char* dmap;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( s == 0 || *s == 0 )
|
|
|
|
return 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Make sure the radix is something recognizable. Default to 10. */
|
|
|
|
switch ( base )
|
|
|
|
{
|
|
|
|
case 8:
|
|
|
|
dmap = odigits;
|
|
|
|
break;
|
|
|
|
case 16:
|
|
|
|
dmap = hdigits;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
base = 10;
|
|
|
|
dmap = ddigits;
|
|
|
|
break;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Check for the special hex prefix. */
|
|
|
|
if ( *s == '0' &&
|
|
|
|
( *( s + 1 ) == 'x' || *( s + 1 ) == 'X' ) )
|
|
|
|
{
|
|
|
|
base = 16;
|
|
|
|
dmap = hdigits;
|
|
|
|
s += 2;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
for ( v = 0; isdigok( dmap, *s ); s++ )
|
|
|
|
v = v * base + a2i[(int)*s];
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( end != 0 )
|
|
|
|
*end = s;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
return v;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
/* Routine to convert an ASCII string into an signed long integer. */
|
|
|
|
static long
|
|
|
|
_bdf_atol( char* s,
|
|
|
|
char** end,
|
|
|
|
int base )
|
|
|
|
{
|
2002-05-21 23:17:43 +02:00
|
|
|
long v, neg;
|
|
|
|
const unsigned char* dmap;
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
|
|
|
|
if ( s == 0 || *s == 0 )
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Make sure the radix is something recognizable. Default to 10. */
|
|
|
|
switch ( base )
|
|
|
|
{
|
|
|
|
case 8:
|
|
|
|
dmap = odigits;
|
|
|
|
break;
|
|
|
|
case 16:
|
|
|
|
dmap = hdigits;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
base = 10;
|
|
|
|
dmap = ddigits;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for a minus sign. */
|
|
|
|
neg = 0;
|
|
|
|
if ( *s == '-' )
|
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
s++;
|
|
|
|
neg = 1;
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Check for the special hex prefix. */
|
|
|
|
if ( *s == '0' &&
|
|
|
|
( *( s + 1 ) == 'x' || *( s + 1 ) == 'X' ) )
|
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
base = 16;
|
|
|
|
dmap = hdigits;
|
2002-05-21 16:13:01 +02:00
|
|
|
s += 2;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
for ( v = 0; isdigok( dmap, *s ); s++ )
|
|
|
|
v = v * base + a2i[(int)*s];
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( end != 0 )
|
|
|
|
*end = s;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
return ( !neg ) ? v : -v;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Routine to convert an ASCII string into an signed short integer. */
|
|
|
|
static short
|
|
|
|
_bdf_atos( char* s,
|
|
|
|
char** end,
|
|
|
|
int base )
|
|
|
|
{
|
2002-05-21 23:17:43 +02:00
|
|
|
short v, neg;
|
|
|
|
const unsigned char* dmap;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( s == 0 || *s == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
return 0;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Make sure the radix is something recognizable. Default to 10. */
|
|
|
|
switch ( base )
|
|
|
|
{
|
|
|
|
case 8:
|
|
|
|
dmap = odigits;
|
|
|
|
break;
|
|
|
|
case 16:
|
|
|
|
dmap = hdigits;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
base = 10;
|
|
|
|
dmap = ddigits;
|
|
|
|
break;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Check for a minus. */
|
2002-05-18 14:03:43 +02:00
|
|
|
neg = 0;
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( *s == '-' )
|
|
|
|
{
|
|
|
|
s++;
|
|
|
|
neg = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Check for the special hex prefix. */
|
|
|
|
if ( *s == '0' &&
|
|
|
|
( *( s + 1 ) == 'x' || *( s + 1 ) == 'X' ) )
|
|
|
|
{
|
|
|
|
base = 16;
|
|
|
|
dmap = hdigits;
|
|
|
|
s += 2;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
for ( v = 0; isdigok( dmap, *s ); s++ )
|
2002-05-22 07:41:06 +02:00
|
|
|
v = (short)( v * base + a2i[(int)*s] );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( end != 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
*end = s;
|
|
|
|
|
2002-05-22 07:41:06 +02:00
|
|
|
return (short)( ( !neg ) ? v : -v );
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Routine to compare two glyphs by encoding so they can be sorted. */
|
|
|
|
static int
|
|
|
|
by_encoding( const void* a,
|
|
|
|
const void* b )
|
|
|
|
{
|
|
|
|
bdf_glyph_t *c1, *c2;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
c1 = (bdf_glyph_t *)a;
|
|
|
|
c2 = (bdf_glyph_t *)b;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( c1->encoding < c2->encoding )
|
|
|
|
return -1;
|
|
|
|
else if ( c1->encoding > c2->encoding )
|
|
|
|
return 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
return 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
static FT_Error
|
|
|
|
bdf_create_property( char* name,
|
|
|
|
int format,
|
|
|
|
bdf_font_t* font )
|
|
|
|
{
|
|
|
|
unsigned long n;
|
|
|
|
bdf_property_t* p;
|
|
|
|
FT_Memory memory = font->memory;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* First check to see if the property has */
|
|
|
|
/* already been added or not. If it has, then */
|
|
|
|
/* simply ignore it. */
|
|
|
|
if ( hash_lookup( name, &(font->proptbl) ) )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( font->nuser_props == 0 )
|
|
|
|
{
|
|
|
|
if ( FT_NEW_ARRAY( font->user_props, 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( FT_RENEW_ARRAY( font->user_props,
|
|
|
|
font->nuser_props,
|
|
|
|
font->nuser_props + 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
p = font->user_props + font->nuser_props;
|
|
|
|
FT_MEM_SET( p, 0, sizeof ( bdf_property_t ) );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
n = (unsigned long)( ft_strlen( name ) + 1 );
|
|
|
|
if ( FT_NEW_ARRAY( p->name, n ) )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_MEM_COPY( (char *)p->name, name, n );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
p->format = format;
|
|
|
|
p->builtin = 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
n = _num_bdf_properties + font->nuser_props;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
error = hash_insert( p->name, (void *)n, &(font->proptbl), memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
font->nuser_props++;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
Exit:
|
|
|
|
return error;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_LOCAL_DEF( bdf_property_t * )
|
|
|
|
bdf_get_property( char* name,
|
|
|
|
bdf_font_t* font )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
hashnode hn;
|
|
|
|
unsigned long propid;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( name == 0 || *name == 0 )
|
|
|
|
return 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( ( hn = hash_lookup( name, &(font->proptbl) ) ) == 0 )
|
|
|
|
return 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
propid = (unsigned long)hn->data;
|
|
|
|
if ( propid >= _num_bdf_properties )
|
|
|
|
return font->user_props + ( propid - _num_bdf_properties );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-22 07:41:06 +02:00
|
|
|
return (bdf_property_t*)_bdf_properties + propid;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* BDF font file parsing flags and functions. */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
/* Parse flags. */
|
|
|
|
|
|
|
|
#define _BDF_START 0x0001
|
|
|
|
#define _BDF_FONT_NAME 0x0002
|
|
|
|
#define _BDF_SIZE 0x0004
|
|
|
|
#define _BDF_FONT_BBX 0x0008
|
|
|
|
#define _BDF_PROPS 0x0010
|
|
|
|
#define _BDF_GLYPHS 0x0020
|
|
|
|
#define _BDF_GLYPH 0x0040
|
|
|
|
#define _BDF_ENCODING 0x0080
|
|
|
|
#define _BDF_SWIDTH 0x0100
|
|
|
|
#define _BDF_DWIDTH 0x0200
|
|
|
|
#define _BDF_BBX 0x0400
|
|
|
|
#define _BDF_BITMAP 0x0800
|
|
|
|
|
|
|
|
#define _BDF_SWIDTH_ADJ 0x1000
|
|
|
|
|
|
|
|
#define _BDF_GLYPH_BITS ( _BDF_GLYPH | \
|
|
|
|
_BDF_ENCODING | \
|
|
|
|
_BDF_SWIDTH | \
|
|
|
|
_BDF_DWIDTH | \
|
|
|
|
_BDF_BBX | \
|
|
|
|
_BDF_BITMAP )
|
|
|
|
|
|
|
|
#define _BDF_GLYPH_WIDTH_CHECK 0x40000000L
|
|
|
|
#define _BDF_GLYPH_HEIGHT_CHECK 0x80000000L
|
|
|
|
|
|
|
|
|
|
|
|
/* Auto correction messages. */
|
|
|
|
#define ACMSG1 "FONT_ASCENT property missing. " \
|
|
|
|
"Added \"FONT_ASCENT %hd\".\n"
|
|
|
|
#define ACMSG2 "FONT_DESCENT property missing. " \
|
|
|
|
"Added \"FONT_DESCENT %hd\".\n"
|
|
|
|
#define ACMSG3 "Font width != actual width. Old: %hd New: %hd.\n"
|
|
|
|
#define ACMSG4 "Font left bearing != actual left bearing. " \
|
|
|
|
"Old: %hd New: %hd.\n"
|
|
|
|
#define ACMSG5 "Font ascent != actual ascent. Old: %hd New: %hd.\n"
|
|
|
|
#define ACMSG6 "Font descent != actual descent. Old: %hd New: %hd.\n"
|
|
|
|
#define ACMSG7 "Font height != actual height. Old: %hd New: %hd.\n"
|
|
|
|
#define ACMSG8 "Glyph scalable width (SWIDTH) adjustments made.\n"
|
|
|
|
#define ACMSG9 "SWIDTH field missing at line %ld. Set automatically.\n"
|
|
|
|
#define ACMSG10 "DWIDTH field missing at line %ld. Set to glyph width.\n"
|
|
|
|
#define ACMSG11 "SIZE bits per pixel field adjusted to %hd.\n"
|
|
|
|
#define ACMSG12 "Duplicate encoding %ld (%s) changed to unencoded.\n"
|
|
|
|
#define ACMSG13 "Glyph %ld extra rows removed.\n"
|
|
|
|
#define ACMSG14 "Glyph %ld extra columns removed.\n"
|
|
|
|
#define ACMSG15 "Incorrect glyph count: %ld indicated but %ld found.\n"
|
|
|
|
|
|
|
|
/* Error messages. */
|
|
|
|
#define ERRMSG1 "[line %ld] Missing \"%s\" line.\n"
|
|
|
|
#define ERRMSG2 "[line %ld] Font header corrupted or missing fields.\n"
|
|
|
|
#define ERRMSG3 "[line %ld] Font glyphs corrupted or missing fields.\n"
|
|
|
|
|
|
|
|
|
|
|
|
static FT_Error
|
|
|
|
_bdf_add_comment( bdf_font_t* font,
|
|
|
|
char* comment,
|
|
|
|
unsigned long len )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
char* cp;
|
|
|
|
FT_Memory memory = font->memory;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
|
|
|
|
|
|
|
|
|
|
|
if ( font->comments_len == 0 )
|
|
|
|
{
|
|
|
|
if ( FT_NEW_ARRAY( font->comments, len + 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( FT_RENEW_ARRAY( font->comments,
|
|
|
|
font->comments_len,
|
|
|
|
font->comments_len + len + 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
cp = font->comments + font->comments_len;
|
|
|
|
FT_MEM_COPY( cp, comment, len );
|
|
|
|
cp += len;
|
|
|
|
*cp++ = '\n';
|
|
|
|
font->comments_len += len + 1;
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Set the spacing from the font name if it exists, or set it to the */
|
|
|
|
/* default specified in the options. */
|
|
|
|
static FT_Error
|
|
|
|
_bdf_set_default_spacing( bdf_font_t* font,
|
|
|
|
bdf_options_t* opts )
|
|
|
|
{
|
|
|
|
unsigned long len;
|
|
|
|
char name[128];
|
|
|
|
_bdf_list_t list;
|
|
|
|
FT_Memory memory;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( font == 0 || font->name == 0 || font->name[0] == 0 )
|
|
|
|
{
|
|
|
|
error = BDF_Err_Invalid_Argument;
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
memory = font->memory;
|
|
|
|
|
|
|
|
font->spacing = opts->font_spacing;
|
|
|
|
|
|
|
|
len = (unsigned long)( ft_strlen( font->name ) + 1 );
|
|
|
|
FT_MEM_COPY( name, font->name, len );
|
|
|
|
|
|
|
|
list.size = list.used = 0;
|
|
|
|
|
|
|
|
error = _bdf_split( (char *)"-", name, len, &list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
if ( list.used == 15 )
|
|
|
|
{
|
|
|
|
switch ( list.field[11][0] )
|
|
|
|
{
|
|
|
|
case 'C':
|
|
|
|
case 'c':
|
|
|
|
font->spacing = BDF_CHARCELL;
|
|
|
|
break;
|
|
|
|
case 'M':
|
|
|
|
case 'm':
|
|
|
|
font->spacing = BDF_MONOWIDTH;
|
|
|
|
break;
|
|
|
|
case 'P':
|
|
|
|
case 'p':
|
|
|
|
font->spacing = BDF_PROPORTIONAL;
|
|
|
|
break;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
FT_FREE( list.field );
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Determine whether the property is an atom or not. If it is, then */
|
|
|
|
/* clean it up so the double quotes are removed if they exist. */
|
|
|
|
static int
|
|
|
|
_bdf_is_atom( char* line,
|
|
|
|
unsigned long linelen,
|
|
|
|
char** name,
|
|
|
|
char** value,
|
|
|
|
bdf_font_t* font )
|
|
|
|
{
|
|
|
|
int hold;
|
|
|
|
char *sp, *ep;
|
|
|
|
bdf_property_t* p;
|
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
*name = sp = ep = line;
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
while ( *ep && *ep != ' ' && *ep != '\t' )
|
2002-05-18 14:03:43 +02:00
|
|
|
ep++;
|
|
|
|
|
|
|
|
hold = -1;
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( *ep )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
|
|
|
hold = *ep;
|
|
|
|
*ep = 0;
|
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
p = bdf_get_property( sp, font );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Restore the character that was saved before any return can happen. */
|
|
|
|
if ( hold != -1 )
|
2002-05-22 07:41:06 +02:00
|
|
|
*ep = (char)hold;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* If the property exists and is not an atom, just return here. */
|
|
|
|
if ( p && p->format != BDF_ATOM )
|
2002-05-18 14:03:43 +02:00
|
|
|
return 0;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* The property is an atom. Trim all leading and trailing whitespace */
|
|
|
|
/* and double quotes for the atom value. */
|
2002-05-18 14:03:43 +02:00
|
|
|
sp = ep;
|
|
|
|
ep = line + linelen;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Trim the leading whitespace if it exists. */
|
2002-05-18 14:03:43 +02:00
|
|
|
*sp++ = 0;
|
2002-05-21 16:13:01 +02:00
|
|
|
while ( *sp &&
|
|
|
|
( *sp == ' ' || *sp == '\t' ) )
|
2002-05-18 14:03:43 +02:00
|
|
|
sp++;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Trim the leading double quote if it exists. */
|
|
|
|
if ( *sp == '"' )
|
2002-05-18 14:03:43 +02:00
|
|
|
sp++;
|
|
|
|
*value = sp;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Trim the trailing whitespace if it exists. */
|
|
|
|
while ( ep > sp &&
|
|
|
|
( *( ep - 1 ) == ' ' || *( ep - 1 ) == '\t' ) )
|
2002-05-18 14:03:43 +02:00
|
|
|
*--ep = 0;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Trim the trailing double quote if it exists. */
|
|
|
|
if ( ep > sp && *( ep - 1 ) == '"' )
|
2002-05-18 14:03:43 +02:00
|
|
|
*--ep = 0;
|
|
|
|
|
|
|
|
return 1;
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static FT_Error
|
|
|
|
_bdf_add_property( bdf_font_t* font,
|
|
|
|
char* name,
|
|
|
|
char* value )
|
|
|
|
{
|
|
|
|
unsigned long propid;
|
|
|
|
hashnode hn;
|
|
|
|
int len;
|
|
|
|
bdf_property_t *prop, *fp;
|
|
|
|
FT_Memory memory = font->memory;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
|
|
|
|
|
|
|
|
|
|
|
/* First, check to see if the property already exists in the font. */
|
|
|
|
if ( ( hn = hash_lookup( name, (hashtable *)font->internal ) ) != 0 )
|
|
|
|
{
|
|
|
|
/* The property already exists in the font, so simply replace */
|
|
|
|
/* the value of the property with the current value. */
|
|
|
|
fp = font->props + (unsigned long)hn->data;
|
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
switch ( fp->format )
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
|
|
|
case BDF_ATOM:
|
|
|
|
/* Delete the current atom if it exists. */
|
|
|
|
FT_FREE( fp->value.atom );
|
|
|
|
|
|
|
|
if ( value == 0 )
|
|
|
|
len = 1;
|
|
|
|
else
|
|
|
|
len = ft_strlen( value ) + 1;
|
|
|
|
|
|
|
|
if ( len > 1 )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( FT_NEW_ARRAY( fp->value.atom, len ) )
|
|
|
|
goto Exit;
|
|
|
|
FT_MEM_COPY( fp->value.atom, value, len );
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
else
|
|
|
|
fp->value.atom = 0;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case BDF_INTEGER:
|
|
|
|
fp->value.int32 = _bdf_atol( value, 0, 10 );
|
|
|
|
break;
|
|
|
|
|
|
|
|
case BDF_CARDINAL:
|
|
|
|
fp->value.card32 = _bdf_atoul( value, 0, 10 );
|
|
|
|
break;
|
2002-05-29 01:40:37 +02:00
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
default:
|
|
|
|
;
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
2002-05-29 01:40:37 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* See whether this property type exists yet or not. */
|
|
|
|
/* If not, create it. */
|
|
|
|
hn = hash_lookup( name, &(font->proptbl) );
|
|
|
|
if ( hn == 0 )
|
|
|
|
{
|
|
|
|
error = bdf_create_property( name, BDF_ATOM, font );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
hn = hash_lookup( name, &(font->proptbl) );
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Allocate another property if this is overflow. */
|
|
|
|
if ( font->props_used == font->props_size )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( font->props_size == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( FT_NEW_ARRAY( font->props, 1 ) )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( FT_RENEW_ARRAY( font->props,
|
|
|
|
font->props_size,
|
|
|
|
font->props_size + 1 ) )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
fp = font->props + font->props_size;
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_MEM_SET( fp, 0, sizeof ( bdf_property_t ) );
|
2002-05-18 14:03:43 +02:00
|
|
|
font->props_size++;
|
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
propid = (unsigned long)hn->data;
|
|
|
|
if ( propid >= _num_bdf_properties )
|
|
|
|
prop = font->user_props + ( propid - _num_bdf_properties );
|
2002-05-18 14:03:43 +02:00
|
|
|
else
|
2002-05-21 23:17:43 +02:00
|
|
|
prop = (bdf_property_t*)_bdf_properties + propid;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
fp = font->props + font->props_used;
|
|
|
|
|
|
|
|
fp->name = prop->name;
|
|
|
|
fp->format = prop->format;
|
|
|
|
fp->builtin = prop->builtin;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
switch ( prop->format )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
case BDF_ATOM:
|
|
|
|
if ( value == 0 )
|
|
|
|
len = 1;
|
|
|
|
else
|
|
|
|
len = ft_strlen( value ) + 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( len > 1 )
|
|
|
|
{
|
|
|
|
if ( FT_NEW_ARRAY( fp->value.atom, len ) )
|
|
|
|
goto Exit;
|
|
|
|
FT_MEM_COPY( fp->value.atom, value, len );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
fp->value.atom = 0;
|
|
|
|
break;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
case BDF_INTEGER:
|
2002-05-21 16:13:01 +02:00
|
|
|
fp->value.int32 = _bdf_atol( value, 0, 10 );
|
2002-05-18 14:03:43 +02:00
|
|
|
break;
|
|
|
|
|
|
|
|
case BDF_CARDINAL:
|
2002-05-21 16:13:01 +02:00
|
|
|
fp->value.card32 = _bdf_atoul( value, 0, 10 );
|
2002-05-18 14:03:43 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* If the property happens to be a comment, then it doesn't need */
|
|
|
|
/* to be added to the internal hash table. */
|
|
|
|
if ( ft_memcmp( name, "COMMENT", 7 ) != 0 ) {
|
|
|
|
/* Add the property to the font property table. */
|
|
|
|
error = hash_insert( fp->name,
|
|
|
|
(void *)font->props_used,
|
|
|
|
(hashtable *)font->internal,
|
|
|
|
memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
font->props_used++;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Some special cases need to be handled here. The DEFAULT_CHAR */
|
|
|
|
/* property needs to be located if it exists in the property list, the */
|
|
|
|
/* FONT_ASCENT and FONT_DESCENT need to be assigned if they are */
|
|
|
|
/* present, and the SPACING property should override the default */
|
|
|
|
/* spacing. */
|
|
|
|
if ( ft_memcmp( name, "DEFAULT_CHAR", 12 ) == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
font->default_glyph = fp->value.int32;
|
2002-05-21 16:13:01 +02:00
|
|
|
else if ( ft_memcmp( name, "FONT_ASCENT", 11 ) == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
font->font_ascent = fp->value.int32;
|
2002-05-21 16:13:01 +02:00
|
|
|
else if ( ft_memcmp( name, "FONT_DESCENT", 12 ) == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
font->font_descent = fp->value.int32;
|
2002-05-21 16:13:01 +02:00
|
|
|
else if ( ft_memcmp( name, "SPACING", 7 ) == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
{
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( fp->value.atom[0] == 'p' || fp->value.atom[0] == 'P' )
|
2002-05-18 14:03:43 +02:00
|
|
|
font->spacing = BDF_PROPORTIONAL;
|
2002-05-21 16:13:01 +02:00
|
|
|
else if ( fp->value.atom[0] == 'm' || fp->value.atom[0] == 'M' )
|
2002-05-18 14:03:43 +02:00
|
|
|
font->spacing = BDF_MONOWIDTH;
|
2002-05-21 16:13:01 +02:00
|
|
|
else if ( fp->value.atom[0] == 'c' || fp->value.atom[0] == 'C' )
|
2002-05-18 14:03:43 +02:00
|
|
|
font->spacing = BDF_CHARCELL;
|
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
Exit:
|
|
|
|
return error;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
static const unsigned char nibble_mask[8] =
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
|
|
|
0xFF, 0x80, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC, 0xFE
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/* Actually parse the glyph info and bitmaps. */
|
|
|
|
static FT_Error
|
|
|
|
_bdf_parse_glyphs( char* line,
|
|
|
|
unsigned long linelen,
|
|
|
|
unsigned long lineno,
|
|
|
|
void* call_data,
|
|
|
|
void* client_data )
|
|
|
|
{
|
|
|
|
int c, mask_index;
|
|
|
|
char* s;
|
|
|
|
unsigned char* bp;
|
|
|
|
unsigned long i, slen, nibbles;
|
|
|
|
|
|
|
|
_bdf_line_func_t* next;
|
|
|
|
_bdf_parse_t* p;
|
|
|
|
bdf_glyph_t* glyph;
|
|
|
|
bdf_font_t* font;
|
|
|
|
|
|
|
|
FT_Memory memory;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
|
|
|
|
|
|
|
FT_UNUSED( lineno ); /* only used in debug mode */
|
|
|
|
|
|
|
|
|
|
|
|
next = (_bdf_line_func_t *)call_data;
|
|
|
|
p = (_bdf_parse_t *) client_data;
|
|
|
|
|
|
|
|
font = p->font;
|
|
|
|
memory = font->memory;
|
|
|
|
|
|
|
|
/* Check for a comment. */
|
|
|
|
if ( ft_memcmp( line, "COMMENT", 7 ) == 0 )
|
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
linelen -= 7;
|
2002-05-21 16:13:01 +02:00
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
s = line + 7;
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( *s != 0 )
|
|
|
|
{
|
|
|
|
s++;
|
|
|
|
linelen--;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
error = _bdf_add_comment( p->font, s, linelen );
|
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* The very first thing expected is the number of glyphs. */
|
|
|
|
if ( !( p->flags & _BDF_GLYPHS ) )
|
|
|
|
{
|
|
|
|
if ( ft_memcmp( line, "CHARS", 5 ) != 0 )
|
|
|
|
{
|
|
|
|
FT_ERROR(( "_bdf_parse_glyphs: " ERRMSG1, lineno, "CHARS" ));
|
|
|
|
error = BDF_Err_Missing_Chars_Field;
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
p->cnt = font->glyphs_size = _bdf_atoul( p->list.field[1], 0, 10 );
|
|
|
|
|
|
|
|
/* Make sure the number of glyphs is non-zero. */
|
|
|
|
if ( p->cnt == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
font->glyphs_size = 64;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( FT_NEW_ARRAY( font->glyphs, font->glyphs_size ) )
|
|
|
|
goto Exit;
|
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
p->flags |= _BDF_GLYPHS;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for the ENDFONT field. */
|
|
|
|
if ( ft_memcmp( line, "ENDFONT", 7 ) == 0 )
|
|
|
|
{
|
|
|
|
/* Sort the glyphs by encoding. */
|
|
|
|
ft_qsort( (char *)font->glyphs,
|
|
|
|
font->glyphs_used,
|
|
|
|
sizeof ( bdf_glyph_t ),
|
|
|
|
by_encoding );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
p->flags &= ~_BDF_START;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Check for the ENDCHAR field. */
|
|
|
|
if ( ft_memcmp( line, "ENDCHAR", 7 ) == 0 )
|
|
|
|
{
|
|
|
|
p->glyph_enc = 0;
|
|
|
|
p->flags &= ~_BDF_GLYPH_BITS;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check to see whether a glyph is being scanned but should be */
|
|
|
|
/* ignored because it is an unencoded glyph. */
|
|
|
|
if ( ( p->flags & _BDF_GLYPH ) &&
|
|
|
|
p->glyph_enc == -1 &&
|
|
|
|
p->opts->keep_unencoded == 0 )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
/* Check for the STARTCHAR field. */
|
|
|
|
if ( ft_memcmp( line, "STARTCHAR", 9 ) == 0 )
|
|
|
|
{
|
|
|
|
/* Set the character name in the parse info first until the */
|
|
|
|
/* encoding can be checked for an unencoded character. */
|
|
|
|
FT_FREE( p->glyph_name );
|
|
|
|
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list,memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
_bdf_shift( 1, &p->list );
|
|
|
|
|
|
|
|
s = _bdf_join( ' ', &slen, &p->list );
|
|
|
|
|
|
|
|
if ( FT_NEW_ARRAY( p->glyph_name, slen + 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
FT_MEM_COPY( p->glyph_name, s, slen + 1 );
|
|
|
|
|
|
|
|
p->flags |= _BDF_GLYPH;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for the ENCODING field. */
|
|
|
|
if ( ft_memcmp( line, "ENCODING", 8 ) == 0 )
|
|
|
|
{
|
|
|
|
if ( !( p->flags & _BDF_GLYPH ) )
|
|
|
|
{
|
|
|
|
/* Missing STARTCHAR field. */
|
|
|
|
FT_ERROR(( "_bdf_parse_glyphs: " ERRMSG1, lineno, "STARTCHAR" ));
|
|
|
|
error = BDF_Err_Missing_Startchar_Field;
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
p->glyph_enc = _bdf_atol( p->list.field[1], 0, 10 );
|
|
|
|
|
|
|
|
/* Check to see whether this encoding has already been encountered. */
|
|
|
|
/* If it has then change it to unencoded so it gets added if */
|
|
|
|
/* indicated. */
|
|
|
|
if ( p->glyph_enc >= 0 )
|
|
|
|
{
|
|
|
|
if ( _bdf_glyph_modified( p->have, p->glyph_enc ) )
|
|
|
|
{
|
|
|
|
/* Emit a message saying a glyph has been moved to the */
|
|
|
|
/* unencoded area. */
|
|
|
|
FT_TRACE2(( "_bdf_parse_glyphs: " ACMSG12,
|
|
|
|
p->glyph_enc, p->glyph_name ));
|
|
|
|
p->glyph_enc = -1;
|
|
|
|
font->modified = 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
_bdf_set_glyph_modified( p->have, p->glyph_enc );
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( p->glyph_enc >= 0 )
|
|
|
|
{
|
|
|
|
/* Make sure there are enough glyphs allocated in case the */
|
|
|
|
/* number of characters happen to be wrong. */
|
|
|
|
if ( font->glyphs_used == font->glyphs_size )
|
|
|
|
{
|
|
|
|
if ( FT_RENEW_ARRAY( font->glyphs,
|
|
|
|
font->glyphs_size,
|
|
|
|
font->glyphs_size + 64 ) )
|
|
|
|
goto Exit;
|
|
|
|
FT_MEM_SET( font->glyphs + font->glyphs_size,
|
|
|
|
0,
|
|
|
|
sizeof ( bdf_glyph_t ) * 64 ); /* FZ inutile */
|
|
|
|
font->glyphs_size += 64;
|
|
|
|
}
|
|
|
|
|
|
|
|
glyph = font->glyphs + font->glyphs_used++;
|
|
|
|
glyph->name = p->glyph_name;
|
|
|
|
glyph->encoding = p->glyph_enc;
|
|
|
|
|
|
|
|
/* Reset the initial glyph info. */
|
|
|
|
p->glyph_name = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* Unencoded glyph. Check to see whether it should */
|
|
|
|
/* be added or not. */
|
|
|
|
if ( p->opts->keep_unencoded != 0 )
|
|
|
|
{
|
|
|
|
/* Allocate the next unencoded glyph. */
|
|
|
|
if ( font->unencoded_used == font->unencoded_size )
|
|
|
|
{
|
|
|
|
if ( font->unencoded_size == 0 )
|
|
|
|
{
|
2002-05-30 21:29:41 +02:00
|
|
|
if ( FT_NEW_ARRAY( font->unencoded, 4 ) )
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if ( FT_RENEW_ARRAY( font->unencoded ,
|
|
|
|
font->unencoded_size,
|
|
|
|
font->unencoded_size + 4 ) )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
font->unencoded_size += 4;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
glyph = font->unencoded + font->unencoded_used;
|
|
|
|
glyph->name = p->glyph_name;
|
|
|
|
glyph->encoding = font->unencoded_used++;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
else
|
|
|
|
/* Free up the glyph name if the unencoded shouldn't be */
|
|
|
|
/* kept. */
|
|
|
|
FT_FREE( p->glyph_name );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
p->glyph_name = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Clear the flags that might be added when width and height are */
|
|
|
|
/* checked for consistency. */
|
|
|
|
p->flags &= ~( _BDF_GLYPH_WIDTH_CHECK | _BDF_GLYPH_HEIGHT_CHECK );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
p->flags |= _BDF_ENCODING;
|
|
|
|
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Point at the glyph being constructed. */
|
|
|
|
if ( p->glyph_enc == -1 )
|
|
|
|
glyph = font->unencoded + ( font->unencoded_used - 1 );
|
|
|
|
else
|
|
|
|
glyph = font->glyphs + ( font->glyphs_used - 1 );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Check to see whether a bitmap is being constructed. */
|
|
|
|
if ( p->flags & _BDF_BITMAP )
|
|
|
|
{
|
|
|
|
/* If there are more rows than are specified in the glyph metrics, */
|
|
|
|
/* ignore the remaining lines. */
|
2002-05-21 23:17:43 +02:00
|
|
|
if ( p->row >= (unsigned long)glyph->bbx.height )
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
|
|
|
if ( !( p->flags & _BDF_GLYPH_HEIGHT_CHECK ) )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "_bdf_parse_glyphs: " ACMSG13, glyph->encoding ));
|
|
|
|
p->flags |= _BDF_GLYPH_HEIGHT_CHECK;
|
|
|
|
font->modified = 1;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Only collect the number of nibbles indicated by the glyph */
|
|
|
|
/* metrics. If there are more columns, they are simply ignored. */
|
|
|
|
nibbles = glyph->bpr << 1;
|
|
|
|
bp = glyph->bitmap + p->row * glyph->bpr;
|
|
|
|
|
|
|
|
for ( i = 0, *bp = 0; i < nibbles; i++ )
|
|
|
|
{
|
|
|
|
c = line[i];
|
2002-05-22 07:41:06 +02:00
|
|
|
*bp = (FT_Byte)( ( *bp << 4 ) + a2i[c] );
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( i + 1 < nibbles && ( i & 1 ) )
|
|
|
|
*++bp = 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Remove possible garbage at the right. */
|
|
|
|
mask_index = ( glyph->bbx.width * p->font->bpp ) & 7;
|
|
|
|
*bp &= nibble_mask[mask_index];
|
|
|
|
|
|
|
|
/* If any line has extra columns, indicate they have been removed. */
|
|
|
|
if ( ( line[nibbles] == '0' || a2i[(int)line[nibbles]] != 0 ) &&
|
|
|
|
!( p->flags & _BDF_GLYPH_WIDTH_CHECK ) )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "_bdf_parse_glyphs: " ACMSG14, glyph->encoding ));
|
|
|
|
p->flags |= _BDF_GLYPH_WIDTH_CHECK;
|
|
|
|
font->modified = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
p->row++;
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Expect the SWIDTH (scalable width) field next. */
|
|
|
|
if ( ft_memcmp( line, "SWIDTH", 6 ) == 0 )
|
|
|
|
{
|
|
|
|
if ( !( p->flags & _BDF_ENCODING ) )
|
|
|
|
{
|
|
|
|
/* Missing ENCODING field. */
|
|
|
|
FT_ERROR(( "_bdf_parse_glyphs: " ERRMSG1, lineno, "ENCODING" ));
|
|
|
|
error = BDF_Err_Missing_Encoding_Field;
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2002-05-21 23:17:43 +02:00
|
|
|
glyph->swidth = (unsigned short)_bdf_atoul( p->list.field[1], 0, 10 );
|
2002-05-18 14:03:43 +02:00
|
|
|
p->flags |= _BDF_SWIDTH;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Expect the DWIDTH (scalable width) field next. */
|
|
|
|
if ( ft_memcmp( line, "DWIDTH", 6 ) == 0 )
|
|
|
|
{
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list,memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2002-05-21 23:17:43 +02:00
|
|
|
glyph->dwidth = (unsigned short)_bdf_atoul( p->list.field[1], 0, 10 );
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( !( p->flags & _BDF_SWIDTH ) )
|
|
|
|
{
|
|
|
|
/* Missing SWIDTH field. Emit an auto correction message and set */
|
|
|
|
/* the scalable width from the device width. */
|
|
|
|
FT_TRACE2(( "_bdf_parse_glyphs: " ACMSG9, lineno ));
|
|
|
|
|
2002-05-29 00:38:05 +02:00
|
|
|
glyph->swidth = (unsigned short)FT_MulDiv(
|
|
|
|
glyph->dwidth, 72000L,
|
|
|
|
(FT_Long)( font->point_size *
|
|
|
|
font->resolution_x ) );
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
p->flags |= _BDF_DWIDTH;
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Expect the BBX field next. */
|
|
|
|
if ( ft_memcmp( line, "BBX", 3 ) == 0 )
|
|
|
|
{
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
glyph->bbx.width = _bdf_atos( p->list.field[1], 0, 10 );
|
|
|
|
glyph->bbx.height = _bdf_atos( p->list.field[2], 0, 10 );
|
|
|
|
glyph->bbx.x_offset = _bdf_atos( p->list.field[3], 0, 10 );
|
|
|
|
glyph->bbx.y_offset = _bdf_atos( p->list.field[4], 0, 10 );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Generate the ascent and descent of the character. */
|
2002-05-22 07:41:06 +02:00
|
|
|
glyph->bbx.ascent = (short)( glyph->bbx.height + glyph->bbx.y_offset );
|
|
|
|
glyph->bbx.descent = (short)( -glyph->bbx.y_offset );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Determine the overall font bounding box as the characters are */
|
|
|
|
/* loaded so corrections can be done later if indicated. */
|
|
|
|
p->maxas = MAX( glyph->bbx.ascent, p->maxas );
|
|
|
|
p->maxds = MAX( glyph->bbx.descent, p->maxds );
|
|
|
|
|
2002-05-21 23:17:43 +02:00
|
|
|
p->rbearing = (short)( glyph->bbx.width + glyph->bbx.x_offset );
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
p->maxrb = MAX( p->rbearing, p->maxrb );
|
|
|
|
p->minlb = MIN( glyph->bbx.x_offset, p->minlb );
|
|
|
|
p->maxlb = MAX( glyph->bbx.x_offset, p->maxlb );
|
|
|
|
|
|
|
|
if ( !( p->flags & _BDF_DWIDTH ) )
|
|
|
|
{
|
|
|
|
/* Missing DWIDTH field. Emit an auto correction message and set */
|
|
|
|
/* the device width to the glyph width. */
|
|
|
|
FT_TRACE2(( "_bdf_parse_glyphs: " ACMSG10, lineno ));
|
|
|
|
glyph->dwidth = glyph->bbx.width;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* If the BDF_CORRECT_METRICS flag is set, then adjust the SWIDTH */
|
|
|
|
/* value if necessary. */
|
|
|
|
if ( p->opts->correct_metrics != 0 )
|
|
|
|
{
|
|
|
|
/* Determine the point size of the glyph. */
|
2002-05-29 00:38:05 +02:00
|
|
|
unsigned short sw = (unsigned short)FT_MulDiv(
|
|
|
|
glyph->dwidth, 72000L,
|
|
|
|
(FT_Long)( font->point_size *
|
|
|
|
font->resolution_x ) );
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
|
|
|
|
if ( sw != glyph->swidth )
|
|
|
|
{
|
|
|
|
glyph->swidth = sw;
|
|
|
|
|
|
|
|
if ( p->glyph_enc == -1 )
|
|
|
|
_bdf_set_glyph_modified( font->umod,
|
|
|
|
font->unencoded_used - 1 );
|
|
|
|
else
|
|
|
|
_bdf_set_glyph_modified( font->nmod, glyph->encoding );
|
|
|
|
|
|
|
|
p->flags |= _BDF_SWIDTH_ADJ;
|
|
|
|
font->modified = 1;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
p->flags |= _BDF_BBX;
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* And finally, gather up the bitmap. */
|
|
|
|
if ( ft_memcmp( line, "BITMAP", 6 ) == 0 )
|
|
|
|
{
|
|
|
|
if ( !( p->flags & _BDF_BBX ) )
|
|
|
|
{
|
|
|
|
/* Missing BBX field. */
|
|
|
|
FT_ERROR(( "_bdf_parse_glyphs: " ERRMSG1, lineno, "BBX" ));
|
|
|
|
error = BDF_Err_Missing_Bbx_Field;
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
/* Allocate enough space for the bitmap. */
|
|
|
|
glyph->bpr = ( glyph->bbx.width * p->font->bpp + 7 ) >> 3;
|
2002-05-22 07:41:06 +02:00
|
|
|
glyph->bytes = (unsigned short)( glyph->bpr * glyph->bbx.height );
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( FT_NEW_ARRAY( glyph->bitmap, glyph->bytes ) )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
p->row = 0;
|
2002-05-18 14:03:43 +02:00
|
|
|
p->flags |= _BDF_BITMAP;
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = BDF_Err_Invalid_File_Format;
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Load the font properties. */
|
|
|
|
static FT_Error
|
|
|
|
_bdf_parse_properties( char* line,
|
|
|
|
unsigned long linelen,
|
|
|
|
unsigned long lineno,
|
|
|
|
void* call_data,
|
|
|
|
void* client_data )
|
|
|
|
{
|
|
|
|
unsigned long vlen;
|
|
|
|
_bdf_line_func_t* next;
|
|
|
|
_bdf_parse_t* p;
|
|
|
|
char* name;
|
|
|
|
char* value;
|
|
|
|
char nbuf[128];
|
|
|
|
FT_Memory memory;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
|
|
|
|
|
|
|
FT_UNUSED( lineno );
|
|
|
|
|
|
|
|
|
|
|
|
next = (_bdf_line_func_t *)call_data;
|
|
|
|
p = (_bdf_parse_t *) client_data;
|
|
|
|
|
|
|
|
memory = p->font->memory;
|
|
|
|
|
|
|
|
/* Check for the end of the properties. */
|
|
|
|
if ( ft_memcmp( line, "ENDPROPERTIES", 13 ) == 0 )
|
|
|
|
{
|
|
|
|
/* If the FONT_ASCENT or FONT_DESCENT properties have not been */
|
|
|
|
/* encountered yet, then make sure they are added as properties and */
|
|
|
|
/* make sure they are set from the font bounding box info. */
|
|
|
|
/* */
|
|
|
|
/* This is *always* done regardless of the options, because X11 */
|
|
|
|
/* requires these two fields to compile fonts. */
|
|
|
|
if ( bdf_get_font_property( p->font, (char *)"FONT_ASCENT" ) == 0 )
|
|
|
|
{
|
|
|
|
p->font->font_ascent = p->font->bbx.ascent;
|
|
|
|
ft_sprintf( nbuf, "%hd", p->font->bbx.ascent );
|
|
|
|
error = _bdf_add_property( p->font, (char *)"FONT_ASCENT", nbuf );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
FT_TRACE2(( "_bdf_parse_properties: " ACMSG1, p->font->bbx.ascent ));
|
|
|
|
p->font->modified = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( bdf_get_font_property( p->font, (char *)"FONT_DESCENT" ) == 0 )
|
|
|
|
{
|
|
|
|
p->font->font_descent = p->font->bbx.descent;
|
|
|
|
ft_sprintf( nbuf, "%hd", p->font->bbx.descent );
|
|
|
|
error = _bdf_add_property( p->font, (char *)"FONT_DESCENT", nbuf );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
FT_TRACE2(( "_bdf_parse_properties: " ACMSG2, p->font->bbx.descent ));
|
|
|
|
p->font->modified = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
p->flags &= ~_BDF_PROPS;
|
2002-05-21 16:13:01 +02:00
|
|
|
*next = _bdf_parse_glyphs;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Ignore the _XFREE86_GLYPH_RANGES properties. */
|
|
|
|
if ( ft_memcmp( line, "_XFREE86_GLYPH_RANGES", 21 ) == 0 )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Handle COMMENT fields and properties in a special way to preserve */
|
|
|
|
/* the spacing. */
|
|
|
|
if ( ft_memcmp( line, "COMMENT", 7 ) == 0 )
|
|
|
|
{
|
2002-05-18 14:03:43 +02:00
|
|
|
name = value = line;
|
|
|
|
value += 7;
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( *value )
|
2002-05-18 14:03:43 +02:00
|
|
|
*value++ = 0;
|
2002-05-21 16:13:01 +02:00
|
|
|
error = _bdf_add_property( p->font, name, value );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
else if ( _bdf_is_atom( line, linelen, &name, &value, p->font ) )
|
|
|
|
{
|
|
|
|
error = _bdf_add_property( p->font, name, value );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
name = p->list.field[0];
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
_bdf_shift( 1, &p->list );
|
|
|
|
value = _bdf_join( ' ', &vlen, &p->list );
|
|
|
|
|
|
|
|
error = _bdf_add_property( p->font, name, value );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
Exit:
|
|
|
|
return error;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Load the font header. */
|
|
|
|
static FT_Error
|
|
|
|
_bdf_parse_start( char* line,
|
|
|
|
unsigned long linelen,
|
|
|
|
unsigned long lineno,
|
|
|
|
void* call_data,
|
|
|
|
void* client_data )
|
|
|
|
{
|
|
|
|
unsigned long slen;
|
|
|
|
_bdf_line_func_t* next;
|
|
|
|
_bdf_parse_t* p;
|
|
|
|
bdf_font_t* font;
|
|
|
|
char *s;
|
|
|
|
|
2002-05-29 01:40:37 +02:00
|
|
|
FT_Memory memory = NULL;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
FT_UNUSED( lineno ); /* only used in debug mode */
|
|
|
|
|
|
|
|
|
|
|
|
next = (_bdf_line_func_t *)call_data;
|
|
|
|
p = (_bdf_parse_t *) client_data;
|
|
|
|
|
|
|
|
if ( p->font )
|
2002-05-18 14:03:43 +02:00
|
|
|
memory = p->font->memory;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Check for a comment. This is done to handle those fonts that have */
|
|
|
|
/* comments before the STARTFONT line for some reason. */
|
|
|
|
if ( ft_memcmp( line, "COMMENT", 7 ) == 0 )
|
|
|
|
{
|
|
|
|
if ( p->opts->keep_comments != 0 && p->font != 0 )
|
|
|
|
{
|
|
|
|
linelen -= 7;
|
|
|
|
|
|
|
|
s = line + 7;
|
|
|
|
if ( *s != 0 )
|
|
|
|
{
|
|
|
|
s++;
|
|
|
|
linelen--;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
error = _bdf_add_comment( p->font, s, linelen );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
/* here font is not defined! */
|
|
|
|
}
|
|
|
|
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( !( p->flags & _BDF_START ) )
|
|
|
|
{
|
|
|
|
memory = p->memory;
|
|
|
|
|
|
|
|
if ( ft_memcmp( line, "STARTFONT", 9 ) != 0 )
|
|
|
|
{
|
|
|
|
/* No STARTFONT field is a good indication of a problem. */
|
|
|
|
error = BDF_Err_Missing_Startfont_Field;
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
p->flags = _BDF_START;
|
|
|
|
font = p->font = 0;
|
|
|
|
|
|
|
|
if ( FT_NEW( font ) )
|
|
|
|
goto Exit;
|
|
|
|
p->font = font;
|
|
|
|
|
|
|
|
font->memory = p->memory;
|
|
|
|
p->memory = 0;
|
|
|
|
|
|
|
|
{ /* setup */
|
|
|
|
unsigned long i;
|
|
|
|
bdf_property_t* prop;
|
|
|
|
|
|
|
|
|
|
|
|
error = hash_init( &(font->proptbl), memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2002-05-22 07:41:06 +02:00
|
|
|
for ( i = 0, prop = (bdf_property_t*)_bdf_properties;
|
2002-05-21 16:13:01 +02:00
|
|
|
i < _num_bdf_properties; i++, prop++ )
|
|
|
|
{
|
|
|
|
error = hash_insert( prop->name, (void *)i,
|
|
|
|
&(font->proptbl), memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( FT_ALLOC( p->font->internal, sizeof ( hashtable ) ) )
|
|
|
|
goto Exit;
|
|
|
|
error = hash_init( (hashtable *)p->font->internal,memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
p->font->spacing = p->opts->font_spacing;
|
|
|
|
p->font->default_glyph = -1;
|
|
|
|
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for the start of the properties. */
|
|
|
|
if ( ft_memcmp( line, "STARTPROPERTIES", 15 ) == 0 )
|
|
|
|
{
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
p->cnt = p->font->props_size = _bdf_atoul( p->list.field[1], 0, 10 );
|
|
|
|
|
|
|
|
if ( FT_NEW_ARRAY( p->font->props, p->cnt ) )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
p->flags |= _BDF_PROPS;
|
|
|
|
*next = _bdf_parse_properties;
|
|
|
|
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for the FONTBOUNDINGBOX field. */
|
|
|
|
if ( ft_memcmp( line, "FONTBOUNDINGBOX", 15 ) == 0 )
|
|
|
|
{
|
|
|
|
if ( !(p->flags & _BDF_SIZE ) )
|
|
|
|
{
|
|
|
|
/* Missing the SIZE field. */
|
|
|
|
FT_ERROR(( "_bdf_parse_start: " ERRMSG1, lineno, "SIZE" ));
|
|
|
|
error = BDF_Err_Missing_Size_Field;
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list , memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
p->font->bbx.width = _bdf_atos( p->list.field[1], 0, 10 );
|
|
|
|
p->font->bbx.height = _bdf_atos( p->list.field[2], 0, 10 );
|
|
|
|
|
|
|
|
p->font->bbx.x_offset = _bdf_atos( p->list.field[3], 0, 10 );
|
|
|
|
p->font->bbx.y_offset = _bdf_atos( p->list.field[4], 0, 10 );
|
|
|
|
|
2002-05-29 01:40:37 +02:00
|
|
|
p->font->bbx.ascent = (short)( p->font->bbx.height +
|
2002-05-21 23:17:43 +02:00
|
|
|
p->font->bbx.y_offset );
|
|
|
|
|
|
|
|
p->font->bbx.descent = (short)( -p->font->bbx.y_offset );
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
p->flags |= _BDF_FONT_BBX;
|
|
|
|
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The next thing to check for is the FONT field. */
|
|
|
|
if ( ft_memcmp( line, "FONT", 4 ) == 0 )
|
|
|
|
{
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list , memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
_bdf_shift( 1, &p->list );
|
|
|
|
|
|
|
|
s = _bdf_join( ' ', &slen, &p->list );
|
|
|
|
if ( FT_NEW_ARRAY( p->font->name, slen + 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
FT_MEM_COPY( p->font->name, s, slen + 1 );
|
|
|
|
|
|
|
|
/* If the font name is an XLFD name, set the spacing to the one in */
|
|
|
|
/* the font name. If there is no spacing fall back on the default. */
|
|
|
|
error = _bdf_set_default_spacing( p->font, p->opts );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
p->flags |= _BDF_FONT_NAME;
|
|
|
|
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check for the SIZE field. */
|
|
|
|
if ( ft_memcmp( line, "SIZE", 4 ) == 0 )
|
|
|
|
{
|
|
|
|
if ( !( p->flags & _BDF_FONT_NAME ) )
|
|
|
|
{
|
|
|
|
/* Missing the FONT field. */
|
|
|
|
FT_ERROR(( "_bdf_parse_start: " ERRMSG1, lineno, "FONT" ));
|
|
|
|
error = BDF_Err_Missing_Font_Field;
|
|
|
|
goto Exit;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = _bdf_split( (char *)" +", line, linelen, &p->list, memory );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
p->font->point_size = _bdf_atoul( p->list.field[1], 0, 10 );
|
|
|
|
p->font->resolution_x = _bdf_atoul( p->list.field[2], 0, 10 );
|
|
|
|
p->font->resolution_y = _bdf_atoul( p->list.field[3], 0, 10 );
|
|
|
|
|
|
|
|
/* Check for the bits per pixel field. */
|
|
|
|
if ( p->list.used == 5 )
|
|
|
|
{
|
2002-06-03 22:01:23 +02:00
|
|
|
unsigned short bitcount, i, shift;
|
|
|
|
|
|
|
|
|
|
|
|
p->font->bpp = (unsigned short)_bdf_atos( p->list.field[4], 0, 10 );
|
|
|
|
|
|
|
|
/* Only values 1, 2, 4, 8 are allowed. */
|
|
|
|
shift = p->font->bpp;
|
|
|
|
bitcount = 0;
|
|
|
|
for ( i = 0; shift > 0; i++ )
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
2002-06-03 22:01:23 +02:00
|
|
|
if ( shift & 1 )
|
|
|
|
bitcount = i;
|
|
|
|
shift >>= 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
2002-06-03 22:01:23 +02:00
|
|
|
shift = ( bitcount > 3 ) ? 8 : ( 1 << bitcount );
|
|
|
|
|
|
|
|
if ( p->font->bpp > shift || p->font->bpp != shift )
|
2002-05-21 16:13:01 +02:00
|
|
|
{
|
2002-06-03 22:01:23 +02:00
|
|
|
/* select next higher value */
|
|
|
|
p->font->bpp = shift << 1;
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_TRACE2(( "_bdf_parse_start: " ACMSG11, p->font->bpp ));
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
}
|
|
|
|
else
|
|
|
|
p->font->bpp = 1;
|
|
|
|
|
|
|
|
p->flags |= _BDF_SIZE;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
error = BDF_Err_Invalid_File_Format;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
Exit:
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/*************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* API. */
|
|
|
|
/* */
|
|
|
|
/*************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
FT_LOCAL_DEF( FT_Error )
|
|
|
|
bdf_load_font( FT_Stream stream,
|
|
|
|
FT_Memory extmemory,
|
|
|
|
bdf_options_t* opts,
|
|
|
|
bdf_font_t* *font )
|
|
|
|
{
|
|
|
|
unsigned long lineno;
|
|
|
|
_bdf_parse_t p;
|
|
|
|
|
2002-05-29 01:40:37 +02:00
|
|
|
FT_Memory memory = NULL;
|
|
|
|
FT_Error error = BDF_Err_Ok;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
FT_MEM_SET( &p, 0, sizeof ( _bdf_parse_t ) );
|
|
|
|
|
2002-05-22 07:41:06 +02:00
|
|
|
p.opts = (bdf_options_t*)( ( opts != 0 ) ? opts : &_bdf_opts );
|
2002-05-21 16:13:01 +02:00
|
|
|
p.minlb = 32767;
|
2002-05-18 14:03:43 +02:00
|
|
|
p.memory = extmemory; /* only during font creation */
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
error = _bdf_readstream( stream, _bdf_parse_start,
|
|
|
|
(void *)&p, &lineno );
|
|
|
|
if ( error )
|
|
|
|
goto Exit;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( p.font != 0 )
|
|
|
|
{
|
|
|
|
/* If the font is not proportional, set the font's monowidth */
|
|
|
|
/* field to the width of the font bounding box. */
|
2002-05-18 14:03:43 +02:00
|
|
|
memory = p.font->memory;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( p.font->spacing != BDF_PROPORTIONAL )
|
|
|
|
p.font->monowidth = p.font->bbx.width;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* If the number of glyphs loaded is not that of the original count, */
|
|
|
|
/* indicate the difference. */
|
|
|
|
if ( p.cnt != p.font->glyphs_used + p.font->unencoded_used )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "bdf_load_font: " ACMSG15, p.cnt,
|
|
|
|
p.font->glyphs_used + p.font->unencoded_used ));
|
|
|
|
p.font->modified = 1;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Once the font has been loaded, adjust the overall font metrics if */
|
|
|
|
/* necessary. */
|
|
|
|
if ( p.opts->correct_metrics != 0 &&
|
|
|
|
( p.font->glyphs_used > 0 || p.font->unencoded_used > 0 ) )
|
|
|
|
{
|
|
|
|
if ( p.maxrb - p.minlb != p.font->bbx.width )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "bdf_load_font: " ACMSG3,
|
|
|
|
p.font->bbx.width, p.maxrb - p.minlb ));
|
2002-05-22 07:41:06 +02:00
|
|
|
p.font->bbx.width = (unsigned short)( p.maxrb - p.minlb );
|
2002-05-21 16:13:01 +02:00
|
|
|
p.font->modified = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( p.font->bbx.x_offset != p.minlb )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "bdf_load_font: " ACMSG4,
|
|
|
|
p.font->bbx.x_offset, p.minlb ));
|
|
|
|
p.font->bbx.x_offset = p.minlb;
|
|
|
|
p.font->modified = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( p.font->bbx.ascent != p.maxas )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "bdf_load_font: " ACMSG5,
|
|
|
|
p.font->bbx.ascent, p.maxas ));
|
|
|
|
p.font->bbx.ascent = p.maxas;
|
|
|
|
p.font->modified = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( p.font->bbx.descent != p.maxds )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "bdf_load_font: " ACMSG6,
|
|
|
|
p.font->bbx.descent, p.maxds ));
|
|
|
|
p.font->bbx.descent = p.maxds;
|
2002-05-22 07:41:06 +02:00
|
|
|
p.font->bbx.y_offset = (short)( -p.maxds );
|
2002-05-21 16:13:01 +02:00
|
|
|
p.font->modified = 1;
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( p.maxas + p.maxds != p.font->bbx.height )
|
|
|
|
{
|
|
|
|
FT_TRACE2(( "bdf_load_font: " ACMSG7,
|
|
|
|
p.font->bbx.height, p.maxas + p.maxds ));
|
2002-05-22 07:41:06 +02:00
|
|
|
p.font->bbx.height = (unsigned short)( p.maxas + p.maxds );
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( p.flags & _BDF_SWIDTH_ADJ )
|
|
|
|
FT_TRACE2(( "bdf_load_font: " ACMSG8 ));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( p.flags & _BDF_START )
|
|
|
|
{
|
|
|
|
{
|
|
|
|
/* The ENDFONT field was never reached or did not exist. */
|
|
|
|
if ( !( p.flags & _BDF_GLYPHS ) )
|
|
|
|
/* Error happened while parsing header. */
|
|
|
|
FT_ERROR(( "bdf_load_font: " ERRMSG2, lineno ));
|
|
|
|
else
|
|
|
|
/* Error happened when parsing glyphs. */
|
|
|
|
FT_ERROR(( "bdf_load_font: " ERRMSG3, lineno ));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Free up the list used during the parsing. */
|
2002-05-30 21:29:41 +02:00
|
|
|
if ( memory != NULL )
|
|
|
|
FT_FREE( p.list.field );
|
2002-05-21 16:13:01 +02:00
|
|
|
|
|
|
|
if ( p.font != 0 )
|
|
|
|
{
|
|
|
|
/* Make sure the comments are NULL terminated if they exist. */
|
|
|
|
memory = p.font->memory;
|
|
|
|
|
|
|
|
if ( p.font->comments_len > 0 ) {
|
|
|
|
if ( FT_RENEW_ARRAY( p.font->comments,
|
|
|
|
p.font->comments_len,
|
|
|
|
p.font->comments_len + 1 ) )
|
|
|
|
goto Exit;
|
|
|
|
|
|
|
|
p.font->comments[p.font->comments_len] = 0;
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
2002-05-30 21:29:41 +02:00
|
|
|
else if ( error == BDF_Err_Ok )
|
|
|
|
error = BDF_Err_Invalid_File_Format;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
*font = p.font;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
Exit:
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
FT_LOCAL_DEF( void )
|
|
|
|
bdf_free_font( bdf_font_t* font )
|
|
|
|
{
|
|
|
|
bdf_property_t* prop;
|
|
|
|
unsigned long i;
|
|
|
|
bdf_glyph_t* glyphs;
|
|
|
|
FT_Memory memory;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( font == 0 )
|
|
|
|
return;
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
memory = font->memory;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_FREE( font->name );
|
|
|
|
|
|
|
|
/* Free up the internal hash table of property names. */
|
|
|
|
if ( font->internal )
|
|
|
|
{
|
|
|
|
hash_free( (hashtable *)font->internal, memory );
|
|
|
|
FT_FREE( font->internal );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Free up the comment info. */
|
|
|
|
FT_FREE( font->comments );
|
|
|
|
|
|
|
|
/* Free up the properties. */
|
|
|
|
for ( i = 0; i < font->props_size; i++ )
|
|
|
|
{
|
|
|
|
if ( font->props[i].format == BDF_ATOM )
|
|
|
|
FT_FREE( font->props[i].value.atom );
|
|
|
|
}
|
|
|
|
|
|
|
|
FT_FREE( font->props );
|
|
|
|
|
|
|
|
/* Free up the character info. */
|
|
|
|
for ( i = 0, glyphs = font->glyphs;
|
|
|
|
i < font->glyphs_used; i++, glyphs++ )
|
|
|
|
{
|
|
|
|
FT_FREE( glyphs->name );
|
|
|
|
FT_FREE( glyphs->bitmap );
|
|
|
|
}
|
|
|
|
|
|
|
|
for ( i = 0, glyphs = font->unencoded; i < font->unencoded_used;
|
|
|
|
i++, glyphs++ )
|
|
|
|
{
|
|
|
|
FT_FREE( glyphs->name );
|
|
|
|
FT_FREE( glyphs->bitmap );
|
|
|
|
}
|
|
|
|
|
|
|
|
FT_FREE( font->glyphs );
|
|
|
|
FT_FREE( font->unencoded );
|
|
|
|
|
|
|
|
/* Free up the overflow storage if it was used. */
|
|
|
|
for ( i = 0, glyphs = font->overflow.glyphs;
|
|
|
|
i < font->overflow.glyphs_used; i++, glyphs++ )
|
|
|
|
{
|
|
|
|
FT_FREE( glyphs->name );
|
|
|
|
FT_FREE( glyphs->bitmap );
|
|
|
|
}
|
|
|
|
|
|
|
|
FT_FREE( font->overflow.glyphs );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
/* bdf_cleanup */
|
2002-05-21 16:13:01 +02:00
|
|
|
hash_free( &(font->proptbl), memory );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* Free up the user defined properties. */
|
|
|
|
for (prop = font->user_props, i = 0;
|
|
|
|
i < font->nuser_props; i++, prop++ )
|
|
|
|
{
|
|
|
|
FT_FREE( prop->name );
|
|
|
|
if ( prop->format == BDF_ATOM )
|
|
|
|
FT_FREE( prop->value.atom );
|
2002-05-18 14:03:43 +02:00
|
|
|
}
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_FREE( font->user_props );
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
/* FREE( font ); */ /* XXX Fixme */
|
|
|
|
}
|
2002-05-18 14:03:43 +02:00
|
|
|
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
FT_LOCAL_DEF( bdf_property_t * )
|
|
|
|
bdf_get_font_property( bdf_font_t* font,
|
|
|
|
char* name )
|
|
|
|
{
|
|
|
|
hashnode hn;
|
|
|
|
|
2002-05-18 14:03:43 +02:00
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
if ( font == 0 || font->props_size == 0 || name == 0 || *name == 0 )
|
2002-05-18 14:03:43 +02:00
|
|
|
return 0;
|
|
|
|
|
2002-05-21 16:13:01 +02:00
|
|
|
hn = hash_lookup( name, (hashtable *)font->internal );
|
|
|
|
|
|
|
|
return hn ? ( font->props + (unsigned long)hn->data ) : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* END */
|