blob: e6126a50ac0e285e32e05f1996b486fd43bc8305 [file] [log] [blame]
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00001/* parser.c source line parser for the Netwide Assembler
2 *
3 * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
4 * Julian Hall. All rights reserved. The software is
Beroset095e6a22007-12-29 09:44:23 -05005 * redistributable under the license given in the file "LICENSE"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00006 * distributed in the NASM archive.
7 *
8 * initial version 27/iii/95 by Simon Tatham
9 */
10
H. Peter Anvinfe501952007-10-02 21:53:51 -070011#include "compiler.h"
12
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000013#include <stdio.h>
14#include <stdlib.h>
15#include <stddef.h>
16#include <string.h>
17#include <ctype.h>
Keith Kaniosb7a89542007-04-12 02:40:54 +000018#include <inttypes.h>
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000019
20#include "nasm.h"
H. Peter Anvin24cfef42002-09-12 16:34:06 +000021#include "insns.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000022#include "nasmlib.h"
H. Peter Anvin74cc5e52007-08-30 22:35:34 +000023#include "stdscan.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000024#include "parser.h"
25#include "float.h"
H. Peter Anvina4835d42008-05-20 14:21:29 -070026#include "tables.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000027
H. Peter Anvine2c80182005-01-15 22:15:51 +000028extern int in_abs_seg; /* ABSOLUTE segment flag */
Keith Kaniosb7a89542007-04-12 02:40:54 +000029extern int32_t abs_seg; /* ABSOLUTE segment */
30extern int32_t abs_offset; /* ABSOLUTE segment offset */
H. Peter Anvind0e365d2002-05-26 18:19:19 +000031
H. Peter Anvine2c80182005-01-15 22:15:51 +000032static int is_comma_next(void);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000033
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000034static int i;
35static struct tokenval tokval;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000036static efunc error;
H. Peter Anvine2c80182005-01-15 22:15:51 +000037static struct ofmt *outfmt; /* Structure of addresses of output routines */
H. Peter Anvin12e46512007-10-03 21:30:57 -070038static struct location *location; /* Pointer to current line's segment,offset */
H. Peter Anvineba20a72002-04-30 20:53:55 +000039
H. Peter Anvin12e46512007-10-03 21:30:57 -070040void parser_global_info(struct ofmt *output, struct location * locp)
H. Peter Anvineba20a72002-04-30 20:53:55 +000041{
42 outfmt = output;
43 location = locp;
44}
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000045
H. Peter Anvinde4b89b2007-10-01 15:41:25 -070046static int prefix_slot(enum prefixes prefix)
47{
48 switch (prefix) {
H. Peter Anvinc2acf7b2009-02-21 18:22:56 -080049 case P_WAIT:
50 return PPS_WAIT;
H. Peter Anvinde4b89b2007-10-01 15:41:25 -070051 case R_CS:
52 case R_DS:
53 case R_SS:
54 case R_ES:
55 case R_FS:
56 case R_GS:
57 return PPS_SEG;
58 case P_LOCK:
59 case P_REP:
60 case P_REPE:
61 case P_REPZ:
62 case P_REPNE:
63 case P_REPNZ:
64 return PPS_LREP;
65 case P_O16:
66 case P_O32:
67 case P_O64:
68 case P_OSP:
69 return PPS_OSIZE;
70 case P_A16:
71 case P_A32:
72 case P_A64:
73 case P_ASP:
74 return PPS_ASIZE;
75 default:
76 error(ERR_PANIC, "Invalid value %d passed to prefix_slot()", prefix);
77 return -1;
78 }
79}
80
81static void process_size_override(insn * result, int operand)
82{
83 if (tasm_compatible_mode) {
84 switch ((int)tokval.t_integer) {
85 /* For TASM compatibility a size override inside the
86 * brackets changes the size of the operand, not the
87 * address type of the operand as it does in standard
88 * NASM syntax. Hence:
89 *
90 * mov eax,[DWORD val]
91 *
92 * is valid syntax in TASM compatibility mode. Note that
93 * you lose the ability to override the default address
94 * type for the instruction, but we never use anything
95 * but 32-bit flat model addressing in our code.
96 */
97 case S_BYTE:
98 result->oprs[operand].type |= BITS8;
99 break;
100 case S_WORD:
101 result->oprs[operand].type |= BITS16;
102 break;
103 case S_DWORD:
104 case S_LONG:
105 result->oprs[operand].type |= BITS32;
106 break;
107 case S_QWORD:
108 result->oprs[operand].type |= BITS64;
109 break;
110 case S_TWORD:
111 result->oprs[operand].type |= BITS80;
112 break;
113 case S_OWORD:
114 result->oprs[operand].type |= BITS128;
115 break;
116 default:
117 error(ERR_NONFATAL,
118 "invalid operand size specification");
119 break;
120 }
121 } else {
122 /* Standard NASM compatible syntax */
123 switch ((int)tokval.t_integer) {
124 case S_NOSPLIT:
125 result->oprs[operand].eaflags |= EAF_TIMESTWO;
126 break;
127 case S_REL:
128 result->oprs[operand].eaflags |= EAF_REL;
129 break;
130 case S_ABS:
131 result->oprs[operand].eaflags |= EAF_ABS;
132 break;
133 case S_BYTE:
134 result->oprs[operand].disp_size = 8;
135 result->oprs[operand].eaflags |= EAF_BYTEOFFS;
136 break;
137 case P_A16:
138 case P_A32:
139 case P_A64:
140 if (result->prefixes[PPS_ASIZE] &&
141 result->prefixes[PPS_ASIZE] != tokval.t_integer)
142 error(ERR_NONFATAL,
143 "conflicting address size specifications");
144 else
145 result->prefixes[PPS_ASIZE] = tokval.t_integer;
146 break;
147 case S_WORD:
148 result->oprs[operand].disp_size = 16;
149 result->oprs[operand].eaflags |= EAF_WORDOFFS;
150 break;
151 case S_DWORD:
152 case S_LONG:
153 result->oprs[operand].disp_size = 32;
154 result->oprs[operand].eaflags |= EAF_WORDOFFS;
155 break;
156 case S_QWORD:
157 result->oprs[operand].disp_size = 64;
158 result->oprs[operand].eaflags |= EAF_WORDOFFS;
159 break;
160 default:
161 error(ERR_NONFATAL, "invalid size specification in"
162 " effective address");
163 break;
164 }
165 }
166}
167
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000168insn *parse_line(int pass, char *buffer, insn * result,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000169 efunc errfunc, evalfunc evaluate, ldfunc ldef)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000170{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000171 int operand;
172 int critical;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000173 struct eval_hints hints;
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700174 int j;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800175 bool first;
176 bool insn_is_label = false;
H. Peter Anvin552bc2c2009-06-23 11:34:42 -0700177 bool recover;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000178
H. Peter Anvin9c987692007-11-04 21:09:32 -0800179restart_parse:
180 first = true;
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700181 result->forw_ref = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000182 error = errfunc;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000183
H. Peter Anvin76690a12002-04-30 20:52:49 +0000184 stdscan_reset();
185 stdscan_bufptr = buffer;
186 i = stdscan(NULL, &tokval);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000187
H. Peter Anvine2c80182005-01-15 22:15:51 +0000188 result->label = NULL; /* Assume no label */
189 result->eops = NULL; /* must do this, whatever happens */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000190 result->operands = 0; /* must initialize this */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000191
H. Peter Anvine2c80182005-01-15 22:15:51 +0000192 if (i == 0) { /* blank line - ignore */
193 result->opcode = -1; /* and no instruction either */
194 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000195 }
196 if (i != TOKEN_ID && i != TOKEN_INSN && i != TOKEN_PREFIX &&
H. Peter Anvina4835d42008-05-20 14:21:29 -0700197 (i != TOKEN_REG || (REG_SREG & ~nasm_reg_flags[tokval.t_integer]))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000198 error(ERR_NONFATAL, "label or instruction expected"
199 " at start of line");
200 result->opcode = -1;
201 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000202 }
203
H. Peter Anvin9c987692007-11-04 21:09:32 -0800204 if (i == TOKEN_ID || (insn_is_label && i == TOKEN_INSN)) {
205 /* there's a label here */
206 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000207 result->label = tokval.t_charptr;
208 i = stdscan(NULL, &tokval);
209 if (i == ':') { /* skip over the optional colon */
210 i = stdscan(NULL, &tokval);
211 } else if (i == 0) {
212 error(ERR_WARNING | ERR_WARN_OL | ERR_PASS1,
213 "label alone on a line without a colon might be in error");
214 }
215 if (i != TOKEN_INSN || tokval.t_integer != I_EQU) {
216 /*
217 * FIXME: location->segment could be NO_SEG, in which case
218 * it is possible we should be passing 'abs_seg'. Look into this.
219 * Work out whether that is *really* what we should be doing.
220 * Generally fix things. I think this is right as it is, but
221 * am still not certain.
222 */
223 ldef(result->label, in_abs_seg ? abs_seg : location->segment,
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700224 location->offset, NULL, true, false, outfmt, errfunc);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000225 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000226 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000227
H. Peter Anvine2c80182005-01-15 22:15:51 +0000228 if (i == 0) {
229 result->opcode = -1; /* this line contains just a label */
230 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000231 }
232
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700233 for (j = 0; j < MAXPREFIX; j++)
234 result->prefixes[j] = P_none;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000235 result->times = 1L;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000236
237 while (i == TOKEN_PREFIX ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700238 (i == TOKEN_REG && !(REG_SREG & ~nasm_reg_flags[tokval.t_integer])))
H. Peter Anvineba20a72002-04-30 20:53:55 +0000239 {
H. Peter Anvin9c987692007-11-04 21:09:32 -0800240 first = false;
241
H. Peter Anvine2c80182005-01-15 22:15:51 +0000242 /*
243 * Handle special case: the TIMES prefix.
244 */
245 if (i == TOKEN_PREFIX && tokval.t_integer == P_TIMES) {
246 expr *value;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000247
H. Peter Anvine2c80182005-01-15 22:15:51 +0000248 i = stdscan(NULL, &tokval);
249 value =
250 evaluate(stdscan, NULL, &tokval, NULL, pass0, error, NULL);
251 i = tokval.t_type;
252 if (!value) { /* but, error in evaluator */
253 result->opcode = -1; /* unrecoverable parse error: */
254 return result; /* ignore this instruction */
255 }
256 if (!is_simple(value)) {
257 error(ERR_NONFATAL,
258 "non-constant argument supplied to TIMES");
259 result->times = 1L;
260 } else {
261 result->times = value->value;
Charles Crayne7f596e72008-09-23 21:49:09 -0700262 if (value->value < 0 && pass0 == 2) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000263 error(ERR_NONFATAL, "TIMES value %d is negative",
264 value->value);
265 result->times = 0;
266 }
267 }
268 } else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700269 int slot = prefix_slot(tokval.t_integer);
270 if (result->prefixes[slot]) {
Charles Crayne052c0bd2007-10-29 18:24:59 -0700271 if (result->prefixes[slot] == tokval.t_integer)
H. Peter Anvin9c987692007-11-04 21:09:32 -0800272 error(ERR_WARNING,
Charles Crayne052c0bd2007-10-29 18:24:59 -0700273 "instruction has redundant prefixes");
274 else
275 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700276 "instruction has conflicting prefixes");
277 }
278 result->prefixes[slot] = tokval.t_integer;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000279 i = stdscan(NULL, &tokval);
280 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000281 }
282
283 if (i != TOKEN_INSN) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700284 int j;
285 enum prefixes pfx;
286
287 for (j = 0; j < MAXPREFIX; j++)
288 if ((pfx = result->prefixes[j]) != P_none)
289 break;
H. Peter Anvincb583b92007-10-28 22:04:42 -0700290
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700291 if (i == 0 && pfx != P_none) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000292 /*
293 * Instruction prefixes are present, but no actual
294 * instruction. This is allowed: at this point we
295 * invent a notional instruction of RESB 0.
296 */
297 result->opcode = I_RESB;
298 result->operands = 1;
299 result->oprs[0].type = IMMEDIATE;
300 result->oprs[0].offset = 0L;
301 result->oprs[0].segment = result->oprs[0].wrt = NO_SEG;
302 return result;
303 } else {
304 error(ERR_NONFATAL, "parser: instruction expected");
305 result->opcode = -1;
306 return result;
307 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000308 }
309
310 result->opcode = tokval.t_integer;
311 result->condition = tokval.t_inttwo;
312
313 /*
Charles Crayne2581c862008-09-10 19:21:52 -0700314 * INCBIN cannot be satisfied with incorrectly
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000315 * evaluated operands, since the correct values _must_ be known
316 * on the first pass. Hence, even in pass one, we set the
317 * `critical' flag on calling evaluate(), so that it will bomb
Charles Crayne2581c862008-09-10 19:21:52 -0700318 * out on undefined symbols.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000319 */
Charles Crayne2581c862008-09-10 19:21:52 -0700320 if (result->opcode == I_INCBIN) {
Charles Crayne5a7976c2008-03-26 17:20:21 -0700321 critical = (pass0 < 2 ? 1 : 2);
322
H. Peter Anvine2c80182005-01-15 22:15:51 +0000323 } else
324 critical = (pass == 2 ? 2 : 0);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000325
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700326 if (result->opcode == I_DB || result->opcode == I_DW ||
327 result->opcode == I_DD || result->opcode == I_DQ ||
328 result->opcode == I_DT || result->opcode == I_DO ||
H. Peter Anvindfb91802008-05-20 11:43:53 -0700329 result->opcode == I_DY || result->opcode == I_INCBIN) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000330 extop *eop, **tail = &result->eops, **fixptr;
331 int oper_num = 0;
H. Peter Anvin518df302008-06-14 16:53:48 -0700332 int32_t sign;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000333
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700334 result->eops_float = false;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000335
H. Peter Anvine2c80182005-01-15 22:15:51 +0000336 /*
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700337 * Begin to read the DB/DW/DD/DQ/DT/DO/INCBIN operands.
H. Peter Anvine2c80182005-01-15 22:15:51 +0000338 */
339 while (1) {
340 i = stdscan(NULL, &tokval);
341 if (i == 0)
342 break;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800343 else if (first && i == ':') {
344 insn_is_label = true;
345 goto restart_parse;
346 }
347 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000348 fixptr = tail;
349 eop = *tail = nasm_malloc(sizeof(extop));
350 tail = &eop->next;
351 eop->next = NULL;
352 eop->type = EOT_NOTHING;
353 oper_num++;
H. Peter Anvin518df302008-06-14 16:53:48 -0700354 sign = +1;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000355
H. Peter Anvin518df302008-06-14 16:53:48 -0700356 /* is_comma_next() here is to distinguish this from
357 a string used as part of an expression... */
H. Peter Anvin11627042008-06-09 20:45:19 -0700358 if (i == TOKEN_STR && is_comma_next()) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000359 eop->type = EOT_DB_STRING;
360 eop->stringval = tokval.t_charptr;
361 eop->stringlen = tokval.t_inttwo;
362 i = stdscan(NULL, &tokval); /* eat the comma */
H. Peter Anvin518df302008-06-14 16:53:48 -0700363 } else if (i == TOKEN_STRFUNC) {
364 bool parens = false;
365 const char *funcname = tokval.t_charptr;
366 enum strfunc func = tokval.t_integer;
367 i = stdscan(NULL, &tokval);
368 if (i == '(') {
369 parens = true;
370 i = stdscan(NULL, &tokval);
371 }
372 if (i != TOKEN_STR) {
373 error(ERR_NONFATAL,
374 "%s must be followed by a string constant",
375 funcname);
376 eop->type = EOT_NOTHING;
377 } else {
378 eop->type = EOT_DB_STRING_FREE;
379 eop->stringlen =
380 string_transform(tokval.t_charptr, tokval.t_inttwo,
381 &eop->stringval, func);
382 if (eop->stringlen == (size_t)-1) {
383 error(ERR_NONFATAL, "invalid string for transform");
384 eop->type = EOT_NOTHING;
385 }
386 }
387 if (parens && i && i != ')') {
388 i = stdscan(NULL, &tokval);
389 if (i != ')') {
390 error(ERR_NONFATAL, "unterminated %s function",
391 funcname);
392 }
393 }
394 if (i && i != ',')
395 i = stdscan(NULL, &tokval);
396 } else if (i == '-' || i == '+') {
397 char *save = stdscan_bufptr;
398 int token = i;
399 sign = (i == '-') ? -1 : 1;
400 i = stdscan(NULL, &tokval);
401 if (i != TOKEN_FLOAT) {
402 stdscan_bufptr = save;
403 i = tokval.t_type = token;
404 goto is_expression;
405 } else {
406 goto is_float;
407 }
408 } else if (i == TOKEN_FLOAT) {
409 is_float:
410 eop->type = EOT_DB_STRING;
411 result->eops_float = true;
412 switch (result->opcode) {
413 case I_DB:
414 eop->stringlen = 1;
415 break;
416 case I_DW:
417 eop->stringlen = 2;
418 break;
419 case I_DD:
420 eop->stringlen = 4;
421 break;
422 case I_DQ:
423 eop->stringlen = 8;
424 break;
425 case I_DT:
426 eop->stringlen = 10;
427 break;
428 case I_DO:
429 eop->stringlen = 16;
430 break;
431 case I_DY:
432 error(ERR_NONFATAL, "floating-point constant"
433 " encountered in DY instruction");
434 eop->stringlen = 0;
435 break;
436 default:
437 error(ERR_NONFATAL, "floating-point constant"
438 " encountered in unknown instruction");
439 /*
440 * fix suggested by Pedro Gimeno... original line
441 * was:
442 * eop->type = EOT_NOTHING;
443 */
444 eop->stringlen = 0;
445 break;
446 }
447 eop = nasm_realloc(eop, sizeof(extop) + eop->stringlen);
448 tail = &eop->next;
449 *fixptr = eop;
450 eop->stringval = (char *)eop + sizeof(extop);
451 if (!eop->stringlen ||
452 !float_const(tokval.t_charptr, sign,
453 (uint8_t *)eop->stringval,
454 eop->stringlen, error))
455 eop->type = EOT_NOTHING;
456 i = stdscan(NULL, &tokval); /* eat the comma */
457 } else {
458 /* anything else, assume it is an expression */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000459 expr *value;
H. Peter Anvin518df302008-06-14 16:53:48 -0700460
461 is_expression:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000462 value = evaluate(stdscan, NULL, &tokval, NULL,
463 critical, error, NULL);
464 i = tokval.t_type;
465 if (!value) { /* error in evaluator */
466 result->opcode = -1; /* unrecoverable parse error: */
467 return result; /* ignore this instruction */
468 }
469 if (is_unknown(value)) {
470 eop->type = EOT_DB_NUMBER;
471 eop->offset = 0; /* doesn't matter what we put */
472 eop->segment = eop->wrt = NO_SEG; /* likewise */
473 } else if (is_reloc(value)) {
474 eop->type = EOT_DB_NUMBER;
475 eop->offset = reloc_value(value);
476 eop->segment = reloc_seg(value);
477 eop->wrt = reloc_wrt(value);
478 } else {
479 error(ERR_NONFATAL,
480 "operand %d: expression is not simple"
481 " or relocatable", oper_num);
482 }
483 }
H. Peter Anvin6768eb72002-04-30 20:52:26 +0000484
H. Peter Anvine2c80182005-01-15 22:15:51 +0000485 /*
486 * We're about to call stdscan(), which will eat the
487 * comma that we're currently sitting on between
488 * arguments. However, we'd better check first that it
489 * _is_ a comma.
490 */
491 if (i == 0) /* also could be EOL */
492 break;
493 if (i != ',') {
494 error(ERR_NONFATAL, "comma expected after operand %d",
495 oper_num);
496 result->opcode = -1; /* unrecoverable parse error: */
497 return result; /* ignore this instruction */
498 }
499 }
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000500
H. Peter Anvine2c80182005-01-15 22:15:51 +0000501 if (result->opcode == I_INCBIN) {
502 /*
503 * Correct syntax for INCBIN is that there should be
504 * one string operand, followed by one or two numeric
505 * operands.
506 */
507 if (!result->eops || result->eops->type != EOT_DB_STRING)
508 error(ERR_NONFATAL, "`incbin' expects a file name");
509 else if (result->eops->next &&
510 result->eops->next->type != EOT_DB_NUMBER)
511 error(ERR_NONFATAL, "`incbin': second parameter is",
512 " non-numeric");
513 else if (result->eops->next && result->eops->next->next &&
514 result->eops->next->next->type != EOT_DB_NUMBER)
515 error(ERR_NONFATAL, "`incbin': third parameter is",
516 " non-numeric");
517 else if (result->eops->next && result->eops->next->next &&
518 result->eops->next->next->next)
519 error(ERR_NONFATAL,
520 "`incbin': more than three parameters");
H. Peter Anvineba20a72002-04-30 20:53:55 +0000521 else
H. Peter Anvine2c80182005-01-15 22:15:51 +0000522 return result;
523 /*
524 * If we reach here, one of the above errors happened.
525 * Throw the instruction away.
526 */
527 result->opcode = -1;
528 return result;
529 } else /* DB ... */ if (oper_num == 0)
530 error(ERR_WARNING | ERR_PASS1,
531 "no operand for data declaration");
532 else
533 result->operands = oper_num;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000534
H. Peter Anvine2c80182005-01-15 22:15:51 +0000535 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000536 }
537
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700538 /* right. Now we begin to parse the operands. There may be up to four
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000539 * of these, separated by commas, and terminated by a zero token. */
540
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700541 for (operand = 0; operand < MAX_OPERANDS; operand++) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700542 expr *value; /* used most of the time */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000543 int mref; /* is this going to be a memory ref? */
544 int bracket; /* is it a [] mref, or a & mref? */
545 int setsize = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000546
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700547 result->oprs[operand].disp_size = 0; /* have to zero this whatever */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000548 result->oprs[operand].eaflags = 0; /* and this */
549 result->oprs[operand].opflags = 0;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000550
H. Peter Anvine2c80182005-01-15 22:15:51 +0000551 i = stdscan(NULL, &tokval);
552 if (i == 0)
553 break; /* end of operands: get out of here */
H. Peter Anvin9c987692007-11-04 21:09:32 -0800554 else if (first && i == ':') {
555 insn_is_label = true;
556 goto restart_parse;
557 }
558 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000559 result->oprs[operand].type = 0; /* so far, no override */
560 while (i == TOKEN_SPECIAL) { /* size specifiers */
561 switch ((int)tokval.t_integer) {
562 case S_BYTE:
563 if (!setsize) /* we want to use only the first */
564 result->oprs[operand].type |= BITS8;
565 setsize = 1;
566 break;
567 case S_WORD:
568 if (!setsize)
569 result->oprs[operand].type |= BITS16;
570 setsize = 1;
571 break;
572 case S_DWORD:
573 case S_LONG:
574 if (!setsize)
575 result->oprs[operand].type |= BITS32;
576 setsize = 1;
577 break;
578 case S_QWORD:
579 if (!setsize)
580 result->oprs[operand].type |= BITS64;
581 setsize = 1;
582 break;
583 case S_TWORD:
584 if (!setsize)
585 result->oprs[operand].type |= BITS80;
586 setsize = 1;
587 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700588 case S_OWORD:
589 if (!setsize)
590 result->oprs[operand].type |= BITS128;
591 setsize = 1;
592 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700593 case S_YWORD:
594 if (!setsize)
595 result->oprs[operand].type |= BITS256;
596 setsize = 1;
597 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000598 case S_TO:
599 result->oprs[operand].type |= TO;
600 break;
601 case S_STRICT:
602 result->oprs[operand].type |= STRICT;
603 break;
604 case S_FAR:
605 result->oprs[operand].type |= FAR;
606 break;
607 case S_NEAR:
608 result->oprs[operand].type |= NEAR;
609 break;
610 case S_SHORT:
611 result->oprs[operand].type |= SHORT;
612 break;
613 default:
614 error(ERR_NONFATAL, "invalid operand size specification");
615 }
616 i = stdscan(NULL, &tokval);
617 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000618
H. Peter Anvine2c80182005-01-15 22:15:51 +0000619 if (i == '[' || i == '&') { /* memory reference */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700620 mref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000621 bracket = (i == '[');
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700622 i = stdscan(NULL, &tokval); /* then skip the colon */
623 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
624 process_size_override(result, operand);
625 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000626 }
627 } else { /* immediate operand, or register */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700628 mref = false;
629 bracket = false; /* placate optimisers */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000630 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000631
H. Peter Anvine2c80182005-01-15 22:15:51 +0000632 if ((result->oprs[operand].type & FAR) && !mref &&
633 result->opcode != I_JMP && result->opcode != I_CALL) {
634 error(ERR_NONFATAL, "invalid use of FAR operand specifier");
635 }
Debbie Wiles63b53f72002-06-04 19:31:24 +0000636
H. Peter Anvine2c80182005-01-15 22:15:51 +0000637 value = evaluate(stdscan, NULL, &tokval,
638 &result->oprs[operand].opflags,
639 critical, error, &hints);
640 i = tokval.t_type;
641 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700642 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000643 }
644 if (!value) { /* error in evaluator */
645 result->opcode = -1; /* unrecoverable parse error: */
646 return result; /* ignore this instruction */
647 }
648 if (i == ':' && mref) { /* it was seg:offset */
649 /*
650 * Process the segment override.
651 */
652 if (value[1].type != 0 || value->value != 1 ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700653 REG_SREG & ~nasm_reg_flags[value->type])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000654 error(ERR_NONFATAL, "invalid segment override");
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700655 else if (result->prefixes[PPS_SEG])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000656 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700657 "instruction has conflicting segment overrides");
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000658 else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700659 result->prefixes[PPS_SEG] = value->type;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700660 if (!(REG_FSGS & ~nasm_reg_flags[value->type]))
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000661 result->oprs[operand].eaflags |= EAF_FSGS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000662 }
H. Peter Anvin76690a12002-04-30 20:52:49 +0000663
H. Peter Anvine2c80182005-01-15 22:15:51 +0000664 i = stdscan(NULL, &tokval); /* then skip the colon */
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700665 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
666 process_size_override(result, operand);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000667 i = stdscan(NULL, &tokval);
668 }
669 value = evaluate(stdscan, NULL, &tokval,
670 &result->oprs[operand].opflags,
671 critical, error, &hints);
672 i = tokval.t_type;
673 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700674 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000675 }
676 /* and get the offset */
677 if (!value) { /* but, error in evaluator */
678 result->opcode = -1; /* unrecoverable parse error: */
679 return result; /* ignore this instruction */
680 }
681 }
Victor van den Elzen02846d32009-06-23 03:47:07 +0200682
H. Peter Anvin552bc2c2009-06-23 11:34:42 -0700683 recover = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000684 if (mref && bracket) { /* find ] at the end */
685 if (i != ']') {
686 error(ERR_NONFATAL, "parser: expecting ]");
Victor van den Elzen02846d32009-06-23 03:47:07 +0200687 recover = true;
688 } else { /* we got the required ] */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000689 i = stdscan(NULL, &tokval);
Victor van den Elzen02846d32009-06-23 03:47:07 +0200690 if (i != 0 && i != ',') {
691 error(ERR_NONFATAL, "comma or end of line expected");
692 recover = true;
693 }
694 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000695 } else { /* immediate operand */
696 if (i != 0 && i != ',' && i != ':') {
Victor van den Elzen02846d32009-06-23 03:47:07 +0200697 error(ERR_NONFATAL, "comma, colon or end of line expected");
698 recover = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000699 } else if (i == ':') {
700 result->oprs[operand].type |= COLON;
701 }
702 }
Victor van den Elzen02846d32009-06-23 03:47:07 +0200703 if (recover) {
704 do { /* error recovery */
705 i = stdscan(NULL, &tokval);
706 } while (i != 0 && i != ',');
707 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000708
H. Peter Anvine2c80182005-01-15 22:15:51 +0000709 /* now convert the exprs returned from evaluate() into operand
710 * descriptions... */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000711
H. Peter Anvine2c80182005-01-15 22:15:51 +0000712 if (mref) { /* it's a memory reference */
713 expr *e = value;
714 int b, i, s; /* basereg, indexreg, scale */
Keith Kanios7a68f302007-04-16 04:56:06 +0000715 int64_t o; /* offset */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000716
H. Peter Anvine2c80182005-01-15 22:15:51 +0000717 b = i = -1, o = s = 0;
718 result->oprs[operand].hintbase = hints.base;
719 result->oprs[operand].hinttype = hints.type;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000720
H. Peter Anvine2c80182005-01-15 22:15:51 +0000721 if (e->type && e->type <= EXPR_REG_END) { /* this bit's a register */
722 if (e->value == 1) /* in fact it can be basereg */
723 b = e->type;
724 else /* no, it has to be indexreg */
725 i = e->type, s = e->value;
726 e++;
727 }
728 if (e->type && e->type <= EXPR_REG_END) { /* it's a 2nd register */
729 if (b != -1) /* If the first was the base, ... */
730 i = e->type, s = e->value; /* second has to be indexreg */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000731
H. Peter Anvine2c80182005-01-15 22:15:51 +0000732 else if (e->value != 1) { /* If both want to be index */
733 error(ERR_NONFATAL,
734 "beroset-p-592-invalid effective address");
735 result->opcode = -1;
736 return result;
737 } else
738 b = e->type;
739 e++;
740 }
741 if (e->type != 0) { /* is there an offset? */
742 if (e->type <= EXPR_REG_END) { /* in fact, is there an error? */
743 error(ERR_NONFATAL,
744 "beroset-p-603-invalid effective address");
745 result->opcode = -1;
746 return result;
747 } else {
748 if (e->type == EXPR_UNKNOWN) {
Victor van den Elzen154e5922009-02-25 17:32:00 +0100749 result->oprs[operand].opflags |= OPFLAG_UNKNOWN;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000750 o = 0; /* doesn't matter what */
751 result->oprs[operand].wrt = NO_SEG; /* nor this */
752 result->oprs[operand].segment = NO_SEG; /* or this */
753 while (e->type)
754 e++; /* go to the end of the line */
755 } else {
756 if (e->type == EXPR_SIMPLE) {
757 o = e->value;
758 e++;
759 }
760 if (e->type == EXPR_WRT) {
761 result->oprs[operand].wrt = e->value;
762 e++;
763 } else
764 result->oprs[operand].wrt = NO_SEG;
765 /*
766 * Look for a segment base type.
767 */
768 if (e->type && e->type < EXPR_SEGBASE) {
769 error(ERR_NONFATAL,
770 "beroset-p-630-invalid effective address");
771 result->opcode = -1;
772 return result;
773 }
774 while (e->type && e->value == 0)
775 e++;
776 if (e->type && e->value != 1) {
777 error(ERR_NONFATAL,
778 "beroset-p-637-invalid effective address");
779 result->opcode = -1;
780 return result;
781 }
782 if (e->type) {
783 result->oprs[operand].segment =
784 e->type - EXPR_SEGBASE;
785 e++;
786 } else
787 result->oprs[operand].segment = NO_SEG;
788 while (e->type && e->value == 0)
789 e++;
790 if (e->type) {
791 error(ERR_NONFATAL,
792 "beroset-p-650-invalid effective address");
793 result->opcode = -1;
794 return result;
795 }
796 }
797 }
798 } else {
799 o = 0;
800 result->oprs[operand].wrt = NO_SEG;
801 result->oprs[operand].segment = NO_SEG;
802 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000803
H. Peter Anvine2c80182005-01-15 22:15:51 +0000804 if (e->type != 0) { /* there'd better be nothing left! */
805 error(ERR_NONFATAL,
806 "beroset-p-663-invalid effective address");
807 result->opcode = -1;
808 return result;
809 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000810
H. Peter Anvin0da6b582007-09-12 20:32:39 -0700811 /* It is memory, but it can match any r/m operand */
812 result->oprs[operand].type |= MEMORY_ANY;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000813
814 if (b == -1 && (i == -1 || s == 0)) {
815 int is_rel = globalbits == 64 &&
816 !(result->oprs[operand].eaflags & EAF_ABS) &&
817 ((globalrel &&
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000818 !(result->oprs[operand].eaflags & EAF_FSGS)) ||
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000819 (result->oprs[operand].eaflags & EAF_REL));
820
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700821 result->oprs[operand].type |= is_rel ? IP_REL : MEM_OFFS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000822 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000823 result->oprs[operand].basereg = b;
824 result->oprs[operand].indexreg = i;
825 result->oprs[operand].scale = s;
826 result->oprs[operand].offset = o;
827 } else { /* it's not a memory reference */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000828
H. Peter Anvine2c80182005-01-15 22:15:51 +0000829 if (is_just_unknown(value)) { /* it's immediate but unknown */
830 result->oprs[operand].type |= IMMEDIATE;
Victor van den Elzen154e5922009-02-25 17:32:00 +0100831 result->oprs[operand].opflags |= OPFLAG_UNKNOWN;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000832 result->oprs[operand].offset = 0; /* don't care */
833 result->oprs[operand].segment = NO_SEG; /* don't care again */
834 result->oprs[operand].wrt = NO_SEG; /* still don't care */
Victor van den Elzen154e5922009-02-25 17:32:00 +0100835
836 if(optimizing >= 0 && !(result->oprs[operand].type & STRICT))
837 {
838 /* Be optimistic */
839 result->oprs[operand].type |= SBYTE16 | SBYTE32 | SBYTE64;
840 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000841 } else if (is_reloc(value)) { /* it's immediate */
842 result->oprs[operand].type |= IMMEDIATE;
843 result->oprs[operand].offset = reloc_value(value);
844 result->oprs[operand].segment = reloc_seg(value);
845 result->oprs[operand].wrt = reloc_wrt(value);
846 if (is_simple(value)) {
847 if (reloc_value(value) == 1)
848 result->oprs[operand].type |= UNITY;
849 if (optimizing >= 0 &&
850 !(result->oprs[operand].type & STRICT)) {
H. Peter Anvin32cd4c22008-04-04 13:34:53 -0700851 int64_t v64 = reloc_value(value);
852 int32_t v32 = (int32_t)v64;
853 int16_t v16 = (int16_t)v32;
854
855 if (v64 >= -128 && v64 <= 127)
856 result->oprs[operand].type |= SBYTE64;
857 if (v32 >= -128 && v32 <= 127)
858 result->oprs[operand].type |= SBYTE32;
859 if (v16 >= -128 && v16 <= 127)
860 result->oprs[operand].type |= SBYTE16;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000861 }
862 }
863 } else { /* it's a register */
H. Peter Anvin68222142007-11-18 22:18:09 -0800864 unsigned int rs;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000865
H. Peter Anvine2c80182005-01-15 22:15:51 +0000866 if (value->type >= EXPR_SIMPLE || value->value != 1) {
867 error(ERR_NONFATAL, "invalid operand type");
868 result->opcode = -1;
869 return result;
870 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000871
H. Peter Anvine2c80182005-01-15 22:15:51 +0000872 /*
873 * check that its only 1 register, not an expression...
874 */
875 for (i = 1; value[i].type; i++)
876 if (value[i].value) {
877 error(ERR_NONFATAL, "invalid operand type");
878 result->opcode = -1;
879 return result;
880 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000881
H. Peter Anvine2c80182005-01-15 22:15:51 +0000882 /* clear overrides, except TO which applies to FPU regs */
883 if (result->oprs[operand].type & ~TO) {
884 /*
885 * we want to produce a warning iff the specified size
886 * is different from the register size
887 */
H. Peter Anvin68222142007-11-18 22:18:09 -0800888 rs = result->oprs[operand].type & SIZE_MASK;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000889 } else
H. Peter Anvin68222142007-11-18 22:18:09 -0800890 rs = 0;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000891
892 result->oprs[operand].type &= TO;
893 result->oprs[operand].type |= REGISTER;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700894 result->oprs[operand].type |= nasm_reg_flags[value->type];
H. Peter Anvine2c80182005-01-15 22:15:51 +0000895 result->oprs[operand].basereg = value->type;
896
H. Peter Anvin68222142007-11-18 22:18:09 -0800897 if (rs && (result->oprs[operand].type & SIZE_MASK) != rs)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000898 error(ERR_WARNING | ERR_PASS1,
899 "register size specification ignored");
900 }
901 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000902 }
903
H. Peter Anvine2c80182005-01-15 22:15:51 +0000904 result->operands = operand; /* set operand count */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000905
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700906/* clear remaining operands */
907while (operand < MAX_OPERANDS)
908 result->oprs[operand++].type = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000909
910 /*
H. Peter Anvindfb91802008-05-20 11:43:53 -0700911 * Transform RESW, RESD, RESQ, REST, RESO, RESY into RESB.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000912 */
913 switch (result->opcode) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000914 case I_RESW:
915 result->opcode = I_RESB;
916 result->oprs[0].offset *= 2;
917 break;
918 case I_RESD:
919 result->opcode = I_RESB;
920 result->oprs[0].offset *= 4;
921 break;
922 case I_RESQ:
923 result->opcode = I_RESB;
924 result->oprs[0].offset *= 8;
925 break;
926 case I_REST:
927 result->opcode = I_RESB;
928 result->oprs[0].offset *= 10;
929 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700930 case I_RESO:
931 result->opcode = I_RESB;
932 result->oprs[0].offset *= 16;
933 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700934 case I_RESY:
935 result->opcode = I_RESB;
936 result->oprs[0].offset *= 32;
937 break;
H. Peter Anvin16b0a332007-09-12 20:27:41 -0700938 default:
939 break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000940 }
941
942 return result;
943}
944
H. Peter Anvine2c80182005-01-15 22:15:51 +0000945static int is_comma_next(void)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000946{
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000947 char *p;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000948 int i;
949 struct tokenval tv;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000950
H. Peter Anvin76690a12002-04-30 20:52:49 +0000951 p = stdscan_bufptr;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000952 i = stdscan(NULL, &tv);
H. Peter Anvin76690a12002-04-30 20:52:49 +0000953 stdscan_bufptr = p;
954 return (i == ',' || i == ';' || !i);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000955}
956
H. Peter Anvine2c80182005-01-15 22:15:51 +0000957void cleanup_insn(insn * i)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000958{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000959 extop *e;
960
H. Peter Anvin2aa77392008-06-15 17:39:45 -0700961 while ((e = i->eops)) {
962 i->eops = e->next;
963 if (e->type == EOT_DB_STRING_FREE)
964 nasm_free(e->stringval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000965 nasm_free(e);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000966 }
967}