NASM 2.04rc4
[nasm/avx512.git] / preproc.c
blobb98a61b2cdf50ec87c5308a55c6e7c0c5b3881d6
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 union {
170 SMacro *mac; /* associated macro for TOK_SMAC_END */
171 size_t len; /* scratch length field */
172 } a; /* Auxiliary data */
173 enum pp_token_type type;
177 * Multi-line macro definitions are stored as a linked list of
178 * these, which is essentially a container to allow several linked
179 * lists of Tokens.
181 * Note that in this module, linked lists are treated as stacks
182 * wherever possible. For this reason, Lines are _pushed_ on to the
183 * `expansion' field in MMacro structures, so that the linked list,
184 * if walked, would give the macro lines in reverse order; this
185 * means that we can walk the list when expanding a macro, and thus
186 * push the lines on to the `expansion' field in _istk_ in reverse
187 * order (so that when popped back off they are in the right
188 * order). It may seem cockeyed, and it relies on my design having
189 * an even number of steps in, but it works...
191 * Some of these structures, rather than being actual lines, are
192 * markers delimiting the end of the expansion of a given macro.
193 * This is for use in the cycle-tracking and %rep-handling code.
194 * Such structures have `finishes' non-NULL, and `first' NULL. All
195 * others have `finishes' NULL, but `first' may still be NULL if
196 * the line is blank.
198 struct Line {
199 Line *next;
200 MMacro *finishes;
201 Token *first;
205 * To handle an arbitrary level of file inclusion, we maintain a
206 * stack (ie linked list) of these things.
208 struct Include {
209 Include *next;
210 FILE *fp;
211 Cond *conds;
212 Line *expansion;
213 char *fname;
214 int lineno, lineinc;
215 MMacro *mstk; /* stack of active macros/reps */
219 * Include search path. This is simply a list of strings which get
220 * prepended, in turn, to the name of an include file, in an
221 * attempt to find the file if it's not in the current directory.
223 struct IncPath {
224 IncPath *next;
225 char *path;
229 * Conditional assembly: we maintain a separate stack of these for
230 * each level of file inclusion. (The only reason we keep the
231 * stacks separate is to ensure that a stray `%endif' in a file
232 * included from within the true branch of a `%if' won't terminate
233 * it and cause confusion: instead, rightly, it'll cause an error.)
235 struct Cond {
236 Cond *next;
237 int state;
239 enum {
241 * These states are for use just after %if or %elif: IF_TRUE
242 * means the condition has evaluated to truth so we are
243 * currently emitting, whereas IF_FALSE means we are not
244 * currently emitting but will start doing so if a %else comes
245 * up. In these states, all directives are admissible: %elif,
246 * %else and %endif. (And of course %if.)
248 COND_IF_TRUE, COND_IF_FALSE,
250 * These states come up after a %else: ELSE_TRUE means we're
251 * emitting, and ELSE_FALSE means we're not. In ELSE_* states,
252 * any %elif or %else will cause an error.
254 COND_ELSE_TRUE, COND_ELSE_FALSE,
256 * These states mean that we're not emitting now, and also that
257 * nothing until %endif will be emitted at all. COND_DONE is
258 * used when we've had our moment of emission
259 * and have now started seeing %elifs. COND_NEVER is used when
260 * the condition construct in question is contained within a
261 * non-emitting branch of a larger condition construct,
262 * or if there is an error.
264 COND_DONE, COND_NEVER
266 #define emitting(x) ( (x) == COND_IF_TRUE || (x) == COND_ELSE_TRUE )
269 * These defines are used as the possible return values for do_directive
271 #define NO_DIRECTIVE_FOUND 0
272 #define DIRECTIVE_FOUND 1
275 * Condition codes. Note that we use c_ prefix not C_ because C_ is
276 * used in nasm.h for the "real" condition codes. At _this_ level,
277 * we treat CXZ and ECXZ as condition codes, albeit non-invertible
278 * ones, so we need a different enum...
280 static const char * const conditions[] = {
281 "a", "ae", "b", "be", "c", "cxz", "e", "ecxz", "g", "ge", "l", "le",
282 "na", "nae", "nb", "nbe", "nc", "ne", "ng", "nge", "nl", "nle", "no",
283 "np", "ns", "nz", "o", "p", "pe", "po", "rcxz", "s", "z"
285 enum pp_conds {
286 c_A, c_AE, c_B, c_BE, c_C, c_CXZ, c_E, c_ECXZ, c_G, c_GE, c_L, c_LE,
287 c_NA, c_NAE, c_NB, c_NBE, c_NC, c_NE, c_NG, c_NGE, c_NL, c_NLE, c_NO,
288 c_NP, c_NS, c_NZ, c_O, c_P, c_PE, c_PO, c_RCXZ, c_S, c_Z,
289 c_none = -1
291 static const enum pp_conds inverse_ccs[] = {
292 c_NA, c_NAE, c_NB, c_NBE, c_NC, -1, c_NE, -1, c_NG, c_NGE, c_NL, c_NLE,
293 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,
294 c_Z, c_NO, c_NP, c_PO, c_PE, -1, c_NS, c_NZ
298 * Directive names.
300 /* If this is a an IF, ELIF, ELSE or ENDIF keyword */
301 static int is_condition(enum preproc_token arg)
303 return PP_IS_COND(arg) || (arg == PP_ELSE) || (arg == PP_ENDIF);
306 /* For TASM compatibility we need to be able to recognise TASM compatible
307 * conditional compilation directives. Using the NASM pre-processor does
308 * not work, so we look for them specifically from the following list and
309 * then jam in the equivalent NASM directive into the input stream.
312 enum {
313 TM_ARG, TM_ELIF, TM_ELSE, TM_ENDIF, TM_IF, TM_IFDEF, TM_IFDIFI,
314 TM_IFNDEF, TM_INCLUDE, TM_LOCAL
317 static const char * const tasm_directives[] = {
318 "arg", "elif", "else", "endif", "if", "ifdef", "ifdifi",
319 "ifndef", "include", "local"
322 static int StackSize = 4;
323 static char *StackPointer = "ebp";
324 static int ArgOffset = 8;
325 static int LocalOffset = 0;
327 static Context *cstk;
328 static Include *istk;
329 static IncPath *ipath = NULL;
331 static efunc _error; /* Pointer to client-provided error reporting function */
332 static evalfunc evaluate;
334 static int pass; /* HACK: pass 0 = generate dependencies only */
335 static StrList **dephead, **deptail; /* Dependency list */
337 static uint64_t unique; /* unique identifier numbers */
339 static Line *predef = NULL;
340 static bool do_predef;
342 static ListGen *list;
345 * The current set of multi-line macros we have defined.
347 static struct hash_table mmacros;
350 * The current set of single-line macros we have defined.
352 static struct hash_table smacros;
355 * The multi-line macro we are currently defining, or the %rep
356 * block we are currently reading, if any.
358 static MMacro *defining;
360 static uint64_t nested_mac_count;
361 static uint64_t nested_rep_count;
364 * The number of macro parameters to allocate space for at a time.
366 #define PARAM_DELTA 16
369 * The standard macro set: defined in macros.c in the array nasm_stdmac.
370 * This gives our position in the macro set, when we're processing it.
372 static macros_t *stdmacpos;
375 * The extra standard macros that come from the object format, if
376 * any.
378 static macros_t *extrastdmac = NULL;
379 static bool any_extrastdmac;
382 * Tokens are allocated in blocks to improve speed
384 #define TOKEN_BLOCKSIZE 4096
385 static Token *freeTokens = NULL;
386 struct Blocks {
387 Blocks *next;
388 void *chunk;
391 static Blocks blocks = { NULL, NULL };
394 * Forward declarations.
396 static Token *expand_mmac_params(Token * tline);
397 static Token *expand_smacro(Token * tline);
398 static Token *expand_id(Token * tline);
399 static Context *get_ctx(const char *name, bool all_contexts);
400 static void make_tok_num(Token * tok, int64_t val);
401 static void error(int severity, const char *fmt, ...);
402 static void error_precond(int severity, const char *fmt, ...);
403 static void *new_Block(size_t size);
404 static void delete_Blocks(void);
405 static Token *new_Token(Token * next, enum pp_token_type type,
406 const char *text, int txtlen);
407 static Token *delete_Token(Token * t);
410 * Macros for safe checking of token pointers, avoid *(NULL)
412 #define tok_type_(x,t) ((x) && (x)->type == (t))
413 #define skip_white_(x) if (tok_type_((x), TOK_WHITESPACE)) (x)=(x)->next
414 #define tok_is_(x,v) (tok_type_((x), TOK_OTHER) && !strcmp((x)->text,(v)))
415 #define tok_isnt_(x,v) ((x) && ((x)->type!=TOK_OTHER || strcmp((x)->text,(v))))
417 /* Handle TASM specific directives, which do not contain a % in
418 * front of them. We do it here because I could not find any other
419 * place to do it for the moment, and it is a hack (ideally it would
420 * be nice to be able to use the NASM pre-processor to do it).
422 static char *check_tasm_directive(char *line)
424 int32_t i, j, k, m, len;
425 char *p = line, *oldline, oldchar;
427 /* Skip whitespace */
428 while (nasm_isspace(*p) && *p != 0)
429 p++;
431 /* Binary search for the directive name */
432 i = -1;
433 j = elements(tasm_directives);
434 len = 0;
435 while (!nasm_isspace(p[len]) && p[len] != 0)
436 len++;
437 if (len) {
438 oldchar = p[len];
439 p[len] = 0;
440 while (j - i > 1) {
441 k = (j + i) / 2;
442 m = nasm_stricmp(p, tasm_directives[k]);
443 if (m == 0) {
444 /* We have found a directive, so jam a % in front of it
445 * so that NASM will then recognise it as one if it's own.
447 p[len] = oldchar;
448 len = strlen(p);
449 oldline = line;
450 line = nasm_malloc(len + 2);
451 line[0] = '%';
452 if (k == TM_IFDIFI) {
453 /* NASM does not recognise IFDIFI, so we convert it to
454 * %ifdef BOGUS. This is not used in NASM comaptible
455 * code, but does need to parse for the TASM macro
456 * package.
458 strcpy(line + 1, "ifdef BOGUS");
459 } else {
460 memcpy(line + 1, p, len + 1);
462 nasm_free(oldline);
463 return line;
464 } else if (m < 0) {
465 j = k;
466 } else
467 i = k;
469 p[len] = oldchar;
471 return line;
475 * The pre-preprocessing stage... This function translates line
476 * number indications as they emerge from GNU cpp (`# lineno "file"
477 * flags') into NASM preprocessor line number indications (`%line
478 * lineno file').
480 static char *prepreproc(char *line)
482 int lineno, fnlen;
483 char *fname, *oldline;
485 if (line[0] == '#' && line[1] == ' ') {
486 oldline = line;
487 fname = oldline + 2;
488 lineno = atoi(fname);
489 fname += strspn(fname, "0123456789 ");
490 if (*fname == '"')
491 fname++;
492 fnlen = strcspn(fname, "\"");
493 line = nasm_malloc(20 + fnlen);
494 snprintf(line, 20 + fnlen, "%%line %d %.*s", lineno, fnlen, fname);
495 nasm_free(oldline);
497 if (tasm_compatible_mode)
498 return check_tasm_directive(line);
499 return line;
503 * Free a linked list of tokens.
505 static void free_tlist(Token * list)
507 while (list) {
508 list = delete_Token(list);
513 * Free a linked list of lines.
515 static void free_llist(Line * list)
517 Line *l;
518 while (list) {
519 l = list;
520 list = list->next;
521 free_tlist(l->first);
522 nasm_free(l);
527 * Free an MMacro
529 static void free_mmacro(MMacro * m)
531 nasm_free(m->name);
532 free_tlist(m->dlist);
533 nasm_free(m->defaults);
534 free_llist(m->expansion);
535 nasm_free(m);
539 * Free all currently defined macros, and free the hash tables
541 static void free_smacro_table(struct hash_table *smt)
543 SMacro *s;
544 const char *key;
545 struct hash_tbl_node *it = NULL;
547 while ((s = hash_iterate(smt, &it, &key)) != NULL) {
548 nasm_free((void *)key);
549 while (s) {
550 SMacro *ns = s->next;
551 nasm_free(s->name);
552 free_tlist(s->expansion);
553 nasm_free(s);
554 s = ns;
557 hash_free(smt);
560 static void free_mmacro_table(struct hash_table *mmt)
562 MMacro *m;
563 const char *key;
564 struct hash_tbl_node *it = NULL;
566 it = NULL;
567 while ((m = hash_iterate(mmt, &it, &key)) != NULL) {
568 nasm_free((void *)key);
569 while (m) {
570 MMacro *nm = m->next;
571 free_mmacro(m);
572 m = nm;
575 hash_free(mmt);
578 static void free_macros(void)
580 free_smacro_table(&smacros);
581 free_mmacro_table(&mmacros);
585 * Initialize the hash tables
587 static void init_macros(void)
589 hash_init(&smacros, HASH_LARGE);
590 hash_init(&mmacros, HASH_LARGE);
594 * Pop the context stack.
596 static void ctx_pop(void)
598 Context *c = cstk;
600 cstk = cstk->next;
601 free_smacro_table(&c->localmac);
602 nasm_free(c->name);
603 nasm_free(c);
607 * Search for a key in the hash index; adding it if necessary
608 * (in which case we initialize the data pointer to NULL.)
610 static void **
611 hash_findi_add(struct hash_table *hash, const char *str)
613 struct hash_insert hi;
614 void **r;
615 char *strx;
617 r = hash_findi(hash, str, &hi);
618 if (r)
619 return r;
621 strx = nasm_strdup(str); /* Use a more efficient allocator here? */
622 return hash_add(&hi, strx, NULL);
626 * Like hash_findi, but returns the data element rather than a pointer
627 * to it. Used only when not adding a new element, hence no third
628 * argument.
630 static void *
631 hash_findix(struct hash_table *hash, const char *str)
633 void **p;
635 p = hash_findi(hash, str, NULL);
636 return p ? *p : NULL;
639 #define BUF_DELTA 512
641 * Read a line from the top file in istk, handling multiple CR/LFs
642 * at the end of the line read, and handling spurious ^Zs. Will
643 * return lines from the standard macro set if this has not already
644 * been done.
646 static char *read_line(void)
648 char *buffer, *p, *q;
649 int bufsize, continued_count;
651 if (stdmacpos) {
652 unsigned char c;
653 const unsigned char *p = stdmacpos;
654 char *ret, *q;
655 size_t len = 0;
656 while ((c = *p++)) {
657 if (c >= 0x80)
658 len += pp_directives_len[c-0x80]+1;
659 else
660 len++;
662 ret = nasm_malloc(len+1);
663 q = ret;
664 while ((c = *stdmacpos++)) {
665 if (c >= 0x80) {
666 memcpy(q, pp_directives[c-0x80], pp_directives_len[c-0x80]);
667 q += pp_directives_len[c-0x80];
668 *q++ = ' ';
669 } else {
670 *q++ = c;
673 stdmacpos = p;
674 *q = '\0';
676 if (!*stdmacpos) {
677 /* This was the last of the standard macro chain... */
678 stdmacpos = NULL;
679 if (any_extrastdmac) {
680 stdmacpos = extrastdmac;
681 any_extrastdmac = false;
682 } else if (do_predef) {
683 Line *pd, *l;
684 Token *head, **tail, *t;
687 * Nasty hack: here we push the contents of
688 * `predef' on to the top-level expansion stack,
689 * since this is the most convenient way to
690 * implement the pre-include and pre-define
691 * features.
693 for (pd = predef; pd; pd = pd->next) {
694 head = NULL;
695 tail = &head;
696 for (t = pd->first; t; t = t->next) {
697 *tail = new_Token(NULL, t->type, t->text, 0);
698 tail = &(*tail)->next;
700 l = nasm_malloc(sizeof(Line));
701 l->next = istk->expansion;
702 l->first = head;
703 l->finishes = NULL;
704 istk->expansion = l;
706 do_predef = false;
709 return ret;
712 bufsize = BUF_DELTA;
713 buffer = nasm_malloc(BUF_DELTA);
714 p = buffer;
715 continued_count = 0;
716 while (1) {
717 q = fgets(p, bufsize - (p - buffer), istk->fp);
718 if (!q)
719 break;
720 p += strlen(p);
721 if (p > buffer && p[-1] == '\n') {
722 /* Convert backslash-CRLF line continuation sequences into
723 nothing at all (for DOS and Windows) */
724 if (((p - 2) > buffer) && (p[-3] == '\\') && (p[-2] == '\r')) {
725 p -= 3;
726 *p = 0;
727 continued_count++;
729 /* Also convert backslash-LF line continuation sequences into
730 nothing at all (for Unix) */
731 else if (((p - 1) > buffer) && (p[-2] == '\\')) {
732 p -= 2;
733 *p = 0;
734 continued_count++;
735 } else {
736 break;
739 if (p - buffer > bufsize - 10) {
740 int32_t offset = p - buffer;
741 bufsize += BUF_DELTA;
742 buffer = nasm_realloc(buffer, bufsize);
743 p = buffer + offset; /* prevent stale-pointer problems */
747 if (!q && p == buffer) {
748 nasm_free(buffer);
749 return NULL;
752 src_set_linnum(src_get_linnum() + istk->lineinc +
753 (continued_count * istk->lineinc));
756 * Play safe: remove CRs as well as LFs, if any of either are
757 * present at the end of the line.
759 while (--p >= buffer && (*p == '\n' || *p == '\r'))
760 *p = '\0';
763 * Handle spurious ^Z, which may be inserted into source files
764 * by some file transfer utilities.
766 buffer[strcspn(buffer, "\032")] = '\0';
768 list->line(LIST_READ, buffer);
770 return buffer;
774 * Tokenize a line of text. This is a very simple process since we
775 * don't need to parse the value out of e.g. numeric tokens: we
776 * simply split one string into many.
778 static Token *tokenize(char *line)
780 char *p = line;
781 enum pp_token_type type;
782 Token *list = NULL;
783 Token *t, **tail = &list;
785 while (*line) {
786 p = line;
787 if (*p == '%') {
788 p++;
789 if (nasm_isdigit(*p) ||
790 ((*p == '-' || *p == '+') && nasm_isdigit(p[1])) ||
791 ((*p == '+') && (nasm_isspace(p[1]) || !p[1]))) {
792 do {
793 p++;
795 while (nasm_isdigit(*p));
796 type = TOK_PREPROC_ID;
797 } else if (*p == '{') {
798 p++;
799 while (*p && *p != '}') {
800 p[-1] = *p;
801 p++;
803 p[-1] = '\0';
804 if (*p)
805 p++;
806 type = TOK_PREPROC_ID;
807 } else if (*p == '?') {
808 type = TOK_PREPROC_Q; /* %? */
809 p++;
810 if (*p == '?') {
811 type = TOK_PREPROC_QQ; /* %?? */
812 p++;
814 } else if (isidchar(*p) ||
815 ((*p == '!' || *p == '%' || *p == '$') &&
816 isidchar(p[1]))) {
817 do {
818 p++;
820 while (isidchar(*p));
821 type = TOK_PREPROC_ID;
822 } else {
823 type = TOK_OTHER;
824 if (*p == '%')
825 p++;
827 } else if (isidstart(*p) || (*p == '$' && isidstart(p[1]))) {
828 type = TOK_ID;
829 p++;
830 while (*p && isidchar(*p))
831 p++;
832 } else if (*p == '\'' || *p == '"' || *p == '`') {
834 * A string token.
836 type = TOK_STRING;
837 p = nasm_skip_string(p);
839 if (*p) {
840 p++;
841 } else {
842 error(ERR_WARNING, "unterminated string");
843 /* Handling unterminated strings by UNV */
844 /* type = -1; */
846 } else if (isnumstart(*p)) {
847 bool is_hex = false;
848 bool is_float = false;
849 bool has_e = false;
850 char c, *r;
853 * A numeric token.
856 if (*p == '$') {
857 p++;
858 is_hex = true;
861 for (;;) {
862 c = *p++;
864 if (!is_hex && (c == 'e' || c == 'E')) {
865 has_e = true;
866 if (*p == '+' || *p == '-') {
867 /* e can only be followed by +/- if it is either a
868 prefixed hex number or a floating-point number */
869 p++;
870 is_float = true;
872 } else if (c == 'H' || c == 'h' || c == 'X' || c == 'x') {
873 is_hex = true;
874 } else if (c == 'P' || c == 'p') {
875 is_float = true;
876 if (*p == '+' || *p == '-')
877 p++;
878 } else if (isnumchar(c) || c == '_')
879 ; /* just advance */
880 else if (c == '.') {
881 /* we need to deal with consequences of the legacy
882 parser, like "1.nolist" being two tokens
883 (TOK_NUMBER, TOK_ID) here; at least give it
884 a shot for now. In the future, we probably need
885 a flex-based scanner with proper pattern matching
886 to do it as well as it can be done. Nothing in
887 the world is going to help the person who wants
888 0x123.p16 interpreted as two tokens, though. */
889 r = p;
890 while (*r == '_')
891 r++;
893 if (nasm_isdigit(*r) || (is_hex && nasm_isxdigit(*r)) ||
894 (!is_hex && (*r == 'e' || *r == 'E')) ||
895 (*r == 'p' || *r == 'P')) {
896 p = r;
897 is_float = true;
898 } else
899 break; /* Terminate the token */
900 } else
901 break;
903 p--; /* Point to first character beyond number */
905 if (has_e && !is_hex) {
906 /* 1e13 is floating-point, but 1e13h is not */
907 is_float = true;
910 type = is_float ? TOK_FLOAT : TOK_NUMBER;
911 } else if (nasm_isspace(*p)) {
912 type = TOK_WHITESPACE;
913 p++;
914 while (*p && nasm_isspace(*p))
915 p++;
917 * Whitespace just before end-of-line is discarded by
918 * pretending it's a comment; whitespace just before a
919 * comment gets lumped into the comment.
921 if (!*p || *p == ';') {
922 type = TOK_COMMENT;
923 while (*p)
924 p++;
926 } else if (*p == ';') {
927 type = TOK_COMMENT;
928 while (*p)
929 p++;
930 } else {
932 * Anything else is an operator of some kind. We check
933 * for all the double-character operators (>>, <<, //,
934 * %%, <=, >=, ==, !=, <>, &&, ||, ^^), but anything
935 * else is a single-character operator.
937 type = TOK_OTHER;
938 if ((p[0] == '>' && p[1] == '>') ||
939 (p[0] == '<' && p[1] == '<') ||
940 (p[0] == '/' && p[1] == '/') ||
941 (p[0] == '<' && p[1] == '=') ||
942 (p[0] == '>' && p[1] == '=') ||
943 (p[0] == '=' && p[1] == '=') ||
944 (p[0] == '!' && p[1] == '=') ||
945 (p[0] == '<' && p[1] == '>') ||
946 (p[0] == '&' && p[1] == '&') ||
947 (p[0] == '|' && p[1] == '|') ||
948 (p[0] == '^' && p[1] == '^')) {
949 p++;
951 p++;
954 /* Handling unterminated string by UNV */
955 /*if (type == -1)
957 *tail = t = new_Token(NULL, TOK_STRING, line, p-line+1);
958 t->text[p-line] = *line;
959 tail = &t->next;
961 else */
962 if (type != TOK_COMMENT) {
963 *tail = t = new_Token(NULL, type, line, p - line);
964 tail = &t->next;
966 line = p;
968 return list;
972 * this function allocates a new managed block of memory and
973 * returns a pointer to the block. The managed blocks are
974 * deleted only all at once by the delete_Blocks function.
976 static void *new_Block(size_t size)
978 Blocks *b = &blocks;
980 /* first, get to the end of the linked list */
981 while (b->next)
982 b = b->next;
983 /* now allocate the requested chunk */
984 b->chunk = nasm_malloc(size);
986 /* now allocate a new block for the next request */
987 b->next = nasm_malloc(sizeof(Blocks));
988 /* and initialize the contents of the new block */
989 b->next->next = NULL;
990 b->next->chunk = NULL;
991 return b->chunk;
995 * this function deletes all managed blocks of memory
997 static void delete_Blocks(void)
999 Blocks *a, *b = &blocks;
1002 * keep in mind that the first block, pointed to by blocks
1003 * is a static and not dynamically allocated, so we don't
1004 * free it.
1006 while (b) {
1007 if (b->chunk)
1008 nasm_free(b->chunk);
1009 a = b;
1010 b = b->next;
1011 if (a != &blocks)
1012 nasm_free(a);
1017 * this function creates a new Token and passes a pointer to it
1018 * back to the caller. It sets the type and text elements, and
1019 * also the a.mac and next elements to NULL.
1021 static Token *new_Token(Token * next, enum pp_token_type type,
1022 const char *text, int txtlen)
1024 Token *t;
1025 int i;
1027 if (freeTokens == NULL) {
1028 freeTokens = (Token *) new_Block(TOKEN_BLOCKSIZE * sizeof(Token));
1029 for (i = 0; i < TOKEN_BLOCKSIZE - 1; i++)
1030 freeTokens[i].next = &freeTokens[i + 1];
1031 freeTokens[i].next = NULL;
1033 t = freeTokens;
1034 freeTokens = t->next;
1035 t->next = next;
1036 t->a.mac = NULL;
1037 t->type = type;
1038 if (type == TOK_WHITESPACE || text == NULL) {
1039 t->text = NULL;
1040 } else {
1041 if (txtlen == 0)
1042 txtlen = strlen(text);
1043 t->text = nasm_malloc(txtlen+1);
1044 memcpy(t->text, text, txtlen);
1045 t->text[txtlen] = '\0';
1047 return t;
1050 static Token *delete_Token(Token * t)
1052 Token *next = t->next;
1053 nasm_free(t->text);
1054 t->next = freeTokens;
1055 freeTokens = t;
1056 return next;
1060 * Convert a line of tokens back into text.
1061 * If expand_locals is not zero, identifiers of the form "%$*xxx"
1062 * will be transformed into ..@ctxnum.xxx
1064 static char *detoken(Token * tlist, bool expand_locals)
1066 Token *t;
1067 int len;
1068 char *line, *p;
1069 const char *q;
1071 len = 0;
1072 for (t = tlist; t; t = t->next) {
1073 if (t->type == TOK_PREPROC_ID && t->text[1] == '!') {
1074 char *p = getenv(t->text + 2);
1075 nasm_free(t->text);
1076 if (p)
1077 t->text = nasm_strdup(p);
1078 else
1079 t->text = NULL;
1081 /* Expand local macros here and not during preprocessing */
1082 if (expand_locals &&
1083 t->type == TOK_PREPROC_ID && t->text &&
1084 t->text[0] == '%' && t->text[1] == '$') {
1085 Context *ctx = get_ctx(t->text, false);
1086 if (ctx) {
1087 char buffer[40];
1088 char *p, *q = t->text + 2;
1090 q += strspn(q, "$");
1091 snprintf(buffer, sizeof(buffer), "..@%"PRIu32".", ctx->number);
1092 p = nasm_strcat(buffer, q);
1093 nasm_free(t->text);
1094 t->text = p;
1097 if (t->type == TOK_WHITESPACE) {
1098 len++;
1099 } else if (t->text) {
1100 len += strlen(t->text);
1103 p = line = nasm_malloc(len + 1);
1104 for (t = tlist; t; t = t->next) {
1105 if (t->type == TOK_WHITESPACE) {
1106 *p++ = ' ';
1107 } else if (t->text) {
1108 q = t->text;
1109 while (*q)
1110 *p++ = *q++;
1113 *p = '\0';
1114 return line;
1118 * A scanner, suitable for use by the expression evaluator, which
1119 * operates on a line of Tokens. Expects a pointer to a pointer to
1120 * the first token in the line to be passed in as its private_data
1121 * field.
1123 * FIX: This really needs to be unified with stdscan.
1125 static int ppscan(void *private_data, struct tokenval *tokval)
1127 Token **tlineptr = private_data;
1128 Token *tline;
1129 char ourcopy[MAX_KEYWORD+1], *p, *r, *s;
1131 do {
1132 tline = *tlineptr;
1133 *tlineptr = tline ? tline->next : NULL;
1135 while (tline && (tline->type == TOK_WHITESPACE ||
1136 tline->type == TOK_COMMENT));
1138 if (!tline)
1139 return tokval->t_type = TOKEN_EOS;
1141 tokval->t_charptr = tline->text;
1143 if (tline->text[0] == '$' && !tline->text[1])
1144 return tokval->t_type = TOKEN_HERE;
1145 if (tline->text[0] == '$' && tline->text[1] == '$' && !tline->text[2])
1146 return tokval->t_type = TOKEN_BASE;
1148 if (tline->type == TOK_ID) {
1149 p = tokval->t_charptr = tline->text;
1150 if (p[0] == '$') {
1151 tokval->t_charptr++;
1152 return tokval->t_type = TOKEN_ID;
1155 for (r = p, s = ourcopy; *r; r++) {
1156 if (r >= p+MAX_KEYWORD)
1157 return tokval->t_type = TOKEN_ID; /* Not a keyword */
1158 *s++ = nasm_tolower(*r);
1160 *s = '\0';
1161 /* right, so we have an identifier sitting in temp storage. now,
1162 * is it actually a register or instruction name, or what? */
1163 return nasm_token_hash(ourcopy, tokval);
1166 if (tline->type == TOK_NUMBER) {
1167 bool rn_error;
1168 tokval->t_integer = readnum(tline->text, &rn_error);
1169 tokval->t_charptr = tline->text;
1170 if (rn_error)
1171 return tokval->t_type = TOKEN_ERRNUM;
1172 else
1173 return tokval->t_type = TOKEN_NUM;
1176 if (tline->type == TOK_FLOAT) {
1177 return tokval->t_type = TOKEN_FLOAT;
1180 if (tline->type == TOK_STRING) {
1181 char bq, *ep;
1183 bq = tline->text[0];
1184 tokval->t_charptr = tline->text;
1185 tokval->t_inttwo = nasm_unquote(tline->text, &ep);
1187 if (ep[0] != bq || ep[1] != '\0')
1188 return tokval->t_type = TOKEN_ERRSTR;
1189 else
1190 return tokval->t_type = TOKEN_STR;
1193 if (tline->type == TOK_OTHER) {
1194 if (!strcmp(tline->text, "<<"))
1195 return tokval->t_type = TOKEN_SHL;
1196 if (!strcmp(tline->text, ">>"))
1197 return tokval->t_type = TOKEN_SHR;
1198 if (!strcmp(tline->text, "//"))
1199 return tokval->t_type = TOKEN_SDIV;
1200 if (!strcmp(tline->text, "%%"))
1201 return tokval->t_type = TOKEN_SMOD;
1202 if (!strcmp(tline->text, "=="))
1203 return tokval->t_type = TOKEN_EQ;
1204 if (!strcmp(tline->text, "<>"))
1205 return tokval->t_type = TOKEN_NE;
1206 if (!strcmp(tline->text, "!="))
1207 return tokval->t_type = TOKEN_NE;
1208 if (!strcmp(tline->text, "<="))
1209 return tokval->t_type = TOKEN_LE;
1210 if (!strcmp(tline->text, ">="))
1211 return tokval->t_type = TOKEN_GE;
1212 if (!strcmp(tline->text, "&&"))
1213 return tokval->t_type = TOKEN_DBL_AND;
1214 if (!strcmp(tline->text, "^^"))
1215 return tokval->t_type = TOKEN_DBL_XOR;
1216 if (!strcmp(tline->text, "||"))
1217 return tokval->t_type = TOKEN_DBL_OR;
1221 * We have no other options: just return the first character of
1222 * the token text.
1224 return tokval->t_type = tline->text[0];
1228 * Compare a string to the name of an existing macro; this is a
1229 * simple wrapper which calls either strcmp or nasm_stricmp
1230 * depending on the value of the `casesense' parameter.
1232 static int mstrcmp(const char *p, const char *q, bool casesense)
1234 return casesense ? strcmp(p, q) : nasm_stricmp(p, q);
1238 * Compare a string to the name of an existing macro; this is a
1239 * simple wrapper which calls either strcmp or nasm_stricmp
1240 * depending on the value of the `casesense' parameter.
1242 static int mmemcmp(const char *p, const char *q, size_t l, bool casesense)
1244 return casesense ? memcmp(p, q, l) : nasm_memicmp(p, q, l);
1248 * Return the Context structure associated with a %$ token. Return
1249 * NULL, having _already_ reported an error condition, if the
1250 * context stack isn't deep enough for the supplied number of $
1251 * signs.
1252 * If all_contexts == true, contexts that enclose current are
1253 * also scanned for such smacro, until it is found; if not -
1254 * only the context that directly results from the number of $'s
1255 * in variable's name.
1257 static Context *get_ctx(const char *name, bool all_contexts)
1259 Context *ctx;
1260 SMacro *m;
1261 int i;
1263 if (!name || name[0] != '%' || name[1] != '$')
1264 return NULL;
1266 if (!cstk) {
1267 error(ERR_NONFATAL, "`%s': context stack is empty", name);
1268 return NULL;
1271 for (i = strspn(name + 2, "$"), ctx = cstk; (i > 0) && ctx; i--) {
1272 ctx = ctx->next;
1273 /* i--; Lino - 02/25/02 */
1275 if (!ctx) {
1276 error(ERR_NONFATAL, "`%s': context stack is only"
1277 " %d level%s deep", name, i - 1, (i == 2 ? "" : "s"));
1278 return NULL;
1280 if (!all_contexts)
1281 return ctx;
1283 do {
1284 /* Search for this smacro in found context */
1285 m = hash_findix(&ctx->localmac, name);
1286 while (m) {
1287 if (!mstrcmp(m->name, name, m->casesense))
1288 return ctx;
1289 m = m->next;
1291 ctx = ctx->next;
1293 while (ctx);
1294 return NULL;
1298 * Check to see if a file is already in a string list
1300 static bool in_list(const StrList *list, const char *str)
1302 while (list) {
1303 if (!strcmp(list->str, str))
1304 return true;
1305 list = list->next;
1307 return false;
1311 * Open an include file. This routine must always return a valid
1312 * file pointer if it returns - it's responsible for throwing an
1313 * ERR_FATAL and bombing out completely if not. It should also try
1314 * the include path one by one until it finds the file or reaches
1315 * the end of the path.
1317 static FILE *inc_fopen(const char *file, StrList **dhead, StrList ***dtail,
1318 bool missing_ok)
1320 FILE *fp;
1321 char *prefix = "";
1322 IncPath *ip = ipath;
1323 int len = strlen(file);
1324 size_t prefix_len = 0;
1325 StrList *sl;
1327 while (1) {
1328 sl = nasm_malloc(prefix_len+len+1+sizeof sl->next);
1329 memcpy(sl->str, prefix, prefix_len);
1330 memcpy(sl->str+prefix_len, file, len+1);
1331 fp = fopen(sl->str, "r");
1332 if (fp && dhead && !in_list(*dhead, sl->str)) {
1333 sl->next = NULL;
1334 **dtail = sl;
1335 *dtail = &sl->next;
1336 } else {
1337 nasm_free(sl);
1339 if (fp)
1340 return fp;
1341 if (!ip) {
1342 if (!missing_ok)
1343 break;
1344 prefix = NULL;
1345 } else {
1346 prefix = ip->path;
1347 ip = ip->next;
1349 if (prefix) {
1350 prefix_len = strlen(prefix);
1351 } else {
1352 /* -MG given and file not found */
1353 if (dhead && !in_list(*dhead, file)) {
1354 sl = nasm_malloc(len+1+sizeof sl->next);
1355 sl->next = NULL;
1356 strcpy(sl->str, file);
1357 **dtail = sl;
1358 *dtail = &sl->next;
1360 return NULL;
1364 error(ERR_FATAL, "unable to open include file `%s'", file);
1365 return NULL; /* never reached - placate compilers */
1369 * Determine if we should warn on defining a single-line macro of
1370 * name `name', with `nparam' parameters. If nparam is 0 or -1, will
1371 * return true if _any_ single-line macro of that name is defined.
1372 * Otherwise, will return true if a single-line macro with either
1373 * `nparam' or no parameters is defined.
1375 * If a macro with precisely the right number of parameters is
1376 * defined, or nparam is -1, the address of the definition structure
1377 * will be returned in `defn'; otherwise NULL will be returned. If `defn'
1378 * is NULL, no action will be taken regarding its contents, and no
1379 * error will occur.
1381 * Note that this is also called with nparam zero to resolve
1382 * `ifdef'.
1384 * If you already know which context macro belongs to, you can pass
1385 * the context pointer as first parameter; if you won't but name begins
1386 * with %$ the context will be automatically computed. If all_contexts
1387 * is true, macro will be searched in outer contexts as well.
1389 static bool
1390 smacro_defined(Context * ctx, const char *name, int nparam, SMacro ** defn,
1391 bool nocase)
1393 struct hash_table *smtbl;
1394 SMacro *m;
1396 if (ctx) {
1397 smtbl = &ctx->localmac;
1398 } else if (name[0] == '%' && name[1] == '$') {
1399 if (cstk)
1400 ctx = get_ctx(name, false);
1401 if (!ctx)
1402 return false; /* got to return _something_ */
1403 smtbl = &ctx->localmac;
1404 } else {
1405 smtbl = &smacros;
1407 m = (SMacro *) hash_findix(smtbl, name);
1409 while (m) {
1410 if (!mstrcmp(m->name, name, m->casesense && nocase) &&
1411 (nparam <= 0 || m->nparam == 0 || nparam == (int) m->nparam)) {
1412 if (defn) {
1413 if (nparam == (int) m->nparam || nparam == -1)
1414 *defn = m;
1415 else
1416 *defn = NULL;
1418 return true;
1420 m = m->next;
1423 return false;
1427 * Count and mark off the parameters in a multi-line macro call.
1428 * This is called both from within the multi-line macro expansion
1429 * code, and also to mark off the default parameters when provided
1430 * in a %macro definition line.
1432 static void count_mmac_params(Token * t, int *nparam, Token *** params)
1434 int paramsize, brace;
1436 *nparam = paramsize = 0;
1437 *params = NULL;
1438 while (t) {
1439 /* +1: we need space for the final NULL */
1440 if (*nparam+1 >= paramsize) {
1441 paramsize += PARAM_DELTA;
1442 *params = nasm_realloc(*params, sizeof(**params) * paramsize);
1444 skip_white_(t);
1445 brace = false;
1446 if (tok_is_(t, "{"))
1447 brace = true;
1448 (*params)[(*nparam)++] = t;
1449 while (tok_isnt_(t, brace ? "}" : ","))
1450 t = t->next;
1451 if (t) { /* got a comma/brace */
1452 t = t->next;
1453 if (brace) {
1455 * Now we've found the closing brace, look further
1456 * for the comma.
1458 skip_white_(t);
1459 if (tok_isnt_(t, ",")) {
1460 error(ERR_NONFATAL,
1461 "braces do not enclose all of macro parameter");
1462 while (tok_isnt_(t, ","))
1463 t = t->next;
1465 if (t)
1466 t = t->next; /* eat the comma */
1473 * Determine whether one of the various `if' conditions is true or
1474 * not.
1476 * We must free the tline we get passed.
1478 static bool if_condition(Token * tline, enum preproc_token ct)
1480 enum pp_conditional i = PP_COND(ct);
1481 bool j;
1482 Token *t, *tt, **tptr, *origline;
1483 struct tokenval tokval;
1484 expr *evalresult;
1485 enum pp_token_type needtype;
1487 origline = tline;
1489 switch (i) {
1490 case PPC_IFCTX:
1491 j = false; /* have we matched yet? */
1492 while (true) {
1493 skip_white_(tline);
1494 if (!tline)
1495 break;
1496 if (tline->type != TOK_ID) {
1497 error(ERR_NONFATAL,
1498 "`%s' expects context identifiers", pp_directives[ct]);
1499 free_tlist(origline);
1500 return -1;
1502 if (cstk && cstk->name && !nasm_stricmp(tline->text, cstk->name))
1503 j = true;
1504 tline = tline->next;
1506 break;
1508 case PPC_IFDEF:
1509 j = false; /* have we matched yet? */
1510 while (tline) {
1511 skip_white_(tline);
1512 if (!tline || (tline->type != TOK_ID &&
1513 (tline->type != TOK_PREPROC_ID ||
1514 tline->text[1] != '$'))) {
1515 error(ERR_NONFATAL,
1516 "`%s' expects macro identifiers", pp_directives[ct]);
1517 goto fail;
1519 if (smacro_defined(NULL, tline->text, 0, NULL, true))
1520 j = true;
1521 tline = tline->next;
1523 break;
1525 case PPC_IFIDN:
1526 case PPC_IFIDNI:
1527 tline = expand_smacro(tline);
1528 t = tt = tline;
1529 while (tok_isnt_(tt, ","))
1530 tt = tt->next;
1531 if (!tt) {
1532 error(ERR_NONFATAL,
1533 "`%s' expects two comma-separated arguments",
1534 pp_directives[ct]);
1535 goto fail;
1537 tt = tt->next;
1538 j = true; /* assume equality unless proved not */
1539 while ((t->type != TOK_OTHER || strcmp(t->text, ",")) && tt) {
1540 if (tt->type == TOK_OTHER && !strcmp(tt->text, ",")) {
1541 error(ERR_NONFATAL, "`%s': more than one comma on line",
1542 pp_directives[ct]);
1543 goto fail;
1545 if (t->type == TOK_WHITESPACE) {
1546 t = t->next;
1547 continue;
1549 if (tt->type == TOK_WHITESPACE) {
1550 tt = tt->next;
1551 continue;
1553 if (tt->type != t->type) {
1554 j = false; /* found mismatching tokens */
1555 break;
1557 /* When comparing strings, need to unquote them first */
1558 if (t->type == TOK_STRING) {
1559 size_t l1 = nasm_unquote(t->text, NULL);
1560 size_t l2 = nasm_unquote(tt->text, NULL);
1562 if (l1 != l2) {
1563 j = false;
1564 break;
1566 if (mmemcmp(t->text, tt->text, l1, i == PPC_IFIDN)) {
1567 j = false;
1568 break;
1570 } else if (mstrcmp(tt->text, t->text, i == PPC_IFIDN) != 0) {
1571 j = false; /* found mismatching tokens */
1572 break;
1575 t = t->next;
1576 tt = tt->next;
1578 if ((t->type != TOK_OTHER || strcmp(t->text, ",")) || tt)
1579 j = false; /* trailing gunk on one end or other */
1580 break;
1582 case PPC_IFMACRO:
1584 bool found = false;
1585 MMacro searching, *mmac;
1587 tline = tline->next;
1588 skip_white_(tline);
1589 tline = expand_id(tline);
1590 if (!tok_type_(tline, TOK_ID)) {
1591 error(ERR_NONFATAL,
1592 "`%s' expects a macro name", pp_directives[ct]);
1593 goto fail;
1595 searching.name = nasm_strdup(tline->text);
1596 searching.casesense = true;
1597 searching.plus = false;
1598 searching.nolist = false;
1599 searching.in_progress = 0;
1600 searching.rep_nest = NULL;
1601 searching.nparam_min = 0;
1602 searching.nparam_max = INT_MAX;
1603 tline = expand_smacro(tline->next);
1604 skip_white_(tline);
1605 if (!tline) {
1606 } else if (!tok_type_(tline, TOK_NUMBER)) {
1607 error(ERR_NONFATAL,
1608 "`%s' expects a parameter count or nothing",
1609 pp_directives[ct]);
1610 } else {
1611 searching.nparam_min = searching.nparam_max =
1612 readnum(tline->text, &j);
1613 if (j)
1614 error(ERR_NONFATAL,
1615 "unable to parse parameter count `%s'",
1616 tline->text);
1618 if (tline && tok_is_(tline->next, "-")) {
1619 tline = tline->next->next;
1620 if (tok_is_(tline, "*"))
1621 searching.nparam_max = INT_MAX;
1622 else if (!tok_type_(tline, TOK_NUMBER))
1623 error(ERR_NONFATAL,
1624 "`%s' expects a parameter count after `-'",
1625 pp_directives[ct]);
1626 else {
1627 searching.nparam_max = readnum(tline->text, &j);
1628 if (j)
1629 error(ERR_NONFATAL,
1630 "unable to parse parameter count `%s'",
1631 tline->text);
1632 if (searching.nparam_min > searching.nparam_max)
1633 error(ERR_NONFATAL,
1634 "minimum parameter count exceeds maximum");
1637 if (tline && tok_is_(tline->next, "+")) {
1638 tline = tline->next;
1639 searching.plus = true;
1641 mmac = (MMacro *) hash_findix(&mmacros, searching.name);
1642 while (mmac) {
1643 if (!strcmp(mmac->name, searching.name) &&
1644 (mmac->nparam_min <= searching.nparam_max
1645 || searching.plus)
1646 && (searching.nparam_min <= mmac->nparam_max
1647 || mmac->plus)) {
1648 found = true;
1649 break;
1651 mmac = mmac->next;
1653 if(tline && tline->next)
1654 error(ERR_WARNING, "trailing garbage after %%ifmacro ignored");
1655 nasm_free(searching.name);
1656 j = found;
1657 break;
1660 case PPC_IFID:
1661 needtype = TOK_ID;
1662 goto iftype;
1663 case PPC_IFNUM:
1664 needtype = TOK_NUMBER;
1665 goto iftype;
1666 case PPC_IFSTR:
1667 needtype = TOK_STRING;
1668 goto iftype;
1670 iftype:
1671 t = tline = expand_smacro(tline);
1673 while (tok_type_(t, TOK_WHITESPACE) ||
1674 (needtype == TOK_NUMBER &&
1675 tok_type_(t, TOK_OTHER) &&
1676 (t->text[0] == '-' || t->text[0] == '+') &&
1677 !t->text[1]))
1678 t = t->next;
1680 j = tok_type_(t, needtype);
1681 break;
1683 case PPC_IFTOKEN:
1684 t = tline = expand_smacro(tline);
1685 while (tok_type_(t, TOK_WHITESPACE))
1686 t = t->next;
1688 j = false;
1689 if (t) {
1690 t = t->next; /* Skip the actual token */
1691 while (tok_type_(t, TOK_WHITESPACE))
1692 t = t->next;
1693 j = !t; /* Should be nothing left */
1695 break;
1697 case PPC_IFEMPTY:
1698 t = tline = expand_smacro(tline);
1699 while (tok_type_(t, TOK_WHITESPACE))
1700 t = t->next;
1702 j = !t; /* Should be empty */
1703 break;
1705 case PPC_IF:
1706 t = tline = expand_smacro(tline);
1707 tptr = &t;
1708 tokval.t_type = TOKEN_INVALID;
1709 evalresult = evaluate(ppscan, tptr, &tokval,
1710 NULL, pass | CRITICAL, error, NULL);
1711 if (!evalresult)
1712 return -1;
1713 if (tokval.t_type)
1714 error(ERR_WARNING,
1715 "trailing garbage after expression ignored");
1716 if (!is_simple(evalresult)) {
1717 error(ERR_NONFATAL,
1718 "non-constant value given to `%s'", pp_directives[ct]);
1719 goto fail;
1721 j = reloc_value(evalresult) != 0;
1722 break;
1724 default:
1725 error(ERR_FATAL,
1726 "preprocessor directive `%s' not yet implemented",
1727 pp_directives[ct]);
1728 goto fail;
1731 free_tlist(origline);
1732 return j ^ PP_NEGATIVE(ct);
1734 fail:
1735 free_tlist(origline);
1736 return -1;
1740 * Common code for defining an smacro
1742 static bool define_smacro(Context *ctx, char *mname, bool casesense,
1743 int nparam, Token *expansion)
1745 SMacro *smac, **smhead;
1746 struct hash_table *smtbl;
1748 if (smacro_defined(ctx, mname, nparam, &smac, casesense)) {
1749 if (!smac) {
1750 error(ERR_WARNING,
1751 "single-line macro `%s' defined both with and"
1752 " without parameters", mname);
1754 /* Some instances of the old code considered this a failure,
1755 some others didn't. What is the right thing to do here? */
1756 free_tlist(expansion);
1757 return false; /* Failure */
1758 } else {
1760 * We're redefining, so we have to take over an
1761 * existing SMacro structure. This means freeing
1762 * what was already in it.
1764 nasm_free(smac->name);
1765 free_tlist(smac->expansion);
1767 } else {
1768 smtbl = ctx ? &ctx->localmac : &smacros;
1769 smhead = (SMacro **) hash_findi_add(smtbl, mname);
1770 smac = nasm_malloc(sizeof(SMacro));
1771 smac->next = *smhead;
1772 *smhead = smac;
1774 smac->name = nasm_strdup(mname);
1775 smac->casesense = casesense;
1776 smac->nparam = nparam;
1777 smac->expansion = expansion;
1778 smac->in_progress = false;
1779 return true; /* Success */
1783 * Undefine an smacro
1785 static void undef_smacro(Context *ctx, const char *mname)
1787 SMacro **smhead, *s, **sp;
1788 struct hash_table *smtbl;
1790 smtbl = ctx ? &ctx->localmac : &smacros;
1791 smhead = (SMacro **)hash_findi(smtbl, mname, NULL);
1793 if (smhead) {
1795 * We now have a macro name... go hunt for it.
1797 sp = smhead;
1798 while ((s = *sp) != NULL) {
1799 if (!mstrcmp(s->name, mname, s->casesense)) {
1800 *sp = s->next;
1801 nasm_free(s->name);
1802 free_tlist(s->expansion);
1803 nasm_free(s);
1804 } else {
1805 sp = &s->next;
1812 * Parse a mmacro specification.
1814 static bool parse_mmacro_spec(Token *tline, MMacro *def, const char *directive)
1816 bool err;
1818 tline = tline->next;
1819 skip_white_(tline);
1820 tline = expand_id(tline);
1821 if (!tok_type_(tline, TOK_ID)) {
1822 error(ERR_NONFATAL, "`%s' expects a macro name", directive);
1823 return false;
1826 def->name = nasm_strdup(tline->text);
1827 def->plus = false;
1828 def->nolist = false;
1829 def->in_progress = 0;
1830 def->rep_nest = NULL;
1831 def->nparam_min = 0;
1832 def->nparam_max = 0;
1834 tline = expand_smacro(tline->next);
1835 skip_white_(tline);
1836 if (!tok_type_(tline, TOK_NUMBER)) {
1837 error(ERR_NONFATAL, "`%s' expects a parameter count", directive);
1838 } else {
1839 def->nparam_min = def->nparam_max =
1840 readnum(tline->text, &err);
1841 if (err)
1842 error(ERR_NONFATAL,
1843 "unable to parse parameter count `%s'", tline->text);
1845 if (tline && tok_is_(tline->next, "-")) {
1846 tline = tline->next->next;
1847 if (tok_is_(tline, "*")) {
1848 def->nparam_max = INT_MAX;
1849 } else if (!tok_type_(tline, TOK_NUMBER)) {
1850 error(ERR_NONFATAL,
1851 "`%s' expects a parameter count after `-'", directive);
1852 } else {
1853 def->nparam_max = readnum(tline->text, &err);
1854 if (err) {
1855 error(ERR_NONFATAL, "unable to parse parameter count `%s'",
1856 tline->text);
1858 if (def->nparam_min > def->nparam_max) {
1859 error(ERR_NONFATAL, "minimum parameter count exceeds maximum");
1863 if (tline && tok_is_(tline->next, "+")) {
1864 tline = tline->next;
1865 def->plus = true;
1867 if (tline && tok_type_(tline->next, TOK_ID) &&
1868 !nasm_stricmp(tline->next->text, ".nolist")) {
1869 tline = tline->next;
1870 def->nolist = true;
1874 * Handle default parameters.
1876 if (tline && tline->next) {
1877 def->dlist = tline->next;
1878 tline->next = NULL;
1879 count_mmac_params(def->dlist, &def->ndefs, &def->defaults);
1880 } else {
1881 def->dlist = NULL;
1882 def->defaults = NULL;
1884 def->expansion = NULL;
1886 if(def->defaults &&
1887 def->ndefs > def->nparam_max - def->nparam_min &&
1888 !def->plus)
1889 error(ERR_WARNING | ERR_WARN_MDP, "too many default macro parameters");
1891 return true;
1896 * Decode a size directive
1898 static int parse_size(const char *str) {
1899 static const char *size_names[] =
1900 { "byte", "dword", "oword", "qword", "tword", "word", "yword" };
1901 static const int sizes[] =
1902 { 0, 1, 4, 16, 8, 10, 2, 32 };
1904 return sizes[bsii(str, size_names, elements(size_names))+1];
1908 * find and process preprocessor directive in passed line
1909 * Find out if a line contains a preprocessor directive, and deal
1910 * with it if so.
1912 * If a directive _is_ found, it is the responsibility of this routine
1913 * (and not the caller) to free_tlist() the line.
1915 * @param tline a pointer to the current tokeninzed line linked list
1916 * @return DIRECTIVE_FOUND or NO_DIRECTIVE_FOUND
1919 static int do_directive(Token * tline)
1921 enum preproc_token i;
1922 int j;
1923 bool err;
1924 int nparam;
1925 bool nolist;
1926 bool casesense;
1927 int k, m;
1928 int offset;
1929 char *p, *pp, *mname;
1930 Include *inc;
1931 Context *ctx;
1932 Cond *cond;
1933 MMacro *mmac, **mmhead;
1934 Token *t, *tt, *param_start, *macro_start, *last, **tptr, *origline;
1935 Line *l;
1936 struct tokenval tokval;
1937 expr *evalresult;
1938 MMacro *tmp_defining; /* Used when manipulating rep_nest */
1939 int64_t count;
1940 size_t len;
1942 origline = tline;
1944 skip_white_(tline);
1945 if (!tline || !tok_type_(tline, TOK_PREPROC_ID) ||
1946 (tline->text[1] == '%' || tline->text[1] == '$'
1947 || tline->text[1] == '!'))
1948 return NO_DIRECTIVE_FOUND;
1950 i = pp_token_hash(tline->text);
1953 * If we're in a non-emitting branch of a condition construct,
1954 * or walking to the end of an already terminated %rep block,
1955 * we should ignore all directives except for condition
1956 * directives.
1958 if (((istk->conds && !emitting(istk->conds->state)) ||
1959 (istk->mstk && !istk->mstk->in_progress)) && !is_condition(i)) {
1960 return NO_DIRECTIVE_FOUND;
1964 * If we're defining a macro or reading a %rep block, we should
1965 * ignore all directives except for %macro/%imacro (which nest),
1966 * %endm/%endmacro, and (only if we're in a %rep block) %endrep.
1967 * If we're in a %rep block, another %rep nests, so should be let through.
1969 if (defining && i != PP_MACRO && i != PP_IMACRO &&
1970 i != PP_ENDMACRO && i != PP_ENDM &&
1971 (defining->name || (i != PP_ENDREP && i != PP_REP))) {
1972 return NO_DIRECTIVE_FOUND;
1975 if (defining) {
1976 if (i == PP_MACRO || i == PP_IMACRO) {
1977 nested_mac_count++;
1978 return NO_DIRECTIVE_FOUND;
1979 } else if (nested_mac_count > 0) {
1980 if (i == PP_ENDMACRO) {
1981 nested_mac_count--;
1982 return NO_DIRECTIVE_FOUND;
1985 if (!defining->name) {
1986 if (i == PP_REP) {
1987 nested_rep_count++;
1988 return NO_DIRECTIVE_FOUND;
1989 } else if (nested_rep_count > 0) {
1990 if (i == PP_ENDREP) {
1991 nested_rep_count--;
1992 return NO_DIRECTIVE_FOUND;
1998 switch (i) {
1999 case PP_INVALID:
2000 error(ERR_NONFATAL, "unknown preprocessor directive `%s'",
2001 tline->text);
2002 return NO_DIRECTIVE_FOUND; /* didn't get it */
2004 case PP_STACKSIZE:
2005 /* Directive to tell NASM what the default stack size is. The
2006 * default is for a 16-bit stack, and this can be overriden with
2007 * %stacksize large.
2008 * the following form:
2010 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
2012 tline = tline->next;
2013 if (tline && tline->type == TOK_WHITESPACE)
2014 tline = tline->next;
2015 if (!tline || tline->type != TOK_ID) {
2016 error(ERR_NONFATAL, "`%%stacksize' missing size parameter");
2017 free_tlist(origline);
2018 return DIRECTIVE_FOUND;
2020 if (nasm_stricmp(tline->text, "flat") == 0) {
2021 /* All subsequent ARG directives are for a 32-bit stack */
2022 StackSize = 4;
2023 StackPointer = "ebp";
2024 ArgOffset = 8;
2025 LocalOffset = 0;
2026 } else if (nasm_stricmp(tline->text, "flat64") == 0) {
2027 /* All subsequent ARG directives are for a 64-bit stack */
2028 StackSize = 8;
2029 StackPointer = "rbp";
2030 ArgOffset = 8;
2031 LocalOffset = 0;
2032 } else if (nasm_stricmp(tline->text, "large") == 0) {
2033 /* All subsequent ARG directives are for a 16-bit stack,
2034 * far function call.
2036 StackSize = 2;
2037 StackPointer = "bp";
2038 ArgOffset = 4;
2039 LocalOffset = 0;
2040 } else if (nasm_stricmp(tline->text, "small") == 0) {
2041 /* All subsequent ARG directives are for a 16-bit stack,
2042 * far function call. We don't support near functions.
2044 StackSize = 2;
2045 StackPointer = "bp";
2046 ArgOffset = 6;
2047 LocalOffset = 0;
2048 } else {
2049 error(ERR_NONFATAL, "`%%stacksize' invalid size type");
2050 free_tlist(origline);
2051 return DIRECTIVE_FOUND;
2053 free_tlist(origline);
2054 return DIRECTIVE_FOUND;
2056 case PP_ARG:
2057 /* TASM like ARG directive to define arguments to functions, in
2058 * the following form:
2060 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
2062 offset = ArgOffset;
2063 do {
2064 char *arg, directive[256];
2065 int size = StackSize;
2067 /* Find the argument name */
2068 tline = tline->next;
2069 if (tline && tline->type == TOK_WHITESPACE)
2070 tline = tline->next;
2071 if (!tline || tline->type != TOK_ID) {
2072 error(ERR_NONFATAL, "`%%arg' missing argument parameter");
2073 free_tlist(origline);
2074 return DIRECTIVE_FOUND;
2076 arg = tline->text;
2078 /* Find the argument size type */
2079 tline = tline->next;
2080 if (!tline || tline->type != TOK_OTHER
2081 || tline->text[0] != ':') {
2082 error(ERR_NONFATAL,
2083 "Syntax error processing `%%arg' directive");
2084 free_tlist(origline);
2085 return DIRECTIVE_FOUND;
2087 tline = tline->next;
2088 if (!tline || tline->type != TOK_ID) {
2089 error(ERR_NONFATAL, "`%%arg' missing size type parameter");
2090 free_tlist(origline);
2091 return DIRECTIVE_FOUND;
2094 /* Allow macro expansion of type parameter */
2095 tt = tokenize(tline->text);
2096 tt = expand_smacro(tt);
2097 size = parse_size(tt->text);
2098 if (!size) {
2099 error(ERR_NONFATAL,
2100 "Invalid size type for `%%arg' missing directive");
2101 free_tlist(tt);
2102 free_tlist(origline);
2103 return DIRECTIVE_FOUND;
2105 free_tlist(tt);
2107 /* Round up to even stack slots */
2108 size = (size+StackSize-1) & ~(StackSize-1);
2110 /* Now define the macro for the argument */
2111 snprintf(directive, sizeof(directive), "%%define %s (%s+%d)",
2112 arg, StackPointer, offset);
2113 do_directive(tokenize(directive));
2114 offset += size;
2116 /* Move to the next argument in the list */
2117 tline = tline->next;
2118 if (tline && tline->type == TOK_WHITESPACE)
2119 tline = tline->next;
2120 } while (tline && tline->type == TOK_OTHER && tline->text[0] == ',');
2121 ArgOffset = offset;
2122 free_tlist(origline);
2123 return DIRECTIVE_FOUND;
2125 case PP_LOCAL:
2126 /* TASM like LOCAL directive to define local variables for a
2127 * function, in the following form:
2129 * LOCAL local1:WORD, local2:DWORD, local4:QWORD = LocalSize
2131 * The '= LocalSize' at the end is ignored by NASM, but is
2132 * required by TASM to define the local parameter size (and used
2133 * by the TASM macro package).
2135 offset = LocalOffset;
2136 do {
2137 char *local, directive[256];
2138 int size = StackSize;
2140 /* Find the argument name */
2141 tline = tline->next;
2142 if (tline && tline->type == TOK_WHITESPACE)
2143 tline = tline->next;
2144 if (!tline || tline->type != TOK_ID) {
2145 error(ERR_NONFATAL,
2146 "`%%local' missing argument parameter");
2147 free_tlist(origline);
2148 return DIRECTIVE_FOUND;
2150 local = tline->text;
2152 /* Find the argument size type */
2153 tline = tline->next;
2154 if (!tline || tline->type != TOK_OTHER
2155 || tline->text[0] != ':') {
2156 error(ERR_NONFATAL,
2157 "Syntax error processing `%%local' directive");
2158 free_tlist(origline);
2159 return DIRECTIVE_FOUND;
2161 tline = tline->next;
2162 if (!tline || tline->type != TOK_ID) {
2163 error(ERR_NONFATAL,
2164 "`%%local' missing size type parameter");
2165 free_tlist(origline);
2166 return DIRECTIVE_FOUND;
2169 /* Allow macro expansion of type parameter */
2170 tt = tokenize(tline->text);
2171 tt = expand_smacro(tt);
2172 size = parse_size(tt->text);
2173 if (!size) {
2174 error(ERR_NONFATAL,
2175 "Invalid size type for `%%local' missing directive");
2176 free_tlist(tt);
2177 free_tlist(origline);
2178 return DIRECTIVE_FOUND;
2180 free_tlist(tt);
2182 /* Round up to even stack slots */
2183 size = (size+StackSize-1) & ~(StackSize-1);
2185 offset += size; /* Negative offset, increment before */
2187 /* Now define the macro for the argument */
2188 snprintf(directive, sizeof(directive), "%%define %s (%s-%d)",
2189 local, StackPointer, offset);
2190 do_directive(tokenize(directive));
2192 /* Now define the assign to setup the enter_c macro correctly */
2193 snprintf(directive, sizeof(directive),
2194 "%%assign %%$localsize %%$localsize+%d", size);
2195 do_directive(tokenize(directive));
2197 /* Move to the next argument in the list */
2198 tline = tline->next;
2199 if (tline && tline->type == TOK_WHITESPACE)
2200 tline = tline->next;
2201 } while (tline && tline->type == TOK_OTHER && tline->text[0] == ',');
2202 LocalOffset = offset;
2203 free_tlist(origline);
2204 return DIRECTIVE_FOUND;
2206 case PP_CLEAR:
2207 if (tline->next)
2208 error(ERR_WARNING, "trailing garbage after `%%clear' ignored");
2209 free_macros();
2210 init_macros();
2211 free_tlist(origline);
2212 return DIRECTIVE_FOUND;
2214 case PP_DEPEND:
2215 t = tline->next = expand_smacro(tline->next);
2216 skip_white_(t);
2217 if (!t || (t->type != TOK_STRING &&
2218 t->type != TOK_INTERNAL_STRING)) {
2219 error(ERR_NONFATAL, "`%%depend' expects a file name");
2220 free_tlist(origline);
2221 return DIRECTIVE_FOUND; /* but we did _something_ */
2223 if (t->next)
2224 error(ERR_WARNING,
2225 "trailing garbage after `%%depend' ignored");
2226 p = t->text;
2227 if (t->type != TOK_INTERNAL_STRING)
2228 nasm_unquote(p, NULL);
2229 if (dephead && !in_list(*dephead, p)) {
2230 StrList *sl = nasm_malloc(strlen(p)+1+sizeof sl->next);
2231 sl->next = NULL;
2232 strcpy(sl->str, p);
2233 *deptail = sl;
2234 deptail = &sl->next;
2236 free_tlist(origline);
2237 return DIRECTIVE_FOUND;
2239 case PP_INCLUDE:
2240 t = tline->next = expand_smacro(tline->next);
2241 skip_white_(t);
2243 if (!t || (t->type != TOK_STRING &&
2244 t->type != TOK_INTERNAL_STRING)) {
2245 error(ERR_NONFATAL, "`%%include' expects a file name");
2246 free_tlist(origline);
2247 return DIRECTIVE_FOUND; /* but we did _something_ */
2249 if (t->next)
2250 error(ERR_WARNING,
2251 "trailing garbage after `%%include' ignored");
2252 p = t->text;
2253 if (t->type != TOK_INTERNAL_STRING)
2254 nasm_unquote(p, NULL);
2255 inc = nasm_malloc(sizeof(Include));
2256 inc->next = istk;
2257 inc->conds = NULL;
2258 inc->fp = inc_fopen(p, dephead, &deptail, pass == 0);
2259 if (!inc->fp) {
2260 /* -MG given but file not found */
2261 nasm_free(inc);
2262 } else {
2263 inc->fname = src_set_fname(nasm_strdup(p));
2264 inc->lineno = src_set_linnum(0);
2265 inc->lineinc = 1;
2266 inc->expansion = NULL;
2267 inc->mstk = NULL;
2268 istk = inc;
2269 list->uplevel(LIST_INCLUDE);
2271 free_tlist(origline);
2272 return DIRECTIVE_FOUND;
2274 case PP_USE:
2276 static macros_t *use_pkg;
2277 const char *pkg_macro;
2279 t = tline->next = expand_smacro(tline->next);
2280 skip_white_(t);
2282 if (!t || (t->type != TOK_STRING &&
2283 t->type != TOK_INTERNAL_STRING &&
2284 t->type != TOK_ID)) {
2285 error(ERR_NONFATAL, "`%%use' expects a package name");
2286 free_tlist(origline);
2287 return DIRECTIVE_FOUND; /* but we did _something_ */
2289 if (t->next)
2290 error(ERR_WARNING,
2291 "trailing garbage after `%%use' ignored");
2292 if (t->type == TOK_STRING)
2293 nasm_unquote(t->text, NULL);
2294 use_pkg = nasm_stdmac_find_package(t->text);
2295 if (!use_pkg)
2296 error(ERR_NONFATAL, "unknown `%%use' package: %s", t->text);
2297 /* The first string will be <%define>__USE_*__ */
2298 pkg_macro = (char *)use_pkg + 1;
2299 if (!smacro_defined(NULL, pkg_macro, 0, NULL, true)) {
2300 /* Not already included, go ahead and include it */
2301 stdmacpos = use_pkg;
2303 free_tlist(origline);
2304 return DIRECTIVE_FOUND;
2306 case PP_PUSH:
2307 tline = tline->next;
2308 skip_white_(tline);
2309 tline = expand_id(tline);
2310 if (tline) {
2311 if (!tok_type_(tline, TOK_ID)) {
2312 error(ERR_NONFATAL, "`%%push' expects a context identifier");
2313 free_tlist(origline);
2314 return DIRECTIVE_FOUND; /* but we did _something_ */
2316 if (tline->next)
2317 error(ERR_WARNING, "trailing garbage after `%%push' ignored");
2318 p = nasm_strdup(tline->text);
2319 } else {
2320 p = NULL; /* Anonymous context */
2322 ctx = nasm_malloc(sizeof(Context));
2323 ctx->next = cstk;
2324 hash_init(&ctx->localmac, HASH_SMALL);
2325 ctx->name = p;
2326 ctx->number = unique++;
2327 cstk = ctx;
2328 free_tlist(origline);
2329 return DIRECTIVE_FOUND;
2331 case PP_REPL:
2332 tline = tline->next;
2333 skip_white_(tline);
2334 tline = expand_id(tline);
2335 if (tline) {
2336 if (!tok_type_(tline, TOK_ID)) {
2337 error(ERR_NONFATAL, "`%%repl' expects a context identifier");
2338 free_tlist(origline);
2339 return DIRECTIVE_FOUND; /* but we did _something_ */
2341 if (tline->next)
2342 error(ERR_WARNING, "trailing garbage after `%%repl' ignored");
2343 p = nasm_strdup(tline->text);
2344 } else {
2345 p = NULL;
2347 if (!cstk)
2348 error(ERR_NONFATAL, "`%%repl': context stack is empty");
2349 else {
2350 nasm_free(cstk->name);
2351 cstk->name = p;
2353 free_tlist(origline);
2354 return DIRECTIVE_FOUND;
2356 case PP_POP:
2357 if (tline->next)
2358 error(ERR_WARNING, "trailing garbage after `%%pop' ignored");
2359 if (!cstk)
2360 error(ERR_NONFATAL, "`%%pop': context stack is already empty");
2361 else
2362 ctx_pop();
2363 free_tlist(origline);
2364 return DIRECTIVE_FOUND;
2366 case PP_ERROR:
2367 case PP_WARNING:
2369 int severity = (i == PP_ERROR)
2370 ? ERR_NONFATAL|ERR_NO_SEVERITY
2371 : ERR_WARNING|ERR_NO_SEVERITY;
2373 tline->next = expand_smacro(tline->next);
2374 tline = tline->next;
2375 skip_white_(tline);
2376 t = tline ? tline->next : NULL;
2377 skip_white_(t);
2378 if (tok_type_(tline, TOK_STRING) && !t) {
2379 /* The line contains only a quoted string */
2380 p = tline->text;
2381 nasm_unquote(p, NULL);
2382 error(severity, "%s: %s", pp_directives[i], p);
2383 } else {
2384 /* Not a quoted string, or more than a quoted string */
2385 p = detoken(tline, false);
2386 error(severity, "%s: %s", pp_directives[i], p);
2387 nasm_free(p);
2389 free_tlist(origline);
2390 return DIRECTIVE_FOUND;
2393 CASE_PP_IF:
2394 if (istk->conds && !emitting(istk->conds->state))
2395 j = COND_NEVER;
2396 else {
2397 j = if_condition(tline->next, i);
2398 tline->next = NULL; /* it got freed */
2399 j = j < 0 ? COND_NEVER : j ? COND_IF_TRUE : COND_IF_FALSE;
2401 cond = nasm_malloc(sizeof(Cond));
2402 cond->next = istk->conds;
2403 cond->state = j;
2404 istk->conds = cond;
2405 free_tlist(origline);
2406 return DIRECTIVE_FOUND;
2408 CASE_PP_ELIF:
2409 if (!istk->conds)
2410 error(ERR_FATAL, "`%s': no matching `%%if'", pp_directives[i]);
2411 switch(istk->conds->state) {
2412 case COND_IF_TRUE:
2413 istk->conds->state = COND_DONE;
2414 break;
2416 case COND_DONE:
2417 case COND_NEVER:
2418 break;
2420 case COND_ELSE_TRUE:
2421 case COND_ELSE_FALSE:
2422 error_precond(ERR_WARNING, "`%%elif' after `%%else' ignored");
2423 istk->conds->state = COND_NEVER;
2424 break;
2426 case COND_IF_FALSE:
2428 * IMPORTANT: In the case of %if, we will already have
2429 * called expand_mmac_params(); however, if we're
2430 * processing an %elif we must have been in a
2431 * non-emitting mode, which would have inhibited
2432 * the normal invocation of expand_mmac_params(). Therefore,
2433 * we have to do it explicitly here.
2435 j = if_condition(expand_mmac_params(tline->next), i);
2436 tline->next = NULL; /* it got freed */
2437 istk->conds->state =
2438 j < 0 ? COND_NEVER : j ? COND_IF_TRUE : COND_IF_FALSE;
2439 break;
2441 free_tlist(origline);
2442 return DIRECTIVE_FOUND;
2444 case PP_ELSE:
2445 if (tline->next)
2446 error_precond(ERR_WARNING, "trailing garbage after `%%else' ignored");
2447 if (!istk->conds)
2448 error(ERR_FATAL, "`%%else': no matching `%%if'");
2449 switch(istk->conds->state) {
2450 case COND_IF_TRUE:
2451 case COND_DONE:
2452 istk->conds->state = COND_ELSE_FALSE;
2453 break;
2455 case COND_NEVER:
2456 break;
2458 case COND_IF_FALSE:
2459 istk->conds->state = COND_ELSE_TRUE;
2460 break;
2462 case COND_ELSE_TRUE:
2463 case COND_ELSE_FALSE:
2464 error_precond(ERR_WARNING, "`%%else' after `%%else' ignored.");
2465 istk->conds->state = COND_NEVER;
2466 break;
2468 free_tlist(origline);
2469 return DIRECTIVE_FOUND;
2471 case PP_ENDIF:
2472 if (tline->next)
2473 error_precond(ERR_WARNING, "trailing garbage after `%%endif' ignored");
2474 if (!istk->conds)
2475 error(ERR_FATAL, "`%%endif': no matching `%%if'");
2476 cond = istk->conds;
2477 istk->conds = cond->next;
2478 nasm_free(cond);
2479 free_tlist(origline);
2480 return DIRECTIVE_FOUND;
2482 case PP_MACRO:
2483 case PP_IMACRO:
2484 if (defining) {
2485 error(ERR_FATAL,
2486 "`%%%smacro': already defining a macro",
2487 (i == PP_IMACRO ? "i" : ""));
2488 return DIRECTIVE_FOUND;
2490 defining = nasm_malloc(sizeof(MMacro));
2491 defining->casesense = (i == PP_MACRO);
2492 if (!parse_mmacro_spec(tline, defining, pp_directives[i])) {
2493 nasm_free(defining);
2494 defining = NULL;
2495 return DIRECTIVE_FOUND;
2498 mmac = (MMacro *) hash_findix(&mmacros, defining->name);
2499 while (mmac) {
2500 if (!strcmp(mmac->name, defining->name) &&
2501 (mmac->nparam_min <= defining->nparam_max
2502 || defining->plus)
2503 && (defining->nparam_min <= mmac->nparam_max
2504 || mmac->plus)) {
2505 error(ERR_WARNING,
2506 "redefining multi-line macro `%s'", defining->name);
2507 return DIRECTIVE_FOUND;
2509 mmac = mmac->next;
2511 free_tlist(origline);
2512 return DIRECTIVE_FOUND;
2514 case PP_ENDM:
2515 case PP_ENDMACRO:
2516 if (! (defining && defining->name)) {
2517 error(ERR_NONFATAL, "`%s': not defining a macro", tline->text);
2518 return DIRECTIVE_FOUND;
2520 mmhead = (MMacro **) hash_findi_add(&mmacros, defining->name);
2521 defining->next = *mmhead;
2522 *mmhead = defining;
2523 defining = NULL;
2524 free_tlist(origline);
2525 return DIRECTIVE_FOUND;
2527 case PP_UNMACRO:
2528 case PP_UNIMACRO:
2530 MMacro **mmac_p;
2531 MMacro spec;
2533 spec.casesense = (i == PP_UNMACRO);
2534 if (!parse_mmacro_spec(tline, &spec, pp_directives[i])) {
2535 return DIRECTIVE_FOUND;
2537 mmac_p = (MMacro **) hash_findi(&mmacros, spec.name, NULL);
2538 while (mmac_p && *mmac_p) {
2539 mmac = *mmac_p;
2540 if (mmac->casesense == spec.casesense &&
2541 !mstrcmp(mmac->name, spec.name, spec.casesense) &&
2542 mmac->nparam_min == spec.nparam_min &&
2543 mmac->nparam_max == spec.nparam_max &&
2544 mmac->plus == spec.plus) {
2545 *mmac_p = mmac->next;
2546 free_mmacro(mmac);
2547 } else {
2548 mmac_p = &mmac->next;
2551 free_tlist(origline);
2552 free_tlist(spec.dlist);
2553 return DIRECTIVE_FOUND;
2556 case PP_ROTATE:
2557 if (tline->next && tline->next->type == TOK_WHITESPACE)
2558 tline = tline->next;
2559 if (tline->next == NULL) {
2560 free_tlist(origline);
2561 error(ERR_NONFATAL, "`%%rotate' missing rotate count");
2562 return DIRECTIVE_FOUND;
2564 t = expand_smacro(tline->next);
2565 tline->next = NULL;
2566 free_tlist(origline);
2567 tline = t;
2568 tptr = &t;
2569 tokval.t_type = TOKEN_INVALID;
2570 evalresult =
2571 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
2572 free_tlist(tline);
2573 if (!evalresult)
2574 return DIRECTIVE_FOUND;
2575 if (tokval.t_type)
2576 error(ERR_WARNING,
2577 "trailing garbage after expression ignored");
2578 if (!is_simple(evalresult)) {
2579 error(ERR_NONFATAL, "non-constant value given to `%%rotate'");
2580 return DIRECTIVE_FOUND;
2582 mmac = istk->mstk;
2583 while (mmac && !mmac->name) /* avoid mistaking %reps for macros */
2584 mmac = mmac->next_active;
2585 if (!mmac) {
2586 error(ERR_NONFATAL, "`%%rotate' invoked outside a macro call");
2587 } else if (mmac->nparam == 0) {
2588 error(ERR_NONFATAL,
2589 "`%%rotate' invoked within macro without parameters");
2590 } else {
2591 int rotate = mmac->rotate + reloc_value(evalresult);
2593 rotate %= (int)mmac->nparam;
2594 if (rotate < 0)
2595 rotate += mmac->nparam;
2597 mmac->rotate = rotate;
2599 return DIRECTIVE_FOUND;
2601 case PP_REP:
2602 nolist = false;
2603 do {
2604 tline = tline->next;
2605 } while (tok_type_(tline, TOK_WHITESPACE));
2607 if (tok_type_(tline, TOK_ID) &&
2608 nasm_stricmp(tline->text, ".nolist") == 0) {
2609 nolist = true;
2610 do {
2611 tline = tline->next;
2612 } while (tok_type_(tline, TOK_WHITESPACE));
2615 if (tline) {
2616 t = expand_smacro(tline);
2617 tptr = &t;
2618 tokval.t_type = TOKEN_INVALID;
2619 evalresult =
2620 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
2621 if (!evalresult) {
2622 free_tlist(origline);
2623 return DIRECTIVE_FOUND;
2625 if (tokval.t_type)
2626 error(ERR_WARNING,
2627 "trailing garbage after expression ignored");
2628 if (!is_simple(evalresult)) {
2629 error(ERR_NONFATAL, "non-constant value given to `%%rep'");
2630 return DIRECTIVE_FOUND;
2632 count = reloc_value(evalresult) + 1;
2633 } else {
2634 error(ERR_NONFATAL, "`%%rep' expects a repeat count");
2635 count = 0;
2637 free_tlist(origline);
2639 tmp_defining = defining;
2640 defining = nasm_malloc(sizeof(MMacro));
2641 defining->name = NULL; /* flags this macro as a %rep block */
2642 defining->casesense = false;
2643 defining->plus = false;
2644 defining->nolist = nolist;
2645 defining->in_progress = count;
2646 defining->nparam_min = defining->nparam_max = 0;
2647 defining->defaults = NULL;
2648 defining->dlist = NULL;
2649 defining->expansion = NULL;
2650 defining->next_active = istk->mstk;
2651 defining->rep_nest = tmp_defining;
2652 return DIRECTIVE_FOUND;
2654 case PP_ENDREP:
2655 if (!defining || defining->name) {
2656 error(ERR_NONFATAL, "`%%endrep': no matching `%%rep'");
2657 return DIRECTIVE_FOUND;
2661 * Now we have a "macro" defined - although it has no name
2662 * and we won't be entering it in the hash tables - we must
2663 * push a macro-end marker for it on to istk->expansion.
2664 * After that, it will take care of propagating itself (a
2665 * macro-end marker line for a macro which is really a %rep
2666 * block will cause the macro to be re-expanded, complete
2667 * with another macro-end marker to ensure the process
2668 * continues) until the whole expansion is forcibly removed
2669 * from istk->expansion by a %exitrep.
2671 l = nasm_malloc(sizeof(Line));
2672 l->next = istk->expansion;
2673 l->finishes = defining;
2674 l->first = NULL;
2675 istk->expansion = l;
2677 istk->mstk = defining;
2679 list->uplevel(defining->nolist ? LIST_MACRO_NOLIST : LIST_MACRO);
2680 tmp_defining = defining;
2681 defining = defining->rep_nest;
2682 free_tlist(origline);
2683 return DIRECTIVE_FOUND;
2685 case PP_EXITREP:
2687 * We must search along istk->expansion until we hit a
2688 * macro-end marker for a macro with no name. Then we set
2689 * its `in_progress' flag to 0.
2691 for (l = istk->expansion; l; l = l->next)
2692 if (l->finishes && !l->finishes->name)
2693 break;
2695 if (l)
2696 l->finishes->in_progress = 1;
2697 else
2698 error(ERR_NONFATAL, "`%%exitrep' not within `%%rep' block");
2699 free_tlist(origline);
2700 return DIRECTIVE_FOUND;
2702 case PP_XDEFINE:
2703 case PP_IXDEFINE:
2704 case PP_DEFINE:
2705 case PP_IDEFINE:
2706 casesense = (i == PP_DEFINE || i == PP_XDEFINE);
2708 tline = tline->next;
2709 skip_white_(tline);
2710 tline = expand_id(tline);
2711 if (!tline || (tline->type != TOK_ID &&
2712 (tline->type != TOK_PREPROC_ID ||
2713 tline->text[1] != '$'))) {
2714 error(ERR_NONFATAL, "`%s' expects a macro identifier",
2715 pp_directives[i]);
2716 free_tlist(origline);
2717 return DIRECTIVE_FOUND;
2720 ctx = get_ctx(tline->text, false);
2722 mname = tline->text;
2723 last = tline;
2724 param_start = tline = tline->next;
2725 nparam = 0;
2727 /* Expand the macro definition now for %xdefine and %ixdefine */
2728 if ((i == PP_XDEFINE) || (i == PP_IXDEFINE))
2729 tline = expand_smacro(tline);
2731 if (tok_is_(tline, "(")) {
2733 * This macro has parameters.
2736 tline = tline->next;
2737 while (1) {
2738 skip_white_(tline);
2739 if (!tline) {
2740 error(ERR_NONFATAL, "parameter identifier expected");
2741 free_tlist(origline);
2742 return DIRECTIVE_FOUND;
2744 if (tline->type != TOK_ID) {
2745 error(ERR_NONFATAL,
2746 "`%s': parameter identifier expected",
2747 tline->text);
2748 free_tlist(origline);
2749 return DIRECTIVE_FOUND;
2751 tline->type = TOK_SMAC_PARAM + nparam++;
2752 tline = tline->next;
2753 skip_white_(tline);
2754 if (tok_is_(tline, ",")) {
2755 tline = tline->next;
2756 } else {
2757 if (!tok_is_(tline, ")")) {
2758 error(ERR_NONFATAL,
2759 "`)' expected to terminate macro template");
2760 free_tlist(origline);
2761 return DIRECTIVE_FOUND;
2763 break;
2766 last = tline;
2767 tline = tline->next;
2769 if (tok_type_(tline, TOK_WHITESPACE))
2770 last = tline, tline = tline->next;
2771 macro_start = NULL;
2772 last->next = NULL;
2773 t = tline;
2774 while (t) {
2775 if (t->type == TOK_ID) {
2776 for (tt = param_start; tt; tt = tt->next)
2777 if (tt->type >= TOK_SMAC_PARAM &&
2778 !strcmp(tt->text, t->text))
2779 t->type = tt->type;
2781 tt = t->next;
2782 t->next = macro_start;
2783 macro_start = t;
2784 t = tt;
2787 * Good. We now have a macro name, a parameter count, and a
2788 * token list (in reverse order) for an expansion. We ought
2789 * to be OK just to create an SMacro, store it, and let
2790 * free_tlist have the rest of the line (which we have
2791 * carefully re-terminated after chopping off the expansion
2792 * from the end).
2794 define_smacro(ctx, mname, casesense, nparam, macro_start);
2795 free_tlist(origline);
2796 return DIRECTIVE_FOUND;
2798 case PP_UNDEF:
2799 tline = tline->next;
2800 skip_white_(tline);
2801 tline = expand_id(tline);
2802 if (!tline || (tline->type != TOK_ID &&
2803 (tline->type != TOK_PREPROC_ID ||
2804 tline->text[1] != '$'))) {
2805 error(ERR_NONFATAL, "`%%undef' expects a macro identifier");
2806 free_tlist(origline);
2807 return DIRECTIVE_FOUND;
2809 if (tline->next) {
2810 error(ERR_WARNING,
2811 "trailing garbage after macro name ignored");
2814 /* Find the context that symbol belongs to */
2815 ctx = get_ctx(tline->text, false);
2816 undef_smacro(ctx, tline->text);
2817 free_tlist(origline);
2818 return DIRECTIVE_FOUND;
2820 case PP_DEFSTR:
2821 case PP_IDEFSTR:
2822 casesense = (i == PP_DEFSTR);
2824 tline = tline->next;
2825 skip_white_(tline);
2826 tline = expand_id(tline);
2827 if (!tline || (tline->type != TOK_ID &&
2828 (tline->type != TOK_PREPROC_ID ||
2829 tline->text[1] != '$'))) {
2830 error(ERR_NONFATAL, "`%s' expects a macro identifier",
2831 pp_directives[i]);
2832 free_tlist(origline);
2833 return DIRECTIVE_FOUND;
2836 ctx = get_ctx(tline->text, false);
2838 mname = tline->text;
2839 last = tline;
2840 tline = expand_smacro(tline->next);
2841 last->next = NULL;
2843 while (tok_type_(tline, TOK_WHITESPACE))
2844 tline = delete_Token(tline);
2846 p = detoken(tline, false);
2847 macro_start = nasm_malloc(sizeof(*macro_start));
2848 macro_start->next = NULL;
2849 macro_start->text = nasm_quote(p, strlen(p));
2850 macro_start->type = TOK_STRING;
2851 macro_start->a.mac = NULL;
2852 nasm_free(p);
2855 * We now have a macro name, an implicit parameter count of
2856 * zero, and a string token to use as an expansion. Create
2857 * and store an SMacro.
2859 define_smacro(ctx, mname, casesense, 0, macro_start);
2860 free_tlist(origline);
2861 return DIRECTIVE_FOUND;
2863 case PP_PATHSEARCH:
2865 FILE *fp;
2866 StrList *xsl = NULL;
2867 StrList **xst = &xsl;
2869 casesense = true;
2871 tline = tline->next;
2872 skip_white_(tline);
2873 tline = expand_id(tline);
2874 if (!tline || (tline->type != TOK_ID &&
2875 (tline->type != TOK_PREPROC_ID ||
2876 tline->text[1] != '$'))) {
2877 error(ERR_NONFATAL,
2878 "`%%pathsearch' expects a macro identifier as first parameter");
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 while (tok_type_(t, TOK_WHITESPACE))
2891 t = t->next;
2893 if (!t || (t->type != TOK_STRING &&
2894 t->type != TOK_INTERNAL_STRING)) {
2895 error(ERR_NONFATAL, "`%%pathsearch' expects a file name");
2896 free_tlist(tline);
2897 free_tlist(origline);
2898 return DIRECTIVE_FOUND; /* but we did _something_ */
2900 if (t->next)
2901 error(ERR_WARNING,
2902 "trailing garbage after `%%pathsearch' ignored");
2903 p = t->text;
2904 if (t->type != TOK_INTERNAL_STRING)
2905 nasm_unquote(p, NULL);
2907 fp = inc_fopen(p, &xsl, &xst, true);
2908 if (fp) {
2909 p = xsl->str;
2910 fclose(fp); /* Don't actually care about the file */
2912 macro_start = nasm_malloc(sizeof(*macro_start));
2913 macro_start->next = NULL;
2914 macro_start->text = nasm_quote(p, strlen(p));
2915 macro_start->type = TOK_STRING;
2916 macro_start->a.mac = NULL;
2917 if (xsl)
2918 nasm_free(xsl);
2921 * We now have a macro name, an implicit parameter count of
2922 * zero, and a string token to use as an expansion. Create
2923 * and store an SMacro.
2925 define_smacro(ctx, mname, casesense, 0, macro_start);
2926 free_tlist(tline);
2927 free_tlist(origline);
2928 return DIRECTIVE_FOUND;
2931 case PP_STRLEN:
2932 casesense = true;
2934 tline = tline->next;
2935 skip_white_(tline);
2936 tline = expand_id(tline);
2937 if (!tline || (tline->type != TOK_ID &&
2938 (tline->type != TOK_PREPROC_ID ||
2939 tline->text[1] != '$'))) {
2940 error(ERR_NONFATAL,
2941 "`%%strlen' expects a macro identifier as first parameter");
2942 free_tlist(origline);
2943 return DIRECTIVE_FOUND;
2945 ctx = get_ctx(tline->text, false);
2947 mname = tline->text;
2948 last = tline;
2949 tline = expand_smacro(tline->next);
2950 last->next = NULL;
2952 t = tline;
2953 while (tok_type_(t, TOK_WHITESPACE))
2954 t = t->next;
2955 /* t should now point to the string */
2956 if (t->type != TOK_STRING) {
2957 error(ERR_NONFATAL,
2958 "`%%strlen` requires string as second parameter");
2959 free_tlist(tline);
2960 free_tlist(origline);
2961 return DIRECTIVE_FOUND;
2964 macro_start = nasm_malloc(sizeof(*macro_start));
2965 macro_start->next = NULL;
2966 make_tok_num(macro_start, nasm_unquote(t->text, NULL));
2967 macro_start->a.mac = NULL;
2970 * We now have a macro name, an implicit parameter count of
2971 * zero, and a numeric token to use as an expansion. Create
2972 * and store an SMacro.
2974 define_smacro(ctx, mname, casesense, 0, macro_start);
2975 free_tlist(tline);
2976 free_tlist(origline);
2977 return DIRECTIVE_FOUND;
2979 case PP_STRCAT:
2980 casesense = true;
2982 tline = tline->next;
2983 skip_white_(tline);
2984 tline = expand_id(tline);
2985 if (!tline || (tline->type != TOK_ID &&
2986 (tline->type != TOK_PREPROC_ID ||
2987 tline->text[1] != '$'))) {
2988 error(ERR_NONFATAL,
2989 "`%%strcat' expects a macro identifier as first parameter");
2990 free_tlist(origline);
2991 return DIRECTIVE_FOUND;
2993 ctx = get_ctx(tline->text, false);
2995 mname = tline->text;
2996 last = tline;
2997 tline = expand_smacro(tline->next);
2998 last->next = NULL;
3000 len = 0;
3001 for (t = tline; t; t = t->next) {
3002 switch (t->type) {
3003 case TOK_WHITESPACE:
3004 break;
3005 case TOK_STRING:
3006 len += t->a.len = nasm_unquote(t->text, NULL);
3007 break;
3008 case TOK_OTHER:
3009 if (!strcmp(t->text, ",")) /* permit comma separators */
3010 break;
3011 /* else fall through */
3012 default:
3013 error(ERR_NONFATAL,
3014 "non-string passed to `%%strcat' (%d)", t->type);
3015 free_tlist(tline);
3016 free_tlist(origline);
3017 return DIRECTIVE_FOUND;
3021 p = pp = nasm_malloc(len);
3022 t = tline;
3023 for (t = tline; t; t = t->next) {
3024 if (t->type == TOK_STRING) {
3025 memcpy(p, t->text, t->a.len);
3026 p += t->a.len;
3031 * We now have a macro name, an implicit parameter count of
3032 * zero, and a numeric token to use as an expansion. Create
3033 * and store an SMacro.
3035 macro_start = new_Token(NULL, TOK_STRING, NULL, 0);
3036 macro_start->text = nasm_quote(pp, len);
3037 nasm_free(pp);
3038 define_smacro(ctx, mname, casesense, 0, macro_start);
3039 free_tlist(tline);
3040 free_tlist(origline);
3041 return DIRECTIVE_FOUND;
3043 case PP_SUBSTR:
3045 int64_t a1, a2;
3046 size_t len;
3048 casesense = true;
3050 tline = tline->next;
3051 skip_white_(tline);
3052 tline = expand_id(tline);
3053 if (!tline || (tline->type != TOK_ID &&
3054 (tline->type != TOK_PREPROC_ID ||
3055 tline->text[1] != '$'))) {
3056 error(ERR_NONFATAL,
3057 "`%%substr' expects a macro identifier as first parameter");
3058 free_tlist(origline);
3059 return DIRECTIVE_FOUND;
3061 ctx = get_ctx(tline->text, false);
3063 mname = tline->text;
3064 last = tline;
3065 tline = expand_smacro(tline->next);
3066 last->next = NULL;
3068 t = tline->next;
3069 while (tok_type_(t, TOK_WHITESPACE))
3070 t = t->next;
3072 /* t should now point to the string */
3073 if (t->type != TOK_STRING) {
3074 error(ERR_NONFATAL,
3075 "`%%substr` requires string as second parameter");
3076 free_tlist(tline);
3077 free_tlist(origline);
3078 return DIRECTIVE_FOUND;
3081 tt = t->next;
3082 tptr = &tt;
3083 tokval.t_type = TOKEN_INVALID;
3084 evalresult = evaluate(ppscan, tptr, &tokval, NULL,
3085 pass, error, NULL);
3086 if (!evalresult) {
3087 free_tlist(tline);
3088 free_tlist(origline);
3089 return DIRECTIVE_FOUND;
3090 } else if (!is_simple(evalresult)) {
3091 error(ERR_NONFATAL, "non-constant value given to `%%substr`");
3092 free_tlist(tline);
3093 free_tlist(origline);
3094 return DIRECTIVE_FOUND;
3096 a1 = evalresult->value-1;
3098 while (tok_type_(tt, TOK_WHITESPACE))
3099 tt = tt->next;
3100 if (!tt) {
3101 a2 = 1; /* Backwards compatibility: one character */
3102 } else {
3103 tokval.t_type = TOKEN_INVALID;
3104 evalresult = evaluate(ppscan, tptr, &tokval, NULL,
3105 pass, error, NULL);
3106 if (!evalresult) {
3107 free_tlist(tline);
3108 free_tlist(origline);
3109 return DIRECTIVE_FOUND;
3110 } else if (!is_simple(evalresult)) {
3111 error(ERR_NONFATAL, "non-constant value given to `%%substr`");
3112 free_tlist(tline);
3113 free_tlist(origline);
3114 return DIRECTIVE_FOUND;
3116 a2 = evalresult->value;
3119 len = nasm_unquote(t->text, NULL);
3120 if (a2 < 0)
3121 a2 = a2+1+len-a1;
3122 if (a1+a2 > (int64_t)len)
3123 a2 = len-a1;
3125 macro_start = nasm_malloc(sizeof(*macro_start));
3126 macro_start->next = NULL;
3127 macro_start->text = nasm_quote((a1 < 0) ? "" : t->text+a1, a2);
3128 macro_start->type = TOK_STRING;
3129 macro_start->a.mac = NULL;
3132 * We now have a macro name, an implicit parameter count of
3133 * zero, and a numeric token to use as an expansion. Create
3134 * and store an SMacro.
3136 define_smacro(ctx, mname, casesense, 0, macro_start);
3137 free_tlist(tline);
3138 free_tlist(origline);
3139 return DIRECTIVE_FOUND;
3142 case PP_ASSIGN:
3143 case PP_IASSIGN:
3144 casesense = (i == PP_ASSIGN);
3146 tline = tline->next;
3147 skip_white_(tline);
3148 tline = expand_id(tline);
3149 if (!tline || (tline->type != TOK_ID &&
3150 (tline->type != TOK_PREPROC_ID ||
3151 tline->text[1] != '$'))) {
3152 error(ERR_NONFATAL,
3153 "`%%%sassign' expects a macro identifier",
3154 (i == PP_IASSIGN ? "i" : ""));
3155 free_tlist(origline);
3156 return DIRECTIVE_FOUND;
3158 ctx = get_ctx(tline->text, false);
3160 mname = tline->text;
3161 last = tline;
3162 tline = expand_smacro(tline->next);
3163 last->next = NULL;
3165 t = tline;
3166 tptr = &t;
3167 tokval.t_type = TOKEN_INVALID;
3168 evalresult =
3169 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
3170 free_tlist(tline);
3171 if (!evalresult) {
3172 free_tlist(origline);
3173 return DIRECTIVE_FOUND;
3176 if (tokval.t_type)
3177 error(ERR_WARNING,
3178 "trailing garbage after expression ignored");
3180 if (!is_simple(evalresult)) {
3181 error(ERR_NONFATAL,
3182 "non-constant value given to `%%%sassign'",
3183 (i == PP_IASSIGN ? "i" : ""));
3184 free_tlist(origline);
3185 return DIRECTIVE_FOUND;
3188 macro_start = nasm_malloc(sizeof(*macro_start));
3189 macro_start->next = NULL;
3190 make_tok_num(macro_start, reloc_value(evalresult));
3191 macro_start->a.mac = NULL;
3194 * We now have a macro name, an implicit parameter count of
3195 * zero, and a numeric token to use as an expansion. Create
3196 * and store an SMacro.
3198 define_smacro(ctx, mname, casesense, 0, macro_start);
3199 free_tlist(origline);
3200 return DIRECTIVE_FOUND;
3202 case PP_LINE:
3204 * Syntax is `%line nnn[+mmm] [filename]'
3206 tline = tline->next;
3207 skip_white_(tline);
3208 if (!tok_type_(tline, TOK_NUMBER)) {
3209 error(ERR_NONFATAL, "`%%line' expects line number");
3210 free_tlist(origline);
3211 return DIRECTIVE_FOUND;
3213 k = readnum(tline->text, &err);
3214 m = 1;
3215 tline = tline->next;
3216 if (tok_is_(tline, "+")) {
3217 tline = tline->next;
3218 if (!tok_type_(tline, TOK_NUMBER)) {
3219 error(ERR_NONFATAL, "`%%line' expects line increment");
3220 free_tlist(origline);
3221 return DIRECTIVE_FOUND;
3223 m = readnum(tline->text, &err);
3224 tline = tline->next;
3226 skip_white_(tline);
3227 src_set_linnum(k);
3228 istk->lineinc = m;
3229 if (tline) {
3230 nasm_free(src_set_fname(detoken(tline, false)));
3232 free_tlist(origline);
3233 return DIRECTIVE_FOUND;
3235 default:
3236 error(ERR_FATAL,
3237 "preprocessor directive `%s' not yet implemented",
3238 pp_directives[i]);
3239 return DIRECTIVE_FOUND;
3244 * Ensure that a macro parameter contains a condition code and
3245 * nothing else. Return the condition code index if so, or -1
3246 * otherwise.
3248 static int find_cc(Token * t)
3250 Token *tt;
3251 int i, j, k, m;
3253 if (!t)
3254 return -1; /* Probably a %+ without a space */
3256 skip_white_(t);
3257 if (t->type != TOK_ID)
3258 return -1;
3259 tt = t->next;
3260 skip_white_(tt);
3261 if (tt && (tt->type != TOK_OTHER || strcmp(tt->text, ",")))
3262 return -1;
3264 i = -1;
3265 j = elements(conditions);
3266 while (j - i > 1) {
3267 k = (j + i) / 2;
3268 m = nasm_stricmp(t->text, conditions[k]);
3269 if (m == 0) {
3270 i = k;
3271 j = -2;
3272 break;
3273 } else if (m < 0) {
3274 j = k;
3275 } else
3276 i = k;
3278 if (j != -2)
3279 return -1;
3280 return i;
3284 * Expand MMacro-local things: parameter references (%0, %n, %+n,
3285 * %-n) and MMacro-local identifiers (%%foo).
3287 static Token *expand_mmac_params(Token * tline)
3289 Token *t, *tt, **tail, *thead;
3291 tail = &thead;
3292 thead = NULL;
3294 while (tline) {
3295 if (tline->type == TOK_PREPROC_ID &&
3296 (((tline->text[1] == '+' || tline->text[1] == '-')
3297 && tline->text[2]) || tline->text[1] == '%'
3298 || (tline->text[1] >= '0' && tline->text[1] <= '9'))) {
3299 char *text = NULL;
3300 int type = 0, cc; /* type = 0 to placate optimisers */
3301 char tmpbuf[30];
3302 unsigned int n;
3303 int i;
3304 MMacro *mac;
3306 t = tline;
3307 tline = tline->next;
3309 mac = istk->mstk;
3310 while (mac && !mac->name) /* avoid mistaking %reps for macros */
3311 mac = mac->next_active;
3312 if (!mac)
3313 error(ERR_NONFATAL, "`%s': not in a macro call", t->text);
3314 else
3315 switch (t->text[1]) {
3317 * We have to make a substitution of one of the
3318 * forms %1, %-1, %+1, %%foo, %0.
3320 case '0':
3321 type = TOK_NUMBER;
3322 snprintf(tmpbuf, sizeof(tmpbuf), "%d", mac->nparam);
3323 text = nasm_strdup(tmpbuf);
3324 break;
3325 case '%':
3326 type = TOK_ID;
3327 snprintf(tmpbuf, sizeof(tmpbuf), "..@%"PRIu64".",
3328 mac->unique);
3329 text = nasm_strcat(tmpbuf, t->text + 2);
3330 break;
3331 case '-':
3332 n = atoi(t->text + 2) - 1;
3333 if (n >= mac->nparam)
3334 tt = NULL;
3335 else {
3336 if (mac->nparam > 1)
3337 n = (n + mac->rotate) % mac->nparam;
3338 tt = mac->params[n];
3340 cc = find_cc(tt);
3341 if (cc == -1) {
3342 error(ERR_NONFATAL,
3343 "macro parameter %d is not a condition code",
3344 n + 1);
3345 text = NULL;
3346 } else {
3347 type = TOK_ID;
3348 if (inverse_ccs[cc] == -1) {
3349 error(ERR_NONFATAL,
3350 "condition code `%s' is not invertible",
3351 conditions[cc]);
3352 text = NULL;
3353 } else
3354 text =
3355 nasm_strdup(conditions[inverse_ccs[cc]]);
3357 break;
3358 case '+':
3359 n = atoi(t->text + 2) - 1;
3360 if (n >= mac->nparam)
3361 tt = NULL;
3362 else {
3363 if (mac->nparam > 1)
3364 n = (n + mac->rotate) % mac->nparam;
3365 tt = mac->params[n];
3367 cc = find_cc(tt);
3368 if (cc == -1) {
3369 error(ERR_NONFATAL,
3370 "macro parameter %d is not a condition code",
3371 n + 1);
3372 text = NULL;
3373 } else {
3374 type = TOK_ID;
3375 text = nasm_strdup(conditions[cc]);
3377 break;
3378 default:
3379 n = atoi(t->text + 1) - 1;
3380 if (n >= mac->nparam)
3381 tt = NULL;
3382 else {
3383 if (mac->nparam > 1)
3384 n = (n + mac->rotate) % mac->nparam;
3385 tt = mac->params[n];
3387 if (tt) {
3388 for (i = 0; i < mac->paramlen[n]; i++) {
3389 *tail = new_Token(NULL, tt->type, tt->text, 0);
3390 tail = &(*tail)->next;
3391 tt = tt->next;
3394 text = NULL; /* we've done it here */
3395 break;
3397 if (!text) {
3398 delete_Token(t);
3399 } else {
3400 *tail = t;
3401 tail = &t->next;
3402 t->type = type;
3403 nasm_free(t->text);
3404 t->text = text;
3405 t->a.mac = NULL;
3407 continue;
3408 } else {
3409 t = *tail = tline;
3410 tline = tline->next;
3411 t->a.mac = NULL;
3412 tail = &t->next;
3415 *tail = NULL;
3416 t = thead;
3417 for (; t && (tt = t->next) != NULL; t = t->next)
3418 switch (t->type) {
3419 case TOK_WHITESPACE:
3420 if (tt->type == TOK_WHITESPACE) {
3421 t->next = delete_Token(tt);
3423 break;
3424 case TOK_ID:
3425 if (tt->type == TOK_ID || tt->type == TOK_NUMBER) {
3426 char *tmp = nasm_strcat(t->text, tt->text);
3427 nasm_free(t->text);
3428 t->text = tmp;
3429 t->next = delete_Token(tt);
3431 break;
3432 case TOK_NUMBER:
3433 if (tt->type == TOK_NUMBER) {
3434 char *tmp = nasm_strcat(t->text, tt->text);
3435 nasm_free(t->text);
3436 t->text = tmp;
3437 t->next = delete_Token(tt);
3439 break;
3440 default:
3441 break;
3444 return thead;
3448 * Expand all single-line macro calls made in the given line.
3449 * Return the expanded version of the line. The original is deemed
3450 * to be destroyed in the process. (In reality we'll just move
3451 * Tokens from input to output a lot of the time, rather than
3452 * actually bothering to destroy and replicate.)
3454 #define DEADMAN_LIMIT (1 << 20)
3456 static Token *expand_smacro(Token * tline)
3458 Token *t, *tt, *mstart, **tail, *thead;
3459 struct hash_table *smtbl;
3460 SMacro *head = NULL, *m;
3461 Token **params;
3462 int *paramsize;
3463 unsigned int nparam, sparam;
3464 int brackets, rescan;
3465 Token *org_tline = tline;
3466 Context *ctx;
3467 char *mname;
3468 int deadman = DEADMAN_LIMIT;
3471 * Trick: we should avoid changing the start token pointer since it can
3472 * be contained in "next" field of other token. Because of this
3473 * we allocate a copy of first token and work with it; at the end of
3474 * routine we copy it back
3476 if (org_tline) {
3477 tline =
3478 new_Token(org_tline->next, org_tline->type, org_tline->text,
3480 tline->a.mac = org_tline->a.mac;
3481 nasm_free(org_tline->text);
3482 org_tline->text = NULL;
3485 again:
3486 tail = &thead;
3487 thead = NULL;
3489 while (tline) { /* main token loop */
3490 if (!--deadman) {
3491 error(ERR_NONFATAL, "interminable macro recursion");
3492 break;
3495 if ((mname = tline->text)) {
3496 /* if this token is a local macro, look in local context */
3497 ctx = NULL;
3498 smtbl = &smacros;
3499 if (tline->type == TOK_ID || tline->type == TOK_PREPROC_ID) {
3500 ctx = get_ctx(mname, true);
3501 if (ctx)
3502 smtbl = &ctx->localmac;
3504 head = (SMacro *) hash_findix(smtbl, mname);
3507 * We've hit an identifier. As in is_mmacro below, we first
3508 * check whether the identifier is a single-line macro at
3509 * all, then think about checking for parameters if
3510 * necessary.
3512 for (m = head; m; m = m->next)
3513 if (!mstrcmp(m->name, mname, m->casesense))
3514 break;
3515 if (m) {
3516 mstart = tline;
3517 params = NULL;
3518 paramsize = NULL;
3519 if (m->nparam == 0) {
3521 * Simple case: the macro is parameterless. Discard the
3522 * one token that the macro call took, and push the
3523 * expansion back on the to-do stack.
3525 if (!m->expansion) {
3526 if (!strcmp("__FILE__", m->name)) {
3527 int32_t num = 0;
3528 char *file = NULL;
3529 src_get(&num, &file);
3530 tline->text = nasm_quote(file, strlen(file));
3531 tline->type = TOK_STRING;
3532 nasm_free(file);
3533 continue;
3535 if (!strcmp("__LINE__", m->name)) {
3536 nasm_free(tline->text);
3537 make_tok_num(tline, src_get_linnum());
3538 continue;
3540 if (!strcmp("__BITS__", m->name)) {
3541 nasm_free(tline->text);
3542 make_tok_num(tline, globalbits);
3543 continue;
3545 tline = delete_Token(tline);
3546 continue;
3548 } else {
3550 * Complicated case: at least one macro with this name
3551 * exists and takes parameters. We must find the
3552 * parameters in the call, count them, find the SMacro
3553 * that corresponds to that form of the macro call, and
3554 * substitute for the parameters when we expand. What a
3555 * pain.
3557 /*tline = tline->next;
3558 skip_white_(tline); */
3559 do {
3560 t = tline->next;
3561 while (tok_type_(t, TOK_SMAC_END)) {
3562 t->a.mac->in_progress = false;
3563 t->text = NULL;
3564 t = tline->next = delete_Token(t);
3566 tline = t;
3567 } while (tok_type_(tline, TOK_WHITESPACE));
3568 if (!tok_is_(tline, "(")) {
3570 * This macro wasn't called with parameters: ignore
3571 * the call. (Behaviour borrowed from gnu cpp.)
3573 tline = mstart;
3574 m = NULL;
3575 } else {
3576 int paren = 0;
3577 int white = 0;
3578 brackets = 0;
3579 nparam = 0;
3580 sparam = PARAM_DELTA;
3581 params = nasm_malloc(sparam * sizeof(Token *));
3582 params[0] = tline->next;
3583 paramsize = nasm_malloc(sparam * sizeof(int));
3584 paramsize[0] = 0;
3585 while (true) { /* parameter loop */
3587 * For some unusual expansions
3588 * which concatenates function call
3590 t = tline->next;
3591 while (tok_type_(t, TOK_SMAC_END)) {
3592 t->a.mac->in_progress = false;
3593 t->text = NULL;
3594 t = tline->next = delete_Token(t);
3596 tline = t;
3598 if (!tline) {
3599 error(ERR_NONFATAL,
3600 "macro call expects terminating `)'");
3601 break;
3603 if (tline->type == TOK_WHITESPACE
3604 && brackets <= 0) {
3605 if (paramsize[nparam])
3606 white++;
3607 else
3608 params[nparam] = tline->next;
3609 continue; /* parameter loop */
3611 if (tline->type == TOK_OTHER
3612 && tline->text[1] == 0) {
3613 char ch = tline->text[0];
3614 if (ch == ',' && !paren && brackets <= 0) {
3615 if (++nparam >= sparam) {
3616 sparam += PARAM_DELTA;
3617 params = nasm_realloc(params,
3618 sparam *
3619 sizeof(Token
3620 *));
3621 paramsize =
3622 nasm_realloc(paramsize,
3623 sparam *
3624 sizeof(int));
3626 params[nparam] = tline->next;
3627 paramsize[nparam] = 0;
3628 white = 0;
3629 continue; /* parameter loop */
3631 if (ch == '{' &&
3632 (brackets > 0 || (brackets == 0 &&
3633 !paramsize[nparam])))
3635 if (!(brackets++)) {
3636 params[nparam] = tline->next;
3637 continue; /* parameter loop */
3640 if (ch == '}' && brackets > 0)
3641 if (--brackets == 0) {
3642 brackets = -1;
3643 continue; /* parameter loop */
3645 if (ch == '(' && !brackets)
3646 paren++;
3647 if (ch == ')' && brackets <= 0)
3648 if (--paren < 0)
3649 break;
3651 if (brackets < 0) {
3652 brackets = 0;
3653 error(ERR_NONFATAL, "braces do not "
3654 "enclose all of macro parameter");
3656 paramsize[nparam] += white + 1;
3657 white = 0;
3658 } /* parameter loop */
3659 nparam++;
3660 while (m && (m->nparam != nparam ||
3661 mstrcmp(m->name, mname,
3662 m->casesense)))
3663 m = m->next;
3664 if (!m)
3665 error(ERR_WARNING | ERR_WARN_MNP,
3666 "macro `%s' exists, "
3667 "but not taking %d parameters",
3668 mstart->text, nparam);
3671 if (m && m->in_progress)
3672 m = NULL;
3673 if (!m) { /* in progess or didn't find '(' or wrong nparam */
3675 * Design question: should we handle !tline, which
3676 * indicates missing ')' here, or expand those
3677 * macros anyway, which requires the (t) test a few
3678 * lines down?
3680 nasm_free(params);
3681 nasm_free(paramsize);
3682 tline = mstart;
3683 } else {
3685 * Expand the macro: we are placed on the last token of the
3686 * call, so that we can easily split the call from the
3687 * following tokens. We also start by pushing an SMAC_END
3688 * token for the cycle removal.
3690 t = tline;
3691 if (t) {
3692 tline = t->next;
3693 t->next = NULL;
3695 tt = new_Token(tline, TOK_SMAC_END, NULL, 0);
3696 tt->a.mac = m;
3697 m->in_progress = true;
3698 tline = tt;
3699 for (t = m->expansion; t; t = t->next) {
3700 if (t->type >= TOK_SMAC_PARAM) {
3701 Token *pcopy = tline, **ptail = &pcopy;
3702 Token *ttt, *pt;
3703 int i;
3705 ttt = params[t->type - TOK_SMAC_PARAM];
3706 for (i = paramsize[t->type - TOK_SMAC_PARAM];
3707 --i >= 0;) {
3708 pt = *ptail =
3709 new_Token(tline, ttt->type, ttt->text,
3711 ptail = &pt->next;
3712 ttt = ttt->next;
3714 tline = pcopy;
3715 } else if (t->type == TOK_PREPROC_Q) {
3716 tt = new_Token(tline, TOK_ID, mname, 0);
3717 tline = tt;
3718 } else if (t->type == TOK_PREPROC_QQ) {
3719 tt = new_Token(tline, TOK_ID, m->name, 0);
3720 tline = tt;
3721 } else {
3722 tt = new_Token(tline, t->type, t->text, 0);
3723 tline = tt;
3728 * Having done that, get rid of the macro call, and clean
3729 * up the parameters.
3731 nasm_free(params);
3732 nasm_free(paramsize);
3733 free_tlist(mstart);
3734 continue; /* main token loop */
3739 if (tline->type == TOK_SMAC_END) {
3740 tline->a.mac->in_progress = false;
3741 tline = delete_Token(tline);
3742 } else {
3743 t = *tail = tline;
3744 tline = tline->next;
3745 t->a.mac = NULL;
3746 t->next = NULL;
3747 tail = &t->next;
3752 * Now scan the entire line and look for successive TOK_IDs that resulted
3753 * after expansion (they can't be produced by tokenize()). The successive
3754 * TOK_IDs should be concatenated.
3755 * Also we look for %+ tokens and concatenate the tokens before and after
3756 * them (without white spaces in between).
3758 t = thead;
3759 rescan = 0;
3760 while (t) {
3761 while (t && t->type != TOK_ID && t->type != TOK_PREPROC_ID)
3762 t = t->next;
3763 if (!t || !t->next)
3764 break;
3765 if (t->next->type == TOK_ID ||
3766 t->next->type == TOK_PREPROC_ID ||
3767 t->next->type == TOK_NUMBER) {
3768 char *p = nasm_strcat(t->text, t->next->text);
3769 nasm_free(t->text);
3770 t->next = delete_Token(t->next);
3771 t->text = p;
3772 rescan = 1;
3773 } else if (t->next->type == TOK_WHITESPACE && t->next->next &&
3774 t->next->next->type == TOK_PREPROC_ID &&
3775 strcmp(t->next->next->text, "%+") == 0) {
3776 /* free the next whitespace, the %+ token and next whitespace */
3777 int i;
3778 for (i = 1; i <= 3; i++) {
3779 if (!t->next
3780 || (i != 2 && t->next->type != TOK_WHITESPACE))
3781 break;
3782 t->next = delete_Token(t->next);
3783 } /* endfor */
3784 } else
3785 t = t->next;
3787 /* If we concatenaded something, re-scan the line for macros */
3788 if (rescan) {
3789 tline = thead;
3790 goto again;
3793 if (org_tline) {
3794 if (thead) {
3795 *org_tline = *thead;
3796 /* since we just gave text to org_line, don't free it */
3797 thead->text = NULL;
3798 delete_Token(thead);
3799 } else {
3800 /* the expression expanded to empty line;
3801 we can't return NULL for some reasons
3802 we just set the line to a single WHITESPACE token. */
3803 memset(org_tline, 0, sizeof(*org_tline));
3804 org_tline->text = NULL;
3805 org_tline->type = TOK_WHITESPACE;
3807 thead = org_tline;
3810 return thead;
3814 * Similar to expand_smacro but used exclusively with macro identifiers
3815 * right before they are fetched in. The reason is that there can be
3816 * identifiers consisting of several subparts. We consider that if there
3817 * are more than one element forming the name, user wants a expansion,
3818 * otherwise it will be left as-is. Example:
3820 * %define %$abc cde
3822 * the identifier %$abc will be left as-is so that the handler for %define
3823 * will suck it and define the corresponding value. Other case:
3825 * %define _%$abc cde
3827 * In this case user wants name to be expanded *before* %define starts
3828 * working, so we'll expand %$abc into something (if it has a value;
3829 * otherwise it will be left as-is) then concatenate all successive
3830 * PP_IDs into one.
3832 static Token *expand_id(Token * tline)
3834 Token *cur, *oldnext = NULL;
3836 if (!tline || !tline->next)
3837 return tline;
3839 cur = tline;
3840 while (cur->next &&
3841 (cur->next->type == TOK_ID ||
3842 cur->next->type == TOK_PREPROC_ID
3843 || cur->next->type == TOK_NUMBER))
3844 cur = cur->next;
3846 /* If identifier consists of just one token, don't expand */
3847 if (cur == tline)
3848 return tline;
3850 if (cur) {
3851 oldnext = cur->next; /* Detach the tail past identifier */
3852 cur->next = NULL; /* so that expand_smacro stops here */
3855 tline = expand_smacro(tline);
3857 if (cur) {
3858 /* expand_smacro possibly changhed tline; re-scan for EOL */
3859 cur = tline;
3860 while (cur && cur->next)
3861 cur = cur->next;
3862 if (cur)
3863 cur->next = oldnext;
3866 return tline;
3870 * Determine whether the given line constitutes a multi-line macro
3871 * call, and return the MMacro structure called if so. Doesn't have
3872 * to check for an initial label - that's taken care of in
3873 * expand_mmacro - but must check numbers of parameters. Guaranteed
3874 * to be called with tline->type == TOK_ID, so the putative macro
3875 * name is easy to find.
3877 static MMacro *is_mmacro(Token * tline, Token *** params_array)
3879 MMacro *head, *m;
3880 Token **params;
3881 int nparam;
3883 head = (MMacro *) hash_findix(&mmacros, tline->text);
3886 * Efficiency: first we see if any macro exists with the given
3887 * name. If not, we can return NULL immediately. _Then_ we
3888 * count the parameters, and then we look further along the
3889 * list if necessary to find the proper MMacro.
3891 for (m = head; m; m = m->next)
3892 if (!mstrcmp(m->name, tline->text, m->casesense))
3893 break;
3894 if (!m)
3895 return NULL;
3898 * OK, we have a potential macro. Count and demarcate the
3899 * parameters.
3901 count_mmac_params(tline->next, &nparam, &params);
3904 * So we know how many parameters we've got. Find the MMacro
3905 * structure that handles this number.
3907 while (m) {
3908 if (m->nparam_min <= nparam
3909 && (m->plus || nparam <= m->nparam_max)) {
3911 * This one is right. Just check if cycle removal
3912 * prohibits us using it before we actually celebrate...
3914 if (m->in_progress) {
3915 #if 0
3916 error(ERR_NONFATAL,
3917 "self-reference in multi-line macro `%s'", m->name);
3918 #endif
3919 nasm_free(params);
3920 return NULL;
3923 * It's right, and we can use it. Add its default
3924 * parameters to the end of our list if necessary.
3926 if (m->defaults && nparam < m->nparam_min + m->ndefs) {
3927 params =
3928 nasm_realloc(params,
3929 ((m->nparam_min + m->ndefs +
3930 1) * sizeof(*params)));
3931 while (nparam < m->nparam_min + m->ndefs) {
3932 params[nparam] = m->defaults[nparam - m->nparam_min];
3933 nparam++;
3937 * If we've gone over the maximum parameter count (and
3938 * we're in Plus mode), ignore parameters beyond
3939 * nparam_max.
3941 if (m->plus && nparam > m->nparam_max)
3942 nparam = m->nparam_max;
3944 * Then terminate the parameter list, and leave.
3946 if (!params) { /* need this special case */
3947 params = nasm_malloc(sizeof(*params));
3948 nparam = 0;
3950 params[nparam] = NULL;
3951 *params_array = params;
3952 return m;
3955 * This one wasn't right: look for the next one with the
3956 * same name.
3958 for (m = m->next; m; m = m->next)
3959 if (!mstrcmp(m->name, tline->text, m->casesense))
3960 break;
3964 * After all that, we didn't find one with the right number of
3965 * parameters. Issue a warning, and fail to expand the macro.
3967 error(ERR_WARNING | ERR_WARN_MNP,
3968 "macro `%s' exists, but not taking %d parameters",
3969 tline->text, nparam);
3970 nasm_free(params);
3971 return NULL;
3975 * Expand the multi-line macro call made by the given line, if
3976 * there is one to be expanded. If there is, push the expansion on
3977 * istk->expansion and return 1. Otherwise return 0.
3979 static int expand_mmacro(Token * tline)
3981 Token *startline = tline;
3982 Token *label = NULL;
3983 int dont_prepend = 0;
3984 Token **params, *t, *mtok, *tt;
3985 MMacro *m;
3986 Line *l, *ll;
3987 int i, nparam, *paramlen;
3988 const char *mname;
3990 t = tline;
3991 skip_white_(t);
3992 /* if (!tok_type_(t, TOK_ID)) Lino 02/25/02 */
3993 if (!tok_type_(t, TOK_ID) && !tok_type_(t, TOK_PREPROC_ID))
3994 return 0;
3995 mtok = t;
3996 m = is_mmacro(t, &params);
3997 if (m) {
3998 mname = t->text;
3999 } else {
4000 Token *last;
4002 * We have an id which isn't a macro call. We'll assume
4003 * it might be a label; we'll also check to see if a
4004 * colon follows it. Then, if there's another id after
4005 * that lot, we'll check it again for macro-hood.
4007 label = last = t;
4008 t = t->next;
4009 if (tok_type_(t, TOK_WHITESPACE))
4010 last = t, t = t->next;
4011 if (tok_is_(t, ":")) {
4012 dont_prepend = 1;
4013 last = t, t = t->next;
4014 if (tok_type_(t, TOK_WHITESPACE))
4015 last = t, t = t->next;
4017 if (!tok_type_(t, TOK_ID) || (m = is_mmacro(t, &params)) == NULL)
4018 return 0;
4019 last->next = NULL;
4020 mname = t->text;
4021 tline = t;
4025 * Fix up the parameters: this involves stripping leading and
4026 * trailing whitespace, then stripping braces if they are
4027 * present.
4029 for (nparam = 0; params[nparam]; nparam++) ;
4030 paramlen = nparam ? nasm_malloc(nparam * sizeof(*paramlen)) : NULL;
4032 for (i = 0; params[i]; i++) {
4033 int brace = false;
4034 int comma = (!m->plus || i < nparam - 1);
4036 t = params[i];
4037 skip_white_(t);
4038 if (tok_is_(t, "{"))
4039 t = t->next, brace = true, comma = false;
4040 params[i] = t;
4041 paramlen[i] = 0;
4042 while (t) {
4043 if (comma && t->type == TOK_OTHER && !strcmp(t->text, ","))
4044 break; /* ... because we have hit a comma */
4045 if (comma && t->type == TOK_WHITESPACE
4046 && tok_is_(t->next, ","))
4047 break; /* ... or a space then a comma */
4048 if (brace && t->type == TOK_OTHER && !strcmp(t->text, "}"))
4049 break; /* ... or a brace */
4050 t = t->next;
4051 paramlen[i]++;
4056 * OK, we have a MMacro structure together with a set of
4057 * parameters. We must now go through the expansion and push
4058 * copies of each Line on to istk->expansion. Substitution of
4059 * parameter tokens and macro-local tokens doesn't get done
4060 * until the single-line macro substitution process; this is
4061 * because delaying them allows us to change the semantics
4062 * later through %rotate.
4064 * First, push an end marker on to istk->expansion, mark this
4065 * macro as in progress, and set up its invocation-specific
4066 * variables.
4068 ll = nasm_malloc(sizeof(Line));
4069 ll->next = istk->expansion;
4070 ll->finishes = m;
4071 ll->first = NULL;
4072 istk->expansion = ll;
4074 m->in_progress = true;
4075 m->params = params;
4076 m->iline = tline;
4077 m->nparam = nparam;
4078 m->rotate = 0;
4079 m->paramlen = paramlen;
4080 m->unique = unique++;
4081 m->lineno = 0;
4083 m->next_active = istk->mstk;
4084 istk->mstk = m;
4086 for (l = m->expansion; l; l = l->next) {
4087 Token **tail;
4089 ll = nasm_malloc(sizeof(Line));
4090 ll->finishes = NULL;
4091 ll->next = istk->expansion;
4092 istk->expansion = ll;
4093 tail = &ll->first;
4095 for (t = l->first; t; t = t->next) {
4096 Token *x = t;
4097 switch (t->type) {
4098 case TOK_PREPROC_Q:
4099 tt = *tail = new_Token(NULL, TOK_ID, mname, 0);
4100 break;
4101 case TOK_PREPROC_QQ:
4102 tt = *tail = new_Token(NULL, TOK_ID, m->name, 0);
4103 break;
4104 case TOK_PREPROC_ID:
4105 if (t->text[1] == '0' && t->text[2] == '0') {
4106 dont_prepend = -1;
4107 x = label;
4108 if (!x)
4109 continue;
4111 /* fall through */
4112 default:
4113 tt = *tail = new_Token(NULL, x->type, x->text, 0);
4114 break;
4116 tail = &tt->next;
4118 *tail = NULL;
4122 * If we had a label, push it on as the first line of
4123 * the macro expansion.
4125 if (label) {
4126 if (dont_prepend < 0)
4127 free_tlist(startline);
4128 else {
4129 ll = nasm_malloc(sizeof(Line));
4130 ll->finishes = NULL;
4131 ll->next = istk->expansion;
4132 istk->expansion = ll;
4133 ll->first = startline;
4134 if (!dont_prepend) {
4135 while (label->next)
4136 label = label->next;
4137 label->next = tt = new_Token(NULL, TOK_OTHER, ":", 0);
4142 list->uplevel(m->nolist ? LIST_MACRO_NOLIST : LIST_MACRO);
4144 return 1;
4147 /* The function that actually does the error reporting */
4148 static void verror(int severity, const char *fmt, va_list arg)
4150 char buff[1024];
4152 vsnprintf(buff, sizeof(buff), fmt, arg);
4154 if (istk && istk->mstk && istk->mstk->name)
4155 _error(severity | ERR_PASS1, "(%s:%d) %s", istk->mstk->name,
4156 istk->mstk->lineno, buff);
4157 else
4158 _error(severity | ERR_PASS1, "%s", buff);
4162 * Since preprocessor always operate only on the line that didn't
4163 * arrived yet, we should always use ERR_OFFBY1. Also since user
4164 * won't want to see same error twice (preprocessing is done once
4165 * per pass) we will want to show errors only during pass one.
4167 static void error(int severity, const char *fmt, ...)
4169 va_list arg;
4171 /* If we're in a dead branch of IF or something like it, ignore the error */
4172 if (istk && istk->conds && !emitting(istk->conds->state))
4173 return;
4175 va_start(arg, fmt);
4176 verror(severity, fmt, arg);
4177 va_end(arg);
4181 * Because %else etc are evaluated in the state context
4182 * of the previous branch, errors might get lost with error():
4183 * %if 0 ... %else trailing garbage ... %endif
4184 * So %else etc should report errors with this function.
4186 static void error_precond(int severity, const char *fmt, ...)
4188 va_list arg;
4190 /* Only ignore the error if it's really in a dead branch */
4191 if (istk && istk->conds && istk->conds->state == COND_NEVER)
4192 return;
4194 va_start(arg, fmt);
4195 verror(severity, fmt, arg);
4196 va_end(arg);
4199 static void
4200 pp_reset(char *file, int apass, efunc errfunc, evalfunc eval,
4201 ListGen * listgen, StrList **deplist)
4203 _error = errfunc;
4204 cstk = NULL;
4205 istk = nasm_malloc(sizeof(Include));
4206 istk->next = NULL;
4207 istk->conds = NULL;
4208 istk->expansion = NULL;
4209 istk->mstk = NULL;
4210 istk->fp = fopen(file, "r");
4211 istk->fname = NULL;
4212 src_set_fname(nasm_strdup(file));
4213 src_set_linnum(0);
4214 istk->lineinc = 1;
4215 if (!istk->fp)
4216 error(ERR_FATAL | ERR_NOFILE, "unable to open input file `%s'",
4217 file);
4218 defining = NULL;
4219 nested_mac_count = 0;
4220 nested_rep_count = 0;
4221 init_macros();
4222 unique = 0;
4223 if (tasm_compatible_mode) {
4224 stdmacpos = nasm_stdmac;
4225 } else {
4226 stdmacpos = nasm_stdmac_after_tasm;
4228 any_extrastdmac = extrastdmac && *extrastdmac;
4229 do_predef = true;
4230 list = listgen;
4231 evaluate = eval;
4232 pass = apass;
4233 dephead = deptail = deplist;
4234 if (deplist) {
4235 StrList *sl = nasm_malloc(strlen(file)+1+sizeof sl->next);
4236 sl->next = NULL;
4237 strcpy(sl->str, file);
4238 *deptail = sl;
4239 deptail = &sl->next;
4243 static char *pp_getline(void)
4245 char *line;
4246 Token *tline;
4248 while (1) {
4250 * Fetch a tokenized line, either from the macro-expansion
4251 * buffer or from the input file.
4253 tline = NULL;
4254 while (istk->expansion && istk->expansion->finishes) {
4255 Line *l = istk->expansion;
4256 if (!l->finishes->name && l->finishes->in_progress > 1) {
4257 Line *ll;
4260 * This is a macro-end marker for a macro with no
4261 * name, which means it's not really a macro at all
4262 * but a %rep block, and the `in_progress' field is
4263 * more than 1, meaning that we still need to
4264 * repeat. (1 means the natural last repetition; 0
4265 * means termination by %exitrep.) We have
4266 * therefore expanded up to the %endrep, and must
4267 * push the whole block on to the expansion buffer
4268 * again. We don't bother to remove the macro-end
4269 * marker: we'd only have to generate another one
4270 * if we did.
4272 l->finishes->in_progress--;
4273 for (l = l->finishes->expansion; l; l = l->next) {
4274 Token *t, *tt, **tail;
4276 ll = nasm_malloc(sizeof(Line));
4277 ll->next = istk->expansion;
4278 ll->finishes = NULL;
4279 ll->first = NULL;
4280 tail = &ll->first;
4282 for (t = l->first; t; t = t->next) {
4283 if (t->text || t->type == TOK_WHITESPACE) {
4284 tt = *tail =
4285 new_Token(NULL, t->type, t->text, 0);
4286 tail = &tt->next;
4290 istk->expansion = ll;
4292 } else {
4294 * Check whether a `%rep' was started and not ended
4295 * within this macro expansion. This can happen and
4296 * should be detected. It's a fatal error because
4297 * I'm too confused to work out how to recover
4298 * sensibly from it.
4300 if (defining) {
4301 if (defining->name)
4302 error(ERR_PANIC,
4303 "defining with name in expansion");
4304 else if (istk->mstk->name)
4305 error(ERR_FATAL,
4306 "`%%rep' without `%%endrep' within"
4307 " expansion of macro `%s'",
4308 istk->mstk->name);
4312 * FIXME: investigate the relationship at this point between
4313 * istk->mstk and l->finishes
4316 MMacro *m = istk->mstk;
4317 istk->mstk = m->next_active;
4318 if (m->name) {
4320 * This was a real macro call, not a %rep, and
4321 * therefore the parameter information needs to
4322 * be freed.
4324 nasm_free(m->params);
4325 free_tlist(m->iline);
4326 nasm_free(m->paramlen);
4327 l->finishes->in_progress = false;
4328 } else
4329 free_mmacro(m);
4331 istk->expansion = l->next;
4332 nasm_free(l);
4333 list->downlevel(LIST_MACRO);
4336 while (1) { /* until we get a line we can use */
4338 if (istk->expansion) { /* from a macro expansion */
4339 char *p;
4340 Line *l = istk->expansion;
4341 if (istk->mstk)
4342 istk->mstk->lineno++;
4343 tline = l->first;
4344 istk->expansion = l->next;
4345 nasm_free(l);
4346 p = detoken(tline, false);
4347 list->line(LIST_MACRO, p);
4348 nasm_free(p);
4349 break;
4351 line = read_line();
4352 if (line) { /* from the current input file */
4353 line = prepreproc(line);
4354 tline = tokenize(line);
4355 nasm_free(line);
4356 break;
4359 * The current file has ended; work down the istk
4362 Include *i = istk;
4363 fclose(i->fp);
4364 if (i->conds)
4365 error(ERR_FATAL,
4366 "expected `%%endif' before end of file");
4367 /* only set line and file name if there's a next node */
4368 if (i->next) {
4369 src_set_linnum(i->lineno);
4370 nasm_free(src_set_fname(i->fname));
4372 istk = i->next;
4373 list->downlevel(LIST_INCLUDE);
4374 nasm_free(i);
4375 if (!istk)
4376 return NULL;
4381 * We must expand MMacro parameters and MMacro-local labels
4382 * _before_ we plunge into directive processing, to cope
4383 * with things like `%define something %1' such as STRUC
4384 * uses. Unless we're _defining_ a MMacro, in which case
4385 * those tokens should be left alone to go into the
4386 * definition; and unless we're in a non-emitting
4387 * condition, in which case we don't want to meddle with
4388 * anything.
4390 if (!defining && !(istk->conds && !emitting(istk->conds->state))
4391 && !(istk->mstk && !istk->mstk->in_progress))
4392 tline = expand_mmac_params(tline);
4395 * Check the line to see if it's a preprocessor directive.
4397 if (do_directive(tline) == DIRECTIVE_FOUND) {
4398 continue;
4399 } else if (defining) {
4401 * We're defining a multi-line macro. We emit nothing
4402 * at all, and just
4403 * shove the tokenized line on to the macro definition.
4405 Line *l = nasm_malloc(sizeof(Line));
4406 l->next = defining->expansion;
4407 l->first = tline;
4408 l->finishes = NULL;
4409 defining->expansion = l;
4410 continue;
4411 } else if (istk->conds && !emitting(istk->conds->state)) {
4413 * We're in a non-emitting branch of a condition block.
4414 * Emit nothing at all, not even a blank line: when we
4415 * emerge from the condition we'll give a line-number
4416 * directive so we keep our place correctly.
4418 free_tlist(tline);
4419 continue;
4420 } else if (istk->mstk && !istk->mstk->in_progress) {
4422 * We're in a %rep block which has been terminated, so
4423 * we're walking through to the %endrep without
4424 * emitting anything. Emit nothing at all, not even a
4425 * blank line: when we emerge from the %rep block we'll
4426 * give a line-number directive so we keep our place
4427 * correctly.
4429 free_tlist(tline);
4430 continue;
4431 } else {
4432 tline = expand_smacro(tline);
4433 if (!expand_mmacro(tline)) {
4435 * De-tokenize the line again, and emit it.
4437 line = detoken(tline, true);
4438 free_tlist(tline);
4439 break;
4440 } else {
4441 continue; /* expand_mmacro calls free_tlist */
4446 return line;
4449 static void pp_cleanup(int pass)
4451 if (defining) {
4452 if(defining->name) {
4453 error(ERR_NONFATAL,
4454 "end of file while still defining macro `%s'",
4455 defining->name);
4456 } else {
4457 error(ERR_NONFATAL, "end of file while still in %%rep");
4460 free_mmacro(defining);
4462 while (cstk)
4463 ctx_pop();
4464 free_macros();
4465 while (istk) {
4466 Include *i = istk;
4467 istk = istk->next;
4468 fclose(i->fp);
4469 nasm_free(i->fname);
4470 nasm_free(i);
4472 while (cstk)
4473 ctx_pop();
4474 nasm_free(src_set_fname(NULL));
4475 if (pass == 0) {
4476 IncPath *i;
4477 free_llist(predef);
4478 delete_Blocks();
4479 while ((i = ipath)) {
4480 ipath = i->next;
4481 if (i->path)
4482 nasm_free(i->path);
4483 nasm_free(i);
4488 void pp_include_path(char *path)
4490 IncPath *i;
4492 i = nasm_malloc(sizeof(IncPath));
4493 i->path = path ? nasm_strdup(path) : NULL;
4494 i->next = NULL;
4496 if (ipath != NULL) {
4497 IncPath *j = ipath;
4498 while (j->next != NULL)
4499 j = j->next;
4500 j->next = i;
4501 } else {
4502 ipath = i;
4506 void pp_pre_include(char *fname)
4508 Token *inc, *space, *name;
4509 Line *l;
4511 name = new_Token(NULL, TOK_INTERNAL_STRING, fname, 0);
4512 space = new_Token(name, TOK_WHITESPACE, NULL, 0);
4513 inc = new_Token(space, TOK_PREPROC_ID, "%include", 0);
4515 l = nasm_malloc(sizeof(Line));
4516 l->next = predef;
4517 l->first = inc;
4518 l->finishes = NULL;
4519 predef = l;
4522 void pp_pre_define(char *definition)
4524 Token *def, *space;
4525 Line *l;
4526 char *equals;
4528 equals = strchr(definition, '=');
4529 space = new_Token(NULL, TOK_WHITESPACE, NULL, 0);
4530 def = new_Token(space, TOK_PREPROC_ID, "%define", 0);
4531 if (equals)
4532 *equals = ' ';
4533 space->next = tokenize(definition);
4534 if (equals)
4535 *equals = '=';
4537 l = nasm_malloc(sizeof(Line));
4538 l->next = predef;
4539 l->first = def;
4540 l->finishes = NULL;
4541 predef = l;
4544 void pp_pre_undefine(char *definition)
4546 Token *def, *space;
4547 Line *l;
4549 space = new_Token(NULL, TOK_WHITESPACE, NULL, 0);
4550 def = new_Token(space, TOK_PREPROC_ID, "%undef", 0);
4551 space->next = tokenize(definition);
4553 l = nasm_malloc(sizeof(Line));
4554 l->next = predef;
4555 l->first = def;
4556 l->finishes = NULL;
4557 predef = l;
4561 * Added by Keith Kanios:
4563 * This function is used to assist with "runtime" preprocessor
4564 * directives. (e.g. pp_runtime("%define __BITS__ 64");)
4566 * ERRORS ARE IGNORED HERE, SO MAKE COMPLETELY SURE THAT YOU
4567 * PASS A VALID STRING TO THIS FUNCTION!!!!!
4570 void pp_runtime(char *definition)
4572 Token *def;
4574 def = tokenize(definition);
4575 if(do_directive(def) == NO_DIRECTIVE_FOUND)
4576 free_tlist(def);
4580 void pp_extra_stdmac(macros_t *macros)
4582 extrastdmac = macros;
4585 static void make_tok_num(Token * tok, int64_t val)
4587 char numbuf[20];
4588 snprintf(numbuf, sizeof(numbuf), "%"PRId64"", val);
4589 tok->text = nasm_strdup(numbuf);
4590 tok->type = TOK_NUMBER;
4593 Preproc nasmpp = {
4594 pp_reset,
4595 pp_getline,
4596 pp_cleanup