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 /*****************************************************************************/
52 /*****************************************************************************/
54 /*****************************************************************************/
58 TokNode* NewTokNode (void)
59 /* Create and return a token node with the current token value */
63 TokNode* N = xmalloc (sizeof (TokNode));
65 /* Initialize the token contents */
68 CopyToken (&N->T, &CurTok);
76 void FreeTokNode (TokNode* N)
77 /* Free the given token node */
85 void TokSet (TokNode* N)
86 /* Set the scanner token from the given token node. */
89 CopyToken (&CurTok, &N->T);
90 SB_Terminate (&CurTok.SVal);
95 enum TC TokCmp (const TokNode* N)
96 /* Compare the token given as parameter against the current token */
98 if (N->T.Tok != CurTok.Tok) {
103 /* If the token has string attribute, check it */
104 if (TokHasSVal (N->T.Tok)) {
105 if (SB_Compare (&CurTok.SVal, &N->T.SVal) != 0) {
108 } else if (TokHasIVal (N->T.Tok)) {
109 if (N->T.IVal != CurTok.IVal) {
114 /* Tokens are identical */
120 void InitTokList (TokList* T)
121 /* Initialize a token list structure for later use */
123 /* Initialize the fields */
136 TokList* NewTokList (void)
137 /* Create a new, empty token list */
139 /* Allocate memory for the list structure */
140 TokList* T = xmalloc (sizeof (TokList));
142 /* Initialize the fields */
145 /* Return the new list */
151 void FreeTokList (TokList* List)
152 /* Delete the token list including all token nodes */
154 /* Free the token list */
155 TokNode* T = List->Root;
162 /* If we have associated data, free it */
167 /* Free the list structure itself */
173 enum token_t GetTokListTerm (enum token_t Term)
174 /* Determine if the following token list is enclosed in curly braces. This is
175 * the case if the next token is the opening brace. If so, skip it and return
176 * a closing brace, otherwise return Term.
179 if (CurTok.Tok == TOK_LCURLY) {
189 void AddCurTok (TokList* List)
190 /* Add the current token to the token list */
192 /* Create a token node with the current token value */
193 TokNode* T = NewTokNode ();
195 /* Insert the node into the list */
196 if (List->Root == 0) {
199 List->Last->Next = T;
209 static int ReplayTokList (void* List)
210 /* Function that gets the next token from a token list and sets it. This
211 * function may be used together with the PushInput function from the istack
215 /* Cast the generic pointer to an actual list */
218 /* Last may never be a NULL pointer, otherwise there's a bug in the code */
219 CHECK (L->Last != 0);
221 /* Set the next token from the list */
224 /* Set the line info for the new token */
227 /* If a check function is defined, call it, so it may look at the token
228 * just set and changed it as apropriate.
234 /* Set the pointer to the next token */
235 L->Last = L->Last->Next;
237 /* If this was the last token, decrement the repeat counter. If it goes
238 * zero, delete the list and remove the function from the stack.
241 if (++L->RepCount >= L->RepMax) {
242 /* Done with this list */
246 /* Replay one more time */
251 /* We have a token */
257 void PushTokList (TokList* List, const char* Desc)
258 /* Push a token list to be used as input for InputFromStack. This includes
259 * several initializations needed in the token list structure, so don't use
260 * PushInput directly.
263 /* If the list is empty, just delete it and bail out */
264 if (List->Count == 0) {
269 /* Reset the last pointer to the first element */
270 List->Last = List->Root;
272 /* Insert the list specifying our input function */
273 PushInput (ReplayTokList, List, Desc);