2000-05-28 13:40:48 +00:00
|
|
|
/*****************************************************************************/
|
|
|
|
/* */
|
2000-06-03 11:15:11 +00:00
|
|
|
/* toklist.c */
|
2000-05-28 13:40:48 +00:00
|
|
|
/* */
|
2000-06-03 11:15:11 +00:00
|
|
|
/* Token list for the ca65 macroassembler */
|
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 <string.h>
|
|
|
|
|
|
|
|
#include "mem.h"
|
|
|
|
#include "scanner.h"
|
2000-06-03 11:15:11 +00:00
|
|
|
#include "toklist.h"
|
2000-05-28 13:40:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*****************************************************************************/
|
|
|
|
/* Code */
|
|
|
|
/*****************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
TokNode* NewTokNode (void)
|
|
|
|
/* Create and return a token node with the current token value */
|
|
|
|
{
|
|
|
|
TokNode* T;
|
|
|
|
|
|
|
|
/* Allocate memory */
|
|
|
|
unsigned Len = TokHasSVal (Tok)? strlen (SVal) : 0;
|
|
|
|
T = Xmalloc (sizeof (TokNode) + Len);
|
|
|
|
|
|
|
|
/* Initialize the token contents */
|
|
|
|
T->Next = 0;
|
|
|
|
T->Tok = Tok;
|
|
|
|
T->WS = WS;
|
|
|
|
T->IVal = IVal;
|
|
|
|
memcpy (T->SVal, SVal, Len);
|
|
|
|
T->SVal [Len] = '\0';
|
|
|
|
|
|
|
|
/* Return the node */
|
|
|
|
return T;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FreeTokNode (TokNode* T)
|
|
|
|
/* Free the given token node */
|
|
|
|
{
|
|
|
|
Xfree (T);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void TokSet (TokNode* T)
|
|
|
|
/* Set the scanner token from the given token node */
|
|
|
|
{
|
|
|
|
/* Set the values */
|
|
|
|
Tok = T->Tok;
|
|
|
|
WS = T->WS;
|
|
|
|
IVal = T->IVal;
|
|
|
|
strcpy (SVal, T->SVal);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
enum TC TokCmp (const TokNode* T)
|
|
|
|
/* Compare the token given as parameter against the current token */
|
|
|
|
{
|
|
|
|
if (T->Tok != Tok) {
|
|
|
|
/* Different token */
|
|
|
|
return tcDifferent;
|
|
|
|
}
|
2000-06-03 11:15:11 +00:00
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
/* If the token has string attribute, check it */
|
|
|
|
if (TokHasSVal (T->Tok)) {
|
|
|
|
if (strcmp (T->SVal, SVal) != 0) {
|
|
|
|
return tcSameToken;
|
|
|
|
}
|
|
|
|
} else if (TokHasIVal (T->Tok)) {
|
|
|
|
if (T->IVal != IVal) {
|
|
|
|
return tcSameToken;
|
|
|
|
}
|
|
|
|
}
|
2000-06-03 11:15:11 +00:00
|
|
|
|
2000-05-28 13:40:48 +00:00
|
|
|
/* Tokens are identical */
|
|
|
|
return tcIdentical;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2000-06-03 11:15:11 +00:00
|
|
|
void InitTokList (TokList* T)
|
|
|
|
/* Initialize a token list structure for later use */
|
|
|
|
{
|
|
|
|
/* Initialize the fields */
|
|
|
|
T->Next = 0;
|
|
|
|
T->Root = 0;
|
|
|
|
T->Last = 0;
|
|
|
|
T->Repeat = 1;
|
|
|
|
T->Count = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
TokList* NewTokList (void)
|
|
|
|
/* Create a new, empty token list */
|
|
|
|
{
|
|
|
|
/* Allocate memory for the list structure */
|
|
|
|
TokList* T = Xmalloc (sizeof (TokList));
|
|
|
|
|
|
|
|
/* Initialize the fields */
|
|
|
|
InitTokList (T);
|
|
|
|
|
|
|
|
/* Return the new list */
|
|
|
|
return T;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void FreeTokList (TokList* List)
|
|
|
|
/* Delete the token list including all token nodes */
|
|
|
|
{
|
|
|
|
/* Free the token list */
|
|
|
|
TokNode* T = List->Root;
|
|
|
|
while (T) {
|
|
|
|
TokNode* Tmp = T;
|
|
|
|
T = T->Next;
|
|
|
|
FreeTokNode (Tmp);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Free the list structure itself */
|
|
|
|
Xfree (List);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void AddCurTok (TokList* List)
|
|
|
|
/* Add the current token to the token list */
|
|
|
|
{
|
|
|
|
/* Create a token node with the current token value */
|
|
|
|
TokNode* T = NewTokNode ();
|
|
|
|
|
|
|
|
/* Insert the node into the list */
|
|
|
|
if (List->Root == 0) {
|
|
|
|
List->Root = T;
|
|
|
|
} else {
|
|
|
|
List->Last->Next = T;
|
|
|
|
}
|
|
|
|
List->Last = T;
|
|
|
|
|
|
|
|
/* Count nodes */
|
|
|
|
List->Count++;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|