2000-05-28 13:40:48 +00:00
|
|
|
/*****************************************************************************/
|
|
|
|
/* */
|
|
|
|
/* exports.c */
|
|
|
|
/* */
|
2000-11-02 22:11:25 +00:00
|
|
|
/* Exports handling for the ld65 linker */
|
2000-05-28 13:40:48 +00:00
|
|
|
/* */
|
|
|
|
/* */
|
|
|
|
/* */
|
|
|
|
/* (C) 1998 Ullrich von Bassewitz */
|
|
|
|
/* Wacholderweg 14 */
|
|
|
|
/* D-70597 Stuttgart */
|
|
|
|
/* EMail: uz@musoftware.de */
|
|
|
|
/* */
|
|
|
|
/* */
|
|
|
|
/* This software is provided 'as-is', without any expressed or implied */
|
|
|
|
/* warranty. In no event will the authors be held liable for any damages */
|
|
|
|
/* arising from the use of this software. */
|
|
|
|
/* */
|
|
|
|
/* Permission is granted to anyone to use this software for any purpose, */
|
|
|
|
/* including commercial applications, and to alter it and redistribute it */
|
|
|
|
/* freely, subject to the following restrictions: */
|
|
|
|
/* */
|
|
|
|
/* 1. The origin of this software must not be misrepresented; you must not */
|
|
|
|
/* claim that you wrote the original software. If you use this software */
|
|
|
|
/* in a product, an acknowledgment in the product documentation would be */
|
|
|
|
/* appreciated but is not required. */
|
|
|
|
/* 2. Altered source versions must be plainly marked as such, and must not */
|
|
|
|
/* be misrepresented as being the original software. */
|
|
|
|
/* 3. This notice may not be removed or altered from any source */
|
|
|
|
/* distribution. */
|
|
|
|
/* */
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
2000-08-01 15:17:43 +00:00
|
|
|
/* common */
|
|
|
|
#include "check.h"
|
2000-10-30 20:48:11 +00:00
|
|
|
#include "coll.h"
|
2000-08-01 15:17:43 +00:00
|
|
|
#include "hashstr.h"
|
|
|
|
#include "symdefs.h"
|
|
|
|
#include "xmalloc.h"
|
2000-08-02 13:23:06 +00:00
|
|
|
|
2000-08-01 15:17:43 +00:00
|
|
|
/* ld65 */
|
2000-11-20 15:22:57 +00:00
|
|
|
#include "condes.h"
|
2000-05-28 13:40:48 +00:00
|
|
|
#include "error.h"
|
|
|
|
#include "fileio.h"
|
2000-11-20 15:22:57 +00:00
|
|
|
#include "global.h"
|
2000-05-28 13:40:48 +00:00
|
|
|
#include "objdata.h"
|
|
|
|
#include "expr.h"
|
|
|
|
#include "exports.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
2000-10-30 20:48:11 +00:00
|
|
|
/* Data */
|
2000-05-28 13:40:48 +00:00
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Hash table */
|
2000-10-30 20:48:11 +00:00
|
|
|
#define HASHTAB_SIZE 4081
|
|
|
|
static Export* HashTab [HASHTAB_SIZE];
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Import management variables */
|
2000-10-30 20:48:11 +00:00
|
|
|
static unsigned ImpCount = 0; /* Import count */
|
|
|
|
static unsigned ImpOpen = 0; /* Count of open imports */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Export management variables */
|
2000-10-30 20:48:11 +00:00
|
|
|
static unsigned ExpCount = 0; /* Export count */
|
|
|
|
static Export** ExpPool = 0; /* Exports array */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Defines for the flags in Export */
|
2000-10-30 20:48:11 +00:00
|
|
|
#define EXP_USERMARK 0x0001
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
2000-11-03 09:31:18 +00:00
|
|
|
/* Import handling */
|
2000-05-28 13:40:48 +00:00
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static Export* NewExport (unsigned char Type, const char* Name, ObjData* Obj);
|
|
|
|
/* Create a new export and initialize it */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static Import* NewImport (unsigned char Type, ObjData* Obj)
|
|
|
|
/* Create a new import and initialize it */
|
|
|
|
{
|
|
|
|
/* Allocate memory */
|
2000-06-14 09:57:42 +00:00
|
|
|
Import* I = xmalloc (sizeof (Import));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Initialize the fields */
|
|
|
|
I->Next = 0;
|
|
|
|
I->Obj = Obj;
|
|
|
|
I->V.Name = 0;
|
|
|
|
I->Type = Type;
|
|
|
|
|
|
|
|
/* Return the new structure */
|
|
|
|
return I;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void InsertImport (Import* I)
|
|
|
|
/* Insert an import into the table */
|
|
|
|
{
|
|
|
|
Export* E;
|
|
|
|
unsigned HashVal;
|
|
|
|
|
|
|
|
/* As long as the import is not inserted, V.Name is valid */
|
2003-01-04 16:59:51 +00:00
|
|
|
char* Name = I->V.Name;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Create a hash value for the given name */
|
|
|
|
HashVal = HashStr (Name) % HASHTAB_SIZE;
|
|
|
|
|
|
|
|
/* Search through the list in that slot and print matching duplicates */
|
|
|
|
if (HashTab [HashVal] == 0) {
|
|
|
|
/* The slot is empty, we need to insert a dummy export */
|
|
|
|
E = HashTab [HashVal] = NewExport (0, Name, 0);
|
|
|
|
++ExpCount;
|
|
|
|
} else {
|
|
|
|
E = HashTab [HashVal];
|
|
|
|
while (1) {
|
|
|
|
if (strcmp (E->Name, Name) == 0) {
|
|
|
|
/* We have an entry, L points to it */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (E->Next == 0) {
|
|
|
|
/* End of list an entry not found, insert a dummy */
|
|
|
|
E->Next = NewExport (0, Name, 0);
|
|
|
|
E = E->Next; /* Point to dummy */
|
|
|
|
++ExpCount; /* One export more */
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
E = E->Next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Ok, E now points to a valid exports entry for the given import. Insert
|
|
|
|
* the import into the imports list and update the counters.
|
|
|
|
*/
|
|
|
|
I->V.Exp = E;
|
|
|
|
I->Next = E->ImpList;
|
|
|
|
E->ImpList = I;
|
|
|
|
E->ImpCount++;
|
|
|
|
++ImpCount; /* Total import count */
|
|
|
|
if (E->Expr == 0) {
|
|
|
|
/* This is a dummy export */
|
|
|
|
++ImpOpen;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Now free the name since it's no longer needed */
|
2000-06-14 09:57:42 +00:00
|
|
|
xfree (Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Import* ReadImport (FILE* F, ObjData* Obj)
|
|
|
|
/* Read an import from a file and return it */
|
|
|
|
{
|
|
|
|
Import* I;
|
|
|
|
|
|
|
|
/* Read the import type and check it */
|
|
|
|
unsigned char Type = Read8 (F);
|
|
|
|
if (Type != IMP_ZP && Type != IMP_ABS) {
|
2000-11-20 21:56:48 +00:00
|
|
|
Error ("Unknown import type in module `%s': %02X",
|
|
|
|
GetObjFileName (Obj), Type);
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Create a new import */
|
|
|
|
I = NewImport (Type, Obj);
|
|
|
|
|
|
|
|
/* Read the name */
|
2000-08-02 13:23:06 +00:00
|
|
|
I->V.Name = ReadStr (F);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Read the file position */
|
|
|
|
ReadFilePos (F, &I->Pos);
|
|
|
|
|
|
|
|
/* Return the new import */
|
|
|
|
return I;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
/* Code */
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static Export* NewExport (unsigned char Type, const char* Name, ObjData* Obj)
|
|
|
|
/* Create a new export and initialize it */
|
|
|
|
{
|
|
|
|
/* Allocate memory */
|
2000-08-02 13:23:06 +00:00
|
|
|
Export* E = xmalloc (sizeof (Export));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Initialize the fields */
|
|
|
|
E->Next = 0;
|
2000-11-20 15:22:57 +00:00
|
|
|
E->Flags = 0;
|
2000-05-28 13:40:48 +00:00
|
|
|
E->Obj = Obj;
|
|
|
|
E->ImpCount = 0;
|
|
|
|
E->ImpList = 0;
|
|
|
|
E->Expr = 0;
|
|
|
|
E->Type = Type;
|
2000-11-20 15:22:57 +00:00
|
|
|
memset (E->ConDes, 0, sizeof (E->ConDes));
|
2000-08-02 13:23:06 +00:00
|
|
|
if (Name) {
|
|
|
|
E->Name = xstrdup (Name);
|
|
|
|
} else {
|
2000-11-20 15:22:57 +00:00
|
|
|
/* Name will get added later */
|
|
|
|
E->Name = 0;
|
2000-08-02 13:23:06 +00:00
|
|
|
}
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Return the new entry */
|
|
|
|
return E;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void InsertExport (Export* E)
|
|
|
|
/* Insert an exported identifier and check if it's already in the list */
|
|
|
|
{
|
|
|
|
Export* L;
|
|
|
|
Export* Last;
|
|
|
|
Import* Imp;
|
|
|
|
unsigned HashVal;
|
|
|
|
|
2000-11-20 15:22:57 +00:00
|
|
|
/* Insert the export into any condes tables if needed */
|
|
|
|
if (IS_EXP_CONDES (E->Type)) {
|
|
|
|
ConDesAddExport (E);
|
2000-10-30 20:48:11 +00:00
|
|
|
}
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Create a hash value for the given name */
|
|
|
|
HashVal = HashStr (E->Name) % HASHTAB_SIZE;
|
|
|
|
|
|
|
|
/* Search through the list in that slot */
|
|
|
|
if (HashTab [HashVal] == 0) {
|
|
|
|
/* The slot is empty */
|
|
|
|
HashTab [HashVal] = E;
|
|
|
|
++ExpCount;
|
|
|
|
} else {
|
|
|
|
|
|
|
|
Last = 0;
|
|
|
|
L = HashTab [HashVal];
|
|
|
|
do {
|
|
|
|
if (strcmp (L->Name, E->Name) == 0) {
|
|
|
|
/* This may be an unresolved external */
|
2000-10-30 20:48:11 +00:00
|
|
|
if (L->Expr == 0) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* This *is* an unresolved external */
|
|
|
|
E->Next = L->Next;
|
|
|
|
E->ImpCount = L->ImpCount;
|
|
|
|
E->ImpList = L->ImpList;
|
|
|
|
if (Last) {
|
|
|
|
Last->Next = E;
|
|
|
|
} else {
|
2000-08-02 13:23:06 +00:00
|
|
|
HashTab [HashVal] = E;
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
ImpOpen -= E->ImpCount; /* Decrease open imports now */
|
2000-06-14 09:57:42 +00:00
|
|
|
xfree (L);
|
2000-05-28 13:40:48 +00:00
|
|
|
/* We must run through the import list and change the
|
2000-11-03 09:31:18 +00:00
|
|
|
* export pointer now.
|
2000-05-28 13:40:48 +00:00
|
|
|
*/
|
|
|
|
Imp = E->ImpList;
|
|
|
|
while (Imp) {
|
|
|
|
Imp->V.Exp = E;
|
|
|
|
Imp = Imp->Next;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* Duplicate entry, ignore it */
|
2000-11-20 15:22:57 +00:00
|
|
|
Warning ("Duplicate external identifier: `%s'", L->Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
Last = L;
|
|
|
|
L = L->Next;
|
|
|
|
|
|
|
|
} while (L);
|
|
|
|
|
|
|
|
/* Insert export at end of queue */
|
|
|
|
Last->Next = E;
|
|
|
|
++ExpCount;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Export* ReadExport (FILE* F, ObjData* O)
|
|
|
|
/* Read an export from a file */
|
|
|
|
{
|
|
|
|
unsigned char Type;
|
2000-11-20 15:22:57 +00:00
|
|
|
unsigned ConDesCount;
|
2000-05-28 13:40:48 +00:00
|
|
|
Export* E;
|
|
|
|
|
|
|
|
/* Read the type */
|
|
|
|
Type = Read8 (F);
|
|
|
|
|
2000-08-02 13:23:06 +00:00
|
|
|
/* Create a new export without a name */
|
|
|
|
E = NewExport (Type, 0, O);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
2000-11-20 15:22:57 +00:00
|
|
|
/* Read the constructor/destructor decls if we have any */
|
|
|
|
ConDesCount = GET_EXP_CONDES_COUNT (Type);
|
|
|
|
if (ConDesCount > 0) {
|
|
|
|
|
|
|
|
unsigned char ConDes[CD_TYPE_COUNT];
|
|
|
|
unsigned I;
|
|
|
|
|
|
|
|
/* Read the data into temp storage */
|
|
|
|
ReadData (F, ConDes, ConDesCount);
|
|
|
|
|
|
|
|
/* Re-order the data. In the file, each decl is encoded into a byte
|
|
|
|
* which contains the type and the priority. In memory, we will use
|
|
|
|
* an array of types which contain the priority. This array was
|
|
|
|
* cleared by the constructor (NewExport), so we must only set the
|
|
|
|
* fields that contain values.
|
|
|
|
*/
|
|
|
|
for (I = 0; I < ConDesCount; ++I) {
|
|
|
|
unsigned ConDesType = CD_GET_TYPE (ConDes[I]);
|
|
|
|
unsigned ConDesPrio = CD_GET_PRIO (ConDes[I]);
|
|
|
|
E->ConDes[ConDesType] = ConDesPrio;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-08-02 13:23:06 +00:00
|
|
|
/* Read the name */
|
|
|
|
E->Name = ReadStr (F);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Read the value */
|
2000-10-30 20:48:11 +00:00
|
|
|
if (IS_EXP_EXPR (Type)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
E->Expr = ReadExpr (F, O);
|
|
|
|
} else {
|
|
|
|
E->Expr = LiteralExpr (Read32 (F), O);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Last is the file position where the definition was done */
|
|
|
|
ReadFilePos (F, &E->Pos);
|
|
|
|
|
|
|
|
/* Return the new export */
|
|
|
|
return E;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Export* CreateConstExport (const char* Name, long Value)
|
|
|
|
/* Create an export for a literal date */
|
|
|
|
{
|
|
|
|
/* Create a new export */
|
2001-09-08 22:09:30 +00:00
|
|
|
Export* E = NewExport (EXP_ABS | EXP_CONST | EXP_EQUATE, Name, 0);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Assign the value */
|
|
|
|
E->Expr = LiteralExpr (Value, 0);
|
|
|
|
|
|
|
|
/* Insert the export */
|
|
|
|
InsertExport (E);
|
|
|
|
|
|
|
|
/* Return the new export */
|
|
|
|
return E;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2002-12-14 22:57:00 +00:00
|
|
|
Export* CreateMemoryExport (const char* Name, Memory* Mem, unsigned long Offs)
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Create an relative export for a memory area offset */
|
|
|
|
{
|
|
|
|
/* Create a new export */
|
2001-09-08 22:09:30 +00:00
|
|
|
Export* E = NewExport (EXP_ABS | EXP_EXPR | EXP_LABEL, Name, 0);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Assign the value */
|
2002-12-14 22:57:00 +00:00
|
|
|
E->Expr = MemoryExpr (Mem, Offs, 0);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Insert the export */
|
|
|
|
InsertExport (E);
|
|
|
|
|
|
|
|
/* Return the new export */
|
|
|
|
return E;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2002-12-14 22:57:00 +00:00
|
|
|
Export* CreateSegmentExport (const char* Name, Segment* Seg, unsigned long Offs)
|
|
|
|
/* Create a relative export to a segment */
|
2000-11-20 21:56:48 +00:00
|
|
|
{
|
|
|
|
/* Create a new export */
|
2001-09-08 22:09:30 +00:00
|
|
|
Export* E = NewExport (EXP_ABS | EXP_EXPR | EXP_LABEL, Name, 0);
|
2000-11-20 21:56:48 +00:00
|
|
|
|
|
|
|
/* Assign the value */
|
2002-12-14 22:57:00 +00:00
|
|
|
E->Expr = SegmentExpr (Seg, Offs, 0);
|
|
|
|
|
|
|
|
/* Insert the export */
|
|
|
|
InsertExport (E);
|
|
|
|
|
|
|
|
/* Return the new export */
|
|
|
|
return E;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Export* CreateSectionExport (const char* Name, Section* Sec, unsigned long Offs)
|
|
|
|
/* Create a relative export to a section */
|
|
|
|
{
|
|
|
|
/* Create a new export */
|
|
|
|
Export* E = NewExport (EXP_ABS | EXP_EXPR | EXP_LABEL, Name, 0);
|
|
|
|
|
|
|
|
/* Assign the value */
|
|
|
|
E->Expr = SectionExpr (Sec, Offs, 0);
|
2000-11-20 21:56:48 +00:00
|
|
|
|
|
|
|
/* Insert the export */
|
|
|
|
InsertExport (E);
|
|
|
|
|
|
|
|
/* Return the new export */
|
|
|
|
return E;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-12-01 17:14:12 +00:00
|
|
|
Export* FindExport (const char* Name)
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Check for an identifier in the list. Return 0 if not found, otherwise
|
2001-12-01 17:14:12 +00:00
|
|
|
* return a pointer to the export.
|
2000-05-28 13:40:48 +00:00
|
|
|
*/
|
|
|
|
{
|
|
|
|
/* Get a pointer to the list with the symbols hash value */
|
|
|
|
Export* L = HashTab [HashStr (Name) % HASHTAB_SIZE];
|
|
|
|
while (L) {
|
|
|
|
/* Search through the list in that slot */
|
|
|
|
if (strcmp (L->Name, Name) == 0) {
|
|
|
|
/* Entry found */
|
|
|
|
return L;
|
|
|
|
}
|
|
|
|
L = L->Next;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Not found */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int IsUnresolved (const char* Name)
|
|
|
|
/* Check if this symbol is an unresolved export */
|
|
|
|
{
|
|
|
|
/* Find the export */
|
2001-12-01 17:14:12 +00:00
|
|
|
return IsUnresolvedExport (FindExport (Name));
|
|
|
|
}
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
2001-12-01 17:14:12 +00:00
|
|
|
|
|
|
|
int IsUnresolvedExport (const Export* E)
|
|
|
|
/* Return true if the given export is unresolved */
|
|
|
|
{
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Check if it's unresolved */
|
|
|
|
return E != 0 && E->Expr == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int IsConstExport (const Export* E)
|
|
|
|
/* Return true if the expression associated with this export is const */
|
|
|
|
{
|
|
|
|
if (E->Expr == 0) {
|
|
|
|
/* External symbols cannot be const */
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
return IsConstExpr (E->Expr);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
long GetExportVal (const Export* E)
|
|
|
|
/* Get the value of this export */
|
|
|
|
{
|
|
|
|
if (E->Expr == 0) {
|
|
|
|
/* OOPS */
|
|
|
|
Internal ("`%s' is an undefined external", E->Name);
|
|
|
|
}
|
|
|
|
return GetExprVal (E->Expr);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-10-30 20:48:11 +00:00
|
|
|
static void CheckSymType (const Export* E)
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Check the types for one export */
|
|
|
|
{
|
|
|
|
/* External with matching imports */
|
|
|
|
Import* Imp = E->ImpList;
|
2000-10-30 20:48:11 +00:00
|
|
|
int ZP = IS_EXP_ZP (E->Type);
|
2000-05-28 13:40:48 +00:00
|
|
|
while (Imp) {
|
2000-10-30 20:48:11 +00:00
|
|
|
if (ZP != IS_IMP_ZP (Imp->Type)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Export is ZP, import is abs or the other way round */
|
|
|
|
if (E->Obj) {
|
2000-10-30 20:48:11 +00:00
|
|
|
/* User defined export */
|
|
|
|
Warning ("Type mismatch for `%s', export in "
|
2000-05-28 13:40:48 +00:00
|
|
|
"%s(%lu), import in %s(%lu)",
|
2000-11-20 21:56:48 +00:00
|
|
|
E->Name, GetSourceFileName (E->Obj, Imp->Pos.Name),
|
|
|
|
E->Pos.Line, GetSourceFileName (Imp->Obj, Imp->Pos.Name),
|
2000-05-28 13:40:48 +00:00
|
|
|
Imp->Pos.Line);
|
|
|
|
} else {
|
|
|
|
/* Export created by the linker */
|
|
|
|
Warning ("Type mismatch for `%s', imported from %s(%lu)",
|
2000-11-20 21:56:48 +00:00
|
|
|
E->Name, GetSourceFileName (Imp->Obj, Imp->Pos.Name),
|
2000-05-28 13:40:48 +00:00
|
|
|
Imp->Pos.Line);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
Imp = Imp->Next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void CheckSymTypes (void)
|
|
|
|
/* Check for symbol tape mismatches */
|
|
|
|
{
|
|
|
|
unsigned I;
|
|
|
|
|
|
|
|
/* Print all open imports */
|
|
|
|
for (I = 0; I < ExpCount; ++I) {
|
2000-10-30 20:48:11 +00:00
|
|
|
const Export* E = ExpPool [I];
|
2000-05-28 13:40:48 +00:00
|
|
|
if (E->Expr != 0 && E->ImpCount > 0) {
|
|
|
|
/* External with matching imports */
|
|
|
|
CheckSymType (E);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void PrintUnresolved (ExpCheckFunc F, void* Data)
|
|
|
|
/* Print a list of unresolved symbols. On unresolved symbols, F is
|
|
|
|
* called (see the comments on ExpCheckFunc in the data section).
|
|
|
|
*/
|
|
|
|
{
|
|
|
|
unsigned I;
|
|
|
|
|
|
|
|
/* Print all open imports */
|
|
|
|
for (I = 0; I < ExpCount; ++I) {
|
|
|
|
Export* E = ExpPool [I];
|
|
|
|
if (E->Expr == 0 && E->ImpCount > 0 && F (E->Name, Data) == 0) {
|
|
|
|
/* Unresolved external */
|
|
|
|
Import* Imp = E->ImpList;
|
|
|
|
fprintf (stderr,
|
|
|
|
"Unresolved external `%s' referenced in:\n",
|
|
|
|
E->Name);
|
|
|
|
while (Imp) {
|
2000-11-20 21:56:48 +00:00
|
|
|
const char* Name = GetSourceFileName (Imp->Obj, Imp->Pos.Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
fprintf (stderr, " %s(%lu)\n", Name, Imp->Pos.Line);
|
|
|
|
Imp = Imp->Next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int CmpExpName (const void* K1, const void* K2)
|
|
|
|
/* Compare function for qsort */
|
|
|
|
{
|
|
|
|
return strcmp ((*(Export**)K1)->Name, (*(Export**)K2)->Name);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void CreateExportPool (void)
|
|
|
|
/* Create an array with pointer to all exports */
|
|
|
|
{
|
|
|
|
unsigned I, J;
|
|
|
|
|
|
|
|
/* Allocate memory */
|
|
|
|
if (ExpPool) {
|
2000-06-14 09:57:42 +00:00
|
|
|
xfree (ExpPool);
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
2000-06-14 09:57:42 +00:00
|
|
|
ExpPool = xmalloc (ExpCount * sizeof (Export*));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Walk through the list and insert the exports */
|
|
|
|
for (I = 0, J = 0; I < sizeof (HashTab) / sizeof (HashTab [0]); ++I) {
|
|
|
|
Export* E = HashTab [I];
|
|
|
|
while (E) {
|
|
|
|
CHECK (J < ExpCount);
|
|
|
|
ExpPool [J++] = E;
|
|
|
|
E = E->Next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Sort them by name */
|
|
|
|
qsort (ExpPool, ExpCount, sizeof (Export*), CmpExpName);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void CheckExports (ExpCheckFunc F, void* Data)
|
|
|
|
/* Check if there are any unresolved symbols. On unresolved symbols, F is
|
|
|
|
* called (see the comments on ExpCheckFunc in the data section).
|
|
|
|
*/
|
|
|
|
{
|
|
|
|
/* Create an export pool */
|
|
|
|
CreateExportPool ();
|
|
|
|
|
|
|
|
/* Check for symbol type mismatches */
|
|
|
|
CheckSymTypes ();
|
|
|
|
|
|
|
|
/* Check for unresolved externals (check here for special bin formats) */
|
|
|
|
if (ImpOpen != 0) {
|
|
|
|
/* Print all open imports */
|
|
|
|
PrintUnresolved (F, Data);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void PrintExportMap (FILE* F)
|
|
|
|
/* Print an export map to the given file */
|
|
|
|
{
|
|
|
|
unsigned I;
|
|
|
|
unsigned Count;
|
|
|
|
|
|
|
|
/* Print all exports */
|
|
|
|
Count = 0;
|
|
|
|
for (I = 0; I < ExpCount; ++I) {
|
2000-10-30 20:48:11 +00:00
|
|
|
const Export* E = ExpPool [I];
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Print unreferenced symbols only if explictly requested */
|
2000-11-20 21:56:48 +00:00
|
|
|
if (VerboseMap || E->ImpCount > 0 || IS_EXP_CONDES (E->Type)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
fprintf (F,
|
2001-09-08 22:09:30 +00:00
|
|
|
"%-25s %06lX %c%c%c%c ",
|
2000-10-30 20:48:11 +00:00
|
|
|
E->Name,
|
|
|
|
GetExportVal (E),
|
|
|
|
E->ImpCount? 'R' : ' ',
|
2001-09-08 22:09:30 +00:00
|
|
|
IS_EXP_LABEL (E->Type)? 'L' : 'E',
|
2000-10-30 20:48:11 +00:00
|
|
|
IS_EXP_ZP (E->Type)? 'Z' : ' ',
|
2000-11-20 15:22:57 +00:00
|
|
|
IS_EXP_CONDES (E->Type)? 'I' : ' ');
|
2000-05-28 13:40:48 +00:00
|
|
|
if (++Count == 2) {
|
2000-10-30 20:48:11 +00:00
|
|
|
Count = 0;
|
|
|
|
fprintf (F, "\n");
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fprintf (F, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void PrintImportMap (FILE* F)
|
|
|
|
/* Print an import map to the given file */
|
|
|
|
{
|
|
|
|
unsigned I;
|
2000-10-30 20:48:11 +00:00
|
|
|
const Import* Imp;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Loop over all exports */
|
|
|
|
for (I = 0; I < ExpCount; ++I) {
|
|
|
|
|
|
|
|
/* Get the export */
|
2000-10-30 20:48:11 +00:00
|
|
|
const Export* Exp = ExpPool [I];
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Print the symbol only if there are imports, or if a verbose map
|
|
|
|
* file is requested.
|
|
|
|
*/
|
|
|
|
if (VerboseMap || Exp->ImpCount > 0) {
|
|
|
|
|
|
|
|
/* Print the export */
|
|
|
|
fprintf (F,
|
2000-10-30 20:48:11 +00:00
|
|
|
"%s (%s):\n",
|
|
|
|
Exp->Name,
|
2000-11-20 21:56:48 +00:00
|
|
|
GetObjFileName (Exp->Obj));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
/* Print all imports for this symbol */
|
|
|
|
Imp = Exp->ImpList;
|
|
|
|
while (Imp) {
|
|
|
|
|
2000-10-30 20:48:11 +00:00
|
|
|
/* Print the import */
|
|
|
|
fprintf (F,
|
|
|
|
" %-25s %s(%lu)\n",
|
2000-11-20 21:56:48 +00:00
|
|
|
GetObjFileName (Imp->Obj),
|
|
|
|
GetSourceFileName (Imp->Obj, Imp->Pos.Name),
|
2000-10-30 20:48:11 +00:00
|
|
|
Imp->Pos.Line);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
2000-10-30 20:48:11 +00:00
|
|
|
/* Next import */
|
|
|
|
Imp = Imp->Next;
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
fprintf (F, "\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void PrintExportLabels (FILE* F)
|
|
|
|
/* Print the exports in a VICE label file */
|
|
|
|
{
|
|
|
|
unsigned I;
|
|
|
|
|
|
|
|
/* Print all exports */
|
|
|
|
for (I = 0; I < ExpCount; ++I) {
|
2000-10-30 20:48:11 +00:00
|
|
|
const Export* E = ExpPool [I];
|
2000-05-28 13:40:48 +00:00
|
|
|
fprintf (F, "al %06lX .%s\n", GetExportVal (E), E->Name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void MarkExport (Export* E)
|
|
|
|
/* Mark the export */
|
|
|
|
{
|
|
|
|
E->Flags |= EXP_USERMARK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void UnmarkExport (Export* E)
|
|
|
|
/* Remove the mark from the export */
|
|
|
|
{
|
|
|
|
E->Flags &= ~EXP_USERMARK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int ExportHasMark (Export* E)
|
|
|
|
/* Return true if the export has a mark */
|
|
|
|
{
|
|
|
|
return (E->Flags & EXP_USERMARK) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void CircularRefError (const Export* E)
|
|
|
|
/* Print an error about a circular reference using to define the given export */
|
|
|
|
{
|
|
|
|
Error ("Circular reference for symbol `%s', %s(%lu)",
|
2000-11-20 21:56:48 +00:00
|
|
|
E->Name, GetSourceFileName (E->Obj, E->Pos.Name), E->Pos.Line);
|
2000-05-28 13:40:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|