Fix memory management issues with expanded %include
[nasm/avx512.git] / preproc.c
blob40526729318b00c3985aefc9b3ca3e36fb467a25
1 /* preproc.c macro preprocessor for the Netwide Assembler
3 * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
4 * Julian Hall. All rights reserved. The software is
5 * redistributable under the license given in the file "LICENSE"
6 * distributed in the NASM archive.
8 * initial version 18/iii/97 by Simon Tatham
9 */
11 /* Typical flow of text through preproc
13 * pp_getline gets tokenized lines, either
15 * from a macro expansion
17 * or
18 * {
19 * read_line gets raw text from stdmacpos, or predef, or current input file
20 * tokenize converts to tokens
21 * }
23 * expand_mmac_params is used to expand %1 etc., unless a macro is being
24 * defined or a false conditional is being processed
25 * (%0, %1, %+1, %-1, %%foo
27 * do_directive checks for directives
29 * expand_smacro is used to expand single line macros
31 * expand_mmacro is used to expand multi-line macros
33 * detoken is used to convert the line back to text
36 #include "compiler.h"
38 #include <stdio.h>
39 #include <stdarg.h>
40 #include <stdlib.h>
41 #include <stddef.h>
42 #include <string.h>
43 #include <ctype.h>
44 #include <limits.h>
45 #include <inttypes.h>
47 #include "nasm.h"
48 #include "nasmlib.h"
49 #include "preproc.h"
50 #include "hashtbl.h"
51 #include "quote.h"
52 #include "stdscan.h"
53 #include "tokens.h"
54 #include "tables.h"
56 typedef struct SMacro SMacro;
57 typedef struct MMacro MMacro;
58 typedef struct Context Context;
59 typedef struct Token Token;
60 typedef struct Blocks Blocks;
61 typedef struct Line Line;
62 typedef struct Include Include;
63 typedef struct Cond Cond;
64 typedef struct IncPath IncPath;
67 * Note on the storage of both SMacro and MMacros: the hash table
68 * indexes them case-insensitively, and we then have to go through a
69 * linked list of potential case aliases (and, for MMacros, parameter
70 * ranges); this is to preserve the matching semantics of the earlier
71 * code. If the number of case aliases for a specific macro is a
72 * performance issue, you may want to reconsider your coding style.
76 * Store the definition of a single-line macro.
78 struct SMacro {
79 SMacro *next;
80 char *name;
81 bool casesense;
82 bool in_progress;
83 unsigned int nparam;
84 Token *expansion;
88 * Store the definition of a multi-line macro. This is also used to
89 * store the interiors of `%rep...%endrep' blocks, which are
90 * effectively self-re-invoking multi-line macros which simply
91 * don't have a name or bother to appear in the hash tables. %rep
92 * blocks are signified by having a NULL `name' field.
94 * In a MMacro describing a `%rep' block, the `in_progress' field
95 * isn't merely boolean, but gives the number of repeats left to
96 * run.
98 * The `next' field is used for storing MMacros in hash tables; the
99 * `next_active' field is for stacking them on istk entries.
101 * When a MMacro is being expanded, `params', `iline', `nparam',
102 * `paramlen', `rotate' and `unique' are local to the invocation.
104 struct MMacro {
105 MMacro *next;
106 char *name;
107 int nparam_min, nparam_max;
108 bool casesense;
109 bool plus; /* is the last parameter greedy? */
110 bool nolist; /* is this macro listing-inhibited? */
111 int64_t in_progress;
112 Token *dlist; /* All defaults as one list */
113 Token **defaults; /* Parameter default pointers */
114 int ndefs; /* number of default parameters */
115 Line *expansion;
117 MMacro *next_active;
118 MMacro *rep_nest; /* used for nesting %rep */
119 Token **params; /* actual parameters */
120 Token *iline; /* invocation line */
121 unsigned int nparam, rotate;
122 int *paramlen;
123 uint64_t unique;
124 int lineno; /* Current line number on expansion */
128 * The context stack is composed of a linked list of these.
130 struct Context {
131 Context *next;
132 char *name;
133 struct hash_table localmac;
134 uint32_t number;
138 * This is the internal form which we break input lines up into.
139 * Typically stored in linked lists.
141 * Note that `type' serves a double meaning: TOK_SMAC_PARAM is not
142 * necessarily used as-is, but is intended to denote the number of
143 * the substituted parameter. So in the definition
145 * %define a(x,y) ( (x) & ~(y) )
147 * the token representing `x' will have its type changed to
148 * TOK_SMAC_PARAM, but the one representing `y' will be
149 * TOK_SMAC_PARAM+1.
151 * TOK_INTERNAL_STRING is a dirty hack: it's a single string token
152 * which doesn't need quotes around it. Used in the pre-include
153 * mechanism as an alternative to trying to find a sensible type of
154 * quote to use on the filename we were passed.
156 enum pp_token_type {
157 TOK_NONE = 0, TOK_WHITESPACE, TOK_COMMENT, TOK_ID,
158 TOK_PREPROC_ID, TOK_STRING,
159 TOK_NUMBER, TOK_FLOAT, TOK_SMAC_END, TOK_OTHER,
160 TOK_INTERNAL_STRING,
161 TOK_PREPROC_Q, TOK_PREPROC_QQ,
162 TOK_SMAC_PARAM, /* MUST BE LAST IN THE LIST!!! */
163 TOK_MAX = INT_MAX /* Keep compiler from reducing the range */
166 struct Token {
167 Token *next;
168 char *text;
169 SMacro *mac; /* associated macro for TOK_SMAC_END */
170 enum pp_token_type type;
174 * Multi-line macro definitions are stored as a linked list of
175 * these, which is essentially a container to allow several linked
176 * lists of Tokens.
178 * Note that in this module, linked lists are treated as stacks
179 * wherever possible. For this reason, Lines are _pushed_ on to the
180 * `expansion' field in MMacro structures, so that the linked list,
181 * if walked, would give the macro lines in reverse order; this
182 * means that we can walk the list when expanding a macro, and thus
183 * push the lines on to the `expansion' field in _istk_ in reverse
184 * order (so that when popped back off they are in the right
185 * order). It may seem cockeyed, and it relies on my design having
186 * an even number of steps in, but it works...
188 * Some of these structures, rather than being actual lines, are
189 * markers delimiting the end of the expansion of a given macro.
190 * This is for use in the cycle-tracking and %rep-handling code.
191 * Such structures have `finishes' non-NULL, and `first' NULL. All
192 * others have `finishes' NULL, but `first' may still be NULL if
193 * the line is blank.
195 struct Line {
196 Line *next;
197 MMacro *finishes;
198 Token *first;
202 * To handle an arbitrary level of file inclusion, we maintain a
203 * stack (ie linked list) of these things.
205 struct Include {
206 Include *next;
207 FILE *fp;
208 Cond *conds;
209 Line *expansion;
210 char *fname;
211 int lineno, lineinc;
212 MMacro *mstk; /* stack of active macros/reps */
216 * Include search path. This is simply a list of strings which get
217 * prepended, in turn, to the name of an include file, in an
218 * attempt to find the file if it's not in the current directory.
220 struct IncPath {
221 IncPath *next;
222 char *path;
226 * Conditional assembly: we maintain a separate stack of these for
227 * each level of file inclusion. (The only reason we keep the
228 * stacks separate is to ensure that a stray `%endif' in a file
229 * included from within the true branch of a `%if' won't terminate
230 * it and cause confusion: instead, rightly, it'll cause an error.)
232 struct Cond {
233 Cond *next;
234 int state;
236 enum {
238 * These states are for use just after %if or %elif: IF_TRUE
239 * means the condition has evaluated to truth so we are
240 * currently emitting, whereas IF_FALSE means we are not
241 * currently emitting but will start doing so if a %else comes
242 * up. In these states, all directives are admissible: %elif,
243 * %else and %endif. (And of course %if.)
245 COND_IF_TRUE, COND_IF_FALSE,
247 * These states come up after a %else: ELSE_TRUE means we're
248 * emitting, and ELSE_FALSE means we're not. In ELSE_* states,
249 * any %elif or %else will cause an error.
251 COND_ELSE_TRUE, COND_ELSE_FALSE,
253 * This state means that we're not emitting now, and also that
254 * nothing until %endif will be emitted at all. It's for use in
255 * two circumstances: (i) when we've had our moment of emission
256 * and have now started seeing %elifs, and (ii) when the
257 * condition construct in question is contained within a
258 * non-emitting branch of a larger condition construct.
260 COND_NEVER
262 #define emitting(x) ( (x) == COND_IF_TRUE || (x) == COND_ELSE_TRUE )
265 * These defines are used as the possible return values for do_directive
267 #define NO_DIRECTIVE_FOUND 0
268 #define DIRECTIVE_FOUND 1
271 * Condition codes. Note that we use c_ prefix not C_ because C_ is
272 * used in nasm.h for the "real" condition codes. At _this_ level,
273 * we treat CXZ and ECXZ as condition codes, albeit non-invertible
274 * ones, so we need a different enum...
276 static const char * const conditions[] = {
277 "a", "ae", "b", "be", "c", "cxz", "e", "ecxz", "g", "ge", "l", "le",
278 "na", "nae", "nb", "nbe", "nc", "ne", "ng", "nge", "nl", "nle", "no",
279 "np", "ns", "nz", "o", "p", "pe", "po", "rcxz", "s", "z"
281 enum pp_conds {
282 c_A, c_AE, c_B, c_BE, c_C, c_CXZ, c_E, c_ECXZ, c_G, c_GE, c_L, c_LE,
283 c_NA, c_NAE, c_NB, c_NBE, c_NC, c_NE, c_NG, c_NGE, c_NL, c_NLE, c_NO,
284 c_NP, c_NS, c_NZ, c_O, c_P, c_PE, c_PO, c_RCXZ, c_S, c_Z,
285 c_none = -1
287 static const enum pp_conds inverse_ccs[] = {
288 c_NA, c_NAE, c_NB, c_NBE, c_NC, -1, c_NE, -1, c_NG, c_NGE, c_NL, c_NLE,
289 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,
290 c_Z, c_NO, c_NP, c_PO, c_PE, -1, c_NS, c_NZ
294 * Directive names.
296 /* If this is a an IF, ELIF, ELSE or ENDIF keyword */
297 static int is_condition(enum preproc_token arg)
299 return PP_IS_COND(arg) || (arg == PP_ELSE) || (arg == PP_ENDIF);
302 /* For TASM compatibility we need to be able to recognise TASM compatible
303 * conditional compilation directives. Using the NASM pre-processor does
304 * not work, so we look for them specifically from the following list and
305 * then jam in the equivalent NASM directive into the input stream.
308 enum {
309 TM_ARG, TM_ELIF, TM_ELSE, TM_ENDIF, TM_IF, TM_IFDEF, TM_IFDIFI,
310 TM_IFNDEF, TM_INCLUDE, TM_LOCAL
313 static const char * const tasm_directives[] = {
314 "arg", "elif", "else", "endif", "if", "ifdef", "ifdifi",
315 "ifndef", "include", "local"
318 static int StackSize = 4;
319 static char *StackPointer = "ebp";
320 static int ArgOffset = 8;
321 static int LocalOffset = 0;
323 static Context *cstk;
324 static Include *istk;
325 static IncPath *ipath = NULL;
327 static efunc _error; /* Pointer to client-provided error reporting function */
328 static evalfunc evaluate;
330 static int pass; /* HACK: pass 0 = generate dependencies only */
331 static StrList **dephead, **deptail; /* Dependency list */
333 static uint64_t unique; /* unique identifier numbers */
335 static Line *predef = NULL;
337 static ListGen *list;
340 * The current set of multi-line macros we have defined.
342 static struct hash_table mmacros;
345 * The current set of single-line macros we have defined.
347 static struct hash_table smacros;
350 * The multi-line macro we are currently defining, or the %rep
351 * block we are currently reading, if any.
353 static MMacro *defining;
356 * The number of macro parameters to allocate space for at a time.
358 #define PARAM_DELTA 16
361 * The standard macro set: defined in macros.c in the array nasm_stdmac.
362 * This gives our position in the macro set, when we're processing it.
364 static const char * const *stdmacpos;
367 * The extra standard macros that come from the object format, if
368 * any.
370 static const char * const *extrastdmac = NULL;
371 bool any_extrastdmac;
374 * Tokens are allocated in blocks to improve speed
376 #define TOKEN_BLOCKSIZE 4096
377 static Token *freeTokens = NULL;
378 struct Blocks {
379 Blocks *next;
380 void *chunk;
383 static Blocks blocks = { NULL, NULL };
386 * Forward declarations.
388 static Token *expand_mmac_params(Token * tline);
389 static Token *expand_smacro(Token * tline);
390 static Token *expand_id(Token * tline);
391 static Context *get_ctx(char *name, bool all_contexts);
392 static void make_tok_num(Token * tok, int64_t val);
393 static void error(int severity, const char *fmt, ...);
394 static void *new_Block(size_t size);
395 static void delete_Blocks(void);
396 static Token *new_Token(Token * next, enum pp_token_type type, char *text, int txtlen);
397 static Token *delete_Token(Token * t);
400 * Macros for safe checking of token pointers, avoid *(NULL)
402 #define tok_type_(x,t) ((x) && (x)->type == (t))
403 #define skip_white_(x) if (tok_type_((x), TOK_WHITESPACE)) (x)=(x)->next
404 #define tok_is_(x,v) (tok_type_((x), TOK_OTHER) && !strcmp((x)->text,(v)))
405 #define tok_isnt_(x,v) ((x) && ((x)->type!=TOK_OTHER || strcmp((x)->text,(v))))
407 /* Handle TASM specific directives, which do not contain a % in
408 * front of them. We do it here because I could not find any other
409 * place to do it for the moment, and it is a hack (ideally it would
410 * be nice to be able to use the NASM pre-processor to do it).
412 static char *check_tasm_directive(char *line)
414 int32_t i, j, k, m, len;
415 char *p = line, *oldline, oldchar;
417 /* Skip whitespace */
418 while (isspace(*p) && *p != 0)
419 p++;
421 /* Binary search for the directive name */
422 i = -1;
423 j = elements(tasm_directives);
424 len = 0;
425 while (!isspace(p[len]) && p[len] != 0)
426 len++;
427 if (len) {
428 oldchar = p[len];
429 p[len] = 0;
430 while (j - i > 1) {
431 k = (j + i) / 2;
432 m = nasm_stricmp(p, tasm_directives[k]);
433 if (m == 0) {
434 /* We have found a directive, so jam a % in front of it
435 * so that NASM will then recognise it as one if it's own.
437 p[len] = oldchar;
438 len = strlen(p);
439 oldline = line;
440 line = nasm_malloc(len + 2);
441 line[0] = '%';
442 if (k == TM_IFDIFI) {
443 /* NASM does not recognise IFDIFI, so we convert it to
444 * %ifdef BOGUS. This is not used in NASM comaptible
445 * code, but does need to parse for the TASM macro
446 * package.
448 strcpy(line + 1, "ifdef BOGUS");
449 } else {
450 memcpy(line + 1, p, len + 1);
452 nasm_free(oldline);
453 return line;
454 } else if (m < 0) {
455 j = k;
456 } else
457 i = k;
459 p[len] = oldchar;
461 return line;
465 * The pre-preprocessing stage... This function translates line
466 * number indications as they emerge from GNU cpp (`# lineno "file"
467 * flags') into NASM preprocessor line number indications (`%line
468 * lineno file').
470 static char *prepreproc(char *line)
472 int lineno, fnlen;
473 char *fname, *oldline;
475 if (line[0] == '#' && line[1] == ' ') {
476 oldline = line;
477 fname = oldline + 2;
478 lineno = atoi(fname);
479 fname += strspn(fname, "0123456789 ");
480 if (*fname == '"')
481 fname++;
482 fnlen = strcspn(fname, "\"");
483 line = nasm_malloc(20 + fnlen);
484 snprintf(line, 20 + fnlen, "%%line %d %.*s", lineno, fnlen, fname);
485 nasm_free(oldline);
487 if (tasm_compatible_mode)
488 return check_tasm_directive(line);
489 return line;
493 * Free a linked list of tokens.
495 static void free_tlist(Token * list)
497 while (list) {
498 list = delete_Token(list);
503 * Free a linked list of lines.
505 static void free_llist(Line * list)
507 Line *l;
508 while (list) {
509 l = list;
510 list = list->next;
511 free_tlist(l->first);
512 nasm_free(l);
517 * Free an MMacro
519 static void free_mmacro(MMacro * m)
521 nasm_free(m->name);
522 free_tlist(m->dlist);
523 nasm_free(m->defaults);
524 free_llist(m->expansion);
525 nasm_free(m);
529 * Free all currently defined macros, and free the hash tables
531 static void free_smacro_table(struct hash_table *smt)
533 SMacro *s;
534 const char *key;
535 struct hash_tbl_node *it = NULL;
537 while ((s = hash_iterate(smt, &it, &key)) != NULL) {
538 nasm_free((void *)key);
539 while (s) {
540 SMacro *ns = s->next;
541 nasm_free(s->name);
542 free_tlist(s->expansion);
543 nasm_free(s);
544 s = ns;
547 hash_free(smt);
550 static void free_mmacro_table(struct hash_table *mmt)
552 MMacro *m;
553 const char *key;
554 struct hash_tbl_node *it = NULL;
556 it = NULL;
557 while ((m = hash_iterate(mmt, &it, &key)) != NULL) {
558 nasm_free((void *)key);
559 while (m) {
560 MMacro *nm = m->next;
561 free_mmacro(m);
562 m = nm;
565 hash_free(mmt);
568 static void free_macros(void)
570 free_smacro_table(&smacros);
571 free_mmacro_table(&mmacros);
575 * Initialize the hash tables
577 static void init_macros(void)
579 hash_init(&smacros, HASH_LARGE);
580 hash_init(&mmacros, HASH_LARGE);
584 * Pop the context stack.
586 static void ctx_pop(void)
588 Context *c = cstk;
590 cstk = cstk->next;
591 free_smacro_table(&c->localmac);
592 nasm_free(c->name);
593 nasm_free(c);
597 * Search for a key in the hash index; adding it if necessary
598 * (in which case we initialize the data pointer to NULL.)
600 static void **
601 hash_findi_add(struct hash_table *hash, const char *str)
603 struct hash_insert hi;
604 void **r;
605 char *strx;
607 r = hash_findi(hash, str, &hi);
608 if (r)
609 return r;
611 strx = nasm_strdup(str); /* Use a more efficient allocator here? */
612 return hash_add(&hi, strx, NULL);
616 * Like hash_findi, but returns the data element rather than a pointer
617 * to it. Used only when not adding a new element, hence no third
618 * argument.
620 static void *
621 hash_findix(struct hash_table *hash, const char *str)
623 void **p;
625 p = hash_findi(hash, str, NULL);
626 return p ? *p : NULL;
629 #define BUF_DELTA 512
631 * Read a line from the top file in istk, handling multiple CR/LFs
632 * at the end of the line read, and handling spurious ^Zs. Will
633 * return lines from the standard macro set if this has not already
634 * been done.
636 static char *read_line(void)
638 char *buffer, *p, *q;
639 int bufsize, continued_count;
641 if (stdmacpos) {
642 if (*stdmacpos) {
643 char *ret = nasm_strdup(*stdmacpos++);
644 if (!*stdmacpos && any_extrastdmac) {
645 stdmacpos = extrastdmac;
646 any_extrastdmac = false;
647 return ret;
650 * Nasty hack: here we push the contents of `predef' on
651 * to the top-level expansion stack, since this is the
652 * most convenient way to implement the pre-include and
653 * pre-define features.
655 if (!*stdmacpos) {
656 Line *pd, *l;
657 Token *head, **tail, *t;
659 for (pd = predef; pd; pd = pd->next) {
660 head = NULL;
661 tail = &head;
662 for (t = pd->first; t; t = t->next) {
663 *tail = new_Token(NULL, t->type, t->text, 0);
664 tail = &(*tail)->next;
666 l = nasm_malloc(sizeof(Line));
667 l->next = istk->expansion;
668 l->first = head;
669 l->finishes = false;
670 istk->expansion = l;
673 return ret;
674 } else {
675 stdmacpos = NULL;
679 bufsize = BUF_DELTA;
680 buffer = nasm_malloc(BUF_DELTA);
681 p = buffer;
682 continued_count = 0;
683 while (1) {
684 q = fgets(p, bufsize - (p - buffer), istk->fp);
685 if (!q)
686 break;
687 p += strlen(p);
688 if (p > buffer && p[-1] == '\n') {
689 /* Convert backslash-CRLF line continuation sequences into
690 nothing at all (for DOS and Windows) */
691 if (((p - 2) > buffer) && (p[-3] == '\\') && (p[-2] == '\r')) {
692 p -= 3;
693 *p = 0;
694 continued_count++;
696 /* Also convert backslash-LF line continuation sequences into
697 nothing at all (for Unix) */
698 else if (((p - 1) > buffer) && (p[-2] == '\\')) {
699 p -= 2;
700 *p = 0;
701 continued_count++;
702 } else {
703 break;
706 if (p - buffer > bufsize - 10) {
707 int32_t offset = p - buffer;
708 bufsize += BUF_DELTA;
709 buffer = nasm_realloc(buffer, bufsize);
710 p = buffer + offset; /* prevent stale-pointer problems */
714 if (!q && p == buffer) {
715 nasm_free(buffer);
716 return NULL;
719 src_set_linnum(src_get_linnum() + istk->lineinc +
720 (continued_count * istk->lineinc));
723 * Play safe: remove CRs as well as LFs, if any of either are
724 * present at the end of the line.
726 while (--p >= buffer && (*p == '\n' || *p == '\r'))
727 *p = '\0';
730 * Handle spurious ^Z, which may be inserted into source files
731 * by some file transfer utilities.
733 buffer[strcspn(buffer, "\032")] = '\0';
735 list->line(LIST_READ, buffer);
737 return buffer;
741 * Tokenize a line of text. This is a very simple process since we
742 * don't need to parse the value out of e.g. numeric tokens: we
743 * simply split one string into many.
745 static Token *tokenize(char *line)
747 char *p = line;
748 enum pp_token_type type;
749 Token *list = NULL;
750 Token *t, **tail = &list;
752 while (*line) {
753 p = line;
754 if (*p == '%') {
755 p++;
756 if (isdigit(*p) ||
757 ((*p == '-' || *p == '+') && isdigit(p[1])) ||
758 ((*p == '+') && (isspace(p[1]) || !p[1]))) {
759 do {
760 p++;
762 while (isdigit(*p));
763 type = TOK_PREPROC_ID;
764 } else if (*p == '{') {
765 p++;
766 while (*p && *p != '}') {
767 p[-1] = *p;
768 p++;
770 p[-1] = '\0';
771 if (*p)
772 p++;
773 type = TOK_PREPROC_ID;
774 } else if (*p == '?') {
775 type = TOK_PREPROC_Q; /* %? */
776 p++;
777 if (*p == '?') {
778 type = TOK_PREPROC_QQ; /* %?? */
779 p++;
781 } else if (isidchar(*p) ||
782 ((*p == '!' || *p == '%' || *p == '$') &&
783 isidchar(p[1]))) {
784 do {
785 p++;
787 while (isidchar(*p));
788 type = TOK_PREPROC_ID;
789 } else {
790 type = TOK_OTHER;
791 if (*p == '%')
792 p++;
794 } else if (isidstart(*p) || (*p == '$' && isidstart(p[1]))) {
795 type = TOK_ID;
796 p++;
797 while (*p && isidchar(*p))
798 p++;
799 } else if (*p == '\'' || *p == '"' || *p == '`') {
801 * A string token.
803 type = TOK_STRING;
804 p = nasm_skip_string(p);
806 if (*p) {
807 p++;
808 } else {
809 error(ERR_WARNING, "unterminated string");
810 /* Handling unterminated strings by UNV */
811 /* type = -1; */
813 } else if (isnumstart(*p)) {
814 bool is_hex = false;
815 bool is_float = false;
816 bool has_e = false;
817 char c, *r;
820 * A numeric token.
823 if (*p == '$') {
824 p++;
825 is_hex = true;
828 for (;;) {
829 c = *p++;
831 if (!is_hex && (c == 'e' || c == 'E')) {
832 has_e = true;
833 if (*p == '+' || *p == '-') {
834 /* e can only be followed by +/- if it is either a
835 prefixed hex number or a floating-point number */
836 p++;
837 is_float = true;
839 } else if (c == 'H' || c == 'h' || c == 'X' || c == 'x') {
840 is_hex = true;
841 } else if (c == 'P' || c == 'p') {
842 is_float = true;
843 if (*p == '+' || *p == '-')
844 p++;
845 } else if (isnumchar(c) || c == '_')
846 ; /* just advance */
847 else if (c == '.') {
848 /* we need to deal with consequences of the legacy
849 parser, like "1.nolist" being two tokens
850 (TOK_NUMBER, TOK_ID) here; at least give it
851 a shot for now. In the future, we probably need
852 a flex-based scanner with proper pattern matching
853 to do it as well as it can be done. Nothing in
854 the world is going to help the person who wants
855 0x123.p16 interpreted as two tokens, though. */
856 r = p;
857 while (*r == '_')
858 r++;
860 if (isdigit(*r) || (is_hex && isxdigit(*r)) ||
861 (!is_hex && (*r == 'e' || *r == 'E')) ||
862 (*r == 'p' || *r == 'P')) {
863 p = r;
864 is_float = true;
865 } else
866 break; /* Terminate the token */
867 } else
868 break;
870 p--; /* Point to first character beyond number */
872 if (has_e && !is_hex) {
873 /* 1e13 is floating-point, but 1e13h is not */
874 is_float = true;
877 type = is_float ? TOK_FLOAT : TOK_NUMBER;
878 } else if (isspace(*p)) {
879 type = TOK_WHITESPACE;
880 p++;
881 while (*p && isspace(*p))
882 p++;
884 * Whitespace just before end-of-line is discarded by
885 * pretending it's a comment; whitespace just before a
886 * comment gets lumped into the comment.
888 if (!*p || *p == ';') {
889 type = TOK_COMMENT;
890 while (*p)
891 p++;
893 } else if (*p == ';') {
894 type = TOK_COMMENT;
895 while (*p)
896 p++;
897 } else {
899 * Anything else is an operator of some kind. We check
900 * for all the double-character operators (>>, <<, //,
901 * %%, <=, >=, ==, !=, <>, &&, ||, ^^), but anything
902 * else is a single-character operator.
904 type = TOK_OTHER;
905 if ((p[0] == '>' && p[1] == '>') ||
906 (p[0] == '<' && p[1] == '<') ||
907 (p[0] == '/' && p[1] == '/') ||
908 (p[0] == '<' && p[1] == '=') ||
909 (p[0] == '>' && p[1] == '=') ||
910 (p[0] == '=' && p[1] == '=') ||
911 (p[0] == '!' && p[1] == '=') ||
912 (p[0] == '<' && p[1] == '>') ||
913 (p[0] == '&' && p[1] == '&') ||
914 (p[0] == '|' && p[1] == '|') ||
915 (p[0] == '^' && p[1] == '^')) {
916 p++;
918 p++;
921 /* Handling unterminated string by UNV */
922 /*if (type == -1)
924 *tail = t = new_Token(NULL, TOK_STRING, line, p-line+1);
925 t->text[p-line] = *line;
926 tail = &t->next;
928 else */
929 if (type != TOK_COMMENT) {
930 *tail = t = new_Token(NULL, type, line, p - line);
931 tail = &t->next;
933 line = p;
935 return list;
939 * this function allocates a new managed block of memory and
940 * returns a pointer to the block. The managed blocks are
941 * deleted only all at once by the delete_Blocks function.
943 static void *new_Block(size_t size)
945 Blocks *b = &blocks;
947 /* first, get to the end of the linked list */
948 while (b->next)
949 b = b->next;
950 /* now allocate the requested chunk */
951 b->chunk = nasm_malloc(size);
953 /* now allocate a new block for the next request */
954 b->next = nasm_malloc(sizeof(Blocks));
955 /* and initialize the contents of the new block */
956 b->next->next = NULL;
957 b->next->chunk = NULL;
958 return b->chunk;
962 * this function deletes all managed blocks of memory
964 static void delete_Blocks(void)
966 Blocks *a, *b = &blocks;
969 * keep in mind that the first block, pointed to by blocks
970 * is a static and not dynamically allocated, so we don't
971 * free it.
973 while (b) {
974 if (b->chunk)
975 nasm_free(b->chunk);
976 a = b;
977 b = b->next;
978 if (a != &blocks)
979 nasm_free(a);
984 * this function creates a new Token and passes a pointer to it
985 * back to the caller. It sets the type and text elements, and
986 * also the mac and next elements to NULL.
988 static Token *new_Token(Token * next, enum pp_token_type type,
989 char *text, int txtlen)
991 Token *t;
992 int i;
994 if (freeTokens == NULL) {
995 freeTokens = (Token *) new_Block(TOKEN_BLOCKSIZE * sizeof(Token));
996 for (i = 0; i < TOKEN_BLOCKSIZE - 1; i++)
997 freeTokens[i].next = &freeTokens[i + 1];
998 freeTokens[i].next = NULL;
1000 t = freeTokens;
1001 freeTokens = t->next;
1002 t->next = next;
1003 t->mac = NULL;
1004 t->type = type;
1005 if (type == TOK_WHITESPACE || text == NULL) {
1006 t->text = NULL;
1007 } else {
1008 if (txtlen == 0)
1009 txtlen = strlen(text);
1010 t->text = nasm_malloc(txtlen+1);
1011 memcpy(t->text, text, txtlen);
1012 t->text[txtlen] = '\0';
1014 return t;
1017 static Token *delete_Token(Token * t)
1019 Token *next = t->next;
1020 nasm_free(t->text);
1021 t->next = freeTokens;
1022 freeTokens = t;
1023 return next;
1027 * Convert a line of tokens back into text.
1028 * If expand_locals is not zero, identifiers of the form "%$*xxx"
1029 * will be transformed into ..@ctxnum.xxx
1031 static char *detoken(Token * tlist, int expand_locals)
1033 Token *t;
1034 int len;
1035 char *line, *p;
1036 const char *q;
1038 len = 0;
1039 for (t = tlist; t; t = t->next) {
1040 if (t->type == TOK_PREPROC_ID && t->text[1] == '!') {
1041 char *p = getenv(t->text + 2);
1042 nasm_free(t->text);
1043 if (p)
1044 t->text = nasm_strdup(p);
1045 else
1046 t->text = NULL;
1048 /* Expand local macros here and not during preprocessing */
1049 if (expand_locals &&
1050 t->type == TOK_PREPROC_ID && t->text &&
1051 t->text[0] == '%' && t->text[1] == '$') {
1052 Context *ctx = get_ctx(t->text, false);
1053 if (ctx) {
1054 char buffer[40];
1055 char *p, *q = t->text + 2;
1057 q += strspn(q, "$");
1058 snprintf(buffer, sizeof(buffer), "..@%"PRIu32".", ctx->number);
1059 p = nasm_strcat(buffer, q);
1060 nasm_free(t->text);
1061 t->text = p;
1064 if (t->type == TOK_WHITESPACE) {
1065 len++;
1066 } else if (t->text) {
1067 len += strlen(t->text);
1070 p = line = nasm_malloc(len + 1);
1071 for (t = tlist; t; t = t->next) {
1072 if (t->type == TOK_WHITESPACE) {
1073 *p++ = ' ';
1074 } else if (t->text) {
1075 q = t->text;
1076 while (*q)
1077 *p++ = *q++;
1080 *p = '\0';
1081 return line;
1085 * A scanner, suitable for use by the expression evaluator, which
1086 * operates on a line of Tokens. Expects a pointer to a pointer to
1087 * the first token in the line to be passed in as its private_data
1088 * field.
1090 * FIX: This really needs to be unified with stdscan.
1092 static int ppscan(void *private_data, struct tokenval *tokval)
1094 Token **tlineptr = private_data;
1095 Token *tline;
1096 char ourcopy[MAX_KEYWORD+1], *p, *r, *s;
1098 do {
1099 tline = *tlineptr;
1100 *tlineptr = tline ? tline->next : NULL;
1102 while (tline && (tline->type == TOK_WHITESPACE ||
1103 tline->type == TOK_COMMENT));
1105 if (!tline)
1106 return tokval->t_type = TOKEN_EOS;
1108 tokval->t_charptr = tline->text;
1110 if (tline->text[0] == '$' && !tline->text[1])
1111 return tokval->t_type = TOKEN_HERE;
1112 if (tline->text[0] == '$' && tline->text[1] == '$' && !tline->text[2])
1113 return tokval->t_type = TOKEN_BASE;
1115 if (tline->type == TOK_ID) {
1116 p = tokval->t_charptr = tline->text;
1117 if (p[0] == '$') {
1118 tokval->t_charptr++;
1119 return tokval->t_type = TOKEN_ID;
1122 for (r = p, s = ourcopy; *r; r++) {
1123 if (r >= p+MAX_KEYWORD)
1124 return tokval->t_type = TOKEN_ID; /* Not a keyword */
1125 *s++ = tolower(*r);
1127 *s = '\0';
1128 /* right, so we have an identifier sitting in temp storage. now,
1129 * is it actually a register or instruction name, or what? */
1130 return nasm_token_hash(ourcopy, tokval);
1133 if (tline->type == TOK_NUMBER) {
1134 bool rn_error;
1135 tokval->t_integer = readnum(tline->text, &rn_error);
1136 if (rn_error)
1137 return tokval->t_type = TOKEN_ERRNUM; /* some malformation occurred */
1138 tokval->t_charptr = tline->text;
1139 return tokval->t_type = TOKEN_NUM;
1142 if (tline->type == TOK_FLOAT) {
1143 return tokval->t_type = TOKEN_FLOAT;
1146 if (tline->type == TOK_STRING) {
1147 char bq, *ep;
1148 bool errquote;
1149 bool rn_warn;
1150 size_t l;
1152 bq = tline->text[0];
1153 l = nasm_unquote(tline->text, &ep);
1154 if (ep[0] != bq || ep[1] != '\0')
1155 errquote = true;
1157 if (errquote)
1158 return tokval->t_type = TOKEN_ERRNUM;
1160 tokval->t_integer = readstrnum(tline->text, l, &rn_warn);
1161 if (rn_warn)
1162 error(ERR_WARNING | ERR_PASS1, "character constant too long");
1163 tokval->t_charptr = NULL;
1164 return tokval->t_type = TOKEN_NUM;
1167 if (tline->type == TOK_OTHER) {
1168 if (!strcmp(tline->text, "<<"))
1169 return tokval->t_type = TOKEN_SHL;
1170 if (!strcmp(tline->text, ">>"))
1171 return tokval->t_type = TOKEN_SHR;
1172 if (!strcmp(tline->text, "//"))
1173 return tokval->t_type = TOKEN_SDIV;
1174 if (!strcmp(tline->text, "%%"))
1175 return tokval->t_type = TOKEN_SMOD;
1176 if (!strcmp(tline->text, "=="))
1177 return tokval->t_type = TOKEN_EQ;
1178 if (!strcmp(tline->text, "<>"))
1179 return tokval->t_type = TOKEN_NE;
1180 if (!strcmp(tline->text, "!="))
1181 return tokval->t_type = TOKEN_NE;
1182 if (!strcmp(tline->text, "<="))
1183 return tokval->t_type = TOKEN_LE;
1184 if (!strcmp(tline->text, ">="))
1185 return tokval->t_type = TOKEN_GE;
1186 if (!strcmp(tline->text, "&&"))
1187 return tokval->t_type = TOKEN_DBL_AND;
1188 if (!strcmp(tline->text, "^^"))
1189 return tokval->t_type = TOKEN_DBL_XOR;
1190 if (!strcmp(tline->text, "||"))
1191 return tokval->t_type = TOKEN_DBL_OR;
1195 * We have no other options: just return the first character of
1196 * the token text.
1198 return tokval->t_type = tline->text[0];
1202 * Compare a string to the name of an existing macro; this is a
1203 * simple wrapper which calls either strcmp or nasm_stricmp
1204 * depending on the value of the `casesense' parameter.
1206 static int mstrcmp(const char *p, const char *q, bool casesense)
1208 return casesense ? strcmp(p, q) : nasm_stricmp(p, q);
1212 * Compare a string to the name of an existing macro; this is a
1213 * simple wrapper which calls either strcmp or nasm_stricmp
1214 * depending on the value of the `casesense' parameter.
1216 static int mmemcmp(const char *p, const char *q, size_t l, bool casesense)
1218 return casesense ? memcmp(p, q, l) : nasm_memicmp(p, q, l);
1222 * Return the Context structure associated with a %$ token. Return
1223 * NULL, having _already_ reported an error condition, if the
1224 * context stack isn't deep enough for the supplied number of $
1225 * signs.
1226 * If all_contexts == true, contexts that enclose current are
1227 * also scanned for such smacro, until it is found; if not -
1228 * only the context that directly results from the number of $'s
1229 * in variable's name.
1231 static Context *get_ctx(char *name, bool all_contexts)
1233 Context *ctx;
1234 SMacro *m;
1235 int i;
1237 if (!name || name[0] != '%' || name[1] != '$')
1238 return NULL;
1240 if (!cstk) {
1241 error(ERR_NONFATAL, "`%s': context stack is empty", name);
1242 return NULL;
1245 for (i = strspn(name + 2, "$"), ctx = cstk; (i > 0) && ctx; i--) {
1246 ctx = ctx->next;
1247 /* i--; Lino - 02/25/02 */
1249 if (!ctx) {
1250 error(ERR_NONFATAL, "`%s': context stack is only"
1251 " %d level%s deep", name, i - 1, (i == 2 ? "" : "s"));
1252 return NULL;
1254 if (!all_contexts)
1255 return ctx;
1257 do {
1258 /* Search for this smacro in found context */
1259 m = hash_findix(&ctx->localmac, name);
1260 while (m) {
1261 if (!mstrcmp(m->name, name, m->casesense))
1262 return ctx;
1263 m = m->next;
1265 ctx = ctx->next;
1267 while (ctx);
1268 return NULL;
1272 * Check to see if a file is already in a string list
1274 static bool in_list(const StrList *list, const char *str)
1276 while (list) {
1277 if (!strcmp(list->str, str))
1278 return true;
1279 list = list->next;
1281 return false;
1285 * Open an include file. This routine must always return a valid
1286 * file pointer if it returns - it's responsible for throwing an
1287 * ERR_FATAL and bombing out completely if not. It should also try
1288 * the include path one by one until it finds the file or reaches
1289 * the end of the path.
1291 static FILE *inc_fopen(const char *file, StrList **dhead, StrList **dtail,
1292 bool missing_ok)
1294 FILE *fp;
1295 char *prefix = "";
1296 IncPath *ip = ipath;
1297 int len = strlen(file);
1298 size_t prefix_len = 0;
1299 StrList *sl;
1301 while (1) {
1302 sl = nasm_malloc(prefix_len+len+1+sizeof sl->next);
1303 memcpy(sl->str, prefix, prefix_len);
1304 memcpy(sl->str+prefix_len, file, len+1);
1305 fp = fopen(sl->str, "r");
1306 if (fp && dhead && !in_list(*dhead, sl->str)) {
1307 sl->next = NULL;
1308 *dtail = sl;
1309 dtail = &sl->next;
1310 } else {
1311 nasm_free(sl);
1313 if (fp)
1314 return fp;
1315 if (!ip) {
1316 if (!missing_ok)
1317 break;
1318 prefix = NULL;
1319 } else {
1320 prefix = ip->path;
1321 ip = ip->next;
1323 if (prefix) {
1324 prefix_len = strlen(prefix);
1325 } else {
1326 /* -MG given and file not found */
1327 if (dhead && !in_list(*dhead, file)) {
1328 sl = nasm_malloc(len+1+sizeof sl->next);
1329 sl->next = NULL;
1330 strcpy(sl->str, file);
1331 *dtail = sl;
1332 dtail = &sl->next;
1334 return NULL;
1338 error(ERR_FATAL, "unable to open include file `%s'", file);
1339 return NULL; /* never reached - placate compilers */
1343 * Determine if we should warn on defining a single-line macro of
1344 * name `name', with `nparam' parameters. If nparam is 0 or -1, will
1345 * return true if _any_ single-line macro of that name is defined.
1346 * Otherwise, will return true if a single-line macro with either
1347 * `nparam' or no parameters is defined.
1349 * If a macro with precisely the right number of parameters is
1350 * defined, or nparam is -1, the address of the definition structure
1351 * will be returned in `defn'; otherwise NULL will be returned. If `defn'
1352 * is NULL, no action will be taken regarding its contents, and no
1353 * error will occur.
1355 * Note that this is also called with nparam zero to resolve
1356 * `ifdef'.
1358 * If you already know which context macro belongs to, you can pass
1359 * the context pointer as first parameter; if you won't but name begins
1360 * with %$ the context will be automatically computed. If all_contexts
1361 * is true, macro will be searched in outer contexts as well.
1363 static bool
1364 smacro_defined(Context * ctx, char *name, int nparam, SMacro ** defn,
1365 bool nocase)
1367 struct hash_table *smtbl;
1368 SMacro *m;
1370 if (ctx) {
1371 smtbl = &ctx->localmac;
1372 } else if (name[0] == '%' && name[1] == '$') {
1373 if (cstk)
1374 ctx = get_ctx(name, false);
1375 if (!ctx)
1376 return false; /* got to return _something_ */
1377 smtbl = &ctx->localmac;
1378 } else {
1379 smtbl = &smacros;
1381 m = (SMacro *) hash_findix(smtbl, name);
1383 while (m) {
1384 if (!mstrcmp(m->name, name, m->casesense && nocase) &&
1385 (nparam <= 0 || m->nparam == 0 || nparam == (int) m->nparam)) {
1386 if (defn) {
1387 if (nparam == (int) m->nparam || nparam == -1)
1388 *defn = m;
1389 else
1390 *defn = NULL;
1392 return true;
1394 m = m->next;
1397 return false;
1401 * Count and mark off the parameters in a multi-line macro call.
1402 * This is called both from within the multi-line macro expansion
1403 * code, and also to mark off the default parameters when provided
1404 * in a %macro definition line.
1406 static void count_mmac_params(Token * t, int *nparam, Token *** params)
1408 int paramsize, brace;
1410 *nparam = paramsize = 0;
1411 *params = NULL;
1412 while (t) {
1413 if (*nparam >= paramsize) {
1414 paramsize += PARAM_DELTA;
1415 *params = nasm_realloc(*params, sizeof(**params) * paramsize);
1417 skip_white_(t);
1418 brace = false;
1419 if (tok_is_(t, "{"))
1420 brace = true;
1421 (*params)[(*nparam)++] = t;
1422 while (tok_isnt_(t, brace ? "}" : ","))
1423 t = t->next;
1424 if (t) { /* got a comma/brace */
1425 t = t->next;
1426 if (brace) {
1428 * Now we've found the closing brace, look further
1429 * for the comma.
1431 skip_white_(t);
1432 if (tok_isnt_(t, ",")) {
1433 error(ERR_NONFATAL,
1434 "braces do not enclose all of macro parameter");
1435 while (tok_isnt_(t, ","))
1436 t = t->next;
1438 if (t)
1439 t = t->next; /* eat the comma */
1446 * Determine whether one of the various `if' conditions is true or
1447 * not.
1449 * We must free the tline we get passed.
1451 static bool if_condition(Token * tline, enum preproc_token ct)
1453 enum pp_conditional i = PP_COND(ct);
1454 bool j;
1455 Token *t, *tt, **tptr, *origline;
1456 struct tokenval tokval;
1457 expr *evalresult;
1458 enum pp_token_type needtype;
1460 origline = tline;
1462 switch (i) {
1463 case PPC_IFCTX:
1464 j = false; /* have we matched yet? */
1465 while (cstk && tline) {
1466 skip_white_(tline);
1467 if (!tline || tline->type != TOK_ID) {
1468 error(ERR_NONFATAL,
1469 "`%s' expects context identifiers", pp_directives[ct]);
1470 free_tlist(origline);
1471 return -1;
1473 if (!nasm_stricmp(tline->text, cstk->name))
1474 j = true;
1475 tline = tline->next;
1477 break;
1479 case PPC_IFDEF:
1480 j = false; /* have we matched yet? */
1481 while (tline) {
1482 skip_white_(tline);
1483 if (!tline || (tline->type != TOK_ID &&
1484 (tline->type != TOK_PREPROC_ID ||
1485 tline->text[1] != '$'))) {
1486 error(ERR_NONFATAL,
1487 "`%s' expects macro identifiers", pp_directives[ct]);
1488 goto fail;
1490 if (smacro_defined(NULL, tline->text, 0, NULL, true))
1491 j = true;
1492 tline = tline->next;
1494 break;
1496 case PPC_IFIDN:
1497 case PPC_IFIDNI:
1498 tline = expand_smacro(tline);
1499 t = tt = tline;
1500 while (tok_isnt_(tt, ","))
1501 tt = tt->next;
1502 if (!tt) {
1503 error(ERR_NONFATAL,
1504 "`%s' expects two comma-separated arguments",
1505 pp_directives[ct]);
1506 goto fail;
1508 tt = tt->next;
1509 j = true; /* assume equality unless proved not */
1510 while ((t->type != TOK_OTHER || strcmp(t->text, ",")) && tt) {
1511 if (tt->type == TOK_OTHER && !strcmp(tt->text, ",")) {
1512 error(ERR_NONFATAL, "`%s': more than one comma on line",
1513 pp_directives[ct]);
1514 goto fail;
1516 if (t->type == TOK_WHITESPACE) {
1517 t = t->next;
1518 continue;
1520 if (tt->type == TOK_WHITESPACE) {
1521 tt = tt->next;
1522 continue;
1524 if (tt->type != t->type) {
1525 j = false; /* found mismatching tokens */
1526 break;
1528 /* When comparing strings, need to unquote them first */
1529 if (t->type == TOK_STRING) {
1530 size_t l1 = nasm_unquote(t->text, NULL);
1531 size_t l2 = nasm_unquote(tt->text, NULL);
1533 if (l1 != l2) {
1534 j = false;
1535 break;
1537 if (mmemcmp(t->text, tt->text, l1, i == PPC_IFIDN)) {
1538 j = false;
1539 break;
1541 } else if (mstrcmp(tt->text, t->text, i == PPC_IFIDN) != 0) {
1542 j = false; /* found mismatching tokens */
1543 break;
1546 t = t->next;
1547 tt = tt->next;
1549 if ((t->type != TOK_OTHER || strcmp(t->text, ",")) || tt)
1550 j = false; /* trailing gunk on one end or other */
1551 break;
1553 case PPC_IFMACRO:
1555 bool found = false;
1556 MMacro searching, *mmac;
1558 tline = tline->next;
1559 skip_white_(tline);
1560 tline = expand_id(tline);
1561 if (!tok_type_(tline, TOK_ID)) {
1562 error(ERR_NONFATAL,
1563 "`%s' expects a macro name", pp_directives[ct]);
1564 goto fail;
1566 searching.name = nasm_strdup(tline->text);
1567 searching.casesense = true;
1568 searching.plus = false;
1569 searching.nolist = false;
1570 searching.in_progress = 0;
1571 searching.rep_nest = NULL;
1572 searching.nparam_min = 0;
1573 searching.nparam_max = INT_MAX;
1574 tline = expand_smacro(tline->next);
1575 skip_white_(tline);
1576 if (!tline) {
1577 } else if (!tok_type_(tline, TOK_NUMBER)) {
1578 error(ERR_NONFATAL,
1579 "`%s' expects a parameter count or nothing",
1580 pp_directives[ct]);
1581 } else {
1582 searching.nparam_min = searching.nparam_max =
1583 readnum(tline->text, &j);
1584 if (j)
1585 error(ERR_NONFATAL,
1586 "unable to parse parameter count `%s'",
1587 tline->text);
1589 if (tline && tok_is_(tline->next, "-")) {
1590 tline = tline->next->next;
1591 if (tok_is_(tline, "*"))
1592 searching.nparam_max = INT_MAX;
1593 else if (!tok_type_(tline, TOK_NUMBER))
1594 error(ERR_NONFATAL,
1595 "`%s' expects a parameter count after `-'",
1596 pp_directives[ct]);
1597 else {
1598 searching.nparam_max = readnum(tline->text, &j);
1599 if (j)
1600 error(ERR_NONFATAL,
1601 "unable to parse parameter count `%s'",
1602 tline->text);
1603 if (searching.nparam_min > searching.nparam_max)
1604 error(ERR_NONFATAL,
1605 "minimum parameter count exceeds maximum");
1608 if (tline && tok_is_(tline->next, "+")) {
1609 tline = tline->next;
1610 searching.plus = true;
1612 mmac = (MMacro *) hash_findix(&mmacros, searching.name);
1613 while (mmac) {
1614 if (!strcmp(mmac->name, searching.name) &&
1615 (mmac->nparam_min <= searching.nparam_max
1616 || searching.plus)
1617 && (searching.nparam_min <= mmac->nparam_max
1618 || mmac->plus)) {
1619 found = true;
1620 break;
1622 mmac = mmac->next;
1624 nasm_free(searching.name);
1625 j = found;
1626 break;
1629 case PPC_IFID:
1630 needtype = TOK_ID;
1631 goto iftype;
1632 case PPC_IFNUM:
1633 needtype = TOK_NUMBER;
1634 goto iftype;
1635 case PPC_IFSTR:
1636 needtype = TOK_STRING;
1637 goto iftype;
1639 iftype:
1640 t = tline = expand_smacro(tline);
1642 while (tok_type_(t, TOK_WHITESPACE) ||
1643 (needtype == TOK_NUMBER &&
1644 tok_type_(t, TOK_OTHER) &&
1645 (t->text[0] == '-' || t->text[0] == '+') &&
1646 !t->text[1]))
1647 t = t->next;
1649 j = tok_type_(t, needtype);
1650 break;
1652 case PPC_IFTOKEN:
1653 t = tline = expand_smacro(tline);
1654 while (tok_type_(t, TOK_WHITESPACE))
1655 t = t->next;
1657 j = false;
1658 if (t) {
1659 t = t->next; /* Skip the actual token */
1660 while (tok_type_(t, TOK_WHITESPACE))
1661 t = t->next;
1662 j = !t; /* Should be nothing left */
1664 break;
1666 case PPC_IFEMPTY:
1667 t = tline = expand_smacro(tline);
1668 while (tok_type_(t, TOK_WHITESPACE))
1669 t = t->next;
1671 j = !t; /* Should be empty */
1672 break;
1674 case PPC_IF:
1675 t = tline = expand_smacro(tline);
1676 tptr = &t;
1677 tokval.t_type = TOKEN_INVALID;
1678 evalresult = evaluate(ppscan, tptr, &tokval,
1679 NULL, pass | CRITICAL, error, NULL);
1680 if (!evalresult)
1681 return -1;
1682 if (tokval.t_type)
1683 error(ERR_WARNING,
1684 "trailing garbage after expression ignored");
1685 if (!is_simple(evalresult)) {
1686 error(ERR_NONFATAL,
1687 "non-constant value given to `%s'", pp_directives[ct]);
1688 goto fail;
1690 j = reloc_value(evalresult) != 0;
1691 return j;
1693 default:
1694 error(ERR_FATAL,
1695 "preprocessor directive `%s' not yet implemented",
1696 pp_directives[ct]);
1697 goto fail;
1700 free_tlist(origline);
1701 return j ^ PP_NEGATIVE(ct);
1703 fail:
1704 free_tlist(origline);
1705 return -1;
1709 * Expand macros in a string. Used in %error directives (and it should
1710 * almost certainly be removed from there, too.)
1712 * First tokenize the string, apply "expand_smacro" and then de-tokenize back.
1713 * The returned variable should ALWAYS be freed after usage.
1715 void expand_macros_in_string(char **p)
1717 Token *line = tokenize(*p);
1718 line = expand_smacro(line);
1719 *p = detoken(line, false);
1723 * Common code for defining an smacro
1725 static bool define_smacro(Context *ctx, char *mname, bool casesense,
1726 int nparam, Token *expansion)
1728 SMacro *smac, **smhead;
1729 struct hash_table *smtbl;
1731 if (smacro_defined(ctx, mname, nparam, &smac, casesense)) {
1732 if (!smac) {
1733 error(ERR_WARNING,
1734 "single-line macro `%s' defined both with and"
1735 " without parameters", mname);
1737 /* Some instances of the old code considered this a failure,
1738 some others didn't. What is the right thing to do here? */
1739 free_tlist(expansion);
1740 return false; /* Failure */
1741 } else {
1743 * We're redefining, so we have to take over an
1744 * existing SMacro structure. This means freeing
1745 * what was already in it.
1747 nasm_free(smac->name);
1748 free_tlist(smac->expansion);
1750 } else {
1751 smtbl = ctx ? &ctx->localmac : &smacros;
1752 smhead = (SMacro **) hash_findi_add(smtbl, mname);
1753 smac = nasm_malloc(sizeof(SMacro));
1754 smac->next = *smhead;
1755 *smhead = smac;
1757 smac->name = nasm_strdup(mname);
1758 smac->casesense = casesense;
1759 smac->nparam = nparam;
1760 smac->expansion = expansion;
1761 smac->in_progress = false;
1762 return true; /* Success */
1766 * Undefine an smacro
1768 static void undef_smacro(Context *ctx, const char *mname)
1770 SMacro **smhead, *s, **sp;
1771 struct hash_table *smtbl;
1773 smtbl = ctx ? &ctx->localmac : &smacros;
1774 smhead = (SMacro **)hash_findi(smtbl, mname, NULL);
1776 if (smhead) {
1778 * We now have a macro name... go hunt for it.
1780 sp = smhead;
1781 while ((s = *sp) != NULL) {
1782 if (!mstrcmp(s->name, mname, s->casesense)) {
1783 *sp = s->next;
1784 nasm_free(s->name);
1785 free_tlist(s->expansion);
1786 nasm_free(s);
1787 } else {
1788 sp = &s->next;
1795 * Decode a size directive
1797 static int parse_size(const char *str) {
1798 static const char *size_names[] =
1799 { "byte", "dword", "oword", "qword", "tword", "word", "yword" };
1800 static const int sizes[] =
1801 { 0, 1, 4, 16, 8, 10, 2, 32 };
1803 return sizes[bsii(str, size_names, elements(size_names))+1];
1807 * find and process preprocessor directive in passed line
1808 * Find out if a line contains a preprocessor directive, and deal
1809 * with it if so.
1811 * If a directive _is_ found, it is the responsibility of this routine
1812 * (and not the caller) to free_tlist() the line.
1814 * @param tline a pointer to the current tokeninzed line linked list
1815 * @return DIRECTIVE_FOUND or NO_DIRECTIVE_FOUND
1818 static int do_directive(Token * tline)
1820 enum preproc_token i;
1821 int j;
1822 bool err;
1823 int nparam;
1824 bool nolist;
1825 bool casesense;
1826 int k, m;
1827 int offset;
1828 char *p, *mname;
1829 Include *inc;
1830 Context *ctx;
1831 Cond *cond;
1832 MMacro *mmac, **mmhead;
1833 Token *t, *tt, *param_start, *macro_start, *last, **tptr, *origline;
1834 Line *l;
1835 struct tokenval tokval;
1836 expr *evalresult;
1837 MMacro *tmp_defining; /* Used when manipulating rep_nest */
1838 int64_t count;
1840 origline = tline;
1842 skip_white_(tline);
1843 if (!tok_type_(tline, TOK_PREPROC_ID) ||
1844 (tline->text[1] == '%' || tline->text[1] == '$'
1845 || tline->text[1] == '!'))
1846 return NO_DIRECTIVE_FOUND;
1848 i = pp_token_hash(tline->text);
1851 * If we're in a non-emitting branch of a condition construct,
1852 * or walking to the end of an already terminated %rep block,
1853 * we should ignore all directives except for condition
1854 * directives.
1856 if (((istk->conds && !emitting(istk->conds->state)) ||
1857 (istk->mstk && !istk->mstk->in_progress)) && !is_condition(i)) {
1858 return NO_DIRECTIVE_FOUND;
1862 * If we're defining a macro or reading a %rep block, we should
1863 * ignore all directives except for %macro/%imacro (which
1864 * generate an error), %endm/%endmacro, and (only if we're in a
1865 * %rep block) %endrep. If we're in a %rep block, another %rep
1866 * causes an error, so should be let through.
1868 if (defining && i != PP_MACRO && i != PP_IMACRO &&
1869 i != PP_ENDMACRO && i != PP_ENDM &&
1870 (defining->name || (i != PP_ENDREP && i != PP_REP))) {
1871 return NO_DIRECTIVE_FOUND;
1874 switch (i) {
1875 case PP_INVALID:
1876 error(ERR_NONFATAL, "unknown preprocessor directive `%s'",
1877 tline->text);
1878 return NO_DIRECTIVE_FOUND; /* didn't get it */
1880 case PP_STACKSIZE:
1881 /* Directive to tell NASM what the default stack size is. The
1882 * default is for a 16-bit stack, and this can be overriden with
1883 * %stacksize large.
1884 * the following form:
1886 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
1888 tline = tline->next;
1889 if (tline && tline->type == TOK_WHITESPACE)
1890 tline = tline->next;
1891 if (!tline || tline->type != TOK_ID) {
1892 error(ERR_NONFATAL, "`%%stacksize' missing size parameter");
1893 free_tlist(origline);
1894 return DIRECTIVE_FOUND;
1896 if (nasm_stricmp(tline->text, "flat") == 0) {
1897 /* All subsequent ARG directives are for a 32-bit stack */
1898 StackSize = 4;
1899 StackPointer = "ebp";
1900 ArgOffset = 8;
1901 LocalOffset = 0;
1902 } else if (nasm_stricmp(tline->text, "flat64") == 0) {
1903 /* All subsequent ARG directives are for a 64-bit stack */
1904 StackSize = 8;
1905 StackPointer = "rbp";
1906 ArgOffset = 8;
1907 LocalOffset = 0;
1908 } else if (nasm_stricmp(tline->text, "large") == 0) {
1909 /* All subsequent ARG directives are for a 16-bit stack,
1910 * far function call.
1912 StackSize = 2;
1913 StackPointer = "bp";
1914 ArgOffset = 4;
1915 LocalOffset = 0;
1916 } else if (nasm_stricmp(tline->text, "small") == 0) {
1917 /* All subsequent ARG directives are for a 16-bit stack,
1918 * far function call. We don't support near functions.
1920 StackSize = 2;
1921 StackPointer = "bp";
1922 ArgOffset = 6;
1923 LocalOffset = 0;
1924 } else {
1925 error(ERR_NONFATAL, "`%%stacksize' invalid size type");
1926 free_tlist(origline);
1927 return DIRECTIVE_FOUND;
1929 free_tlist(origline);
1930 return DIRECTIVE_FOUND;
1932 case PP_ARG:
1933 /* TASM like ARG directive to define arguments to functions, in
1934 * the following form:
1936 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
1938 offset = ArgOffset;
1939 do {
1940 char *arg, directive[256];
1941 int size = StackSize;
1943 /* Find the argument name */
1944 tline = tline->next;
1945 if (tline && tline->type == TOK_WHITESPACE)
1946 tline = tline->next;
1947 if (!tline || tline->type != TOK_ID) {
1948 error(ERR_NONFATAL, "`%%arg' missing argument parameter");
1949 free_tlist(origline);
1950 return DIRECTIVE_FOUND;
1952 arg = tline->text;
1954 /* Find the argument size type */
1955 tline = tline->next;
1956 if (!tline || tline->type != TOK_OTHER
1957 || tline->text[0] != ':') {
1958 error(ERR_NONFATAL,
1959 "Syntax error processing `%%arg' directive");
1960 free_tlist(origline);
1961 return DIRECTIVE_FOUND;
1963 tline = tline->next;
1964 if (!tline || tline->type != TOK_ID) {
1965 error(ERR_NONFATAL, "`%%arg' missing size type parameter");
1966 free_tlist(origline);
1967 return DIRECTIVE_FOUND;
1970 /* Allow macro expansion of type parameter */
1971 tt = tokenize(tline->text);
1972 tt = expand_smacro(tt);
1973 size = parse_size(tt->text);
1974 if (!size) {
1975 error(ERR_NONFATAL,
1976 "Invalid size type for `%%arg' missing directive");
1977 free_tlist(tt);
1978 free_tlist(origline);
1979 return DIRECTIVE_FOUND;
1981 free_tlist(tt);
1983 /* Round up to even stack slots */
1984 size = (size+StackSize-1) & ~(StackSize-1);
1986 /* Now define the macro for the argument */
1987 snprintf(directive, sizeof(directive), "%%define %s (%s+%d)",
1988 arg, StackPointer, offset);
1989 do_directive(tokenize(directive));
1990 offset += size;
1992 /* Move to the next argument in the list */
1993 tline = tline->next;
1994 if (tline && tline->type == TOK_WHITESPACE)
1995 tline = tline->next;
1996 } while (tline && tline->type == TOK_OTHER && tline->text[0] == ',');
1997 ArgOffset = offset;
1998 free_tlist(origline);
1999 return DIRECTIVE_FOUND;
2001 case PP_LOCAL:
2002 /* TASM like LOCAL directive to define local variables for a
2003 * function, in the following form:
2005 * LOCAL local1:WORD, local2:DWORD, local4:QWORD = LocalSize
2007 * The '= LocalSize' at the end is ignored by NASM, but is
2008 * required by TASM to define the local parameter size (and used
2009 * by the TASM macro package).
2011 offset = LocalOffset;
2012 do {
2013 char *local, directive[256];
2014 int size = StackSize;
2016 /* Find the argument name */
2017 tline = tline->next;
2018 if (tline && tline->type == TOK_WHITESPACE)
2019 tline = tline->next;
2020 if (!tline || tline->type != TOK_ID) {
2021 error(ERR_NONFATAL,
2022 "`%%local' missing argument parameter");
2023 free_tlist(origline);
2024 return DIRECTIVE_FOUND;
2026 local = tline->text;
2028 /* Find the argument size type */
2029 tline = tline->next;
2030 if (!tline || tline->type != TOK_OTHER
2031 || tline->text[0] != ':') {
2032 error(ERR_NONFATAL,
2033 "Syntax error processing `%%local' directive");
2034 free_tlist(origline);
2035 return DIRECTIVE_FOUND;
2037 tline = tline->next;
2038 if (!tline || tline->type != TOK_ID) {
2039 error(ERR_NONFATAL,
2040 "`%%local' missing size type parameter");
2041 free_tlist(origline);
2042 return DIRECTIVE_FOUND;
2045 /* Allow macro expansion of type parameter */
2046 tt = tokenize(tline->text);
2047 tt = expand_smacro(tt);
2048 size = parse_size(tt->text);
2049 if (!size) {
2050 error(ERR_NONFATAL,
2051 "Invalid size type for `%%local' missing directive");
2052 free_tlist(tt);
2053 free_tlist(origline);
2054 return DIRECTIVE_FOUND;
2056 free_tlist(tt);
2058 /* Round up to even stack slots */
2059 size = (size+StackSize-1) & ~(StackSize-1);
2061 offset += size; /* Negative offset, increment before */
2063 /* Now define the macro for the argument */
2064 snprintf(directive, sizeof(directive), "%%define %s (%s-%d)",
2065 local, StackPointer, offset);
2066 do_directive(tokenize(directive));
2068 /* Now define the assign to setup the enter_c macro correctly */
2069 snprintf(directive, sizeof(directive),
2070 "%%assign %%$localsize %%$localsize+%d", size);
2071 do_directive(tokenize(directive));
2073 /* Move to the next argument in the list */
2074 tline = tline->next;
2075 if (tline && tline->type == TOK_WHITESPACE)
2076 tline = tline->next;
2077 } while (tline && tline->type == TOK_OTHER && tline->text[0] == ',');
2078 LocalOffset = offset;
2079 free_tlist(origline);
2080 return DIRECTIVE_FOUND;
2082 case PP_CLEAR:
2083 if (tline->next)
2084 error(ERR_WARNING, "trailing garbage after `%%clear' ignored");
2085 free_macros();
2086 init_macros();
2087 free_tlist(origline);
2088 return DIRECTIVE_FOUND;
2090 case PP_DEPEND:
2091 t = tline->next = expand_smacro(tline->next);
2092 skip_white_(t);
2093 if (!t || (t->type != TOK_STRING &&
2094 t->type != TOK_INTERNAL_STRING)) {
2095 error(ERR_NONFATAL, "`%%depend' expects a file name");
2096 free_tlist(t);
2097 free_tlist(origline);
2098 return DIRECTIVE_FOUND; /* but we did _something_ */
2100 if (t->next)
2101 error(ERR_WARNING,
2102 "trailing garbage after `%%depend' ignored");
2103 p = t->text;
2104 if (t->type != TOK_INTERNAL_STRING)
2105 nasm_unquote(p, NULL);
2106 if (dephead && !in_list(*dephead, p)) {
2107 StrList *sl = nasm_malloc(strlen(p)+1+sizeof sl->next);
2108 sl->next = NULL;
2109 strcpy(sl->str, p);
2110 *deptail = sl;
2111 deptail = &sl->next;
2113 free_tlist(t);
2114 free_tlist(origline);
2115 return DIRECTIVE_FOUND;
2117 case PP_INCLUDE:
2118 t = tline->next = expand_smacro(tline->next);
2119 skip_white_(t);
2121 if (!t || (t->type != TOK_STRING &&
2122 t->type != TOK_INTERNAL_STRING)) {
2123 error(ERR_NONFATAL, "`%%include' expects a file name");
2124 free_tlist(origline);
2125 return DIRECTIVE_FOUND; /* but we did _something_ */
2127 if (t->next)
2128 error(ERR_WARNING,
2129 "trailing garbage after `%%include' ignored");
2130 p = t->text;
2131 if (t->type != TOK_INTERNAL_STRING)
2132 nasm_unquote(p, NULL);
2133 inc = nasm_malloc(sizeof(Include));
2134 inc->next = istk;
2135 inc->conds = NULL;
2136 inc->fp = inc_fopen(p, dephead, deptail, pass == 0);
2137 if (!inc->fp) {
2138 /* -MG given but file not found */
2139 nasm_free(inc);
2140 } else {
2141 inc->fname = src_set_fname(nasm_strdup(p));
2142 inc->lineno = src_set_linnum(0);
2143 inc->lineinc = 1;
2144 inc->expansion = NULL;
2145 inc->mstk = NULL;
2146 istk = inc;
2147 list->uplevel(LIST_INCLUDE);
2149 free_tlist(origline);
2150 return DIRECTIVE_FOUND;
2152 case PP_PUSH:
2153 tline = tline->next;
2154 skip_white_(tline);
2155 tline = expand_id(tline);
2156 if (!tok_type_(tline, TOK_ID)) {
2157 error(ERR_NONFATAL, "`%%push' expects a context identifier");
2158 free_tlist(origline);
2159 return DIRECTIVE_FOUND; /* but we did _something_ */
2161 if (tline->next)
2162 error(ERR_WARNING, "trailing garbage after `%%push' ignored");
2163 ctx = nasm_malloc(sizeof(Context));
2164 ctx->next = cstk;
2165 hash_init(&ctx->localmac, HASH_SMALL);
2166 ctx->name = nasm_strdup(tline->text);
2167 ctx->number = unique++;
2168 cstk = ctx;
2169 free_tlist(origline);
2170 break;
2172 case PP_REPL:
2173 tline = tline->next;
2174 skip_white_(tline);
2175 tline = expand_id(tline);
2176 if (!tok_type_(tline, TOK_ID)) {
2177 error(ERR_NONFATAL, "`%%repl' expects a context identifier");
2178 free_tlist(origline);
2179 return DIRECTIVE_FOUND; /* but we did _something_ */
2181 if (tline->next)
2182 error(ERR_WARNING, "trailing garbage after `%%repl' ignored");
2183 if (!cstk)
2184 error(ERR_NONFATAL, "`%%repl': context stack is empty");
2185 else {
2186 nasm_free(cstk->name);
2187 cstk->name = nasm_strdup(tline->text);
2189 free_tlist(origline);
2190 break;
2192 case PP_POP:
2193 if (tline->next)
2194 error(ERR_WARNING, "trailing garbage after `%%pop' ignored");
2195 if (!cstk)
2196 error(ERR_NONFATAL, "`%%pop': context stack is already empty");
2197 else
2198 ctx_pop();
2199 free_tlist(origline);
2200 break;
2202 case PP_ERROR:
2203 tline->next = expand_smacro(tline->next);
2204 tline = tline->next;
2205 skip_white_(tline);
2206 if (tok_type_(tline, TOK_STRING)) {
2207 p = tline->text;
2208 nasm_unquote(p, NULL);
2209 expand_macros_in_string(&p); /* WHY? */
2210 error(ERR_NONFATAL, "%s", p);
2211 nasm_free(p);
2212 } else {
2213 p = detoken(tline, false);
2214 error(ERR_WARNING, "%s", p); /* WARNING!??!! */
2215 nasm_free(p);
2217 free_tlist(origline);
2218 break;
2220 CASE_PP_IF:
2221 if (istk->conds && !emitting(istk->conds->state))
2222 j = COND_NEVER;
2223 else {
2224 j = if_condition(tline->next, i);
2225 tline->next = NULL; /* it got freed */
2226 j = j < 0 ? COND_NEVER : j ? COND_IF_TRUE : COND_IF_FALSE;
2228 cond = nasm_malloc(sizeof(Cond));
2229 cond->next = istk->conds;
2230 cond->state = j;
2231 istk->conds = cond;
2232 free_tlist(origline);
2233 return DIRECTIVE_FOUND;
2235 CASE_PP_ELIF:
2236 if (!istk->conds)
2237 error(ERR_FATAL, "`%s': no matching `%%if'", pp_directives[i]);
2238 if (emitting(istk->conds->state)
2239 || istk->conds->state == COND_NEVER)
2240 istk->conds->state = COND_NEVER;
2241 else {
2243 * IMPORTANT: In the case of %if, we will already have
2244 * called expand_mmac_params(); however, if we're
2245 * processing an %elif we must have been in a
2246 * non-emitting mode, which would have inhibited
2247 * the normal invocation of expand_mmac_params(). Therefore,
2248 * we have to do it explicitly here.
2250 j = if_condition(expand_mmac_params(tline->next), i);
2251 tline->next = NULL; /* it got freed */
2252 istk->conds->state =
2253 j < 0 ? COND_NEVER : j ? COND_IF_TRUE : COND_IF_FALSE;
2255 free_tlist(origline);
2256 return DIRECTIVE_FOUND;
2258 case PP_ELSE:
2259 if (tline->next)
2260 error(ERR_WARNING, "trailing garbage after `%%else' ignored");
2261 if (!istk->conds)
2262 error(ERR_FATAL, "`%%else': no matching `%%if'");
2263 if (emitting(istk->conds->state)
2264 || istk->conds->state == COND_NEVER)
2265 istk->conds->state = COND_ELSE_FALSE;
2266 else
2267 istk->conds->state = COND_ELSE_TRUE;
2268 free_tlist(origline);
2269 return DIRECTIVE_FOUND;
2271 case PP_ENDIF:
2272 if (tline->next)
2273 error(ERR_WARNING, "trailing garbage after `%%endif' ignored");
2274 if (!istk->conds)
2275 error(ERR_FATAL, "`%%endif': no matching `%%if'");
2276 cond = istk->conds;
2277 istk->conds = cond->next;
2278 nasm_free(cond);
2279 free_tlist(origline);
2280 return DIRECTIVE_FOUND;
2282 case PP_MACRO:
2283 case PP_IMACRO:
2284 if (defining)
2285 error(ERR_FATAL,
2286 "`%%%smacro': already defining a macro",
2287 (i == PP_IMACRO ? "i" : ""));
2288 tline = tline->next;
2289 skip_white_(tline);
2290 tline = expand_id(tline);
2291 if (!tok_type_(tline, TOK_ID)) {
2292 error(ERR_NONFATAL,
2293 "`%%%smacro' expects a macro name",
2294 (i == PP_IMACRO ? "i" : ""));
2295 return DIRECTIVE_FOUND;
2297 defining = nasm_malloc(sizeof(MMacro));
2298 defining->name = nasm_strdup(tline->text);
2299 defining->casesense = (i == PP_MACRO);
2300 defining->plus = false;
2301 defining->nolist = false;
2302 defining->in_progress = 0;
2303 defining->rep_nest = NULL;
2304 tline = expand_smacro(tline->next);
2305 skip_white_(tline);
2306 if (!tok_type_(tline, TOK_NUMBER)) {
2307 error(ERR_NONFATAL,
2308 "`%%%smacro' expects a parameter count",
2309 (i == PP_IMACRO ? "i" : ""));
2310 defining->nparam_min = defining->nparam_max = 0;
2311 } else {
2312 defining->nparam_min = defining->nparam_max =
2313 readnum(tline->text, &err);
2314 if (err)
2315 error(ERR_NONFATAL,
2316 "unable to parse parameter count `%s'", tline->text);
2318 if (tline && tok_is_(tline->next, "-")) {
2319 tline = tline->next->next;
2320 if (tok_is_(tline, "*"))
2321 defining->nparam_max = INT_MAX;
2322 else if (!tok_type_(tline, TOK_NUMBER))
2323 error(ERR_NONFATAL,
2324 "`%%%smacro' expects a parameter count after `-'",
2325 (i == PP_IMACRO ? "i" : ""));
2326 else {
2327 defining->nparam_max = readnum(tline->text, &err);
2328 if (err)
2329 error(ERR_NONFATAL,
2330 "unable to parse parameter count `%s'",
2331 tline->text);
2332 if (defining->nparam_min > defining->nparam_max)
2333 error(ERR_NONFATAL,
2334 "minimum parameter count exceeds maximum");
2337 if (tline && tok_is_(tline->next, "+")) {
2338 tline = tline->next;
2339 defining->plus = true;
2341 if (tline && tok_type_(tline->next, TOK_ID) &&
2342 !nasm_stricmp(tline->next->text, ".nolist")) {
2343 tline = tline->next;
2344 defining->nolist = true;
2346 mmac = (MMacro *) hash_findix(&mmacros, defining->name);
2347 while (mmac) {
2348 if (!strcmp(mmac->name, defining->name) &&
2349 (mmac->nparam_min <= defining->nparam_max
2350 || defining->plus)
2351 && (defining->nparam_min <= mmac->nparam_max
2352 || mmac->plus)) {
2353 error(ERR_WARNING,
2354 "redefining multi-line macro `%s'", defining->name);
2355 break;
2357 mmac = mmac->next;
2360 * Handle default parameters.
2362 if (tline && tline->next) {
2363 defining->dlist = tline->next;
2364 tline->next = NULL;
2365 count_mmac_params(defining->dlist, &defining->ndefs,
2366 &defining->defaults);
2367 } else {
2368 defining->dlist = NULL;
2369 defining->defaults = NULL;
2371 defining->expansion = NULL;
2372 free_tlist(origline);
2373 return DIRECTIVE_FOUND;
2375 case PP_ENDM:
2376 case PP_ENDMACRO:
2377 if (!defining) {
2378 error(ERR_NONFATAL, "`%s': not defining a macro", tline->text);
2379 return DIRECTIVE_FOUND;
2381 mmhead = (MMacro **) hash_findi_add(&mmacros, defining->name);
2382 defining->next = *mmhead;
2383 *mmhead = defining;
2384 defining = NULL;
2385 free_tlist(origline);
2386 return DIRECTIVE_FOUND;
2388 case PP_ROTATE:
2389 if (tline->next && tline->next->type == TOK_WHITESPACE)
2390 tline = tline->next;
2391 if (tline->next == NULL) {
2392 free_tlist(origline);
2393 error(ERR_NONFATAL, "`%%rotate' missing rotate count");
2394 return DIRECTIVE_FOUND;
2396 t = expand_smacro(tline->next);
2397 tline->next = NULL;
2398 free_tlist(origline);
2399 tline = t;
2400 tptr = &t;
2401 tokval.t_type = TOKEN_INVALID;
2402 evalresult =
2403 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
2404 free_tlist(tline);
2405 if (!evalresult)
2406 return DIRECTIVE_FOUND;
2407 if (tokval.t_type)
2408 error(ERR_WARNING,
2409 "trailing garbage after expression ignored");
2410 if (!is_simple(evalresult)) {
2411 error(ERR_NONFATAL, "non-constant value given to `%%rotate'");
2412 return DIRECTIVE_FOUND;
2414 mmac = istk->mstk;
2415 while (mmac && !mmac->name) /* avoid mistaking %reps for macros */
2416 mmac = mmac->next_active;
2417 if (!mmac) {
2418 error(ERR_NONFATAL, "`%%rotate' invoked outside a macro call");
2419 } else if (mmac->nparam == 0) {
2420 error(ERR_NONFATAL,
2421 "`%%rotate' invoked within macro without parameters");
2422 } else {
2423 int rotate = mmac->rotate + reloc_value(evalresult);
2425 rotate %= (int)mmac->nparam;
2426 if (rotate < 0)
2427 rotate += mmac->nparam;
2429 mmac->rotate = rotate;
2431 return DIRECTIVE_FOUND;
2433 case PP_REP:
2434 nolist = false;
2435 do {
2436 tline = tline->next;
2437 } while (tok_type_(tline, TOK_WHITESPACE));
2439 if (tok_type_(tline, TOK_ID) &&
2440 nasm_stricmp(tline->text, ".nolist") == 0) {
2441 nolist = true;
2442 do {
2443 tline = tline->next;
2444 } while (tok_type_(tline, TOK_WHITESPACE));
2447 if (tline) {
2448 t = expand_smacro(tline);
2449 tptr = &t;
2450 tokval.t_type = TOKEN_INVALID;
2451 evalresult =
2452 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
2453 if (!evalresult) {
2454 free_tlist(origline);
2455 return DIRECTIVE_FOUND;
2457 if (tokval.t_type)
2458 error(ERR_WARNING,
2459 "trailing garbage after expression ignored");
2460 if (!is_simple(evalresult)) {
2461 error(ERR_NONFATAL, "non-constant value given to `%%rep'");
2462 return DIRECTIVE_FOUND;
2464 count = reloc_value(evalresult) + 1;
2465 } else {
2466 error(ERR_NONFATAL, "`%%rep' expects a repeat count");
2467 count = 0;
2469 free_tlist(origline);
2471 tmp_defining = defining;
2472 defining = nasm_malloc(sizeof(MMacro));
2473 defining->name = NULL; /* flags this macro as a %rep block */
2474 defining->casesense = false;
2475 defining->plus = false;
2476 defining->nolist = nolist;
2477 defining->in_progress = count;
2478 defining->nparam_min = defining->nparam_max = 0;
2479 defining->defaults = NULL;
2480 defining->dlist = NULL;
2481 defining->expansion = NULL;
2482 defining->next_active = istk->mstk;
2483 defining->rep_nest = tmp_defining;
2484 return DIRECTIVE_FOUND;
2486 case PP_ENDREP:
2487 if (!defining || defining->name) {
2488 error(ERR_NONFATAL, "`%%endrep': no matching `%%rep'");
2489 return DIRECTIVE_FOUND;
2493 * Now we have a "macro" defined - although it has no name
2494 * and we won't be entering it in the hash tables - we must
2495 * push a macro-end marker for it on to istk->expansion.
2496 * After that, it will take care of propagating itself (a
2497 * macro-end marker line for a macro which is really a %rep
2498 * block will cause the macro to be re-expanded, complete
2499 * with another macro-end marker to ensure the process
2500 * continues) until the whole expansion is forcibly removed
2501 * from istk->expansion by a %exitrep.
2503 l = nasm_malloc(sizeof(Line));
2504 l->next = istk->expansion;
2505 l->finishes = defining;
2506 l->first = NULL;
2507 istk->expansion = l;
2509 istk->mstk = defining;
2511 list->uplevel(defining->nolist ? LIST_MACRO_NOLIST : LIST_MACRO);
2512 tmp_defining = defining;
2513 defining = defining->rep_nest;
2514 free_tlist(origline);
2515 return DIRECTIVE_FOUND;
2517 case PP_EXITREP:
2519 * We must search along istk->expansion until we hit a
2520 * macro-end marker for a macro with no name. Then we set
2521 * its `in_progress' flag to 0.
2523 for (l = istk->expansion; l; l = l->next)
2524 if (l->finishes && !l->finishes->name)
2525 break;
2527 if (l)
2528 l->finishes->in_progress = 0;
2529 else
2530 error(ERR_NONFATAL, "`%%exitrep' not within `%%rep' block");
2531 free_tlist(origline);
2532 return DIRECTIVE_FOUND;
2534 case PP_XDEFINE:
2535 case PP_IXDEFINE:
2536 case PP_DEFINE:
2537 case PP_IDEFINE:
2538 casesense = (i == PP_DEFINE || i == PP_XDEFINE);
2540 tline = tline->next;
2541 skip_white_(tline);
2542 tline = expand_id(tline);
2543 if (!tline || (tline->type != TOK_ID &&
2544 (tline->type != TOK_PREPROC_ID ||
2545 tline->text[1] != '$'))) {
2546 error(ERR_NONFATAL, "`%s' expects a macro identifier",
2547 pp_directives[i]);
2548 free_tlist(origline);
2549 return DIRECTIVE_FOUND;
2552 ctx = get_ctx(tline->text, false);
2554 mname = tline->text;
2555 last = tline;
2556 param_start = tline = tline->next;
2557 nparam = 0;
2559 /* Expand the macro definition now for %xdefine and %ixdefine */
2560 if ((i == PP_XDEFINE) || (i == PP_IXDEFINE))
2561 tline = expand_smacro(tline);
2563 if (tok_is_(tline, "(")) {
2565 * This macro has parameters.
2568 tline = tline->next;
2569 while (1) {
2570 skip_white_(tline);
2571 if (!tline) {
2572 error(ERR_NONFATAL, "parameter identifier expected");
2573 free_tlist(origline);
2574 return DIRECTIVE_FOUND;
2576 if (tline->type != TOK_ID) {
2577 error(ERR_NONFATAL,
2578 "`%s': parameter identifier expected",
2579 tline->text);
2580 free_tlist(origline);
2581 return DIRECTIVE_FOUND;
2583 tline->type = TOK_SMAC_PARAM + nparam++;
2584 tline = tline->next;
2585 skip_white_(tline);
2586 if (tok_is_(tline, ",")) {
2587 tline = tline->next;
2588 continue;
2590 if (!tok_is_(tline, ")")) {
2591 error(ERR_NONFATAL,
2592 "`)' expected to terminate macro template");
2593 free_tlist(origline);
2594 return DIRECTIVE_FOUND;
2596 break;
2598 last = tline;
2599 tline = tline->next;
2601 if (tok_type_(tline, TOK_WHITESPACE))
2602 last = tline, tline = tline->next;
2603 macro_start = NULL;
2604 last->next = NULL;
2605 t = tline;
2606 while (t) {
2607 if (t->type == TOK_ID) {
2608 for (tt = param_start; tt; tt = tt->next)
2609 if (tt->type >= TOK_SMAC_PARAM &&
2610 !strcmp(tt->text, t->text))
2611 t->type = tt->type;
2613 tt = t->next;
2614 t->next = macro_start;
2615 macro_start = t;
2616 t = tt;
2619 * Good. We now have a macro name, a parameter count, and a
2620 * token list (in reverse order) for an expansion. We ought
2621 * to be OK just to create an SMacro, store it, and let
2622 * free_tlist have the rest of the line (which we have
2623 * carefully re-terminated after chopping off the expansion
2624 * from the end).
2626 define_smacro(ctx, mname, casesense, nparam, macro_start);
2627 free_tlist(origline);
2628 return DIRECTIVE_FOUND;
2630 case PP_UNDEF:
2631 tline = tline->next;
2632 skip_white_(tline);
2633 tline = expand_id(tline);
2634 if (!tline || (tline->type != TOK_ID &&
2635 (tline->type != TOK_PREPROC_ID ||
2636 tline->text[1] != '$'))) {
2637 error(ERR_NONFATAL, "`%%undef' expects a macro identifier");
2638 free_tlist(origline);
2639 return DIRECTIVE_FOUND;
2641 if (tline->next) {
2642 error(ERR_WARNING,
2643 "trailing garbage after macro name ignored");
2646 /* Find the context that symbol belongs to */
2647 ctx = get_ctx(tline->text, false);
2648 undef_smacro(ctx, tline->text);
2649 free_tlist(origline);
2650 return DIRECTIVE_FOUND;
2652 case PP_PATHSEARCH:
2654 FILE *fp;
2655 StrList *xsl = NULL;
2657 casesense = true;
2659 tline = tline->next;
2660 skip_white_(tline);
2661 tline = expand_id(tline);
2662 if (!tline || (tline->type != TOK_ID &&
2663 (tline->type != TOK_PREPROC_ID ||
2664 tline->text[1] != '$'))) {
2665 error(ERR_NONFATAL,
2666 "`%%pathsearch' expects a macro identifier as first parameter");
2667 free_tlist(origline);
2668 return DIRECTIVE_FOUND;
2670 ctx = get_ctx(tline->text, false);
2672 mname = tline->text;
2673 last = tline;
2674 tline = expand_smacro(tline->next);
2675 last->next = NULL;
2677 t = tline;
2678 while (tok_type_(t, TOK_WHITESPACE))
2679 t = t->next;
2681 if (!t || (t->type != TOK_STRING &&
2682 t->type != TOK_INTERNAL_STRING)) {
2683 error(ERR_NONFATAL, "`%%pathsearch' expects a file name");
2684 free_tlist(tline);
2685 free_tlist(origline);
2686 return DIRECTIVE_FOUND; /* but we did _something_ */
2688 if (t->next)
2689 error(ERR_WARNING,
2690 "trailing garbage after `%%pathsearch' ignored");
2691 p = t->text;
2692 if (t->type != TOK_INTERNAL_STRING)
2693 nasm_unquote(p, NULL);
2695 fp = inc_fopen(p, &xsl, &xsl, true);
2696 if (fp) {
2697 p = xsl->str;
2698 fclose(fp); /* Don't actually care about the file */
2700 macro_start = nasm_malloc(sizeof(*macro_start));
2701 macro_start->next = NULL;
2702 macro_start->text = nasm_quote(p, strlen(p));
2703 macro_start->type = TOK_STRING;
2704 macro_start->mac = NULL;
2705 if (xsl)
2706 nasm_free(xsl);
2709 * We now have a macro name, an implicit parameter count of
2710 * zero, and a string token to use as an expansion. Create
2711 * and store an SMacro.
2713 define_smacro(ctx, mname, casesense, 0, macro_start);
2714 free_tlist(tline);
2715 free_tlist(origline);
2716 return DIRECTIVE_FOUND;
2719 case PP_STRLEN:
2720 casesense = true;
2722 tline = tline->next;
2723 skip_white_(tline);
2724 tline = expand_id(tline);
2725 if (!tline || (tline->type != TOK_ID &&
2726 (tline->type != TOK_PREPROC_ID ||
2727 tline->text[1] != '$'))) {
2728 error(ERR_NONFATAL,
2729 "`%%strlen' expects a macro identifier as first parameter");
2730 free_tlist(origline);
2731 return DIRECTIVE_FOUND;
2733 ctx = get_ctx(tline->text, false);
2735 mname = tline->text;
2736 last = tline;
2737 tline = expand_smacro(tline->next);
2738 last->next = NULL;
2740 t = tline;
2741 while (tok_type_(t, TOK_WHITESPACE))
2742 t = t->next;
2743 /* t should now point to the string */
2744 if (t->type != TOK_STRING) {
2745 error(ERR_NONFATAL,
2746 "`%%strlen` requires string as second parameter");
2747 free_tlist(tline);
2748 free_tlist(origline);
2749 return DIRECTIVE_FOUND;
2752 macro_start = nasm_malloc(sizeof(*macro_start));
2753 macro_start->next = NULL;
2754 make_tok_num(macro_start, nasm_unquote(t->text, NULL));
2755 macro_start->mac = NULL;
2758 * We now have a macro name, an implicit parameter count of
2759 * zero, and a numeric token to use as an expansion. Create
2760 * and store an SMacro.
2762 define_smacro(ctx, mname, casesense, 0, macro_start);
2763 free_tlist(tline);
2764 free_tlist(origline);
2765 return DIRECTIVE_FOUND;
2767 case PP_SUBSTR:
2769 int64_t a1, a2;
2770 size_t len;
2772 casesense = true;
2774 tline = tline->next;
2775 skip_white_(tline);
2776 tline = expand_id(tline);
2777 if (!tline || (tline->type != TOK_ID &&
2778 (tline->type != TOK_PREPROC_ID ||
2779 tline->text[1] != '$'))) {
2780 error(ERR_NONFATAL,
2781 "`%%substr' expects a macro identifier as first parameter");
2782 free_tlist(origline);
2783 return DIRECTIVE_FOUND;
2785 ctx = get_ctx(tline->text, false);
2787 mname = tline->text;
2788 last = tline;
2789 tline = expand_smacro(tline->next);
2790 last->next = NULL;
2792 t = tline->next;
2793 while (tok_type_(t, TOK_WHITESPACE))
2794 t = t->next;
2796 /* t should now point to the string */
2797 if (t->type != TOK_STRING) {
2798 error(ERR_NONFATAL,
2799 "`%%substr` requires string as second parameter");
2800 free_tlist(tline);
2801 free_tlist(origline);
2802 return DIRECTIVE_FOUND;
2805 tt = t->next;
2806 tptr = &tt;
2807 tokval.t_type = TOKEN_INVALID;
2808 evalresult = evaluate(ppscan, tptr, &tokval, NULL,
2809 pass, error, NULL);
2810 if (!evalresult) {
2811 free_tlist(tline);
2812 free_tlist(origline);
2813 return DIRECTIVE_FOUND;
2814 } else if (!is_simple(evalresult)) {
2815 error(ERR_NONFATAL, "non-constant value given to `%%substr`");
2816 free_tlist(tline);
2817 free_tlist(origline);
2818 return DIRECTIVE_FOUND;
2820 a1 = evalresult->value-1;
2822 while (tok_type_(tt, TOK_WHITESPACE))
2823 tt = tt->next;
2824 if (!tt) {
2825 a2 = 1; /* Backwards compatibility: one character */
2826 } else {
2827 tokval.t_type = TOKEN_INVALID;
2828 evalresult = evaluate(ppscan, tptr, &tokval, NULL,
2829 pass, error, NULL);
2830 if (!evalresult) {
2831 free_tlist(tline);
2832 free_tlist(origline);
2833 return DIRECTIVE_FOUND;
2834 } else if (!is_simple(evalresult)) {
2835 error(ERR_NONFATAL, "non-constant value given to `%%substr`");
2836 free_tlist(tline);
2837 free_tlist(origline);
2838 return DIRECTIVE_FOUND;
2840 a2 = evalresult->value;
2843 len = nasm_unquote(t->text, NULL);
2844 if (a2 < 0)
2845 a2 = a2+1+len-a1;
2846 if (a1+a2 > (int64_t)len)
2847 a2 = len-a1;
2849 macro_start = nasm_malloc(sizeof(*macro_start));
2850 macro_start->next = NULL;
2851 macro_start->text = nasm_quote((a1 < 0) ? "" : t->text+a1, a2);
2852 macro_start->type = TOK_STRING;
2853 macro_start->mac = NULL;
2856 * We now have a macro name, an implicit parameter count of
2857 * zero, and a numeric token to use as an expansion. Create
2858 * and store an SMacro.
2860 define_smacro(ctx, mname, casesense, 0, macro_start);
2861 free_tlist(tline);
2862 free_tlist(origline);
2863 return DIRECTIVE_FOUND;
2866 case PP_ASSIGN:
2867 case PP_IASSIGN:
2868 casesense = (i == PP_ASSIGN);
2870 tline = tline->next;
2871 skip_white_(tline);
2872 tline = expand_id(tline);
2873 if (!tline || (tline->type != TOK_ID &&
2874 (tline->type != TOK_PREPROC_ID ||
2875 tline->text[1] != '$'))) {
2876 error(ERR_NONFATAL,
2877 "`%%%sassign' expects a macro identifier",
2878 (i == PP_IASSIGN ? "i" : ""));
2879 free_tlist(origline);
2880 return DIRECTIVE_FOUND;
2882 ctx = get_ctx(tline->text, false);
2884 mname = tline->text;
2885 last = tline;
2886 tline = expand_smacro(tline->next);
2887 last->next = NULL;
2889 t = tline;
2890 tptr = &t;
2891 tokval.t_type = TOKEN_INVALID;
2892 evalresult =
2893 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
2894 free_tlist(tline);
2895 if (!evalresult) {
2896 free_tlist(origline);
2897 return DIRECTIVE_FOUND;
2900 if (tokval.t_type)
2901 error(ERR_WARNING,
2902 "trailing garbage after expression ignored");
2904 if (!is_simple(evalresult)) {
2905 error(ERR_NONFATAL,
2906 "non-constant value given to `%%%sassign'",
2907 (i == PP_IASSIGN ? "i" : ""));
2908 free_tlist(origline);
2909 return DIRECTIVE_FOUND;
2912 macro_start = nasm_malloc(sizeof(*macro_start));
2913 macro_start->next = NULL;
2914 make_tok_num(macro_start, reloc_value(evalresult));
2915 macro_start->mac = NULL;
2918 * We now have a macro name, an implicit parameter count of
2919 * zero, and a numeric token to use as an expansion. Create
2920 * and store an SMacro.
2922 define_smacro(ctx, mname, casesense, 0, macro_start);
2923 free_tlist(origline);
2924 return DIRECTIVE_FOUND;
2926 case PP_LINE:
2928 * Syntax is `%line nnn[+mmm] [filename]'
2930 tline = tline->next;
2931 skip_white_(tline);
2932 if (!tok_type_(tline, TOK_NUMBER)) {
2933 error(ERR_NONFATAL, "`%%line' expects line number");
2934 free_tlist(origline);
2935 return DIRECTIVE_FOUND;
2937 k = readnum(tline->text, &err);
2938 m = 1;
2939 tline = tline->next;
2940 if (tok_is_(tline, "+")) {
2941 tline = tline->next;
2942 if (!tok_type_(tline, TOK_NUMBER)) {
2943 error(ERR_NONFATAL, "`%%line' expects line increment");
2944 free_tlist(origline);
2945 return DIRECTIVE_FOUND;
2947 m = readnum(tline->text, &err);
2948 tline = tline->next;
2950 skip_white_(tline);
2951 src_set_linnum(k);
2952 istk->lineinc = m;
2953 if (tline) {
2954 nasm_free(src_set_fname(detoken(tline, false)));
2956 free_tlist(origline);
2957 return DIRECTIVE_FOUND;
2959 default:
2960 error(ERR_FATAL,
2961 "preprocessor directive `%s' not yet implemented",
2962 pp_directives[i]);
2963 break;
2965 return DIRECTIVE_FOUND;
2969 * Ensure that a macro parameter contains a condition code and
2970 * nothing else. Return the condition code index if so, or -1
2971 * otherwise.
2973 static int find_cc(Token * t)
2975 Token *tt;
2976 int i, j, k, m;
2978 if (!t)
2979 return -1; /* Probably a %+ without a space */
2981 skip_white_(t);
2982 if (t->type != TOK_ID)
2983 return -1;
2984 tt = t->next;
2985 skip_white_(tt);
2986 if (tt && (tt->type != TOK_OTHER || strcmp(tt->text, ",")))
2987 return -1;
2989 i = -1;
2990 j = elements(conditions);
2991 while (j - i > 1) {
2992 k = (j + i) / 2;
2993 m = nasm_stricmp(t->text, conditions[k]);
2994 if (m == 0) {
2995 i = k;
2996 j = -2;
2997 break;
2998 } else if (m < 0) {
2999 j = k;
3000 } else
3001 i = k;
3003 if (j != -2)
3004 return -1;
3005 return i;
3009 * Expand MMacro-local things: parameter references (%0, %n, %+n,
3010 * %-n) and MMacro-local identifiers (%%foo).
3012 static Token *expand_mmac_params(Token * tline)
3014 Token *t, *tt, **tail, *thead;
3016 tail = &thead;
3017 thead = NULL;
3019 while (tline) {
3020 if (tline->type == TOK_PREPROC_ID &&
3021 (((tline->text[1] == '+' || tline->text[1] == '-')
3022 && tline->text[2]) || tline->text[1] == '%'
3023 || (tline->text[1] >= '0' && tline->text[1] <= '9'))) {
3024 char *text = NULL;
3025 int type = 0, cc; /* type = 0 to placate optimisers */
3026 char tmpbuf[30];
3027 unsigned int n;
3028 int i;
3029 MMacro *mac;
3031 t = tline;
3032 tline = tline->next;
3034 mac = istk->mstk;
3035 while (mac && !mac->name) /* avoid mistaking %reps for macros */
3036 mac = mac->next_active;
3037 if (!mac)
3038 error(ERR_NONFATAL, "`%s': not in a macro call", t->text);
3039 else
3040 switch (t->text[1]) {
3042 * We have to make a substitution of one of the
3043 * forms %1, %-1, %+1, %%foo, %0.
3045 case '0':
3046 type = TOK_NUMBER;
3047 snprintf(tmpbuf, sizeof(tmpbuf), "%d", mac->nparam);
3048 text = nasm_strdup(tmpbuf);
3049 break;
3050 case '%':
3051 type = TOK_ID;
3052 snprintf(tmpbuf, sizeof(tmpbuf), "..@%"PRIu64".",
3053 mac->unique);
3054 text = nasm_strcat(tmpbuf, t->text + 2);
3055 break;
3056 case '-':
3057 n = atoi(t->text + 2) - 1;
3058 if (n >= mac->nparam)
3059 tt = NULL;
3060 else {
3061 if (mac->nparam > 1)
3062 n = (n + mac->rotate) % mac->nparam;
3063 tt = mac->params[n];
3065 cc = find_cc(tt);
3066 if (cc == -1) {
3067 error(ERR_NONFATAL,
3068 "macro parameter %d is not a condition code",
3069 n + 1);
3070 text = NULL;
3071 } else {
3072 type = TOK_ID;
3073 if (inverse_ccs[cc] == -1) {
3074 error(ERR_NONFATAL,
3075 "condition code `%s' is not invertible",
3076 conditions[cc]);
3077 text = NULL;
3078 } else
3079 text =
3080 nasm_strdup(conditions[inverse_ccs[cc]]);
3082 break;
3083 case '+':
3084 n = atoi(t->text + 2) - 1;
3085 if (n >= mac->nparam)
3086 tt = NULL;
3087 else {
3088 if (mac->nparam > 1)
3089 n = (n + mac->rotate) % mac->nparam;
3090 tt = mac->params[n];
3092 cc = find_cc(tt);
3093 if (cc == -1) {
3094 error(ERR_NONFATAL,
3095 "macro parameter %d is not a condition code",
3096 n + 1);
3097 text = NULL;
3098 } else {
3099 type = TOK_ID;
3100 text = nasm_strdup(conditions[cc]);
3102 break;
3103 default:
3104 n = atoi(t->text + 1) - 1;
3105 if (n >= mac->nparam)
3106 tt = NULL;
3107 else {
3108 if (mac->nparam > 1)
3109 n = (n + mac->rotate) % mac->nparam;
3110 tt = mac->params[n];
3112 if (tt) {
3113 for (i = 0; i < mac->paramlen[n]; i++) {
3114 *tail = new_Token(NULL, tt->type, tt->text, 0);
3115 tail = &(*tail)->next;
3116 tt = tt->next;
3119 text = NULL; /* we've done it here */
3120 break;
3122 if (!text) {
3123 delete_Token(t);
3124 } else {
3125 *tail = t;
3126 tail = &t->next;
3127 t->type = type;
3128 nasm_free(t->text);
3129 t->text = text;
3130 t->mac = NULL;
3132 continue;
3133 } else {
3134 t = *tail = tline;
3135 tline = tline->next;
3136 t->mac = NULL;
3137 tail = &t->next;
3140 *tail = NULL;
3141 t = thead;
3142 for (; t && (tt = t->next) != NULL; t = t->next)
3143 switch (t->type) {
3144 case TOK_WHITESPACE:
3145 if (tt->type == TOK_WHITESPACE) {
3146 t->next = delete_Token(tt);
3148 break;
3149 case TOK_ID:
3150 if (tt->type == TOK_ID || tt->type == TOK_NUMBER) {
3151 char *tmp = nasm_strcat(t->text, tt->text);
3152 nasm_free(t->text);
3153 t->text = tmp;
3154 t->next = delete_Token(tt);
3156 break;
3157 case TOK_NUMBER:
3158 if (tt->type == TOK_NUMBER) {
3159 char *tmp = nasm_strcat(t->text, tt->text);
3160 nasm_free(t->text);
3161 t->text = tmp;
3162 t->next = delete_Token(tt);
3164 break;
3165 default:
3166 break;
3169 return thead;
3173 * Expand all single-line macro calls made in the given line.
3174 * Return the expanded version of the line. The original is deemed
3175 * to be destroyed in the process. (In reality we'll just move
3176 * Tokens from input to output a lot of the time, rather than
3177 * actually bothering to destroy and replicate.)
3179 #define DEADMAN_LIMIT (1 << 20)
3181 static Token *expand_smacro(Token * tline)
3183 Token *t, *tt, *mstart, **tail, *thead;
3184 struct hash_table *smtbl;
3185 SMacro *head = NULL, *m;
3186 Token **params;
3187 int *paramsize;
3188 unsigned int nparam, sparam;
3189 int brackets, rescan;
3190 Token *org_tline = tline;
3191 Context *ctx;
3192 char *mname;
3193 int deadman = DEADMAN_LIMIT;
3196 * Trick: we should avoid changing the start token pointer since it can
3197 * be contained in "next" field of other token. Because of this
3198 * we allocate a copy of first token and work with it; at the end of
3199 * routine we copy it back
3201 if (org_tline) {
3202 tline =
3203 new_Token(org_tline->next, org_tline->type, org_tline->text,
3205 tline->mac = org_tline->mac;
3206 nasm_free(org_tline->text);
3207 org_tline->text = NULL;
3210 again:
3211 tail = &thead;
3212 thead = NULL;
3214 while (tline) { /* main token loop */
3215 if (!--deadman) {
3216 error(ERR_NONFATAL, "interminable macro recursion");
3217 break;
3220 if ((mname = tline->text)) {
3221 /* if this token is a local macro, look in local context */
3222 ctx = NULL;
3223 smtbl = &smacros;
3224 if (tline->type == TOK_ID || tline->type == TOK_PREPROC_ID) {
3225 ctx = get_ctx(mname, true);
3226 if (ctx)
3227 smtbl = &ctx->localmac;
3229 head = (SMacro *) hash_findix(smtbl, mname);
3232 * We've hit an identifier. As in is_mmacro below, we first
3233 * check whether the identifier is a single-line macro at
3234 * all, then think about checking for parameters if
3235 * necessary.
3237 for (m = head; m; m = m->next)
3238 if (!mstrcmp(m->name, mname, m->casesense))
3239 break;
3240 if (m) {
3241 mstart = tline;
3242 params = NULL;
3243 paramsize = NULL;
3244 if (m->nparam == 0) {
3246 * Simple case: the macro is parameterless. Discard the
3247 * one token that the macro call took, and push the
3248 * expansion back on the to-do stack.
3250 if (!m->expansion) {
3251 if (!strcmp("__FILE__", m->name)) {
3252 int32_t num = 0;
3253 char *file;
3254 src_get(&num, &file);
3255 tline->text = nasm_quote(file, strlen(file));
3256 tline->type = TOK_STRING;
3257 nasm_free(file);
3258 continue;
3260 if (!strcmp("__LINE__", m->name)) {
3261 nasm_free(tline->text);
3262 make_tok_num(tline, src_get_linnum());
3263 continue;
3265 if (!strcmp("__BITS__", m->name)) {
3266 nasm_free(tline->text);
3267 make_tok_num(tline, globalbits);
3268 continue;
3270 tline = delete_Token(tline);
3271 continue;
3273 } else {
3275 * Complicated case: at least one macro with this name
3276 * exists and takes parameters. We must find the
3277 * parameters in the call, count them, find the SMacro
3278 * that corresponds to that form of the macro call, and
3279 * substitute for the parameters when we expand. What a
3280 * pain.
3282 /*tline = tline->next;
3283 skip_white_(tline); */
3284 do {
3285 t = tline->next;
3286 while (tok_type_(t, TOK_SMAC_END)) {
3287 t->mac->in_progress = false;
3288 t->text = NULL;
3289 t = tline->next = delete_Token(t);
3291 tline = t;
3292 } while (tok_type_(tline, TOK_WHITESPACE));
3293 if (!tok_is_(tline, "(")) {
3295 * This macro wasn't called with parameters: ignore
3296 * the call. (Behaviour borrowed from gnu cpp.)
3298 tline = mstart;
3299 m = NULL;
3300 } else {
3301 int paren = 0;
3302 int white = 0;
3303 brackets = 0;
3304 nparam = 0;
3305 sparam = PARAM_DELTA;
3306 params = nasm_malloc(sparam * sizeof(Token *));
3307 params[0] = tline->next;
3308 paramsize = nasm_malloc(sparam * sizeof(int));
3309 paramsize[0] = 0;
3310 while (true) { /* parameter loop */
3312 * For some unusual expansions
3313 * which concatenates function call
3315 t = tline->next;
3316 while (tok_type_(t, TOK_SMAC_END)) {
3317 t->mac->in_progress = false;
3318 t->text = NULL;
3319 t = tline->next = delete_Token(t);
3321 tline = t;
3323 if (!tline) {
3324 error(ERR_NONFATAL,
3325 "macro call expects terminating `)'");
3326 break;
3328 if (tline->type == TOK_WHITESPACE
3329 && brackets <= 0) {
3330 if (paramsize[nparam])
3331 white++;
3332 else
3333 params[nparam] = tline->next;
3334 continue; /* parameter loop */
3336 if (tline->type == TOK_OTHER
3337 && tline->text[1] == 0) {
3338 char ch = tline->text[0];
3339 if (ch == ',' && !paren && brackets <= 0) {
3340 if (++nparam >= sparam) {
3341 sparam += PARAM_DELTA;
3342 params = nasm_realloc(params,
3343 sparam *
3344 sizeof(Token
3345 *));
3346 paramsize =
3347 nasm_realloc(paramsize,
3348 sparam *
3349 sizeof(int));
3351 params[nparam] = tline->next;
3352 paramsize[nparam] = 0;
3353 white = 0;
3354 continue; /* parameter loop */
3356 if (ch == '{' &&
3357 (brackets > 0 || (brackets == 0 &&
3358 !paramsize[nparam])))
3360 if (!(brackets++)) {
3361 params[nparam] = tline->next;
3362 continue; /* parameter loop */
3365 if (ch == '}' && brackets > 0)
3366 if (--brackets == 0) {
3367 brackets = -1;
3368 continue; /* parameter loop */
3370 if (ch == '(' && !brackets)
3371 paren++;
3372 if (ch == ')' && brackets <= 0)
3373 if (--paren < 0)
3374 break;
3376 if (brackets < 0) {
3377 brackets = 0;
3378 error(ERR_NONFATAL, "braces do not "
3379 "enclose all of macro parameter");
3381 paramsize[nparam] += white + 1;
3382 white = 0;
3383 } /* parameter loop */
3384 nparam++;
3385 while (m && (m->nparam != nparam ||
3386 mstrcmp(m->name, mname,
3387 m->casesense)))
3388 m = m->next;
3389 if (!m)
3390 error(ERR_WARNING | ERR_WARN_MNP,
3391 "macro `%s' exists, "
3392 "but not taking %d parameters",
3393 mstart->text, nparam);
3396 if (m && m->in_progress)
3397 m = NULL;
3398 if (!m) { /* in progess or didn't find '(' or wrong nparam */
3400 * Design question: should we handle !tline, which
3401 * indicates missing ')' here, or expand those
3402 * macros anyway, which requires the (t) test a few
3403 * lines down?
3405 nasm_free(params);
3406 nasm_free(paramsize);
3407 tline = mstart;
3408 } else {
3410 * Expand the macro: we are placed on the last token of the
3411 * call, so that we can easily split the call from the
3412 * following tokens. We also start by pushing an SMAC_END
3413 * token for the cycle removal.
3415 t = tline;
3416 if (t) {
3417 tline = t->next;
3418 t->next = NULL;
3420 tt = new_Token(tline, TOK_SMAC_END, NULL, 0);
3421 tt->mac = m;
3422 m->in_progress = true;
3423 tline = tt;
3424 for (t = m->expansion; t; t = t->next) {
3425 if (t->type >= TOK_SMAC_PARAM) {
3426 Token *pcopy = tline, **ptail = &pcopy;
3427 Token *ttt, *pt;
3428 int i;
3430 ttt = params[t->type - TOK_SMAC_PARAM];
3431 for (i = paramsize[t->type - TOK_SMAC_PARAM];
3432 --i >= 0;) {
3433 pt = *ptail =
3434 new_Token(tline, ttt->type, ttt->text,
3436 ptail = &pt->next;
3437 ttt = ttt->next;
3439 tline = pcopy;
3440 } else if (t->type == TOK_PREPROC_Q) {
3441 tt = new_Token(tline, TOK_ID, mname, 0);
3442 tline = tt;
3443 } else if (t->type == TOK_PREPROC_QQ) {
3444 tt = new_Token(tline, TOK_ID, m->name, 0);
3445 tline = tt;
3446 } else {
3447 tt = new_Token(tline, t->type, t->text, 0);
3448 tline = tt;
3453 * Having done that, get rid of the macro call, and clean
3454 * up the parameters.
3456 nasm_free(params);
3457 nasm_free(paramsize);
3458 free_tlist(mstart);
3459 continue; /* main token loop */
3464 if (tline->type == TOK_SMAC_END) {
3465 tline->mac->in_progress = false;
3466 tline = delete_Token(tline);
3467 } else {
3468 t = *tail = tline;
3469 tline = tline->next;
3470 t->mac = NULL;
3471 t->next = NULL;
3472 tail = &t->next;
3477 * Now scan the entire line and look for successive TOK_IDs that resulted
3478 * after expansion (they can't be produced by tokenize()). The successive
3479 * TOK_IDs should be concatenated.
3480 * Also we look for %+ tokens and concatenate the tokens before and after
3481 * them (without white spaces in between).
3483 t = thead;
3484 rescan = 0;
3485 while (t) {
3486 while (t && t->type != TOK_ID && t->type != TOK_PREPROC_ID)
3487 t = t->next;
3488 if (!t || !t->next)
3489 break;
3490 if (t->next->type == TOK_ID ||
3491 t->next->type == TOK_PREPROC_ID ||
3492 t->next->type == TOK_NUMBER) {
3493 char *p = nasm_strcat(t->text, t->next->text);
3494 nasm_free(t->text);
3495 t->next = delete_Token(t->next);
3496 t->text = p;
3497 rescan = 1;
3498 } else if (t->next->type == TOK_WHITESPACE && t->next->next &&
3499 t->next->next->type == TOK_PREPROC_ID &&
3500 strcmp(t->next->next->text, "%+") == 0) {
3501 /* free the next whitespace, the %+ token and next whitespace */
3502 int i;
3503 for (i = 1; i <= 3; i++) {
3504 if (!t->next
3505 || (i != 2 && t->next->type != TOK_WHITESPACE))
3506 break;
3507 t->next = delete_Token(t->next);
3508 } /* endfor */
3509 } else
3510 t = t->next;
3512 /* If we concatenaded something, re-scan the line for macros */
3513 if (rescan) {
3514 tline = thead;
3515 goto again;
3518 if (org_tline) {
3519 if (thead) {
3520 *org_tline = *thead;
3521 /* since we just gave text to org_line, don't free it */
3522 thead->text = NULL;
3523 delete_Token(thead);
3524 } else {
3525 /* the expression expanded to empty line;
3526 we can't return NULL for some reasons
3527 we just set the line to a single WHITESPACE token. */
3528 memset(org_tline, 0, sizeof(*org_tline));
3529 org_tline->text = NULL;
3530 org_tline->type = TOK_WHITESPACE;
3532 thead = org_tline;
3535 return thead;
3539 * Similar to expand_smacro but used exclusively with macro identifiers
3540 * right before they are fetched in. The reason is that there can be
3541 * identifiers consisting of several subparts. We consider that if there
3542 * are more than one element forming the name, user wants a expansion,
3543 * otherwise it will be left as-is. Example:
3545 * %define %$abc cde
3547 * the identifier %$abc will be left as-is so that the handler for %define
3548 * will suck it and define the corresponding value. Other case:
3550 * %define _%$abc cde
3552 * In this case user wants name to be expanded *before* %define starts
3553 * working, so we'll expand %$abc into something (if it has a value;
3554 * otherwise it will be left as-is) then concatenate all successive
3555 * PP_IDs into one.
3557 static Token *expand_id(Token * tline)
3559 Token *cur, *oldnext = NULL;
3561 if (!tline || !tline->next)
3562 return tline;
3564 cur = tline;
3565 while (cur->next &&
3566 (cur->next->type == TOK_ID ||
3567 cur->next->type == TOK_PREPROC_ID
3568 || cur->next->type == TOK_NUMBER))
3569 cur = cur->next;
3571 /* If identifier consists of just one token, don't expand */
3572 if (cur == tline)
3573 return tline;
3575 if (cur) {
3576 oldnext = cur->next; /* Detach the tail past identifier */
3577 cur->next = NULL; /* so that expand_smacro stops here */
3580 tline = expand_smacro(tline);
3582 if (cur) {
3583 /* expand_smacro possibly changhed tline; re-scan for EOL */
3584 cur = tline;
3585 while (cur && cur->next)
3586 cur = cur->next;
3587 if (cur)
3588 cur->next = oldnext;
3591 return tline;
3595 * Determine whether the given line constitutes a multi-line macro
3596 * call, and return the MMacro structure called if so. Doesn't have
3597 * to check for an initial label - that's taken care of in
3598 * expand_mmacro - but must check numbers of parameters. Guaranteed
3599 * to be called with tline->type == TOK_ID, so the putative macro
3600 * name is easy to find.
3602 static MMacro *is_mmacro(Token * tline, Token *** params_array)
3604 MMacro *head, *m;
3605 Token **params;
3606 int nparam;
3608 head = (MMacro *) hash_findix(&mmacros, tline->text);
3611 * Efficiency: first we see if any macro exists with the given
3612 * name. If not, we can return NULL immediately. _Then_ we
3613 * count the parameters, and then we look further along the
3614 * list if necessary to find the proper MMacro.
3616 for (m = head; m; m = m->next)
3617 if (!mstrcmp(m->name, tline->text, m->casesense))
3618 break;
3619 if (!m)
3620 return NULL;
3623 * OK, we have a potential macro. Count and demarcate the
3624 * parameters.
3626 count_mmac_params(tline->next, &nparam, &params);
3629 * So we know how many parameters we've got. Find the MMacro
3630 * structure that handles this number.
3632 while (m) {
3633 if (m->nparam_min <= nparam
3634 && (m->plus || nparam <= m->nparam_max)) {
3636 * This one is right. Just check if cycle removal
3637 * prohibits us using it before we actually celebrate...
3639 if (m->in_progress) {
3640 #if 0
3641 error(ERR_NONFATAL,
3642 "self-reference in multi-line macro `%s'", m->name);
3643 #endif
3644 nasm_free(params);
3645 return NULL;
3648 * It's right, and we can use it. Add its default
3649 * parameters to the end of our list if necessary.
3651 if (m->defaults && nparam < m->nparam_min + m->ndefs) {
3652 params =
3653 nasm_realloc(params,
3654 ((m->nparam_min + m->ndefs +
3655 1) * sizeof(*params)));
3656 while (nparam < m->nparam_min + m->ndefs) {
3657 params[nparam] = m->defaults[nparam - m->nparam_min];
3658 nparam++;
3662 * If we've gone over the maximum parameter count (and
3663 * we're in Plus mode), ignore parameters beyond
3664 * nparam_max.
3666 if (m->plus && nparam > m->nparam_max)
3667 nparam = m->nparam_max;
3669 * Then terminate the parameter list, and leave.
3671 if (!params) { /* need this special case */
3672 params = nasm_malloc(sizeof(*params));
3673 nparam = 0;
3675 params[nparam] = NULL;
3676 *params_array = params;
3677 return m;
3680 * This one wasn't right: look for the next one with the
3681 * same name.
3683 for (m = m->next; m; m = m->next)
3684 if (!mstrcmp(m->name, tline->text, m->casesense))
3685 break;
3689 * After all that, we didn't find one with the right number of
3690 * parameters. Issue a warning, and fail to expand the macro.
3692 error(ERR_WARNING | ERR_WARN_MNP,
3693 "macro `%s' exists, but not taking %d parameters",
3694 tline->text, nparam);
3695 nasm_free(params);
3696 return NULL;
3700 * Expand the multi-line macro call made by the given line, if
3701 * there is one to be expanded. If there is, push the expansion on
3702 * istk->expansion and return 1. Otherwise return 0.
3704 static int expand_mmacro(Token * tline)
3706 Token *startline = tline;
3707 Token *label = NULL;
3708 int dont_prepend = 0;
3709 Token **params, *t, *mtok, *tt;
3710 MMacro *m;
3711 Line *l, *ll;
3712 int i, nparam, *paramlen;
3714 t = tline;
3715 skip_white_(t);
3716 /* if (!tok_type_(t, TOK_ID)) Lino 02/25/02 */
3717 if (!tok_type_(t, TOK_ID) && !tok_type_(t, TOK_PREPROC_ID))
3718 return 0;
3719 mtok = t;
3720 m = is_mmacro(t, &params);
3721 if (!m) {
3722 Token *last;
3724 * We have an id which isn't a macro call. We'll assume
3725 * it might be a label; we'll also check to see if a
3726 * colon follows it. Then, if there's another id after
3727 * that lot, we'll check it again for macro-hood.
3729 label = last = t;
3730 t = t->next;
3731 if (tok_type_(t, TOK_WHITESPACE))
3732 last = t, t = t->next;
3733 if (tok_is_(t, ":")) {
3734 dont_prepend = 1;
3735 last = t, t = t->next;
3736 if (tok_type_(t, TOK_WHITESPACE))
3737 last = t, t = t->next;
3739 if (!tok_type_(t, TOK_ID) || (m = is_mmacro(t, &params)) == NULL)
3740 return 0;
3741 last->next = NULL;
3742 tline = t;
3746 * Fix up the parameters: this involves stripping leading and
3747 * trailing whitespace, then stripping braces if they are
3748 * present.
3750 for (nparam = 0; params[nparam]; nparam++) ;
3751 paramlen = nparam ? nasm_malloc(nparam * sizeof(*paramlen)) : NULL;
3753 for (i = 0; params[i]; i++) {
3754 int brace = false;
3755 int comma = (!m->plus || i < nparam - 1);
3757 t = params[i];
3758 skip_white_(t);
3759 if (tok_is_(t, "{"))
3760 t = t->next, brace = true, comma = false;
3761 params[i] = t;
3762 paramlen[i] = 0;
3763 while (t) {
3764 if (comma && t->type == TOK_OTHER && !strcmp(t->text, ","))
3765 break; /* ... because we have hit a comma */
3766 if (comma && t->type == TOK_WHITESPACE
3767 && tok_is_(t->next, ","))
3768 break; /* ... or a space then a comma */
3769 if (brace && t->type == TOK_OTHER && !strcmp(t->text, "}"))
3770 break; /* ... or a brace */
3771 t = t->next;
3772 paramlen[i]++;
3777 * OK, we have a MMacro structure together with a set of
3778 * parameters. We must now go through the expansion and push
3779 * copies of each Line on to istk->expansion. Substitution of
3780 * parameter tokens and macro-local tokens doesn't get done
3781 * until the single-line macro substitution process; this is
3782 * because delaying them allows us to change the semantics
3783 * later through %rotate.
3785 * First, push an end marker on to istk->expansion, mark this
3786 * macro as in progress, and set up its invocation-specific
3787 * variables.
3789 ll = nasm_malloc(sizeof(Line));
3790 ll->next = istk->expansion;
3791 ll->finishes = m;
3792 ll->first = NULL;
3793 istk->expansion = ll;
3795 m->in_progress = true;
3796 m->params = params;
3797 m->iline = tline;
3798 m->nparam = nparam;
3799 m->rotate = 0;
3800 m->paramlen = paramlen;
3801 m->unique = unique++;
3802 m->lineno = 0;
3804 m->next_active = istk->mstk;
3805 istk->mstk = m;
3807 for (l = m->expansion; l; l = l->next) {
3808 Token **tail;
3810 ll = nasm_malloc(sizeof(Line));
3811 ll->finishes = NULL;
3812 ll->next = istk->expansion;
3813 istk->expansion = ll;
3814 tail = &ll->first;
3816 for (t = l->first; t; t = t->next) {
3817 Token *x = t;
3818 switch (t->type) {
3819 case TOK_PREPROC_Q:
3820 tt = *tail = new_Token(NULL, TOK_ID, mtok->text, 0);
3821 break;
3822 case TOK_PREPROC_QQ:
3823 tt = *tail = new_Token(NULL, TOK_ID, m->name, 0);
3824 break;
3825 case TOK_PREPROC_ID:
3826 if (t->text[1] == '0' && t->text[2] == '0') {
3827 dont_prepend = -1;
3828 x = label;
3829 if (!x)
3830 continue;
3832 /* fall through */
3833 default:
3834 tt = *tail = new_Token(NULL, x->type, x->text, 0);
3835 break;
3837 tail = &tt->next;
3839 *tail = NULL;
3843 * If we had a label, push it on as the first line of
3844 * the macro expansion.
3846 if (label) {
3847 if (dont_prepend < 0)
3848 free_tlist(startline);
3849 else {
3850 ll = nasm_malloc(sizeof(Line));
3851 ll->finishes = NULL;
3852 ll->next = istk->expansion;
3853 istk->expansion = ll;
3854 ll->first = startline;
3855 if (!dont_prepend) {
3856 while (label->next)
3857 label = label->next;
3858 label->next = tt = new_Token(NULL, TOK_OTHER, ":", 0);
3863 list->uplevel(m->nolist ? LIST_MACRO_NOLIST : LIST_MACRO);
3865 return 1;
3869 * Since preprocessor always operate only on the line that didn't
3870 * arrived yet, we should always use ERR_OFFBY1. Also since user
3871 * won't want to see same error twice (preprocessing is done once
3872 * per pass) we will want to show errors only during pass one.
3874 static void error(int severity, const char *fmt, ...)
3876 va_list arg;
3877 char buff[1024];
3879 /* If we're in a dead branch of IF or something like it, ignore the error */
3880 if (istk && istk->conds && !emitting(istk->conds->state))
3881 return;
3883 va_start(arg, fmt);
3884 vsnprintf(buff, sizeof(buff), fmt, arg);
3885 va_end(arg);
3887 if (istk && istk->mstk && istk->mstk->name)
3888 _error(severity | ERR_PASS1, "(%s:%d) %s", istk->mstk->name,
3889 istk->mstk->lineno, buff);
3890 else
3891 _error(severity | ERR_PASS1, "%s", buff);
3894 static void
3895 pp_reset(char *file, int apass, efunc errfunc, evalfunc eval,
3896 ListGen * listgen, StrList **deplist)
3898 _error = errfunc;
3899 cstk = NULL;
3900 istk = nasm_malloc(sizeof(Include));
3901 istk->next = NULL;
3902 istk->conds = NULL;
3903 istk->expansion = NULL;
3904 istk->mstk = NULL;
3905 istk->fp = fopen(file, "r");
3906 istk->fname = NULL;
3907 src_set_fname(nasm_strdup(file));
3908 src_set_linnum(0);
3909 istk->lineinc = 1;
3910 if (!istk->fp)
3911 error(ERR_FATAL | ERR_NOFILE, "unable to open input file `%s'",
3912 file);
3913 defining = NULL;
3914 init_macros();
3915 unique = 0;
3916 if (tasm_compatible_mode) {
3917 stdmacpos = nasm_stdmac;
3918 } else {
3919 stdmacpos = nasm_stdmac_after_tasm;
3921 any_extrastdmac = (extrastdmac != NULL);
3922 list = listgen;
3923 evaluate = eval;
3924 pass = apass;
3925 dephead = deptail = deplist;
3926 if (deplist) {
3927 StrList *sl = nasm_malloc(strlen(file)+1+sizeof sl->next);
3928 sl->next = NULL;
3929 strcpy(sl->str, file);
3930 *deptail = sl;
3931 deptail = &sl->next;
3935 static char *pp_getline(void)
3937 char *line;
3938 Token *tline;
3940 while (1) {
3942 * Fetch a tokenized line, either from the macro-expansion
3943 * buffer or from the input file.
3945 tline = NULL;
3946 while (istk->expansion && istk->expansion->finishes) {
3947 Line *l = istk->expansion;
3948 if (!l->finishes->name && l->finishes->in_progress > 1) {
3949 Line *ll;
3952 * This is a macro-end marker for a macro with no
3953 * name, which means it's not really a macro at all
3954 * but a %rep block, and the `in_progress' field is
3955 * more than 1, meaning that we still need to
3956 * repeat. (1 means the natural last repetition; 0
3957 * means termination by %exitrep.) We have
3958 * therefore expanded up to the %endrep, and must
3959 * push the whole block on to the expansion buffer
3960 * again. We don't bother to remove the macro-end
3961 * marker: we'd only have to generate another one
3962 * if we did.
3964 l->finishes->in_progress--;
3965 for (l = l->finishes->expansion; l; l = l->next) {
3966 Token *t, *tt, **tail;
3968 ll = nasm_malloc(sizeof(Line));
3969 ll->next = istk->expansion;
3970 ll->finishes = NULL;
3971 ll->first = NULL;
3972 tail = &ll->first;
3974 for (t = l->first; t; t = t->next) {
3975 if (t->text || t->type == TOK_WHITESPACE) {
3976 tt = *tail =
3977 new_Token(NULL, t->type, t->text, 0);
3978 tail = &tt->next;
3982 istk->expansion = ll;
3984 } else {
3986 * Check whether a `%rep' was started and not ended
3987 * within this macro expansion. This can happen and
3988 * should be detected. It's a fatal error because
3989 * I'm too confused to work out how to recover
3990 * sensibly from it.
3992 if (defining) {
3993 if (defining->name)
3994 error(ERR_PANIC,
3995 "defining with name in expansion");
3996 else if (istk->mstk->name)
3997 error(ERR_FATAL,
3998 "`%%rep' without `%%endrep' within"
3999 " expansion of macro `%s'",
4000 istk->mstk->name);
4004 * FIXME: investigate the relationship at this point between
4005 * istk->mstk and l->finishes
4008 MMacro *m = istk->mstk;
4009 istk->mstk = m->next_active;
4010 if (m->name) {
4012 * This was a real macro call, not a %rep, and
4013 * therefore the parameter information needs to
4014 * be freed.
4016 nasm_free(m->params);
4017 free_tlist(m->iline);
4018 nasm_free(m->paramlen);
4019 l->finishes->in_progress = false;
4020 } else
4021 free_mmacro(m);
4023 istk->expansion = l->next;
4024 nasm_free(l);
4025 list->downlevel(LIST_MACRO);
4028 while (1) { /* until we get a line we can use */
4030 if (istk->expansion) { /* from a macro expansion */
4031 char *p;
4032 Line *l = istk->expansion;
4033 if (istk->mstk)
4034 istk->mstk->lineno++;
4035 tline = l->first;
4036 istk->expansion = l->next;
4037 nasm_free(l);
4038 p = detoken(tline, false);
4039 list->line(LIST_MACRO, p);
4040 nasm_free(p);
4041 break;
4043 line = read_line();
4044 if (line) { /* from the current input file */
4045 line = prepreproc(line);
4046 tline = tokenize(line);
4047 nasm_free(line);
4048 break;
4051 * The current file has ended; work down the istk
4054 Include *i = istk;
4055 fclose(i->fp);
4056 if (i->conds)
4057 error(ERR_FATAL,
4058 "expected `%%endif' before end of file");
4059 /* only set line and file name if there's a next node */
4060 if (i->next) {
4061 src_set_linnum(i->lineno);
4062 nasm_free(src_set_fname(i->fname));
4064 istk = i->next;
4065 list->downlevel(LIST_INCLUDE);
4066 nasm_free(i);
4067 if (!istk)
4068 return NULL;
4073 * We must expand MMacro parameters and MMacro-local labels
4074 * _before_ we plunge into directive processing, to cope
4075 * with things like `%define something %1' such as STRUC
4076 * uses. Unless we're _defining_ a MMacro, in which case
4077 * those tokens should be left alone to go into the
4078 * definition; and unless we're in a non-emitting
4079 * condition, in which case we don't want to meddle with
4080 * anything.
4082 if (!defining && !(istk->conds && !emitting(istk->conds->state)))
4083 tline = expand_mmac_params(tline);
4086 * Check the line to see if it's a preprocessor directive.
4088 if (do_directive(tline) == DIRECTIVE_FOUND) {
4089 continue;
4090 } else if (defining) {
4092 * We're defining a multi-line macro. We emit nothing
4093 * at all, and just
4094 * shove the tokenized line on to the macro definition.
4096 Line *l = nasm_malloc(sizeof(Line));
4097 l->next = defining->expansion;
4098 l->first = tline;
4099 l->finishes = false;
4100 defining->expansion = l;
4101 continue;
4102 } else if (istk->conds && !emitting(istk->conds->state)) {
4104 * We're in a non-emitting branch of a condition block.
4105 * Emit nothing at all, not even a blank line: when we
4106 * emerge from the condition we'll give a line-number
4107 * directive so we keep our place correctly.
4109 free_tlist(tline);
4110 continue;
4111 } else if (istk->mstk && !istk->mstk->in_progress) {
4113 * We're in a %rep block which has been terminated, so
4114 * we're walking through to the %endrep without
4115 * emitting anything. Emit nothing at all, not even a
4116 * blank line: when we emerge from the %rep block we'll
4117 * give a line-number directive so we keep our place
4118 * correctly.
4120 free_tlist(tline);
4121 continue;
4122 } else {
4123 tline = expand_smacro(tline);
4124 if (!expand_mmacro(tline)) {
4126 * De-tokenize the line again, and emit it.
4128 line = detoken(tline, true);
4129 free_tlist(tline);
4130 break;
4131 } else {
4132 continue; /* expand_mmacro calls free_tlist */
4137 return line;
4140 static void pp_cleanup(int pass)
4142 if (defining) {
4143 error(ERR_NONFATAL, "end of file while still defining macro `%s'",
4144 defining->name);
4145 free_mmacro(defining);
4147 while (cstk)
4148 ctx_pop();
4149 free_macros();
4150 while (istk) {
4151 Include *i = istk;
4152 istk = istk->next;
4153 fclose(i->fp);
4154 nasm_free(i->fname);
4155 nasm_free(i);
4157 while (cstk)
4158 ctx_pop();
4159 if (pass == 0) {
4160 free_llist(predef);
4161 delete_Blocks();
4165 void pp_include_path(char *path)
4167 IncPath *i;
4169 i = nasm_malloc(sizeof(IncPath));
4170 i->path = path ? nasm_strdup(path) : NULL;
4171 i->next = NULL;
4173 if (ipath != NULL) {
4174 IncPath *j = ipath;
4175 while (j->next != NULL)
4176 j = j->next;
4177 j->next = i;
4178 } else {
4179 ipath = i;
4183 void pp_pre_include(char *fname)
4185 Token *inc, *space, *name;
4186 Line *l;
4188 name = new_Token(NULL, TOK_INTERNAL_STRING, fname, 0);
4189 space = new_Token(name, TOK_WHITESPACE, NULL, 0);
4190 inc = new_Token(space, TOK_PREPROC_ID, "%include", 0);
4192 l = nasm_malloc(sizeof(Line));
4193 l->next = predef;
4194 l->first = inc;
4195 l->finishes = false;
4196 predef = l;
4199 void pp_pre_define(char *definition)
4201 Token *def, *space;
4202 Line *l;
4203 char *equals;
4205 equals = strchr(definition, '=');
4206 space = new_Token(NULL, TOK_WHITESPACE, NULL, 0);
4207 def = new_Token(space, TOK_PREPROC_ID, "%define", 0);
4208 if (equals)
4209 *equals = ' ';
4210 space->next = tokenize(definition);
4211 if (equals)
4212 *equals = '=';
4214 l = nasm_malloc(sizeof(Line));
4215 l->next = predef;
4216 l->first = def;
4217 l->finishes = false;
4218 predef = l;
4221 void pp_pre_undefine(char *definition)
4223 Token *def, *space;
4224 Line *l;
4226 space = new_Token(NULL, TOK_WHITESPACE, NULL, 0);
4227 def = new_Token(space, TOK_PREPROC_ID, "%undef", 0);
4228 space->next = tokenize(definition);
4230 l = nasm_malloc(sizeof(Line));
4231 l->next = predef;
4232 l->first = def;
4233 l->finishes = false;
4234 predef = l;
4238 * Added by Keith Kanios:
4240 * This function is used to assist with "runtime" preprocessor
4241 * directives. (e.g. pp_runtime("%define __BITS__ 64");)
4243 * ERRORS ARE IGNORED HERE, SO MAKE COMPLETELY SURE THAT YOU
4244 * PASS A VALID STRING TO THIS FUNCTION!!!!!
4247 void pp_runtime(char *definition)
4249 Token *def;
4251 def = tokenize(definition);
4252 if(do_directive(def) == NO_DIRECTIVE_FOUND)
4253 free_tlist(def);
4257 void pp_extra_stdmac(const char **macros)
4259 extrastdmac = macros;
4262 static void make_tok_num(Token * tok, int64_t val)
4264 char numbuf[20];
4265 snprintf(numbuf, sizeof(numbuf), "%"PRId64"", val);
4266 tok->text = nasm_strdup(numbuf);
4267 tok->type = TOK_NUMBER;
4270 Preproc nasmpp = {
4271 pp_reset,
4272 pp_getline,
4273 pp_cleanup