Merge branch 'indirect'
[nasm.git] / preproc.c
blob3010d3ef0143aca23914d83bc3df71b11b797fc3
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_INDIRECT, /* %[...] */
163 TOK_SMAC_PARAM, /* MUST BE LAST IN THE LIST!!! */
164 TOK_MAX = INT_MAX /* Keep compiler from reducing the range */
167 struct Token {
168 Token *next;
169 char *text;
170 union {
171 SMacro *mac; /* associated macro for TOK_SMAC_END */
172 size_t len; /* scratch length field */
173 } a; /* Auxiliary data */
174 enum pp_token_type type;
178 * Multi-line macro definitions are stored as a linked list of
179 * these, which is essentially a container to allow several linked
180 * lists of Tokens.
182 * Note that in this module, linked lists are treated as stacks
183 * wherever possible. For this reason, Lines are _pushed_ on to the
184 * `expansion' field in MMacro structures, so that the linked list,
185 * if walked, would give the macro lines in reverse order; this
186 * means that we can walk the list when expanding a macro, and thus
187 * push the lines on to the `expansion' field in _istk_ in reverse
188 * order (so that when popped back off they are in the right
189 * order). It may seem cockeyed, and it relies on my design having
190 * an even number of steps in, but it works...
192 * Some of these structures, rather than being actual lines, are
193 * markers delimiting the end of the expansion of a given macro.
194 * This is for use in the cycle-tracking and %rep-handling code.
195 * Such structures have `finishes' non-NULL, and `first' NULL. All
196 * others have `finishes' NULL, but `first' may still be NULL if
197 * the line is blank.
199 struct Line {
200 Line *next;
201 MMacro *finishes;
202 Token *first;
206 * To handle an arbitrary level of file inclusion, we maintain a
207 * stack (ie linked list) of these things.
209 struct Include {
210 Include *next;
211 FILE *fp;
212 Cond *conds;
213 Line *expansion;
214 char *fname;
215 int lineno, lineinc;
216 MMacro *mstk; /* stack of active macros/reps */
220 * Include search path. This is simply a list of strings which get
221 * prepended, in turn, to the name of an include file, in an
222 * attempt to find the file if it's not in the current directory.
224 struct IncPath {
225 IncPath *next;
226 char *path;
230 * Conditional assembly: we maintain a separate stack of these for
231 * each level of file inclusion. (The only reason we keep the
232 * stacks separate is to ensure that a stray `%endif' in a file
233 * included from within the true branch of a `%if' won't terminate
234 * it and cause confusion: instead, rightly, it'll cause an error.)
236 struct Cond {
237 Cond *next;
238 int state;
240 enum {
242 * These states are for use just after %if or %elif: IF_TRUE
243 * means the condition has evaluated to truth so we are
244 * currently emitting, whereas IF_FALSE means we are not
245 * currently emitting but will start doing so if a %else comes
246 * up. In these states, all directives are admissible: %elif,
247 * %else and %endif. (And of course %if.)
249 COND_IF_TRUE, COND_IF_FALSE,
251 * These states come up after a %else: ELSE_TRUE means we're
252 * emitting, and ELSE_FALSE means we're not. In ELSE_* states,
253 * any %elif or %else will cause an error.
255 COND_ELSE_TRUE, COND_ELSE_FALSE,
257 * These states mean that we're not emitting now, and also that
258 * nothing until %endif will be emitted at all. COND_DONE is
259 * used when we've had our moment of emission
260 * and have now started seeing %elifs. COND_NEVER is used when
261 * the condition construct in question is contained within a
262 * non-emitting branch of a larger condition construct,
263 * or if there is an error.
265 COND_DONE, COND_NEVER
267 #define emitting(x) ( (x) == COND_IF_TRUE || (x) == COND_ELSE_TRUE )
270 * These defines are used as the possible return values for do_directive
272 #define NO_DIRECTIVE_FOUND 0
273 #define DIRECTIVE_FOUND 1
276 * Condition codes. Note that we use c_ prefix not C_ because C_ is
277 * used in nasm.h for the "real" condition codes. At _this_ level,
278 * we treat CXZ and ECXZ as condition codes, albeit non-invertible
279 * ones, so we need a different enum...
281 static const char * const conditions[] = {
282 "a", "ae", "b", "be", "c", "cxz", "e", "ecxz", "g", "ge", "l", "le",
283 "na", "nae", "nb", "nbe", "nc", "ne", "ng", "nge", "nl", "nle", "no",
284 "np", "ns", "nz", "o", "p", "pe", "po", "rcxz", "s", "z"
286 enum pp_conds {
287 c_A, c_AE, c_B, c_BE, c_C, c_CXZ, c_E, c_ECXZ, c_G, c_GE, c_L, c_LE,
288 c_NA, c_NAE, c_NB, c_NBE, c_NC, c_NE, c_NG, c_NGE, c_NL, c_NLE, c_NO,
289 c_NP, c_NS, c_NZ, c_O, c_P, c_PE, c_PO, c_RCXZ, c_S, c_Z,
290 c_none = -1
292 static const enum pp_conds inverse_ccs[] = {
293 c_NA, c_NAE, c_NB, c_NBE, c_NC, -1, c_NE, -1, c_NG, c_NGE, c_NL, c_NLE,
294 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,
295 c_Z, c_NO, c_NP, c_PO, c_PE, -1, c_NS, c_NZ
299 * Directive names.
301 /* If this is a an IF, ELIF, ELSE or ENDIF keyword */
302 static int is_condition(enum preproc_token arg)
304 return PP_IS_COND(arg) || (arg == PP_ELSE) || (arg == PP_ENDIF);
307 /* For TASM compatibility we need to be able to recognise TASM compatible
308 * conditional compilation directives. Using the NASM pre-processor does
309 * not work, so we look for them specifically from the following list and
310 * then jam in the equivalent NASM directive into the input stream.
313 enum {
314 TM_ARG, TM_ELIF, TM_ELSE, TM_ENDIF, TM_IF, TM_IFDEF, TM_IFDIFI,
315 TM_IFNDEF, TM_INCLUDE, TM_LOCAL
318 static const char * const tasm_directives[] = {
319 "arg", "elif", "else", "endif", "if", "ifdef", "ifdifi",
320 "ifndef", "include", "local"
323 static int StackSize = 4;
324 static char *StackPointer = "ebp";
325 static int ArgOffset = 8;
326 static int LocalOffset = 0;
328 static Context *cstk;
329 static Include *istk;
330 static IncPath *ipath = NULL;
332 static efunc _error; /* Pointer to client-provided error reporting function */
333 static evalfunc evaluate;
335 static int pass; /* HACK: pass 0 = generate dependencies only */
336 static StrList **dephead, **deptail; /* Dependency list */
338 static uint64_t unique; /* unique identifier numbers */
340 static Line *predef = NULL;
341 static bool do_predef;
343 static ListGen *list;
346 * The current set of multi-line macros we have defined.
348 static struct hash_table mmacros;
351 * The current set of single-line macros we have defined.
353 static struct hash_table smacros;
356 * The multi-line macro we are currently defining, or the %rep
357 * block we are currently reading, if any.
359 static MMacro *defining;
361 static uint64_t nested_mac_count;
362 static uint64_t nested_rep_count;
365 * The number of macro parameters to allocate space for at a time.
367 #define PARAM_DELTA 16
370 * The standard macro set: defined in macros.c in the array nasm_stdmac.
371 * This gives our position in the macro set, when we're processing it.
373 static macros_t *stdmacpos;
376 * The extra standard macros that come from the object format, if
377 * any.
379 static macros_t *extrastdmac = NULL;
380 static bool any_extrastdmac;
383 * Tokens are allocated in blocks to improve speed
385 #define TOKEN_BLOCKSIZE 4096
386 static Token *freeTokens = NULL;
387 struct Blocks {
388 Blocks *next;
389 void *chunk;
392 static Blocks blocks = { NULL, NULL };
395 * Forward declarations.
397 static Token *expand_mmac_params(Token * tline);
398 static Token *expand_smacro(Token * tline);
399 static Token *expand_id(Token * tline);
400 static Token *expand_indirect(Token * tline, int level);
401 static Context *get_ctx(const char *name, bool all_contexts);
402 static void make_tok_num(Token * tok, int64_t val);
403 static void error(int severity, const char *fmt, ...);
404 static void error_precond(int severity, const char *fmt, ...);
405 static void *new_Block(size_t size);
406 static void delete_Blocks(void);
407 static Token *new_Token(Token * next, enum pp_token_type type,
408 const char *text, int txtlen);
409 static Token *delete_Token(Token * t);
412 * Macros for safe checking of token pointers, avoid *(NULL)
414 #define tok_type_(x,t) ((x) && (x)->type == (t))
415 #define skip_white_(x) if (tok_type_((x), TOK_WHITESPACE)) (x)=(x)->next
416 #define tok_is_(x,v) (tok_type_((x), TOK_OTHER) && !strcmp((x)->text,(v)))
417 #define tok_isnt_(x,v) ((x) && ((x)->type!=TOK_OTHER || strcmp((x)->text,(v))))
419 /* Handle TASM specific directives, which do not contain a % in
420 * front of them. We do it here because I could not find any other
421 * place to do it for the moment, and it is a hack (ideally it would
422 * be nice to be able to use the NASM pre-processor to do it).
424 static char *check_tasm_directive(char *line)
426 int32_t i, j, k, m, len;
427 char *p = line, *oldline, oldchar;
429 /* Skip whitespace */
430 while (nasm_isspace(*p) && *p != 0)
431 p++;
433 /* Binary search for the directive name */
434 i = -1;
435 j = elements(tasm_directives);
436 len = 0;
437 while (!nasm_isspace(p[len]) && p[len] != 0)
438 len++;
439 if (len) {
440 oldchar = p[len];
441 p[len] = 0;
442 while (j - i > 1) {
443 k = (j + i) / 2;
444 m = nasm_stricmp(p, tasm_directives[k]);
445 if (m == 0) {
446 /* We have found a directive, so jam a % in front of it
447 * so that NASM will then recognise it as one if it's own.
449 p[len] = oldchar;
450 len = strlen(p);
451 oldline = line;
452 line = nasm_malloc(len + 2);
453 line[0] = '%';
454 if (k == TM_IFDIFI) {
455 /* NASM does not recognise IFDIFI, so we convert it to
456 * %ifdef BOGUS. This is not used in NASM comaptible
457 * code, but does need to parse for the TASM macro
458 * package.
460 strcpy(line + 1, "ifdef BOGUS");
461 } else {
462 memcpy(line + 1, p, len + 1);
464 nasm_free(oldline);
465 return line;
466 } else if (m < 0) {
467 j = k;
468 } else
469 i = k;
471 p[len] = oldchar;
473 return line;
477 * The pre-preprocessing stage... This function translates line
478 * number indications as they emerge from GNU cpp (`# lineno "file"
479 * flags') into NASM preprocessor line number indications (`%line
480 * lineno file').
482 static char *prepreproc(char *line)
484 int lineno, fnlen;
485 char *fname, *oldline;
487 if (line[0] == '#' && line[1] == ' ') {
488 oldline = line;
489 fname = oldline + 2;
490 lineno = atoi(fname);
491 fname += strspn(fname, "0123456789 ");
492 if (*fname == '"')
493 fname++;
494 fnlen = strcspn(fname, "\"");
495 line = nasm_malloc(20 + fnlen);
496 snprintf(line, 20 + fnlen, "%%line %d %.*s", lineno, fnlen, fname);
497 nasm_free(oldline);
499 if (tasm_compatible_mode)
500 return check_tasm_directive(line);
501 return line;
505 * Free a linked list of tokens.
507 static void free_tlist(Token * list)
509 while (list) {
510 list = delete_Token(list);
515 * Free a linked list of lines.
517 static void free_llist(Line * list)
519 Line *l;
520 while (list) {
521 l = list;
522 list = list->next;
523 free_tlist(l->first);
524 nasm_free(l);
529 * Free an MMacro
531 static void free_mmacro(MMacro * m)
533 nasm_free(m->name);
534 free_tlist(m->dlist);
535 nasm_free(m->defaults);
536 free_llist(m->expansion);
537 nasm_free(m);
541 * Free all currently defined macros, and free the hash tables
543 static void free_smacro_table(struct hash_table *smt)
545 SMacro *s;
546 const char *key;
547 struct hash_tbl_node *it = NULL;
549 while ((s = hash_iterate(smt, &it, &key)) != NULL) {
550 nasm_free((void *)key);
551 while (s) {
552 SMacro *ns = s->next;
553 nasm_free(s->name);
554 free_tlist(s->expansion);
555 nasm_free(s);
556 s = ns;
559 hash_free(smt);
562 static void free_mmacro_table(struct hash_table *mmt)
564 MMacro *m;
565 const char *key;
566 struct hash_tbl_node *it = NULL;
568 it = NULL;
569 while ((m = hash_iterate(mmt, &it, &key)) != NULL) {
570 nasm_free((void *)key);
571 while (m) {
572 MMacro *nm = m->next;
573 free_mmacro(m);
574 m = nm;
577 hash_free(mmt);
580 static void free_macros(void)
582 free_smacro_table(&smacros);
583 free_mmacro_table(&mmacros);
587 * Initialize the hash tables
589 static void init_macros(void)
591 hash_init(&smacros, HASH_LARGE);
592 hash_init(&mmacros, HASH_LARGE);
596 * Pop the context stack.
598 static void ctx_pop(void)
600 Context *c = cstk;
602 cstk = cstk->next;
603 free_smacro_table(&c->localmac);
604 nasm_free(c->name);
605 nasm_free(c);
609 * Search for a key in the hash index; adding it if necessary
610 * (in which case we initialize the data pointer to NULL.)
612 static void **
613 hash_findi_add(struct hash_table *hash, const char *str)
615 struct hash_insert hi;
616 void **r;
617 char *strx;
619 r = hash_findi(hash, str, &hi);
620 if (r)
621 return r;
623 strx = nasm_strdup(str); /* Use a more efficient allocator here? */
624 return hash_add(&hi, strx, NULL);
628 * Like hash_findi, but returns the data element rather than a pointer
629 * to it. Used only when not adding a new element, hence no third
630 * argument.
632 static void *
633 hash_findix(struct hash_table *hash, const char *str)
635 void **p;
637 p = hash_findi(hash, str, NULL);
638 return p ? *p : NULL;
641 #define BUF_DELTA 512
643 * Read a line from the top file in istk, handling multiple CR/LFs
644 * at the end of the line read, and handling spurious ^Zs. Will
645 * return lines from the standard macro set if this has not already
646 * been done.
648 static char *read_line(void)
650 char *buffer, *p, *q;
651 int bufsize, continued_count;
653 if (stdmacpos) {
654 unsigned char c;
655 const unsigned char *p = stdmacpos;
656 char *ret, *q;
657 size_t len = 0;
658 while ((c = *p++)) {
659 if (c >= 0x80)
660 len += pp_directives_len[c-0x80]+1;
661 else
662 len++;
664 ret = nasm_malloc(len+1);
665 q = ret;
666 while ((c = *stdmacpos++)) {
667 if (c >= 0x80) {
668 memcpy(q, pp_directives[c-0x80], pp_directives_len[c-0x80]);
669 q += pp_directives_len[c-0x80];
670 *q++ = ' ';
671 } else {
672 *q++ = c;
675 stdmacpos = p;
676 *q = '\0';
678 if (!*stdmacpos) {
679 /* This was the last of the standard macro chain... */
680 stdmacpos = NULL;
681 if (any_extrastdmac) {
682 stdmacpos = extrastdmac;
683 any_extrastdmac = false;
684 } else if (do_predef) {
685 Line *pd, *l;
686 Token *head, **tail, *t;
689 * Nasty hack: here we push the contents of
690 * `predef' on to the top-level expansion stack,
691 * since this is the most convenient way to
692 * implement the pre-include and pre-define
693 * features.
695 for (pd = predef; pd; pd = pd->next) {
696 head = NULL;
697 tail = &head;
698 for (t = pd->first; t; t = t->next) {
699 *tail = new_Token(NULL, t->type, t->text, 0);
700 tail = &(*tail)->next;
702 l = nasm_malloc(sizeof(Line));
703 l->next = istk->expansion;
704 l->first = head;
705 l->finishes = NULL;
706 istk->expansion = l;
708 do_predef = false;
711 return ret;
714 bufsize = BUF_DELTA;
715 buffer = nasm_malloc(BUF_DELTA);
716 p = buffer;
717 continued_count = 0;
718 while (1) {
719 q = fgets(p, bufsize - (p - buffer), istk->fp);
720 if (!q)
721 break;
722 p += strlen(p);
723 if (p > buffer && p[-1] == '\n') {
724 /* Convert backslash-CRLF line continuation sequences into
725 nothing at all (for DOS and Windows) */
726 if (((p - 2) > buffer) && (p[-3] == '\\') && (p[-2] == '\r')) {
727 p -= 3;
728 *p = 0;
729 continued_count++;
731 /* Also convert backslash-LF line continuation sequences into
732 nothing at all (for Unix) */
733 else if (((p - 1) > buffer) && (p[-2] == '\\')) {
734 p -= 2;
735 *p = 0;
736 continued_count++;
737 } else {
738 break;
741 if (p - buffer > bufsize - 10) {
742 int32_t offset = p - buffer;
743 bufsize += BUF_DELTA;
744 buffer = nasm_realloc(buffer, bufsize);
745 p = buffer + offset; /* prevent stale-pointer problems */
749 if (!q && p == buffer) {
750 nasm_free(buffer);
751 return NULL;
754 src_set_linnum(src_get_linnum() + istk->lineinc +
755 (continued_count * istk->lineinc));
758 * Play safe: remove CRs as well as LFs, if any of either are
759 * present at the end of the line.
761 while (--p >= buffer && (*p == '\n' || *p == '\r'))
762 *p = '\0';
765 * Handle spurious ^Z, which may be inserted into source files
766 * by some file transfer utilities.
768 buffer[strcspn(buffer, "\032")] = '\0';
770 list->line(LIST_READ, buffer);
772 return buffer;
776 * Tokenize a line of text. This is a very simple process since we
777 * don't need to parse the value out of e.g. numeric tokens: we
778 * simply split one string into many.
780 static Token *tokenize(char *line)
782 char c, *p = line;
783 enum pp_token_type type;
784 Token *list = NULL;
785 Token *t, **tail = &list;
787 while (*line) {
788 p = line;
789 if (*p == '%') {
790 p++;
791 if (nasm_isdigit(*p) ||
792 ((*p == '-' || *p == '+') && nasm_isdigit(p[1])) ||
793 ((*p == '+') && (nasm_isspace(p[1]) || !p[1]))) {
794 do {
795 p++;
797 while (nasm_isdigit(*p));
798 type = TOK_PREPROC_ID;
799 } else if (*p == '{') {
800 p++;
801 while (*p && *p != '}') {
802 p[-1] = *p;
803 p++;
805 p[-1] = '\0';
806 if (*p)
807 p++;
808 type = TOK_PREPROC_ID;
809 } else if (*p == '[') {
810 int lvl = 1;
811 line += 2; /* Skip the leading %[ */
812 p++;
813 while (lvl && (c = *p++)) {
814 switch (c) {
815 case ']':
816 lvl--;
817 break;
818 case '%':
819 if (*p == '[')
820 lvl++;
821 break;
822 case '\'':
823 case '\"':
824 case '`':
825 p = nasm_skip_string(p)+1;
826 break;
827 default:
828 break;
831 p--;
832 if (*p)
833 *p++ = '\0';
834 if (lvl)
835 error(ERR_NONFATAL, "unterminated %[ construct");
836 type = TOK_INDIRECT;
837 } else if (*p == '?') {
838 type = TOK_PREPROC_Q; /* %? */
839 p++;
840 if (*p == '?') {
841 type = TOK_PREPROC_QQ; /* %?? */
842 p++;
844 } else if (isidchar(*p) ||
845 ((*p == '!' || *p == '%' || *p == '$') &&
846 isidchar(p[1]))) {
847 do {
848 p++;
850 while (isidchar(*p));
851 type = TOK_PREPROC_ID;
852 } else {
853 type = TOK_OTHER;
854 if (*p == '%')
855 p++;
857 } else if (isidstart(*p) || (*p == '$' && isidstart(p[1]))) {
858 type = TOK_ID;
859 p++;
860 while (*p && isidchar(*p))
861 p++;
862 } else if (*p == '\'' || *p == '"' || *p == '`') {
864 * A string token.
866 type = TOK_STRING;
867 p = nasm_skip_string(p);
869 if (*p) {
870 p++;
871 } else {
872 error(ERR_WARNING|ERR_PASS1, "unterminated string");
873 /* Handling unterminated strings by UNV */
874 /* type = -1; */
876 } else if (isnumstart(*p)) {
877 bool is_hex = false;
878 bool is_float = false;
879 bool has_e = false;
880 char c, *r;
883 * A numeric token.
886 if (*p == '$') {
887 p++;
888 is_hex = true;
891 for (;;) {
892 c = *p++;
894 if (!is_hex && (c == 'e' || c == 'E')) {
895 has_e = true;
896 if (*p == '+' || *p == '-') {
897 /* e can only be followed by +/- if it is either a
898 prefixed hex number or a floating-point number */
899 p++;
900 is_float = true;
902 } else if (c == 'H' || c == 'h' || c == 'X' || c == 'x') {
903 is_hex = true;
904 } else if (c == 'P' || c == 'p') {
905 is_float = true;
906 if (*p == '+' || *p == '-')
907 p++;
908 } else if (isnumchar(c) || c == '_')
909 ; /* just advance */
910 else if (c == '.') {
911 /* we need to deal with consequences of the legacy
912 parser, like "1.nolist" being two tokens
913 (TOK_NUMBER, TOK_ID) here; at least give it
914 a shot for now. In the future, we probably need
915 a flex-based scanner with proper pattern matching
916 to do it as well as it can be done. Nothing in
917 the world is going to help the person who wants
918 0x123.p16 interpreted as two tokens, though. */
919 r = p;
920 while (*r == '_')
921 r++;
923 if (nasm_isdigit(*r) || (is_hex && nasm_isxdigit(*r)) ||
924 (!is_hex && (*r == 'e' || *r == 'E')) ||
925 (*r == 'p' || *r == 'P')) {
926 p = r;
927 is_float = true;
928 } else
929 break; /* Terminate the token */
930 } else
931 break;
933 p--; /* Point to first character beyond number */
935 if (has_e && !is_hex) {
936 /* 1e13 is floating-point, but 1e13h is not */
937 is_float = true;
940 type = is_float ? TOK_FLOAT : TOK_NUMBER;
941 } else if (nasm_isspace(*p)) {
942 type = TOK_WHITESPACE;
943 p++;
944 while (*p && nasm_isspace(*p))
945 p++;
947 * Whitespace just before end-of-line is discarded by
948 * pretending it's a comment; whitespace just before a
949 * comment gets lumped into the comment.
951 if (!*p || *p == ';') {
952 type = TOK_COMMENT;
953 while (*p)
954 p++;
956 } else if (*p == ';') {
957 type = TOK_COMMENT;
958 while (*p)
959 p++;
960 } else {
962 * Anything else is an operator of some kind. We check
963 * for all the double-character operators (>>, <<, //,
964 * %%, <=, >=, ==, !=, <>, &&, ||, ^^), but anything
965 * else is a single-character operator.
967 type = TOK_OTHER;
968 if ((p[0] == '>' && p[1] == '>') ||
969 (p[0] == '<' && p[1] == '<') ||
970 (p[0] == '/' && p[1] == '/') ||
971 (p[0] == '<' && p[1] == '=') ||
972 (p[0] == '>' && p[1] == '=') ||
973 (p[0] == '=' && p[1] == '=') ||
974 (p[0] == '!' && p[1] == '=') ||
975 (p[0] == '<' && p[1] == '>') ||
976 (p[0] == '&' && p[1] == '&') ||
977 (p[0] == '|' && p[1] == '|') ||
978 (p[0] == '^' && p[1] == '^')) {
979 p++;
981 p++;
984 /* Handling unterminated string by UNV */
985 /*if (type == -1)
987 *tail = t = new_Token(NULL, TOK_STRING, line, p-line+1);
988 t->text[p-line] = *line;
989 tail = &t->next;
991 else */
992 if (type != TOK_COMMENT) {
993 *tail = t = new_Token(NULL, type, line, p - line);
994 tail = &t->next;
996 line = p;
998 return list;
1002 * this function allocates a new managed block of memory and
1003 * returns a pointer to the block. The managed blocks are
1004 * deleted only all at once by the delete_Blocks function.
1006 static void *new_Block(size_t size)
1008 Blocks *b = &blocks;
1010 /* first, get to the end of the linked list */
1011 while (b->next)
1012 b = b->next;
1013 /* now allocate the requested chunk */
1014 b->chunk = nasm_malloc(size);
1016 /* now allocate a new block for the next request */
1017 b->next = nasm_malloc(sizeof(Blocks));
1018 /* and initialize the contents of the new block */
1019 b->next->next = NULL;
1020 b->next->chunk = NULL;
1021 return b->chunk;
1025 * this function deletes all managed blocks of memory
1027 static void delete_Blocks(void)
1029 Blocks *a, *b = &blocks;
1032 * keep in mind that the first block, pointed to by blocks
1033 * is a static and not dynamically allocated, so we don't
1034 * free it.
1036 while (b) {
1037 if (b->chunk)
1038 nasm_free(b->chunk);
1039 a = b;
1040 b = b->next;
1041 if (a != &blocks)
1042 nasm_free(a);
1047 * this function creates a new Token and passes a pointer to it
1048 * back to the caller. It sets the type and text elements, and
1049 * also the a.mac and next elements to NULL.
1051 static Token *new_Token(Token * next, enum pp_token_type type,
1052 const char *text, int txtlen)
1054 Token *t;
1055 int i;
1057 if (freeTokens == NULL) {
1058 freeTokens = (Token *) new_Block(TOKEN_BLOCKSIZE * sizeof(Token));
1059 for (i = 0; i < TOKEN_BLOCKSIZE - 1; i++)
1060 freeTokens[i].next = &freeTokens[i + 1];
1061 freeTokens[i].next = NULL;
1063 t = freeTokens;
1064 freeTokens = t->next;
1065 t->next = next;
1066 t->a.mac = NULL;
1067 t->type = type;
1068 if (type == TOK_WHITESPACE || text == NULL) {
1069 t->text = NULL;
1070 } else {
1071 if (txtlen == 0)
1072 txtlen = strlen(text);
1073 t->text = nasm_malloc(txtlen+1);
1074 memcpy(t->text, text, txtlen);
1075 t->text[txtlen] = '\0';
1077 return t;
1080 static Token *delete_Token(Token * t)
1082 Token *next = t->next;
1083 nasm_free(t->text);
1084 t->next = freeTokens;
1085 freeTokens = t;
1086 return next;
1090 * Convert a line of tokens back into text.
1091 * If expand_locals is not zero, identifiers of the form "%$*xxx"
1092 * will be transformed into ..@ctxnum.xxx
1094 static char *detoken(Token * tlist, bool expand_locals)
1096 Token *t;
1097 int len;
1098 char *line, *p;
1099 const char *q;
1101 len = 0;
1102 for (t = tlist; t; t = t->next) {
1103 if (t->type == TOK_PREPROC_ID && t->text[1] == '!') {
1104 char *p = getenv(t->text + 2);
1105 nasm_free(t->text);
1106 if (p)
1107 t->text = nasm_strdup(p);
1108 else
1109 t->text = NULL;
1111 /* Expand local macros here and not during preprocessing */
1112 if (expand_locals &&
1113 t->type == TOK_PREPROC_ID && t->text &&
1114 t->text[0] == '%' && t->text[1] == '$') {
1115 Context *ctx = get_ctx(t->text, false);
1116 if (ctx) {
1117 char buffer[40];
1118 char *p, *q = t->text + 2;
1120 q += strspn(q, "$");
1121 snprintf(buffer, sizeof(buffer), "..@%"PRIu32".", ctx->number);
1122 p = nasm_strcat(buffer, q);
1123 nasm_free(t->text);
1124 t->text = p;
1127 if (t->type == TOK_WHITESPACE) {
1128 len++;
1129 } else if (t->text) {
1130 len += strlen(t->text);
1133 p = line = nasm_malloc(len + 1);
1134 for (t = tlist; t; t = t->next) {
1135 if (t->type == TOK_WHITESPACE) {
1136 *p++ = ' ';
1137 } else if (t->text) {
1138 q = t->text;
1139 while (*q)
1140 *p++ = *q++;
1143 *p = '\0';
1144 return line;
1148 * A scanner, suitable for use by the expression evaluator, which
1149 * operates on a line of Tokens. Expects a pointer to a pointer to
1150 * the first token in the line to be passed in as its private_data
1151 * field.
1153 * FIX: This really needs to be unified with stdscan.
1155 static int ppscan(void *private_data, struct tokenval *tokval)
1157 Token **tlineptr = private_data;
1158 Token *tline;
1159 char ourcopy[MAX_KEYWORD+1], *p, *r, *s;
1161 do {
1162 tline = *tlineptr;
1163 *tlineptr = tline ? tline->next : NULL;
1165 while (tline && (tline->type == TOK_WHITESPACE ||
1166 tline->type == TOK_COMMENT));
1168 if (!tline)
1169 return tokval->t_type = TOKEN_EOS;
1171 tokval->t_charptr = tline->text;
1173 if (tline->text[0] == '$' && !tline->text[1])
1174 return tokval->t_type = TOKEN_HERE;
1175 if (tline->text[0] == '$' && tline->text[1] == '$' && !tline->text[2])
1176 return tokval->t_type = TOKEN_BASE;
1178 if (tline->type == TOK_ID) {
1179 p = tokval->t_charptr = tline->text;
1180 if (p[0] == '$') {
1181 tokval->t_charptr++;
1182 return tokval->t_type = TOKEN_ID;
1185 for (r = p, s = ourcopy; *r; r++) {
1186 if (r >= p+MAX_KEYWORD)
1187 return tokval->t_type = TOKEN_ID; /* Not a keyword */
1188 *s++ = nasm_tolower(*r);
1190 *s = '\0';
1191 /* right, so we have an identifier sitting in temp storage. now,
1192 * is it actually a register or instruction name, or what? */
1193 return nasm_token_hash(ourcopy, tokval);
1196 if (tline->type == TOK_NUMBER) {
1197 bool rn_error;
1198 tokval->t_integer = readnum(tline->text, &rn_error);
1199 tokval->t_charptr = tline->text;
1200 if (rn_error)
1201 return tokval->t_type = TOKEN_ERRNUM;
1202 else
1203 return tokval->t_type = TOKEN_NUM;
1206 if (tline->type == TOK_FLOAT) {
1207 return tokval->t_type = TOKEN_FLOAT;
1210 if (tline->type == TOK_STRING) {
1211 char bq, *ep;
1213 bq = tline->text[0];
1214 tokval->t_charptr = tline->text;
1215 tokval->t_inttwo = nasm_unquote(tline->text, &ep);
1217 if (ep[0] != bq || ep[1] != '\0')
1218 return tokval->t_type = TOKEN_ERRSTR;
1219 else
1220 return tokval->t_type = TOKEN_STR;
1223 if (tline->type == TOK_OTHER) {
1224 if (!strcmp(tline->text, "<<"))
1225 return tokval->t_type = TOKEN_SHL;
1226 if (!strcmp(tline->text, ">>"))
1227 return tokval->t_type = TOKEN_SHR;
1228 if (!strcmp(tline->text, "//"))
1229 return tokval->t_type = TOKEN_SDIV;
1230 if (!strcmp(tline->text, "%%"))
1231 return tokval->t_type = TOKEN_SMOD;
1232 if (!strcmp(tline->text, "=="))
1233 return tokval->t_type = TOKEN_EQ;
1234 if (!strcmp(tline->text, "<>"))
1235 return tokval->t_type = TOKEN_NE;
1236 if (!strcmp(tline->text, "!="))
1237 return tokval->t_type = TOKEN_NE;
1238 if (!strcmp(tline->text, "<="))
1239 return tokval->t_type = TOKEN_LE;
1240 if (!strcmp(tline->text, ">="))
1241 return tokval->t_type = TOKEN_GE;
1242 if (!strcmp(tline->text, "&&"))
1243 return tokval->t_type = TOKEN_DBL_AND;
1244 if (!strcmp(tline->text, "^^"))
1245 return tokval->t_type = TOKEN_DBL_XOR;
1246 if (!strcmp(tline->text, "||"))
1247 return tokval->t_type = TOKEN_DBL_OR;
1251 * We have no other options: just return the first character of
1252 * the token text.
1254 return tokval->t_type = tline->text[0];
1258 * Compare a string to the name of an existing macro; this is a
1259 * simple wrapper which calls either strcmp or nasm_stricmp
1260 * depending on the value of the `casesense' parameter.
1262 static int mstrcmp(const char *p, const char *q, bool casesense)
1264 return casesense ? strcmp(p, q) : nasm_stricmp(p, q);
1268 * Compare a string to the name of an existing macro; this is a
1269 * simple wrapper which calls either strcmp or nasm_stricmp
1270 * depending on the value of the `casesense' parameter.
1272 static int mmemcmp(const char *p, const char *q, size_t l, bool casesense)
1274 return casesense ? memcmp(p, q, l) : nasm_memicmp(p, q, l);
1278 * Return the Context structure associated with a %$ token. Return
1279 * NULL, having _already_ reported an error condition, if the
1280 * context stack isn't deep enough for the supplied number of $
1281 * signs.
1282 * If all_contexts == true, contexts that enclose current are
1283 * also scanned for such smacro, until it is found; if not -
1284 * only the context that directly results from the number of $'s
1285 * in variable's name.
1287 static Context *get_ctx(const char *name, bool all_contexts)
1289 Context *ctx;
1290 SMacro *m;
1291 int i;
1293 if (!name || name[0] != '%' || name[1] != '$')
1294 return NULL;
1296 if (!cstk) {
1297 error(ERR_NONFATAL, "`%s': context stack is empty", name);
1298 return NULL;
1301 for (i = strspn(name + 2, "$"), ctx = cstk; (i > 0) && ctx; i--) {
1302 ctx = ctx->next;
1303 /* i--; Lino - 02/25/02 */
1305 if (!ctx) {
1306 error(ERR_NONFATAL, "`%s': context stack is only"
1307 " %d level%s deep", name, i - 1, (i == 2 ? "" : "s"));
1308 return NULL;
1310 if (!all_contexts)
1311 return ctx;
1313 do {
1314 /* Search for this smacro in found context */
1315 m = hash_findix(&ctx->localmac, name);
1316 while (m) {
1317 if (!mstrcmp(m->name, name, m->casesense))
1318 return ctx;
1319 m = m->next;
1321 ctx = ctx->next;
1323 while (ctx);
1324 return NULL;
1328 * Check to see if a file is already in a string list
1330 static bool in_list(const StrList *list, const char *str)
1332 while (list) {
1333 if (!strcmp(list->str, str))
1334 return true;
1335 list = list->next;
1337 return false;
1341 * Open an include file. This routine must always return a valid
1342 * file pointer if it returns - it's responsible for throwing an
1343 * ERR_FATAL and bombing out completely if not. It should also try
1344 * the include path one by one until it finds the file or reaches
1345 * the end of the path.
1347 static FILE *inc_fopen(const char *file, StrList **dhead, StrList ***dtail,
1348 bool missing_ok)
1350 FILE *fp;
1351 char *prefix = "";
1352 IncPath *ip = ipath;
1353 int len = strlen(file);
1354 size_t prefix_len = 0;
1355 StrList *sl;
1357 while (1) {
1358 sl = nasm_malloc(prefix_len+len+1+sizeof sl->next);
1359 memcpy(sl->str, prefix, prefix_len);
1360 memcpy(sl->str+prefix_len, file, len+1);
1361 fp = fopen(sl->str, "r");
1362 if (fp && dhead && !in_list(*dhead, sl->str)) {
1363 sl->next = NULL;
1364 **dtail = sl;
1365 *dtail = &sl->next;
1366 } else {
1367 nasm_free(sl);
1369 if (fp)
1370 return fp;
1371 if (!ip) {
1372 if (!missing_ok)
1373 break;
1374 prefix = NULL;
1375 } else {
1376 prefix = ip->path;
1377 ip = ip->next;
1379 if (prefix) {
1380 prefix_len = strlen(prefix);
1381 } else {
1382 /* -MG given and file not found */
1383 if (dhead && !in_list(*dhead, file)) {
1384 sl = nasm_malloc(len+1+sizeof sl->next);
1385 sl->next = NULL;
1386 strcpy(sl->str, file);
1387 **dtail = sl;
1388 *dtail = &sl->next;
1390 return NULL;
1394 error(ERR_FATAL, "unable to open include file `%s'", file);
1395 return NULL; /* never reached - placate compilers */
1399 * Determine if we should warn on defining a single-line macro of
1400 * name `name', with `nparam' parameters. If nparam is 0 or -1, will
1401 * return true if _any_ single-line macro of that name is defined.
1402 * Otherwise, will return true if a single-line macro with either
1403 * `nparam' or no parameters is defined.
1405 * If a macro with precisely the right number of parameters is
1406 * defined, or nparam is -1, the address of the definition structure
1407 * will be returned in `defn'; otherwise NULL will be returned. If `defn'
1408 * is NULL, no action will be taken regarding its contents, and no
1409 * error will occur.
1411 * Note that this is also called with nparam zero to resolve
1412 * `ifdef'.
1414 * If you already know which context macro belongs to, you can pass
1415 * the context pointer as first parameter; if you won't but name begins
1416 * with %$ the context will be automatically computed. If all_contexts
1417 * is true, macro will be searched in outer contexts as well.
1419 static bool
1420 smacro_defined(Context * ctx, const char *name, int nparam, SMacro ** defn,
1421 bool nocase)
1423 struct hash_table *smtbl;
1424 SMacro *m;
1426 if (ctx) {
1427 smtbl = &ctx->localmac;
1428 } else if (name[0] == '%' && name[1] == '$') {
1429 if (cstk)
1430 ctx = get_ctx(name, false);
1431 if (!ctx)
1432 return false; /* got to return _something_ */
1433 smtbl = &ctx->localmac;
1434 } else {
1435 smtbl = &smacros;
1437 m = (SMacro *) hash_findix(smtbl, name);
1439 while (m) {
1440 if (!mstrcmp(m->name, name, m->casesense && nocase) &&
1441 (nparam <= 0 || m->nparam == 0 || nparam == (int) m->nparam)) {
1442 if (defn) {
1443 if (nparam == (int) m->nparam || nparam == -1)
1444 *defn = m;
1445 else
1446 *defn = NULL;
1448 return true;
1450 m = m->next;
1453 return false;
1457 * Count and mark off the parameters in a multi-line macro call.
1458 * This is called both from within the multi-line macro expansion
1459 * code, and also to mark off the default parameters when provided
1460 * in a %macro definition line.
1462 static void count_mmac_params(Token * t, int *nparam, Token *** params)
1464 int paramsize, brace;
1466 *nparam = paramsize = 0;
1467 *params = NULL;
1468 while (t) {
1469 /* +1: we need space for the final NULL */
1470 if (*nparam+1 >= paramsize) {
1471 paramsize += PARAM_DELTA;
1472 *params = nasm_realloc(*params, sizeof(**params) * paramsize);
1474 skip_white_(t);
1475 brace = false;
1476 if (tok_is_(t, "{"))
1477 brace = true;
1478 (*params)[(*nparam)++] = t;
1479 while (tok_isnt_(t, brace ? "}" : ","))
1480 t = t->next;
1481 if (t) { /* got a comma/brace */
1482 t = t->next;
1483 if (brace) {
1485 * Now we've found the closing brace, look further
1486 * for the comma.
1488 skip_white_(t);
1489 if (tok_isnt_(t, ",")) {
1490 error(ERR_NONFATAL,
1491 "braces do not enclose all of macro parameter");
1492 while (tok_isnt_(t, ","))
1493 t = t->next;
1495 if (t)
1496 t = t->next; /* eat the comma */
1503 * Determine whether one of the various `if' conditions is true or
1504 * not.
1506 * We must free the tline we get passed.
1508 static bool if_condition(Token * tline, enum preproc_token ct)
1510 enum pp_conditional i = PP_COND(ct);
1511 bool j;
1512 Token *t, *tt, **tptr, *origline;
1513 struct tokenval tokval;
1514 expr *evalresult;
1515 enum pp_token_type needtype;
1517 origline = tline;
1519 switch (i) {
1520 case PPC_IFCTX:
1521 j = false; /* have we matched yet? */
1522 while (true) {
1523 skip_white_(tline);
1524 if (!tline)
1525 break;
1526 if (tline->type != TOK_ID) {
1527 error(ERR_NONFATAL,
1528 "`%s' expects context identifiers", pp_directives[ct]);
1529 free_tlist(origline);
1530 return -1;
1532 if (cstk && cstk->name && !nasm_stricmp(tline->text, cstk->name))
1533 j = true;
1534 tline = tline->next;
1536 break;
1538 case PPC_IFDEF:
1539 j = false; /* have we matched yet? */
1540 while (tline) {
1541 skip_white_(tline);
1542 if (!tline || (tline->type != TOK_ID &&
1543 (tline->type != TOK_PREPROC_ID ||
1544 tline->text[1] != '$'))) {
1545 error(ERR_NONFATAL,
1546 "`%s' expects macro identifiers", pp_directives[ct]);
1547 goto fail;
1549 if (smacro_defined(NULL, tline->text, 0, NULL, true))
1550 j = true;
1551 tline = tline->next;
1553 break;
1555 case PPC_IFIDN:
1556 case PPC_IFIDNI:
1557 tline = expand_smacro(tline);
1558 t = tt = tline;
1559 while (tok_isnt_(tt, ","))
1560 tt = tt->next;
1561 if (!tt) {
1562 error(ERR_NONFATAL,
1563 "`%s' expects two comma-separated arguments",
1564 pp_directives[ct]);
1565 goto fail;
1567 tt = tt->next;
1568 j = true; /* assume equality unless proved not */
1569 while ((t->type != TOK_OTHER || strcmp(t->text, ",")) && tt) {
1570 if (tt->type == TOK_OTHER && !strcmp(tt->text, ",")) {
1571 error(ERR_NONFATAL, "`%s': more than one comma on line",
1572 pp_directives[ct]);
1573 goto fail;
1575 if (t->type == TOK_WHITESPACE) {
1576 t = t->next;
1577 continue;
1579 if (tt->type == TOK_WHITESPACE) {
1580 tt = tt->next;
1581 continue;
1583 if (tt->type != t->type) {
1584 j = false; /* found mismatching tokens */
1585 break;
1587 /* When comparing strings, need to unquote them first */
1588 if (t->type == TOK_STRING) {
1589 size_t l1 = nasm_unquote(t->text, NULL);
1590 size_t l2 = nasm_unquote(tt->text, NULL);
1592 if (l1 != l2) {
1593 j = false;
1594 break;
1596 if (mmemcmp(t->text, tt->text, l1, i == PPC_IFIDN)) {
1597 j = false;
1598 break;
1600 } else if (mstrcmp(tt->text, t->text, i == PPC_IFIDN) != 0) {
1601 j = false; /* found mismatching tokens */
1602 break;
1605 t = t->next;
1606 tt = tt->next;
1608 if ((t->type != TOK_OTHER || strcmp(t->text, ",")) || tt)
1609 j = false; /* trailing gunk on one end or other */
1610 break;
1612 case PPC_IFMACRO:
1614 bool found = false;
1615 MMacro searching, *mmac;
1617 tline = tline->next;
1618 skip_white_(tline);
1619 tline = expand_id(tline);
1620 if (!tok_type_(tline, TOK_ID)) {
1621 error(ERR_NONFATAL,
1622 "`%s' expects a macro name", pp_directives[ct]);
1623 goto fail;
1625 searching.name = nasm_strdup(tline->text);
1626 searching.casesense = true;
1627 searching.plus = false;
1628 searching.nolist = false;
1629 searching.in_progress = 0;
1630 searching.rep_nest = NULL;
1631 searching.nparam_min = 0;
1632 searching.nparam_max = INT_MAX;
1633 tline = expand_smacro(tline->next);
1634 skip_white_(tline);
1635 if (!tline) {
1636 } else if (!tok_type_(tline, TOK_NUMBER)) {
1637 error(ERR_NONFATAL,
1638 "`%s' expects a parameter count or nothing",
1639 pp_directives[ct]);
1640 } else {
1641 searching.nparam_min = searching.nparam_max =
1642 readnum(tline->text, &j);
1643 if (j)
1644 error(ERR_NONFATAL,
1645 "unable to parse parameter count `%s'",
1646 tline->text);
1648 if (tline && tok_is_(tline->next, "-")) {
1649 tline = tline->next->next;
1650 if (tok_is_(tline, "*"))
1651 searching.nparam_max = INT_MAX;
1652 else if (!tok_type_(tline, TOK_NUMBER))
1653 error(ERR_NONFATAL,
1654 "`%s' expects a parameter count after `-'",
1655 pp_directives[ct]);
1656 else {
1657 searching.nparam_max = readnum(tline->text, &j);
1658 if (j)
1659 error(ERR_NONFATAL,
1660 "unable to parse parameter count `%s'",
1661 tline->text);
1662 if (searching.nparam_min > searching.nparam_max)
1663 error(ERR_NONFATAL,
1664 "minimum parameter count exceeds maximum");
1667 if (tline && tok_is_(tline->next, "+")) {
1668 tline = tline->next;
1669 searching.plus = true;
1671 mmac = (MMacro *) hash_findix(&mmacros, searching.name);
1672 while (mmac) {
1673 if (!strcmp(mmac->name, searching.name) &&
1674 (mmac->nparam_min <= searching.nparam_max
1675 || searching.plus)
1676 && (searching.nparam_min <= mmac->nparam_max
1677 || mmac->plus)) {
1678 found = true;
1679 break;
1681 mmac = mmac->next;
1683 if(tline && tline->next)
1684 error(ERR_WARNING|ERR_PASS1,
1685 "trailing garbage after %%ifmacro ignored");
1686 nasm_free(searching.name);
1687 j = found;
1688 break;
1691 case PPC_IFID:
1692 needtype = TOK_ID;
1693 goto iftype;
1694 case PPC_IFNUM:
1695 needtype = TOK_NUMBER;
1696 goto iftype;
1697 case PPC_IFSTR:
1698 needtype = TOK_STRING;
1699 goto iftype;
1701 iftype:
1702 t = tline = expand_smacro(tline);
1704 while (tok_type_(t, TOK_WHITESPACE) ||
1705 (needtype == TOK_NUMBER &&
1706 tok_type_(t, TOK_OTHER) &&
1707 (t->text[0] == '-' || t->text[0] == '+') &&
1708 !t->text[1]))
1709 t = t->next;
1711 j = tok_type_(t, needtype);
1712 break;
1714 case PPC_IFTOKEN:
1715 t = tline = expand_smacro(tline);
1716 while (tok_type_(t, TOK_WHITESPACE))
1717 t = t->next;
1719 j = false;
1720 if (t) {
1721 t = t->next; /* Skip the actual token */
1722 while (tok_type_(t, TOK_WHITESPACE))
1723 t = t->next;
1724 j = !t; /* Should be nothing left */
1726 break;
1728 case PPC_IFEMPTY:
1729 t = tline = expand_smacro(tline);
1730 while (tok_type_(t, TOK_WHITESPACE))
1731 t = t->next;
1733 j = !t; /* Should be empty */
1734 break;
1736 case PPC_IF:
1737 t = tline = expand_smacro(tline);
1738 tptr = &t;
1739 tokval.t_type = TOKEN_INVALID;
1740 evalresult = evaluate(ppscan, tptr, &tokval,
1741 NULL, pass | CRITICAL, error, NULL);
1742 if (!evalresult)
1743 return -1;
1744 if (tokval.t_type)
1745 error(ERR_WARNING|ERR_PASS1,
1746 "trailing garbage after expression ignored");
1747 if (!is_simple(evalresult)) {
1748 error(ERR_NONFATAL,
1749 "non-constant value given to `%s'", pp_directives[ct]);
1750 goto fail;
1752 j = reloc_value(evalresult) != 0;
1753 break;
1755 default:
1756 error(ERR_FATAL,
1757 "preprocessor directive `%s' not yet implemented",
1758 pp_directives[ct]);
1759 goto fail;
1762 free_tlist(origline);
1763 return j ^ PP_NEGATIVE(ct);
1765 fail:
1766 free_tlist(origline);
1767 return -1;
1771 * Common code for defining an smacro
1773 static bool define_smacro(Context *ctx, char *mname, bool casesense,
1774 int nparam, Token *expansion)
1776 SMacro *smac, **smhead;
1777 struct hash_table *smtbl;
1779 if (smacro_defined(ctx, mname, nparam, &smac, casesense)) {
1780 if (!smac) {
1781 error(ERR_WARNING|ERR_PASS1,
1782 "single-line macro `%s' defined both with and"
1783 " without parameters", mname);
1785 /* Some instances of the old code considered this a failure,
1786 some others didn't. What is the right thing to do here? */
1787 free_tlist(expansion);
1788 return false; /* Failure */
1789 } else {
1791 * We're redefining, so we have to take over an
1792 * existing SMacro structure. This means freeing
1793 * what was already in it.
1795 nasm_free(smac->name);
1796 free_tlist(smac->expansion);
1798 } else {
1799 smtbl = ctx ? &ctx->localmac : &smacros;
1800 smhead = (SMacro **) hash_findi_add(smtbl, mname);
1801 smac = nasm_malloc(sizeof(SMacro));
1802 smac->next = *smhead;
1803 *smhead = smac;
1805 smac->name = nasm_strdup(mname);
1806 smac->casesense = casesense;
1807 smac->nparam = nparam;
1808 smac->expansion = expansion;
1809 smac->in_progress = false;
1810 return true; /* Success */
1814 * Undefine an smacro
1816 static void undef_smacro(Context *ctx, const char *mname)
1818 SMacro **smhead, *s, **sp;
1819 struct hash_table *smtbl;
1821 smtbl = ctx ? &ctx->localmac : &smacros;
1822 smhead = (SMacro **)hash_findi(smtbl, mname, NULL);
1824 if (smhead) {
1826 * We now have a macro name... go hunt for it.
1828 sp = smhead;
1829 while ((s = *sp) != NULL) {
1830 if (!mstrcmp(s->name, mname, s->casesense)) {
1831 *sp = s->next;
1832 nasm_free(s->name);
1833 free_tlist(s->expansion);
1834 nasm_free(s);
1835 } else {
1836 sp = &s->next;
1843 * Parse a mmacro specification.
1845 static bool parse_mmacro_spec(Token *tline, MMacro *def, const char *directive)
1847 bool err;
1849 tline = tline->next;
1850 skip_white_(tline);
1851 tline = expand_id(tline);
1852 if (!tok_type_(tline, TOK_ID)) {
1853 error(ERR_NONFATAL, "`%s' expects a macro name", directive);
1854 return false;
1857 def->name = nasm_strdup(tline->text);
1858 def->plus = false;
1859 def->nolist = false;
1860 def->in_progress = 0;
1861 def->rep_nest = NULL;
1862 def->nparam_min = 0;
1863 def->nparam_max = 0;
1865 tline = expand_smacro(tline->next);
1866 skip_white_(tline);
1867 if (!tok_type_(tline, TOK_NUMBER)) {
1868 error(ERR_NONFATAL, "`%s' expects a parameter count", directive);
1869 } else {
1870 def->nparam_min = def->nparam_max =
1871 readnum(tline->text, &err);
1872 if (err)
1873 error(ERR_NONFATAL,
1874 "unable to parse parameter count `%s'", tline->text);
1876 if (tline && tok_is_(tline->next, "-")) {
1877 tline = tline->next->next;
1878 if (tok_is_(tline, "*")) {
1879 def->nparam_max = INT_MAX;
1880 } else if (!tok_type_(tline, TOK_NUMBER)) {
1881 error(ERR_NONFATAL,
1882 "`%s' expects a parameter count after `-'", directive);
1883 } else {
1884 def->nparam_max = readnum(tline->text, &err);
1885 if (err) {
1886 error(ERR_NONFATAL, "unable to parse parameter count `%s'",
1887 tline->text);
1889 if (def->nparam_min > def->nparam_max) {
1890 error(ERR_NONFATAL, "minimum parameter count exceeds maximum");
1894 if (tline && tok_is_(tline->next, "+")) {
1895 tline = tline->next;
1896 def->plus = true;
1898 if (tline && tok_type_(tline->next, TOK_ID) &&
1899 !nasm_stricmp(tline->next->text, ".nolist")) {
1900 tline = tline->next;
1901 def->nolist = true;
1905 * Handle default parameters.
1907 if (tline && tline->next) {
1908 def->dlist = tline->next;
1909 tline->next = NULL;
1910 count_mmac_params(def->dlist, &def->ndefs, &def->defaults);
1911 } else {
1912 def->dlist = NULL;
1913 def->defaults = NULL;
1915 def->expansion = NULL;
1917 if(def->defaults &&
1918 def->ndefs > def->nparam_max - def->nparam_min &&
1919 !def->plus)
1920 error(ERR_WARNING|ERR_PASS1|ERR_WARN_MDP,
1921 "too many default macro parameters");
1923 return true;
1928 * Decode a size directive
1930 static int parse_size(const char *str) {
1931 static const char *size_names[] =
1932 { "byte", "dword", "oword", "qword", "tword", "word", "yword" };
1933 static const int sizes[] =
1934 { 0, 1, 4, 16, 8, 10, 2, 32 };
1936 return sizes[bsii(str, size_names, elements(size_names))+1];
1940 * find and process preprocessor directive in passed line
1941 * Find out if a line contains a preprocessor directive, and deal
1942 * with it if so.
1944 * If a directive _is_ found, it is the responsibility of this routine
1945 * (and not the caller) to free_tlist() the line.
1947 * @param tline a pointer to the current tokeninzed line linked list
1948 * @return DIRECTIVE_FOUND or NO_DIRECTIVE_FOUND
1951 static int do_directive(Token * tline)
1953 enum preproc_token i;
1954 int j;
1955 bool err;
1956 int nparam;
1957 bool nolist;
1958 bool casesense;
1959 int k, m;
1960 int offset;
1961 char *p, *pp, *mname;
1962 Include *inc;
1963 Context *ctx;
1964 Cond *cond;
1965 MMacro *mmac, **mmhead;
1966 Token *t, *tt, *param_start, *macro_start, *last, **tptr, *origline;
1967 Line *l;
1968 struct tokenval tokval;
1969 expr *evalresult;
1970 MMacro *tmp_defining; /* Used when manipulating rep_nest */
1971 int64_t count;
1972 size_t len;
1973 int severity;
1975 origline = tline;
1977 skip_white_(tline);
1978 if (!tline || !tok_type_(tline, TOK_PREPROC_ID) ||
1979 (tline->text[1] == '%' || tline->text[1] == '$'
1980 || tline->text[1] == '!'))
1981 return NO_DIRECTIVE_FOUND;
1983 i = pp_token_hash(tline->text);
1986 * If we're in a non-emitting branch of a condition construct,
1987 * or walking to the end of an already terminated %rep block,
1988 * we should ignore all directives except for condition
1989 * directives.
1991 if (((istk->conds && !emitting(istk->conds->state)) ||
1992 (istk->mstk && !istk->mstk->in_progress)) && !is_condition(i)) {
1993 return NO_DIRECTIVE_FOUND;
1997 * If we're defining a macro or reading a %rep block, we should
1998 * ignore all directives except for %macro/%imacro (which nest),
1999 * %endm/%endmacro, and (only if we're in a %rep block) %endrep.
2000 * If we're in a %rep block, another %rep nests, so should be let through.
2002 if (defining && i != PP_MACRO && i != PP_IMACRO &&
2003 i != PP_ENDMACRO && i != PP_ENDM &&
2004 (defining->name || (i != PP_ENDREP && i != PP_REP))) {
2005 return NO_DIRECTIVE_FOUND;
2008 if (defining) {
2009 if (i == PP_MACRO || i == PP_IMACRO) {
2010 nested_mac_count++;
2011 return NO_DIRECTIVE_FOUND;
2012 } else if (nested_mac_count > 0) {
2013 if (i == PP_ENDMACRO) {
2014 nested_mac_count--;
2015 return NO_DIRECTIVE_FOUND;
2018 if (!defining->name) {
2019 if (i == PP_REP) {
2020 nested_rep_count++;
2021 return NO_DIRECTIVE_FOUND;
2022 } else if (nested_rep_count > 0) {
2023 if (i == PP_ENDREP) {
2024 nested_rep_count--;
2025 return NO_DIRECTIVE_FOUND;
2031 switch (i) {
2032 case PP_INVALID:
2033 error(ERR_NONFATAL, "unknown preprocessor directive `%s'",
2034 tline->text);
2035 return NO_DIRECTIVE_FOUND; /* didn't get it */
2037 case PP_STACKSIZE:
2038 /* Directive to tell NASM what the default stack size is. The
2039 * default is for a 16-bit stack, and this can be overriden with
2040 * %stacksize large.
2041 * the following form:
2043 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
2045 tline = tline->next;
2046 if (tline && tline->type == TOK_WHITESPACE)
2047 tline = tline->next;
2048 if (!tline || tline->type != TOK_ID) {
2049 error(ERR_NONFATAL, "`%%stacksize' missing size parameter");
2050 free_tlist(origline);
2051 return DIRECTIVE_FOUND;
2053 if (nasm_stricmp(tline->text, "flat") == 0) {
2054 /* All subsequent ARG directives are for a 32-bit stack */
2055 StackSize = 4;
2056 StackPointer = "ebp";
2057 ArgOffset = 8;
2058 LocalOffset = 0;
2059 } else if (nasm_stricmp(tline->text, "flat64") == 0) {
2060 /* All subsequent ARG directives are for a 64-bit stack */
2061 StackSize = 8;
2062 StackPointer = "rbp";
2063 ArgOffset = 8;
2064 LocalOffset = 0;
2065 } else if (nasm_stricmp(tline->text, "large") == 0) {
2066 /* All subsequent ARG directives are for a 16-bit stack,
2067 * far function call.
2069 StackSize = 2;
2070 StackPointer = "bp";
2071 ArgOffset = 4;
2072 LocalOffset = 0;
2073 } else if (nasm_stricmp(tline->text, "small") == 0) {
2074 /* All subsequent ARG directives are for a 16-bit stack,
2075 * far function call. We don't support near functions.
2077 StackSize = 2;
2078 StackPointer = "bp";
2079 ArgOffset = 6;
2080 LocalOffset = 0;
2081 } else {
2082 error(ERR_NONFATAL, "`%%stacksize' invalid size type");
2083 free_tlist(origline);
2084 return DIRECTIVE_FOUND;
2086 free_tlist(origline);
2087 return DIRECTIVE_FOUND;
2089 case PP_ARG:
2090 /* TASM like ARG directive to define arguments to functions, in
2091 * the following form:
2093 * ARG arg1:WORD, arg2:DWORD, arg4:QWORD
2095 offset = ArgOffset;
2096 do {
2097 char *arg, directive[256];
2098 int size = StackSize;
2100 /* Find the argument name */
2101 tline = tline->next;
2102 if (tline && tline->type == TOK_WHITESPACE)
2103 tline = tline->next;
2104 if (!tline || tline->type != TOK_ID) {
2105 error(ERR_NONFATAL, "`%%arg' missing argument parameter");
2106 free_tlist(origline);
2107 return DIRECTIVE_FOUND;
2109 arg = tline->text;
2111 /* Find the argument size type */
2112 tline = tline->next;
2113 if (!tline || tline->type != TOK_OTHER
2114 || tline->text[0] != ':') {
2115 error(ERR_NONFATAL,
2116 "Syntax error processing `%%arg' directive");
2117 free_tlist(origline);
2118 return DIRECTIVE_FOUND;
2120 tline = tline->next;
2121 if (!tline || tline->type != TOK_ID) {
2122 error(ERR_NONFATAL, "`%%arg' missing size type parameter");
2123 free_tlist(origline);
2124 return DIRECTIVE_FOUND;
2127 /* Allow macro expansion of type parameter */
2128 tt = tokenize(tline->text);
2129 tt = expand_smacro(tt);
2130 size = parse_size(tt->text);
2131 if (!size) {
2132 error(ERR_NONFATAL,
2133 "Invalid size type for `%%arg' missing directive");
2134 free_tlist(tt);
2135 free_tlist(origline);
2136 return DIRECTIVE_FOUND;
2138 free_tlist(tt);
2140 /* Round up to even stack slots */
2141 size = (size+StackSize-1) & ~(StackSize-1);
2143 /* Now define the macro for the argument */
2144 snprintf(directive, sizeof(directive), "%%define %s (%s+%d)",
2145 arg, StackPointer, offset);
2146 do_directive(tokenize(directive));
2147 offset += size;
2149 /* Move to the next argument in the list */
2150 tline = tline->next;
2151 if (tline && tline->type == TOK_WHITESPACE)
2152 tline = tline->next;
2153 } while (tline && tline->type == TOK_OTHER && tline->text[0] == ',');
2154 ArgOffset = offset;
2155 free_tlist(origline);
2156 return DIRECTIVE_FOUND;
2158 case PP_LOCAL:
2159 /* TASM like LOCAL directive to define local variables for a
2160 * function, in the following form:
2162 * LOCAL local1:WORD, local2:DWORD, local4:QWORD = LocalSize
2164 * The '= LocalSize' at the end is ignored by NASM, but is
2165 * required by TASM to define the local parameter size (and used
2166 * by the TASM macro package).
2168 offset = LocalOffset;
2169 do {
2170 char *local, directive[256];
2171 int size = StackSize;
2173 /* Find the argument name */
2174 tline = tline->next;
2175 if (tline && tline->type == TOK_WHITESPACE)
2176 tline = tline->next;
2177 if (!tline || tline->type != TOK_ID) {
2178 error(ERR_NONFATAL,
2179 "`%%local' missing argument parameter");
2180 free_tlist(origline);
2181 return DIRECTIVE_FOUND;
2183 local = tline->text;
2185 /* Find the argument size type */
2186 tline = tline->next;
2187 if (!tline || tline->type != TOK_OTHER
2188 || tline->text[0] != ':') {
2189 error(ERR_NONFATAL,
2190 "Syntax error processing `%%local' directive");
2191 free_tlist(origline);
2192 return DIRECTIVE_FOUND;
2194 tline = tline->next;
2195 if (!tline || tline->type != TOK_ID) {
2196 error(ERR_NONFATAL,
2197 "`%%local' missing size type parameter");
2198 free_tlist(origline);
2199 return DIRECTIVE_FOUND;
2202 /* Allow macro expansion of type parameter */
2203 tt = tokenize(tline->text);
2204 tt = expand_smacro(tt);
2205 size = parse_size(tt->text);
2206 if (!size) {
2207 error(ERR_NONFATAL,
2208 "Invalid size type for `%%local' missing directive");
2209 free_tlist(tt);
2210 free_tlist(origline);
2211 return DIRECTIVE_FOUND;
2213 free_tlist(tt);
2215 /* Round up to even stack slots */
2216 size = (size+StackSize-1) & ~(StackSize-1);
2218 offset += size; /* Negative offset, increment before */
2220 /* Now define the macro for the argument */
2221 snprintf(directive, sizeof(directive), "%%define %s (%s-%d)",
2222 local, StackPointer, offset);
2223 do_directive(tokenize(directive));
2225 /* Now define the assign to setup the enter_c macro correctly */
2226 snprintf(directive, sizeof(directive),
2227 "%%assign %%$localsize %%$localsize+%d", size);
2228 do_directive(tokenize(directive));
2230 /* Move to the next argument in the list */
2231 tline = tline->next;
2232 if (tline && tline->type == TOK_WHITESPACE)
2233 tline = tline->next;
2234 } while (tline && tline->type == TOK_OTHER && tline->text[0] == ',');
2235 LocalOffset = offset;
2236 free_tlist(origline);
2237 return DIRECTIVE_FOUND;
2239 case PP_CLEAR:
2240 if (tline->next)
2241 error(ERR_WARNING|ERR_PASS1,
2242 "trailing garbage after `%%clear' ignored");
2243 free_macros();
2244 init_macros();
2245 free_tlist(origline);
2246 return DIRECTIVE_FOUND;
2248 case PP_DEPEND:
2249 t = tline->next = expand_smacro(tline->next);
2250 skip_white_(t);
2251 if (!t || (t->type != TOK_STRING &&
2252 t->type != TOK_INTERNAL_STRING)) {
2253 error(ERR_NONFATAL, "`%%depend' expects a file name");
2254 free_tlist(origline);
2255 return DIRECTIVE_FOUND; /* but we did _something_ */
2257 if (t->next)
2258 error(ERR_WARNING|ERR_PASS1,
2259 "trailing garbage after `%%depend' ignored");
2260 p = t->text;
2261 if (t->type != TOK_INTERNAL_STRING)
2262 nasm_unquote(p, NULL);
2263 if (dephead && !in_list(*dephead, p)) {
2264 StrList *sl = nasm_malloc(strlen(p)+1+sizeof sl->next);
2265 sl->next = NULL;
2266 strcpy(sl->str, p);
2267 *deptail = sl;
2268 deptail = &sl->next;
2270 free_tlist(origline);
2271 return DIRECTIVE_FOUND;
2273 case PP_INCLUDE:
2274 t = tline->next = expand_smacro(tline->next);
2275 skip_white_(t);
2277 if (!t || (t->type != TOK_STRING &&
2278 t->type != TOK_INTERNAL_STRING)) {
2279 error(ERR_NONFATAL, "`%%include' expects a file name");
2280 free_tlist(origline);
2281 return DIRECTIVE_FOUND; /* but we did _something_ */
2283 if (t->next)
2284 error(ERR_WARNING|ERR_PASS1,
2285 "trailing garbage after `%%include' ignored");
2286 p = t->text;
2287 if (t->type != TOK_INTERNAL_STRING)
2288 nasm_unquote(p, NULL);
2289 inc = nasm_malloc(sizeof(Include));
2290 inc->next = istk;
2291 inc->conds = NULL;
2292 inc->fp = inc_fopen(p, dephead, &deptail, pass == 0);
2293 if (!inc->fp) {
2294 /* -MG given but file not found */
2295 nasm_free(inc);
2296 } else {
2297 inc->fname = src_set_fname(nasm_strdup(p));
2298 inc->lineno = src_set_linnum(0);
2299 inc->lineinc = 1;
2300 inc->expansion = NULL;
2301 inc->mstk = NULL;
2302 istk = inc;
2303 list->uplevel(LIST_INCLUDE);
2305 free_tlist(origline);
2306 return DIRECTIVE_FOUND;
2308 case PP_USE:
2310 static macros_t *use_pkg;
2311 const char *pkg_macro;
2313 t = tline->next = expand_smacro(tline->next);
2314 skip_white_(t);
2316 if (!t || (t->type != TOK_STRING &&
2317 t->type != TOK_INTERNAL_STRING &&
2318 t->type != TOK_ID)) {
2319 error(ERR_NONFATAL, "`%%use' expects a package name");
2320 free_tlist(origline);
2321 return DIRECTIVE_FOUND; /* but we did _something_ */
2323 if (t->next)
2324 error(ERR_WARNING|ERR_PASS1,
2325 "trailing garbage after `%%use' ignored");
2326 if (t->type == TOK_STRING)
2327 nasm_unquote(t->text, NULL);
2328 use_pkg = nasm_stdmac_find_package(t->text);
2329 if (!use_pkg)
2330 error(ERR_NONFATAL, "unknown `%%use' package: %s", t->text);
2331 /* The first string will be <%define>__USE_*__ */
2332 pkg_macro = (char *)use_pkg + 1;
2333 if (!smacro_defined(NULL, pkg_macro, 0, NULL, true)) {
2334 /* Not already included, go ahead and include it */
2335 stdmacpos = use_pkg;
2337 free_tlist(origline);
2338 return DIRECTIVE_FOUND;
2340 case PP_PUSH:
2341 tline = tline->next;
2342 skip_white_(tline);
2343 tline = expand_id(tline);
2344 if (tline) {
2345 if (!tok_type_(tline, TOK_ID)) {
2346 error(ERR_NONFATAL, "`%%push' expects a context identifier");
2347 free_tlist(origline);
2348 return DIRECTIVE_FOUND; /* but we did _something_ */
2350 if (tline->next)
2351 error(ERR_WARNING|ERR_PASS1,
2352 "trailing garbage after `%%push' ignored");
2353 p = nasm_strdup(tline->text);
2354 } else {
2355 p = NULL; /* Anonymous context */
2357 ctx = nasm_malloc(sizeof(Context));
2358 ctx->next = cstk;
2359 hash_init(&ctx->localmac, HASH_SMALL);
2360 ctx->name = p;
2361 ctx->number = unique++;
2362 cstk = ctx;
2363 free_tlist(origline);
2364 return DIRECTIVE_FOUND;
2366 case PP_REPL:
2367 tline = tline->next;
2368 skip_white_(tline);
2369 tline = expand_id(tline);
2370 if (tline) {
2371 if (!tok_type_(tline, TOK_ID)) {
2372 error(ERR_NONFATAL, "`%%repl' expects a context identifier");
2373 free_tlist(origline);
2374 return DIRECTIVE_FOUND; /* but we did _something_ */
2376 if (tline->next)
2377 error(ERR_WARNING|ERR_PASS1,
2378 "trailing garbage after `%%repl' ignored");
2379 p = nasm_strdup(tline->text);
2380 } else {
2381 p = NULL;
2383 if (!cstk)
2384 error(ERR_NONFATAL, "`%%repl': context stack is empty");
2385 else {
2386 nasm_free(cstk->name);
2387 cstk->name = p;
2389 free_tlist(origline);
2390 return DIRECTIVE_FOUND;
2392 case PP_POP:
2393 if (tline->next)
2394 error(ERR_WARNING|ERR_PASS1,
2395 "trailing garbage after `%%pop' ignored");
2396 if (!cstk)
2397 error(ERR_NONFATAL, "`%%pop': context stack is already empty");
2398 else
2399 ctx_pop();
2400 free_tlist(origline);
2401 return DIRECTIVE_FOUND;
2403 case PP_FATAL:
2404 severity = ERR_FATAL|ERR_NO_SEVERITY;
2405 goto issue_error;
2406 case PP_ERROR:
2407 severity = ERR_NONFATAL|ERR_NO_SEVERITY;
2408 goto issue_error;
2409 case PP_WARNING:
2410 severity = ERR_WARNING|ERR_NO_SEVERITY|ERR_WARN_USER;
2411 goto issue_error;
2413 issue_error:
2415 /* Only error out if this is the final pass */
2416 if (pass != 2 && i != PP_FATAL)
2417 return DIRECTIVE_FOUND;
2419 tline->next = expand_smacro(tline->next);
2420 tline = tline->next;
2421 skip_white_(tline);
2422 t = tline ? tline->next : NULL;
2423 skip_white_(t);
2424 if (tok_type_(tline, TOK_STRING) && !t) {
2425 /* The line contains only a quoted string */
2426 p = tline->text;
2427 nasm_unquote(p, NULL);
2428 error(severity, "%s: %s", pp_directives[i], p);
2429 } else {
2430 /* Not a quoted string, or more than a quoted string */
2431 p = detoken(tline, false);
2432 error(severity, "%s: %s", pp_directives[i], p);
2433 nasm_free(p);
2435 free_tlist(origline);
2436 return DIRECTIVE_FOUND;
2439 CASE_PP_IF:
2440 if (istk->conds && !emitting(istk->conds->state))
2441 j = COND_NEVER;
2442 else {
2443 j = if_condition(tline->next, i);
2444 tline->next = NULL; /* it got freed */
2445 j = j < 0 ? COND_NEVER : j ? COND_IF_TRUE : COND_IF_FALSE;
2447 cond = nasm_malloc(sizeof(Cond));
2448 cond->next = istk->conds;
2449 cond->state = j;
2450 istk->conds = cond;
2451 free_tlist(origline);
2452 return DIRECTIVE_FOUND;
2454 CASE_PP_ELIF:
2455 if (!istk->conds)
2456 error(ERR_FATAL, "`%s': no matching `%%if'", pp_directives[i]);
2457 switch(istk->conds->state) {
2458 case COND_IF_TRUE:
2459 istk->conds->state = COND_DONE;
2460 break;
2462 case COND_DONE:
2463 case COND_NEVER:
2464 break;
2466 case COND_ELSE_TRUE:
2467 case COND_ELSE_FALSE:
2468 error_precond(ERR_WARNING|ERR_PASS1,
2469 "`%%elif' after `%%else' ignored");
2470 istk->conds->state = COND_NEVER;
2471 break;
2473 case COND_IF_FALSE:
2475 * IMPORTANT: In the case of %if, we will already have
2476 * called expand_mmac_params(); however, if we're
2477 * processing an %elif we must have been in a
2478 * non-emitting mode, which would have inhibited
2479 * the normal invocation of expand_indirect() and
2480 * expand_mmac_params(). Therefore, we have to do it
2481 * explicitly here.
2483 t = expand_indirect(tline->next,0);
2484 t = expand_mmac_params(t);
2485 j = if_condition(expand_mmac_params(t), i);
2486 tline->next = NULL; /* it got freed */
2487 istk->conds->state =
2488 j < 0 ? COND_NEVER : j ? COND_IF_TRUE : COND_IF_FALSE;
2489 break;
2491 free_tlist(origline);
2492 return DIRECTIVE_FOUND;
2494 case PP_ELSE:
2495 if (tline->next)
2496 error_precond(ERR_WARNING|ERR_PASS1,
2497 "trailing garbage after `%%else' ignored");
2498 if (!istk->conds)
2499 error(ERR_FATAL, "`%%else': no matching `%%if'");
2500 switch(istk->conds->state) {
2501 case COND_IF_TRUE:
2502 case COND_DONE:
2503 istk->conds->state = COND_ELSE_FALSE;
2504 break;
2506 case COND_NEVER:
2507 break;
2509 case COND_IF_FALSE:
2510 istk->conds->state = COND_ELSE_TRUE;
2511 break;
2513 case COND_ELSE_TRUE:
2514 case COND_ELSE_FALSE:
2515 error_precond(ERR_WARNING|ERR_PASS1,
2516 "`%%else' after `%%else' ignored.");
2517 istk->conds->state = COND_NEVER;
2518 break;
2520 free_tlist(origline);
2521 return DIRECTIVE_FOUND;
2523 case PP_ENDIF:
2524 if (tline->next)
2525 error_precond(ERR_WARNING|ERR_PASS1,
2526 "trailing garbage after `%%endif' ignored");
2527 if (!istk->conds)
2528 error(ERR_FATAL, "`%%endif': no matching `%%if'");
2529 cond = istk->conds;
2530 istk->conds = cond->next;
2531 nasm_free(cond);
2532 free_tlist(origline);
2533 return DIRECTIVE_FOUND;
2535 case PP_MACRO:
2536 case PP_IMACRO:
2537 if (defining) {
2538 error(ERR_FATAL,
2539 "`%%%smacro': already defining a macro",
2540 (i == PP_IMACRO ? "i" : ""));
2541 return DIRECTIVE_FOUND;
2543 defining = nasm_malloc(sizeof(MMacro));
2544 defining->casesense = (i == PP_MACRO);
2545 if (!parse_mmacro_spec(tline, defining, pp_directives[i])) {
2546 nasm_free(defining);
2547 defining = NULL;
2548 return DIRECTIVE_FOUND;
2551 mmac = (MMacro *) hash_findix(&mmacros, defining->name);
2552 while (mmac) {
2553 if (!strcmp(mmac->name, defining->name) &&
2554 (mmac->nparam_min <= defining->nparam_max
2555 || defining->plus)
2556 && (defining->nparam_min <= mmac->nparam_max
2557 || mmac->plus)) {
2558 error(ERR_WARNING|ERR_PASS1,
2559 "redefining multi-line macro `%s'", defining->name);
2560 return DIRECTIVE_FOUND;
2562 mmac = mmac->next;
2564 free_tlist(origline);
2565 return DIRECTIVE_FOUND;
2567 case PP_ENDM:
2568 case PP_ENDMACRO:
2569 if (! (defining && defining->name)) {
2570 error(ERR_NONFATAL, "`%s': not defining a macro", tline->text);
2571 return DIRECTIVE_FOUND;
2573 mmhead = (MMacro **) hash_findi_add(&mmacros, defining->name);
2574 defining->next = *mmhead;
2575 *mmhead = defining;
2576 defining = NULL;
2577 free_tlist(origline);
2578 return DIRECTIVE_FOUND;
2580 case PP_UNMACRO:
2581 case PP_UNIMACRO:
2583 MMacro **mmac_p;
2584 MMacro spec;
2586 spec.casesense = (i == PP_UNMACRO);
2587 if (!parse_mmacro_spec(tline, &spec, pp_directives[i])) {
2588 return DIRECTIVE_FOUND;
2590 mmac_p = (MMacro **) hash_findi(&mmacros, spec.name, NULL);
2591 while (mmac_p && *mmac_p) {
2592 mmac = *mmac_p;
2593 if (mmac->casesense == spec.casesense &&
2594 !mstrcmp(mmac->name, spec.name, spec.casesense) &&
2595 mmac->nparam_min == spec.nparam_min &&
2596 mmac->nparam_max == spec.nparam_max &&
2597 mmac->plus == spec.plus) {
2598 *mmac_p = mmac->next;
2599 free_mmacro(mmac);
2600 } else {
2601 mmac_p = &mmac->next;
2604 free_tlist(origline);
2605 free_tlist(spec.dlist);
2606 return DIRECTIVE_FOUND;
2609 case PP_ROTATE:
2610 if (tline->next && tline->next->type == TOK_WHITESPACE)
2611 tline = tline->next;
2612 if (tline->next == NULL) {
2613 free_tlist(origline);
2614 error(ERR_NONFATAL, "`%%rotate' missing rotate count");
2615 return DIRECTIVE_FOUND;
2617 t = expand_smacro(tline->next);
2618 tline->next = NULL;
2619 free_tlist(origline);
2620 tline = t;
2621 tptr = &t;
2622 tokval.t_type = TOKEN_INVALID;
2623 evalresult =
2624 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
2625 free_tlist(tline);
2626 if (!evalresult)
2627 return DIRECTIVE_FOUND;
2628 if (tokval.t_type)
2629 error(ERR_WARNING|ERR_PASS1,
2630 "trailing garbage after expression ignored");
2631 if (!is_simple(evalresult)) {
2632 error(ERR_NONFATAL, "non-constant value given to `%%rotate'");
2633 return DIRECTIVE_FOUND;
2635 mmac = istk->mstk;
2636 while (mmac && !mmac->name) /* avoid mistaking %reps for macros */
2637 mmac = mmac->next_active;
2638 if (!mmac) {
2639 error(ERR_NONFATAL, "`%%rotate' invoked outside a macro call");
2640 } else if (mmac->nparam == 0) {
2641 error(ERR_NONFATAL,
2642 "`%%rotate' invoked within macro without parameters");
2643 } else {
2644 int rotate = mmac->rotate + reloc_value(evalresult);
2646 rotate %= (int)mmac->nparam;
2647 if (rotate < 0)
2648 rotate += mmac->nparam;
2650 mmac->rotate = rotate;
2652 return DIRECTIVE_FOUND;
2654 case PP_REP:
2655 nolist = false;
2656 do {
2657 tline = tline->next;
2658 } while (tok_type_(tline, TOK_WHITESPACE));
2660 if (tok_type_(tline, TOK_ID) &&
2661 nasm_stricmp(tline->text, ".nolist") == 0) {
2662 nolist = true;
2663 do {
2664 tline = tline->next;
2665 } while (tok_type_(tline, TOK_WHITESPACE));
2668 if (tline) {
2669 t = expand_smacro(tline);
2670 tptr = &t;
2671 tokval.t_type = TOKEN_INVALID;
2672 evalresult =
2673 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
2674 if (!evalresult) {
2675 free_tlist(origline);
2676 return DIRECTIVE_FOUND;
2678 if (tokval.t_type)
2679 error(ERR_WARNING|ERR_PASS1,
2680 "trailing garbage after expression ignored");
2681 if (!is_simple(evalresult)) {
2682 error(ERR_NONFATAL, "non-constant value given to `%%rep'");
2683 return DIRECTIVE_FOUND;
2685 count = reloc_value(evalresult) + 1;
2686 } else {
2687 error(ERR_NONFATAL, "`%%rep' expects a repeat count");
2688 count = 0;
2690 free_tlist(origline);
2692 tmp_defining = defining;
2693 defining = nasm_malloc(sizeof(MMacro));
2694 defining->name = NULL; /* flags this macro as a %rep block */
2695 defining->casesense = false;
2696 defining->plus = false;
2697 defining->nolist = nolist;
2698 defining->in_progress = count;
2699 defining->nparam_min = defining->nparam_max = 0;
2700 defining->defaults = NULL;
2701 defining->dlist = NULL;
2702 defining->expansion = NULL;
2703 defining->next_active = istk->mstk;
2704 defining->rep_nest = tmp_defining;
2705 return DIRECTIVE_FOUND;
2707 case PP_ENDREP:
2708 if (!defining || defining->name) {
2709 error(ERR_NONFATAL, "`%%endrep': no matching `%%rep'");
2710 return DIRECTIVE_FOUND;
2714 * Now we have a "macro" defined - although it has no name
2715 * and we won't be entering it in the hash tables - we must
2716 * push a macro-end marker for it on to istk->expansion.
2717 * After that, it will take care of propagating itself (a
2718 * macro-end marker line for a macro which is really a %rep
2719 * block will cause the macro to be re-expanded, complete
2720 * with another macro-end marker to ensure the process
2721 * continues) until the whole expansion is forcibly removed
2722 * from istk->expansion by a %exitrep.
2724 l = nasm_malloc(sizeof(Line));
2725 l->next = istk->expansion;
2726 l->finishes = defining;
2727 l->first = NULL;
2728 istk->expansion = l;
2730 istk->mstk = defining;
2732 list->uplevel(defining->nolist ? LIST_MACRO_NOLIST : LIST_MACRO);
2733 tmp_defining = defining;
2734 defining = defining->rep_nest;
2735 free_tlist(origline);
2736 return DIRECTIVE_FOUND;
2738 case PP_EXITREP:
2740 * We must search along istk->expansion until we hit a
2741 * macro-end marker for a macro with no name. Then we set
2742 * its `in_progress' flag to 0.
2744 for (l = istk->expansion; l; l = l->next)
2745 if (l->finishes && !l->finishes->name)
2746 break;
2748 if (l)
2749 l->finishes->in_progress = 1;
2750 else
2751 error(ERR_NONFATAL, "`%%exitrep' not within `%%rep' block");
2752 free_tlist(origline);
2753 return DIRECTIVE_FOUND;
2755 case PP_XDEFINE:
2756 case PP_IXDEFINE:
2757 case PP_DEFINE:
2758 case PP_IDEFINE:
2759 casesense = (i == PP_DEFINE || i == PP_XDEFINE);
2761 tline = tline->next;
2762 skip_white_(tline);
2763 tline = expand_id(tline);
2764 if (!tline || (tline->type != TOK_ID &&
2765 (tline->type != TOK_PREPROC_ID ||
2766 tline->text[1] != '$'))) {
2767 error(ERR_NONFATAL, "`%s' expects a macro identifier",
2768 pp_directives[i]);
2769 free_tlist(origline);
2770 return DIRECTIVE_FOUND;
2773 ctx = get_ctx(tline->text, false);
2775 mname = tline->text;
2776 last = tline;
2777 param_start = tline = tline->next;
2778 nparam = 0;
2780 /* Expand the macro definition now for %xdefine and %ixdefine */
2781 if ((i == PP_XDEFINE) || (i == PP_IXDEFINE))
2782 tline = expand_smacro(tline);
2784 if (tok_is_(tline, "(")) {
2786 * This macro has parameters.
2789 tline = tline->next;
2790 while (1) {
2791 skip_white_(tline);
2792 if (!tline) {
2793 error(ERR_NONFATAL, "parameter identifier expected");
2794 free_tlist(origline);
2795 return DIRECTIVE_FOUND;
2797 if (tline->type != TOK_ID) {
2798 error(ERR_NONFATAL,
2799 "`%s': parameter identifier expected",
2800 tline->text);
2801 free_tlist(origline);
2802 return DIRECTIVE_FOUND;
2804 tline->type = TOK_SMAC_PARAM + nparam++;
2805 tline = tline->next;
2806 skip_white_(tline);
2807 if (tok_is_(tline, ",")) {
2808 tline = tline->next;
2809 } else {
2810 if (!tok_is_(tline, ")")) {
2811 error(ERR_NONFATAL,
2812 "`)' expected to terminate macro template");
2813 free_tlist(origline);
2814 return DIRECTIVE_FOUND;
2816 break;
2819 last = tline;
2820 tline = tline->next;
2822 if (tok_type_(tline, TOK_WHITESPACE))
2823 last = tline, tline = tline->next;
2824 macro_start = NULL;
2825 last->next = NULL;
2826 t = tline;
2827 while (t) {
2828 if (t->type == TOK_ID) {
2829 for (tt = param_start; tt; tt = tt->next)
2830 if (tt->type >= TOK_SMAC_PARAM &&
2831 !strcmp(tt->text, t->text))
2832 t->type = tt->type;
2834 tt = t->next;
2835 t->next = macro_start;
2836 macro_start = t;
2837 t = tt;
2840 * Good. We now have a macro name, a parameter count, and a
2841 * token list (in reverse order) for an expansion. We ought
2842 * to be OK just to create an SMacro, store it, and let
2843 * free_tlist have the rest of the line (which we have
2844 * carefully re-terminated after chopping off the expansion
2845 * from the end).
2847 define_smacro(ctx, mname, casesense, nparam, macro_start);
2848 free_tlist(origline);
2849 return DIRECTIVE_FOUND;
2851 case PP_UNDEF:
2852 tline = tline->next;
2853 skip_white_(tline);
2854 tline = expand_id(tline);
2855 if (!tline || (tline->type != TOK_ID &&
2856 (tline->type != TOK_PREPROC_ID ||
2857 tline->text[1] != '$'))) {
2858 error(ERR_NONFATAL, "`%%undef' expects a macro identifier");
2859 free_tlist(origline);
2860 return DIRECTIVE_FOUND;
2862 if (tline->next) {
2863 error(ERR_WARNING|ERR_PASS1,
2864 "trailing garbage after macro name ignored");
2867 /* Find the context that symbol belongs to */
2868 ctx = get_ctx(tline->text, false);
2869 undef_smacro(ctx, tline->text);
2870 free_tlist(origline);
2871 return DIRECTIVE_FOUND;
2873 case PP_DEFSTR:
2874 case PP_IDEFSTR:
2875 casesense = (i == PP_DEFSTR);
2877 tline = tline->next;
2878 skip_white_(tline);
2879 tline = expand_id(tline);
2880 if (!tline || (tline->type != TOK_ID &&
2881 (tline->type != TOK_PREPROC_ID ||
2882 tline->text[1] != '$'))) {
2883 error(ERR_NONFATAL, "`%s' expects a macro identifier",
2884 pp_directives[i]);
2885 free_tlist(origline);
2886 return DIRECTIVE_FOUND;
2889 ctx = get_ctx(tline->text, false);
2891 mname = tline->text;
2892 last = tline;
2893 tline = expand_smacro(tline->next);
2894 last->next = NULL;
2896 while (tok_type_(tline, TOK_WHITESPACE))
2897 tline = delete_Token(tline);
2899 p = detoken(tline, false);
2900 macro_start = nasm_malloc(sizeof(*macro_start));
2901 macro_start->next = NULL;
2902 macro_start->text = nasm_quote(p, strlen(p));
2903 macro_start->type = TOK_STRING;
2904 macro_start->a.mac = NULL;
2905 nasm_free(p);
2908 * We now have a macro name, an implicit parameter count of
2909 * zero, and a string token to use as an expansion. Create
2910 * and store an SMacro.
2912 define_smacro(ctx, mname, casesense, 0, macro_start);
2913 free_tlist(origline);
2914 return DIRECTIVE_FOUND;
2916 case PP_PATHSEARCH:
2918 FILE *fp;
2919 StrList *xsl = NULL;
2920 StrList **xst = &xsl;
2922 casesense = true;
2924 tline = tline->next;
2925 skip_white_(tline);
2926 tline = expand_id(tline);
2927 if (!tline || (tline->type != TOK_ID &&
2928 (tline->type != TOK_PREPROC_ID ||
2929 tline->text[1] != '$'))) {
2930 error(ERR_NONFATAL,
2931 "`%%pathsearch' expects a macro identifier as first parameter");
2932 free_tlist(origline);
2933 return DIRECTIVE_FOUND;
2935 ctx = get_ctx(tline->text, false);
2937 mname = tline->text;
2938 last = tline;
2939 tline = expand_smacro(tline->next);
2940 last->next = NULL;
2942 t = tline;
2943 while (tok_type_(t, TOK_WHITESPACE))
2944 t = t->next;
2946 if (!t || (t->type != TOK_STRING &&
2947 t->type != TOK_INTERNAL_STRING)) {
2948 error(ERR_NONFATAL, "`%%pathsearch' expects a file name");
2949 free_tlist(tline);
2950 free_tlist(origline);
2951 return DIRECTIVE_FOUND; /* but we did _something_ */
2953 if (t->next)
2954 error(ERR_WARNING|ERR_PASS1,
2955 "trailing garbage after `%%pathsearch' ignored");
2956 p = t->text;
2957 if (t->type != TOK_INTERNAL_STRING)
2958 nasm_unquote(p, NULL);
2960 fp = inc_fopen(p, &xsl, &xst, true);
2961 if (fp) {
2962 p = xsl->str;
2963 fclose(fp); /* Don't actually care about the file */
2965 macro_start = nasm_malloc(sizeof(*macro_start));
2966 macro_start->next = NULL;
2967 macro_start->text = nasm_quote(p, strlen(p));
2968 macro_start->type = TOK_STRING;
2969 macro_start->a.mac = NULL;
2970 if (xsl)
2971 nasm_free(xsl);
2974 * We now have a macro name, an implicit parameter count of
2975 * zero, and a string token to use as an expansion. Create
2976 * and store an SMacro.
2978 define_smacro(ctx, mname, casesense, 0, macro_start);
2979 free_tlist(tline);
2980 free_tlist(origline);
2981 return DIRECTIVE_FOUND;
2984 case PP_STRLEN:
2985 casesense = true;
2987 tline = tline->next;
2988 skip_white_(tline);
2989 tline = expand_id(tline);
2990 if (!tline || (tline->type != TOK_ID &&
2991 (tline->type != TOK_PREPROC_ID ||
2992 tline->text[1] != '$'))) {
2993 error(ERR_NONFATAL,
2994 "`%%strlen' expects a macro identifier as first parameter");
2995 free_tlist(origline);
2996 return DIRECTIVE_FOUND;
2998 ctx = get_ctx(tline->text, false);
3000 mname = tline->text;
3001 last = tline;
3002 tline = expand_smacro(tline->next);
3003 last->next = NULL;
3005 t = tline;
3006 while (tok_type_(t, TOK_WHITESPACE))
3007 t = t->next;
3008 /* t should now point to the string */
3009 if (t->type != TOK_STRING) {
3010 error(ERR_NONFATAL,
3011 "`%%strlen` requires string as second parameter");
3012 free_tlist(tline);
3013 free_tlist(origline);
3014 return DIRECTIVE_FOUND;
3017 macro_start = nasm_malloc(sizeof(*macro_start));
3018 macro_start->next = NULL;
3019 make_tok_num(macro_start, nasm_unquote(t->text, NULL));
3020 macro_start->a.mac = NULL;
3023 * We now have a macro name, an implicit parameter count of
3024 * zero, and a numeric token to use as an expansion. Create
3025 * and store an SMacro.
3027 define_smacro(ctx, mname, casesense, 0, macro_start);
3028 free_tlist(tline);
3029 free_tlist(origline);
3030 return DIRECTIVE_FOUND;
3032 case PP_STRCAT:
3033 casesense = true;
3035 tline = tline->next;
3036 skip_white_(tline);
3037 tline = expand_id(tline);
3038 if (!tline || (tline->type != TOK_ID &&
3039 (tline->type != TOK_PREPROC_ID ||
3040 tline->text[1] != '$'))) {
3041 error(ERR_NONFATAL,
3042 "`%%strcat' expects a macro identifier as first parameter");
3043 free_tlist(origline);
3044 return DIRECTIVE_FOUND;
3046 ctx = get_ctx(tline->text, false);
3048 mname = tline->text;
3049 last = tline;
3050 tline = expand_smacro(tline->next);
3051 last->next = NULL;
3053 len = 0;
3054 for (t = tline; t; t = t->next) {
3055 switch (t->type) {
3056 case TOK_WHITESPACE:
3057 break;
3058 case TOK_STRING:
3059 len += t->a.len = nasm_unquote(t->text, NULL);
3060 break;
3061 case TOK_OTHER:
3062 if (!strcmp(t->text, ",")) /* permit comma separators */
3063 break;
3064 /* else fall through */
3065 default:
3066 error(ERR_NONFATAL,
3067 "non-string passed to `%%strcat' (%d)", t->type);
3068 free_tlist(tline);
3069 free_tlist(origline);
3070 return DIRECTIVE_FOUND;
3074 p = pp = nasm_malloc(len);
3075 t = tline;
3076 for (t = tline; t; t = t->next) {
3077 if (t->type == TOK_STRING) {
3078 memcpy(p, t->text, t->a.len);
3079 p += t->a.len;
3084 * We now have a macro name, an implicit parameter count of
3085 * zero, and a numeric token to use as an expansion. Create
3086 * and store an SMacro.
3088 macro_start = new_Token(NULL, TOK_STRING, NULL, 0);
3089 macro_start->text = nasm_quote(pp, len);
3090 nasm_free(pp);
3091 define_smacro(ctx, mname, casesense, 0, macro_start);
3092 free_tlist(tline);
3093 free_tlist(origline);
3094 return DIRECTIVE_FOUND;
3096 case PP_SUBSTR:
3098 int64_t a1, a2;
3099 size_t len;
3101 casesense = true;
3103 tline = tline->next;
3104 skip_white_(tline);
3105 tline = expand_id(tline);
3106 if (!tline || (tline->type != TOK_ID &&
3107 (tline->type != TOK_PREPROC_ID ||
3108 tline->text[1] != '$'))) {
3109 error(ERR_NONFATAL,
3110 "`%%substr' expects a macro identifier as first parameter");
3111 free_tlist(origline);
3112 return DIRECTIVE_FOUND;
3114 ctx = get_ctx(tline->text, false);
3116 mname = tline->text;
3117 last = tline;
3118 tline = expand_smacro(tline->next);
3119 last->next = NULL;
3121 t = tline->next;
3122 while (tok_type_(t, TOK_WHITESPACE))
3123 t = t->next;
3125 /* t should now point to the string */
3126 if (t->type != TOK_STRING) {
3127 error(ERR_NONFATAL,
3128 "`%%substr` requires string as second parameter");
3129 free_tlist(tline);
3130 free_tlist(origline);
3131 return DIRECTIVE_FOUND;
3134 tt = t->next;
3135 tptr = &tt;
3136 tokval.t_type = TOKEN_INVALID;
3137 evalresult = evaluate(ppscan, tptr, &tokval, NULL,
3138 pass, error, NULL);
3139 if (!evalresult) {
3140 free_tlist(tline);
3141 free_tlist(origline);
3142 return DIRECTIVE_FOUND;
3143 } else if (!is_simple(evalresult)) {
3144 error(ERR_NONFATAL, "non-constant value given to `%%substr`");
3145 free_tlist(tline);
3146 free_tlist(origline);
3147 return DIRECTIVE_FOUND;
3149 a1 = evalresult->value-1;
3151 while (tok_type_(tt, TOK_WHITESPACE))
3152 tt = tt->next;
3153 if (!tt) {
3154 a2 = 1; /* Backwards compatibility: one character */
3155 } else {
3156 tokval.t_type = TOKEN_INVALID;
3157 evalresult = evaluate(ppscan, tptr, &tokval, NULL,
3158 pass, error, NULL);
3159 if (!evalresult) {
3160 free_tlist(tline);
3161 free_tlist(origline);
3162 return DIRECTIVE_FOUND;
3163 } else if (!is_simple(evalresult)) {
3164 error(ERR_NONFATAL, "non-constant value given to `%%substr`");
3165 free_tlist(tline);
3166 free_tlist(origline);
3167 return DIRECTIVE_FOUND;
3169 a2 = evalresult->value;
3172 len = nasm_unquote(t->text, NULL);
3173 if (a2 < 0)
3174 a2 = a2+1+len-a1;
3175 if (a1+a2 > (int64_t)len)
3176 a2 = len-a1;
3178 macro_start = nasm_malloc(sizeof(*macro_start));
3179 macro_start->next = NULL;
3180 macro_start->text = nasm_quote((a1 < 0) ? "" : t->text+a1, a2);
3181 macro_start->type = TOK_STRING;
3182 macro_start->a.mac = NULL;
3185 * We now have a macro name, an implicit parameter count of
3186 * zero, and a numeric token to use as an expansion. Create
3187 * and store an SMacro.
3189 define_smacro(ctx, mname, casesense, 0, macro_start);
3190 free_tlist(tline);
3191 free_tlist(origline);
3192 return DIRECTIVE_FOUND;
3195 case PP_ASSIGN:
3196 case PP_IASSIGN:
3197 casesense = (i == PP_ASSIGN);
3199 tline = tline->next;
3200 skip_white_(tline);
3201 tline = expand_id(tline);
3202 if (!tline || (tline->type != TOK_ID &&
3203 (tline->type != TOK_PREPROC_ID ||
3204 tline->text[1] != '$'))) {
3205 error(ERR_NONFATAL,
3206 "`%%%sassign' expects a macro identifier",
3207 (i == PP_IASSIGN ? "i" : ""));
3208 free_tlist(origline);
3209 return DIRECTIVE_FOUND;
3211 ctx = get_ctx(tline->text, false);
3213 mname = tline->text;
3214 last = tline;
3215 tline = expand_smacro(tline->next);
3216 last->next = NULL;
3218 t = tline;
3219 tptr = &t;
3220 tokval.t_type = TOKEN_INVALID;
3221 evalresult =
3222 evaluate(ppscan, tptr, &tokval, NULL, pass, error, NULL);
3223 free_tlist(tline);
3224 if (!evalresult) {
3225 free_tlist(origline);
3226 return DIRECTIVE_FOUND;
3229 if (tokval.t_type)
3230 error(ERR_WARNING|ERR_PASS1,
3231 "trailing garbage after expression ignored");
3233 if (!is_simple(evalresult)) {
3234 error(ERR_NONFATAL,
3235 "non-constant value given to `%%%sassign'",
3236 (i == PP_IASSIGN ? "i" : ""));
3237 free_tlist(origline);
3238 return DIRECTIVE_FOUND;
3241 macro_start = nasm_malloc(sizeof(*macro_start));
3242 macro_start->next = NULL;
3243 make_tok_num(macro_start, reloc_value(evalresult));
3244 macro_start->a.mac = NULL;
3247 * We now have a macro name, an implicit parameter count of
3248 * zero, and a numeric token to use as an expansion. Create
3249 * and store an SMacro.
3251 define_smacro(ctx, mname, casesense, 0, macro_start);
3252 free_tlist(origline);
3253 return DIRECTIVE_FOUND;
3255 case PP_LINE:
3257 * Syntax is `%line nnn[+mmm] [filename]'
3259 tline = tline->next;
3260 skip_white_(tline);
3261 if (!tok_type_(tline, TOK_NUMBER)) {
3262 error(ERR_NONFATAL, "`%%line' expects line number");
3263 free_tlist(origline);
3264 return DIRECTIVE_FOUND;
3266 k = readnum(tline->text, &err);
3267 m = 1;
3268 tline = tline->next;
3269 if (tok_is_(tline, "+")) {
3270 tline = tline->next;
3271 if (!tok_type_(tline, TOK_NUMBER)) {
3272 error(ERR_NONFATAL, "`%%line' expects line increment");
3273 free_tlist(origline);
3274 return DIRECTIVE_FOUND;
3276 m = readnum(tline->text, &err);
3277 tline = tline->next;
3279 skip_white_(tline);
3280 src_set_linnum(k);
3281 istk->lineinc = m;
3282 if (tline) {
3283 nasm_free(src_set_fname(detoken(tline, false)));
3285 free_tlist(origline);
3286 return DIRECTIVE_FOUND;
3288 default:
3289 error(ERR_FATAL,
3290 "preprocessor directive `%s' not yet implemented",
3291 pp_directives[i]);
3292 return DIRECTIVE_FOUND;
3297 * Ensure that a macro parameter contains a condition code and
3298 * nothing else. Return the condition code index if so, or -1
3299 * otherwise.
3301 static int find_cc(Token * t)
3303 Token *tt;
3304 int i, j, k, m;
3306 if (!t)
3307 return -1; /* Probably a %+ without a space */
3309 skip_white_(t);
3310 if (t->type != TOK_ID)
3311 return -1;
3312 tt = t->next;
3313 skip_white_(tt);
3314 if (tt && (tt->type != TOK_OTHER || strcmp(tt->text, ",")))
3315 return -1;
3317 i = -1;
3318 j = elements(conditions);
3319 while (j - i > 1) {
3320 k = (j + i) / 2;
3321 m = nasm_stricmp(t->text, conditions[k]);
3322 if (m == 0) {
3323 i = k;
3324 j = -2;
3325 break;
3326 } else if (m < 0) {
3327 j = k;
3328 } else
3329 i = k;
3331 if (j != -2)
3332 return -1;
3333 return i;
3337 * Expand MMacro-local things: parameter references (%0, %n, %+n,
3338 * %-n) and MMacro-local identifiers (%%foo).
3340 static Token *expand_mmac_params(Token * tline)
3342 Token *t, *tt, **tail, *thead;
3344 tail = &thead;
3345 thead = NULL;
3347 while (tline) {
3348 if (tline->type == TOK_PREPROC_ID &&
3349 (((tline->text[1] == '+' || tline->text[1] == '-')
3350 && tline->text[2]) || tline->text[1] == '%'
3351 || (tline->text[1] >= '0' && tline->text[1] <= '9'))) {
3352 char *text = NULL;
3353 int type = 0, cc; /* type = 0 to placate optimisers */
3354 char tmpbuf[30];
3355 unsigned int n;
3356 int i;
3357 MMacro *mac;
3359 t = tline;
3360 tline = tline->next;
3362 mac = istk->mstk;
3363 while (mac && !mac->name) /* avoid mistaking %reps for macros */
3364 mac = mac->next_active;
3365 if (!mac)
3366 error(ERR_NONFATAL, "`%s': not in a macro call", t->text);
3367 else
3368 switch (t->text[1]) {
3370 * We have to make a substitution of one of the
3371 * forms %1, %-1, %+1, %%foo, %0.
3373 case '0':
3374 type = TOK_NUMBER;
3375 snprintf(tmpbuf, sizeof(tmpbuf), "%d", mac->nparam);
3376 text = nasm_strdup(tmpbuf);
3377 break;
3378 case '%':
3379 type = TOK_ID;
3380 snprintf(tmpbuf, sizeof(tmpbuf), "..@%"PRIu64".",
3381 mac->unique);
3382 text = nasm_strcat(tmpbuf, t->text + 2);
3383 break;
3384 case '-':
3385 n = atoi(t->text + 2) - 1;
3386 if (n >= mac->nparam)
3387 tt = NULL;
3388 else {
3389 if (mac->nparam > 1)
3390 n = (n + mac->rotate) % mac->nparam;
3391 tt = mac->params[n];
3393 cc = find_cc(tt);
3394 if (cc == -1) {
3395 error(ERR_NONFATAL,
3396 "macro parameter %d is not a condition code",
3397 n + 1);
3398 text = NULL;
3399 } else {
3400 type = TOK_ID;
3401 if (inverse_ccs[cc] == -1) {
3402 error(ERR_NONFATAL,
3403 "condition code `%s' is not invertible",
3404 conditions[cc]);
3405 text = NULL;
3406 } else
3407 text =
3408 nasm_strdup(conditions[inverse_ccs[cc]]);
3410 break;
3411 case '+':
3412 n = atoi(t->text + 2) - 1;
3413 if (n >= mac->nparam)
3414 tt = NULL;
3415 else {
3416 if (mac->nparam > 1)
3417 n = (n + mac->rotate) % mac->nparam;
3418 tt = mac->params[n];
3420 cc = find_cc(tt);
3421 if (cc == -1) {
3422 error(ERR_NONFATAL,
3423 "macro parameter %d is not a condition code",
3424 n + 1);
3425 text = NULL;
3426 } else {
3427 type = TOK_ID;
3428 text = nasm_strdup(conditions[cc]);
3430 break;
3431 default:
3432 n = atoi(t->text + 1) - 1;
3433 if (n >= mac->nparam)
3434 tt = NULL;
3435 else {
3436 if (mac->nparam > 1)
3437 n = (n + mac->rotate) % mac->nparam;
3438 tt = mac->params[n];
3440 if (tt) {
3441 for (i = 0; i < mac->paramlen[n]; i++) {
3442 *tail = new_Token(NULL, tt->type, tt->text, 0);
3443 tail = &(*tail)->next;
3444 tt = tt->next;
3447 text = NULL; /* we've done it here */
3448 break;
3450 if (!text) {
3451 delete_Token(t);
3452 } else {
3453 *tail = t;
3454 tail = &t->next;
3455 t->type = type;
3456 nasm_free(t->text);
3457 t->text = text;
3458 t->a.mac = NULL;
3460 continue;
3461 } else {
3462 t = *tail = tline;
3463 tline = tline->next;
3464 t->a.mac = NULL;
3465 tail = &t->next;
3468 *tail = NULL;
3469 t = thead;
3470 for (; t && (tt = t->next) != NULL; t = t->next)
3471 switch (t->type) {
3472 case TOK_WHITESPACE:
3473 if (tt->type == TOK_WHITESPACE) {
3474 t->next = delete_Token(tt);
3476 break;
3477 case TOK_ID:
3478 case TOK_NUMBER:
3479 if (tt->type == t->type || tt->type == TOK_NUMBER) {
3480 char *tmp = nasm_strcat(t->text, tt->text);
3481 nasm_free(t->text);
3482 t->text = tmp;
3483 t->next = delete_Token(tt);
3485 break;
3486 default:
3487 break;
3490 return thead;
3494 * Expand all single-line macro calls made in the given line.
3495 * Return the expanded version of the line. The original is deemed
3496 * to be destroyed in the process. (In reality we'll just move
3497 * Tokens from input to output a lot of the time, rather than
3498 * actually bothering to destroy and replicate.)
3500 #define DEADMAN_LIMIT (1 << 20)
3502 static Token *expand_smacro(Token * tline)
3504 Token *t, *tt, *mstart, **tail, *thead;
3505 struct hash_table *smtbl;
3506 SMacro *head = NULL, *m;
3507 Token **params;
3508 int *paramsize;
3509 unsigned int nparam, sparam;
3510 int brackets, rescan;
3511 Token *org_tline = tline;
3512 Context *ctx;
3513 char *mname;
3514 int deadman = DEADMAN_LIMIT;
3517 * Trick: we should avoid changing the start token pointer since it can
3518 * be contained in "next" field of other token. Because of this
3519 * we allocate a copy of first token and work with it; at the end of
3520 * routine we copy it back
3522 if (org_tline) {
3523 tline =
3524 new_Token(org_tline->next, org_tline->type, org_tline->text,
3526 tline->a.mac = org_tline->a.mac;
3527 nasm_free(org_tline->text);
3528 org_tline->text = NULL;
3531 again:
3532 tail = &thead;
3533 thead = NULL;
3535 while (tline) { /* main token loop */
3536 if (!--deadman) {
3537 error(ERR_NONFATAL, "interminable macro recursion");
3538 break;
3541 if ((mname = tline->text)) {
3542 /* if this token is a local macro, look in local context */
3543 ctx = NULL;
3544 smtbl = &smacros;
3545 if (tline->type == TOK_ID || tline->type == TOK_PREPROC_ID) {
3546 ctx = get_ctx(mname, true);
3547 if (ctx)
3548 smtbl = &ctx->localmac;
3550 head = (SMacro *) hash_findix(smtbl, mname);
3553 * We've hit an identifier. As in is_mmacro below, we first
3554 * check whether the identifier is a single-line macro at
3555 * all, then think about checking for parameters if
3556 * necessary.
3558 for (m = head; m; m = m->next)
3559 if (!mstrcmp(m->name, mname, m->casesense))
3560 break;
3561 if (m) {
3562 mstart = tline;
3563 params = NULL;
3564 paramsize = NULL;
3565 if (m->nparam == 0) {
3567 * Simple case: the macro is parameterless. Discard the
3568 * one token that the macro call took, and push the
3569 * expansion back on the to-do stack.
3571 if (!m->expansion) {
3572 if (!strcmp("__FILE__", m->name)) {
3573 int32_t num = 0;
3574 char *file = NULL;
3575 src_get(&num, &file);
3576 tline->text = nasm_quote(file, strlen(file));
3577 tline->type = TOK_STRING;
3578 nasm_free(file);
3579 continue;
3581 if (!strcmp("__LINE__", m->name)) {
3582 nasm_free(tline->text);
3583 make_tok_num(tline, src_get_linnum());
3584 continue;
3586 if (!strcmp("__BITS__", m->name)) {
3587 nasm_free(tline->text);
3588 make_tok_num(tline, globalbits);
3589 continue;
3591 tline = delete_Token(tline);
3592 continue;
3594 } else {
3596 * Complicated case: at least one macro with this name
3597 * exists and takes parameters. We must find the
3598 * parameters in the call, count them, find the SMacro
3599 * that corresponds to that form of the macro call, and
3600 * substitute for the parameters when we expand. What a
3601 * pain.
3603 /*tline = tline->next;
3604 skip_white_(tline); */
3605 do {
3606 t = tline->next;
3607 while (tok_type_(t, TOK_SMAC_END)) {
3608 t->a.mac->in_progress = false;
3609 t->text = NULL;
3610 t = tline->next = delete_Token(t);
3612 tline = t;
3613 } while (tok_type_(tline, TOK_WHITESPACE));
3614 if (!tok_is_(tline, "(")) {
3616 * This macro wasn't called with parameters: ignore
3617 * the call. (Behaviour borrowed from gnu cpp.)
3619 tline = mstart;
3620 m = NULL;
3621 } else {
3622 int paren = 0;
3623 int white = 0;
3624 brackets = 0;
3625 nparam = 0;
3626 sparam = PARAM_DELTA;
3627 params = nasm_malloc(sparam * sizeof(Token *));
3628 params[0] = tline->next;
3629 paramsize = nasm_malloc(sparam * sizeof(int));
3630 paramsize[0] = 0;
3631 while (true) { /* parameter loop */
3633 * For some unusual expansions
3634 * which concatenates function call
3636 t = tline->next;
3637 while (tok_type_(t, TOK_SMAC_END)) {
3638 t->a.mac->in_progress = false;
3639 t->text = NULL;
3640 t = tline->next = delete_Token(t);
3642 tline = t;
3644 if (!tline) {
3645 error(ERR_NONFATAL,
3646 "macro call expects terminating `)'");
3647 break;
3649 if (tline->type == TOK_WHITESPACE
3650 && brackets <= 0) {
3651 if (paramsize[nparam])
3652 white++;
3653 else
3654 params[nparam] = tline->next;
3655 continue; /* parameter loop */
3657 if (tline->type == TOK_OTHER
3658 && tline->text[1] == 0) {
3659 char ch = tline->text[0];
3660 if (ch == ',' && !paren && brackets <= 0) {
3661 if (++nparam >= sparam) {
3662 sparam += PARAM_DELTA;
3663 params = nasm_realloc(params,
3664 sparam *
3665 sizeof(Token
3666 *));
3667 paramsize =
3668 nasm_realloc(paramsize,
3669 sparam *
3670 sizeof(int));
3672 params[nparam] = tline->next;
3673 paramsize[nparam] = 0;
3674 white = 0;
3675 continue; /* parameter loop */
3677 if (ch == '{' &&
3678 (brackets > 0 || (brackets == 0 &&
3679 !paramsize[nparam])))
3681 if (!(brackets++)) {
3682 params[nparam] = tline->next;
3683 continue; /* parameter loop */
3686 if (ch == '}' && brackets > 0)
3687 if (--brackets == 0) {
3688 brackets = -1;
3689 continue; /* parameter loop */
3691 if (ch == '(' && !brackets)
3692 paren++;
3693 if (ch == ')' && brackets <= 0)
3694 if (--paren < 0)
3695 break;
3697 if (brackets < 0) {
3698 brackets = 0;
3699 error(ERR_NONFATAL, "braces do not "
3700 "enclose all of macro parameter");
3702 paramsize[nparam] += white + 1;
3703 white = 0;
3704 } /* parameter loop */
3705 nparam++;
3706 while (m && (m->nparam != nparam ||
3707 mstrcmp(m->name, mname,
3708 m->casesense)))
3709 m = m->next;
3710 if (!m)
3711 error(ERR_WARNING|ERR_PASS1|ERR_WARN_MNP,
3712 "macro `%s' exists, "
3713 "but not taking %d parameters",
3714 mstart->text, nparam);
3717 if (m && m->in_progress)
3718 m = NULL;
3719 if (!m) { /* in progess or didn't find '(' or wrong nparam */
3721 * Design question: should we handle !tline, which
3722 * indicates missing ')' here, or expand those
3723 * macros anyway, which requires the (t) test a few
3724 * lines down?
3726 nasm_free(params);
3727 nasm_free(paramsize);
3728 tline = mstart;
3729 } else {
3731 * Expand the macro: we are placed on the last token of the
3732 * call, so that we can easily split the call from the
3733 * following tokens. We also start by pushing an SMAC_END
3734 * token for the cycle removal.
3736 t = tline;
3737 if (t) {
3738 tline = t->next;
3739 t->next = NULL;
3741 tt = new_Token(tline, TOK_SMAC_END, NULL, 0);
3742 tt->a.mac = m;
3743 m->in_progress = true;
3744 tline = tt;
3745 for (t = m->expansion; t; t = t->next) {
3746 if (t->type >= TOK_SMAC_PARAM) {
3747 Token *pcopy = tline, **ptail = &pcopy;
3748 Token *ttt, *pt;
3749 int i;
3751 ttt = params[t->type - TOK_SMAC_PARAM];
3752 for (i = paramsize[t->type - TOK_SMAC_PARAM];
3753 --i >= 0;) {
3754 pt = *ptail =
3755 new_Token(tline, ttt->type, ttt->text,
3757 ptail = &pt->next;
3758 ttt = ttt->next;
3760 tline = pcopy;
3761 } else if (t->type == TOK_PREPROC_Q) {
3762 tt = new_Token(tline, TOK_ID, mname, 0);
3763 tline = tt;
3764 } else if (t->type == TOK_PREPROC_QQ) {
3765 tt = new_Token(tline, TOK_ID, m->name, 0);
3766 tline = tt;
3767 } else {
3768 tt = new_Token(tline, t->type, t->text, 0);
3769 tline = tt;
3774 * Having done that, get rid of the macro call, and clean
3775 * up the parameters.
3777 nasm_free(params);
3778 nasm_free(paramsize);
3779 free_tlist(mstart);
3780 continue; /* main token loop */
3785 if (tline->type == TOK_SMAC_END) {
3786 tline->a.mac->in_progress = false;
3787 tline = delete_Token(tline);
3788 } else {
3789 t = *tail = tline;
3790 tline = tline->next;
3791 t->a.mac = NULL;
3792 t->next = NULL;
3793 tail = &t->next;
3798 * Now scan the entire line and look for successive TOK_IDs that resulted
3799 * after expansion (they can't be produced by tokenize()). The successive
3800 * TOK_IDs should be concatenated.
3801 * Also we look for %+ tokens and concatenate the tokens before and after
3802 * them (without white spaces in between).
3804 t = thead;
3805 rescan = 0;
3806 while (t) {
3807 while (t && t->type != TOK_ID && t->type != TOK_PREPROC_ID)
3808 t = t->next;
3809 if (!t || !t->next)
3810 break;
3811 if (t->next->type == TOK_ID ||
3812 t->next->type == TOK_PREPROC_ID ||
3813 t->next->type == TOK_NUMBER) {
3814 char *p = nasm_strcat(t->text, t->next->text);
3815 nasm_free(t->text);
3816 t->next = delete_Token(t->next);
3817 t->text = p;
3818 rescan = 1;
3819 } else if (t->next->type == TOK_WHITESPACE && t->next->next &&
3820 t->next->next->type == TOK_PREPROC_ID &&
3821 strcmp(t->next->next->text, "%+") == 0) {
3822 /* free the next whitespace, the %+ token and next whitespace */
3823 int i;
3824 for (i = 1; i <= 3; i++) {
3825 if (!t->next
3826 || (i != 2 && t->next->type != TOK_WHITESPACE))
3827 break;
3828 t->next = delete_Token(t->next);
3829 } /* endfor */
3830 } else
3831 t = t->next;
3833 /* If we concatenaded something, re-scan the line for macros */
3834 if (rescan) {
3835 tline = thead;
3836 goto again;
3839 if (org_tline) {
3840 if (thead) {
3841 *org_tline = *thead;
3842 /* since we just gave text to org_line, don't free it */
3843 thead->text = NULL;
3844 delete_Token(thead);
3845 } else {
3846 /* the expression expanded to empty line;
3847 we can't return NULL for some reasons
3848 we just set the line to a single WHITESPACE token. */
3849 memset(org_tline, 0, sizeof(*org_tline));
3850 org_tline->text = NULL;
3851 org_tline->type = TOK_WHITESPACE;
3853 thead = org_tline;
3856 return thead;
3860 * Similar to expand_smacro but used exclusively with macro identifiers
3861 * right before they are fetched in. The reason is that there can be
3862 * identifiers consisting of several subparts. We consider that if there
3863 * are more than one element forming the name, user wants a expansion,
3864 * otherwise it will be left as-is. Example:
3866 * %define %$abc cde
3868 * the identifier %$abc will be left as-is so that the handler for %define
3869 * will suck it and define the corresponding value. Other case:
3871 * %define _%$abc cde
3873 * In this case user wants name to be expanded *before* %define starts
3874 * working, so we'll expand %$abc into something (if it has a value;
3875 * otherwise it will be left as-is) then concatenate all successive
3876 * PP_IDs into one.
3878 static Token *expand_id(Token * tline)
3880 Token *cur, *oldnext = NULL;
3882 if (!tline || !tline->next)
3883 return tline;
3885 cur = tline;
3886 while (cur->next &&
3887 (cur->next->type == TOK_ID ||
3888 cur->next->type == TOK_PREPROC_ID
3889 || cur->next->type == TOK_NUMBER))
3890 cur = cur->next;
3892 /* If identifier consists of just one token, don't expand */
3893 if (cur == tline)
3894 return tline;
3896 if (cur) {
3897 oldnext = cur->next; /* Detach the tail past identifier */
3898 cur->next = NULL; /* so that expand_smacro stops here */
3901 tline = expand_smacro(tline);
3903 if (cur) {
3904 /* expand_smacro possibly changhed tline; re-scan for EOL */
3905 cur = tline;
3906 while (cur && cur->next)
3907 cur = cur->next;
3908 if (cur)
3909 cur->next = oldnext;
3912 return tline;
3916 * Expand indirect tokens, %[...]. Just like expand_smacro(),
3917 * the input is considered destroyed.
3919 * XXX: fix duplicated code in this function and in expand_mmac_params()
3921 static Token *expand_indirect(Token * tline, int level)
3923 const int max_indirect_level = 1000;
3924 Token *t, *thead, **tp;
3925 Token *it;
3926 bool skip;
3928 if (level >= max_indirect_level) {
3929 error(ERR_NONFATAL, "interminable indirect expansion");
3930 } else {
3931 thead = NULL;
3932 tp = &tline;
3933 while ((t = *tp)) {
3934 if (t->type != TOK_INDIRECT) {
3935 thead = t;
3936 tp = &t->next;
3937 } else {
3938 it = tokenize(t->text);
3939 it = expand_indirect(it, level+1);
3940 it = expand_smacro(it);
3941 while (it) {
3942 skip = false;
3943 switch (thead ? thead->type : TOK_NONE) {
3944 case TOK_WHITESPACE:
3945 skip = (it->type == TOK_WHITESPACE);
3946 break;
3947 case TOK_ID:
3948 case TOK_NUMBER:
3949 if (it->type == thead->type || it->type == TOK_NUMBER) {
3950 char *tmp = nasm_strcat(thead->text, it->text);
3951 nasm_free(thead->text);
3952 thead->text = tmp;
3953 skip = true;
3955 break;
3956 default:
3957 break;
3959 if (skip) {
3960 it = delete_Token(it);
3961 } else {
3962 *tp = thead = it;
3963 tp = &it->next;
3964 it = it->next;
3968 skip = false;
3969 it = t->next;
3970 if (it) {
3971 switch (thead ? thead->type : TOK_NONE) {
3972 case TOK_WHITESPACE:
3973 skip = (it->type == TOK_WHITESPACE);
3974 break;
3975 case TOK_ID:
3976 case TOK_NUMBER:
3977 if (it->type == thead->type || it->type == TOK_NUMBER) {
3978 char *tmp = nasm_strcat(thead->text, it->text);
3979 nasm_free(thead->text);
3980 thead->text = tmp;
3981 skip = true;
3983 break;
3984 default:
3985 break;
3988 if (skip) {
3989 *tp = thead = it->next;
3990 t = delete_Token(t);
3991 } else {
3992 *tp = thead = it;
3994 t = delete_Token(t);
3998 return tline;
4002 * Determine whether the given line constitutes a multi-line macro
4003 * call, and return the MMacro structure called if so. Doesn't have
4004 * to check for an initial label - that's taken care of in
4005 * expand_mmacro - but must check numbers of parameters. Guaranteed
4006 * to be called with tline->type == TOK_ID, so the putative macro
4007 * name is easy to find.
4009 static MMacro *is_mmacro(Token * tline, Token *** params_array)
4011 MMacro *head, *m;
4012 Token **params;
4013 int nparam;
4015 head = (MMacro *) hash_findix(&mmacros, tline->text);
4018 * Efficiency: first we see if any macro exists with the given
4019 * name. If not, we can return NULL immediately. _Then_ we
4020 * count the parameters, and then we look further along the
4021 * list if necessary to find the proper MMacro.
4023 for (m = head; m; m = m->next)
4024 if (!mstrcmp(m->name, tline->text, m->casesense))
4025 break;
4026 if (!m)
4027 return NULL;
4030 * OK, we have a potential macro. Count and demarcate the
4031 * parameters.
4033 count_mmac_params(tline->next, &nparam, &params);
4036 * So we know how many parameters we've got. Find the MMacro
4037 * structure that handles this number.
4039 while (m) {
4040 if (m->nparam_min <= nparam
4041 && (m->plus || nparam <= m->nparam_max)) {
4043 * This one is right. Just check if cycle removal
4044 * prohibits us using it before we actually celebrate...
4046 if (m->in_progress) {
4047 #if 0
4048 error(ERR_NONFATAL,
4049 "self-reference in multi-line macro `%s'", m->name);
4050 #endif
4051 nasm_free(params);
4052 return NULL;
4055 * It's right, and we can use it. Add its default
4056 * parameters to the end of our list if necessary.
4058 if (m->defaults && nparam < m->nparam_min + m->ndefs) {
4059 params =
4060 nasm_realloc(params,
4061 ((m->nparam_min + m->ndefs +
4062 1) * sizeof(*params)));
4063 while (nparam < m->nparam_min + m->ndefs) {
4064 params[nparam] = m->defaults[nparam - m->nparam_min];
4065 nparam++;
4069 * If we've gone over the maximum parameter count (and
4070 * we're in Plus mode), ignore parameters beyond
4071 * nparam_max.
4073 if (m->plus && nparam > m->nparam_max)
4074 nparam = m->nparam_max;
4076 * Then terminate the parameter list, and leave.
4078 if (!params) { /* need this special case */
4079 params = nasm_malloc(sizeof(*params));
4080 nparam = 0;
4082 params[nparam] = NULL;
4083 *params_array = params;
4084 return m;
4087 * This one wasn't right: look for the next one with the
4088 * same name.
4090 for (m = m->next; m; m = m->next)
4091 if (!mstrcmp(m->name, tline->text, m->casesense))
4092 break;
4096 * After all that, we didn't find one with the right number of
4097 * parameters. Issue a warning, and fail to expand the macro.
4099 error(ERR_WARNING|ERR_PASS1|ERR_WARN_MNP,
4100 "macro `%s' exists, but not taking %d parameters",
4101 tline->text, nparam);
4102 nasm_free(params);
4103 return NULL;
4107 * Expand the multi-line macro call made by the given line, if
4108 * there is one to be expanded. If there is, push the expansion on
4109 * istk->expansion and return 1. Otherwise return 0.
4111 static int expand_mmacro(Token * tline)
4113 Token *startline = tline;
4114 Token *label = NULL;
4115 int dont_prepend = 0;
4116 Token **params, *t, *mtok, *tt;
4117 MMacro *m;
4118 Line *l, *ll;
4119 int i, nparam, *paramlen;
4120 const char *mname;
4122 t = tline;
4123 skip_white_(t);
4124 /* if (!tok_type_(t, TOK_ID)) Lino 02/25/02 */
4125 if (!tok_type_(t, TOK_ID) && !tok_type_(t, TOK_PREPROC_ID))
4126 return 0;
4127 mtok = t;
4128 m = is_mmacro(t, &params);
4129 if (m) {
4130 mname = t->text;
4131 } else {
4132 Token *last;
4134 * We have an id which isn't a macro call. We'll assume
4135 * it might be a label; we'll also check to see if a
4136 * colon follows it. Then, if there's another id after
4137 * that lot, we'll check it again for macro-hood.
4139 label = last = t;
4140 t = t->next;
4141 if (tok_type_(t, TOK_WHITESPACE))
4142 last = t, t = t->next;
4143 if (tok_is_(t, ":")) {
4144 dont_prepend = 1;
4145 last = t, t = t->next;
4146 if (tok_type_(t, TOK_WHITESPACE))
4147 last = t, t = t->next;
4149 if (!tok_type_(t, TOK_ID) || (m = is_mmacro(t, &params)) == NULL)
4150 return 0;
4151 last->next = NULL;
4152 mname = t->text;
4153 tline = t;
4157 * Fix up the parameters: this involves stripping leading and
4158 * trailing whitespace, then stripping braces if they are
4159 * present.
4161 for (nparam = 0; params[nparam]; nparam++) ;
4162 paramlen = nparam ? nasm_malloc(nparam * sizeof(*paramlen)) : NULL;
4164 for (i = 0; params[i]; i++) {
4165 int brace = false;
4166 int comma = (!m->plus || i < nparam - 1);
4168 t = params[i];
4169 skip_white_(t);
4170 if (tok_is_(t, "{"))
4171 t = t->next, brace = true, comma = false;
4172 params[i] = t;
4173 paramlen[i] = 0;
4174 while (t) {
4175 if (comma && t->type == TOK_OTHER && !strcmp(t->text, ","))
4176 break; /* ... because we have hit a comma */
4177 if (comma && t->type == TOK_WHITESPACE
4178 && tok_is_(t->next, ","))
4179 break; /* ... or a space then a comma */
4180 if (brace && t->type == TOK_OTHER && !strcmp(t->text, "}"))
4181 break; /* ... or a brace */
4182 t = t->next;
4183 paramlen[i]++;
4188 * OK, we have a MMacro structure together with a set of
4189 * parameters. We must now go through the expansion and push
4190 * copies of each Line on to istk->expansion. Substitution of
4191 * parameter tokens and macro-local tokens doesn't get done
4192 * until the single-line macro substitution process; this is
4193 * because delaying them allows us to change the semantics
4194 * later through %rotate.
4196 * First, push an end marker on to istk->expansion, mark this
4197 * macro as in progress, and set up its invocation-specific
4198 * variables.
4200 ll = nasm_malloc(sizeof(Line));
4201 ll->next = istk->expansion;
4202 ll->finishes = m;
4203 ll->first = NULL;
4204 istk->expansion = ll;
4206 m->in_progress = true;
4207 m->params = params;
4208 m->iline = tline;
4209 m->nparam = nparam;
4210 m->rotate = 0;
4211 m->paramlen = paramlen;
4212 m->unique = unique++;
4213 m->lineno = 0;
4215 m->next_active = istk->mstk;
4216 istk->mstk = m;
4218 for (l = m->expansion; l; l = l->next) {
4219 Token **tail;
4221 ll = nasm_malloc(sizeof(Line));
4222 ll->finishes = NULL;
4223 ll->next = istk->expansion;
4224 istk->expansion = ll;
4225 tail = &ll->first;
4227 for (t = l->first; t; t = t->next) {
4228 Token *x = t;
4229 switch (t->type) {
4230 case TOK_PREPROC_Q:
4231 tt = *tail = new_Token(NULL, TOK_ID, mname, 0);
4232 break;
4233 case TOK_PREPROC_QQ:
4234 tt = *tail = new_Token(NULL, TOK_ID, m->name, 0);
4235 break;
4236 case TOK_PREPROC_ID:
4237 if (t->text[1] == '0' && t->text[2] == '0') {
4238 dont_prepend = -1;
4239 x = label;
4240 if (!x)
4241 continue;
4243 /* fall through */
4244 default:
4245 tt = *tail = new_Token(NULL, x->type, x->text, 0);
4246 break;
4248 tail = &tt->next;
4250 *tail = NULL;
4254 * If we had a label, push it on as the first line of
4255 * the macro expansion.
4257 if (label) {
4258 if (dont_prepend < 0)
4259 free_tlist(startline);
4260 else {
4261 ll = nasm_malloc(sizeof(Line));
4262 ll->finishes = NULL;
4263 ll->next = istk->expansion;
4264 istk->expansion = ll;
4265 ll->first = startline;
4266 if (!dont_prepend) {
4267 while (label->next)
4268 label = label->next;
4269 label->next = tt = new_Token(NULL, TOK_OTHER, ":", 0);
4274 list->uplevel(m->nolist ? LIST_MACRO_NOLIST : LIST_MACRO);
4276 return 1;
4279 /* The function that actually does the error reporting */
4280 static void verror(int severity, const char *fmt, va_list arg)
4282 char buff[1024];
4284 vsnprintf(buff, sizeof(buff), fmt, arg);
4286 if (istk && istk->mstk && istk->mstk->name)
4287 _error(severity, "(%s:%d) %s", istk->mstk->name,
4288 istk->mstk->lineno, buff);
4289 else
4290 _error(severity, "%s", buff);
4294 * Since preprocessor always operate only on the line that didn't
4295 * arrived yet, we should always use ERR_OFFBY1.
4297 static void error(int severity, const char *fmt, ...)
4299 va_list arg;
4301 /* If we're in a dead branch of IF or something like it, ignore the error */
4302 if (istk && istk->conds && !emitting(istk->conds->state))
4303 return;
4305 va_start(arg, fmt);
4306 verror(severity, fmt, arg);
4307 va_end(arg);
4311 * Because %else etc are evaluated in the state context
4312 * of the previous branch, errors might get lost with error():
4313 * %if 0 ... %else trailing garbage ... %endif
4314 * So %else etc should report errors with this function.
4316 static void error_precond(int severity, const char *fmt, ...)
4318 va_list arg;
4320 /* Only ignore the error if it's really in a dead branch */
4321 if (istk && istk->conds && istk->conds->state == COND_NEVER)
4322 return;
4324 va_start(arg, fmt);
4325 verror(severity, fmt, arg);
4326 va_end(arg);
4329 static void
4330 pp_reset(char *file, int apass, efunc errfunc, evalfunc eval,
4331 ListGen * listgen, StrList **deplist)
4333 Token *t;
4335 _error = errfunc;
4336 cstk = NULL;
4337 istk = nasm_malloc(sizeof(Include));
4338 istk->next = NULL;
4339 istk->conds = NULL;
4340 istk->expansion = NULL;
4341 istk->mstk = NULL;
4342 istk->fp = fopen(file, "r");
4343 istk->fname = NULL;
4344 src_set_fname(nasm_strdup(file));
4345 src_set_linnum(0);
4346 istk->lineinc = 1;
4347 if (!istk->fp)
4348 error(ERR_FATAL|ERR_NOFILE, "unable to open input file `%s'",
4349 file);
4350 defining = NULL;
4351 nested_mac_count = 0;
4352 nested_rep_count = 0;
4353 init_macros();
4354 unique = 0;
4355 if (tasm_compatible_mode) {
4356 stdmacpos = nasm_stdmac;
4357 } else {
4358 stdmacpos = nasm_stdmac_after_tasm;
4360 any_extrastdmac = extrastdmac && *extrastdmac;
4361 do_predef = true;
4362 list = listgen;
4363 evaluate = eval;
4366 * 0 for dependencies, 1 for preparatory passes, 2 for final pass.
4367 * The caller, however, will also pass in 3 for preprocess-only so
4368 * we can set __PASS__ accordingly.
4370 pass = apass > 2 ? 2 : apass;
4372 dephead = deptail = deplist;
4373 if (deplist) {
4374 StrList *sl = nasm_malloc(strlen(file)+1+sizeof sl->next);
4375 sl->next = NULL;
4376 strcpy(sl->str, file);
4377 *deptail = sl;
4378 deptail = &sl->next;
4382 * Define the __PASS__ macro. This is defined here unlike
4383 * all the other builtins, because it is special -- it varies between
4384 * passes.
4386 t = nasm_malloc(sizeof(*t));
4387 t->next = NULL;
4388 make_tok_num(t, apass);
4389 t->a.mac = NULL;
4390 define_smacro(NULL, "__PASS__", true, 0, t);
4393 static char *pp_getline(void)
4395 char *line;
4396 Token *tline;
4398 while (1) {
4400 * Fetch a tokenized line, either from the macro-expansion
4401 * buffer or from the input file.
4403 tline = NULL;
4404 while (istk->expansion && istk->expansion->finishes) {
4405 Line *l = istk->expansion;
4406 if (!l->finishes->name && l->finishes->in_progress > 1) {
4407 Line *ll;
4410 * This is a macro-end marker for a macro with no
4411 * name, which means it's not really a macro at all
4412 * but a %rep block, and the `in_progress' field is
4413 * more than 1, meaning that we still need to
4414 * repeat. (1 means the natural last repetition; 0
4415 * means termination by %exitrep.) We have
4416 * therefore expanded up to the %endrep, and must
4417 * push the whole block on to the expansion buffer
4418 * again. We don't bother to remove the macro-end
4419 * marker: we'd only have to generate another one
4420 * if we did.
4422 l->finishes->in_progress--;
4423 for (l = l->finishes->expansion; l; l = l->next) {
4424 Token *t, *tt, **tail;
4426 ll = nasm_malloc(sizeof(Line));
4427 ll->next = istk->expansion;
4428 ll->finishes = NULL;
4429 ll->first = NULL;
4430 tail = &ll->first;
4432 for (t = l->first; t; t = t->next) {
4433 if (t->text || t->type == TOK_WHITESPACE) {
4434 tt = *tail =
4435 new_Token(NULL, t->type, t->text, 0);
4436 tail = &tt->next;
4440 istk->expansion = ll;
4442 } else {
4444 * Check whether a `%rep' was started and not ended
4445 * within this macro expansion. This can happen and
4446 * should be detected. It's a fatal error because
4447 * I'm too confused to work out how to recover
4448 * sensibly from it.
4450 if (defining) {
4451 if (defining->name)
4452 error(ERR_PANIC,
4453 "defining with name in expansion");
4454 else if (istk->mstk->name)
4455 error(ERR_FATAL,
4456 "`%%rep' without `%%endrep' within"
4457 " expansion of macro `%s'",
4458 istk->mstk->name);
4462 * FIXME: investigate the relationship at this point between
4463 * istk->mstk and l->finishes
4466 MMacro *m = istk->mstk;
4467 istk->mstk = m->next_active;
4468 if (m->name) {
4470 * This was a real macro call, not a %rep, and
4471 * therefore the parameter information needs to
4472 * be freed.
4474 nasm_free(m->params);
4475 free_tlist(m->iline);
4476 nasm_free(m->paramlen);
4477 l->finishes->in_progress = false;
4478 } else
4479 free_mmacro(m);
4481 istk->expansion = l->next;
4482 nasm_free(l);
4483 list->downlevel(LIST_MACRO);
4486 while (1) { /* until we get a line we can use */
4488 if (istk->expansion) { /* from a macro expansion */
4489 char *p;
4490 Line *l = istk->expansion;
4491 if (istk->mstk)
4492 istk->mstk->lineno++;
4493 tline = l->first;
4494 istk->expansion = l->next;
4495 nasm_free(l);
4496 p = detoken(tline, false);
4497 list->line(LIST_MACRO, p);
4498 nasm_free(p);
4499 break;
4501 line = read_line();
4502 if (line) { /* from the current input file */
4503 line = prepreproc(line);
4504 tline = tokenize(line);
4505 nasm_free(line);
4506 break;
4509 * The current file has ended; work down the istk
4512 Include *i = istk;
4513 fclose(i->fp);
4514 if (i->conds)
4515 error(ERR_FATAL,
4516 "expected `%%endif' before end of file");
4517 /* only set line and file name if there's a next node */
4518 if (i->next) {
4519 src_set_linnum(i->lineno);
4520 nasm_free(src_set_fname(i->fname));
4522 istk = i->next;
4523 list->downlevel(LIST_INCLUDE);
4524 nasm_free(i);
4525 if (!istk)
4526 return NULL;
4527 if (istk->expansion && istk->expansion->finishes)
4528 break;
4533 * We must expand MMacro parameters and MMacro-local labels
4534 * _before_ we plunge into directive processing, to cope
4535 * with things like `%define something %1' such as STRUC
4536 * uses. Unless we're _defining_ a MMacro, in which case
4537 * those tokens should be left alone to go into the
4538 * definition; and unless we're in a non-emitting
4539 * condition, in which case we don't want to meddle with
4540 * anything.
4542 if (!defining && !(istk->conds && !emitting(istk->conds->state))
4543 && !(istk->mstk && !istk->mstk->in_progress)) {
4544 tline = expand_indirect(tline,0);
4545 tline = expand_mmac_params(tline);
4549 * Check the line to see if it's a preprocessor directive.
4551 if (do_directive(tline) == DIRECTIVE_FOUND) {
4552 continue;
4553 } else if (defining) {
4555 * We're defining a multi-line macro. We emit nothing
4556 * at all, and just
4557 * shove the tokenized line on to the macro definition.
4559 Line *l = nasm_malloc(sizeof(Line));
4560 l->next = defining->expansion;
4561 l->first = tline;
4562 l->finishes = NULL;
4563 defining->expansion = l;
4564 continue;
4565 } else if (istk->conds && !emitting(istk->conds->state)) {
4567 * We're in a non-emitting branch of a condition block.
4568 * Emit nothing at all, not even a blank line: when we
4569 * emerge from the condition we'll give a line-number
4570 * directive so we keep our place correctly.
4572 free_tlist(tline);
4573 continue;
4574 } else if (istk->mstk && !istk->mstk->in_progress) {
4576 * We're in a %rep block which has been terminated, so
4577 * we're walking through to the %endrep without
4578 * emitting anything. Emit nothing at all, not even a
4579 * blank line: when we emerge from the %rep block we'll
4580 * give a line-number directive so we keep our place
4581 * correctly.
4583 free_tlist(tline);
4584 continue;
4585 } else {
4586 tline = expand_smacro(tline);
4587 if (!expand_mmacro(tline)) {
4589 * De-tokenize the line again, and emit it.
4591 line = detoken(tline, true);
4592 free_tlist(tline);
4593 break;
4594 } else {
4595 continue; /* expand_mmacro calls free_tlist */
4600 return line;
4603 static void pp_cleanup(int pass)
4605 if (defining) {
4606 if(defining->name) {
4607 error(ERR_NONFATAL,
4608 "end of file while still defining macro `%s'",
4609 defining->name);
4610 } else {
4611 error(ERR_NONFATAL, "end of file while still in %%rep");
4614 free_mmacro(defining);
4616 while (cstk)
4617 ctx_pop();
4618 free_macros();
4619 while (istk) {
4620 Include *i = istk;
4621 istk = istk->next;
4622 fclose(i->fp);
4623 nasm_free(i->fname);
4624 nasm_free(i);
4626 while (cstk)
4627 ctx_pop();
4628 nasm_free(src_set_fname(NULL));
4629 if (pass == 0) {
4630 IncPath *i;
4631 free_llist(predef);
4632 delete_Blocks();
4633 while ((i = ipath)) {
4634 ipath = i->next;
4635 if (i->path)
4636 nasm_free(i->path);
4637 nasm_free(i);
4642 void pp_include_path(char *path)
4644 IncPath *i;
4646 i = nasm_malloc(sizeof(IncPath));
4647 i->path = path ? nasm_strdup(path) : NULL;
4648 i->next = NULL;
4650 if (ipath != NULL) {
4651 IncPath *j = ipath;
4652 while (j->next != NULL)
4653 j = j->next;
4654 j->next = i;
4655 } else {
4656 ipath = i;
4660 void pp_pre_include(char *fname)
4662 Token *inc, *space, *name;
4663 Line *l;
4665 name = new_Token(NULL, TOK_INTERNAL_STRING, fname, 0);
4666 space = new_Token(name, TOK_WHITESPACE, NULL, 0);
4667 inc = new_Token(space, TOK_PREPROC_ID, "%include", 0);
4669 l = nasm_malloc(sizeof(Line));
4670 l->next = predef;
4671 l->first = inc;
4672 l->finishes = NULL;
4673 predef = l;
4676 void pp_pre_define(char *definition)
4678 Token *def, *space;
4679 Line *l;
4680 char *equals;
4682 equals = strchr(definition, '=');
4683 space = new_Token(NULL, TOK_WHITESPACE, NULL, 0);
4684 def = new_Token(space, TOK_PREPROC_ID, "%define", 0);
4685 if (equals)
4686 *equals = ' ';
4687 space->next = tokenize(definition);
4688 if (equals)
4689 *equals = '=';
4691 l = nasm_malloc(sizeof(Line));
4692 l->next = predef;
4693 l->first = def;
4694 l->finishes = NULL;
4695 predef = l;
4698 void pp_pre_undefine(char *definition)
4700 Token *def, *space;
4701 Line *l;
4703 space = new_Token(NULL, TOK_WHITESPACE, NULL, 0);
4704 def = new_Token(space, TOK_PREPROC_ID, "%undef", 0);
4705 space->next = tokenize(definition);
4707 l = nasm_malloc(sizeof(Line));
4708 l->next = predef;
4709 l->first = def;
4710 l->finishes = NULL;
4711 predef = l;
4715 * Added by Keith Kanios:
4717 * This function is used to assist with "runtime" preprocessor
4718 * directives. (e.g. pp_runtime("%define __BITS__ 64");)
4720 * ERRORS ARE IGNORED HERE, SO MAKE COMPLETELY SURE THAT YOU
4721 * PASS A VALID STRING TO THIS FUNCTION!!!!!
4724 void pp_runtime(char *definition)
4726 Token *def;
4728 def = tokenize(definition);
4729 if(do_directive(def) == NO_DIRECTIVE_FOUND)
4730 free_tlist(def);
4734 void pp_extra_stdmac(macros_t *macros)
4736 extrastdmac = macros;
4739 static void make_tok_num(Token * tok, int64_t val)
4741 char numbuf[20];
4742 snprintf(numbuf, sizeof(numbuf), "%"PRId64"", val);
4743 tok->text = nasm_strdup(numbuf);
4744 tok->type = TOK_NUMBER;
4747 Preproc nasmpp = {
4748 pp_reset,
4749 pp_getline,
4750 pp_cleanup