465 lines
15 KiB
C
465 lines
15 KiB
C
/*
|
|
* Builtin dlls resource support
|
|
*
|
|
* Copyright 2000 Alexandre Julliard
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
#include "config.h"
|
|
#include "wine/port.h"
|
|
|
|
#include <ctype.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdarg.h>
|
|
#include <stdio.h>
|
|
#ifdef HAVE_SYS_TYPES_H
|
|
# include <sys/types.h>
|
|
#endif
|
|
#include <fcntl.h>
|
|
#ifdef HAVE_SYS_STAT_H
|
|
# include <sys/stat.h>
|
|
#endif
|
|
#ifdef HAVE_SYS_MMAN_H
|
|
#include <sys/mman.h>
|
|
#endif
|
|
|
|
#include "windef.h"
|
|
#include "winbase.h"
|
|
#include "build.h"
|
|
|
|
/* Unicode string or integer id */
|
|
struct string_id
|
|
{
|
|
WCHAR *str; /* ptr to Unicode string */
|
|
WORD id; /* integer id if str is NULL */
|
|
};
|
|
|
|
/* descriptor for a resource */
|
|
struct resource
|
|
{
|
|
struct string_id type;
|
|
struct string_id name;
|
|
const void *data;
|
|
unsigned int data_size;
|
|
WORD lang;
|
|
};
|
|
|
|
/* name level of the resource tree */
|
|
struct res_name
|
|
{
|
|
const struct string_id *name; /* name */
|
|
const struct resource *res; /* resource */
|
|
int nb_languages; /* number of languages */
|
|
unsigned int name_offset; /* offset of name in resource dir */
|
|
};
|
|
|
|
/* type level of the resource tree */
|
|
struct res_type
|
|
{
|
|
const struct string_id *type; /* type name */
|
|
struct res_name *names; /* names array */
|
|
unsigned int nb_names; /* total number of names */
|
|
unsigned int nb_id_names; /* number of names that have a numeric id */
|
|
unsigned int name_offset; /* offset of type name in resource dir */
|
|
};
|
|
|
|
/* top level of the resource tree */
|
|
struct res_tree
|
|
{
|
|
struct res_type *types; /* types array */
|
|
unsigned int nb_types; /* total number of types */
|
|
};
|
|
|
|
static int byte_swapped; /* whether the current resource file is byte-swapped */
|
|
static const unsigned char *file_pos; /* current position in resource file */
|
|
static const unsigned char *file_end; /* end of resource file */
|
|
static const char *file_name; /* current resource file name */
|
|
|
|
/* size of a resource directory with n entries */
|
|
#define RESDIR_SIZE(n) (sizeof(IMAGE_RESOURCE_DIRECTORY) + (n) * sizeof(IMAGE_RESOURCE_DIRECTORY_ENTRY))
|
|
|
|
|
|
inline static struct resource *add_resource( DLLSPEC *spec )
|
|
{
|
|
spec->resources = xrealloc( spec->resources, (spec->nb_resources + 1) * sizeof(spec->resources[0]) );
|
|
return &spec->resources[spec->nb_resources++];
|
|
}
|
|
|
|
static inline unsigned int strlenW( const WCHAR *str )
|
|
{
|
|
const WCHAR *s = str;
|
|
while (*s) s++;
|
|
return s - str;
|
|
}
|
|
|
|
static inline int strcmpW( const WCHAR *str1, const WCHAR *str2 )
|
|
{
|
|
while (*str1 && (*str1 == *str2)) { str1++; str2++; }
|
|
return *str1 - *str2;
|
|
}
|
|
|
|
static struct res_name *add_name( struct res_type *type, const struct resource *res )
|
|
{
|
|
struct res_name *name;
|
|
type->names = xrealloc( type->names, (type->nb_names + 1) * sizeof(*type->names) );
|
|
name = &type->names[type->nb_names++];
|
|
name->name = &res->name;
|
|
name->res = res;
|
|
name->nb_languages = 1;
|
|
if (!name->name->str) type->nb_id_names++;
|
|
return name;
|
|
}
|
|
|
|
static struct res_type *add_type( struct res_tree *tree, const struct resource *res )
|
|
{
|
|
struct res_type *type;
|
|
tree->types = xrealloc( tree->types, (tree->nb_types + 1) * sizeof(*tree->types) );
|
|
type = &tree->types[tree->nb_types++];
|
|
type->type = &res->type;
|
|
type->names = NULL;
|
|
type->nb_names = 0;
|
|
type->nb_id_names = 0;
|
|
return type;
|
|
}
|
|
|
|
/* get the next word from the current resource file */
|
|
static WORD get_word(void)
|
|
{
|
|
WORD ret = *(const WORD *)file_pos;
|
|
if (byte_swapped) ret = (ret << 8) | (ret >> 8);
|
|
file_pos += sizeof(WORD);
|
|
if (file_pos > file_end) fatal_error( "%s is a truncated file\n", file_name );
|
|
return ret;
|
|
}
|
|
|
|
/* get the next dword from the current resource file */
|
|
static DWORD get_dword(void)
|
|
{
|
|
DWORD ret = *(const DWORD *)file_pos;
|
|
if (byte_swapped)
|
|
ret = ((ret << 24) | ((ret << 8) & 0x00ff0000) | ((ret >> 8) & 0x0000ff00) | (ret >> 24));
|
|
file_pos += sizeof(DWORD);
|
|
if (file_pos > file_end) fatal_error( "%s is a truncated file\n", file_name );
|
|
return ret;
|
|
}
|
|
|
|
/* get a string from the current resource file */
|
|
static void get_string( struct string_id *str )
|
|
{
|
|
if (*(const WCHAR *)file_pos == 0xffff)
|
|
{
|
|
get_word(); /* skip the 0xffff */
|
|
str->str = NULL;
|
|
str->id = get_word();
|
|
}
|
|
else
|
|
{
|
|
WCHAR *p = xmalloc( (strlenW((const WCHAR*)file_pos) + 1) * sizeof(WCHAR) );
|
|
str->str = p;
|
|
str->id = 0;
|
|
while ((*p++ = get_word()));
|
|
}
|
|
}
|
|
|
|
/* check the file header */
|
|
/* all values must be zero except header size */
|
|
static int check_header(void)
|
|
{
|
|
DWORD size;
|
|
|
|
if (get_dword()) return 0; /* data size */
|
|
size = get_dword(); /* header size */
|
|
if (size == 0x20000000) byte_swapped = 1;
|
|
else if (size != 0x20) return 0;
|
|
if (get_word() != 0xffff || get_word()) return 0; /* type, must be id 0 */
|
|
if (get_word() != 0xffff || get_word()) return 0; /* name, must be id 0 */
|
|
if (get_dword()) return 0; /* data version */
|
|
if (get_word()) return 0; /* mem options */
|
|
if (get_word()) return 0; /* language */
|
|
if (get_dword()) return 0; /* version */
|
|
if (get_dword()) return 0; /* characteristics */
|
|
return 1;
|
|
}
|
|
|
|
/* load the next resource from the current file */
|
|
static void load_next_resource( DLLSPEC *spec )
|
|
{
|
|
DWORD hdr_size;
|
|
struct resource *res = add_resource( spec );
|
|
|
|
res->data_size = (get_dword() + 3) & ~3;
|
|
hdr_size = get_dword();
|
|
if (hdr_size & 3) fatal_error( "%s header size not aligned\n", file_name );
|
|
|
|
res->data = file_pos - 2*sizeof(DWORD) + hdr_size;
|
|
get_string( &res->type );
|
|
get_string( &res->name );
|
|
if ((UINT_PTR)file_pos & 2) get_word(); /* align to dword boundary */
|
|
get_dword(); /* skip data version */
|
|
get_word(); /* skip mem options */
|
|
res->lang = get_word();
|
|
get_dword(); /* skip version */
|
|
get_dword(); /* skip characteristics */
|
|
|
|
file_pos = (const unsigned char *)res->data + res->data_size;
|
|
if (file_pos > file_end) fatal_error( "%s is a truncated file\n", file_name );
|
|
}
|
|
|
|
/* load a Win32 .res file */
|
|
int load_res32_file( const char *name, DLLSPEC *spec )
|
|
{
|
|
int fd, ret;
|
|
void *base;
|
|
struct stat st;
|
|
|
|
if ((fd = open( name, O_RDONLY )) == -1) fatal_perror( "Cannot open %s", name );
|
|
if ((fstat( fd, &st ) == -1)) fatal_perror( "Cannot stat %s", name );
|
|
if (!st.st_size) fatal_error( "%s is an empty file\n", name );
|
|
#ifdef HAVE_MMAP
|
|
if ((base = mmap( NULL, st.st_size, PROT_READ, MAP_PRIVATE, fd, 0 )) == (void*)-1)
|
|
#endif /* HAVE_MMAP */
|
|
{
|
|
base = xmalloc( st.st_size );
|
|
if (read( fd, base, st.st_size ) != st.st_size)
|
|
fatal_error( "Cannot read %s\n", name );
|
|
}
|
|
|
|
byte_swapped = 0;
|
|
file_name = name;
|
|
file_pos = base;
|
|
file_end = file_pos + st.st_size;
|
|
if ((ret = check_header()))
|
|
{
|
|
while (file_pos < file_end) load_next_resource( spec );
|
|
}
|
|
close( fd );
|
|
return ret;
|
|
}
|
|
|
|
/* compare two unicode strings/ids */
|
|
static int cmp_string( const struct string_id *str1, const struct string_id *str2 )
|
|
{
|
|
if (!str1->str)
|
|
{
|
|
if (!str2->str) return str1->id - str2->id;
|
|
return 1; /* an id compares larger than a string */
|
|
}
|
|
if (!str2->str) return -1;
|
|
return strcmpW( str1->str, str2->str );
|
|
}
|
|
|
|
/* compare two resources for sorting the resource directory */
|
|
/* resources are stored first by type, then by name, then by language */
|
|
static int cmp_res( const void *ptr1, const void *ptr2 )
|
|
{
|
|
const struct resource *res1 = ptr1;
|
|
const struct resource *res2 = ptr2;
|
|
int ret;
|
|
|
|
if ((ret = cmp_string( &res1->type, &res2->type ))) return ret;
|
|
if ((ret = cmp_string( &res1->name, &res2->name ))) return ret;
|
|
return res1->lang - res2->lang;
|
|
}
|
|
|
|
/* build the 3-level (type,name,language) resource tree */
|
|
static struct res_tree *build_resource_tree( DLLSPEC *spec )
|
|
{
|
|
unsigned int i;
|
|
struct res_tree *tree;
|
|
struct res_type *type = NULL;
|
|
struct res_name *name = NULL;
|
|
|
|
qsort( spec->resources, spec->nb_resources, sizeof(*spec->resources), cmp_res );
|
|
|
|
tree = xmalloc( sizeof(*tree) );
|
|
tree->types = NULL;
|
|
tree->nb_types = 0;
|
|
|
|
for (i = 0; i < spec->nb_resources; i++)
|
|
{
|
|
if (!i || cmp_string( &spec->resources[i].type, &spec->resources[i-1].type )) /* new type */
|
|
{
|
|
type = add_type( tree, &spec->resources[i] );
|
|
name = add_name( type, &spec->resources[i] );
|
|
}
|
|
else if (cmp_string( &spec->resources[i].name, &spec->resources[i-1].name )) /* new name */
|
|
{
|
|
name = add_name( type, &spec->resources[i] );
|
|
}
|
|
else name->nb_languages++;
|
|
}
|
|
return tree;
|
|
}
|
|
|
|
/* free the resource tree */
|
|
static void free_resource_tree( struct res_tree *tree )
|
|
{
|
|
unsigned int i;
|
|
|
|
for (i = 0; i < tree->nb_types; i++) free( tree->types[i].names );
|
|
free( tree->types );
|
|
free( tree );
|
|
}
|
|
|
|
/* output a Unicode string */
|
|
static void output_string( FILE *outfile, const WCHAR *name )
|
|
{
|
|
int i, len = strlenW(name);
|
|
fprintf( outfile, "\t%s 0x%04x", get_asm_short_keyword(), len );
|
|
for (i = 0; i < len; i++) fprintf( outfile, ",0x%04x", name[i] );
|
|
fprintf( outfile, " /* " );
|
|
for (i = 0; i < len; i++) fprintf( outfile, "%c", isprint((char)name[i]) ? (char)name[i] : '?' );
|
|
fprintf( outfile, " */\n" );
|
|
}
|
|
|
|
/* output a resource directory */
|
|
static inline void output_res_dir( FILE *outfile, unsigned int nb_names, unsigned int nb_ids )
|
|
{
|
|
fprintf( outfile, "\t.long 0\n" ); /* Characteristics */
|
|
fprintf( outfile, "\t.long 0\n" ); /* TimeDateStamp */
|
|
fprintf( outfile, "\t%s 0,0\n", /* Major/MinorVersion */
|
|
get_asm_short_keyword() );
|
|
fprintf( outfile, "\t%s %u,%u\n", /* NumberOfNamed/IdEntries */
|
|
get_asm_short_keyword(), nb_names, nb_ids );
|
|
}
|
|
|
|
/* output the resource definitions */
|
|
void output_resources( FILE *outfile, DLLSPEC *spec )
|
|
{
|
|
int k, nb_id_types;
|
|
unsigned int i, n, offset, data_offset;
|
|
struct res_tree *tree;
|
|
struct res_type *type;
|
|
struct res_name *name;
|
|
const struct resource *res;
|
|
|
|
if (!spec->nb_resources) return;
|
|
|
|
tree = build_resource_tree( spec );
|
|
|
|
/* compute the offsets */
|
|
|
|
offset = RESDIR_SIZE( tree->nb_types );
|
|
for (i = 0, type = tree->types; i < tree->nb_types; i++, type++)
|
|
{
|
|
offset += RESDIR_SIZE( type->nb_names );
|
|
for (n = 0, name = type->names; n < type->nb_names; n++, name++)
|
|
offset += RESDIR_SIZE( name->nb_languages );
|
|
}
|
|
offset += spec->nb_resources * sizeof(IMAGE_RESOURCE_DATA_ENTRY);
|
|
|
|
for (i = nb_id_types = 0, type = tree->types; i < tree->nb_types; i++, type++)
|
|
{
|
|
if (type->type->str)
|
|
{
|
|
type->name_offset = offset | 0x80000000;
|
|
offset += (strlenW(type->type->str)+1) * sizeof(WCHAR);
|
|
}
|
|
else
|
|
{
|
|
type->name_offset = type->type->id;
|
|
nb_id_types++;
|
|
}
|
|
|
|
for (n = 0, name = type->names; n < type->nb_names; n++, name++)
|
|
{
|
|
if (name->name->str)
|
|
{
|
|
name->name_offset = offset | 0x80000000;
|
|
offset += (strlenW(name->name->str)+1) * sizeof(WCHAR);
|
|
}
|
|
else name->name_offset = name->name->id;
|
|
}
|
|
}
|
|
|
|
/* output the resource directories */
|
|
|
|
fprintf( outfile, "\n/* resources */\n\n" );
|
|
fprintf( outfile, "\t.data\n" );
|
|
fprintf( outfile, "\t.align %d\n", get_alignment(get_ptr_size()) );
|
|
fprintf( outfile, ".L__wine_spec_resources:\n" );
|
|
|
|
output_res_dir( outfile, tree->nb_types - nb_id_types, nb_id_types );
|
|
|
|
/* dump the type directory */
|
|
|
|
offset = RESDIR_SIZE( tree->nb_types );
|
|
for (i = 0, type = tree->types; i < tree->nb_types; i++, type++)
|
|
{
|
|
fprintf( outfile, "\t.long 0x%08x,0x%08x\n",
|
|
type->name_offset, offset | 0x80000000 );
|
|
offset += RESDIR_SIZE( type->nb_names );
|
|
for (n = 0, name = type->names; n < type->nb_names; n++, name++)
|
|
offset += RESDIR_SIZE( name->nb_languages );
|
|
}
|
|
|
|
data_offset = offset;
|
|
offset = RESDIR_SIZE( tree->nb_types );
|
|
|
|
/* dump the names and languages directories */
|
|
|
|
for (i = 0, type = tree->types; i < tree->nb_types; i++, type++)
|
|
{
|
|
output_res_dir( outfile, type->nb_names - type->nb_id_names, type->nb_id_names );
|
|
offset += RESDIR_SIZE( type->nb_names );
|
|
for (n = 0, name = type->names; n < type->nb_names; n++, name++)
|
|
{
|
|
fprintf( outfile, "\t.long 0x%08x,0x%08x\n",
|
|
name->name_offset, offset | 0x80000000 );
|
|
offset += RESDIR_SIZE( name->nb_languages );
|
|
}
|
|
|
|
for (n = 0, name = type->names; n < type->nb_names; n++, name++)
|
|
{
|
|
output_res_dir( outfile, 0, name->nb_languages );
|
|
for (k = 0, res = name->res; k < name->nb_languages; k++, res++)
|
|
{
|
|
fprintf( outfile, "\t.long 0x%08x,0x%08x\n", res->lang,
|
|
data_offset + (res - spec->resources) * sizeof(IMAGE_RESOURCE_DATA_ENTRY) );
|
|
}
|
|
}
|
|
}
|
|
|
|
/* dump the resource data entries */
|
|
|
|
for (i = 0, res = spec->resources; i < spec->nb_resources; i++, res++)
|
|
fprintf( outfile, "\t.long .L__wine_spec_res_%d-.L__wine_spec_rva_base,%u,0,0\n",
|
|
i, res->data_size );
|
|
|
|
/* dump the name strings */
|
|
|
|
for (i = 0, type = tree->types; i < tree->nb_types; i++, type++)
|
|
{
|
|
if (type->type->str) output_string( outfile, type->type->str );
|
|
for (n = 0, name = type->names; n < type->nb_names; n++, name++)
|
|
if (name->name->str) output_string( outfile, name->name->str );
|
|
}
|
|
|
|
/* resource data */
|
|
|
|
for (i = 0, res = spec->resources; i < spec->nb_resources; i++, res++)
|
|
{
|
|
fprintf( outfile, "\n\t.align %d\n", get_alignment(get_ptr_size()) );
|
|
fprintf( outfile, ".L__wine_spec_res_%d:\n", i );
|
|
dump_bytes( outfile, res->data, res->data_size );
|
|
}
|
|
fprintf( outfile, ".L__wine_spec_resources_end:\n" );
|
|
fprintf( outfile, "\t.byte 0\n" );
|
|
|
|
free_resource_tree( tree );
|
|
}
|