2002-07-03 20:16:32 +00:00
|
|
|
/*
|
2011-01-09 10:41:24 +00:00
|
|
|
linker.c
|
2002-07-03 20:16:32 +00:00
|
|
|
|
|
|
|
qc object file linking
|
|
|
|
|
2002-07-05 20:02:10 +00:00
|
|
|
Copyright (C) 2002 Bill Currie <bill@taniwha.org>
|
2011-02-24 06:24:35 +00:00
|
|
|
Copyright (C) 2011 Bill Currie <bill@taniwha.org>
|
2002-07-03 20:16:32 +00:00
|
|
|
|
|
|
|
Author: Bill Currie <bill@taniwha.org>
|
|
|
|
Date: 2002/7/3
|
2011-02-24 06:24:35 +00:00
|
|
|
Date: 2011/2/24
|
2002-07-03 20:16:32 +00:00
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or
|
|
|
|
modify it under the terms of the GNU General Public License
|
|
|
|
as published by the Free Software Foundation; either version 2
|
|
|
|
of the License, or (at your option) any later version.
|
|
|
|
|
|
|
|
This program 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 General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program; if not, write to:
|
|
|
|
|
|
|
|
Free Software Foundation, Inc.
|
|
|
|
59 Temple Place - Suite 330
|
|
|
|
Boston, MA 02111-1307, USA
|
|
|
|
|
|
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
|
|
# include "config.h"
|
|
|
|
#endif
|
2003-01-15 15:31:36 +00:00
|
|
|
|
2002-07-03 21:32:03 +00:00
|
|
|
#ifdef HAVE_STRING_H
|
|
|
|
# include <string.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_STRINGS_H
|
|
|
|
# include <strings.h>
|
|
|
|
#endif
|
2002-07-21 07:12:17 +00:00
|
|
|
#ifdef HAVE_UNISTD_H
|
|
|
|
# include <unistd.h>
|
|
|
|
#endif
|
|
|
|
#ifdef HAVE_IO_H
|
|
|
|
# include <io.h>
|
|
|
|
#endif
|
2002-07-03 20:16:32 +00:00
|
|
|
#include <stdlib.h>
|
2002-09-16 17:37:22 +00:00
|
|
|
#include <stdarg.h>
|
2002-07-21 07:12:17 +00:00
|
|
|
#include <fcntl.h>
|
2002-10-31 22:58:59 +00:00
|
|
|
#include <errno.h>
|
2002-07-03 20:16:32 +00:00
|
|
|
|
2013-01-22 05:09:41 +00:00
|
|
|
#include "qfalloca.h"
|
|
|
|
|
2012-12-06 11:52:53 +00:00
|
|
|
#include "QF/alloc.h"
|
2002-09-16 17:37:22 +00:00
|
|
|
#include "QF/dstring.h"
|
2002-07-03 20:16:32 +00:00
|
|
|
#include "QF/hash.h"
|
2002-07-21 07:12:17 +00:00
|
|
|
#include "QF/pakfile.h"
|
2002-11-01 18:05:12 +00:00
|
|
|
#include "QF/va.h"
|
2002-07-03 20:16:32 +00:00
|
|
|
|
2011-03-02 03:26:53 +00:00
|
|
|
#include "class.h"
|
2011-01-09 10:41:24 +00:00
|
|
|
#include "codespace.h"
|
2002-07-03 20:16:32 +00:00
|
|
|
#include "def.h"
|
2011-01-17 13:33:33 +00:00
|
|
|
#include "defspace.h"
|
2011-01-24 12:54:57 +00:00
|
|
|
#include "diagnostic.h"
|
2002-07-08 20:31:59 +00:00
|
|
|
#include "emit.h"
|
2002-07-03 20:16:32 +00:00
|
|
|
#include "expr.h"
|
2002-07-11 21:04:09 +00:00
|
|
|
#include "linker.h"
|
2002-07-03 20:16:32 +00:00
|
|
|
#include "obj_file.h"
|
2011-02-28 14:18:07 +00:00
|
|
|
#include "obj_type.h"
|
2002-07-12 04:50:31 +00:00
|
|
|
#include "options.h"
|
2002-07-03 20:16:32 +00:00
|
|
|
#include "qfcc.h"
|
2002-07-11 17:06:15 +00:00
|
|
|
#include "reloc.h"
|
2002-07-05 20:02:10 +00:00
|
|
|
#include "strpool.h"
|
2002-09-17 18:42:35 +00:00
|
|
|
#include "type.h"
|
2002-07-03 20:16:32 +00:00
|
|
|
|
2012-10-26 10:02:02 +00:00
|
|
|
static void linker_internal_error (const char *fmt, ...)
|
|
|
|
__attribute__ ((format (printf, 1, 2), noreturn));
|
2011-02-28 14:18:07 +00:00
|
|
|
static void linker_error (const char *fmt, ...)
|
|
|
|
__attribute__ ((format (printf, 1, 2)));
|
|
|
|
static void linker_warning (const char *fmt, ...)
|
|
|
|
__attribute__ ((format (printf, 1, 2)));
|
2011-02-24 03:18:35 +00:00
|
|
|
static void def_error (qfo_def_t *def, const char *fmt, ...)
|
2011-02-28 14:18:07 +00:00
|
|
|
__attribute__ ((format (printf, 2, 3)));
|
2011-02-24 03:18:35 +00:00
|
|
|
static void def_warning (qfo_def_t *def, const char *fmt, ...)
|
|
|
|
__attribute__ ((used, format (printf, 2, 3)));
|
2003-02-21 22:31:40 +00:00
|
|
|
|
2011-03-02 02:13:44 +00:00
|
|
|
/** Safe handling of defs in hash tables and other containers.
|
|
|
|
|
|
|
|
As defs are stored in dynamic arrays, storing pointers to the defs is
|
|
|
|
a recipe for disaster when using realloc(). By storing the address of
|
|
|
|
the pointer to the array and the index into that that array, realloc
|
|
|
|
is allowed to do its magic.
|
|
|
|
*/
|
2011-02-28 14:18:07 +00:00
|
|
|
typedef struct defref_s {
|
2011-03-02 02:13:44 +00:00
|
|
|
struct defref_s *next; ///< if \c merge is true, the next def to
|
|
|
|
///< be merged with the main def
|
2011-03-04 11:40:01 +00:00
|
|
|
int def; ///< the index of this def
|
2011-03-02 02:13:44 +00:00
|
|
|
int space; ///< the space in which this def resides
|
|
|
|
int merge; ///< merge def's relocs with the main def
|
|
|
|
struct defref_s *merge_list; ///< list of defs to be merged with this
|
|
|
|
///< def
|
2011-02-28 14:18:07 +00:00
|
|
|
} defref_t;
|
|
|
|
|
2011-03-02 02:13:44 +00:00
|
|
|
/** Retreive a def from a defref.
|
|
|
|
|
|
|
|
\param r The defref pointing to the def (defref_t *).
|
|
|
|
\return A pointer to the def (qfo_def_t *).
|
|
|
|
*/
|
2011-03-01 00:19:04 +00:00
|
|
|
#define REF(r) (work->spaces[(r)->space].defs + (r)->def)
|
2011-02-28 14:18:07 +00:00
|
|
|
|
2011-03-04 23:36:55 +00:00
|
|
|
typedef struct builtin_sym_s {
|
|
|
|
const char *name;
|
|
|
|
type_t *type;
|
|
|
|
unsigned flags;
|
|
|
|
defref_t *defref;
|
|
|
|
} builtin_sym_t;
|
|
|
|
|
|
|
|
static builtin_sym_t builtin_symbols[] __attribute__ ((used)) = {
|
|
|
|
{".zero", &type_zero, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".return", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_0", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_1", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_2", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_3", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_4", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_5", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_6", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
{".param_7", &type_param, QFOD_NOSAVE | QFOD_GLOBAL},
|
|
|
|
};
|
2018-09-09 07:48:19 +00:00
|
|
|
static const unsigned num_builtins = sizeof (builtin_symbols)
|
|
|
|
/ sizeof (builtin_symbols[0]);
|
2011-03-04 23:36:55 +00:00
|
|
|
|
2013-03-08 13:16:31 +00:00
|
|
|
static defref_t *defrefs_freelist;
|
2011-02-28 14:18:07 +00:00
|
|
|
|
2012-11-14 04:14:54 +00:00
|
|
|
static hashtab_t *extern_data_defs;
|
|
|
|
static hashtab_t *defined_data_defs;
|
2011-02-28 14:18:07 +00:00
|
|
|
|
2011-03-07 05:45:50 +00:00
|
|
|
static hashtab_t *extern_field_defs;
|
|
|
|
static hashtab_t *defined_field_defs;
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
static hashtab_t *extern_type_defs;
|
|
|
|
static hashtab_t *defined_type_defs;
|
|
|
|
static qfo_mspace_t *qfo_type_defs;
|
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
static qfo_t *work;
|
2011-03-01 06:18:47 +00:00
|
|
|
static int work_base[qfo_num_spaces];
|
|
|
|
static int work_func_base;
|
2011-02-28 14:18:07 +00:00
|
|
|
static defref_t **work_defrefs;
|
2018-09-08 10:45:19 +00:00
|
|
|
static unsigned num_work_defrefs;
|
2011-02-24 03:18:35 +00:00
|
|
|
static strpool_t *work_strings;
|
|
|
|
static codespace_t *work_code;
|
|
|
|
static defspace_t *work_near_data;
|
|
|
|
static defspace_t *work_far_data;
|
|
|
|
static defspace_t *work_entity_data;
|
|
|
|
static defspace_t *work_type_data;
|
2011-03-01 06:18:47 +00:00
|
|
|
static qfo_reloc_t *work_loose_relocs;
|
|
|
|
static int work_num_loose_relocs;
|
2003-02-21 22:31:40 +00:00
|
|
|
|
2011-03-02 03:26:53 +00:00
|
|
|
static defspace_t **work_spaces[qfo_num_spaces] = {
|
|
|
|
0, 0, 0,
|
|
|
|
&work_near_data,
|
|
|
|
&work_far_data,
|
|
|
|
&work_entity_data,
|
2012-11-13 12:55:54 +00:00
|
|
|
&work_type_data,
|
2011-03-02 03:26:53 +00:00
|
|
|
};
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
static dstring_t *linker_current_file;
|
|
|
|
|
|
|
|
#define QFOSTR(q,s) QFO_GETSTR (q, s)
|
|
|
|
#define WORKSTR(s) QFOSTR (work, s)
|
2012-11-13 12:55:54 +00:00
|
|
|
#define QFOTYPE(t) ((qfot_type_t *) (char *) \
|
|
|
|
(qfo_type_defs->d.data + (t)))
|
|
|
|
#define WORKTYPE(t) ((qfot_type_t *) (char *) \
|
|
|
|
(work_type_data->data + (t)))
|
2011-02-28 14:18:07 +00:00
|
|
|
|
|
|
|
/** Produce an error message for defs with mismatched types.
|
|
|
|
|
|
|
|
\param def The new def.
|
|
|
|
\param prev The previous definition.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
linker_type_mismatch (qfo_def_t *def, qfo_def_t *prev)
|
|
|
|
{
|
2012-11-14 04:25:03 +00:00
|
|
|
const char *def_encoding;
|
|
|
|
const char *prev_encoding;
|
|
|
|
|
2012-12-21 12:53:13 +00:00
|
|
|
if ((int) def->type < 0)
|
|
|
|
def_encoding = QFO_GETSTR (work, -(int) def->type);
|
2012-11-14 04:25:03 +00:00
|
|
|
else
|
|
|
|
def_encoding = QFO_TYPESTR (work, def->type);
|
2012-12-21 12:53:13 +00:00
|
|
|
if ((int) prev->type < 0)
|
|
|
|
prev_encoding = QFO_GETSTR (work, -(int) prev->type);
|
2012-11-14 04:25:03 +00:00
|
|
|
else
|
|
|
|
prev_encoding = QFO_TYPESTR (work, prev->type);
|
|
|
|
def_error (def, "type mismatch for `%s' `%s'", WORKSTR (def->name),
|
|
|
|
def_encoding);
|
2011-02-28 14:18:07 +00:00
|
|
|
def_error (prev, "previous definition `%s'",
|
2012-11-14 04:25:03 +00:00
|
|
|
prev_encoding);
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/** Create a new def reference.
|
|
|
|
|
|
|
|
References are required to avoid problems with realloc moving things
|
|
|
|
around.
|
|
|
|
|
|
|
|
The \a def must be in the \a space, and the \a space must be in the
|
|
|
|
\c work qfo.
|
|
|
|
|
|
|
|
\param def The def for which the reference will be created.
|
|
|
|
\param space The defspace in \c work which holds \a def.
|
|
|
|
\return The new reference.
|
|
|
|
*/
|
|
|
|
static defref_t *
|
2011-03-01 00:19:04 +00:00
|
|
|
get_defref (qfo_def_t *def, qfo_mspace_t *space)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
|
|
|
defref_t *defref;
|
|
|
|
|
|
|
|
ALLOC (16384, defref_t, defrefs, defref);
|
2011-03-01 00:19:04 +00:00
|
|
|
defref->def = def - space->defs;
|
2011-02-28 14:18:07 +00:00
|
|
|
defref->space = space - work->spaces;
|
|
|
|
return defref;
|
|
|
|
}
|
|
|
|
|
|
|
|
static const char *
|
2012-07-18 13:34:37 +00:00
|
|
|
defs_get_key (const void *_r, void *unused)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
|
|
|
defref_t *r = (defref_t *)_r;
|
|
|
|
qfo_def_t *d = REF (r);
|
|
|
|
return WORKSTR (d->name);
|
|
|
|
}
|
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
/** Add a string to the working qfo string pool.
|
2003-02-21 22:31:40 +00:00
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
If the string is already in the string pool, the already existing string
|
|
|
|
index will be returned instead of adding a second copy of the string.
|
2002-07-03 20:16:32 +00:00
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
The strings space in the working qfo is kept up to date.
|
2002-07-03 20:16:32 +00:00
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
\param str The string to add.
|
|
|
|
\return The string offset in the working qfo string pool.
|
|
|
|
*/
|
2011-03-02 11:48:55 +00:00
|
|
|
int
|
|
|
|
linker_add_string (const char *str)
|
2002-07-11 17:06:15 +00:00
|
|
|
{
|
2011-02-24 03:18:35 +00:00
|
|
|
string_t new;
|
|
|
|
new = strpool_addstr (work_strings, str);
|
|
|
|
work->spaces[qfo_strings_space].d.strings = work_strings->strings;
|
|
|
|
work->spaces[qfo_strings_space].data_size = work_strings->size;
|
|
|
|
return new;
|
2002-07-11 17:06:15 +00:00
|
|
|
}
|
|
|
|
|
2012-11-13 12:48:46 +00:00
|
|
|
/** Allocate data from the working qfo.
|
|
|
|
|
|
|
|
\param space The space from which to allocate data.
|
|
|
|
\param size The number of words to allocate.
|
|
|
|
\return The offset of the allocated data.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
alloc_data (int space, int size)
|
|
|
|
{
|
|
|
|
int offset;
|
|
|
|
|
|
|
|
if (space < 0 || space >= qfo_num_spaces || !work_spaces[space])
|
|
|
|
linker_internal_error ("bad space for alloc_data (): %d", space);
|
|
|
|
if (size <= 0)
|
|
|
|
linker_internal_error ("bad size for alloc_data (): %d", space);
|
|
|
|
offset = defspace_alloc_loc (*work_spaces[space], size);
|
|
|
|
work->spaces[space].d.data = (*work_spaces[space])->data;
|
|
|
|
work->spaces[space].data_size = (*work_spaces[space])->size;
|
|
|
|
return offset;
|
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
/** Resolve an external def with its global definition.
|
|
|
|
|
|
|
|
The types of the external def and the global def must match.
|
|
|
|
The offset and flags of the global def are copied to the external def.
|
|
|
|
|
|
|
|
\param ext The external def.
|
|
|
|
\param def The global definition.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
resolve_external_def (defref_t *ext, defref_t *def)
|
|
|
|
{
|
2011-03-07 11:52:31 +00:00
|
|
|
if (!(REF (ext)->flags & QFOD_EXTERNAL)) {
|
|
|
|
def_error (REF (ext), "%s %x", WORKSTR (REF (ext)->name),
|
|
|
|
REF (ext)->flags);
|
2012-10-26 10:02:02 +00:00
|
|
|
linker_internal_error ("ext is not an external def");
|
2011-03-07 11:52:31 +00:00
|
|
|
}
|
2012-11-14 06:50:55 +00:00
|
|
|
if (REF (def)->flags & (QFOD_EXTERNAL | QFOD_LOCAL)) {
|
|
|
|
def_error (REF (def), "%s %x", WORKSTR (REF (def)->name),
|
|
|
|
REF (def)->flags);
|
|
|
|
linker_internal_error ("def is an external or local def");
|
2011-03-07 11:52:31 +00:00
|
|
|
}
|
2011-02-28 14:18:07 +00:00
|
|
|
if (REF (ext)->type != REF (def)->type) {
|
|
|
|
linker_type_mismatch (REF (ext), REF (def));
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
REF (ext)->offset = REF (def)->offset;
|
|
|
|
REF (ext)->flags = REF (def)->flags;
|
2011-03-01 06:18:47 +00:00
|
|
|
ext->merge = 1;
|
2011-03-02 03:35:10 +00:00
|
|
|
ext->space = def->space;
|
2011-03-01 06:18:47 +00:00
|
|
|
ext->next = def->merge_list;
|
|
|
|
def->merge_list = ext;
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
|
|
|
|
2011-04-03 04:03:22 +00:00
|
|
|
static void
|
2012-11-13 04:16:45 +00:00
|
|
|
define_def (defref_t *ref, hashtab_t *extern_tab, hashtab_t *defined_tab)
|
2011-04-03 04:03:22 +00:00
|
|
|
{
|
|
|
|
defref_t *r;
|
|
|
|
const char *name;
|
|
|
|
|
2012-11-14 06:50:55 +00:00
|
|
|
if (REF (ref)->flags & (QFOD_EXTERNAL | QFOD_LOCAL)) {
|
|
|
|
def_error (REF (ref), "%s %x", WORKSTR (REF (ref)->name),
|
|
|
|
REF (ref)->flags);
|
|
|
|
linker_internal_error ("ref is an external or local def");
|
|
|
|
}
|
2011-04-03 04:03:22 +00:00
|
|
|
name = WORKSTR (REF (ref)->name);
|
|
|
|
if ((r = Hash_Find (defined_tab, name))) {
|
|
|
|
if (REF (r)->flags & QFOD_SYSTEM) {
|
|
|
|
/// System defs may be redefined only once.
|
|
|
|
REF (r)->flags &= ~QFOD_SYSTEM;
|
|
|
|
// treat the new def as external
|
|
|
|
REF (ref)->flags |= QFOD_EXTERNAL;
|
|
|
|
resolve_external_def (ref, r);
|
|
|
|
} else {
|
|
|
|
def_error (REF (ref), "%s redefined", WORKSTR (REF (ref)->name));
|
|
|
|
def_error (REF (r), "previous definition");
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
Hash_Add (defined_tab, ref);
|
|
|
|
while ((r = Hash_Del (extern_tab, name)))
|
|
|
|
resolve_external_def (r, ref);
|
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
static void
|
2012-11-13 04:16:45 +00:00
|
|
|
extern_def (defref_t *ref, hashtab_t *extern_tab, hashtab_t *defined_tab)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
|
|
|
defref_t *r;
|
|
|
|
const char *name;
|
|
|
|
|
2012-11-13 04:16:45 +00:00
|
|
|
name = WORKSTR (REF (ref)->name);
|
|
|
|
r = Hash_Find (defined_tab, name);
|
|
|
|
if (!REF (ref)->num_relocs)
|
|
|
|
return;
|
|
|
|
if (r) {
|
|
|
|
resolve_external_def (ref, r);
|
|
|
|
} else {
|
|
|
|
Hash_Add (extern_tab, ref);
|
2011-03-07 05:45:50 +00:00
|
|
|
}
|
2012-11-13 04:16:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
process_def (defref_t *ref, qfo_mspace_t *space,
|
|
|
|
hashtab_t *extern_tab, hashtab_t *defined_tab)
|
|
|
|
{
|
2011-04-03 04:03:22 +00:00
|
|
|
if (REF (ref)->flags & QFOD_EXTERNAL) {
|
2012-11-13 04:16:45 +00:00
|
|
|
extern_def (ref, extern_tab, defined_tab);
|
2011-03-04 05:33:03 +00:00
|
|
|
} else {
|
2011-04-03 04:03:22 +00:00
|
|
|
if (!(REF (ref)->flags & QFOD_LOCAL))
|
|
|
|
REF (ref)->offset += space->data_size;
|
|
|
|
if (REF (ref)->flags & QFOD_GLOBAL)
|
2012-11-13 04:16:45 +00:00
|
|
|
define_def (ref, extern_tab, defined_tab);
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-11-13 04:16:45 +00:00
|
|
|
static void
|
2012-11-13 12:55:54 +00:00
|
|
|
process_data_def (defref_t *ref, qfo_mspace_t *space, qfo_def_t *old)
|
2012-11-13 04:16:45 +00:00
|
|
|
{
|
2012-11-14 04:14:54 +00:00
|
|
|
process_def (ref, space, extern_data_defs, defined_data_defs);
|
2012-11-13 04:16:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2012-11-13 12:55:54 +00:00
|
|
|
process_field_def (defref_t *ref, qfo_mspace_t *space, qfo_def_t *old)
|
2012-11-13 04:16:45 +00:00
|
|
|
{
|
|
|
|
process_def (ref, space, extern_field_defs, defined_field_defs);
|
|
|
|
}
|
|
|
|
|
2012-11-13 12:55:54 +00:00
|
|
|
static void
|
|
|
|
process_type_def (defref_t *ref, qfo_mspace_t *space, qfo_def_t *old)
|
|
|
|
{
|
|
|
|
if (REF (ref)->flags & QFOD_EXTERNAL) {
|
|
|
|
// The most common (only?) time external type encodings show up is
|
|
|
|
// in pointers to incomplete structs. eg, struct foo *bar; with no
|
|
|
|
// struct foo {...};
|
|
|
|
extern_def (ref, extern_type_defs, defined_type_defs);
|
|
|
|
} else {
|
|
|
|
const char *name;
|
|
|
|
defref_t *r;
|
|
|
|
qfot_type_t *old_type;
|
|
|
|
qfot_type_t *new_type;
|
|
|
|
|
|
|
|
old_type = QFOTYPE(old->offset);
|
|
|
|
name = WORKSTR (REF (ref)->name);
|
|
|
|
if ((r = Hash_Find (defined_type_defs, name))) {
|
|
|
|
// The type has been defined already, so treat this def as if it
|
|
|
|
// were external
|
|
|
|
REF (ref)->flags |= QFOD_EXTERNAL;
|
|
|
|
resolve_external_def (ref, r);
|
|
|
|
} else {
|
|
|
|
// The type is new to the program, so we need to allocate space
|
|
|
|
// for it and copy the type encoding. Relocation records will
|
|
|
|
// take care of any cross-references.
|
|
|
|
|
|
|
|
REF (ref)->offset = alloc_data (qfo_type_space, old_type->size);
|
2012-11-14 04:25:03 +00:00
|
|
|
new_type = WORKTYPE (REF (ref)->offset);
|
2012-11-13 12:55:54 +00:00
|
|
|
memcpy (new_type, old_type, old_type->size * sizeof (pr_type_t));
|
|
|
|
define_def (ref, extern_type_defs, defined_type_defs);
|
|
|
|
}
|
|
|
|
// save the new address in the old def's type field so relocation
|
|
|
|
// records can be updated.
|
|
|
|
old->type = REF (ref)->offset;
|
|
|
|
// mark the old type encoding as having been transfered, and save the
|
|
|
|
// new address in the encoding's class field so def and function types
|
|
|
|
// can be updated easily.
|
2019-06-09 09:10:07 +00:00
|
|
|
old_type->meta = -1;
|
2012-11-13 12:55:54 +00:00
|
|
|
old_type->t.class = REF (ref)->offset;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-11-14 01:29:45 +00:00
|
|
|
static void
|
|
|
|
adjust_reloc_offset (qfo_reloc_t *reloc)
|
|
|
|
{
|
|
|
|
if (!reloc->space) {
|
|
|
|
//FIXME double check
|
|
|
|
reloc->offset += work_base[qfo_code_space];
|
|
|
|
} else if (reloc->space < qfo_num_spaces) {
|
|
|
|
// Relocs in type space are handled by process_type_space, so don't
|
|
|
|
// touch them here.
|
|
|
|
if (reloc->space != qfo_type_space)
|
|
|
|
reloc->offset += work_base[reloc->space];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-03-02 02:14:12 +00:00
|
|
|
static int
|
|
|
|
add_relocs (qfo_t *qfo, int start, int count, int target)
|
|
|
|
{
|
2018-09-08 10:45:19 +00:00
|
|
|
unsigned size;
|
2012-11-14 11:37:19 +00:00
|
|
|
qfo_reloc_t *ireloc;
|
|
|
|
qfo_reloc_t *oreloc;
|
2011-03-02 02:14:12 +00:00
|
|
|
|
|
|
|
size = work->num_relocs + count;
|
|
|
|
work->relocs = realloc (work->relocs, size * sizeof (qfo_reloc_t));
|
2012-11-14 11:37:19 +00:00
|
|
|
ireloc = qfo->relocs + start;
|
|
|
|
oreloc = work->relocs + work->num_relocs;
|
|
|
|
for ( ; work->num_relocs < size; ireloc++, oreloc++) {
|
|
|
|
*oreloc = *ireloc;
|
|
|
|
ireloc->type = -1;
|
|
|
|
ireloc->offset = work->num_relocs++;
|
2018-09-08 10:45:19 +00:00
|
|
|
if (oreloc->space >= qfo->num_spaces) {
|
2012-11-14 11:37:19 +00:00
|
|
|
linker_error ("bad reloc space: %d (%d)", oreloc->space,
|
2011-03-02 02:14:12 +00:00
|
|
|
qfo->num_spaces);
|
2012-11-14 11:37:19 +00:00
|
|
|
oreloc->type = rel_none;
|
2011-03-02 02:14:12 +00:00
|
|
|
continue;
|
|
|
|
}
|
2012-11-14 11:37:19 +00:00
|
|
|
oreloc->space = qfo->spaces[oreloc->space].id;
|
|
|
|
adjust_reloc_offset (oreloc);
|
|
|
|
oreloc->target = target;
|
2011-03-02 02:14:12 +00:00
|
|
|
}
|
|
|
|
return work->num_relocs - count;
|
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
static int
|
2012-11-13 04:16:45 +00:00
|
|
|
add_defs (qfo_t *qfo, qfo_mspace_t *space, qfo_mspace_t *dest_space,
|
2012-11-13 12:55:54 +00:00
|
|
|
void (*process) (defref_t *ref, qfo_mspace_t *space, qfo_def_t *old))
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
|
|
|
int count = space->num_defs;
|
|
|
|
int size;
|
|
|
|
int i;
|
|
|
|
qfo_def_t *idef;
|
|
|
|
qfo_def_t *odef;
|
|
|
|
defref_t *ref;
|
2011-03-01 00:17:32 +00:00
|
|
|
qfot_type_t *type;
|
2011-02-28 14:18:07 +00:00
|
|
|
|
|
|
|
size = (num_work_defrefs + count) * sizeof (defref_t *);
|
|
|
|
work_defrefs = realloc (work_defrefs, size);
|
|
|
|
size = (dest_space->num_defs + count) * sizeof (qfo_def_t);
|
|
|
|
dest_space->defs = realloc (dest_space->defs, size);
|
|
|
|
idef = space->defs;
|
|
|
|
odef = dest_space->defs + dest_space->num_defs;
|
|
|
|
for (i = 0; i < count; i++, idef++, odef++) {
|
2011-03-02 02:13:44 +00:00
|
|
|
*odef = *idef; // copy the def data
|
2011-03-02 11:48:55 +00:00
|
|
|
odef->name = linker_add_string (QFOSTR (qfo, idef->name));
|
|
|
|
odef->file = linker_add_string (QFOSTR (qfo, idef->file));
|
2012-11-14 11:37:19 +00:00
|
|
|
idef->file = -1; // mark def as copied
|
|
|
|
idef->line = num_work_defrefs; // so def can be found
|
2012-11-13 12:55:54 +00:00
|
|
|
type = QFOTYPE(idef->type);
|
2011-03-02 02:13:44 +00:00
|
|
|
odef->type = type->t.class; // pointer to type in work
|
2011-03-04 05:51:09 +00:00
|
|
|
if (odef->flags & QFOD_EXTERNAL && !odef->num_relocs)
|
|
|
|
continue;
|
2011-03-01 00:19:04 +00:00
|
|
|
ref = get_defref (odef, dest_space);
|
2011-02-28 14:18:07 +00:00
|
|
|
work_defrefs[num_work_defrefs++] = ref;
|
2012-11-13 12:55:54 +00:00
|
|
|
process (ref, dest_space, idef);
|
2012-11-14 04:25:30 +00:00
|
|
|
REF (ref)->relocs = add_relocs (qfo, REF (ref)->relocs,
|
|
|
|
REF (ref)->num_relocs,
|
|
|
|
REF (ref) - dest_space->defs);
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
|
|
|
dest_space->num_defs += count;
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Add all the strings in the strings space to the working qfo.
|
|
|
|
|
|
|
|
\param strings The strings space of the qfo being linked.
|
|
|
|
*/
|
2002-07-11 17:06:15 +00:00
|
|
|
static void
|
2011-02-24 03:18:35 +00:00
|
|
|
add_qfo_strings (qfo_mspace_t *strings)
|
2002-07-11 17:06:15 +00:00
|
|
|
{
|
2011-02-24 03:18:35 +00:00
|
|
|
const char *str = strings->d.strings;
|
2002-07-11 17:06:15 +00:00
|
|
|
|
2013-01-05 08:40:59 +00:00
|
|
|
while ((pr_uint_t) (str - strings->d.strings) < strings->data_size) {
|
2011-03-02 11:48:55 +00:00
|
|
|
linker_add_string (str);
|
2013-01-05 08:40:59 +00:00
|
|
|
while ((pr_uint_t) (str - strings->d.strings) < strings->data_size
|
|
|
|
&& *str)
|
2011-02-24 03:18:35 +00:00
|
|
|
str++;
|
|
|
|
str++; // advance past the terminating nul
|
2002-07-11 17:06:15 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
/** Add the code in the code space to the working qfo.
|
|
|
|
|
|
|
|
\param code The code space of the qfo being linked.
|
|
|
|
*/
|
2002-07-11 17:06:15 +00:00
|
|
|
static void
|
2011-02-24 03:18:35 +00:00
|
|
|
add_code (qfo_mspace_t *code)
|
2002-07-03 20:16:32 +00:00
|
|
|
{
|
2011-02-24 03:18:35 +00:00
|
|
|
codespace_addcode (work_code, code->d.code, code->data_size);
|
|
|
|
work->spaces[qfo_code_space].d.code = work_code->code;
|
|
|
|
work->spaces[qfo_code_space].data_size = work_code->size;
|
2002-07-14 05:40:38 +00:00
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
/** Add the data in a data space to the working qfo.
|
|
|
|
|
2011-07-10 10:12:07 +00:00
|
|
|
\param space The space to which the data will be added.
|
2011-02-28 14:18:07 +00:00
|
|
|
\param data A data space of the qfo being linked.
|
|
|
|
*/
|
2002-07-16 21:59:47 +00:00
|
|
|
static void
|
2011-02-24 03:18:35 +00:00
|
|
|
add_data (int space, qfo_mspace_t *data)
|
2002-07-16 21:59:47 +00:00
|
|
|
{
|
2011-02-24 03:18:35 +00:00
|
|
|
if (space < 0 || space >= qfo_num_spaces || !work_spaces[space])
|
2012-11-13 12:51:16 +00:00
|
|
|
linker_internal_error ("bad space for add_data (): %d", space);
|
2012-12-04 04:40:00 +00:00
|
|
|
if (data->data_size)
|
|
|
|
defspace_add_data (*work_spaces[space], data->d.data, data->data_size);
|
2011-03-02 03:26:53 +00:00
|
|
|
work->spaces[space].d.data = (*work_spaces[space])->data;
|
|
|
|
work->spaces[space].data_size = (*work_spaces[space])->size;
|
2002-07-16 21:59:47 +00:00
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
/** Add a defspace to the working qfo.
|
2002-07-03 20:16:32 +00:00
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
\param qfo The qfo being linked.
|
|
|
|
\param space The defspace from \a qfo that will be added to the working
|
|
|
|
qfo.
|
|
|
|
*/
|
2002-07-16 17:35:40 +00:00
|
|
|
static void
|
2012-11-13 04:16:45 +00:00
|
|
|
add_data_space (qfo_t *qfo, qfo_mspace_t *space)
|
2002-07-16 17:35:40 +00:00
|
|
|
{
|
2011-02-28 14:18:07 +00:00
|
|
|
qfo_mspace_t *ws;
|
|
|
|
if (space->type != qfos_data)
|
2012-11-13 12:51:16 +00:00
|
|
|
linker_internal_error ("bad space type for add_data_space (): %d",
|
|
|
|
space->type);
|
2011-02-28 14:18:07 +00:00
|
|
|
space->id = work->num_spaces++; // so the space in work can be found
|
|
|
|
work->spaces = realloc (work->spaces,
|
|
|
|
work->num_spaces * sizeof (qfo_mspace_t));
|
|
|
|
ws = &work->spaces[space->id];
|
|
|
|
memset (ws, 0, sizeof (qfo_mspace_t));
|
|
|
|
ws->type = space->type;
|
|
|
|
if (space->num_defs)
|
2012-11-13 04:16:45 +00:00
|
|
|
add_defs (qfo, space, ws, process_data_def);
|
2011-02-28 14:18:07 +00:00
|
|
|
if (space->d.data) {
|
|
|
|
int size = space->data_size * sizeof (pr_type_t);
|
|
|
|
ws->d.data = malloc (size);
|
|
|
|
memcpy (ws->d.data, space->d.data, size);
|
2002-07-12 20:26:51 +00:00
|
|
|
}
|
2011-02-28 14:18:07 +00:00
|
|
|
ws->data_size = space->data_size;
|
|
|
|
ws->id = space->id;
|
2002-07-12 20:26:51 +00:00
|
|
|
}
|
|
|
|
|
2011-03-04 23:36:55 +00:00
|
|
|
static defref_t *
|
2012-11-14 04:12:58 +00:00
|
|
|
make_def (int s, const char *name, type_t *type, unsigned flags, void *val)
|
2002-07-14 05:40:38 +00:00
|
|
|
{
|
2011-03-02 03:26:53 +00:00
|
|
|
qfo_def_t *def;
|
|
|
|
defref_t *ref;
|
2011-03-02 11:48:55 +00:00
|
|
|
qfo_mspace_t *space;
|
2011-03-04 02:18:56 +00:00
|
|
|
defspace_t *def_space;
|
2011-03-02 03:26:53 +00:00
|
|
|
|
2011-04-03 04:03:22 +00:00
|
|
|
space = &work->spaces[s];
|
|
|
|
def_space = *work_spaces[s];
|
2011-03-04 02:18:56 +00:00
|
|
|
|
2011-03-02 03:26:53 +00:00
|
|
|
space->defs = realloc (space->defs,
|
|
|
|
(space->num_defs + 1) * sizeof (qfo_def_t));
|
|
|
|
def = space->defs + space->num_defs++;
|
|
|
|
memset (def, 0, sizeof (*def));
|
2011-03-02 11:48:55 +00:00
|
|
|
def->name = linker_add_string (name);
|
2011-04-03 04:02:04 +00:00
|
|
|
def->type = -linker_add_string (type->encoding);
|
|
|
|
ref = Hash_Find (defined_type_defs, WORKSTR (-def->type));
|
|
|
|
if (ref)
|
|
|
|
def->type = REF (ref)->offset;
|
2012-11-13 12:48:46 +00:00
|
|
|
def->offset = alloc_data (s, type_size (type));
|
2011-03-02 03:26:53 +00:00
|
|
|
def->flags = flags;
|
2012-11-14 04:12:58 +00:00
|
|
|
if (val)
|
|
|
|
memcpy (&def_space->data[def->offset], val,
|
|
|
|
type_size (type) * sizeof (pr_type_t));
|
2011-03-04 02:18:56 +00:00
|
|
|
space->d.data = def_space->data;
|
|
|
|
space->data_size = def_space->size;
|
2011-03-02 03:26:53 +00:00
|
|
|
|
|
|
|
ref = get_defref (def, space);
|
|
|
|
work_defrefs = realloc (work_defrefs,
|
|
|
|
(num_work_defrefs + 1) * sizeof (defref_t *));
|
|
|
|
work_defrefs[num_work_defrefs++] = ref;
|
2012-11-13 04:16:45 +00:00
|
|
|
if (s == qfo_entity_space) {
|
|
|
|
define_def (ref, extern_field_defs, defined_field_defs);
|
|
|
|
} else {
|
2012-11-14 04:14:54 +00:00
|
|
|
define_def (ref, extern_data_defs, defined_data_defs);
|
2012-11-13 04:16:45 +00:00
|
|
|
}
|
2011-03-04 23:36:55 +00:00
|
|
|
|
|
|
|
return ref;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2012-11-14 04:12:58 +00:00
|
|
|
linker_add_def (const char *name, type_t *type, unsigned flags, void *val)
|
2011-03-04 23:36:55 +00:00
|
|
|
{
|
2012-11-14 04:12:58 +00:00
|
|
|
make_def (qfo_near_data_space, name, type, flags, val);
|
2002-07-14 05:40:38 +00:00
|
|
|
}
|
|
|
|
|
2012-11-09 02:57:06 +00:00
|
|
|
qfo_def_t *
|
|
|
|
linker_find_def (const char *name)
|
|
|
|
{
|
|
|
|
defref_t *r;
|
|
|
|
|
2012-11-14 04:14:54 +00:00
|
|
|
if ((r = Hash_Find (defined_data_defs, name)))
|
2012-11-09 02:57:06 +00:00
|
|
|
return REF (r);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
/** Initialize the linker state.
|
|
|
|
*/
|
2002-07-03 20:16:32 +00:00
|
|
|
void
|
|
|
|
linker_begin (void)
|
|
|
|
{
|
2018-09-09 07:48:19 +00:00
|
|
|
unsigned i;
|
2011-03-02 03:26:53 +00:00
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
linker_current_file = dstring_newstr ();
|
|
|
|
|
2012-11-14 04:14:54 +00:00
|
|
|
extern_data_defs = Hash_NewTable (16381, defs_get_key, 0, 0);
|
|
|
|
defined_data_defs = Hash_NewTable (16381, defs_get_key, 0, 0);
|
2011-02-28 14:18:07 +00:00
|
|
|
|
2011-03-07 05:45:50 +00:00
|
|
|
extern_field_defs = Hash_NewTable (16381, defs_get_key, 0, 0);
|
|
|
|
defined_field_defs = Hash_NewTable (16381, defs_get_key, 0, 0);
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
extern_type_defs = Hash_NewTable (16381, defs_get_key, 0, 0);
|
|
|
|
defined_type_defs = Hash_NewTable (16381, defs_get_key, 0, 0);
|
|
|
|
|
2011-03-04 02:18:56 +00:00
|
|
|
work_strings = strpool_new ();
|
|
|
|
work_code = codespace_new ();
|
2012-12-04 05:08:51 +00:00
|
|
|
work_near_data = defspace_new (ds_backed);
|
|
|
|
work_far_data = defspace_new (ds_backed);
|
|
|
|
work_entity_data = defspace_new (ds_virtual);
|
|
|
|
work_type_data = defspace_new (ds_backed);
|
2011-03-04 02:18:56 +00:00
|
|
|
|
|
|
|
pr.strings = work_strings;
|
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
work = qfo_new ();
|
|
|
|
work->spaces = calloc (qfo_num_spaces, sizeof (qfo_mspace_t));
|
|
|
|
work->num_spaces = qfo_num_spaces;
|
2011-02-28 14:18:07 +00:00
|
|
|
work->spaces[qfo_null_space].type = qfos_null;
|
|
|
|
work->spaces[qfo_strings_space].type = qfos_string;
|
2011-03-04 02:18:56 +00:00
|
|
|
work->spaces[qfo_strings_space].d.strings = work_strings->strings;
|
|
|
|
work->spaces[qfo_strings_space].data_size = work_strings->size;
|
2011-02-28 14:18:07 +00:00
|
|
|
work->spaces[qfo_code_space].type = qfos_code;
|
2011-03-04 02:18:56 +00:00
|
|
|
work->spaces[qfo_code_space].d.code = work_code->code;
|
|
|
|
work->spaces[qfo_code_space].data_size = work_code->size;
|
2011-02-28 14:18:07 +00:00
|
|
|
work->spaces[qfo_near_data_space].type = qfos_data;
|
2011-03-04 02:18:56 +00:00
|
|
|
work->spaces[qfo_near_data_space].d.data = work_near_data->data;
|
|
|
|
work->spaces[qfo_near_data_space].data_size = work_near_data->size;
|
2011-02-28 14:18:07 +00:00
|
|
|
work->spaces[qfo_far_data_space].type = qfos_data;
|
2011-03-04 02:18:56 +00:00
|
|
|
work->spaces[qfo_far_data_space].d.data = work_far_data->data;
|
|
|
|
work->spaces[qfo_far_data_space].data_size = work_far_data->size;
|
2011-02-28 14:18:07 +00:00
|
|
|
work->spaces[qfo_entity_space].type = qfos_entity;
|
2011-03-04 02:18:56 +00:00
|
|
|
work->spaces[qfo_entity_space].d.data = work_entity_data->data;
|
|
|
|
work->spaces[qfo_entity_space].data_size = work_entity_data->size;
|
2011-02-28 14:18:07 +00:00
|
|
|
work->spaces[qfo_type_space].type = qfos_type;
|
2011-03-04 02:18:56 +00:00
|
|
|
work->spaces[qfo_type_space].d.data = work_type_data->data;
|
|
|
|
work->spaces[qfo_type_space].data_size = work_type_data->size;
|
2011-03-04 23:36:55 +00:00
|
|
|
for (i = 0; i < qfo_num_spaces; i++)
|
2011-03-02 03:26:53 +00:00
|
|
|
work->spaces[i].id = i;
|
2011-02-24 03:18:35 +00:00
|
|
|
|
2012-11-13 12:48:46 +00:00
|
|
|
alloc_data (qfo_type_space, 4);
|
|
|
|
|
2011-03-05 06:40:08 +00:00
|
|
|
work->lines = calloc (1, sizeof (pr_lineno_t));
|
|
|
|
work->num_lines = 1;
|
|
|
|
|
2011-03-02 03:26:53 +00:00
|
|
|
if (!options.partial_link) {
|
2011-03-04 23:36:55 +00:00
|
|
|
for (i = 0; i < num_builtins; i++) {
|
|
|
|
builtin_sym_t *bi = builtin_symbols + i;
|
2011-04-03 04:03:22 +00:00
|
|
|
bi->defref = make_def (qfo_near_data_space, bi->name, bi->type,
|
|
|
|
bi->flags, 0);
|
2011-03-02 03:26:53 +00:00
|
|
|
}
|
|
|
|
}
|
2002-07-03 20:16:32 +00:00
|
|
|
}
|
|
|
|
|
2011-02-28 23:48:58 +00:00
|
|
|
typedef int (*space_func) (qfo_t *qfo, qfo_mspace_t *space, int pass);
|
2011-02-28 14:18:07 +00:00
|
|
|
|
|
|
|
static int
|
2011-03-01 06:35:14 +00:00
|
|
|
process_null_space (qfo_t *qfo, qfo_mspace_t *space, int pass)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
2011-02-28 23:48:58 +00:00
|
|
|
if (pass != 0)
|
|
|
|
return 0;
|
2011-02-28 14:18:07 +00:00
|
|
|
if (space->defs || space->num_defs || space->d.data || space->data_size
|
|
|
|
|| space->id) {
|
|
|
|
linker_error ("non-null null space");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2011-03-01 06:35:14 +00:00
|
|
|
process_code_space (qfo_t *qfo, qfo_mspace_t *space, int pass)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
2011-02-28 23:48:58 +00:00
|
|
|
if (pass != 1)
|
|
|
|
return 0;
|
2011-02-28 14:18:07 +00:00
|
|
|
if (space->defs || space->num_defs) {
|
|
|
|
linker_error ("defs in code space");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (space->id != qfo_code_space)
|
|
|
|
linker_warning ("hmm, unexpected code space. *shrug*");
|
|
|
|
add_code (space);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2011-03-01 06:35:14 +00:00
|
|
|
process_data_space (qfo_t *qfo, qfo_mspace_t *space, int pass)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
2011-02-28 23:48:58 +00:00
|
|
|
if (pass != 1)
|
|
|
|
return 0;
|
2011-02-28 14:18:07 +00:00
|
|
|
if (space->id == qfo_near_data_space) {
|
2012-11-13 04:16:45 +00:00
|
|
|
add_defs (qfo, space, work->spaces + qfo_near_data_space,
|
|
|
|
process_data_def);
|
2011-02-28 14:18:07 +00:00
|
|
|
add_data (qfo_near_data_space, space);
|
|
|
|
} else if (space->id == qfo_far_data_space) {
|
2012-11-13 04:16:45 +00:00
|
|
|
add_defs (qfo, space, work->spaces + qfo_far_data_space,
|
|
|
|
process_data_def);
|
2011-02-28 14:18:07 +00:00
|
|
|
add_data (qfo_far_data_space, space);
|
|
|
|
} else {
|
2012-11-13 04:16:45 +00:00
|
|
|
add_data_space (qfo, space);
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2011-03-01 06:35:14 +00:00
|
|
|
process_strings_space (qfo_t *qfo, qfo_mspace_t *space, int pass)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
2011-02-28 23:48:58 +00:00
|
|
|
if (pass != 0)
|
|
|
|
return 0;
|
2011-02-28 14:18:07 +00:00
|
|
|
if (space->defs || space->num_defs) {
|
|
|
|
linker_error ("defs in strings space");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
add_qfo_strings (space);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2011-03-01 06:35:14 +00:00
|
|
|
process_entity_space (qfo_t *qfo, qfo_mspace_t *space, int pass)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
2011-02-28 23:48:58 +00:00
|
|
|
if (pass != 1)
|
|
|
|
return 0;
|
2012-11-13 04:16:45 +00:00
|
|
|
add_defs (qfo, space, work->spaces + qfo_entity_space, process_field_def);
|
2011-02-28 14:18:07 +00:00
|
|
|
add_data (qfo_entity_space, space);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-11-13 12:55:54 +00:00
|
|
|
// NOTE this will likely give weird results for qsort if the defs overlapp.
|
|
|
|
// However, that should not happen.
|
|
|
|
static int
|
|
|
|
type_def_compare (const void *a, const void *b)
|
|
|
|
{
|
|
|
|
qfo_def_t *ta = (qfo_def_t *) a;
|
|
|
|
qfo_def_t *tb = (qfo_def_t *) b;
|
|
|
|
|
|
|
|
if (ta->offset < tb->offset)
|
|
|
|
return -1;
|
|
|
|
if (ta->offset >= tb->offset + QFOTYPE (tb->offset)->size)
|
|
|
|
return 1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-11-14 11:37:19 +00:00
|
|
|
static void
|
|
|
|
update_type_space_reloc (qfo_mspace_t *space, qfo_reloc_t *reloc)
|
|
|
|
{
|
|
|
|
qfo_def_t dummy;
|
|
|
|
qfo_def_t *def;
|
|
|
|
|
|
|
|
if (reloc->type == -1)
|
|
|
|
reloc = work->relocs + reloc->offset;
|
|
|
|
dummy.offset = reloc->offset;
|
|
|
|
def = (qfo_def_t *) bsearch (&dummy, space->defs, space->num_defs,
|
|
|
|
sizeof (qfo_def_t), type_def_compare);
|
|
|
|
if (!def)
|
|
|
|
linker_internal_error ("relocation record with invalid address. "
|
|
|
|
"corrupt object file?");
|
|
|
|
reloc->offset += def->type - def->offset;
|
|
|
|
}
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
static int
|
2011-03-01 06:35:14 +00:00
|
|
|
process_type_space (qfo_t *qfo, qfo_mspace_t *space, int pass)
|
2011-02-28 14:18:07 +00:00
|
|
|
{
|
2018-09-08 10:45:19 +00:00
|
|
|
unsigned i;
|
2011-02-28 14:18:07 +00:00
|
|
|
|
2011-02-28 23:48:58 +00:00
|
|
|
if (pass != 0)
|
|
|
|
return 0;
|
2011-02-28 14:18:07 +00:00
|
|
|
if (qfo_type_defs) {
|
|
|
|
linker_error ("type space already defined");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
qfo_type_defs = space;
|
2012-11-13 12:55:54 +00:00
|
|
|
add_defs (qfo, space, work->spaces + qfo_type_space, process_type_def);
|
|
|
|
// the defs in qfo are no longer needed by the rest of the linker, so
|
|
|
|
// we're free to mess around with them
|
|
|
|
|
|
|
|
// sort the defs by addres. Unfortunately, they will usually be in order,
|
|
|
|
// so qsort will likely be pessimistic, but oh well.
|
|
|
|
qsort (space->defs, space->num_defs, sizeof (qfo_def_t), type_def_compare);
|
|
|
|
|
|
|
|
// update the offsets of all relocation records that point into the type
|
2012-11-14 11:37:19 +00:00
|
|
|
// encoding space.
|
2012-11-13 12:55:54 +00:00
|
|
|
for (i = 0; i < qfo->num_relocs; i++) {
|
|
|
|
qfo_reloc_t *reloc = qfo->relocs + i;
|
|
|
|
|
|
|
|
if (reloc->space != space->id)
|
2011-02-28 14:18:07 +00:00
|
|
|
continue;
|
2012-11-14 11:37:19 +00:00
|
|
|
update_type_space_reloc (space, reloc);
|
|
|
|
// while we're at it, update the strings so the type space strings
|
|
|
|
// are always correct.
|
|
|
|
if (reloc->type == rel_def_string) {
|
|
|
|
string_t str;
|
|
|
|
str = linker_add_string (QFOSTR (qfo, reloc->target));
|
|
|
|
QFO_STRING (work, reloc->space, reloc->offset) = str;
|
|
|
|
}
|
2011-03-04 23:36:55 +00:00
|
|
|
}
|
2012-11-14 06:49:19 +00:00
|
|
|
for (i = 0; i < num_builtins; i++) {
|
|
|
|
builtin_sym_t *bi = builtin_symbols + i;
|
|
|
|
qfo_def_t *def;
|
|
|
|
defref_t *ref;
|
|
|
|
|
|
|
|
if (!bi->defref)
|
|
|
|
continue;
|
|
|
|
def = REF (bi->defref);
|
2012-12-21 12:53:13 +00:00
|
|
|
if ((int) def->type >= 0)
|
2012-11-14 06:49:19 +00:00
|
|
|
continue;
|
|
|
|
ref = Hash_Find (defined_type_defs, WORKSTR (-def->type));
|
|
|
|
if (!ref)
|
|
|
|
continue;
|
|
|
|
def->type = REF (ref)->offset;
|
|
|
|
}
|
2011-02-28 14:18:07 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-03-01 06:18:47 +00:00
|
|
|
static void
|
|
|
|
process_funcs (qfo_t *qfo)
|
|
|
|
{
|
2018-09-08 10:45:19 +00:00
|
|
|
unsigned size;
|
2011-03-01 06:18:47 +00:00
|
|
|
qfo_func_t *func;
|
|
|
|
qfot_type_t *type;
|
|
|
|
|
|
|
|
size = work->num_funcs + qfo->num_funcs;
|
|
|
|
work->funcs = realloc (work->funcs, size * sizeof (qfo_func_t));
|
|
|
|
memcpy (work->funcs + work->num_funcs, qfo->funcs,
|
|
|
|
qfo->num_funcs * sizeof (qfo_func_t));
|
|
|
|
while (work->num_funcs < size) {
|
|
|
|
func = work->funcs + work->num_funcs++;
|
2012-11-13 12:55:54 +00:00
|
|
|
type = QFOTYPE(func->type);
|
2011-03-01 06:18:47 +00:00
|
|
|
func->type = type->t.class;
|
2011-03-02 11:48:55 +00:00
|
|
|
func->name = linker_add_string (QFOSTR (qfo, func->name));
|
|
|
|
func->file = linker_add_string (QFOSTR (qfo, func->file));
|
2011-03-04 09:44:35 +00:00
|
|
|
if (func->code > 0)
|
|
|
|
func->code += work_base[qfo_code_space];
|
2013-06-24 00:16:55 +00:00
|
|
|
func->def = qfo->defs[func->def].line; // defref index
|
2011-03-01 06:18:47 +00:00
|
|
|
func->locals_space = qfo->spaces[func->locals_space].id;
|
2011-03-05 06:40:08 +00:00
|
|
|
if (func->line_info)
|
|
|
|
func->line_info += work->num_lines - 1; //FIXME order dependent
|
2011-03-02 02:14:12 +00:00
|
|
|
func->relocs = add_relocs (qfo, func->relocs, func->num_relocs,
|
|
|
|
func - work->funcs);
|
2011-03-01 06:18:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
process_lines (qfo_t *qfo)
|
|
|
|
{
|
2018-09-08 10:45:19 +00:00
|
|
|
unsigned size;
|
2011-03-01 06:18:47 +00:00
|
|
|
pr_lineno_t *line;
|
|
|
|
|
2011-03-05 06:40:08 +00:00
|
|
|
if (!qfo->num_lines)
|
|
|
|
return;
|
|
|
|
size = work->num_lines + qfo->num_lines - 1;
|
2011-03-01 06:18:47 +00:00
|
|
|
work->lines = realloc (work->lines, size * sizeof (pr_lineno_t));
|
2011-03-05 06:40:08 +00:00
|
|
|
memcpy (work->lines + work->num_lines, qfo->lines + 1,
|
|
|
|
(qfo->num_lines - 1) * sizeof (pr_lineno_t));
|
2011-03-01 06:18:47 +00:00
|
|
|
while (work->num_lines < size) {
|
|
|
|
line = work->lines + work->num_lines++;
|
|
|
|
if (line->line)
|
|
|
|
line->fa.addr += work_base[qfo_code_space];
|
|
|
|
else
|
|
|
|
line->fa.func += work_func_base;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
process_loose_relocs (qfo_t *qfo)
|
|
|
|
{
|
|
|
|
int size;
|
|
|
|
qfo_reloc_t *reloc;
|
|
|
|
|
|
|
|
size = work_num_loose_relocs + qfo->num_loose_relocs;
|
|
|
|
work_loose_relocs = realloc (work_loose_relocs,
|
|
|
|
size * sizeof (qfo_reloc_t));
|
|
|
|
memcpy (work_loose_relocs + work_num_loose_relocs,
|
|
|
|
qfo->relocs + qfo->num_relocs - qfo->num_loose_relocs,
|
2011-03-02 02:14:12 +00:00
|
|
|
qfo->num_loose_relocs * sizeof (qfo_reloc_t));
|
2011-03-01 06:18:47 +00:00
|
|
|
while (work_num_loose_relocs < size) {
|
|
|
|
reloc = work_loose_relocs + work_num_loose_relocs++;
|
2018-09-08 10:45:19 +00:00
|
|
|
if (reloc->space >= qfo->num_spaces) {
|
2011-03-01 06:18:47 +00:00
|
|
|
linker_error ("bad reloc space");
|
|
|
|
reloc->type = rel_none;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
reloc->space = qfo->spaces[reloc->space].id;
|
2011-03-04 12:29:47 +00:00
|
|
|
if (reloc->type == rel_def_string) {
|
2011-03-05 00:07:16 +00:00
|
|
|
const char *str;
|
2012-05-21 23:23:22 +00:00
|
|
|
|
2012-12-21 12:53:13 +00:00
|
|
|
if (reloc->target >= qfo->spaces[qfo_strings_space].data_size) {
|
2011-03-05 00:07:16 +00:00
|
|
|
linker_error ("bad string reloc at %d:%x", reloc->space,
|
|
|
|
reloc->offset);
|
|
|
|
reloc->target = 0;
|
|
|
|
}
|
|
|
|
str = QFOSTR (qfo, reloc->target);
|
2011-03-04 12:29:47 +00:00
|
|
|
reloc->target = linker_add_string (str);
|
|
|
|
}
|
2011-04-08 08:09:40 +00:00
|
|
|
if (reloc->type == rel_def_op)
|
|
|
|
reloc->target += work_base[qfo_code_space];
|
2012-11-14 01:29:45 +00:00
|
|
|
adjust_reloc_offset (reloc);
|
2011-03-01 06:18:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-03-02 11:48:55 +00:00
|
|
|
int
|
2002-07-21 07:12:17 +00:00
|
|
|
linker_add_qfo (qfo_t *qfo)
|
2002-07-03 20:16:32 +00:00
|
|
|
{
|
2011-02-28 14:18:07 +00:00
|
|
|
static space_func funcs[] = {
|
2011-03-01 06:35:14 +00:00
|
|
|
process_null_space,
|
|
|
|
process_code_space,
|
|
|
|
process_data_space,
|
|
|
|
process_strings_space,
|
|
|
|
process_entity_space,
|
|
|
|
process_type_space,
|
2011-02-28 14:18:07 +00:00
|
|
|
};
|
2018-09-08 10:45:19 +00:00
|
|
|
unsigned i;
|
2011-02-28 23:48:58 +00:00
|
|
|
int pass;
|
2011-02-28 14:18:07 +00:00
|
|
|
qfo_mspace_t *space;
|
|
|
|
|
2011-03-01 00:18:09 +00:00
|
|
|
qfo_type_defs = 0;
|
2011-03-01 06:18:47 +00:00
|
|
|
for (i = 0; i < qfo_num_spaces; i++) {
|
|
|
|
work_base[i] = work->spaces[i].data_size;
|
|
|
|
}
|
|
|
|
work_func_base = work->num_funcs;
|
2011-02-28 23:48:58 +00:00
|
|
|
for (pass = 0; pass < 2; pass++) {
|
|
|
|
for (i = 0, space = qfo->spaces; i < qfo->num_spaces; i++, space++) {
|
2012-12-21 12:53:13 +00:00
|
|
|
if ((int) space->type < 0 || space->type > qfos_type) {
|
2011-02-28 23:48:58 +00:00
|
|
|
linker_error ("bad space type");
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
if (funcs[space->type] (qfo, space, pass))
|
|
|
|
return 1;
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
|
|
|
}
|
2011-03-01 06:18:47 +00:00
|
|
|
process_funcs (qfo);
|
|
|
|
process_lines (qfo);
|
|
|
|
process_loose_relocs (qfo);
|
2011-02-28 14:18:07 +00:00
|
|
|
return 0;
|
2002-07-21 07:12:17 +00:00
|
|
|
}
|
|
|
|
|
2002-08-15 18:53:03 +00:00
|
|
|
int
|
2002-07-21 07:12:17 +00:00
|
|
|
linker_add_object_file (const char *filename)
|
|
|
|
{
|
|
|
|
qfo_t *qfo;
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
dsprintf (linker_current_file, "%s", filename);
|
|
|
|
|
2002-07-21 07:12:17 +00:00
|
|
|
qfo = qfo_open (filename);
|
2011-02-28 14:18:07 +00:00
|
|
|
if (!qfo) {
|
|
|
|
linker_error ("error opening");
|
2002-08-15 18:53:03 +00:00
|
|
|
return 1;
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
2011-02-24 03:18:35 +00:00
|
|
|
if (qfo->num_spaces < qfo_num_spaces
|
|
|
|
|| qfo->spaces[qfo_null_space].type != qfos_null
|
|
|
|
|| qfo->spaces[qfo_strings_space].type != qfos_string
|
|
|
|
|| qfo->spaces[qfo_code_space].type != qfos_code
|
|
|
|
|| qfo->spaces[qfo_near_data_space].type != qfos_data
|
|
|
|
|| qfo->spaces[qfo_far_data_space].type != qfos_data
|
|
|
|
|| qfo->spaces[qfo_entity_space].type != qfos_entity
|
|
|
|
|| qfo->spaces[qfo_type_space].type != qfos_type) {
|
2011-02-28 14:18:07 +00:00
|
|
|
linker_error ("missing or mangled standard spaces");
|
2011-02-24 03:18:35 +00:00
|
|
|
return 1;
|
|
|
|
}
|
2002-07-21 07:12:17 +00:00
|
|
|
|
|
|
|
if (options.verbosity >= 2)
|
2011-03-01 01:53:29 +00:00
|
|
|
fprintf (stderr, "%s\n", filename);
|
2002-07-21 07:12:17 +00:00
|
|
|
|
|
|
|
linker_add_qfo (qfo);
|
2012-05-21 23:23:22 +00:00
|
|
|
|
2002-07-11 17:06:15 +00:00
|
|
|
qfo_delete (qfo);
|
2002-08-15 18:53:03 +00:00
|
|
|
return 0;
|
2002-07-03 20:16:32 +00:00
|
|
|
}
|
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
typedef struct path_s {
|
|
|
|
struct path_s *next;
|
|
|
|
const char *path;
|
|
|
|
} path_t;
|
|
|
|
|
|
|
|
static path_t *path_head;
|
|
|
|
static path_t **path_tail = &path_head;
|
|
|
|
|
2002-08-15 18:53:03 +00:00
|
|
|
int
|
2002-07-21 07:12:17 +00:00
|
|
|
linker_add_lib (const char *libname)
|
|
|
|
{
|
2002-11-04 02:24:28 +00:00
|
|
|
pack_t *pack = 0;
|
2002-11-01 18:05:12 +00:00
|
|
|
path_t start = {path_head, "."};
|
|
|
|
path_t *path = &start;
|
2002-11-04 02:24:28 +00:00
|
|
|
const char *path_name = 0;
|
2018-09-08 10:45:19 +00:00
|
|
|
int i;
|
|
|
|
unsigned j;
|
2002-07-21 07:12:17 +00:00
|
|
|
int did_something;
|
|
|
|
|
2002-11-01 18:05:12 +00:00
|
|
|
if (strncmp (libname, "-l", 2) == 0) {
|
|
|
|
while (path) {
|
|
|
|
path_name = va ("%s/lib%s.a", path->path, libname + 2);
|
|
|
|
pack = pack_open (path_name);
|
|
|
|
if (pack)
|
|
|
|
break;
|
|
|
|
if (errno != ENOENT) {
|
|
|
|
if (errno)
|
|
|
|
perror (libname);
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
path = path->next;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
path_name = libname;
|
|
|
|
pack = pack_open (path_name);
|
|
|
|
}
|
|
|
|
|
2002-10-31 22:58:59 +00:00
|
|
|
if (!pack) {
|
|
|
|
if (errno)
|
|
|
|
perror (libname);
|
2002-08-15 18:53:03 +00:00
|
|
|
return 1;
|
2002-10-31 22:58:59 +00:00
|
|
|
}
|
2002-11-01 18:05:12 +00:00
|
|
|
|
|
|
|
if (options.verbosity > 1)
|
|
|
|
puts (path_name);
|
|
|
|
|
2002-07-21 07:12:17 +00:00
|
|
|
do {
|
|
|
|
did_something = 0;
|
|
|
|
for (i = 0; i < pack->numfiles; i++) {
|
2002-08-27 07:16:28 +00:00
|
|
|
QFile *f;
|
2002-07-21 07:12:17 +00:00
|
|
|
qfo_t *qfo;
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
dsprintf (linker_current_file, "%s(%s)", path_name,
|
|
|
|
pack->files[i].name);
|
2002-11-01 18:05:12 +00:00
|
|
|
f = Qsubopen (path_name, pack->files[i].filepos,
|
2002-09-27 04:27:19 +00:00
|
|
|
pack->files[i].filelen, 1);
|
2002-07-21 07:12:17 +00:00
|
|
|
qfo = qfo_read (f);
|
|
|
|
Qclose (f);
|
|
|
|
|
2011-02-28 14:18:07 +00:00
|
|
|
if (!qfo) {
|
|
|
|
linker_error ("error opening");
|
2002-08-15 18:53:03 +00:00
|
|
|
return 1;
|
2011-02-28 14:18:07 +00:00
|
|
|
}
|
2002-08-15 18:53:03 +00:00
|
|
|
|
2002-07-21 07:12:17 +00:00
|
|
|
for (j = 0; j < qfo->num_defs; j++) {
|
2011-02-28 14:18:07 +00:00
|
|
|
qfo_def_t *def = qfo->defs + j;
|
|
|
|
if ((def->flags & QFOD_GLOBAL)
|
|
|
|
&& !(def->flags & QFOD_EXTERNAL)
|
2012-11-14 04:14:54 +00:00
|
|
|
&& Hash_Find (extern_data_defs, QFOSTR (qfo, def->name))) {
|
2011-02-28 14:18:07 +00:00
|
|
|
if (options.verbosity >= 2)
|
2011-03-01 01:53:29 +00:00
|
|
|
fprintf (stderr, "adding %s because of %s\n",
|
|
|
|
pack->files[i].name,
|
|
|
|
QFOSTR (qfo, def->name));
|
2011-02-28 14:18:07 +00:00
|
|
|
linker_add_qfo (qfo);
|
|
|
|
did_something = 1;
|
|
|
|
break;
|
|
|
|
}
|
2002-07-21 07:12:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
qfo_delete (qfo);
|
|
|
|
}
|
|
|
|
} while (did_something);
|
|
|
|
pack_del (pack);
|
2002-08-15 18:53:03 +00:00
|
|
|
return 0;
|
2002-07-21 07:12:17 +00:00
|
|
|
}
|
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
static __attribute__ ((used)) void
|
2003-08-06 21:36:07 +00:00
|
|
|
undefined_def (qfo_def_t *def)
|
|
|
|
{
|
|
|
|
qfo_def_t line_def;
|
2018-09-08 10:45:19 +00:00
|
|
|
pr_uint_t i;
|
2011-03-01 06:18:47 +00:00
|
|
|
qfo_reloc_t *reloc = work->relocs + def->relocs;
|
2003-08-06 21:36:07 +00:00
|
|
|
|
|
|
|
for (i = 0; i < def->num_relocs; i++, reloc++) {
|
2003-08-21 02:21:30 +00:00
|
|
|
if ((reloc->type == rel_op_a_def
|
|
|
|
|| reloc->type == rel_op_b_def
|
|
|
|
|| reloc->type == rel_op_c_def
|
|
|
|
|| reloc->type == rel_op_a_def_ofs
|
|
|
|
|| reloc->type == rel_op_b_def_ofs
|
|
|
|
|| reloc->type == rel_op_c_def_ofs)
|
2011-03-01 06:18:47 +00:00
|
|
|
&& work->lines) {
|
|
|
|
qfo_func_t *func = work->funcs;
|
2018-09-08 10:45:19 +00:00
|
|
|
qfo_func_t *best = 0;
|
|
|
|
pr_uint_t best_dist;
|
2003-08-06 21:36:07 +00:00
|
|
|
pr_lineno_t *line;
|
|
|
|
|
2018-09-08 10:45:19 +00:00
|
|
|
while (func - work->funcs < work->num_funcs) {
|
2020-03-03 04:39:24 +00:00
|
|
|
if (func->code >= 0
|
|
|
|
&& (pr_uint_t) func->code <= reloc->offset) {
|
2020-02-29 11:13:25 +00:00
|
|
|
if (!best || reloc->offset - func->code < best_dist) {
|
|
|
|
best = func;
|
|
|
|
best_dist = reloc->offset - func->code;
|
|
|
|
}
|
2003-08-06 21:36:07 +00:00
|
|
|
}
|
|
|
|
func++;
|
|
|
|
}
|
2011-03-01 06:18:47 +00:00
|
|
|
line = work->lines + best->line_info;
|
2003-08-06 21:36:07 +00:00
|
|
|
line_def.file = best->file;
|
|
|
|
line_def.line = best->line;
|
2004-07-13 19:14:01 +00:00
|
|
|
if (!line->line
|
2011-03-01 06:18:47 +00:00
|
|
|
&& line->fa.func == (pr_uint_t) (best - work->funcs)) {
|
|
|
|
while (line - work->lines < work->num_lines - 1
|
|
|
|
&& line[1].line
|
2011-02-17 06:02:09 +00:00
|
|
|
&& line[1].fa.addr <= (pr_uint_t) reloc->offset)
|
2003-08-06 21:36:07 +00:00
|
|
|
line++;
|
|
|
|
line_def.line = line->line + best->line;
|
|
|
|
}
|
2011-03-01 06:18:47 +00:00
|
|
|
def_error (&line_def, "undefined symbol %s", WORKSTR (def->name));
|
2003-08-06 21:36:07 +00:00
|
|
|
} else {
|
2011-03-01 06:18:47 +00:00
|
|
|
def_error (def, "undefined symbol %s", WORKSTR (def->name));
|
2003-08-06 21:36:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-03-02 05:03:41 +00:00
|
|
|
static void
|
|
|
|
check_defs (void)
|
2002-07-03 20:16:32 +00:00
|
|
|
{
|
2003-02-21 22:31:40 +00:00
|
|
|
defref_t **undef_defs, **defref;
|
2011-03-02 05:03:41 +00:00
|
|
|
int did_self = 0, did_this = 0;
|
|
|
|
|
2012-11-14 04:14:54 +00:00
|
|
|
undef_defs = (defref_t **) Hash_GetList (extern_data_defs);
|
2011-03-02 05:03:41 +00:00
|
|
|
for (defref = undef_defs; *defref; defref++) {
|
|
|
|
qfo_def_t *def = REF (*defref);
|
|
|
|
const char *name = WORKSTR (def->name);
|
|
|
|
|
|
|
|
if (strcmp (name, ".self") == 0 && !did_self) {
|
2012-11-14 04:14:54 +00:00
|
|
|
defref_t *_d = Hash_Find (defined_data_defs, "self");
|
2011-03-02 05:03:41 +00:00
|
|
|
if (_d) {
|
|
|
|
qfo_def_t *d = REF (_d);
|
2020-02-21 08:47:16 +00:00
|
|
|
if (QFO_TYPEMETA (work, d->type) == ty_basic
|
2011-03-02 05:03:41 +00:00
|
|
|
&& QFO_TYPETYPE (work, d->type) == ev_entity)
|
|
|
|
def_warning (d, "@self and self used together");
|
2002-07-14 05:40:38 +00:00
|
|
|
}
|
2011-03-02 11:48:55 +00:00
|
|
|
linker_add_def (".self", &type_entity, QFOD_GLOBAL, 0);
|
2011-03-02 05:03:41 +00:00
|
|
|
did_self = 1;
|
|
|
|
} else if (strcmp (name, ".this") == 0 && !did_this) {
|
|
|
|
type_t *type;
|
|
|
|
int flags;
|
2011-04-03 04:03:48 +00:00
|
|
|
defref_t *this_ref;
|
2011-03-02 05:03:41 +00:00
|
|
|
|
2012-11-08 07:46:48 +00:00
|
|
|
if (!obj_initialized)
|
2011-03-02 05:03:41 +00:00
|
|
|
class_init ();
|
2011-04-03 04:03:48 +00:00
|
|
|
flags = QFOD_GLOBAL | QFOD_NOSAVE;
|
|
|
|
this_ref = make_def (qfo_entity_space, name, &type_id, flags, 0);
|
|
|
|
flags |= QFOD_CONSTANT | QFOD_INITIALIZED;
|
|
|
|
type = field_type (&type_id);
|
2012-11-14 04:14:54 +00:00
|
|
|
linker_add_def (".this", type, flags, &REF (this_ref)->offset);
|
2011-03-02 05:03:41 +00:00
|
|
|
did_this = 1;
|
2002-07-14 05:40:38 +00:00
|
|
|
}
|
2011-03-02 05:03:41 +00:00
|
|
|
}
|
|
|
|
free (undef_defs);
|
2012-11-14 04:14:54 +00:00
|
|
|
undef_defs = (defref_t **) Hash_GetList (extern_data_defs);
|
2011-03-02 05:03:41 +00:00
|
|
|
for (defref = undef_defs; *defref; defref++) {
|
|
|
|
qfo_def_t *def = REF (*defref);
|
|
|
|
undefined_def (def);
|
|
|
|
}
|
|
|
|
free (undef_defs);
|
|
|
|
}
|
|
|
|
|
|
|
|
static qfo_t *
|
|
|
|
build_qfo (void)
|
|
|
|
{
|
|
|
|
qfo_t *qfo;
|
|
|
|
int size;
|
2018-09-08 10:45:19 +00:00
|
|
|
unsigned i, j;
|
2011-03-02 05:03:41 +00:00
|
|
|
qfo_reloc_t *reloc;
|
|
|
|
qfo_def_t **defs;
|
|
|
|
|
|
|
|
qfo = qfo_new ();
|
|
|
|
qfo->spaces = calloc (work->num_spaces, sizeof (qfo_mspace_t));
|
|
|
|
qfo->num_spaces = work->num_spaces;
|
|
|
|
for (i = 0; i < work->num_spaces; i++) {
|
|
|
|
qfo->spaces[i].type = work->spaces[i].type;
|
|
|
|
qfo->spaces[i].id = work->spaces[i].id;
|
|
|
|
qfo->spaces[i].d = work->spaces[i].d;
|
|
|
|
qfo->spaces[i].data_size = work->spaces[i].data_size;
|
|
|
|
}
|
|
|
|
// allocate space for all relocs and copy in the loose relocs. bound
|
|
|
|
// relocs will be handled with defs and funcs.
|
|
|
|
size = work->num_relocs + work_num_loose_relocs;
|
|
|
|
qfo->relocs = malloc (size * sizeof (qfo_reloc_t));
|
|
|
|
reloc = qfo->relocs;
|
|
|
|
memcpy (qfo->relocs + work->num_relocs, work_loose_relocs,
|
|
|
|
work_num_loose_relocs * sizeof (qfo_reloc_t));
|
|
|
|
qfo->num_relocs = size;
|
|
|
|
qfo->num_loose_relocs = work_num_loose_relocs;
|
|
|
|
qfo->funcs = work->funcs;
|
|
|
|
qfo->num_funcs = work->num_funcs;
|
|
|
|
qfo->lines = work->lines;
|
|
|
|
qfo->num_lines = work->num_lines;
|
|
|
|
// count final defs
|
|
|
|
for (i = 0; i < num_work_defrefs; i++) {
|
|
|
|
if (work_defrefs[i]->merge)
|
|
|
|
continue;
|
|
|
|
qfo->num_defs++;
|
|
|
|
qfo->spaces[work_defrefs[i]->space].num_defs++;
|
|
|
|
}
|
|
|
|
qfo->defs = malloc (qfo->num_defs * sizeof (qfo_def_t));
|
|
|
|
defs = alloca (qfo->num_spaces * sizeof (qfo_def_t *));
|
|
|
|
defs[0] = qfo->defs;
|
|
|
|
for (i = 1; i < qfo->num_spaces; i++) {
|
|
|
|
defs[i] = defs[i - 1] + qfo->spaces[i - 1].num_defs;
|
|
|
|
if (qfo->spaces[i].num_defs)
|
|
|
|
qfo->spaces[i].defs = defs[i];
|
|
|
|
}
|
|
|
|
for (i = 0; i < num_work_defrefs; i++) {
|
|
|
|
defref_t *r = work_defrefs[i];
|
2011-03-04 12:29:47 +00:00
|
|
|
qfo_def_t *def;
|
2011-03-02 05:03:41 +00:00
|
|
|
qfo_def_t d;
|
|
|
|
int space;
|
|
|
|
if (r->merge)
|
|
|
|
continue;
|
|
|
|
space = r->space;
|
2011-03-04 12:29:47 +00:00
|
|
|
def = REF (r);
|
|
|
|
d = *def;
|
2011-03-02 05:03:41 +00:00
|
|
|
d.relocs = reloc - qfo->relocs;
|
2011-03-04 12:29:47 +00:00
|
|
|
memcpy (reloc, work->relocs + def->relocs,
|
|
|
|
def->num_relocs * sizeof (qfo_reloc_t));
|
2011-03-02 05:03:41 +00:00
|
|
|
r->def = defs[space] - qfo->defs;
|
2011-03-04 12:29:47 +00:00
|
|
|
for (j = 0; j < def->num_relocs; j++) {
|
|
|
|
reloc->target = r->def;
|
|
|
|
reloc++;
|
|
|
|
}
|
2011-03-02 05:03:41 +00:00
|
|
|
// copy relocs from merged defs
|
|
|
|
for (r = r->merge_list; r; r = r->next) {
|
2011-03-04 12:29:47 +00:00
|
|
|
def = REF (r);
|
|
|
|
memcpy (reloc, work->relocs + def->relocs,
|
|
|
|
def->num_relocs * sizeof (qfo_reloc_t));
|
|
|
|
d.num_relocs += def->num_relocs;
|
2011-03-02 05:03:41 +00:00
|
|
|
r->space = space;
|
|
|
|
r->def = defs[space] - qfo->defs;
|
2011-03-04 12:29:47 +00:00
|
|
|
for (j = 0; j < def->num_relocs; j++) {
|
|
|
|
reloc->target = r->def;
|
|
|
|
reloc++;
|
|
|
|
}
|
2002-07-12 04:50:31 +00:00
|
|
|
}
|
2011-03-02 05:03:41 +00:00
|
|
|
*defs[space]++ = d;
|
|
|
|
}
|
|
|
|
for (i = 0; i < qfo->num_funcs; i++) {
|
|
|
|
qfo_func_t *f = &qfo->funcs[i];
|
|
|
|
f->def = work_defrefs[f->def]->def;
|
|
|
|
memcpy (reloc, work->relocs + f->relocs,
|
|
|
|
f->num_relocs * sizeof (qfo_reloc_t));
|
2011-03-04 12:29:47 +00:00
|
|
|
f->relocs = reloc - qfo->relocs;
|
|
|
|
for (j = 0; j < f->num_relocs; j++) {
|
|
|
|
reloc->target = i;
|
|
|
|
reloc++;
|
|
|
|
}
|
2011-03-02 05:03:41 +00:00
|
|
|
}
|
2012-11-14 11:37:19 +00:00
|
|
|
for (i = 0; i < qfo->num_relocs; i++) {
|
|
|
|
qfo_def_t *def;
|
|
|
|
|
|
|
|
reloc = qfo->relocs + i;
|
|
|
|
if (reloc->space != qfo_type_space)
|
|
|
|
continue;
|
|
|
|
if (reloc->type != rel_def_def)
|
|
|
|
continue;
|
2018-09-08 10:45:19 +00:00
|
|
|
if (reloc->target >= qfo->num_defs) {
|
|
|
|
linker_error ("Invalid reloc target def %d / %d.\n",
|
|
|
|
reloc->target, qfo->num_defs);
|
|
|
|
continue;
|
|
|
|
}
|
2012-11-14 11:37:19 +00:00
|
|
|
def = qfo->defs + reloc->target;
|
|
|
|
QFO_INT (qfo, reloc->space, reloc->offset) = def->offset;
|
|
|
|
}
|
2011-03-02 05:03:41 +00:00
|
|
|
return qfo;
|
|
|
|
}
|
|
|
|
|
|
|
|
qfo_t *
|
|
|
|
linker_finish (void)
|
|
|
|
{
|
2011-03-04 12:46:19 +00:00
|
|
|
int i;
|
2011-03-02 05:03:41 +00:00
|
|
|
|
|
|
|
if (!options.partial_link) {
|
|
|
|
check_defs ();
|
2002-07-12 04:50:31 +00:00
|
|
|
if (pr.error_count)
|
|
|
|
return 0;
|
2002-07-03 21:32:03 +00:00
|
|
|
}
|
2002-07-11 21:04:09 +00:00
|
|
|
|
2011-03-04 12:46:19 +00:00
|
|
|
for (i = 0; i < work_num_loose_relocs; /**/) {
|
|
|
|
if (work_loose_relocs[i].type != rel_none) {
|
|
|
|
i++;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
memmove (work_loose_relocs + i, work_loose_relocs + i + 1,
|
|
|
|
(--work_num_loose_relocs - i) * sizeof (qfo_reloc_t));
|
|
|
|
}
|
2011-03-02 05:03:41 +00:00
|
|
|
return build_qfo ();
|
2002-07-03 20:16:32 +00:00
|
|
|
}
|
2002-11-01 18:05:12 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
linker_add_path (const char *path)
|
|
|
|
{
|
|
|
|
path_t *p = malloc (sizeof (path_t));
|
|
|
|
p->next = 0;
|
|
|
|
p->path = path;
|
|
|
|
*path_tail = p;
|
|
|
|
path_tail = &p->next;
|
|
|
|
}
|
2003-05-07 15:00:17 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
def_error (qfo_def_t *def, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
static dstring_t *string;
|
|
|
|
|
|
|
|
if (!string)
|
|
|
|
string = dstring_new ();
|
|
|
|
|
|
|
|
va_start (args, fmt);
|
|
|
|
dvsprintf (string, fmt, args);
|
|
|
|
va_end (args);
|
|
|
|
|
|
|
|
pr.source_file = def->file;
|
|
|
|
pr.source_line = def->line;
|
|
|
|
error (0, "%s", string->str);
|
|
|
|
}
|
|
|
|
|
2011-02-24 03:18:35 +00:00
|
|
|
static void
|
|
|
|
def_warning (qfo_def_t *def, const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
static dstring_t *string;
|
|
|
|
|
|
|
|
if (!string)
|
|
|
|
string = dstring_new ();
|
|
|
|
|
|
|
|
va_start (args, fmt);
|
|
|
|
dvsprintf (string, fmt, args);
|
|
|
|
va_end (args);
|
|
|
|
|
|
|
|
pr.source_file = def->file;
|
|
|
|
pr.source_line = def->line;
|
|
|
|
warning (0, "%s", string->str);
|
|
|
|
}
|
2011-02-28 14:18:07 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
linker_warning (const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
fprintf (stderr, "%s: warning: ", linker_current_file->str);
|
|
|
|
|
|
|
|
va_start (args, fmt);
|
|
|
|
vfprintf (stderr, fmt, args);
|
|
|
|
va_end (args);
|
|
|
|
|
|
|
|
fputs ("\n", stderr);
|
|
|
|
|
|
|
|
if (options.warnings.promote)
|
|
|
|
pr.error_count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
linker_error (const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
fprintf (stderr, "%s: ", linker_current_file->str);
|
|
|
|
|
|
|
|
va_start (args, fmt);
|
|
|
|
vfprintf (stderr, fmt, args);
|
|
|
|
va_end (args);
|
|
|
|
|
|
|
|
fputs ("\n", stderr);
|
|
|
|
|
|
|
|
pr.error_count++;
|
|
|
|
}
|
2012-10-26 10:02:02 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
linker_internal_error (const char *fmt, ...)
|
|
|
|
{
|
|
|
|
va_list args;
|
|
|
|
|
|
|
|
fprintf (stderr, "%s: ", linker_current_file->str);
|
|
|
|
|
|
|
|
va_start (args, fmt);
|
|
|
|
vfprintf (stderr, fmt, args);
|
|
|
|
va_end (args);
|
|
|
|
|
|
|
|
fputs ("\n", stderr);
|
|
|
|
|
|
|
|
abort ();
|
|
|
|
}
|