1 /* ----------------------------------------------------------------------- *
3 * Copyright 1996-2009 The NASM Authors - All Rights Reserved
4 * See the file AUTHORS included with the NASM distribution for
5 * the specific copyright holders.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
19 * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
20 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
29 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
30 * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32 * ----------------------------------------------------------------------- */
35 * preproc.c macro preprocessor for the Netwide Assembler
38 /* Typical flow of text through preproc
40 * pp_getline gets tokenized lines, either
42 * from a macro expansion
46 * read_line gets raw text from stdmacpos, or predef, or current input file
47 * tokenize converts to tokens
50 * expand_mmac_params is used to expand %1 etc., unless a macro is being
51 * defined or a false conditional is being processed
52 * (%0, %1, %+1, %-1, %%foo
54 * do_directive checks for directives
56 * expand_smacro is used to expand single line macros
58 * expand_mmacro is used to expand multi-line macros
60 * detoken is used to convert the line back to text
83 typedef struct SMacro SMacro
;
84 typedef struct MMacro MMacro
;
85 typedef struct MMacroInvocation MMacroInvocation
;
86 typedef struct Context Context
;
87 typedef struct Token Token
;
88 typedef struct Blocks Blocks
;
89 typedef struct Line Line
;
90 typedef struct Include Include
;
91 typedef struct Cond Cond
;
92 typedef struct IncPath IncPath
;
95 * Note on the storage of both SMacro and MMacros: the hash table
96 * indexes them case-insensitively, and we then have to go through a
97 * linked list of potential case aliases (and, for MMacros, parameter
98 * ranges); this is to preserve the matching semantics of the earlier
99 * code. If the number of case aliases for a specific macro is a
100 * performance issue, you may want to reconsider your coding style.
104 * Store the definition of a single-line macro.
116 * Store the definition of a multi-line macro. This is also used to
117 * store the interiors of `%rep...%endrep' blocks, which are
118 * effectively self-re-invoking multi-line macros which simply
119 * don't have a name or bother to appear in the hash tables. %rep
120 * blocks are signified by having a NULL `name' field.
122 * In a MMacro describing a `%rep' block, the `in_progress' field
123 * isn't merely boolean, but gives the number of repeats left to
126 * The `next' field is used for storing MMacros in hash tables; the
127 * `next_active' field is for stacking them on istk entries.
129 * When a MMacro is being expanded, `params', `iline', `nparam',
130 * `paramlen', `rotate' and `unique' are local to the invocation.
134 MMacroInvocation
*prev
; /* previous invocation */
136 int nparam_min
, nparam_max
;
138 bool plus
; /* is the last parameter greedy? */
139 bool nolist
; /* is this macro listing-inhibited? */
140 int64_t in_progress
; /* is this macro currently being expanded? */
141 int64_t max_depth
; /* maximum number of recursive expansions allowed */
142 Token
*dlist
; /* All defaults as one list */
143 Token
**defaults
; /* Parameter default pointers */
144 int ndefs
; /* number of default parameters */
148 MMacro
*rep_nest
; /* used for nesting %rep */
149 Token
**params
; /* actual parameters */
150 Token
*iline
; /* invocation line */
151 unsigned int nparam
, rotate
;
154 int lineno
; /* Current line number on expansion */
158 /* Store the definition of a multi-line macro, as defined in a
159 * previous recursive macro expansion.
161 struct MMacroInvocation
{
162 MMacroInvocation
*prev
; /* previous invocation */
163 Token
**params
; /* actual parameters */
164 Token
*iline
; /* invocation line */
165 unsigned int nparam
, rotate
;
172 * The context stack is composed of a linked list of these.
177 struct hash_table localmac
;
182 * This is the internal form which we break input lines up into.
183 * Typically stored in linked lists.
185 * Note that `type' serves a double meaning: TOK_SMAC_PARAM is not
186 * necessarily used as-is, but is intended to denote the number of
187 * the substituted parameter. So in the definition
189 * %define a(x,y) ( (x) & ~(y) )
191 * the token representing `x' will have its type changed to
192 * TOK_SMAC_PARAM, but the one representing `y' will be
195 * TOK_INTERNAL_STRING is a dirty hack: it's a single string token
196 * which doesn't need quotes around it. Used in the pre-include
197 * mechanism as an alternative to trying to find a sensible type of
198 * quote to use on the filename we were passed.
201 TOK_NONE
= 0, TOK_WHITESPACE
, TOK_COMMENT
, TOK_ID
,
202 TOK_PREPROC_ID
, TOK_STRING
,
203 TOK_NUMBER
, TOK_FLOAT
, TOK_SMAC_END
, TOK_OTHER
,
205 TOK_PREPROC_Q
, TOK_PREPROC_QQ
,
207 TOK_INDIRECT
, /* %[...] */
208 TOK_SMAC_PARAM
, /* MUST BE LAST IN THE LIST!!! */
209 TOK_MAX
= INT_MAX
/* Keep compiler from reducing the range */
216 SMacro
*mac
; /* associated macro for TOK_SMAC_END */
217 size_t len
; /* scratch length field */
218 } a
; /* Auxiliary data */
219 enum pp_token_type type
;
223 * Multi-line macro definitions are stored as a linked list of
224 * these, which is essentially a container to allow several linked
227 * Note that in this module, linked lists are treated as stacks
228 * wherever possible. For this reason, Lines are _pushed_ on to the
229 * `expansion' field in MMacro structures, so that the linked list,
230 * if walked, would give the macro lines in reverse order; this
231 * means that we can walk the list when expanding a macro, and thus
232 * push the lines on to the `expansion' field in _istk_ in reverse
233 * order (so that when popped back off they are in the right
234 * order). It may seem cockeyed, and it relies on my design having
235 * an even number of steps in, but it works...
237 * Some of these structures, rather than being actual lines, are
238 * markers delimiting the end of the expansion of a given macro.
239 * This is for use in the cycle-tracking and %rep-handling code.
240 * Such structures have `finishes' non-NULL, and `first' NULL. All
241 * others have `finishes' NULL, but `first' may still be NULL if
251 * To handle an arbitrary level of file inclusion, we maintain a
252 * stack (ie linked list) of these things.
261 MMacro
*mstk
; /* stack of active macros/reps */
265 * Include search path. This is simply a list of strings which get
266 * prepended, in turn, to the name of an include file, in an
267 * attempt to find the file if it's not in the current directory.
275 * Conditional assembly: we maintain a separate stack of these for
276 * each level of file inclusion. (The only reason we keep the
277 * stacks separate is to ensure that a stray `%endif' in a file
278 * included from within the true branch of a `%if' won't terminate
279 * it and cause confusion: instead, rightly, it'll cause an error.)
287 * These states are for use just after %if or %elif: IF_TRUE
288 * means the condition has evaluated to truth so we are
289 * currently emitting, whereas IF_FALSE means we are not
290 * currently emitting but will start doing so if a %else comes
291 * up. In these states, all directives are admissible: %elif,
292 * %else and %endif. (And of course %if.)
294 COND_IF_TRUE
, COND_IF_FALSE
,
296 * These states come up after a %else: ELSE_TRUE means we're
297 * emitting, and ELSE_FALSE means we're not. In ELSE_* states,
298 * any %elif or %else will cause an error.
300 COND_ELSE_TRUE
, COND_ELSE_FALSE
,
302 * These states mean that we're not emitting now, and also that
303 * nothing until %endif will be emitted at all. COND_DONE is
304 * used when we've had our moment of emission
305 * and have now started seeing %elifs. COND_NEVER is used when
306 * the condition construct in question is contained within a
307 * non-emitting branch of a larger condition construct,
308 * or if there is an error.
310 COND_DONE
, COND_NEVER
312 #define emitting(x) ( (x) == COND_IF_TRUE || (x) == COND_ELSE_TRUE )
315 * These defines are used as the possible return values for do_directive
317 #define NO_DIRECTIVE_FOUND 0
318 #define DIRECTIVE_FOUND 1
321 * Condition codes. Note that we use c_ prefix not C_ because C_ is
322 * used in nasm.h for the "real" condition codes. At _this_ level,
323 * we treat CXZ and ECXZ as condition codes, albeit non-invertible
324 * ones, so we need a different enum...
326 static const char * const conditions
[] = {
327 "a", "ae", "b", "be", "c", "cxz", "e", "ecxz", "g", "ge", "l", "le",
328 "na", "nae", "nb", "nbe", "nc", "ne", "ng", "nge", "nl", "nle", "no",
329 "np", "ns", "nz", "o", "p", "pe", "po", "rcxz", "s", "z"
332 c_A
, c_AE
, c_B
, c_BE
, c_C
, c_CXZ
, c_E
, c_ECXZ
, c_G
, c_GE
, c_L
, c_LE
,
333 c_NA
, c_NAE
, c_NB
, c_NBE
, c_NC
, c_NE
, c_NG
, c_NGE
, c_NL
, c_NLE
, c_NO
,
334 c_NP
, c_NS
, c_NZ
, c_O
, c_P
, c_PE
, c_PO
, c_RCXZ
, c_S
, c_Z
,
337 static const enum pp_conds inverse_ccs
[] = {
338 c_NA
, c_NAE
, c_NB
, c_NBE
, c_NC
, -1, c_NE
, -1, c_NG
, c_NGE
, c_NL
, c_NLE
,
339 c_A
, c_AE
, c_B
, c_BE
, c_C
, c_E
, c_G
, c_GE
, c_L
, c_LE
, c_O
, c_P
, c_S
,
340 c_Z
, c_NO
, c_NP
, c_PO
, c_PE
, -1, c_NS
, c_NZ
346 /* If this is a an IF, ELIF, ELSE or ENDIF keyword */
347 static int is_condition(enum preproc_token arg
)
349 return PP_IS_COND(arg
) || (arg
== PP_ELSE
) || (arg
== PP_ENDIF
);
352 /* For TASM compatibility we need to be able to recognise TASM compatible
353 * conditional compilation directives. Using the NASM pre-processor does
354 * not work, so we look for them specifically from the following list and
355 * then jam in the equivalent NASM directive into the input stream.
359 TM_ARG
, TM_ELIF
, TM_ELSE
, TM_ENDIF
, TM_IF
, TM_IFDEF
, TM_IFDIFI
,
360 TM_IFNDEF
, TM_INCLUDE
, TM_LOCAL
363 static const char * const tasm_directives
[] = {
364 "arg", "elif", "else", "endif", "if", "ifdef", "ifdifi",
365 "ifndef", "include", "local"
368 static int StackSize
= 4;
369 static char *StackPointer
= "ebp";
370 static int ArgOffset
= 8;
371 static int LocalOffset
= 0;
373 static Context
*cstk
;
374 static Include
*istk
;
375 static IncPath
*ipath
= NULL
;
377 static efunc _error
; /* Pointer to client-provided error reporting function */
378 static evalfunc evaluate
;
380 static int pass
; /* HACK: pass 0 = generate dependencies only */
381 static StrList
**dephead
, **deptail
; /* Dependency list */
383 static uint64_t unique
; /* unique identifier numbers */
385 static Line
*predef
= NULL
;
386 static bool do_predef
;
388 static ListGen
*list
;
391 * The current set of multi-line macros we have defined.
393 static struct hash_table mmacros
;
396 * The current set of single-line macros we have defined.
398 static struct hash_table smacros
;
401 * The multi-line macro we are currently defining, or the %rep
402 * block we are currently reading, if any.
404 static MMacro
*defining
;
406 static uint64_t nested_mac_count
;
407 static uint64_t nested_rep_count
;
410 * The number of macro parameters to allocate space for at a time.
412 #define PARAM_DELTA 16
415 * The standard macro set: defined in macros.c in the array nasm_stdmac.
416 * This gives our position in the macro set, when we're processing it.
418 static macros_t
*stdmacpos
;
421 * The extra standard macros that come from the object format, if
424 static macros_t
*extrastdmac
= NULL
;
425 static bool any_extrastdmac
;
428 * Tokens are allocated in blocks to improve speed
430 #define TOKEN_BLOCKSIZE 4096
431 static Token
*freeTokens
= NULL
;
437 static Blocks blocks
= { NULL
, NULL
};
440 * Forward declarations.
442 static Token
*expand_mmac_params(Token
* tline
);
443 static Token
*expand_smacro(Token
* tline
);
444 static Token
*expand_id(Token
* tline
);
445 static Context
*get_ctx(const char *name
, const char **namep
,
447 static void make_tok_num(Token
* tok
, int64_t val
);
448 static void error(int severity
, const char *fmt
, ...);
449 static void error_precond(int severity
, const char *fmt
, ...);
450 static void *new_Block(size_t size
);
451 static void delete_Blocks(void);
452 static Token
*new_Token(Token
* next
, enum pp_token_type type
,
453 const char *text
, int txtlen
);
454 static Token
*delete_Token(Token
* t
);
457 * Macros for safe checking of token pointers, avoid *(NULL)
459 #define tok_type_(x,t) ((x) && (x)->type == (t))
460 #define skip_white_(x) if (tok_type_((x), TOK_WHITESPACE)) (x)=(x)->next
461 #define tok_is_(x,v) (tok_type_((x), TOK_OTHER) && !strcmp((x)->text,(v)))
462 #define tok_isnt_(x,v) ((x) && ((x)->type!=TOK_OTHER || strcmp((x)->text,(v))))
464 /* Handle TASM specific directives, which do not contain a % in
465 * front of them. We do it here because I could not find any other
466 * place to do it for the moment, and it is a hack (ideally it would
467 * be nice to be able to use the NASM pre-processor to do it).
469 static char *check_tasm_directive(char *line
)
471 int32_t i
, j
, k
, m
, len
;
472 char *p
= line
, *oldline
, oldchar
;
474 /* Skip whitespace */
475 while (nasm_isspace(*p
) && *p
!= 0)
478 /* Binary search for the directive name */
480 j
= elements(tasm_directives
);
482 while (!nasm_isspace(p
[len
]) && p
[len
] != 0)
489 m
= nasm_stricmp(p
, tasm_directives
[k
]);
491 /* We have found a directive, so jam a % in front of it
492 * so that NASM will then recognise it as one if it's own.
497 line
= nasm_malloc(len
+ 2);
499 if (k
== TM_IFDIFI
) {
501 * NASM does not recognise IFDIFI, so we convert
502 * it to %if 0. This is not used in NASM
503 * compatible code, but does need to parse for the
504 * TASM macro package.
506 strcpy(line
+ 1, "if 0");
508 memcpy(line
+ 1, p
, len
+ 1);
523 * The pre-preprocessing stage... This function translates line
524 * number indications as they emerge from GNU cpp (`# lineno "file"
525 * flags') into NASM preprocessor line number indications (`%line
528 static char *prepreproc(char *line
)
531 char *fname
, *oldline
;
533 if (line
[0] == '#' && line
[1] == ' ') {
536 lineno
= atoi(fname
);
537 fname
+= strspn(fname
, "0123456789 ");
540 fnlen
= strcspn(fname
, "\"");
541 line
= nasm_malloc(20 + fnlen
);
542 snprintf(line
, 20 + fnlen
, "%%line %d %.*s", lineno
, fnlen
, fname
);
545 if (tasm_compatible_mode
)
546 return check_tasm_directive(line
);
551 * Free a linked list of tokens.
553 static void free_tlist(Token
* list
)
556 list
= delete_Token(list
);
561 * Free a linked list of lines.
563 static void free_llist(Line
* list
)
569 free_tlist(l
->first
);
577 static void free_mmacro(MMacro
* m
)
580 free_tlist(m
->dlist
);
581 nasm_free(m
->defaults
);
582 free_llist(m
->expansion
);
587 * Free all currently defined macros, and free the hash tables
589 static void free_smacro_table(struct hash_table
*smt
)
593 struct hash_tbl_node
*it
= NULL
;
595 while ((s
= hash_iterate(smt
, &it
, &key
)) != NULL
) {
596 nasm_free((void *)key
);
598 SMacro
*ns
= s
->next
;
600 free_tlist(s
->expansion
);
608 static void free_mmacro_table(struct hash_table
*mmt
)
612 struct hash_tbl_node
*it
= NULL
;
615 while ((m
= hash_iterate(mmt
, &it
, &key
)) != NULL
) {
616 nasm_free((void *)key
);
618 MMacro
*nm
= m
->next
;
626 static void free_macros(void)
628 free_smacro_table(&smacros
);
629 free_mmacro_table(&mmacros
);
633 * Initialize the hash tables
635 static void init_macros(void)
637 hash_init(&smacros
, HASH_LARGE
);
638 hash_init(&mmacros
, HASH_LARGE
);
642 * Pop the context stack.
644 static void ctx_pop(void)
649 free_smacro_table(&c
->localmac
);
655 * Search for a key in the hash index; adding it if necessary
656 * (in which case we initialize the data pointer to NULL.)
659 hash_findi_add(struct hash_table
*hash
, const char *str
)
661 struct hash_insert hi
;
665 r
= hash_findi(hash
, str
, &hi
);
669 strx
= nasm_strdup(str
); /* Use a more efficient allocator here? */
670 return hash_add(&hi
, strx
, NULL
);
674 * Like hash_findi, but returns the data element rather than a pointer
675 * to it. Used only when not adding a new element, hence no third
679 hash_findix(struct hash_table
*hash
, const char *str
)
683 p
= hash_findi(hash
, str
, NULL
);
684 return p
? *p
: NULL
;
687 #define BUF_DELTA 512
689 * Read a line from the top file in istk, handling multiple CR/LFs
690 * at the end of the line read, and handling spurious ^Zs. Will
691 * return lines from the standard macro set if this has not already
694 static char *read_line(void)
696 char *buffer
, *p
, *q
;
697 int bufsize
, continued_count
;
701 const unsigned char *p
= stdmacpos
;
706 len
+= pp_directives_len
[c
-0x80]+1;
710 ret
= nasm_malloc(len
+1);
712 while ((c
= *stdmacpos
++)) {
714 memcpy(q
, pp_directives
[c
-0x80], pp_directives_len
[c
-0x80]);
715 q
+= pp_directives_len
[c
-0x80];
725 /* This was the last of the standard macro chain... */
727 if (any_extrastdmac
) {
728 stdmacpos
= extrastdmac
;
729 any_extrastdmac
= false;
730 } else if (do_predef
) {
732 Token
*head
, **tail
, *t
;
735 * Nasty hack: here we push the contents of
736 * `predef' on to the top-level expansion stack,
737 * since this is the most convenient way to
738 * implement the pre-include and pre-define
741 for (pd
= predef
; pd
; pd
= pd
->next
) {
744 for (t
= pd
->first
; t
; t
= t
->next
) {
745 *tail
= new_Token(NULL
, t
->type
, t
->text
, 0);
746 tail
= &(*tail
)->next
;
748 l
= nasm_malloc(sizeof(Line
));
749 l
->next
= istk
->expansion
;
761 buffer
= nasm_malloc(BUF_DELTA
);
765 q
= fgets(p
, bufsize
- (p
- buffer
), istk
->fp
);
769 if (p
> buffer
&& p
[-1] == '\n') {
770 /* Convert backslash-CRLF line continuation sequences into
771 nothing at all (for DOS and Windows) */
772 if (((p
- 2) > buffer
) && (p
[-3] == '\\') && (p
[-2] == '\r')) {
777 /* Also convert backslash-LF line continuation sequences into
778 nothing at all (for Unix) */
779 else if (((p
- 1) > buffer
) && (p
[-2] == '\\')) {
787 if (p
- buffer
> bufsize
- 10) {
788 int32_t offset
= p
- buffer
;
789 bufsize
+= BUF_DELTA
;
790 buffer
= nasm_realloc(buffer
, bufsize
);
791 p
= buffer
+ offset
; /* prevent stale-pointer problems */
795 if (!q
&& p
== buffer
) {
800 src_set_linnum(src_get_linnum() + istk
->lineinc
+
801 (continued_count
* istk
->lineinc
));
804 * Play safe: remove CRs as well as LFs, if any of either are
805 * present at the end of the line.
807 while (--p
>= buffer
&& (*p
== '\n' || *p
== '\r'))
811 * Handle spurious ^Z, which may be inserted into source files
812 * by some file transfer utilities.
814 buffer
[strcspn(buffer
, "\032")] = '\0';
816 list
->line(LIST_READ
, buffer
);
822 * Tokenize a line of text. This is a very simple process since we
823 * don't need to parse the value out of e.g. numeric tokens: we
824 * simply split one string into many.
826 static Token
*tokenize(char *line
)
829 enum pp_token_type type
;
831 Token
*t
, **tail
= &list
;
837 if (*p
== '+' && !nasm_isdigit(p
[1])) {
840 } else if (nasm_isdigit(*p
) ||
841 ((*p
== '-' || *p
== '+') && nasm_isdigit(p
[1]))) {
845 while (nasm_isdigit(*p
));
846 type
= TOK_PREPROC_ID
;
847 } else if (*p
== '{') {
849 while (*p
&& *p
!= '}') {
856 type
= TOK_PREPROC_ID
;
857 } else if (*p
== '[') {
859 line
+= 2; /* Skip the leading %[ */
861 while (lvl
&& (c
= *p
++)) {
873 p
= nasm_skip_string(p
)+1;
883 error(ERR_NONFATAL
, "unterminated %[ construct");
885 } else if (*p
== '?') {
886 type
= TOK_PREPROC_Q
; /* %? */
889 type
= TOK_PREPROC_QQ
; /* %?? */
892 } else if (isidchar(*p
) ||
893 ((*p
== '!' || *p
== '%' || *p
== '$') &&
898 while (isidchar(*p
));
899 type
= TOK_PREPROC_ID
;
905 } else if (isidstart(*p
) || (*p
== '$' && isidstart(p
[1]))) {
908 while (*p
&& isidchar(*p
))
910 } else if (*p
== '\'' || *p
== '"' || *p
== '`') {
915 p
= nasm_skip_string(p
);
920 error(ERR_WARNING
|ERR_PASS1
, "unterminated string");
921 /* Handling unterminated strings by UNV */
924 } else if (p
[0] == '$' && p
[1] == '$') {
925 type
= TOK_OTHER
; /* TOKEN_BASE */
927 } else if (isnumstart(*p
)) {
929 bool is_float
= false;
945 if (!is_hex
&& (c
== 'e' || c
== 'E')) {
947 if (*p
== '+' || *p
== '-') {
948 /* e can only be followed by +/- if it is either a
949 prefixed hex number or a floating-point number */
953 } else if (c
== 'H' || c
== 'h' || c
== 'X' || c
== 'x') {
955 } else if (c
== 'P' || c
== 'p') {
957 if (*p
== '+' || *p
== '-')
959 } else if (isnumchar(c
) || c
== '_')
962 /* we need to deal with consequences of the legacy
963 parser, like "1.nolist" being two tokens
964 (TOK_NUMBER, TOK_ID) here; at least give it
965 a shot for now. In the future, we probably need
966 a flex-based scanner with proper pattern matching
967 to do it as well as it can be done. Nothing in
968 the world is going to help the person who wants
969 0x123.p16 interpreted as two tokens, though. */
974 if (nasm_isdigit(*r
) || (is_hex
&& nasm_isxdigit(*r
)) ||
975 (!is_hex
&& (*r
== 'e' || *r
== 'E')) ||
976 (*r
== 'p' || *r
== 'P')) {
980 break; /* Terminate the token */
984 p
--; /* Point to first character beyond number */
986 if (p
== line
+1 && *line
== '$') {
987 type
= TOK_OTHER
; /* TOKEN_HERE */
989 if (has_e
&& !is_hex
) {
990 /* 1e13 is floating-point, but 1e13h is not */
994 type
= is_float
? TOK_FLOAT
: TOK_NUMBER
;
996 } else if (nasm_isspace(*p
)) {
997 type
= TOK_WHITESPACE
;
999 while (*p
&& nasm_isspace(*p
))
1002 * Whitespace just before end-of-line is discarded by
1003 * pretending it's a comment; whitespace just before a
1004 * comment gets lumped into the comment.
1006 if (!*p
|| *p
== ';') {
1011 } else if (*p
== ';') {
1017 * Anything else is an operator of some kind. We check
1018 * for all the double-character operators (>>, <<, //,
1019 * %%, <=, >=, ==, !=, <>, &&, ||, ^^), but anything
1020 * else is a single-character operator.
1023 if ((p
[0] == '>' && p
[1] == '>') ||
1024 (p
[0] == '<' && p
[1] == '<') ||
1025 (p
[0] == '/' && p
[1] == '/') ||
1026 (p
[0] == '<' && p
[1] == '=') ||
1027 (p
[0] == '>' && p
[1] == '=') ||
1028 (p
[0] == '=' && p
[1] == '=') ||
1029 (p
[0] == '!' && p
[1] == '=') ||
1030 (p
[0] == '<' && p
[1] == '>') ||
1031 (p
[0] == '&' && p
[1] == '&') ||
1032 (p
[0] == '|' && p
[1] == '|') ||
1033 (p
[0] == '^' && p
[1] == '^')) {
1039 /* Handling unterminated string by UNV */
1042 *tail = t = new_Token(NULL, TOK_STRING, line, p-line+1);
1043 t->text[p-line] = *line;
1047 if (type
!= TOK_COMMENT
) {
1048 *tail
= t
= new_Token(NULL
, type
, line
, p
- line
);
1057 * this function allocates a new managed block of memory and
1058 * returns a pointer to the block. The managed blocks are
1059 * deleted only all at once by the delete_Blocks function.
1061 static void *new_Block(size_t size
)
1063 Blocks
*b
= &blocks
;
1065 /* first, get to the end of the linked list */
1068 /* now allocate the requested chunk */
1069 b
->chunk
= nasm_malloc(size
);
1071 /* now allocate a new block for the next request */
1072 b
->next
= nasm_malloc(sizeof(Blocks
));
1073 /* and initialize the contents of the new block */
1074 b
->next
->next
= NULL
;
1075 b
->next
->chunk
= NULL
;
1080 * this function deletes all managed blocks of memory
1082 static void delete_Blocks(void)
1084 Blocks
*a
, *b
= &blocks
;
1087 * keep in mind that the first block, pointed to by blocks
1088 * is a static and not dynamically allocated, so we don't
1093 nasm_free(b
->chunk
);
1102 * this function creates a new Token and passes a pointer to it
1103 * back to the caller. It sets the type and text elements, and
1104 * also the a.mac and next elements to NULL.
1106 static Token
*new_Token(Token
* next
, enum pp_token_type type
,
1107 const char *text
, int txtlen
)
1112 if (freeTokens
== NULL
) {
1113 freeTokens
= (Token
*) new_Block(TOKEN_BLOCKSIZE
* sizeof(Token
));
1114 for (i
= 0; i
< TOKEN_BLOCKSIZE
- 1; i
++)
1115 freeTokens
[i
].next
= &freeTokens
[i
+ 1];
1116 freeTokens
[i
].next
= NULL
;
1119 freeTokens
= t
->next
;
1123 if (type
== TOK_WHITESPACE
|| text
== NULL
) {
1127 txtlen
= strlen(text
);
1128 t
->text
= nasm_malloc(txtlen
+1);
1129 memcpy(t
->text
, text
, txtlen
);
1130 t
->text
[txtlen
] = '\0';
1135 static Token
*delete_Token(Token
* t
)
1137 Token
*next
= t
->next
;
1139 t
->next
= freeTokens
;
1145 * Convert a line of tokens back into text.
1146 * If expand_locals is not zero, identifiers of the form "%$*xxx"
1147 * will be transformed into ..@ctxnum.xxx
1149 static char *detoken(Token
* tlist
, bool expand_locals
)
1157 for (t
= tlist
; t
; t
= t
->next
) {
1158 if (t
->type
== TOK_PREPROC_ID
&& t
->text
[1] == '!') {
1159 char *p
= getenv(t
->text
+ 2);
1162 t
->text
= nasm_strdup(p
);
1166 /* Expand local macros here and not during preprocessing */
1167 if (expand_locals
&&
1168 t
->type
== TOK_PREPROC_ID
&& t
->text
&&
1169 t
->text
[0] == '%' && t
->text
[1] == '$') {
1172 Context
*ctx
= get_ctx(t
->text
, &q
, false);
1175 snprintf(buffer
, sizeof(buffer
), "..@%"PRIu32
".", ctx
->number
);
1176 p
= nasm_strcat(buffer
, q
);
1181 if (t
->type
== TOK_WHITESPACE
) {
1183 } else if (t
->text
) {
1184 len
+= strlen(t
->text
);
1187 p
= line
= nasm_malloc(len
+ 1);
1188 for (t
= tlist
; t
; t
= t
->next
) {
1189 if (t
->type
== TOK_WHITESPACE
) {
1191 } else if (t
->text
) {
1202 * A scanner, suitable for use by the expression evaluator, which
1203 * operates on a line of Tokens. Expects a pointer to a pointer to
1204 * the first token in the line to be passed in as its private_data
1207 * FIX: This really needs to be unified with stdscan.
1209 static int ppscan(void *private_data
, struct tokenval
*tokval
)
1211 Token
**tlineptr
= private_data
;
1213 char ourcopy
[MAX_KEYWORD
+1], *p
, *r
, *s
;
1217 *tlineptr
= tline
? tline
->next
: NULL
;
1219 while (tline
&& (tline
->type
== TOK_WHITESPACE
||
1220 tline
->type
== TOK_COMMENT
));
1223 return tokval
->t_type
= TOKEN_EOS
;
1225 tokval
->t_charptr
= tline
->text
;
1227 if (tline
->text
[0] == '$' && !tline
->text
[1])
1228 return tokval
->t_type
= TOKEN_HERE
;
1229 if (tline
->text
[0] == '$' && tline
->text
[1] == '$' && !tline
->text
[2])
1230 return tokval
->t_type
= TOKEN_BASE
;
1232 if (tline
->type
== TOK_ID
) {
1233 p
= tokval
->t_charptr
= tline
->text
;
1235 tokval
->t_charptr
++;
1236 return tokval
->t_type
= TOKEN_ID
;
1239 for (r
= p
, s
= ourcopy
; *r
; r
++) {
1240 if (r
>= p
+MAX_KEYWORD
)
1241 return tokval
->t_type
= TOKEN_ID
; /* Not a keyword */
1242 *s
++ = nasm_tolower(*r
);
1245 /* right, so we have an identifier sitting in temp storage. now,
1246 * is it actually a register or instruction name, or what? */
1247 return nasm_token_hash(ourcopy
, tokval
);
1250 if (tline
->type
== TOK_NUMBER
) {
1252 tokval
->t_integer
= readnum(tline
->text
, &rn_error
);
1253 tokval
->t_charptr
= tline
->text
;
1255 return tokval
->t_type
= TOKEN_ERRNUM
;
1257 return tokval
->t_type
= TOKEN_NUM
;
1260 if (tline
->type
== TOK_FLOAT
) {
1261 return tokval
->t_type
= TOKEN_FLOAT
;
1264 if (tline
->type
== TOK_STRING
) {
1267 bq
= tline
->text
[0];
1268 tokval
->t_charptr
= tline
->text
;
1269 tokval
->t_inttwo
= nasm_unquote(tline
->text
, &ep
);
1271 if (ep
[0] != bq
|| ep
[1] != '\0')
1272 return tokval
->t_type
= TOKEN_ERRSTR
;
1274 return tokval
->t_type
= TOKEN_STR
;
1277 if (tline
->type
== TOK_OTHER
) {
1278 if (!strcmp(tline
->text
, "<<"))
1279 return tokval
->t_type
= TOKEN_SHL
;
1280 if (!strcmp(tline
->text
, ">>"))
1281 return tokval
->t_type
= TOKEN_SHR
;
1282 if (!strcmp(tline
->text
, "//"))
1283 return tokval
->t_type
= TOKEN_SDIV
;
1284 if (!strcmp(tline
->text
, "%%"))
1285 return tokval
->t_type
= TOKEN_SMOD
;
1286 if (!strcmp(tline
->text
, "=="))
1287 return tokval
->t_type
= TOKEN_EQ
;
1288 if (!strcmp(tline
->text
, "<>"))
1289 return tokval
->t_type
= TOKEN_NE
;
1290 if (!strcmp(tline
->text
, "!="))
1291 return tokval
->t_type
= TOKEN_NE
;
1292 if (!strcmp(tline
->text
, "<="))
1293 return tokval
->t_type
= TOKEN_LE
;
1294 if (!strcmp(tline
->text
, ">="))
1295 return tokval
->t_type
= TOKEN_GE
;
1296 if (!strcmp(tline
->text
, "&&"))
1297 return tokval
->t_type
= TOKEN_DBL_AND
;
1298 if (!strcmp(tline
->text
, "^^"))
1299 return tokval
->t_type
= TOKEN_DBL_XOR
;
1300 if (!strcmp(tline
->text
, "||"))
1301 return tokval
->t_type
= TOKEN_DBL_OR
;
1305 * We have no other options: just return the first character of
1308 return tokval
->t_type
= tline
->text
[0];
1312 * Compare a string to the name of an existing macro; this is a
1313 * simple wrapper which calls either strcmp or nasm_stricmp
1314 * depending on the value of the `casesense' parameter.
1316 static int mstrcmp(const char *p
, const char *q
, bool casesense
)
1318 return casesense
? strcmp(p
, q
) : nasm_stricmp(p
, q
);
1322 * Compare a string to the name of an existing macro; this is a
1323 * simple wrapper which calls either strcmp or nasm_stricmp
1324 * depending on the value of the `casesense' parameter.
1326 static int mmemcmp(const char *p
, const char *q
, size_t l
, bool casesense
)
1328 return casesense
? memcmp(p
, q
, l
) : nasm_memicmp(p
, q
, l
);
1332 * Return the Context structure associated with a %$ token. Return
1333 * NULL, having _already_ reported an error condition, if the
1334 * context stack isn't deep enough for the supplied number of $
1336 * If all_contexts == true, contexts that enclose current are
1337 * also scanned for such smacro, until it is found; if not -
1338 * only the context that directly results from the number of $'s
1339 * in variable's name.
1341 * If "namep" is non-NULL, set it to the pointer to the macro name
1342 * tail, i.e. the part beyond %$...
1344 static Context
*get_ctx(const char *name
, const char **namep
,
1354 if (!name
|| name
[0] != '%' || name
[1] != '$')
1358 error(ERR_NONFATAL
, "`%s': context stack is empty", name
);
1365 while (ctx
&& *name
== '$') {
1371 error(ERR_NONFATAL
, "`%s': context stack is only"
1372 " %d level%s deep", name
, i
, (i
== 1 ? "" : "s"));
1383 /* Search for this smacro in found context */
1384 m
= hash_findix(&ctx
->localmac
, name
);
1386 if (!mstrcmp(m
->name
, name
, m
->casesense
))
1397 * Check to see if a file is already in a string list
1399 static bool in_list(const StrList
*list
, const char *str
)
1402 if (!strcmp(list
->str
, str
))
1410 * Open an include file. This routine must always return a valid
1411 * file pointer if it returns - it's responsible for throwing an
1412 * ERR_FATAL and bombing out completely if not. It should also try
1413 * the include path one by one until it finds the file or reaches
1414 * the end of the path.
1416 static FILE *inc_fopen(const char *file
, StrList
**dhead
, StrList
***dtail
,
1421 IncPath
*ip
= ipath
;
1422 int len
= strlen(file
);
1423 size_t prefix_len
= 0;
1427 sl
= nasm_malloc(prefix_len
+len
+1+sizeof sl
->next
);
1428 memcpy(sl
->str
, prefix
, prefix_len
);
1429 memcpy(sl
->str
+prefix_len
, file
, len
+1);
1430 fp
= fopen(sl
->str
, "r");
1431 if (fp
&& dhead
&& !in_list(*dhead
, sl
->str
)) {
1449 prefix_len
= strlen(prefix
);
1451 /* -MG given and file not found */
1452 if (dhead
&& !in_list(*dhead
, file
)) {
1453 sl
= nasm_malloc(len
+1+sizeof sl
->next
);
1455 strcpy(sl
->str
, file
);
1463 error(ERR_FATAL
, "unable to open include file `%s'", file
);
1464 return NULL
; /* never reached - placate compilers */
1468 * Determine if we should warn on defining a single-line macro of
1469 * name `name', with `nparam' parameters. If nparam is 0 or -1, will
1470 * return true if _any_ single-line macro of that name is defined.
1471 * Otherwise, will return true if a single-line macro with either
1472 * `nparam' or no parameters is defined.
1474 * If a macro with precisely the right number of parameters is
1475 * defined, or nparam is -1, the address of the definition structure
1476 * will be returned in `defn'; otherwise NULL will be returned. If `defn'
1477 * is NULL, no action will be taken regarding its contents, and no
1480 * Note that this is also called with nparam zero to resolve
1483 * If you already know which context macro belongs to, you can pass
1484 * the context pointer as first parameter; if you won't but name begins
1485 * with %$ the context will be automatically computed. If all_contexts
1486 * is true, macro will be searched in outer contexts as well.
1489 smacro_defined(Context
* ctx
, const char *name
, int nparam
, SMacro
** defn
,
1492 struct hash_table
*smtbl
;
1496 smtbl
= &ctx
->localmac
;
1497 } else if (name
[0] == '%' && name
[1] == '$') {
1499 ctx
= get_ctx(name
, &name
, false);
1501 return false; /* got to return _something_ */
1502 smtbl
= &ctx
->localmac
;
1506 m
= (SMacro
*) hash_findix(smtbl
, name
);
1509 if (!mstrcmp(m
->name
, name
, m
->casesense
&& nocase
) &&
1510 (nparam
<= 0 || m
->nparam
== 0 || nparam
== (int) m
->nparam
)) {
1512 if (nparam
== (int) m
->nparam
|| nparam
== -1)
1526 * Count and mark off the parameters in a multi-line macro call.
1527 * This is called both from within the multi-line macro expansion
1528 * code, and also to mark off the default parameters when provided
1529 * in a %macro definition line.
1531 static void count_mmac_params(Token
* t
, int *nparam
, Token
*** params
)
1533 int paramsize
, brace
;
1535 *nparam
= paramsize
= 0;
1538 /* +1: we need space for the final NULL */
1539 if (*nparam
+1 >= paramsize
) {
1540 paramsize
+= PARAM_DELTA
;
1541 *params
= nasm_realloc(*params
, sizeof(**params
) * paramsize
);
1545 if (tok_is_(t
, "{"))
1547 (*params
)[(*nparam
)++] = t
;
1548 while (tok_isnt_(t
, brace
? "}" : ","))
1550 if (t
) { /* got a comma/brace */
1554 * Now we've found the closing brace, look further
1558 if (tok_isnt_(t
, ",")) {
1560 "braces do not enclose all of macro parameter");
1561 while (tok_isnt_(t
, ","))
1565 t
= t
->next
; /* eat the comma */
1572 * Determine whether one of the various `if' conditions is true or
1575 * We must free the tline we get passed.
1577 static bool if_condition(Token
* tline
, enum preproc_token ct
)
1579 enum pp_conditional i
= PP_COND(ct
);
1581 Token
*t
, *tt
, **tptr
, *origline
;
1582 struct tokenval tokval
;
1584 enum pp_token_type needtype
;
1590 j
= false; /* have we matched yet? */
1595 if (tline
->type
!= TOK_ID
) {
1597 "`%s' expects context identifiers", pp_directives
[ct
]);
1598 free_tlist(origline
);
1601 if (cstk
&& cstk
->name
&& !nasm_stricmp(tline
->text
, cstk
->name
))
1603 tline
= tline
->next
;
1608 j
= false; /* have we matched yet? */
1611 if (!tline
|| (tline
->type
!= TOK_ID
&&
1612 (tline
->type
!= TOK_PREPROC_ID
||
1613 tline
->text
[1] != '$'))) {
1615 "`%s' expects macro identifiers", pp_directives
[ct
]);
1618 if (smacro_defined(NULL
, tline
->text
, 0, NULL
, true))
1620 tline
= tline
->next
;
1626 tline
= expand_smacro(tline
);
1628 while (tok_isnt_(tt
, ","))
1632 "`%s' expects two comma-separated arguments",
1637 j
= true; /* assume equality unless proved not */
1638 while ((t
->type
!= TOK_OTHER
|| strcmp(t
->text
, ",")) && tt
) {
1639 if (tt
->type
== TOK_OTHER
&& !strcmp(tt
->text
, ",")) {
1640 error(ERR_NONFATAL
, "`%s': more than one comma on line",
1644 if (t
->type
== TOK_WHITESPACE
) {
1648 if (tt
->type
== TOK_WHITESPACE
) {
1652 if (tt
->type
!= t
->type
) {
1653 j
= false; /* found mismatching tokens */
1656 /* When comparing strings, need to unquote them first */
1657 if (t
->type
== TOK_STRING
) {
1658 size_t l1
= nasm_unquote(t
->text
, NULL
);
1659 size_t l2
= nasm_unquote(tt
->text
, NULL
);
1665 if (mmemcmp(t
->text
, tt
->text
, l1
, i
== PPC_IFIDN
)) {
1669 } else if (mstrcmp(tt
->text
, t
->text
, i
== PPC_IFIDN
) != 0) {
1670 j
= false; /* found mismatching tokens */
1677 if ((t
->type
!= TOK_OTHER
|| strcmp(t
->text
, ",")) || tt
)
1678 j
= false; /* trailing gunk on one end or other */
1684 MMacro searching
, *mmac
;
1687 tline
= expand_id(tline
);
1688 if (!tok_type_(tline
, TOK_ID
)) {
1690 "`%s' expects a macro name", pp_directives
[ct
]);
1693 searching
.name
= nasm_strdup(tline
->text
);
1694 searching
.casesense
= true;
1695 searching
.plus
= false;
1696 searching
.nolist
= false;
1697 searching
.in_progress
= 0;
1698 searching
.max_depth
= 0;
1699 searching
.rep_nest
= NULL
;
1700 searching
.nparam_min
= 0;
1701 searching
.nparam_max
= INT_MAX
;
1702 tline
= expand_smacro(tline
->next
);
1705 } else if (!tok_type_(tline
, TOK_NUMBER
)) {
1707 "`%s' expects a parameter count or nothing",
1710 searching
.nparam_min
= searching
.nparam_max
=
1711 readnum(tline
->text
, &j
);
1714 "unable to parse parameter count `%s'",
1717 if (tline
&& tok_is_(tline
->next
, "-")) {
1718 tline
= tline
->next
->next
;
1719 if (tok_is_(tline
, "*"))
1720 searching
.nparam_max
= INT_MAX
;
1721 else if (!tok_type_(tline
, TOK_NUMBER
))
1723 "`%s' expects a parameter count after `-'",
1726 searching
.nparam_max
= readnum(tline
->text
, &j
);
1729 "unable to parse parameter count `%s'",
1731 if (searching
.nparam_min
> searching
.nparam_max
)
1733 "minimum parameter count exceeds maximum");
1736 if (tline
&& tok_is_(tline
->next
, "+")) {
1737 tline
= tline
->next
;
1738 searching
.plus
= true;
1740 mmac
= (MMacro
*) hash_findix(&mmacros
, searching
.name
);
1742 if (!strcmp(mmac
->name
, searching
.name
) &&
1743 (mmac
->nparam_min
<= searching
.nparam_max
1745 && (searching
.nparam_min
<= mmac
->nparam_max
1752 if(tline
&& tline
->next
)
1753 error(ERR_WARNING
|ERR_PASS1
,
1754 "trailing garbage after %%ifmacro ignored");
1755 nasm_free(searching
.name
);
1764 needtype
= TOK_NUMBER
;
1767 needtype
= TOK_STRING
;
1771 t
= tline
= expand_smacro(tline
);
1773 while (tok_type_(t
, TOK_WHITESPACE
) ||
1774 (needtype
== TOK_NUMBER
&&
1775 tok_type_(t
, TOK_OTHER
) &&
1776 (t
->text
[0] == '-' || t
->text
[0] == '+') &&
1780 j
= tok_type_(t
, needtype
);
1784 t
= tline
= expand_smacro(tline
);
1785 while (tok_type_(t
, TOK_WHITESPACE
))
1790 t
= t
->next
; /* Skip the actual token */
1791 while (tok_type_(t
, TOK_WHITESPACE
))
1793 j
= !t
; /* Should be nothing left */
1798 t
= tline
= expand_smacro(tline
);
1799 while (tok_type_(t
, TOK_WHITESPACE
))
1802 j
= !t
; /* Should be empty */
1806 t
= tline
= expand_smacro(tline
);
1808 tokval
.t_type
= TOKEN_INVALID
;
1809 evalresult
= evaluate(ppscan
, tptr
, &tokval
,
1810 NULL
, pass
| CRITICAL
, error
, NULL
);
1814 error(ERR_WARNING
|ERR_PASS1
,
1815 "trailing garbage after expression ignored");
1816 if (!is_simple(evalresult
)) {
1818 "non-constant value given to `%s'", pp_directives
[ct
]);
1821 j
= reloc_value(evalresult
) != 0;
1826 "preprocessor directive `%s' not yet implemented",
1831 free_tlist(origline
);
1832 return j
^ PP_NEGATIVE(ct
);
1835 free_tlist(origline
);
1840 * Common code for defining an smacro
1842 static bool define_smacro(Context
*ctx
, const char *mname
, bool casesense
,
1843 int nparam
, Token
*expansion
)
1845 SMacro
*smac
, **smhead
;
1846 struct hash_table
*smtbl
;
1848 if (smacro_defined(ctx
, mname
, nparam
, &smac
, casesense
)) {
1850 error(ERR_WARNING
|ERR_PASS1
,
1851 "single-line macro `%s' defined both with and"
1852 " without parameters", mname
);
1854 /* Some instances of the old code considered this a failure,
1855 some others didn't. What is the right thing to do here? */
1856 free_tlist(expansion
);
1857 return false; /* Failure */
1860 * We're redefining, so we have to take over an
1861 * existing SMacro structure. This means freeing
1862 * what was already in it.
1864 nasm_free(smac
->name
);
1865 free_tlist(smac
->expansion
);
1868 smtbl
= ctx
? &ctx
->localmac
: &smacros
;
1869 smhead
= (SMacro
**) hash_findi_add(smtbl
, mname
);
1870 smac
= nasm_malloc(sizeof(SMacro
));
1871 smac
->next
= *smhead
;
1874 smac
->name
= nasm_strdup(mname
);
1875 smac
->casesense
= casesense
;
1876 smac
->nparam
= nparam
;
1877 smac
->expansion
= expansion
;
1878 smac
->in_progress
= false;
1879 return true; /* Success */
1883 * Undefine an smacro
1885 static void undef_smacro(Context
*ctx
, const char *mname
)
1887 SMacro
**smhead
, *s
, **sp
;
1888 struct hash_table
*smtbl
;
1890 smtbl
= ctx
? &ctx
->localmac
: &smacros
;
1891 smhead
= (SMacro
**)hash_findi(smtbl
, mname
, NULL
);
1895 * We now have a macro name... go hunt for it.
1898 while ((s
= *sp
) != NULL
) {
1899 if (!mstrcmp(s
->name
, mname
, s
->casesense
)) {
1902 free_tlist(s
->expansion
);
1912 * Parse a mmacro specification.
1914 static bool parse_mmacro_spec(Token
*tline
, MMacro
*def
, const char *directive
)
1918 tline
= tline
->next
;
1920 tline
= expand_id(tline
);
1921 if (!tok_type_(tline
, TOK_ID
)) {
1922 error(ERR_NONFATAL
, "`%s' expects a macro name", directive
);
1927 def
->name
= nasm_strdup(tline
->text
);
1929 def
->nolist
= false;
1930 def
->in_progress
= 0;
1931 def
->rep_nest
= NULL
;
1932 def
->nparam_min
= 0;
1933 def
->nparam_max
= 0;
1935 tline
= expand_smacro(tline
->next
);
1937 if (!tok_type_(tline
, TOK_NUMBER
)) {
1938 error(ERR_NONFATAL
, "`%s' expects a parameter count", directive
);
1940 def
->nparam_min
= def
->nparam_max
=
1941 readnum(tline
->text
, &err
);
1944 "unable to parse parameter count `%s'", tline
->text
);
1946 if (tline
&& tok_is_(tline
->next
, "-")) {
1947 tline
= tline
->next
->next
;
1948 if (tok_is_(tline
, "*")) {
1949 def
->nparam_max
= INT_MAX
;
1950 } else if (!tok_type_(tline
, TOK_NUMBER
)) {
1952 "`%s' expects a parameter count after `-'", directive
);
1954 def
->nparam_max
= readnum(tline
->text
, &err
);
1956 error(ERR_NONFATAL
, "unable to parse parameter count `%s'",
1959 if (def
->nparam_min
> def
->nparam_max
) {
1960 error(ERR_NONFATAL
, "minimum parameter count exceeds maximum");
1964 if (tline
&& tok_is_(tline
->next
, "+")) {
1965 tline
= tline
->next
;
1968 if (tline
&& tok_type_(tline
->next
, TOK_ID
) &&
1969 !nasm_stricmp(tline
->next
->text
, ".nolist")) {
1970 tline
= tline
->next
;
1975 * Handle default parameters.
1977 if (tline
&& tline
->next
) {
1978 def
->dlist
= tline
->next
;
1980 count_mmac_params(def
->dlist
, &def
->ndefs
, &def
->defaults
);
1983 def
->defaults
= NULL
;
1985 def
->expansion
= NULL
;
1988 def
->ndefs
> def
->nparam_max
- def
->nparam_min
&&
1990 error(ERR_WARNING
|ERR_PASS1
|ERR_WARN_MDP
,
1991 "too many default macro parameters");
1998 * Decode a size directive
2000 static int parse_size(const char *str
) {
2001 static const char *size_names
[] =
2002 { "byte", "dword", "oword", "qword", "tword", "word", "yword" };
2003 static const int sizes
[] =
2004 { 0, 1, 4, 16, 8, 10, 2, 32 };
2006 return sizes
[bsii(str
, size_names
, elements(size_names
))+1];
2010 * find and process preprocessor directive in passed line
2011 * Find out if a line contains a preprocessor directive, and deal
2014 * If a directive _is_ found, it is the responsibility of this routine
2015 * (and not the caller) to free_tlist() the line.
2017 * @param tline a pointer to the current tokeninzed line linked list
2018 * @return DIRECTIVE_FOUND or NO_DIRECTIVE_FOUND
2021 static int do_directive(Token
* tline
)
2023 enum preproc_token i
;
2036 MMacro
*mmac
, **mmhead
;
2037 Token
*t
, *tt
, *param_start
, *macro_start
, *last
, **tptr
, *origline
;
2039 struct tokenval tokval
;
2041 MMacro
*tmp_defining
; /* Used when manipulating rep_nest */
2045 bool is_recursive
= false;
2050 if (!tline
|| !tok_type_(tline
, TOK_PREPROC_ID
) ||
2051 (tline
->text
[1] == '%' || tline
->text
[1] == '$'
2052 || tline
->text
[1] == '!'))
2053 return NO_DIRECTIVE_FOUND
;
2055 i
= pp_token_hash(tline
->text
);
2058 * If we're in a non-emitting branch of a condition construct,
2059 * or walking to the end of an already terminated %rep block,
2060 * we should ignore all directives except for condition
2063 if (((istk
->conds
&& !emitting(istk
->conds
->state
)) ||
2064 (istk
->mstk
&& !istk
->mstk
->in_progress
)) && !is_condition(i
)) {
2065 return NO_DIRECTIVE_FOUND
;
2069 * If we're defining a macro or reading a %rep block, we should
2070 * ignore all directives except for %macro/%imacro (which nest),
2071 * %endm/%endmacro, and (only if we're in a %rep block) %endrep.
2072 * If we're in a %rep block, another %rep nests, so should be let through.
2074 if (defining
&& i
!= PP_MACRO
&& i
!= PP_IMACRO
&&
2075 i
!= PP_ENDMACRO
&& i
!= PP_ENDM
&&
2076 (defining
->name
|| (i
!= PP_ENDREP
&& i
!= PP_REP
))) {
2077 return NO_DIRECTIVE_FOUND
;
2081 if (i
== PP_MACRO
|| i
== PP_IMACRO
) {
2083 return NO_DIRECTIVE_FOUND
;
2084 } else if (nested_mac_count
> 0) {
2085 if (i
== PP_ENDMACRO
) {
2087 return NO_DIRECTIVE_FOUND
;
2090 if (!defining
->name
) {
2093 return NO_DIRECTIVE_FOUND
;
2094 } else if (nested_rep_count
> 0) {
2095 if (i
== PP_ENDREP
) {
2097 return NO_DIRECTIVE_FOUND
;
2105 error(ERR_NONFATAL
, "unknown preprocessor directive `%s'",
2107 return NO_DIRECTIVE_FOUND
; /* didn't get it */
2110 /* Directive to tell NASM what the default stack size is. The
2111 * default is for a 16-bit stack, and this can be overriden with
2113 * the following form:
2115 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
2117 tline
= tline
->next
;
2118 if (tline
&& tline
->type
== TOK_WHITESPACE
)
2119 tline
= tline
->next
;
2120 if (!tline
|| tline
->type
!= TOK_ID
) {
2121 error(ERR_NONFATAL
, "`%%stacksize' missing size parameter");
2122 free_tlist(origline
);
2123 return DIRECTIVE_FOUND
;
2125 if (nasm_stricmp(tline
->text
, "flat") == 0) {
2126 /* All subsequent ARG directives are for a 32-bit stack */
2128 StackPointer
= "ebp";
2131 } else if (nasm_stricmp(tline
->text
, "flat64") == 0) {
2132 /* All subsequent ARG directives are for a 64-bit stack */
2134 StackPointer
= "rbp";
2137 } else if (nasm_stricmp(tline
->text
, "large") == 0) {
2138 /* All subsequent ARG directives are for a 16-bit stack,
2139 * far function call.
2142 StackPointer
= "bp";
2145 } else if (nasm_stricmp(tline
->text
, "small") == 0) {
2146 /* All subsequent ARG directives are for a 16-bit stack,
2147 * far function call. We don't support near functions.
2150 StackPointer
= "bp";
2154 error(ERR_NONFATAL
, "`%%stacksize' invalid size type");
2155 free_tlist(origline
);
2156 return DIRECTIVE_FOUND
;
2158 free_tlist(origline
);
2159 return DIRECTIVE_FOUND
;
2162 /* TASM like ARG directive to define arguments to functions, in
2163 * the following form:
2165 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
2169 char *arg
, directive
[256];
2170 int size
= StackSize
;
2172 /* Find the argument name */
2173 tline
= tline
->next
;
2174 if (tline
&& tline
->type
== TOK_WHITESPACE
)
2175 tline
= tline
->next
;
2176 if (!tline
|| tline
->type
!= TOK_ID
) {
2177 error(ERR_NONFATAL
, "`%%arg' missing argument parameter");
2178 free_tlist(origline
);
2179 return DIRECTIVE_FOUND
;
2183 /* Find the argument size type */
2184 tline
= tline
->next
;
2185 if (!tline
|| tline
->type
!= TOK_OTHER
2186 || tline
->text
[0] != ':') {
2188 "Syntax error processing `%%arg' directive");
2189 free_tlist(origline
);
2190 return DIRECTIVE_FOUND
;
2192 tline
= tline
->next
;
2193 if (!tline
|| tline
->type
!= TOK_ID
) {
2194 error(ERR_NONFATAL
, "`%%arg' missing size type parameter");
2195 free_tlist(origline
);
2196 return DIRECTIVE_FOUND
;
2199 /* Allow macro expansion of type parameter */
2200 tt
= tokenize(tline
->text
);
2201 tt
= expand_smacro(tt
);
2202 size
= parse_size(tt
->text
);
2205 "Invalid size type for `%%arg' missing directive");
2207 free_tlist(origline
);
2208 return DIRECTIVE_FOUND
;
2212 /* Round up to even stack slots */
2213 size
= (size
+StackSize
-1) & ~(StackSize
-1);
2215 /* Now define the macro for the argument */
2216 snprintf(directive
, sizeof(directive
), "%%define %s (%s+%d)",
2217 arg
, StackPointer
, offset
);
2218 do_directive(tokenize(directive
));
2221 /* Move to the next argument in the list */
2222 tline
= tline
->next
;
2223 if (tline
&& tline
->type
== TOK_WHITESPACE
)
2224 tline
= tline
->next
;
2225 } while (tline
&& tline
->type
== TOK_OTHER
&& tline
->text
[0] == ',');
2227 free_tlist(origline
);
2228 return DIRECTIVE_FOUND
;
2231 /* TASM like LOCAL directive to define local variables for a
2232 * function, in the following form:
2234 * LOCAL local1:WORD, local2:DWORD, local4:QWORD = LocalSize
2236 * The '= LocalSize' at the end is ignored by NASM, but is
2237 * required by TASM to define the local parameter size (and used
2238 * by the TASM macro package).
2240 offset
= LocalOffset
;
2242 char *local
, directive
[256];
2243 int size
= StackSize
;
2245 /* Find the argument name */
2246 tline
= tline
->next
;
2247 if (tline
&& tline
->type
== TOK_WHITESPACE
)
2248 tline
= tline
->next
;
2249 if (!tline
|| tline
->type
!= TOK_ID
) {
2251 "`%%local' missing argument parameter");
2252 free_tlist(origline
);
2253 return DIRECTIVE_FOUND
;
2255 local
= tline
->text
;
2257 /* Find the argument size type */
2258 tline
= tline
->next
;
2259 if (!tline
|| tline
->type
!= TOK_OTHER
2260 || tline
->text
[0] != ':') {
2262 "Syntax error processing `%%local' directive");
2263 free_tlist(origline
);
2264 return DIRECTIVE_FOUND
;
2266 tline
= tline
->next
;
2267 if (!tline
|| tline
->type
!= TOK_ID
) {
2269 "`%%local' missing size type parameter");
2270 free_tlist(origline
);
2271 return DIRECTIVE_FOUND
;
2274 /* Allow macro expansion of type parameter */
2275 tt
= tokenize(tline
->text
);
2276 tt
= expand_smacro(tt
);
2277 size
= parse_size(tt
->text
);
2280 "Invalid size type for `%%local' missing directive");
2282 free_tlist(origline
);
2283 return DIRECTIVE_FOUND
;
2287 /* Round up to even stack slots */
2288 size
= (size
+StackSize
-1) & ~(StackSize
-1);
2290 offset
+= size
; /* Negative offset, increment before */
2292 /* Now define the macro for the argument */
2293 snprintf(directive
, sizeof(directive
), "%%define %s (%s-%d)",
2294 local
, StackPointer
, offset
);
2295 do_directive(tokenize(directive
));
2297 /* Now define the assign to setup the enter_c macro correctly */
2298 snprintf(directive
, sizeof(directive
),
2299 "%%assign %%$localsize %%$localsize+%d", size
);
2300 do_directive(tokenize(directive
));
2302 /* Move to the next argument in the list */
2303 tline
= tline
->next
;
2304 if (tline
&& tline
->type
== TOK_WHITESPACE
)
2305 tline
= tline
->next
;
2306 } while (tline
&& tline
->type
== TOK_OTHER
&& tline
->text
[0] == ',');
2307 LocalOffset
= offset
;
2308 free_tlist(origline
);
2309 return DIRECTIVE_FOUND
;
2313 error(ERR_WARNING
|ERR_PASS1
,
2314 "trailing garbage after `%%clear' ignored");
2317 free_tlist(origline
);
2318 return DIRECTIVE_FOUND
;
2321 t
= tline
->next
= expand_smacro(tline
->next
);
2323 if (!t
|| (t
->type
!= TOK_STRING
&&
2324 t
->type
!= TOK_INTERNAL_STRING
)) {
2325 error(ERR_NONFATAL
, "`%%depend' expects a file name");
2326 free_tlist(origline
);
2327 return DIRECTIVE_FOUND
; /* but we did _something_ */
2330 error(ERR_WARNING
|ERR_PASS1
,
2331 "trailing garbage after `%%depend' ignored");
2333 if (t
->type
!= TOK_INTERNAL_STRING
)
2334 nasm_unquote(p
, NULL
);
2335 if (dephead
&& !in_list(*dephead
, p
)) {
2336 StrList
*sl
= nasm_malloc(strlen(p
)+1+sizeof sl
->next
);
2340 deptail
= &sl
->next
;
2342 free_tlist(origline
);
2343 return DIRECTIVE_FOUND
;
2346 t
= tline
->next
= expand_smacro(tline
->next
);
2349 if (!t
|| (t
->type
!= TOK_STRING
&&
2350 t
->type
!= TOK_INTERNAL_STRING
)) {
2351 error(ERR_NONFATAL
, "`%%include' expects a file name");
2352 free_tlist(origline
);
2353 return DIRECTIVE_FOUND
; /* but we did _something_ */
2356 error(ERR_WARNING
|ERR_PASS1
,
2357 "trailing garbage after `%%include' ignored");
2359 if (t
->type
!= TOK_INTERNAL_STRING
)
2360 nasm_unquote(p
, NULL
);
2361 inc
= nasm_malloc(sizeof(Include
));
2364 inc
->fp
= inc_fopen(p
, dephead
, &deptail
, pass
== 0);
2366 /* -MG given but file not found */
2369 inc
->fname
= src_set_fname(nasm_strdup(p
));
2370 inc
->lineno
= src_set_linnum(0);
2372 inc
->expansion
= NULL
;
2375 list
->uplevel(LIST_INCLUDE
);
2377 free_tlist(origline
);
2378 return DIRECTIVE_FOUND
;
2382 static macros_t
*use_pkg
;
2383 const char *pkg_macro
;
2385 tline
= tline
->next
;
2387 tline
= expand_id(tline
);
2389 if (!tline
|| (tline
->type
!= TOK_STRING
&&
2390 tline
->type
!= TOK_INTERNAL_STRING
&&
2391 tline
->type
!= TOK_ID
)) {
2392 error(ERR_NONFATAL
, "`%%use' expects a package name");
2393 free_tlist(origline
);
2394 return DIRECTIVE_FOUND
; /* but we did _something_ */
2397 error(ERR_WARNING
|ERR_PASS1
,
2398 "trailing garbage after `%%use' ignored");
2399 if (tline
->type
== TOK_STRING
)
2400 nasm_unquote(tline
->text
, NULL
);
2401 use_pkg
= nasm_stdmac_find_package(tline
->text
);
2403 error(ERR_NONFATAL
, "unknown `%%use' package: %s", tline
->text
);
2404 /* The first string will be <%define>__USE_*__ */
2405 pkg_macro
= (char *)use_pkg
+ 1;
2406 if (!smacro_defined(NULL
, pkg_macro
, 0, NULL
, true)) {
2407 /* Not already included, go ahead and include it */
2408 stdmacpos
= use_pkg
;
2410 free_tlist(origline
);
2411 return DIRECTIVE_FOUND
;
2416 tline
= tline
->next
;
2418 tline
= expand_id(tline
);
2420 if (!tok_type_(tline
, TOK_ID
)) {
2421 error(ERR_NONFATAL
, "`%s' expects a context identifier",
2423 free_tlist(origline
);
2424 return DIRECTIVE_FOUND
; /* but we did _something_ */
2427 error(ERR_WARNING
|ERR_PASS1
,
2428 "trailing garbage after `%s' ignored",
2430 p
= nasm_strdup(tline
->text
);
2432 p
= NULL
; /* Anonymous */
2436 ctx
= nasm_malloc(sizeof(Context
));
2438 hash_init(&ctx
->localmac
, HASH_SMALL
);
2440 ctx
->number
= unique
++;
2445 error(ERR_NONFATAL
, "`%s': context stack is empty",
2447 } else if (i
== PP_POP
) {
2448 if (p
&& (!cstk
->name
|| nasm_stricmp(p
, cstk
->name
)))
2449 error(ERR_NONFATAL
, "`%%pop' in wrong context: %s, "
2451 cstk
->name
? cstk
->name
: "anonymous", p
);
2456 nasm_free(cstk
->name
);
2462 free_tlist(origline
);
2463 return DIRECTIVE_FOUND
;
2465 severity
= ERR_FATAL
;
2468 severity
= ERR_NONFATAL
;
2471 severity
= ERR_WARNING
|ERR_WARN_USER
;
2476 /* Only error out if this is the final pass */
2477 if (pass
!= 2 && i
!= PP_FATAL
)
2478 return DIRECTIVE_FOUND
;
2480 tline
->next
= expand_smacro(tline
->next
);
2481 tline
= tline
->next
;
2483 t
= tline
? tline
->next
: NULL
;
2485 if (tok_type_(tline
, TOK_STRING
) && !t
) {
2486 /* The line contains only a quoted string */
2488 nasm_unquote(p
, NULL
);
2489 error(severity
, "%s", p
);
2491 /* Not a quoted string, or more than a quoted string */
2492 p
= detoken(tline
, false);
2493 error(severity
, "%s", p
);
2496 free_tlist(origline
);
2497 return DIRECTIVE_FOUND
;
2501 if (istk
->conds
&& !emitting(istk
->conds
->state
))
2504 j
= if_condition(tline
->next
, i
);
2505 tline
->next
= NULL
; /* it got freed */
2506 j
= j
< 0 ? COND_NEVER
: j
? COND_IF_TRUE
: COND_IF_FALSE
;
2508 cond
= nasm_malloc(sizeof(Cond
));
2509 cond
->next
= istk
->conds
;
2512 free_tlist(origline
);
2513 return DIRECTIVE_FOUND
;
2517 error(ERR_FATAL
, "`%s': no matching `%%if'", pp_directives
[i
]);
2518 switch(istk
->conds
->state
) {
2520 istk
->conds
->state
= COND_DONE
;
2527 case COND_ELSE_TRUE
:
2528 case COND_ELSE_FALSE
:
2529 error_precond(ERR_WARNING
|ERR_PASS1
,
2530 "`%%elif' after `%%else' ignored");
2531 istk
->conds
->state
= COND_NEVER
;
2536 * IMPORTANT: In the case of %if, we will already have
2537 * called expand_mmac_params(); however, if we're
2538 * processing an %elif we must have been in a
2539 * non-emitting mode, which would have inhibited
2540 * the normal invocation of expand_mmac_params().
2541 * Therefore, we have to do it explicitly here.
2543 j
= if_condition(expand_mmac_params(tline
->next
), i
);
2544 tline
->next
= NULL
; /* it got freed */
2545 istk
->conds
->state
=
2546 j
< 0 ? COND_NEVER
: j
? COND_IF_TRUE
: COND_IF_FALSE
;
2549 free_tlist(origline
);
2550 return DIRECTIVE_FOUND
;
2554 error_precond(ERR_WARNING
|ERR_PASS1
,
2555 "trailing garbage after `%%else' ignored");
2557 error(ERR_FATAL
, "`%%else': no matching `%%if'");
2558 switch(istk
->conds
->state
) {
2561 istk
->conds
->state
= COND_ELSE_FALSE
;
2568 istk
->conds
->state
= COND_ELSE_TRUE
;
2571 case COND_ELSE_TRUE
:
2572 case COND_ELSE_FALSE
:
2573 error_precond(ERR_WARNING
|ERR_PASS1
,
2574 "`%%else' after `%%else' ignored.");
2575 istk
->conds
->state
= COND_NEVER
;
2578 free_tlist(origline
);
2579 return DIRECTIVE_FOUND
;
2583 error_precond(ERR_WARNING
|ERR_PASS1
,
2584 "trailing garbage after `%%endif' ignored");
2586 error(ERR_FATAL
, "`%%endif': no matching `%%if'");
2588 istk
->conds
= cond
->next
;
2590 free_tlist(origline
);
2591 return DIRECTIVE_FOUND
;
2595 is_recursive
= true;
2600 "`%%%smacro': already defining a macro",
2601 (i
== PP_IMACRO
? "i" : ""));
2602 return DIRECTIVE_FOUND
;
2604 defining
= nasm_malloc(sizeof(MMacro
));
2605 defining
->max_depth
= (is_recursive
? 65536 : 0); /* remove/change this??? */
2606 defining
->casesense
= (i
== PP_MACRO
);
2607 if (!parse_mmacro_spec(tline
, defining
, pp_directives
[i
])) {
2608 nasm_free(defining
);
2610 return DIRECTIVE_FOUND
;
2613 mmac
= (MMacro
*) hash_findix(&mmacros
, defining
->name
);
2615 if (!strcmp(mmac
->name
, defining
->name
) &&
2616 (mmac
->nparam_min
<= defining
->nparam_max
2618 && (defining
->nparam_min
<= mmac
->nparam_max
2620 error(ERR_WARNING
|ERR_PASS1
,
2621 "redefining multi-line macro `%s'", defining
->name
);
2622 return DIRECTIVE_FOUND
;
2626 free_tlist(origline
);
2627 return DIRECTIVE_FOUND
;
2631 if (! (defining
&& defining
->name
)) {
2632 error(ERR_NONFATAL
, "`%s': not defining a macro", tline
->text
);
2633 return DIRECTIVE_FOUND
;
2635 mmhead
= (MMacro
**) hash_findi_add(&mmacros
, defining
->name
);
2636 defining
->next
= *mmhead
;
2639 free_tlist(origline
);
2640 return DIRECTIVE_FOUND
;
2648 spec
.casesense
= (i
== PP_UNMACRO
);
2649 if (!parse_mmacro_spec(tline
, &spec
, pp_directives
[i
])) {
2650 return DIRECTIVE_FOUND
;
2652 mmac_p
= (MMacro
**) hash_findi(&mmacros
, spec
.name
, NULL
);
2653 while (mmac_p
&& *mmac_p
) {
2655 if (mmac
->casesense
== spec
.casesense
&&
2656 !mstrcmp(mmac
->name
, spec
.name
, spec
.casesense
) &&
2657 mmac
->nparam_min
== spec
.nparam_min
&&
2658 mmac
->nparam_max
== spec
.nparam_max
&&
2659 mmac
->plus
== spec
.plus
) {
2660 *mmac_p
= mmac
->next
;
2663 mmac_p
= &mmac
->next
;
2666 free_tlist(origline
);
2667 free_tlist(spec
.dlist
);
2668 return DIRECTIVE_FOUND
;
2672 if (tline
->next
&& tline
->next
->type
== TOK_WHITESPACE
)
2673 tline
= tline
->next
;
2674 if (tline
->next
== NULL
) {
2675 free_tlist(origline
);
2676 error(ERR_NONFATAL
, "`%%rotate' missing rotate count");
2677 return DIRECTIVE_FOUND
;
2679 t
= expand_smacro(tline
->next
);
2681 free_tlist(origline
);
2684 tokval
.t_type
= TOKEN_INVALID
;
2686 evaluate(ppscan
, tptr
, &tokval
, NULL
, pass
, error
, NULL
);
2689 return DIRECTIVE_FOUND
;
2691 error(ERR_WARNING
|ERR_PASS1
,
2692 "trailing garbage after expression ignored");
2693 if (!is_simple(evalresult
)) {
2694 error(ERR_NONFATAL
, "non-constant value given to `%%rotate'");
2695 return DIRECTIVE_FOUND
;
2698 while (mmac
&& !mmac
->name
) /* avoid mistaking %reps for macros */
2699 mmac
= mmac
->next_active
;
2701 error(ERR_NONFATAL
, "`%%rotate' invoked outside a macro call");
2702 } else if (mmac
->nparam
== 0) {
2704 "`%%rotate' invoked within macro without parameters");
2706 int rotate
= mmac
->rotate
+ reloc_value(evalresult
);
2708 rotate
%= (int)mmac
->nparam
;
2710 rotate
+= mmac
->nparam
;
2712 mmac
->rotate
= rotate
;
2714 return DIRECTIVE_FOUND
;
2719 tline
= tline
->next
;
2720 } while (tok_type_(tline
, TOK_WHITESPACE
));
2722 if (tok_type_(tline
, TOK_ID
) &&
2723 nasm_stricmp(tline
->text
, ".nolist") == 0) {
2726 tline
= tline
->next
;
2727 } while (tok_type_(tline
, TOK_WHITESPACE
));
2731 t
= expand_smacro(tline
);
2733 tokval
.t_type
= TOKEN_INVALID
;
2735 evaluate(ppscan
, tptr
, &tokval
, NULL
, pass
, error
, NULL
);
2737 free_tlist(origline
);
2738 return DIRECTIVE_FOUND
;
2741 error(ERR_WARNING
|ERR_PASS1
,
2742 "trailing garbage after expression ignored");
2743 if (!is_simple(evalresult
)) {
2744 error(ERR_NONFATAL
, "non-constant value given to `%%rep'");
2745 return DIRECTIVE_FOUND
;
2747 count
= reloc_value(evalresult
) + 1;
2749 error(ERR_NONFATAL
, "`%%rep' expects a repeat count");
2752 free_tlist(origline
);
2754 tmp_defining
= defining
;
2755 defining
= nasm_malloc(sizeof(MMacro
));
2756 defining
->prev
= NULL
;
2757 defining
->name
= NULL
; /* flags this macro as a %rep block */
2758 defining
->casesense
= false;
2759 defining
->plus
= false;
2760 defining
->nolist
= nolist
;
2761 defining
->in_progress
= count
;
2762 defining
->max_depth
= 0;
2763 defining
->nparam_min
= defining
->nparam_max
= 0;
2764 defining
->defaults
= NULL
;
2765 defining
->dlist
= NULL
;
2766 defining
->expansion
= NULL
;
2767 defining
->next_active
= istk
->mstk
;
2768 defining
->rep_nest
= tmp_defining
;
2769 return DIRECTIVE_FOUND
;
2772 if (!defining
|| defining
->name
) {
2773 error(ERR_NONFATAL
, "`%%endrep': no matching `%%rep'");
2774 return DIRECTIVE_FOUND
;
2778 * Now we have a "macro" defined - although it has no name
2779 * and we won't be entering it in the hash tables - we must
2780 * push a macro-end marker for it on to istk->expansion.
2781 * After that, it will take care of propagating itself (a
2782 * macro-end marker line for a macro which is really a %rep
2783 * block will cause the macro to be re-expanded, complete
2784 * with another macro-end marker to ensure the process
2785 * continues) until the whole expansion is forcibly removed
2786 * from istk->expansion by a %exitrep.
2788 l
= nasm_malloc(sizeof(Line
));
2789 l
->next
= istk
->expansion
;
2790 l
->finishes
= defining
;
2792 istk
->expansion
= l
;
2794 istk
->mstk
= defining
;
2796 list
->uplevel(defining
->nolist
? LIST_MACRO_NOLIST
: LIST_MACRO
);
2797 tmp_defining
= defining
;
2798 defining
= defining
->rep_nest
;
2799 free_tlist(origline
);
2800 return DIRECTIVE_FOUND
;
2804 * We must search along istk->expansion until we hit a
2805 * macro-end marker for a macro with no name. Then we set
2806 * its `in_progress' flag to 0.
2808 for (l
= istk
->expansion
; l
; l
= l
->next
)
2809 if (l
->finishes
&& !l
->finishes
->name
)
2813 l
->finishes
->in_progress
= 1;
2815 error(ERR_NONFATAL
, "`%%exitrep' not within `%%rep' block");
2816 free_tlist(origline
);
2817 return DIRECTIVE_FOUND
;
2823 casesense
= (i
== PP_DEFINE
|| i
== PP_XDEFINE
);
2825 tline
= tline
->next
;
2827 tline
= expand_id(tline
);
2828 if (!tline
|| (tline
->type
!= TOK_ID
&&
2829 (tline
->type
!= TOK_PREPROC_ID
||
2830 tline
->text
[1] != '$'))) {
2831 error(ERR_NONFATAL
, "`%s' expects a macro identifier",
2833 free_tlist(origline
);
2834 return DIRECTIVE_FOUND
;
2837 ctx
= get_ctx(tline
->text
, &mname
, false);
2839 param_start
= tline
= tline
->next
;
2842 /* Expand the macro definition now for %xdefine and %ixdefine */
2843 if ((i
== PP_XDEFINE
) || (i
== PP_IXDEFINE
))
2844 tline
= expand_smacro(tline
);
2846 if (tok_is_(tline
, "(")) {
2848 * This macro has parameters.
2851 tline
= tline
->next
;
2855 error(ERR_NONFATAL
, "parameter identifier expected");
2856 free_tlist(origline
);
2857 return DIRECTIVE_FOUND
;
2859 if (tline
->type
!= TOK_ID
) {
2861 "`%s': parameter identifier expected",
2863 free_tlist(origline
);
2864 return DIRECTIVE_FOUND
;
2866 tline
->type
= TOK_SMAC_PARAM
+ nparam
++;
2867 tline
= tline
->next
;
2869 if (tok_is_(tline
, ",")) {
2870 tline
= tline
->next
;
2872 if (!tok_is_(tline
, ")")) {
2874 "`)' expected to terminate macro template");
2875 free_tlist(origline
);
2876 return DIRECTIVE_FOUND
;
2882 tline
= tline
->next
;
2884 if (tok_type_(tline
, TOK_WHITESPACE
))
2885 last
= tline
, tline
= tline
->next
;
2890 if (t
->type
== TOK_ID
) {
2891 for (tt
= param_start
; tt
; tt
= tt
->next
)
2892 if (tt
->type
>= TOK_SMAC_PARAM
&&
2893 !strcmp(tt
->text
, t
->text
))
2897 t
->next
= macro_start
;
2902 * Good. We now have a macro name, a parameter count, and a
2903 * token list (in reverse order) for an expansion. We ought
2904 * to be OK just to create an SMacro, store it, and let
2905 * free_tlist have the rest of the line (which we have
2906 * carefully re-terminated after chopping off the expansion
2909 define_smacro(ctx
, mname
, casesense
, nparam
, macro_start
);
2910 free_tlist(origline
);
2911 return DIRECTIVE_FOUND
;
2914 tline
= tline
->next
;
2916 tline
= expand_id(tline
);
2917 if (!tline
|| (tline
->type
!= TOK_ID
&&
2918 (tline
->type
!= TOK_PREPROC_ID
||
2919 tline
->text
[1] != '$'))) {
2920 error(ERR_NONFATAL
, "`%%undef' expects a macro identifier");
2921 free_tlist(origline
);
2922 return DIRECTIVE_FOUND
;
2925 error(ERR_WARNING
|ERR_PASS1
,
2926 "trailing garbage after macro name ignored");
2929 /* Find the context that symbol belongs to */
2930 ctx
= get_ctx(tline
->text
, &mname
, false);
2931 undef_smacro(ctx
, mname
);
2932 free_tlist(origline
);
2933 return DIRECTIVE_FOUND
;
2937 casesense
= (i
== PP_DEFSTR
);
2939 tline
= tline
->next
;
2941 tline
= expand_id(tline
);
2942 if (!tline
|| (tline
->type
!= TOK_ID
&&
2943 (tline
->type
!= TOK_PREPROC_ID
||
2944 tline
->text
[1] != '$'))) {
2945 error(ERR_NONFATAL
, "`%s' expects a macro identifier",
2947 free_tlist(origline
);
2948 return DIRECTIVE_FOUND
;
2951 ctx
= get_ctx(tline
->text
, &mname
, false);
2953 tline
= expand_smacro(tline
->next
);
2956 while (tok_type_(tline
, TOK_WHITESPACE
))
2957 tline
= delete_Token(tline
);
2959 p
= detoken(tline
, false);
2960 macro_start
= nasm_malloc(sizeof(*macro_start
));
2961 macro_start
->next
= NULL
;
2962 macro_start
->text
= nasm_quote(p
, strlen(p
));
2963 macro_start
->type
= TOK_STRING
;
2964 macro_start
->a
.mac
= NULL
;
2968 * We now have a macro name, an implicit parameter count of
2969 * zero, and a string token to use as an expansion. Create
2970 * and store an SMacro.
2972 define_smacro(ctx
, mname
, casesense
, 0, macro_start
);
2973 free_tlist(origline
);
2974 return DIRECTIVE_FOUND
;
2979 StrList
*xsl
= NULL
;
2980 StrList
**xst
= &xsl
;
2984 tline
= tline
->next
;
2986 tline
= expand_id(tline
);
2987 if (!tline
|| (tline
->type
!= TOK_ID
&&
2988 (tline
->type
!= TOK_PREPROC_ID
||
2989 tline
->text
[1] != '$'))) {
2991 "`%%pathsearch' expects a macro identifier as first parameter");
2992 free_tlist(origline
);
2993 return DIRECTIVE_FOUND
;
2995 ctx
= get_ctx(tline
->text
, &mname
, false);
2997 tline
= expand_smacro(tline
->next
);
3001 while (tok_type_(t
, TOK_WHITESPACE
))
3004 if (!t
|| (t
->type
!= TOK_STRING
&&
3005 t
->type
!= TOK_INTERNAL_STRING
)) {
3006 error(ERR_NONFATAL
, "`%%pathsearch' expects a file name");
3008 free_tlist(origline
);
3009 return DIRECTIVE_FOUND
; /* but we did _something_ */
3012 error(ERR_WARNING
|ERR_PASS1
,
3013 "trailing garbage after `%%pathsearch' ignored");
3015 if (t
->type
!= TOK_INTERNAL_STRING
)
3016 nasm_unquote(p
, NULL
);
3018 fp
= inc_fopen(p
, &xsl
, &xst
, true);
3021 fclose(fp
); /* Don't actually care about the file */
3023 macro_start
= nasm_malloc(sizeof(*macro_start
));
3024 macro_start
->next
= NULL
;
3025 macro_start
->text
= nasm_quote(p
, strlen(p
));
3026 macro_start
->type
= TOK_STRING
;
3027 macro_start
->a
.mac
= NULL
;
3032 * We now have a macro name, an implicit parameter count of
3033 * zero, and a string token to use as an expansion. Create
3034 * and store an SMacro.
3036 define_smacro(ctx
, mname
, casesense
, 0, macro_start
);
3038 free_tlist(origline
);
3039 return DIRECTIVE_FOUND
;
3045 tline
= tline
->next
;
3047 tline
= expand_id(tline
);
3048 if (!tline
|| (tline
->type
!= TOK_ID
&&
3049 (tline
->type
!= TOK_PREPROC_ID
||
3050 tline
->text
[1] != '$'))) {
3052 "`%%strlen' expects a macro identifier as first parameter");
3053 free_tlist(origline
);
3054 return DIRECTIVE_FOUND
;
3056 ctx
= get_ctx(tline
->text
, &mname
, false);
3058 tline
= expand_smacro(tline
->next
);
3062 while (tok_type_(t
, TOK_WHITESPACE
))
3064 /* t should now point to the string */
3065 if (t
->type
!= TOK_STRING
) {
3067 "`%%strlen` requires string as second parameter");
3069 free_tlist(origline
);
3070 return DIRECTIVE_FOUND
;
3073 macro_start
= nasm_malloc(sizeof(*macro_start
));
3074 macro_start
->next
= NULL
;
3075 make_tok_num(macro_start
, nasm_unquote(t
->text
, NULL
));
3076 macro_start
->a
.mac
= NULL
;
3079 * We now have a macro name, an implicit parameter count of
3080 * zero, and a numeric token to use as an expansion. Create
3081 * and store an SMacro.
3083 define_smacro(ctx
, mname
, casesense
, 0, macro_start
);
3085 free_tlist(origline
);
3086 return DIRECTIVE_FOUND
;
3091 tline
= tline
->next
;
3093 tline
= expand_id(tline
);
3094 if (!tline
|| (tline
->type
!= TOK_ID
&&
3095 (tline
->type
!= TOK_PREPROC_ID
||
3096 tline
->text
[1] != '$'))) {
3098 "`%%strcat' expects a macro identifier as first parameter");
3099 free_tlist(origline
);
3100 return DIRECTIVE_FOUND
;
3102 ctx
= get_ctx(tline
->text
, &mname
, false);
3104 tline
= expand_smacro(tline
->next
);
3108 for (t
= tline
; t
; t
= t
->next
) {
3110 case TOK_WHITESPACE
:
3113 len
+= t
->a
.len
= nasm_unquote(t
->text
, NULL
);
3116 if (!strcmp(t
->text
, ",")) /* permit comma separators */
3118 /* else fall through */
3121 "non-string passed to `%%strcat' (%d)", t
->type
);
3123 free_tlist(origline
);
3124 return DIRECTIVE_FOUND
;
3128 p
= pp
= nasm_malloc(len
);
3130 for (t
= tline
; t
; t
= t
->next
) {
3131 if (t
->type
== TOK_STRING
) {
3132 memcpy(p
, t
->text
, t
->a
.len
);
3138 * We now have a macro name, an implicit parameter count of
3139 * zero, and a numeric token to use as an expansion. Create
3140 * and store an SMacro.
3142 macro_start
= new_Token(NULL
, TOK_STRING
, NULL
, 0);
3143 macro_start
->text
= nasm_quote(pp
, len
);
3145 define_smacro(ctx
, mname
, casesense
, 0, macro_start
);
3147 free_tlist(origline
);
3148 return DIRECTIVE_FOUND
;
3157 tline
= tline
->next
;
3159 tline
= expand_id(tline
);
3160 if (!tline
|| (tline
->type
!= TOK_ID
&&
3161 (tline
->type
!= TOK_PREPROC_ID
||
3162 tline
->text
[1] != '$'))) {
3164 "`%%substr' expects a macro identifier as first parameter");
3165 free_tlist(origline
);
3166 return DIRECTIVE_FOUND
;
3168 ctx
= get_ctx(tline
->text
, &mname
, false);
3170 tline
= expand_smacro(tline
->next
);
3174 while (tok_type_(t
, TOK_WHITESPACE
))
3177 /* t should now point to the string */
3178 if (t
->type
!= TOK_STRING
) {
3180 "`%%substr` requires string as second parameter");
3182 free_tlist(origline
);
3183 return DIRECTIVE_FOUND
;
3188 tokval
.t_type
= TOKEN_INVALID
;
3189 evalresult
= evaluate(ppscan
, tptr
, &tokval
, NULL
,
3193 free_tlist(origline
);
3194 return DIRECTIVE_FOUND
;
3195 } else if (!is_simple(evalresult
)) {
3196 error(ERR_NONFATAL
, "non-constant value given to `%%substr`");
3198 free_tlist(origline
);
3199 return DIRECTIVE_FOUND
;
3201 a1
= evalresult
->value
-1;
3203 while (tok_type_(tt
, TOK_WHITESPACE
))
3206 a2
= 1; /* Backwards compatibility: one character */
3208 tokval
.t_type
= TOKEN_INVALID
;
3209 evalresult
= evaluate(ppscan
, tptr
, &tokval
, NULL
,
3213 free_tlist(origline
);
3214 return DIRECTIVE_FOUND
;
3215 } else if (!is_simple(evalresult
)) {
3216 error(ERR_NONFATAL
, "non-constant value given to `%%substr`");
3218 free_tlist(origline
);
3219 return DIRECTIVE_FOUND
;
3221 a2
= evalresult
->value
;
3224 len
= nasm_unquote(t
->text
, NULL
);
3227 if (a1
+a2
> (int64_t)len
)
3230 macro_start
= nasm_malloc(sizeof(*macro_start
));
3231 macro_start
->next
= NULL
;
3232 macro_start
->text
= nasm_quote((a1
< 0) ? "" : t
->text
+a1
, a2
);
3233 macro_start
->type
= TOK_STRING
;
3234 macro_start
->a
.mac
= NULL
;
3237 * We now have a macro name, an implicit parameter count of
3238 * zero, and a numeric token to use as an expansion. Create
3239 * and store an SMacro.
3241 define_smacro(ctx
, mname
, casesense
, 0, macro_start
);
3243 free_tlist(origline
);
3244 return DIRECTIVE_FOUND
;
3249 casesense
= (i
== PP_ASSIGN
);
3251 tline
= tline
->next
;
3253 tline
= expand_id(tline
);
3254 if (!tline
|| (tline
->type
!= TOK_ID
&&
3255 (tline
->type
!= TOK_PREPROC_ID
||
3256 tline
->text
[1] != '$'))) {
3258 "`%%%sassign' expects a macro identifier",
3259 (i
== PP_IASSIGN
? "i" : ""));
3260 free_tlist(origline
);
3261 return DIRECTIVE_FOUND
;
3263 ctx
= get_ctx(tline
->text
, &mname
, false);
3265 tline
= expand_smacro(tline
->next
);
3270 tokval
.t_type
= TOKEN_INVALID
;
3272 evaluate(ppscan
, tptr
, &tokval
, NULL
, pass
, error
, NULL
);
3275 free_tlist(origline
);
3276 return DIRECTIVE_FOUND
;
3280 error(ERR_WARNING
|ERR_PASS1
,
3281 "trailing garbage after expression ignored");
3283 if (!is_simple(evalresult
)) {
3285 "non-constant value given to `%%%sassign'",
3286 (i
== PP_IASSIGN
? "i" : ""));
3287 free_tlist(origline
);
3288 return DIRECTIVE_FOUND
;
3291 macro_start
= nasm_malloc(sizeof(*macro_start
));
3292 macro_start
->next
= NULL
;
3293 make_tok_num(macro_start
, reloc_value(evalresult
));
3294 macro_start
->a
.mac
= NULL
;
3297 * We now have a macro name, an implicit parameter count of
3298 * zero, and a numeric token to use as an expansion. Create
3299 * and store an SMacro.
3301 define_smacro(ctx
, mname
, casesense
, 0, macro_start
);
3302 free_tlist(origline
);
3303 return DIRECTIVE_FOUND
;
3307 * Syntax is `%line nnn[+mmm] [filename]'
3309 tline
= tline
->next
;
3311 if (!tok_type_(tline
, TOK_NUMBER
)) {
3312 error(ERR_NONFATAL
, "`%%line' expects line number");
3313 free_tlist(origline
);
3314 return DIRECTIVE_FOUND
;
3316 k
= readnum(tline
->text
, &err
);
3318 tline
= tline
->next
;
3319 if (tok_is_(tline
, "+")) {
3320 tline
= tline
->next
;
3321 if (!tok_type_(tline
, TOK_NUMBER
)) {
3322 error(ERR_NONFATAL
, "`%%line' expects line increment");
3323 free_tlist(origline
);
3324 return DIRECTIVE_FOUND
;
3326 m
= readnum(tline
->text
, &err
);
3327 tline
= tline
->next
;
3333 nasm_free(src_set_fname(detoken(tline
, false)));
3335 free_tlist(origline
);
3336 return DIRECTIVE_FOUND
;
3340 "preprocessor directive `%s' not yet implemented",
3342 return DIRECTIVE_FOUND
;
3347 * Ensure that a macro parameter contains a condition code and
3348 * nothing else. Return the condition code index if so, or -1
3351 static int find_cc(Token
* t
)
3357 return -1; /* Probably a %+ without a space */
3360 if (t
->type
!= TOK_ID
)
3364 if (tt
&& (tt
->type
!= TOK_OTHER
|| strcmp(tt
->text
, ",")))
3368 j
= elements(conditions
);
3371 m
= nasm_stricmp(t
->text
, conditions
[k
]);
3386 static bool paste_tokens(Token
**head
, bool handle_paste_tokens
)
3388 Token
**tail
, *t
, *tt
;
3390 bool did_paste
= false;
3393 /* Now handle token pasting... */
3396 while ((t
= *tail
) && (tt
= t
->next
)) {
3398 case TOK_WHITESPACE
:
3399 if (tt
->type
== TOK_WHITESPACE
) {
3400 /* Zap adjacent whitespace tokens */
3401 t
->next
= delete_Token(tt
);
3403 /* Do not advance paste_head here */
3408 case TOK_PREPROC_ID
:
3415 while (tt
&& (tt
->type
== TOK_ID
|| tt
->type
== TOK_PREPROC_ID
||
3416 tt
->type
== TOK_NUMBER
|| tt
->type
== TOK_FLOAT
||
3417 tt
->type
== TOK_OTHER
)) {
3418 len
+= strlen(tt
->text
);
3422 /* Now tt points to the first token after the potential
3424 if (tt
!= t
->next
) {
3425 /* We have at least two tokens... */
3426 len
+= strlen(t
->text
);
3427 p
= tmp
= nasm_malloc(len
+1);
3431 p
= strchr(p
, '\0');
3432 t
= delete_Token(t
);
3435 t
= *tail
= tokenize(tmp
);
3442 t
->next
= tt
; /* Attach the remaining token chain */
3450 case TOK_PASTE
: /* %+ */
3451 if (handle_paste_tokens
) {
3452 /* Zap %+ and whitespace tokens to the right */
3453 while (t
&& (t
->type
== TOK_WHITESPACE
||
3454 t
->type
== TOK_PASTE
))
3455 t
= *tail
= delete_Token(t
);
3456 if (!paste_head
|| !t
)
3457 break; /* Nothing to paste with */
3461 while (tok_type_(tt
, TOK_WHITESPACE
))
3462 tt
= t
->next
= delete_Token(tt
);
3465 tmp
= nasm_strcat(t
->text
, tt
->text
);
3467 tt
= delete_Token(tt
);
3468 t
= *tail
= tokenize(tmp
);
3474 t
->next
= tt
; /* Attach the remaining token chain */
3481 /* else fall through */
3483 tail
= paste_head
= &t
->next
;
3490 * Expand MMacro-local things: parameter references (%0, %n, %+n,
3491 * %-n) and MMacro-local identifiers (%%foo) as well as
3492 * macro indirection (%[...]).
3494 static Token
*expand_mmac_params(Token
* tline
)
3496 Token
*t
, *tt
, **tail
, *thead
;
3497 bool changed
= false;
3503 if (tline
->type
== TOK_PREPROC_ID
&&
3504 (((tline
->text
[1] == '+' || tline
->text
[1] == '-')
3505 && tline
->text
[2]) || tline
->text
[1] == '%'
3506 || (tline
->text
[1] >= '0' && tline
->text
[1] <= '9'))) {
3508 int type
= 0, cc
; /* type = 0 to placate optimisers */
3515 tline
= tline
->next
;
3518 while (mac
&& !mac
->name
) /* avoid mistaking %reps for macros */
3519 mac
= mac
->next_active
;
3521 error(ERR_NONFATAL
, "`%s': not in a macro call", t
->text
);
3523 switch (t
->text
[1]) {
3525 * We have to make a substitution of one of the
3526 * forms %1, %-1, %+1, %%foo, %0.
3530 snprintf(tmpbuf
, sizeof(tmpbuf
), "%d", mac
->nparam
);
3531 text
= nasm_strdup(tmpbuf
);
3535 snprintf(tmpbuf
, sizeof(tmpbuf
), "..@%"PRIu64
".",
3537 text
= nasm_strcat(tmpbuf
, t
->text
+ 2);
3540 n
= atoi(t
->text
+ 2) - 1;
3541 if (n
>= mac
->nparam
)
3544 if (mac
->nparam
> 1)
3545 n
= (n
+ mac
->rotate
) % mac
->nparam
;
3546 tt
= mac
->params
[n
];
3551 "macro parameter %d is not a condition code",
3556 if (inverse_ccs
[cc
] == -1) {
3558 "condition code `%s' is not invertible",
3562 text
= nasm_strdup(conditions
[inverse_ccs
[cc
]]);
3566 n
= atoi(t
->text
+ 2) - 1;
3567 if (n
>= mac
->nparam
)
3570 if (mac
->nparam
> 1)
3571 n
= (n
+ mac
->rotate
) % mac
->nparam
;
3572 tt
= mac
->params
[n
];
3577 "macro parameter %d is not a condition code",
3582 text
= nasm_strdup(conditions
[cc
]);
3586 n
= atoi(t
->text
+ 1) - 1;
3587 if (n
>= mac
->nparam
)
3590 if (mac
->nparam
> 1)
3591 n
= (n
+ mac
->rotate
) % mac
->nparam
;
3592 tt
= mac
->params
[n
];
3595 for (i
= 0; i
< mac
->paramlen
[n
]; i
++) {
3596 *tail
= new_Token(NULL
, tt
->type
, tt
->text
, 0);
3597 tail
= &(*tail
)->next
;
3601 text
= NULL
; /* we've done it here */
3616 } else if (tline
->type
== TOK_INDIRECT
) {
3618 tline
= tline
->next
;
3619 tt
= tokenize(t
->text
);
3620 tt
= expand_mmac_params(tt
);
3621 tt
= expand_smacro(tt
);
3624 tt
->a
.mac
= NULL
; /* Necessary? */
3632 tline
= tline
->next
;
3640 paste_tokens(&thead
, false);
3646 * Expand all single-line macro calls made in the given line.
3647 * Return the expanded version of the line. The original is deemed
3648 * to be destroyed in the process. (In reality we'll just move
3649 * Tokens from input to output a lot of the time, rather than
3650 * actually bothering to destroy and replicate.)
3652 #define DEADMAN_LIMIT (1 << 20)
3654 static Token
*expand_smacro(Token
* tline
)
3656 Token
*t
, *tt
, *mstart
, **tail
, *thead
;
3657 struct hash_table
*smtbl
;
3658 SMacro
*head
= NULL
, *m
;
3661 unsigned int nparam
, sparam
;
3663 Token
*org_tline
= tline
;
3666 int deadman
= DEADMAN_LIMIT
;
3670 * Trick: we should avoid changing the start token pointer since it can
3671 * be contained in "next" field of other token. Because of this
3672 * we allocate a copy of first token and work with it; at the end of
3673 * routine we copy it back
3677 new_Token(org_tline
->next
, org_tline
->type
, org_tline
->text
,
3679 tline
->a
.mac
= org_tline
->a
.mac
;
3680 nasm_free(org_tline
->text
);
3681 org_tline
->text
= NULL
;
3684 expanded
= true; /* Always expand %+ at least once */
3690 while (tline
) { /* main token loop */
3692 error(ERR_NONFATAL
, "interminable macro recursion");
3696 if ((mname
= tline
->text
)) {
3697 /* if this token is a local macro, look in local context */
3698 if (tline
->type
== TOK_ID
|| tline
->type
== TOK_PREPROC_ID
)
3699 ctx
= get_ctx(mname
, &mname
, true);
3702 smtbl
= ctx
? &ctx
->localmac
: &smacros
;
3703 head
= (SMacro
*) hash_findix(smtbl
, mname
);
3706 * We've hit an identifier. As in is_mmacro below, we first
3707 * check whether the identifier is a single-line macro at
3708 * all, then think about checking for parameters if
3711 for (m
= head
; m
; m
= m
->next
)
3712 if (!mstrcmp(m
->name
, mname
, m
->casesense
))
3718 if (m
->nparam
== 0) {
3720 * Simple case: the macro is parameterless. Discard the
3721 * one token that the macro call took, and push the
3722 * expansion back on the to-do stack.
3724 if (!m
->expansion
) {
3725 if (!strcmp("__FILE__", m
->name
)) {
3728 src_get(&num
, &file
);
3729 tline
->text
= nasm_quote(file
, strlen(file
));
3730 tline
->type
= TOK_STRING
;
3734 if (!strcmp("__LINE__", m
->name
)) {
3735 nasm_free(tline
->text
);
3736 make_tok_num(tline
, src_get_linnum());
3739 if (!strcmp("__BITS__", m
->name
)) {
3740 nasm_free(tline
->text
);
3741 make_tok_num(tline
, globalbits
);
3744 tline
= delete_Token(tline
);
3749 * Complicated case: at least one macro with this name
3750 * exists and takes parameters. We must find the
3751 * parameters in the call, count them, find the SMacro
3752 * that corresponds to that form of the macro call, and
3753 * substitute for the parameters when we expand. What a
3756 /*tline = tline->next;
3757 skip_white_(tline); */
3760 while (tok_type_(t
, TOK_SMAC_END
)) {
3761 t
->a
.mac
->in_progress
= false;
3763 t
= tline
->next
= delete_Token(t
);
3766 } while (tok_type_(tline
, TOK_WHITESPACE
));
3767 if (!tok_is_(tline
, "(")) {
3769 * This macro wasn't called with parameters: ignore
3770 * the call. (Behaviour borrowed from gnu cpp.)
3779 sparam
= PARAM_DELTA
;
3780 params
= nasm_malloc(sparam
* sizeof(Token
*));
3781 params
[0] = tline
->next
;
3782 paramsize
= nasm_malloc(sparam
* sizeof(int));
3784 while (true) { /* parameter loop */
3786 * For some unusual expansions
3787 * which concatenates function call
3790 while (tok_type_(t
, TOK_SMAC_END
)) {
3791 t
->a
.mac
->in_progress
= false;
3793 t
= tline
->next
= delete_Token(t
);
3799 "macro call expects terminating `)'");
3802 if (tline
->type
== TOK_WHITESPACE
3804 if (paramsize
[nparam
])
3807 params
[nparam
] = tline
->next
;
3808 continue; /* parameter loop */
3810 if (tline
->type
== TOK_OTHER
3811 && tline
->text
[1] == 0) {
3812 char ch
= tline
->text
[0];
3813 if (ch
== ',' && !paren
&& brackets
<= 0) {
3814 if (++nparam
>= sparam
) {
3815 sparam
+= PARAM_DELTA
;
3816 params
= nasm_realloc(params
,
3821 nasm_realloc(paramsize
,
3825 params
[nparam
] = tline
->next
;
3826 paramsize
[nparam
] = 0;
3828 continue; /* parameter loop */
3831 (brackets
> 0 || (brackets
== 0 &&
3832 !paramsize
[nparam
])))
3834 if (!(brackets
++)) {
3835 params
[nparam
] = tline
->next
;
3836 continue; /* parameter loop */
3839 if (ch
== '}' && brackets
> 0)
3840 if (--brackets
== 0) {
3842 continue; /* parameter loop */
3844 if (ch
== '(' && !brackets
)
3846 if (ch
== ')' && brackets
<= 0)
3852 error(ERR_NONFATAL
, "braces do not "
3853 "enclose all of macro parameter");
3855 paramsize
[nparam
] += white
+ 1;
3857 } /* parameter loop */
3859 while (m
&& (m
->nparam
!= nparam
||
3860 mstrcmp(m
->name
, mname
,
3864 error(ERR_WARNING
|ERR_PASS1
|ERR_WARN_MNP
,
3865 "macro `%s' exists, "
3866 "but not taking %d parameters",
3867 mstart
->text
, nparam
);
3870 if (m
&& m
->in_progress
)
3872 if (!m
) { /* in progess or didn't find '(' or wrong nparam */
3874 * Design question: should we handle !tline, which
3875 * indicates missing ')' here, or expand those
3876 * macros anyway, which requires the (t) test a few
3880 nasm_free(paramsize
);
3884 * Expand the macro: we are placed on the last token of the
3885 * call, so that we can easily split the call from the
3886 * following tokens. We also start by pushing an SMAC_END
3887 * token for the cycle removal.
3894 tt
= new_Token(tline
, TOK_SMAC_END
, NULL
, 0);
3896 m
->in_progress
= true;
3898 for (t
= m
->expansion
; t
; t
= t
->next
) {
3899 if (t
->type
>= TOK_SMAC_PARAM
) {
3900 Token
*pcopy
= tline
, **ptail
= &pcopy
;
3904 ttt
= params
[t
->type
- TOK_SMAC_PARAM
];
3905 for (i
= paramsize
[t
->type
- TOK_SMAC_PARAM
];
3908 new_Token(tline
, ttt
->type
, ttt
->text
,
3914 } else if (t
->type
== TOK_PREPROC_Q
) {
3915 tt
= new_Token(tline
, TOK_ID
, mname
, 0);
3917 } else if (t
->type
== TOK_PREPROC_QQ
) {
3918 tt
= new_Token(tline
, TOK_ID
, m
->name
, 0);
3921 tt
= new_Token(tline
, t
->type
, t
->text
, 0);
3927 * Having done that, get rid of the macro call, and clean
3928 * up the parameters.
3931 nasm_free(paramsize
);
3934 continue; /* main token loop */
3939 if (tline
->type
== TOK_SMAC_END
) {
3940 tline
->a
.mac
->in_progress
= false;
3941 tline
= delete_Token(tline
);
3944 tline
= tline
->next
;
3952 * Now scan the entire line and look for successive TOK_IDs that resulted
3953 * after expansion (they can't be produced by tokenize()). The successive
3954 * TOK_IDs should be concatenated.
3955 * Also we look for %+ tokens and concatenate the tokens before and after
3956 * them (without white spaces in between).
3958 if (expanded
&& paste_tokens(&thead
, true)) {
3960 * If we concatenated something, *and* we had previously expanded
3961 * an actual macro, scan the lines again for macros...
3970 *org_tline
= *thead
;
3971 /* since we just gave text to org_line, don't free it */
3973 delete_Token(thead
);
3975 /* the expression expanded to empty line;
3976 we can't return NULL for some reasons
3977 we just set the line to a single WHITESPACE token. */
3978 memset(org_tline
, 0, sizeof(*org_tline
));
3979 org_tline
->text
= NULL
;
3980 org_tline
->type
= TOK_WHITESPACE
;
3989 * Similar to expand_smacro but used exclusively with macro identifiers
3990 * right before they are fetched in. The reason is that there can be
3991 * identifiers consisting of several subparts. We consider that if there
3992 * are more than one element forming the name, user wants a expansion,
3993 * otherwise it will be left as-is. Example:
3997 * the identifier %$abc will be left as-is so that the handler for %define
3998 * will suck it and define the corresponding value. Other case:
4000 * %define _%$abc cde
4002 * In this case user wants name to be expanded *before* %define starts
4003 * working, so we'll expand %$abc into something (if it has a value;
4004 * otherwise it will be left as-is) then concatenate all successive
4007 static Token
*expand_id(Token
* tline
)
4009 Token
*cur
, *oldnext
= NULL
;
4011 if (!tline
|| !tline
->next
)
4016 (cur
->next
->type
== TOK_ID
||
4017 cur
->next
->type
== TOK_PREPROC_ID
4018 || cur
->next
->type
== TOK_NUMBER
))
4021 /* If identifier consists of just one token, don't expand */
4026 oldnext
= cur
->next
; /* Detach the tail past identifier */
4027 cur
->next
= NULL
; /* so that expand_smacro stops here */
4030 tline
= expand_smacro(tline
);
4033 /* expand_smacro possibly changhed tline; re-scan for EOL */
4035 while (cur
&& cur
->next
)
4038 cur
->next
= oldnext
;
4045 * Determine whether the given line constitutes a multi-line macro
4046 * call, and return the MMacro structure called if so. Doesn't have
4047 * to check for an initial label - that's taken care of in
4048 * expand_mmacro - but must check numbers of parameters. Guaranteed
4049 * to be called with tline->type == TOK_ID, so the putative macro
4050 * name is easy to find.
4052 static MMacro
*is_mmacro(Token
* tline
, Token
*** params_array
)
4058 head
= (MMacro
*) hash_findix(&mmacros
, tline
->text
);
4061 * Efficiency: first we see if any macro exists with the given
4062 * name. If not, we can return NULL immediately. _Then_ we
4063 * count the parameters, and then we look further along the
4064 * list if necessary to find the proper MMacro.
4066 for (m
= head
; m
; m
= m
->next
)
4067 if (!mstrcmp(m
->name
, tline
->text
, m
->casesense
))
4073 * OK, we have a potential macro. Count and demarcate the
4076 count_mmac_params(tline
->next
, &nparam
, ¶ms
);
4079 * So we know how many parameters we've got. Find the MMacro
4080 * structure that handles this number.
4083 if (m
->nparam_min
<= nparam
4084 && (m
->plus
|| nparam
<= m
->nparam_max
)) {
4086 * This one is right. Just check if cycle removal
4087 * prohibits us using it before we actually celebrate...
4089 if (m
->in_progress
> m
->max_depth
) {
4090 if (m
->max_depth
> 0) {
4092 "reached maximum recursion depth of %i",
4099 * It's right, and we can use it. Add its default
4100 * parameters to the end of our list if necessary.
4102 if (m
->defaults
&& nparam
< m
->nparam_min
+ m
->ndefs
) {
4104 nasm_realloc(params
,
4105 ((m
->nparam_min
+ m
->ndefs
+
4106 1) * sizeof(*params
)));
4107 while (nparam
< m
->nparam_min
+ m
->ndefs
) {
4108 params
[nparam
] = m
->defaults
[nparam
- m
->nparam_min
];
4113 * If we've gone over the maximum parameter count (and
4114 * we're in Plus mode), ignore parameters beyond
4117 if (m
->plus
&& nparam
> m
->nparam_max
)
4118 nparam
= m
->nparam_max
;
4120 * Then terminate the parameter list, and leave.
4122 if (!params
) { /* need this special case */
4123 params
= nasm_malloc(sizeof(*params
));
4126 params
[nparam
] = NULL
;
4127 *params_array
= params
;
4131 * This one wasn't right: look for the next one with the
4134 for (m
= m
->next
; m
; m
= m
->next
)
4135 if (!mstrcmp(m
->name
, tline
->text
, m
->casesense
))
4140 * After all that, we didn't find one with the right number of
4141 * parameters. Issue a warning, and fail to expand the macro.
4143 error(ERR_WARNING
|ERR_PASS1
|ERR_WARN_MNP
,
4144 "macro `%s' exists, but not taking %d parameters",
4145 tline
->text
, nparam
);
4152 * Save MMacro invocation specific fields in
4153 * preparation for a recursive macro expansion
4155 static void push_mmacro(MMacro
*m
)
4157 MMacroInvocation
*i
;
4159 i
= nasm_malloc(sizeof(MMacroInvocation
));
4161 i
->params
= m
->params
;
4162 i
->iline
= m
->iline
;
4163 i
->nparam
= m
->nparam
;
4164 i
->rotate
= m
->rotate
;
4165 i
->paramlen
= m
->paramlen
;
4166 i
->unique
= m
->unique
;
4172 * Restore MMacro invocation specific fields that were
4173 * saved during a previous recursive macro expansion
4175 static void pop_mmacro(MMacro
*m
)
4177 MMacroInvocation
*i
;
4179 if(m
->prev
!= NULL
){
4182 m
->params
= i
->params
;
4183 m
->iline
= i
->iline
;
4184 m
->nparam
= i
->nparam
;
4185 m
->rotate
= i
->rotate
;
4186 m
->paramlen
= i
->paramlen
;
4187 m
->unique
= i
->unique
;
4194 * Expand the multi-line macro call made by the given line, if
4195 * there is one to be expanded. If there is, push the expansion on
4196 * istk->expansion and return 1. Otherwise return 0.
4198 static int expand_mmacro(Token
* tline
)
4200 Token
*startline
= tline
;
4201 Token
*label
= NULL
;
4202 int dont_prepend
= 0;
4203 Token
**params
, *t
, *mtok
, *tt
;
4206 int i
, nparam
, *paramlen
;
4211 /* if (!tok_type_(t, TOK_ID)) Lino 02/25/02 */
4212 if (!tok_type_(t
, TOK_ID
) && !tok_type_(t
, TOK_PREPROC_ID
))
4215 m
= is_mmacro(t
, ¶ms
);
4221 * We have an id which isn't a macro call. We'll assume
4222 * it might be a label; we'll also check to see if a
4223 * colon follows it. Then, if there's another id after
4224 * that lot, we'll check it again for macro-hood.
4228 if (tok_type_(t
, TOK_WHITESPACE
))
4229 last
= t
, t
= t
->next
;
4230 if (tok_is_(t
, ":")) {
4232 last
= t
, t
= t
->next
;
4233 if (tok_type_(t
, TOK_WHITESPACE
))
4234 last
= t
, t
= t
->next
;
4236 if (!tok_type_(t
, TOK_ID
) || (m
= is_mmacro(t
, ¶ms
)) == NULL
)
4244 * Fix up the parameters: this involves stripping leading and
4245 * trailing whitespace, then stripping braces if they are
4248 for (nparam
= 0; params
[nparam
]; nparam
++) ;
4249 paramlen
= nparam
? nasm_malloc(nparam
* sizeof(*paramlen
)) : NULL
;
4251 for (i
= 0; params
[i
]; i
++) {
4253 int comma
= (!m
->plus
|| i
< nparam
- 1);
4257 if (tok_is_(t
, "{"))
4258 t
= t
->next
, brace
= true, comma
= false;
4262 if (comma
&& t
->type
== TOK_OTHER
&& !strcmp(t
->text
, ","))
4263 break; /* ... because we have hit a comma */
4264 if (comma
&& t
->type
== TOK_WHITESPACE
4265 && tok_is_(t
->next
, ","))
4266 break; /* ... or a space then a comma */
4267 if (brace
&& t
->type
== TOK_OTHER
&& !strcmp(t
->text
, "}"))
4268 break; /* ... or a brace */
4275 * OK, we have a MMacro structure together with a set of
4276 * parameters. We must now go through the expansion and push
4277 * copies of each Line on to istk->expansion. Substitution of
4278 * parameter tokens and macro-local tokens doesn't get done
4279 * until the single-line macro substitution process; this is
4280 * because delaying them allows us to change the semantics
4281 * later through %rotate.
4283 * First, push an end marker on to istk->expansion, mark this
4284 * macro as in progress, and set up its invocation-specific
4287 ll
= nasm_malloc(sizeof(Line
));
4288 ll
->next
= istk
->expansion
;
4291 istk
->expansion
= ll
;
4294 * Save the previous MMacro expansion in the case of
4297 if (m
->max_depth
&& m
->in_progress
)
4305 m
->paramlen
= paramlen
;
4306 m
->unique
= unique
++;
4309 m
->next_active
= istk
->mstk
;
4312 for (l
= m
->expansion
; l
; l
= l
->next
) {
4315 ll
= nasm_malloc(sizeof(Line
));
4316 ll
->finishes
= NULL
;
4317 ll
->next
= istk
->expansion
;
4318 istk
->expansion
= ll
;
4321 for (t
= l
->first
; t
; t
= t
->next
) {
4325 tt
= *tail
= new_Token(NULL
, TOK_ID
, mname
, 0);
4327 case TOK_PREPROC_QQ
:
4328 tt
= *tail
= new_Token(NULL
, TOK_ID
, m
->name
, 0);
4330 case TOK_PREPROC_ID
:
4331 if (t
->text
[1] == '0' && t
->text
[2] == '0') {
4339 tt
= *tail
= new_Token(NULL
, x
->type
, x
->text
, 0);
4348 * If we had a label, push it on as the first line of
4349 * the macro expansion.
4352 if (dont_prepend
< 0)
4353 free_tlist(startline
);
4355 ll
= nasm_malloc(sizeof(Line
));
4356 ll
->finishes
= NULL
;
4357 ll
->next
= istk
->expansion
;
4358 istk
->expansion
= ll
;
4359 ll
->first
= startline
;
4360 if (!dont_prepend
) {
4362 label
= label
->next
;
4363 label
->next
= tt
= new_Token(NULL
, TOK_OTHER
, ":", 0);
4368 list
->uplevel(m
->nolist
? LIST_MACRO_NOLIST
: LIST_MACRO
);
4373 /* The function that actually does the error reporting */
4374 static void verror(int severity
, const char *fmt
, va_list arg
)
4378 vsnprintf(buff
, sizeof(buff
), fmt
, arg
);
4380 if (istk
&& istk
->mstk
&& istk
->mstk
->name
)
4381 _error(severity
, "(%s:%d) %s", istk
->mstk
->name
,
4382 istk
->mstk
->lineno
, buff
);
4384 _error(severity
, "%s", buff
);
4388 * Since preprocessor always operate only on the line that didn't
4389 * arrived yet, we should always use ERR_OFFBY1.
4391 static void error(int severity
, const char *fmt
, ...)
4395 /* If we're in a dead branch of IF or something like it, ignore the error */
4396 if (istk
&& istk
->conds
&& !emitting(istk
->conds
->state
))
4400 verror(severity
, fmt
, arg
);
4405 * Because %else etc are evaluated in the state context
4406 * of the previous branch, errors might get lost with error():
4407 * %if 0 ... %else trailing garbage ... %endif
4408 * So %else etc should report errors with this function.
4410 static void error_precond(int severity
, const char *fmt
, ...)
4414 /* Only ignore the error if it's really in a dead branch */
4415 if (istk
&& istk
->conds
&& istk
->conds
->state
== COND_NEVER
)
4419 verror(severity
, fmt
, arg
);
4424 pp_reset(char *file
, int apass
, efunc errfunc
, evalfunc eval
,
4425 ListGen
* listgen
, StrList
**deplist
)
4431 istk
= nasm_malloc(sizeof(Include
));
4434 istk
->expansion
= NULL
;
4436 istk
->fp
= fopen(file
, "r");
4438 src_set_fname(nasm_strdup(file
));
4442 error(ERR_FATAL
|ERR_NOFILE
, "unable to open input file `%s'",
4445 nested_mac_count
= 0;
4446 nested_rep_count
= 0;
4449 if (tasm_compatible_mode
) {
4450 stdmacpos
= nasm_stdmac
;
4452 stdmacpos
= nasm_stdmac_after_tasm
;
4454 any_extrastdmac
= extrastdmac
&& *extrastdmac
;
4460 * 0 for dependencies, 1 for preparatory passes, 2 for final pass.
4461 * The caller, however, will also pass in 3 for preprocess-only so
4462 * we can set __PASS__ accordingly.
4464 pass
= apass
> 2 ? 2 : apass
;
4466 dephead
= deptail
= deplist
;
4468 StrList
*sl
= nasm_malloc(strlen(file
)+1+sizeof sl
->next
);
4470 strcpy(sl
->str
, file
);
4472 deptail
= &sl
->next
;
4476 * Define the __PASS__ macro. This is defined here unlike
4477 * all the other builtins, because it is special -- it varies between
4480 t
= nasm_malloc(sizeof(*t
));
4482 make_tok_num(t
, apass
);
4484 define_smacro(NULL
, "__PASS__", true, 0, t
);
4487 static char *pp_getline(void)
4494 * Fetch a tokenized line, either from the macro-expansion
4495 * buffer or from the input file.
4498 while (istk
->expansion
&& istk
->expansion
->finishes
) {
4499 Line
*l
= istk
->expansion
;
4500 if (!l
->finishes
->name
&& l
->finishes
->in_progress
> 1) {
4504 * This is a macro-end marker for a macro with no
4505 * name, which means it's not really a macro at all
4506 * but a %rep block, and the `in_progress' field is
4507 * more than 1, meaning that we still need to
4508 * repeat. (1 means the natural last repetition; 0
4509 * means termination by %exitrep.) We have
4510 * therefore expanded up to the %endrep, and must
4511 * push the whole block on to the expansion buffer
4512 * again. We don't bother to remove the macro-end
4513 * marker: we'd only have to generate another one
4516 l
->finishes
->in_progress
--;
4517 for (l
= l
->finishes
->expansion
; l
; l
= l
->next
) {
4518 Token
*t
, *tt
, **tail
;
4520 ll
= nasm_malloc(sizeof(Line
));
4521 ll
->next
= istk
->expansion
;
4522 ll
->finishes
= NULL
;
4526 for (t
= l
->first
; t
; t
= t
->next
) {
4527 if (t
->text
|| t
->type
== TOK_WHITESPACE
) {
4529 new_Token(NULL
, t
->type
, t
->text
, 0);
4534 istk
->expansion
= ll
;
4538 * Check whether a `%rep' was started and not ended
4539 * within this macro expansion. This can happen and
4540 * should be detected. It's a fatal error because
4541 * I'm too confused to work out how to recover
4547 "defining with name in expansion");
4548 else if (istk
->mstk
->name
)
4550 "`%%rep' without `%%endrep' within"
4551 " expansion of macro `%s'",
4556 * FIXME: investigate the relationship at this point between
4557 * istk->mstk and l->finishes
4560 MMacro
*m
= istk
->mstk
;
4561 istk
->mstk
= m
->next_active
;
4564 * This was a real macro call, not a %rep, and
4565 * therefore the parameter information needs to
4568 if (m
->prev
!= NULL
) {
4571 nasm_free(m
->params
);
4572 free_tlist(m
->iline
);
4573 nasm_free(m
->paramlen
);
4575 l
->finishes
->in_progress
--;
4579 istk
->expansion
= l
->next
;
4581 list
->downlevel(LIST_MACRO
);
4584 while (1) { /* until we get a line we can use */
4586 if (istk
->expansion
) { /* from a macro expansion */
4588 Line
*l
= istk
->expansion
;
4590 istk
->mstk
->lineno
++;
4592 istk
->expansion
= l
->next
;
4594 p
= detoken(tline
, false);
4595 list
->line(LIST_MACRO
, p
);
4600 if (line
) { /* from the current input file */
4601 line
= prepreproc(line
);
4602 tline
= tokenize(line
);
4607 * The current file has ended; work down the istk
4614 "expected `%%endif' before end of file");
4615 /* only set line and file name if there's a next node */
4617 src_set_linnum(i
->lineno
);
4618 nasm_free(src_set_fname(i
->fname
));
4621 list
->downlevel(LIST_INCLUDE
);
4625 if (istk
->expansion
&& istk
->expansion
->finishes
)
4631 * We must expand MMacro parameters and MMacro-local labels
4632 * _before_ we plunge into directive processing, to cope
4633 * with things like `%define something %1' such as STRUC
4634 * uses. Unless we're _defining_ a MMacro, in which case
4635 * those tokens should be left alone to go into the
4636 * definition; and unless we're in a non-emitting
4637 * condition, in which case we don't want to meddle with
4640 if (!defining
&& !(istk
->conds
&& !emitting(istk
->conds
->state
))
4641 && !(istk
->mstk
&& !istk
->mstk
->in_progress
)) {
4642 tline
= expand_mmac_params(tline
);
4646 * Check the line to see if it's a preprocessor directive.
4648 if (do_directive(tline
) == DIRECTIVE_FOUND
) {
4650 } else if (defining
) {
4652 * We're defining a multi-line macro. We emit nothing
4654 * shove the tokenized line on to the macro definition.
4656 Line
*l
= nasm_malloc(sizeof(Line
));
4657 l
->next
= defining
->expansion
;
4660 defining
->expansion
= l
;
4662 } else if (istk
->conds
&& !emitting(istk
->conds
->state
)) {
4664 * We're in a non-emitting branch of a condition block.
4665 * Emit nothing at all, not even a blank line: when we
4666 * emerge from the condition we'll give a line-number
4667 * directive so we keep our place correctly.
4671 } else if (istk
->mstk
&& !istk
->mstk
->in_progress
) {
4673 * We're in a %rep block which has been terminated, so
4674 * we're walking through to the %endrep without
4675 * emitting anything. Emit nothing at all, not even a
4676 * blank line: when we emerge from the %rep block we'll
4677 * give a line-number directive so we keep our place
4683 tline
= expand_smacro(tline
);
4684 if (!expand_mmacro(tline
)) {
4686 * De-tokenize the line again, and emit it.
4688 line
= detoken(tline
, true);
4692 continue; /* expand_mmacro calls free_tlist */
4700 static void pp_cleanup(int pass
)
4703 if(defining
->name
) {
4705 "end of file while still defining macro `%s'",
4708 error(ERR_NONFATAL
, "end of file while still in %%rep");
4711 free_mmacro(defining
);
4720 nasm_free(i
->fname
);
4725 nasm_free(src_set_fname(NULL
));
4730 while ((i
= ipath
)) {
4739 void pp_include_path(char *path
)
4743 i
= nasm_malloc(sizeof(IncPath
));
4744 i
->path
= path
? nasm_strdup(path
) : NULL
;
4747 if (ipath
!= NULL
) {
4749 while (j
->next
!= NULL
)
4757 void pp_pre_include(char *fname
)
4759 Token
*inc
, *space
, *name
;
4762 name
= new_Token(NULL
, TOK_INTERNAL_STRING
, fname
, 0);
4763 space
= new_Token(name
, TOK_WHITESPACE
, NULL
, 0);
4764 inc
= new_Token(space
, TOK_PREPROC_ID
, "%include", 0);
4766 l
= nasm_malloc(sizeof(Line
));
4773 void pp_pre_define(char *definition
)
4779 equals
= strchr(definition
, '=');
4780 space
= new_Token(NULL
, TOK_WHITESPACE
, NULL
, 0);
4781 def
= new_Token(space
, TOK_PREPROC_ID
, "%define", 0);
4784 space
->next
= tokenize(definition
);
4788 l
= nasm_malloc(sizeof(Line
));
4795 void pp_pre_undefine(char *definition
)
4800 space
= new_Token(NULL
, TOK_WHITESPACE
, NULL
, 0);
4801 def
= new_Token(space
, TOK_PREPROC_ID
, "%undef", 0);
4802 space
->next
= tokenize(definition
);
4804 l
= nasm_malloc(sizeof(Line
));
4812 * Added by Keith Kanios:
4814 * This function is used to assist with "runtime" preprocessor
4815 * directives. (e.g. pp_runtime("%define __BITS__ 64");)
4817 * ERRORS ARE IGNORED HERE, SO MAKE COMPLETELY SURE THAT YOU
4818 * PASS A VALID STRING TO THIS FUNCTION!!!!!
4821 void pp_runtime(char *definition
)
4825 def
= tokenize(definition
);
4826 if(do_directive(def
) == NO_DIRECTIVE_FOUND
)
4831 void pp_extra_stdmac(macros_t
*macros
)
4833 extrastdmac
= macros
;
4836 static void make_tok_num(Token
* tok
, int64_t val
)
4839 snprintf(numbuf
, sizeof(numbuf
), "%"PRId64
"", val
);
4840 tok
->text
= nasm_strdup(numbuf
);
4841 tok
->type
= TOK_NUMBER
;