2000-05-28 13:40:48 +00:00
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* */
|
|
|
|
|
/* symtab.c */
|
|
|
|
|
/* */
|
|
|
|
|
/* Symbol table management for the cc65 C compiler */
|
|
|
|
|
/* */
|
|
|
|
|
/* */
|
|
|
|
|
/* */
|
2003-02-03 22:14:20 +00:00
|
|
|
|
/* (C) 2000-2003 Ullrich von Bassewitz */
|
|
|
|
|
/* R<>merstrasse 52 */
|
|
|
|
|
/* D-70794 Filderstadt */
|
2001-05-03 17:34:54 +00:00
|
|
|
|
/* EMail: uz@cc65.org */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* */
|
|
|
|
|
/* */
|
|
|
|
|
/* 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 <stdarg.h>
|
|
|
|
|
#include <string.h>
|
2000-06-12 18:31:40 +00:00
|
|
|
|
|
2000-08-01 15:04:35 +00:00
|
|
|
|
/* common */
|
|
|
|
|
#include "check.h"
|
2003-01-04 16:59:51 +00:00
|
|
|
|
#include "debugflag.h"
|
2000-08-01 15:04:35 +00:00
|
|
|
|
#include "hashstr.h"
|
|
|
|
|
#include "xmalloc.h"
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
2000-08-01 15:04:35 +00:00
|
|
|
|
/* cc65 */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
#include "asmcode.h"
|
|
|
|
|
#include "asmlabel.h"
|
|
|
|
|
#include "codegen.h"
|
|
|
|
|
#include "datatype.h"
|
|
|
|
|
#include "declare.h"
|
|
|
|
|
#include "error.h"
|
|
|
|
|
#include "funcdesc.h"
|
|
|
|
|
#include "global.h"
|
|
|
|
|
#include "symentry.h"
|
2000-08-14 22:18:26 +00:00
|
|
|
|
#include "typecmp.h"
|
2000-05-28 13:40:48 +00:00
|
|
|
|
#include "symtab.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* Data */
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* An empty symbol table */
|
|
|
|
|
SymTable EmptySymTab = {
|
|
|
|
|
0, /* PrevTab */
|
|
|
|
|
0, /* SymHead */
|
|
|
|
|
0, /* SymTail */
|
|
|
|
|
0, /* SymCount */
|
|
|
|
|
1, /* Size */
|
|
|
|
|
{ 0 } /* Tab[1] */
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Symbol table sizes */
|
|
|
|
|
#define SYMTAB_SIZE_GLOBAL 211U
|
|
|
|
|
#define SYMTAB_SIZE_FUNCTION 29U
|
|
|
|
|
#define SYMTAB_SIZE_BLOCK 13U
|
|
|
|
|
#define SYMTAB_SIZE_STRUCT 19U
|
|
|
|
|
#define SYMTAB_SIZE_LABEL 7U
|
|
|
|
|
|
|
|
|
|
/* The current and root symbol tables */
|
|
|
|
|
static unsigned LexicalLevel = 0; /* For safety checks */
|
|
|
|
|
static SymTable* SymTab0 = 0;
|
|
|
|
|
static SymTable* SymTab = 0;
|
2000-06-12 18:31:40 +00:00
|
|
|
|
static SymTable* TagTab0 = 0;
|
|
|
|
|
static SymTable* TagTab = 0;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
static SymTable* LabelTab = 0;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* struct SymTable */
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static SymTable* NewSymTable (unsigned Size)
|
|
|
|
|
/* Create and return a symbol table for the given lexical level */
|
|
|
|
|
{
|
|
|
|
|
unsigned I;
|
|
|
|
|
|
|
|
|
|
/* Allocate memory for the table */
|
|
|
|
|
SymTable* S = xmalloc (sizeof (SymTable) + (Size-1) * sizeof (SymEntry*));
|
|
|
|
|
|
|
|
|
|
/* Initialize the symbol table structure */
|
|
|
|
|
S->PrevTab = 0;
|
|
|
|
|
S->SymHead = 0;
|
|
|
|
|
S->SymTail = 0;
|
|
|
|
|
S->SymCount = 0;
|
|
|
|
|
S->Size = Size;
|
|
|
|
|
for (I = 0; I < Size; ++I) {
|
|
|
|
|
S->Tab[I] = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the symbol table */
|
|
|
|
|
return S;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void FreeSymTable (SymTable* S)
|
|
|
|
|
/* Free the given symbo table including all symbols */
|
|
|
|
|
{
|
|
|
|
|
/* Free all symbols */
|
|
|
|
|
SymEntry* Sym = S->SymHead;
|
|
|
|
|
while (Sym) {
|
|
|
|
|
SymEntry* NextSym = Sym->NextSym;
|
|
|
|
|
FreeSymEntry (Sym);
|
|
|
|
|
Sym = NextSym;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Free the table itself */
|
|
|
|
|
xfree (S);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* Check symbols in a table */
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void CheckSymTable (SymTable* Tab)
|
|
|
|
|
/* Check a symbol table for open references, unused symbols ... */
|
|
|
|
|
{
|
|
|
|
|
SymEntry* Entry = Tab->SymHead;
|
|
|
|
|
while (Entry) {
|
|
|
|
|
|
|
|
|
|
/* Get the storage flags for tne entry */
|
|
|
|
|
unsigned Flags = Entry->Flags;
|
|
|
|
|
|
|
|
|
|
/* Ignore typedef entries */
|
|
|
|
|
if ((Flags & SC_TYPEDEF) != SC_TYPEDEF) {
|
|
|
|
|
|
|
|
|
|
/* Check if the symbol is one with storage, and it if it was
|
|
|
|
|
* defined but not used.
|
|
|
|
|
*/
|
|
|
|
|
if (((Flags & SC_AUTO) || (Flags & SC_STATIC)) && (Flags & SC_EXTERN) == 0) {
|
2002-11-24 23:31:54 +00:00
|
|
|
|
if (SymIsDef (Entry) && !SymIsRef (Entry)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
if (Flags & SC_PARAM) {
|
2000-10-15 19:52:01 +00:00
|
|
|
|
Warning ("Parameter `%s' is never used", Entry->Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
} else {
|
2000-10-15 19:52:01 +00:00
|
|
|
|
Warning ("`%s' is defined but never used", Entry->Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
2000-06-08 20:27:05 +00:00
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* If the entry is a label, check if it was defined in the function */
|
|
|
|
|
if (Flags & SC_LABEL) {
|
2002-11-24 23:31:54 +00:00
|
|
|
|
if (!SymIsDef (Entry)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Undefined label */
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Undefined label: `%s'", Entry->Name);
|
2002-11-24 23:31:54 +00:00
|
|
|
|
} else if (!SymIsRef (Entry)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Defined but not used */
|
2000-10-15 19:52:01 +00:00
|
|
|
|
Warning ("`%s' is defined but never used", Entry->Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
2000-06-08 20:27:05 +00:00
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Next entry */
|
|
|
|
|
Entry = Entry->NextSym;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* Handling of lexical levels */
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2002-11-25 15:05:15 +00:00
|
|
|
|
unsigned GetLexicalLevel (void)
|
|
|
|
|
/* Return the current lexical level */
|
|
|
|
|
{
|
|
|
|
|
return LexicalLevel;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
void EnterGlobalLevel (void)
|
|
|
|
|
/* Enter the program global lexical level */
|
|
|
|
|
{
|
|
|
|
|
/* Safety */
|
|
|
|
|
PRECONDITION (++LexicalLevel == LEX_LEVEL_GLOBAL);
|
|
|
|
|
|
|
|
|
|
/* Create and assign the symbol table */
|
|
|
|
|
SymTab0 = SymTab = NewSymTable (SYMTAB_SIZE_GLOBAL);
|
|
|
|
|
|
2000-06-12 18:31:40 +00:00
|
|
|
|
/* Create and assign the tag table */
|
|
|
|
|
TagTab0 = TagTab = NewSymTable (SYMTAB_SIZE_GLOBAL);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void LeaveGlobalLevel (void)
|
|
|
|
|
/* Leave the program global lexical level */
|
|
|
|
|
{
|
|
|
|
|
/* Safety */
|
|
|
|
|
PRECONDITION (LexicalLevel-- == LEX_LEVEL_GLOBAL);
|
|
|
|
|
|
|
|
|
|
/* Check the tables */
|
|
|
|
|
CheckSymTable (SymTab0);
|
|
|
|
|
|
|
|
|
|
/* Dump the tables if requested */
|
|
|
|
|
if (Debug) {
|
2001-05-03 17:34:54 +00:00
|
|
|
|
PrintSymTable (SymTab0, stdout, "Global symbol table");
|
|
|
|
|
PrintSymTable (TagTab0, stdout, "Global tag table");
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Don't delete the symbol and struct tables! */
|
2001-05-03 17:34:54 +00:00
|
|
|
|
SymTab = 0;
|
|
|
|
|
TagTab = 0;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void EnterFunctionLevel (void)
|
|
|
|
|
/* Enter function lexical level */
|
|
|
|
|
{
|
|
|
|
|
SymTable* S;
|
|
|
|
|
|
|
|
|
|
/* New lexical level */
|
2002-11-25 15:13:03 +00:00
|
|
|
|
++LexicalLevel;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Get a new symbol table and make it current */
|
|
|
|
|
S = NewSymTable (SYMTAB_SIZE_FUNCTION);
|
|
|
|
|
S->PrevTab = SymTab;
|
|
|
|
|
SymTab = S;
|
|
|
|
|
|
2000-06-12 18:31:40 +00:00
|
|
|
|
/* Get a new tag table and make it current */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
S = NewSymTable (SYMTAB_SIZE_FUNCTION);
|
2000-06-12 18:31:40 +00:00
|
|
|
|
S->PrevTab = TagTab;
|
|
|
|
|
TagTab = S;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Create and assign a new label table */
|
|
|
|
|
LabelTab = NewSymTable (SYMTAB_SIZE_LABEL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void RememberFunctionLevel (struct FuncDesc* F)
|
|
|
|
|
/* Remember the symbol tables for the level and leave the level without checks */
|
|
|
|
|
{
|
|
|
|
|
/* Leave the lexical level */
|
2002-11-25 15:13:03 +00:00
|
|
|
|
--LexicalLevel;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Remember the tables */
|
2000-06-12 18:31:40 +00:00
|
|
|
|
F->SymTab = SymTab;
|
|
|
|
|
F->TagTab = TagTab;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Don't delete the tables */
|
2000-06-12 18:31:40 +00:00
|
|
|
|
SymTab = SymTab->PrevTab;
|
|
|
|
|
TagTab = TagTab->PrevTab;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void ReenterFunctionLevel (struct FuncDesc* F)
|
|
|
|
|
/* Reenter the function lexical level using the existing tables from F */
|
|
|
|
|
{
|
|
|
|
|
/* New lexical level */
|
2002-11-25 15:13:03 +00:00
|
|
|
|
++LexicalLevel;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Make the tables current again */
|
|
|
|
|
F->SymTab->PrevTab = SymTab;
|
|
|
|
|
SymTab = F->SymTab;
|
|
|
|
|
|
2000-06-12 18:31:40 +00:00
|
|
|
|
F->TagTab->PrevTab = TagTab;
|
|
|
|
|
TagTab = F->TagTab;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Create and assign a new label table */
|
|
|
|
|
LabelTab = NewSymTable (SYMTAB_SIZE_LABEL);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void LeaveFunctionLevel (void)
|
|
|
|
|
/* Leave function lexical level */
|
|
|
|
|
{
|
|
|
|
|
/* Leave the lexical level */
|
2002-11-25 15:13:03 +00:00
|
|
|
|
--LexicalLevel;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Check the tables */
|
|
|
|
|
CheckSymTable (SymTab);
|
|
|
|
|
CheckSymTable (LabelTab);
|
|
|
|
|
|
|
|
|
|
/* Drop the label table if it is empty */
|
|
|
|
|
if (LabelTab->SymCount == 0) {
|
|
|
|
|
FreeSymTable (LabelTab);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Don't delete the tables */
|
2000-06-12 18:31:40 +00:00
|
|
|
|
SymTab = SymTab->PrevTab;
|
|
|
|
|
TagTab = TagTab->PrevTab;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
LabelTab = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void EnterBlockLevel (void)
|
|
|
|
|
/* Enter a nested block in a function */
|
|
|
|
|
{
|
|
|
|
|
SymTable* S;
|
|
|
|
|
|
|
|
|
|
/* New lexical level */
|
|
|
|
|
++LexicalLevel;
|
|
|
|
|
|
|
|
|
|
/* Get a new symbol table and make it current */
|
|
|
|
|
S = NewSymTable (SYMTAB_SIZE_BLOCK);
|
|
|
|
|
S->PrevTab = SymTab;
|
|
|
|
|
SymTab = S;
|
|
|
|
|
|
2000-06-12 18:31:40 +00:00
|
|
|
|
/* Get a new tag table and make it current */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
S = NewSymTable (SYMTAB_SIZE_BLOCK);
|
2000-06-12 18:31:40 +00:00
|
|
|
|
S->PrevTab = TagTab;
|
|
|
|
|
TagTab = S;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void LeaveBlockLevel (void)
|
|
|
|
|
/* Leave a nested block in a function */
|
|
|
|
|
{
|
|
|
|
|
/* Leave the lexical level */
|
|
|
|
|
--LexicalLevel;
|
|
|
|
|
|
|
|
|
|
/* Check the tables */
|
|
|
|
|
CheckSymTable (SymTab);
|
|
|
|
|
|
|
|
|
|
/* Don't delete the tables */
|
2000-06-12 18:31:40 +00:00
|
|
|
|
SymTab = SymTab->PrevTab;
|
|
|
|
|
TagTab = TagTab->PrevTab;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void EnterStructLevel (void)
|
|
|
|
|
/* Enter a nested block for a struct definition */
|
|
|
|
|
{
|
|
|
|
|
SymTable* S;
|
|
|
|
|
|
|
|
|
|
/* Get a new symbol table and make it current. Note: Structs and enums
|
|
|
|
|
* nested in struct scope are NOT local to the struct but visible in the
|
|
|
|
|
* outside scope. So we will NOT create a new struct or enum table.
|
|
|
|
|
*/
|
|
|
|
|
S = NewSymTable (SYMTAB_SIZE_BLOCK);
|
|
|
|
|
S->PrevTab = SymTab;
|
|
|
|
|
SymTab = S;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void LeaveStructLevel (void)
|
|
|
|
|
/* Leave a nested block for a struct definition */
|
|
|
|
|
{
|
|
|
|
|
/* Don't delete the table */
|
|
|
|
|
SymTab = SymTab->PrevTab;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* Find functions */
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static SymEntry* FindSymInTable (const SymTable* T, const char* Name, unsigned Hash)
|
|
|
|
|
/* Search for an entry in one table */
|
|
|
|
|
{
|
|
|
|
|
/* Get the start of the hash chain */
|
|
|
|
|
SymEntry* E = T->Tab [Hash % T->Size];
|
|
|
|
|
while (E) {
|
|
|
|
|
/* Compare the name */
|
|
|
|
|
if (strcmp (E->Name, Name) == 0) {
|
|
|
|
|
/* Found */
|
|
|
|
|
return E;
|
|
|
|
|
}
|
|
|
|
|
/* Not found, next entry in hash chain */
|
|
|
|
|
E = E->NextHash;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Not found */
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static SymEntry* FindSymInTree (const SymTable* Tab, const char* Name)
|
|
|
|
|
/* Find the symbol with the given name in the table tree that starts with T */
|
|
|
|
|
{
|
|
|
|
|
/* Get the hash over the name */
|
|
|
|
|
unsigned Hash = HashStr (Name);
|
|
|
|
|
|
|
|
|
|
/* Check all symbol tables for the symbol */
|
|
|
|
|
while (Tab) {
|
|
|
|
|
/* Try to find the symbol in this table */
|
|
|
|
|
SymEntry* E = FindSymInTable (Tab, Name, Hash);
|
|
|
|
|
|
|
|
|
|
/* Bail out if we found it */
|
|
|
|
|
if (E != 0) {
|
|
|
|
|
return E;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Repeat the search in the next higher lexical level */
|
|
|
|
|
Tab = Tab->PrevTab;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Not found */
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SymEntry* FindSym (const char* Name)
|
|
|
|
|
/* Find the symbol with the given name */
|
|
|
|
|
{
|
|
|
|
|
return FindSymInTree (SymTab, Name);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-05-22 13:58:56 +00:00
|
|
|
|
SymEntry* FindGlobalSym (const char* Name)
|
|
|
|
|
/* Find the symbol with the given name in the global symbol table only */
|
|
|
|
|
{
|
|
|
|
|
return FindSymInTable (SymTab0, Name, HashStr (Name));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-06-12 18:31:40 +00:00
|
|
|
|
SymEntry* FindLocalSym (const char* Name)
|
|
|
|
|
/* Find the symbol with the given name in the current symbol table only */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
{
|
2000-06-12 18:31:40 +00:00
|
|
|
|
return FindSymInTable (SymTab, Name, HashStr (Name));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-06-12 18:31:40 +00:00
|
|
|
|
SymEntry* FindTagSym (const char* Name)
|
|
|
|
|
/* Find the symbol with the given name in the tag table */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
{
|
2000-06-12 18:31:40 +00:00
|
|
|
|
return FindSymInTree (TagTab, Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SymEntry* FindStructField (const type* Type, const char* Name)
|
|
|
|
|
/* Find a struct field in the fields list */
|
|
|
|
|
{
|
|
|
|
|
SymEntry* Field = 0;
|
|
|
|
|
|
|
|
|
|
/* The given type may actually be a pointer to struct */
|
|
|
|
|
if (Type[0] == T_PTR) {
|
|
|
|
|
++Type;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Non-structs do not have any struct fields... */
|
2000-08-01 18:45:08 +00:00
|
|
|
|
if (IsClassStruct (Type)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
const SymTable* Tab;
|
|
|
|
|
|
|
|
|
|
/* Get a pointer to the struct/union type */
|
|
|
|
|
const SymEntry* Struct = (const SymEntry*) Decode (Type+1);
|
|
|
|
|
CHECK (Struct != 0);
|
|
|
|
|
|
|
|
|
|
/* Get the field symbol table from the struct entry.
|
|
|
|
|
* Beware: The table may not exist.
|
|
|
|
|
*/
|
|
|
|
|
Tab = Struct->V.S.SymTab;
|
|
|
|
|
|
|
|
|
|
/* Now search in the struct symbol table */
|
|
|
|
|
if (Tab) {
|
|
|
|
|
Field = FindSymInTable (Struct->V.S.SymTab, Name, HashStr (Name));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return Field;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* Add stuff to the symbol table */
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static void AddSymEntry (SymTable* T, SymEntry* S)
|
|
|
|
|
/* Add a symbol to a symbol table */
|
|
|
|
|
{
|
|
|
|
|
/* Get the hash value for the name */
|
|
|
|
|
unsigned Hash = HashStr (S->Name) % T->Size;
|
|
|
|
|
|
|
|
|
|
/* Insert the symbol into the list of all symbols in this level */
|
|
|
|
|
if (T->SymTail) {
|
|
|
|
|
T->SymTail->NextSym = S;
|
|
|
|
|
}
|
|
|
|
|
S->PrevSym = T->SymTail;
|
|
|
|
|
T->SymTail = S;
|
|
|
|
|
if (T->SymHead == 0) {
|
|
|
|
|
/* First symbol */
|
|
|
|
|
T->SymHead = S;
|
|
|
|
|
}
|
|
|
|
|
T->SymCount++;
|
|
|
|
|
|
|
|
|
|
/* Insert the symbol into the hash chain */
|
|
|
|
|
S->NextHash = T->Tab[Hash];
|
|
|
|
|
T->Tab[Hash] = S;
|
|
|
|
|
|
|
|
|
|
/* Tell the symbol in which table it is */
|
|
|
|
|
S->Owner = T;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SymEntry* AddStructSym (const char* Name, unsigned Size, SymTable* Tab)
|
|
|
|
|
/* Add a struct/union entry and return it */
|
|
|
|
|
{
|
|
|
|
|
/* Do we have an entry with this name already? */
|
2000-06-12 18:31:40 +00:00
|
|
|
|
SymEntry* Entry = FindSymInTable (TagTab, Name, HashStr (Name));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
if (Entry) {
|
|
|
|
|
|
|
|
|
|
/* We do have an entry. This may be a forward, so check it. */
|
2000-06-12 18:31:40 +00:00
|
|
|
|
if ((Entry->Flags & SC_STRUCT) == 0) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Existing symbol is not a struct */
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Symbol `%s' is already different kind", Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
} else if (Size > 0 && Entry->V.S.Size > 0) {
|
|
|
|
|
/* Both structs are definitions. */
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Multiple definition for `%s'", Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
} else {
|
|
|
|
|
/* Define the struct size if it is given */
|
|
|
|
|
if (Size > 0) {
|
|
|
|
|
Entry->V.S.SymTab = Tab;
|
|
|
|
|
Entry->V.S.Size = Size;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
|
|
/* Create a new entry */
|
|
|
|
|
Entry = NewSymEntry (Name, SC_STRUCT);
|
|
|
|
|
|
|
|
|
|
/* Set the struct data */
|
|
|
|
|
Entry->V.S.SymTab = Tab;
|
|
|
|
|
Entry->V.S.Size = Size;
|
|
|
|
|
|
|
|
|
|
/* Add it to the current table */
|
2000-06-12 18:31:40 +00:00
|
|
|
|
AddSymEntry (TagTab, Entry);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the entry */
|
|
|
|
|
return Entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-03-23 21:27:48 +00:00
|
|
|
|
SymEntry* AddConstSym (const char* Name, const type* Type, unsigned Flags, long Val)
|
|
|
|
|
/* Add an constant symbol to the symbol table and return it */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
{
|
2003-10-09 18:56:38 +00:00
|
|
|
|
/* Enums must be inserted in the global symbol table */
|
|
|
|
|
SymTable* Tab = ((Flags & SC_ENUM) == SC_ENUM)? SymTab0 : SymTab;
|
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Do we have an entry with this name already? */
|
2003-10-09 18:56:38 +00:00
|
|
|
|
SymEntry* Entry = FindSymInTable (Tab, Name, HashStr (Name));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
if (Entry) {
|
2001-03-23 21:27:48 +00:00
|
|
|
|
if ((Entry->Flags & SC_CONST) != SC_CONST) {
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Symbol `%s' is already different kind", Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
} else {
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Multiple definition for `%s'", Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
return Entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Create a new entry */
|
2001-03-23 21:27:48 +00:00
|
|
|
|
Entry = NewSymEntry (Name, Flags);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Enum values are ints */
|
2001-03-23 21:27:48 +00:00
|
|
|
|
Entry->Type = TypeDup (Type);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Set the enum data */
|
2001-03-23 21:27:48 +00:00
|
|
|
|
Entry->V.ConstVal = Val;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Add the entry to the symbol table */
|
2003-10-09 18:56:38 +00:00
|
|
|
|
AddSymEntry (Tab, Entry);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Return the entry */
|
|
|
|
|
return Entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SymEntry* AddLabelSym (const char* Name, unsigned Flags)
|
|
|
|
|
/* Add a goto label to the label table */
|
|
|
|
|
{
|
|
|
|
|
/* Do we have an entry with this name already? */
|
|
|
|
|
SymEntry* Entry = FindSymInTable (LabelTab, Name, HashStr (Name));
|
|
|
|
|
if (Entry) {
|
|
|
|
|
|
2002-11-24 23:31:54 +00:00
|
|
|
|
if (SymIsDef (Entry) && (Flags & SC_DEF) != 0) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Trying to define the label more than once */
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Label `%s' is defined more than once", Name);
|
2000-12-04 20:39:17 +00:00
|
|
|
|
}
|
2000-05-28 13:40:48 +00:00
|
|
|
|
Entry->Flags |= Flags;
|
|
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
|
|
/* Create a new entry */
|
|
|
|
|
Entry = NewSymEntry (Name, SC_LABEL | Flags);
|
|
|
|
|
|
|
|
|
|
/* Set a new label number */
|
2001-04-19 06:49:08 +00:00
|
|
|
|
Entry->V.Label = GetLocalLabel ();
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Add the entry to the label table */
|
|
|
|
|
AddSymEntry (LabelTab, Entry);
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the entry */
|
|
|
|
|
return Entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-03-23 10:16:50 +00:00
|
|
|
|
SymEntry* AddLocalSym (const char* Name, const type* Type, unsigned Flags, int Offs)
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Add a local symbol and return the symbol entry */
|
|
|
|
|
{
|
|
|
|
|
/* Do we have an entry with this name already? */
|
2000-06-22 11:28:39 +00:00
|
|
|
|
SymEntry* Entry = FindSymInTable (SymTab, Name, HashStr (Name));
|
2000-05-28 13:40:48 +00:00
|
|
|
|
if (Entry) {
|
|
|
|
|
|
|
|
|
|
/* We have a symbol with this name already */
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Multiple definition for `%s'", Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
|
|
/* Create a new entry */
|
|
|
|
|
Entry = NewSymEntry (Name, Flags);
|
|
|
|
|
|
|
|
|
|
/* Set the symbol attributes */
|
|
|
|
|
Entry->Type = TypeDup (Type);
|
2002-11-24 23:31:54 +00:00
|
|
|
|
if ((Flags & SC_AUTO) == SC_AUTO) {
|
|
|
|
|
Entry->V.Offs = Offs;
|
|
|
|
|
} else if ((Flags & SC_REGISTER) == SC_REGISTER) {
|
|
|
|
|
Entry->V.R.RegOffs = Offs;
|
|
|
|
|
Entry->V.R.SaveOffs = oursp; /* ### Cleaner! */
|
|
|
|
|
} else if ((Flags & SC_STATIC) == SC_STATIC) {
|
|
|
|
|
Entry->V.Label = Offs;
|
|
|
|
|
} else if ((Flags & SC_STRUCTFIELD) == SC_STRUCTFIELD) {
|
|
|
|
|
Entry->V.Offs = Offs;
|
|
|
|
|
} else {
|
|
|
|
|
Internal ("Invalid flags in AddLocalSym: %04X", Flags);
|
|
|
|
|
}
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Add the entry to the symbol table */
|
|
|
|
|
AddSymEntry (SymTab, Entry);
|
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the entry */
|
|
|
|
|
return Entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-03-23 10:16:50 +00:00
|
|
|
|
SymEntry* AddGlobalSym (const char* Name, const type* Type, unsigned Flags)
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Add an external or global symbol to the symbol table and return the entry */
|
|
|
|
|
{
|
2001-05-03 17:34:54 +00:00
|
|
|
|
/* There is some special handling for functions, so check if it is one */
|
|
|
|
|
int IsFunc = IsTypeFunc (Type);
|
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Functions must be inserted in the global symbol table */
|
2001-05-03 17:34:54 +00:00
|
|
|
|
SymTable* Tab = IsFunc? SymTab0 : SymTab;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Do we have an entry with this name already? */
|
|
|
|
|
SymEntry* Entry = FindSymInTable (Tab, Name, HashStr (Name));
|
|
|
|
|
if (Entry) {
|
|
|
|
|
|
|
|
|
|
type* EType;
|
|
|
|
|
|
|
|
|
|
/* We have a symbol with this name already */
|
|
|
|
|
if (Entry->Flags & SC_TYPE) {
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Multiple definition for `%s'", Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
return Entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Get the type string of the existing symbol */
|
|
|
|
|
EType = Entry->Type;
|
|
|
|
|
|
|
|
|
|
/* If we are handling arrays, the old entry or the new entry may be an
|
|
|
|
|
* incomplete declaration. Accept this, and if the exsting entry is
|
|
|
|
|
* incomplete, complete it.
|
|
|
|
|
*/
|
2000-08-01 18:45:08 +00:00
|
|
|
|
if (IsTypeArray (Type) && IsTypeArray (EType)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* Get the array sizes */
|
2003-02-03 22:14:20 +00:00
|
|
|
|
long Size = GetElementCount (Type);
|
|
|
|
|
long ESize = GetElementCount (EType);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
2003-02-03 22:14:20 +00:00
|
|
|
|
if ((Size != UNSPECIFIED && ESize != UNSPECIFIED && Size != ESize) ||
|
2000-08-14 22:18:26 +00:00
|
|
|
|
TypeCmp (Type+DECODE_SIZE+1, EType+DECODE_SIZE+1) < TC_EQUAL) {
|
|
|
|
|
/* Types not identical: Conflicting types */
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Conflicting types for `%s'", Name);
|
2000-12-04 20:39:17 +00:00
|
|
|
|
return Entry;
|
2000-05-28 13:40:48 +00:00
|
|
|
|
} else {
|
|
|
|
|
/* Check if we have a size in the existing definition */
|
2003-10-09 18:56:38 +00:00
|
|
|
|
if (ESize == UNSPECIFIED) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Existing, size not given, use size from new def */
|
|
|
|
|
Encode (EType + 1, Size);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
/* New type must be identical */
|
2000-08-14 22:18:26 +00:00
|
|
|
|
if (TypeCmp (EType, Type) < TC_EQUAL) {
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Conflicting types for `%s'", Name);
|
2000-12-04 20:39:17 +00:00
|
|
|
|
return Entry;
|
|
|
|
|
}
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
/* In case of a function, use the new type descriptor, since it
|
|
|
|
|
* contains pointers to the new symbol tables that are needed if
|
|
|
|
|
* an actual function definition follows.
|
|
|
|
|
*/
|
2001-05-03 17:34:54 +00:00
|
|
|
|
if (IsFunc) {
|
|
|
|
|
/* Get the function descriptor from the new type */
|
|
|
|
|
FuncDesc* F = GetFuncDesc (Type);
|
|
|
|
|
/* Use this new function descriptor */
|
|
|
|
|
Entry->V.F.Func = F;
|
|
|
|
|
EncodePtr (EType+1, F);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Add the new flags */
|
|
|
|
|
Entry->Flags |= Flags;
|
|
|
|
|
|
|
|
|
|
} else {
|
|
|
|
|
|
|
|
|
|
/* Create a new entry */
|
|
|
|
|
Entry = NewSymEntry (Name, Flags);
|
|
|
|
|
|
2001-03-23 21:27:48 +00:00
|
|
|
|
/* Set the symbol attributes */
|
2000-05-28 13:40:48 +00:00
|
|
|
|
Entry->Type = TypeDup (Type);
|
|
|
|
|
|
2001-05-03 17:34:54 +00:00
|
|
|
|
/* If this is a function, set the function descriptor and clear
|
|
|
|
|
* additional fields.
|
|
|
|
|
*/
|
|
|
|
|
if (IsFunc) {
|
|
|
|
|
Entry->V.F.Func = GetFuncDesc (Entry->Type);
|
2001-05-05 13:51:42 +00:00
|
|
|
|
Entry->V.F.Seg = 0;
|
2001-05-03 17:34:54 +00:00
|
|
|
|
}
|
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* Add the entry to the symbol table */
|
|
|
|
|
AddSymEntry (Tab, Entry);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Return the entry */
|
|
|
|
|
return Entry;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
/* Code */
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
SymTable* GetSymTab (void)
|
|
|
|
|
/* Return the current symbol table */
|
|
|
|
|
{
|
|
|
|
|
return SymTab;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2001-05-03 17:34:54 +00:00
|
|
|
|
SymTable* GetGlobalSymTab (void)
|
|
|
|
|
/* Return the global symbol table */
|
|
|
|
|
{
|
|
|
|
|
return SymTab0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-06-12 18:31:40 +00:00
|
|
|
|
int SymIsLocal (SymEntry* Sym)
|
|
|
|
|
/* Return true if the symbol is defined in the highest lexical level */
|
|
|
|
|
{
|
|
|
|
|
return (Sym->Owner == SymTab || Sym->Owner == TagTab);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
|
void MakeZPSym (const char* Name)
|
|
|
|
|
/* Mark the given symbol as zero page symbol */
|
|
|
|
|
{
|
|
|
|
|
/* Get the symbol table entry */
|
|
|
|
|
SymEntry* Entry = FindSymInTable (SymTab, Name, HashStr (Name));
|
|
|
|
|
|
|
|
|
|
/* Mark the symbol as zeropage */
|
|
|
|
|
if (Entry) {
|
|
|
|
|
Entry->Flags |= SC_ZEROPAGE;
|
|
|
|
|
} else {
|
2000-11-02 21:22:33 +00:00
|
|
|
|
Error ("Undefined symbol: `%s'", Name);
|
2000-05-28 13:40:48 +00:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void PrintSymTable (const SymTable* Tab, FILE* F, const char* Header, ...)
|
|
|
|
|
/* Write the symbol table to the given file */
|
|
|
|
|
{
|
|
|
|
|
unsigned Len;
|
|
|
|
|
const SymEntry* Entry;
|
|
|
|
|
|
|
|
|
|
/* Print the header */
|
|
|
|
|
va_list ap;
|
|
|
|
|
va_start (ap, Header);
|
|
|
|
|
fputc ('\n', F);
|
|
|
|
|
Len = vfprintf (F, Header, ap);
|
|
|
|
|
va_end (ap);
|
|
|
|
|
fputc ('\n', F);
|
|
|
|
|
|
|
|
|
|
/* Underline the header */
|
|
|
|
|
while (Len--) {
|
|
|
|
|
fputc ('=', F);
|
|
|
|
|
}
|
|
|
|
|
fputc ('\n', F);
|
|
|
|
|
|
|
|
|
|
/* Dump the table */
|
|
|
|
|
Entry = Tab->SymHead;
|
|
|
|
|
if (Entry == 0) {
|
|
|
|
|
fprintf (F, "(empty)\n");
|
|
|
|
|
} else {
|
|
|
|
|
while (Entry) {
|
|
|
|
|
DumpSymEntry (F, Entry);
|
|
|
|
|
Entry = Entry->NextSym;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
fprintf (F, "\n\n\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void EmitExternals (void)
|
|
|
|
|
/* Write import/export statements for external symbols */
|
|
|
|
|
{
|
|
|
|
|
SymEntry* Entry;
|
|
|
|
|
|
|
|
|
|
Entry = SymTab->SymHead;
|
|
|
|
|
while (Entry) {
|
|
|
|
|
unsigned Flags = Entry->Flags;
|
|
|
|
|
if (Flags & SC_EXTERN) {
|
|
|
|
|
/* Only defined or referenced externs */
|
2002-11-24 23:31:54 +00:00
|
|
|
|
if (SymIsRef (Entry) && !SymIsDef (Entry)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* An import */
|
|
|
|
|
g_defimport (Entry->Name, Flags & SC_ZEROPAGE);
|
2002-11-24 23:31:54 +00:00
|
|
|
|
} else if (SymIsDef (Entry)) {
|
2000-05-28 13:40:48 +00:00
|
|
|
|
/* An export */
|
|
|
|
|
g_defexport (Entry->Name, Flags & SC_ZEROPAGE);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
Entry = Entry->NextSym;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|