1 /*****************************************************************************/
5 /* Token list for the ca65 macroassembler */
9 /* (C) 1998 Ullrich von Bassewitz */
11 /* D-70597 Stuttgart */
12 /* EMail: uz@musoftware.de */
15 /* This software is provided 'as-is', without any expressed or implied */
16 /* warranty. In no event will the authors be held liable for any damages */
17 /* arising from the use of this software. */
19 /* Permission is granted to anyone to use this software for any purpose, */
20 /* including commercial applications, and to alter it and redistribute it */
21 /* freely, subject to the following restrictions: */
23 /* 1. The origin of this software must not be misrepresented; you must not */
24 /* claim that you wrote the original software. If you use this software */
25 /* in a product, an acknowledgment in the product documentation would be */
26 /* appreciated but is not required. */
27 /* 2. Altered source versions must be plainly marked as such, and must not */
28 /* be misrepresented as being the original software. */
29 /* 3. This notice may not be removed or altered from any source */
32 /*****************************************************************************/
50 /*****************************************************************************/
52 /*****************************************************************************/
56 TokNode* NewTokNode (void)
57 /* Create and return a token node with the current token value */
62 unsigned Len = TokHasSVal (Tok)? strlen (SVal) : 0;
63 T = xmalloc (sizeof (TokNode) + Len);
65 /* Initialize the token contents */
70 memcpy (T->SVal, SVal, Len);
79 void FreeTokNode (TokNode* T)
80 /* Free the given token node */
87 void TokSet (TokNode* T)
88 /* Set the scanner token from the given token node */
94 strcpy (SVal, T->SVal);
99 enum TC TokCmp (const TokNode* T)
100 /* Compare the token given as parameter against the current token */
103 /* Different token */
107 /* If the token has string attribute, check it */
108 if (TokHasSVal (T->Tok)) {
109 if (strcmp (T->SVal, SVal) != 0) {
112 } else if (TokHasIVal (T->Tok)) {
113 if (T->IVal != IVal) {
118 /* Tokens are identical */
124 void InitTokList (TokList* T)
125 /* Initialize a token list structure for later use */
127 /* Initialize the fields */
140 TokList* NewTokList (void)
141 /* Create a new, empty token list */
143 /* Allocate memory for the list structure */
144 TokList* T = xmalloc (sizeof (TokList));
146 /* Initialize the fields */
149 /* Return the new list */
155 void FreeTokList (TokList* List)
156 /* Delete the token list including all token nodes */
158 /* Free the token list */
159 TokNode* T = List->Root;
166 /* If we have associated data, free it */
171 /* Free the list structure itself */
177 void AddCurTok (TokList* List)
178 /* Add the current token to the token list */
180 /* Create a token node with the current token value */
181 TokNode* T = NewTokNode ();
183 /* Insert the node into the list */
184 if (List->Root == 0) {
187 List->Last->Next = T;
197 static int ReplayTokList (void* List)
198 /* Function that gets the next token from a token list and sets it. This
199 * function may be used together with the PushInput function from the istack
203 /* Cast the generic pointer to an actual list */
206 /* Last may never be a NULL pointer, otherwise there's a bug in the code */
207 CHECK (L->Last != 0);
209 /* Set the next token from the list */
212 /* If a check function is defined, call it, so it may look at the token
213 * just set and changed it as apropriate.
219 /* Set the pointer to the next token */
220 L->Last = L->Last->Next;
222 /* If this was the last token, decrement the repeat counter. If it goes
223 * zero, delete the list and remove the function from the stack.
226 if (++L->RepCount >= L->RepMax) {
227 /* Done with this list */
231 /* Replay one more time */
236 /* We have a token */
242 void PushTokList (TokList* List, const char* Desc)
243 /* Push a token list to be used as input for InputFromStack. This includes
244 * several initializations needed in the token list structure, so don't use
245 * PushInput directly.
248 /* If the list is empty, just delete it and bail out */
249 if (List->Count == 0) {
254 /* Reset the last pointer to the first element */
255 List->Last = List->Root;
257 /* Insert the list specifying our input function */
258 PushInput (ReplayTokList, List, Desc);