1 /*****************************************************************************/
5 /* Token list for the ca65 macroassembler */
9 /* (C) 1998-2011, Ullrich von Bassewitz */
10 /* Roemerstrasse 52 */
11 /* D-70794 Filderstadt */
12 /* EMail: uz@cc65.org */
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 /*****************************************************************************/
51 /*****************************************************************************/
53 /*****************************************************************************/
57 TokNode* NewTokNode (void)
58 /* Create and return a token node with the current token value */
62 TokNode* N = xmalloc (sizeof (TokNode));
64 /* Initialize the token contents */
67 CopyToken (&N->T, &CurTok);
75 void FreeTokNode (TokNode* N)
76 /* Free the given token node */
84 void TokSet (TokNode* N)
85 /* Set the scanner token from the given token node */
88 CopyToken (&CurTok, &N->T);
89 SB_Terminate (&CurTok.SVal);
94 enum TC TokCmp (const TokNode* N)
95 /* Compare the token given as parameter against the current token */
97 if (N->T.Tok != CurTok.Tok) {
102 /* If the token has string attribute, check it */
103 if (TokHasSVal (N->T.Tok)) {
104 if (SB_Compare (&CurTok.SVal, &N->T.SVal) != 0) {
107 } else if (TokHasIVal (N->T.Tok)) {
108 if (N->T.IVal != CurTok.IVal) {
113 /* Tokens are identical */
119 void InitTokList (TokList* T)
120 /* Initialize a token list structure for later use */
122 /* Initialize the fields */
135 TokList* NewTokList (void)
136 /* Create a new, empty token list */
138 /* Allocate memory for the list structure */
139 TokList* T = xmalloc (sizeof (TokList));
141 /* Initialize the fields */
144 /* Return the new list */
150 void FreeTokList (TokList* List)
151 /* Delete the token list including all token nodes */
153 /* Free the token list */
154 TokNode* T = List->Root;
161 /* If we have associated data, free it */
166 /* Free the list structure itself */
172 enum token_t GetTokListTerm (enum token_t Term)
173 /* Determine if the following token list is enclosed in curly braces. This is
174 * the case if the next token is the opening brace. If so, skip it and return
175 * a closing brace, otherwise return Term.
178 if (CurTok.Tok == TOK_LCURLY) {
188 void AddCurTok (TokList* List)
189 /* Add the current token to the token list */
191 /* Create a token node with the current token value */
192 TokNode* T = NewTokNode ();
194 /* Insert the node into the list */
195 if (List->Root == 0) {
198 List->Last->Next = T;
208 static int ReplayTokList (void* List)
209 /* Function that gets the next token from a token list and sets it. This
210 * function may be used together with the PushInput function from the istack
214 /* Cast the generic pointer to an actual list */
217 /* Last may never be a NULL pointer, otherwise there's a bug in the code */
218 CHECK (L->Last != 0);
220 /* Set the next token from the list */
223 /* If a check function is defined, call it, so it may look at the token
224 * just set and changed it as apropriate.
230 /* Set the pointer to the next token */
231 L->Last = L->Last->Next;
233 /* If this was the last token, decrement the repeat counter. If it goes
234 * zero, delete the list and remove the function from the stack.
237 if (++L->RepCount >= L->RepMax) {
238 /* Done with this list */
242 /* Replay one more time */
247 /* We have a token */
253 void PushTokList (TokList* List, const char* Desc)
254 /* Push a token list to be used as input for InputFromStack. This includes
255 * several initializations needed in the token list structure, so don't use
256 * PushInput directly.
259 /* If the list is empty, just delete it and bail out */
260 if (List->Count == 0) {
265 /* Reset the last pointer to the first element */
266 List->Last = List->Root;
268 /* Insert the list specifying our input function */
269 PushInput (ReplayTokList, List, Desc);