blob: c188095d7d08014aa01b49872e4ebe01e71f232c [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) {
49 case R_CS:
50 case R_DS:
51 case R_SS:
52 case R_ES:
53 case R_FS:
54 case R_GS:
55 return PPS_SEG;
56 case P_LOCK:
57 case P_REP:
58 case P_REPE:
59 case P_REPZ:
60 case P_REPNE:
61 case P_REPNZ:
62 return PPS_LREP;
63 case P_O16:
64 case P_O32:
65 case P_O64:
66 case P_OSP:
67 return PPS_OSIZE;
68 case P_A16:
69 case P_A32:
70 case P_A64:
71 case P_ASP:
72 return PPS_ASIZE;
73 default:
74 error(ERR_PANIC, "Invalid value %d passed to prefix_slot()", prefix);
75 return -1;
76 }
77}
78
79static void process_size_override(insn * result, int operand)
80{
81 if (tasm_compatible_mode) {
82 switch ((int)tokval.t_integer) {
83 /* For TASM compatibility a size override inside the
84 * brackets changes the size of the operand, not the
85 * address type of the operand as it does in standard
86 * NASM syntax. Hence:
87 *
88 * mov eax,[DWORD val]
89 *
90 * is valid syntax in TASM compatibility mode. Note that
91 * you lose the ability to override the default address
92 * type for the instruction, but we never use anything
93 * but 32-bit flat model addressing in our code.
94 */
95 case S_BYTE:
96 result->oprs[operand].type |= BITS8;
97 break;
98 case S_WORD:
99 result->oprs[operand].type |= BITS16;
100 break;
101 case S_DWORD:
102 case S_LONG:
103 result->oprs[operand].type |= BITS32;
104 break;
105 case S_QWORD:
106 result->oprs[operand].type |= BITS64;
107 break;
108 case S_TWORD:
109 result->oprs[operand].type |= BITS80;
110 break;
111 case S_OWORD:
112 result->oprs[operand].type |= BITS128;
113 break;
114 default:
115 error(ERR_NONFATAL,
116 "invalid operand size specification");
117 break;
118 }
119 } else {
120 /* Standard NASM compatible syntax */
121 switch ((int)tokval.t_integer) {
122 case S_NOSPLIT:
123 result->oprs[operand].eaflags |= EAF_TIMESTWO;
124 break;
125 case S_REL:
126 result->oprs[operand].eaflags |= EAF_REL;
127 break;
128 case S_ABS:
129 result->oprs[operand].eaflags |= EAF_ABS;
130 break;
131 case S_BYTE:
132 result->oprs[operand].disp_size = 8;
133 result->oprs[operand].eaflags |= EAF_BYTEOFFS;
134 break;
135 case P_A16:
136 case P_A32:
137 case P_A64:
138 if (result->prefixes[PPS_ASIZE] &&
139 result->prefixes[PPS_ASIZE] != tokval.t_integer)
140 error(ERR_NONFATAL,
141 "conflicting address size specifications");
142 else
143 result->prefixes[PPS_ASIZE] = tokval.t_integer;
144 break;
145 case S_WORD:
146 result->oprs[operand].disp_size = 16;
147 result->oprs[operand].eaflags |= EAF_WORDOFFS;
148 break;
149 case S_DWORD:
150 case S_LONG:
151 result->oprs[operand].disp_size = 32;
152 result->oprs[operand].eaflags |= EAF_WORDOFFS;
153 break;
154 case S_QWORD:
155 result->oprs[operand].disp_size = 64;
156 result->oprs[operand].eaflags |= EAF_WORDOFFS;
157 break;
158 default:
159 error(ERR_NONFATAL, "invalid size specification in"
160 " effective address");
161 break;
162 }
163 }
164}
165
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000166insn *parse_line(int pass, char *buffer, insn * result,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000167 efunc errfunc, evalfunc evaluate, ldfunc ldef)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000168{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000169 int operand;
170 int critical;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000171 struct eval_hints hints;
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700172 int j;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800173 bool first;
174 bool insn_is_label = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000175
H. Peter Anvin9c987692007-11-04 21:09:32 -0800176restart_parse:
177 first = true;
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700178 result->forw_ref = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000179 error = errfunc;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000180
H. Peter Anvin76690a12002-04-30 20:52:49 +0000181 stdscan_reset();
182 stdscan_bufptr = buffer;
183 i = stdscan(NULL, &tokval);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000184
H. Peter Anvine2c80182005-01-15 22:15:51 +0000185 result->label = NULL; /* Assume no label */
186 result->eops = NULL; /* must do this, whatever happens */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000187 result->operands = 0; /* must initialize this */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000188
H. Peter Anvine2c80182005-01-15 22:15:51 +0000189 if (i == 0) { /* blank line - ignore */
190 result->opcode = -1; /* and no instruction either */
191 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000192 }
193 if (i != TOKEN_ID && i != TOKEN_INSN && i != TOKEN_PREFIX &&
H. Peter Anvina4835d42008-05-20 14:21:29 -0700194 (i != TOKEN_REG || (REG_SREG & ~nasm_reg_flags[tokval.t_integer]))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000195 error(ERR_NONFATAL, "label or instruction expected"
196 " at start of line");
197 result->opcode = -1;
198 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000199 }
200
H. Peter Anvin9c987692007-11-04 21:09:32 -0800201 if (i == TOKEN_ID || (insn_is_label && i == TOKEN_INSN)) {
202 /* there's a label here */
203 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000204 result->label = tokval.t_charptr;
205 i = stdscan(NULL, &tokval);
206 if (i == ':') { /* skip over the optional colon */
207 i = stdscan(NULL, &tokval);
208 } else if (i == 0) {
209 error(ERR_WARNING | ERR_WARN_OL | ERR_PASS1,
210 "label alone on a line without a colon might be in error");
211 }
212 if (i != TOKEN_INSN || tokval.t_integer != I_EQU) {
213 /*
214 * FIXME: location->segment could be NO_SEG, in which case
215 * it is possible we should be passing 'abs_seg'. Look into this.
216 * Work out whether that is *really* what we should be doing.
217 * Generally fix things. I think this is right as it is, but
218 * am still not certain.
219 */
220 ldef(result->label, in_abs_seg ? abs_seg : location->segment,
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700221 location->offset, NULL, true, false, outfmt, errfunc);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000222 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000223 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000224
H. Peter Anvine2c80182005-01-15 22:15:51 +0000225 if (i == 0) {
226 result->opcode = -1; /* this line contains just a label */
227 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000228 }
229
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700230 for (j = 0; j < MAXPREFIX; j++)
231 result->prefixes[j] = P_none;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000232 result->times = 1L;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000233
234 while (i == TOKEN_PREFIX ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700235 (i == TOKEN_REG && !(REG_SREG & ~nasm_reg_flags[tokval.t_integer])))
H. Peter Anvineba20a72002-04-30 20:53:55 +0000236 {
H. Peter Anvin9c987692007-11-04 21:09:32 -0800237 first = false;
238
H. Peter Anvine2c80182005-01-15 22:15:51 +0000239 /*
240 * Handle special case: the TIMES prefix.
241 */
242 if (i == TOKEN_PREFIX && tokval.t_integer == P_TIMES) {
243 expr *value;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000244
H. Peter Anvine2c80182005-01-15 22:15:51 +0000245 i = stdscan(NULL, &tokval);
246 value =
247 evaluate(stdscan, NULL, &tokval, NULL, pass0, error, NULL);
248 i = tokval.t_type;
249 if (!value) { /* but, error in evaluator */
250 result->opcode = -1; /* unrecoverable parse error: */
251 return result; /* ignore this instruction */
252 }
253 if (!is_simple(value)) {
254 error(ERR_NONFATAL,
255 "non-constant argument supplied to TIMES");
256 result->times = 1L;
257 } else {
258 result->times = value->value;
259 if (value->value < 0) {
260 error(ERR_NONFATAL, "TIMES value %d is negative",
261 value->value);
262 result->times = 0;
263 }
264 }
265 } else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700266 int slot = prefix_slot(tokval.t_integer);
267 if (result->prefixes[slot]) {
Charles Crayne052c0bd2007-10-29 18:24:59 -0700268 if (result->prefixes[slot] == tokval.t_integer)
H. Peter Anvin9c987692007-11-04 21:09:32 -0800269 error(ERR_WARNING,
Charles Crayne052c0bd2007-10-29 18:24:59 -0700270 "instruction has redundant prefixes");
271 else
272 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700273 "instruction has conflicting prefixes");
274 }
275 result->prefixes[slot] = tokval.t_integer;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000276 i = stdscan(NULL, &tokval);
277 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000278 }
279
280 if (i != TOKEN_INSN) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700281 int j;
282 enum prefixes pfx;
283
284 for (j = 0; j < MAXPREFIX; j++)
285 if ((pfx = result->prefixes[j]) != P_none)
286 break;
H. Peter Anvincb583b92007-10-28 22:04:42 -0700287
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700288 if (i == 0 && pfx != P_none) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000289 /*
290 * Instruction prefixes are present, but no actual
291 * instruction. This is allowed: at this point we
292 * invent a notional instruction of RESB 0.
293 */
294 result->opcode = I_RESB;
295 result->operands = 1;
296 result->oprs[0].type = IMMEDIATE;
297 result->oprs[0].offset = 0L;
298 result->oprs[0].segment = result->oprs[0].wrt = NO_SEG;
299 return result;
300 } else {
301 error(ERR_NONFATAL, "parser: instruction expected");
302 result->opcode = -1;
303 return result;
304 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000305 }
306
307 result->opcode = tokval.t_integer;
308 result->condition = tokval.t_inttwo;
309
310 /*
311 * RESB, RESW and RESD cannot be satisfied with incorrectly
312 * evaluated operands, since the correct values _must_ be known
313 * on the first pass. Hence, even in pass one, we set the
314 * `critical' flag on calling evaluate(), so that it will bomb
315 * out on undefined symbols. Nasty, but there's nothing we can
316 * do about it.
317 *
318 * For the moment, EQU has the same difficulty, so we'll
319 * include that.
320 */
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700321 if (result->opcode == I_RESB || result->opcode == I_RESW ||
322 result->opcode == I_RESD || result->opcode == I_RESQ ||
323 result->opcode == I_REST || result->opcode == I_RESO ||
H. Peter Anvindfb91802008-05-20 11:43:53 -0700324 result->opcode == I_RESY ||
Charles Craynecd341802008-06-04 15:53:21 -0700325 result->opcode == I_INCBIN) {
Charles Crayne5a7976c2008-03-26 17:20:21 -0700326 critical = (pass0 < 2 ? 1 : 2);
327
H. Peter Anvine2c80182005-01-15 22:15:51 +0000328 } else
329 critical = (pass == 2 ? 2 : 0);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000330
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700331 if (result->opcode == I_DB || result->opcode == I_DW ||
332 result->opcode == I_DD || result->opcode == I_DQ ||
333 result->opcode == I_DT || result->opcode == I_DO ||
H. Peter Anvindfb91802008-05-20 11:43:53 -0700334 result->opcode == I_DY || result->opcode == I_INCBIN) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000335 extop *eop, **tail = &result->eops, **fixptr;
336 int oper_num = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000337
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700338 result->eops_float = false;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000339
H. Peter Anvine2c80182005-01-15 22:15:51 +0000340 /*
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700341 * Begin to read the DB/DW/DD/DQ/DT/DO/INCBIN operands.
H. Peter Anvine2c80182005-01-15 22:15:51 +0000342 */
343 while (1) {
344 i = stdscan(NULL, &tokval);
345 if (i == 0)
346 break;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800347 else if (first && i == ':') {
348 insn_is_label = true;
349 goto restart_parse;
350 }
351 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000352 fixptr = tail;
353 eop = *tail = nasm_malloc(sizeof(extop));
354 tail = &eop->next;
355 eop->next = NULL;
356 eop->type = EOT_NOTHING;
357 oper_num++;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000358
H. Peter Anvine2c80182005-01-15 22:15:51 +0000359 if (i == TOKEN_NUM && tokval.t_charptr && is_comma_next()) {
360 eop->type = EOT_DB_STRING;
361 eop->stringval = tokval.t_charptr;
362 eop->stringlen = tokval.t_inttwo;
363 i = stdscan(NULL, &tokval); /* eat the comma */
364 continue;
365 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000366
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700367 if ((i == TOKEN_FLOAT && is_comma_next())
368 || i == '-' || i == '+') {
369 int32_t sign = +1;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000370
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700371 if (i == '+' || i == '-') {
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000372 char *save = stdscan_bufptr;
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700373 int token = i;
374 sign = (i == '-') ? -1 : 1;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000375 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000376 if (i != TOKEN_FLOAT || !is_comma_next()) {
377 stdscan_bufptr = save;
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700378 i = tokval.t_type = token;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000379 }
380 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000381
H. Peter Anvine2c80182005-01-15 22:15:51 +0000382 if (i == TOKEN_FLOAT) {
383 eop->type = EOT_DB_STRING;
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700384 result->eops_float = true;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700385 switch (result->opcode) {
H. Peter Anvin2ce02742007-10-29 20:20:12 -0700386 case I_DB:
387 eop->stringlen = 1;
388 break;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700389 case I_DW:
390 eop->stringlen = 2;
391 break;
392 case I_DD:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000393 eop->stringlen = 4;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700394 break;
395 case I_DQ:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000396 eop->stringlen = 8;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700397 break;
398 case I_DT:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000399 eop->stringlen = 10;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700400 break;
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700401 case I_DO:
402 eop->stringlen = 16;
403 break;
H. Peter Anvin3be5d852008-05-20 14:49:32 -0700404 case I_DY:
405 error(ERR_NONFATAL, "floating-point constant"
406 " encountered in DY instruction");
407 eop->stringlen = 0;
408 break;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700409 default:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000410 error(ERR_NONFATAL, "floating-point constant"
H. Peter Anvin2ce02742007-10-29 20:20:12 -0700411 " encountered in unknown instruction");
H. Peter Anvine2c80182005-01-15 22:15:51 +0000412 /*
413 * fix suggested by Pedro Gimeno... original line
414 * was:
415 * eop->type = EOT_NOTHING;
416 */
417 eop->stringlen = 0;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700418 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000419 }
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700420 eop = nasm_realloc(eop, sizeof(extop) + eop->stringlen);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000421 tail = &eop->next;
422 *fixptr = eop;
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000423 eop->stringval = (char *)eop + sizeof(extop);
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700424 if (!eop->stringlen ||
H. Peter Anvine2c80182005-01-15 22:15:51 +0000425 !float_const(tokval.t_charptr, sign,
Keith Kaniosb7a89542007-04-12 02:40:54 +0000426 (uint8_t *)eop->stringval,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000427 eop->stringlen, error))
428 eop->type = EOT_NOTHING;
429 i = stdscan(NULL, &tokval); /* eat the comma */
430 continue;
431 }
432 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000433
H. Peter Anvine2c80182005-01-15 22:15:51 +0000434 /* anything else */
435 {
436 expr *value;
437 value = evaluate(stdscan, NULL, &tokval, NULL,
438 critical, error, NULL);
439 i = tokval.t_type;
440 if (!value) { /* error in evaluator */
441 result->opcode = -1; /* unrecoverable parse error: */
442 return result; /* ignore this instruction */
443 }
444 if (is_unknown(value)) {
445 eop->type = EOT_DB_NUMBER;
446 eop->offset = 0; /* doesn't matter what we put */
447 eop->segment = eop->wrt = NO_SEG; /* likewise */
448 } else if (is_reloc(value)) {
449 eop->type = EOT_DB_NUMBER;
450 eop->offset = reloc_value(value);
451 eop->segment = reloc_seg(value);
452 eop->wrt = reloc_wrt(value);
453 } else {
454 error(ERR_NONFATAL,
455 "operand %d: expression is not simple"
456 " or relocatable", oper_num);
457 }
458 }
H. Peter Anvin6768eb72002-04-30 20:52:26 +0000459
H. Peter Anvine2c80182005-01-15 22:15:51 +0000460 /*
461 * We're about to call stdscan(), which will eat the
462 * comma that we're currently sitting on between
463 * arguments. However, we'd better check first that it
464 * _is_ a comma.
465 */
466 if (i == 0) /* also could be EOL */
467 break;
468 if (i != ',') {
469 error(ERR_NONFATAL, "comma expected after operand %d",
470 oper_num);
471 result->opcode = -1; /* unrecoverable parse error: */
472 return result; /* ignore this instruction */
473 }
474 }
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000475
H. Peter Anvine2c80182005-01-15 22:15:51 +0000476 if (result->opcode == I_INCBIN) {
477 /*
478 * Correct syntax for INCBIN is that there should be
479 * one string operand, followed by one or two numeric
480 * operands.
481 */
482 if (!result->eops || result->eops->type != EOT_DB_STRING)
483 error(ERR_NONFATAL, "`incbin' expects a file name");
484 else if (result->eops->next &&
485 result->eops->next->type != EOT_DB_NUMBER)
486 error(ERR_NONFATAL, "`incbin': second parameter is",
487 " non-numeric");
488 else if (result->eops->next && result->eops->next->next &&
489 result->eops->next->next->type != EOT_DB_NUMBER)
490 error(ERR_NONFATAL, "`incbin': third parameter is",
491 " non-numeric");
492 else if (result->eops->next && result->eops->next->next &&
493 result->eops->next->next->next)
494 error(ERR_NONFATAL,
495 "`incbin': more than three parameters");
H. Peter Anvineba20a72002-04-30 20:53:55 +0000496 else
H. Peter Anvine2c80182005-01-15 22:15:51 +0000497 return result;
498 /*
499 * If we reach here, one of the above errors happened.
500 * Throw the instruction away.
501 */
502 result->opcode = -1;
503 return result;
504 } else /* DB ... */ if (oper_num == 0)
505 error(ERR_WARNING | ERR_PASS1,
506 "no operand for data declaration");
507 else
508 result->operands = oper_num;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000509
H. Peter Anvine2c80182005-01-15 22:15:51 +0000510 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000511 }
512
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700513 /* right. Now we begin to parse the operands. There may be up to four
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000514 * of these, separated by commas, and terminated by a zero token. */
515
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700516 for (operand = 0; operand < MAX_OPERANDS; operand++) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700517 expr *value; /* used most of the time */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000518 int mref; /* is this going to be a memory ref? */
519 int bracket; /* is it a [] mref, or a & mref? */
520 int setsize = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000521
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700522 result->oprs[operand].disp_size = 0; /* have to zero this whatever */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000523 result->oprs[operand].eaflags = 0; /* and this */
524 result->oprs[operand].opflags = 0;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000525
H. Peter Anvine2c80182005-01-15 22:15:51 +0000526 i = stdscan(NULL, &tokval);
527 if (i == 0)
528 break; /* end of operands: get out of here */
H. Peter Anvin9c987692007-11-04 21:09:32 -0800529 else if (first && i == ':') {
530 insn_is_label = true;
531 goto restart_parse;
532 }
533 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000534 result->oprs[operand].type = 0; /* so far, no override */
535 while (i == TOKEN_SPECIAL) { /* size specifiers */
536 switch ((int)tokval.t_integer) {
537 case S_BYTE:
538 if (!setsize) /* we want to use only the first */
539 result->oprs[operand].type |= BITS8;
540 setsize = 1;
541 break;
542 case S_WORD:
543 if (!setsize)
544 result->oprs[operand].type |= BITS16;
545 setsize = 1;
546 break;
547 case S_DWORD:
548 case S_LONG:
549 if (!setsize)
550 result->oprs[operand].type |= BITS32;
551 setsize = 1;
552 break;
553 case S_QWORD:
554 if (!setsize)
555 result->oprs[operand].type |= BITS64;
556 setsize = 1;
557 break;
558 case S_TWORD:
559 if (!setsize)
560 result->oprs[operand].type |= BITS80;
561 setsize = 1;
562 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700563 case S_OWORD:
564 if (!setsize)
565 result->oprs[operand].type |= BITS128;
566 setsize = 1;
567 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700568 case S_YWORD:
569 if (!setsize)
570 result->oprs[operand].type |= BITS256;
571 setsize = 1;
572 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000573 case S_TO:
574 result->oprs[operand].type |= TO;
575 break;
576 case S_STRICT:
577 result->oprs[operand].type |= STRICT;
578 break;
579 case S_FAR:
580 result->oprs[operand].type |= FAR;
581 break;
582 case S_NEAR:
583 result->oprs[operand].type |= NEAR;
584 break;
585 case S_SHORT:
586 result->oprs[operand].type |= SHORT;
587 break;
588 default:
589 error(ERR_NONFATAL, "invalid operand size specification");
590 }
591 i = stdscan(NULL, &tokval);
592 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000593
H. Peter Anvine2c80182005-01-15 22:15:51 +0000594 if (i == '[' || i == '&') { /* memory reference */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700595 mref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000596 bracket = (i == '[');
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700597 i = stdscan(NULL, &tokval); /* then skip the colon */
598 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
599 process_size_override(result, operand);
600 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000601 }
602 } else { /* immediate operand, or register */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700603 mref = false;
604 bracket = false; /* placate optimisers */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000605 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000606
H. Peter Anvine2c80182005-01-15 22:15:51 +0000607 if ((result->oprs[operand].type & FAR) && !mref &&
608 result->opcode != I_JMP && result->opcode != I_CALL) {
609 error(ERR_NONFATAL, "invalid use of FAR operand specifier");
610 }
Debbie Wiles63b53f72002-06-04 19:31:24 +0000611
H. Peter Anvine2c80182005-01-15 22:15:51 +0000612 value = evaluate(stdscan, NULL, &tokval,
613 &result->oprs[operand].opflags,
614 critical, error, &hints);
615 i = tokval.t_type;
616 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700617 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000618 }
619 if (!value) { /* error in evaluator */
620 result->opcode = -1; /* unrecoverable parse error: */
621 return result; /* ignore this instruction */
622 }
623 if (i == ':' && mref) { /* it was seg:offset */
624 /*
625 * Process the segment override.
626 */
627 if (value[1].type != 0 || value->value != 1 ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700628 REG_SREG & ~nasm_reg_flags[value->type])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000629 error(ERR_NONFATAL, "invalid segment override");
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700630 else if (result->prefixes[PPS_SEG])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000631 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700632 "instruction has conflicting segment overrides");
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000633 else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700634 result->prefixes[PPS_SEG] = value->type;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700635 if (!(REG_FSGS & ~nasm_reg_flags[value->type]))
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000636 result->oprs[operand].eaflags |= EAF_FSGS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000637 }
H. Peter Anvin76690a12002-04-30 20:52:49 +0000638
H. Peter Anvine2c80182005-01-15 22:15:51 +0000639 i = stdscan(NULL, &tokval); /* then skip the colon */
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700640 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
641 process_size_override(result, operand);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000642 i = stdscan(NULL, &tokval);
643 }
644 value = evaluate(stdscan, NULL, &tokval,
645 &result->oprs[operand].opflags,
646 critical, error, &hints);
647 i = tokval.t_type;
648 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700649 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000650 }
651 /* and get the offset */
652 if (!value) { /* but, error in evaluator */
653 result->opcode = -1; /* unrecoverable parse error: */
654 return result; /* ignore this instruction */
655 }
656 }
657 if (mref && bracket) { /* find ] at the end */
658 if (i != ']') {
659 error(ERR_NONFATAL, "parser: expecting ]");
660 do { /* error recovery again */
661 i = stdscan(NULL, &tokval);
662 } while (i != 0 && i != ',');
663 } else /* we got the required ] */
664 i = stdscan(NULL, &tokval);
665 } else { /* immediate operand */
666 if (i != 0 && i != ',' && i != ':') {
667 error(ERR_NONFATAL, "comma or end of line expected");
668 do { /* error recovery */
669 i = stdscan(NULL, &tokval);
670 } while (i != 0 && i != ',');
671 } else if (i == ':') {
672 result->oprs[operand].type |= COLON;
673 }
674 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000675
H. Peter Anvine2c80182005-01-15 22:15:51 +0000676 /* now convert the exprs returned from evaluate() into operand
677 * descriptions... */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000678
H. Peter Anvine2c80182005-01-15 22:15:51 +0000679 if (mref) { /* it's a memory reference */
680 expr *e = value;
681 int b, i, s; /* basereg, indexreg, scale */
Keith Kanios7a68f302007-04-16 04:56:06 +0000682 int64_t o; /* offset */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000683
H. Peter Anvine2c80182005-01-15 22:15:51 +0000684 b = i = -1, o = s = 0;
685 result->oprs[operand].hintbase = hints.base;
686 result->oprs[operand].hinttype = hints.type;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000687
H. Peter Anvine2c80182005-01-15 22:15:51 +0000688 if (e->type && e->type <= EXPR_REG_END) { /* this bit's a register */
689 if (e->value == 1) /* in fact it can be basereg */
690 b = e->type;
691 else /* no, it has to be indexreg */
692 i = e->type, s = e->value;
693 e++;
694 }
695 if (e->type && e->type <= EXPR_REG_END) { /* it's a 2nd register */
696 if (b != -1) /* If the first was the base, ... */
697 i = e->type, s = e->value; /* second has to be indexreg */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000698
H. Peter Anvine2c80182005-01-15 22:15:51 +0000699 else if (e->value != 1) { /* If both want to be index */
700 error(ERR_NONFATAL,
701 "beroset-p-592-invalid effective address");
702 result->opcode = -1;
703 return result;
704 } else
705 b = e->type;
706 e++;
707 }
708 if (e->type != 0) { /* is there an offset? */
709 if (e->type <= EXPR_REG_END) { /* in fact, is there an error? */
710 error(ERR_NONFATAL,
711 "beroset-p-603-invalid effective address");
712 result->opcode = -1;
713 return result;
714 } else {
715 if (e->type == EXPR_UNKNOWN) {
716 o = 0; /* doesn't matter what */
717 result->oprs[operand].wrt = NO_SEG; /* nor this */
718 result->oprs[operand].segment = NO_SEG; /* or this */
719 while (e->type)
720 e++; /* go to the end of the line */
721 } else {
722 if (e->type == EXPR_SIMPLE) {
723 o = e->value;
724 e++;
725 }
726 if (e->type == EXPR_WRT) {
727 result->oprs[operand].wrt = e->value;
728 e++;
729 } else
730 result->oprs[operand].wrt = NO_SEG;
731 /*
732 * Look for a segment base type.
733 */
734 if (e->type && e->type < EXPR_SEGBASE) {
735 error(ERR_NONFATAL,
736 "beroset-p-630-invalid effective address");
737 result->opcode = -1;
738 return result;
739 }
740 while (e->type && e->value == 0)
741 e++;
742 if (e->type && e->value != 1) {
743 error(ERR_NONFATAL,
744 "beroset-p-637-invalid effective address");
745 result->opcode = -1;
746 return result;
747 }
748 if (e->type) {
749 result->oprs[operand].segment =
750 e->type - EXPR_SEGBASE;
751 e++;
752 } else
753 result->oprs[operand].segment = NO_SEG;
754 while (e->type && e->value == 0)
755 e++;
756 if (e->type) {
757 error(ERR_NONFATAL,
758 "beroset-p-650-invalid effective address");
759 result->opcode = -1;
760 return result;
761 }
762 }
763 }
764 } else {
765 o = 0;
766 result->oprs[operand].wrt = NO_SEG;
767 result->oprs[operand].segment = NO_SEG;
768 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000769
H. Peter Anvine2c80182005-01-15 22:15:51 +0000770 if (e->type != 0) { /* there'd better be nothing left! */
771 error(ERR_NONFATAL,
772 "beroset-p-663-invalid effective address");
773 result->opcode = -1;
774 return result;
775 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000776
H. Peter Anvin0da6b582007-09-12 20:32:39 -0700777 /* It is memory, but it can match any r/m operand */
778 result->oprs[operand].type |= MEMORY_ANY;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000779
780 if (b == -1 && (i == -1 || s == 0)) {
781 int is_rel = globalbits == 64 &&
782 !(result->oprs[operand].eaflags & EAF_ABS) &&
783 ((globalrel &&
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000784 !(result->oprs[operand].eaflags & EAF_FSGS)) ||
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000785 (result->oprs[operand].eaflags & EAF_REL));
786
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700787 result->oprs[operand].type |= is_rel ? IP_REL : MEM_OFFS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000788 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000789 result->oprs[operand].basereg = b;
790 result->oprs[operand].indexreg = i;
791 result->oprs[operand].scale = s;
792 result->oprs[operand].offset = o;
793 } else { /* it's not a memory reference */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000794
H. Peter Anvine2c80182005-01-15 22:15:51 +0000795 if (is_just_unknown(value)) { /* it's immediate but unknown */
796 result->oprs[operand].type |= IMMEDIATE;
797 result->oprs[operand].offset = 0; /* don't care */
798 result->oprs[operand].segment = NO_SEG; /* don't care again */
799 result->oprs[operand].wrt = NO_SEG; /* still don't care */
800 } else if (is_reloc(value)) { /* it's immediate */
801 result->oprs[operand].type |= IMMEDIATE;
802 result->oprs[operand].offset = reloc_value(value);
803 result->oprs[operand].segment = reloc_seg(value);
804 result->oprs[operand].wrt = reloc_wrt(value);
805 if (is_simple(value)) {
806 if (reloc_value(value) == 1)
807 result->oprs[operand].type |= UNITY;
808 if (optimizing >= 0 &&
809 !(result->oprs[operand].type & STRICT)) {
H. Peter Anvin32cd4c22008-04-04 13:34:53 -0700810 int64_t v64 = reloc_value(value);
811 int32_t v32 = (int32_t)v64;
812 int16_t v16 = (int16_t)v32;
813
814 if (v64 >= -128 && v64 <= 127)
815 result->oprs[operand].type |= SBYTE64;
816 if (v32 >= -128 && v32 <= 127)
817 result->oprs[operand].type |= SBYTE32;
818 if (v16 >= -128 && v16 <= 127)
819 result->oprs[operand].type |= SBYTE16;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000820 }
821 }
822 } else { /* it's a register */
H. Peter Anvin68222142007-11-18 22:18:09 -0800823 unsigned int rs;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000824
H. Peter Anvine2c80182005-01-15 22:15:51 +0000825 if (value->type >= EXPR_SIMPLE || value->value != 1) {
826 error(ERR_NONFATAL, "invalid operand type");
827 result->opcode = -1;
828 return result;
829 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000830
H. Peter Anvine2c80182005-01-15 22:15:51 +0000831 /*
832 * check that its only 1 register, not an expression...
833 */
834 for (i = 1; value[i].type; i++)
835 if (value[i].value) {
836 error(ERR_NONFATAL, "invalid operand type");
837 result->opcode = -1;
838 return result;
839 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000840
H. Peter Anvine2c80182005-01-15 22:15:51 +0000841 /* clear overrides, except TO which applies to FPU regs */
842 if (result->oprs[operand].type & ~TO) {
843 /*
844 * we want to produce a warning iff the specified size
845 * is different from the register size
846 */
H. Peter Anvin68222142007-11-18 22:18:09 -0800847 rs = result->oprs[operand].type & SIZE_MASK;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000848 } else
H. Peter Anvin68222142007-11-18 22:18:09 -0800849 rs = 0;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000850
851 result->oprs[operand].type &= TO;
852 result->oprs[operand].type |= REGISTER;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700853 result->oprs[operand].type |= nasm_reg_flags[value->type];
H. Peter Anvine2c80182005-01-15 22:15:51 +0000854 result->oprs[operand].basereg = value->type;
855
H. Peter Anvin68222142007-11-18 22:18:09 -0800856 if (rs && (result->oprs[operand].type & SIZE_MASK) != rs)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000857 error(ERR_WARNING | ERR_PASS1,
858 "register size specification ignored");
859 }
860 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000861 }
862
H. Peter Anvine2c80182005-01-15 22:15:51 +0000863 result->operands = operand; /* set operand count */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000864
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700865/* clear remaining operands */
866while (operand < MAX_OPERANDS)
867 result->oprs[operand++].type = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000868
869 /*
H. Peter Anvindfb91802008-05-20 11:43:53 -0700870 * Transform RESW, RESD, RESQ, REST, RESO, RESY into RESB.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000871 */
872 switch (result->opcode) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000873 case I_RESW:
874 result->opcode = I_RESB;
875 result->oprs[0].offset *= 2;
876 break;
877 case I_RESD:
878 result->opcode = I_RESB;
879 result->oprs[0].offset *= 4;
880 break;
881 case I_RESQ:
882 result->opcode = I_RESB;
883 result->oprs[0].offset *= 8;
884 break;
885 case I_REST:
886 result->opcode = I_RESB;
887 result->oprs[0].offset *= 10;
888 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700889 case I_RESO:
890 result->opcode = I_RESB;
891 result->oprs[0].offset *= 16;
892 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700893 case I_RESY:
894 result->opcode = I_RESB;
895 result->oprs[0].offset *= 32;
896 break;
H. Peter Anvin16b0a332007-09-12 20:27:41 -0700897 default:
898 break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000899 }
900
901 return result;
902}
903
H. Peter Anvine2c80182005-01-15 22:15:51 +0000904static int is_comma_next(void)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000905{
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000906 char *p;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000907 int i;
908 struct tokenval tv;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000909
H. Peter Anvin76690a12002-04-30 20:52:49 +0000910 p = stdscan_bufptr;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000911 i = stdscan(NULL, &tv);
H. Peter Anvin76690a12002-04-30 20:52:49 +0000912 stdscan_bufptr = p;
913 return (i == ',' || i == ';' || !i);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000914}
915
H. Peter Anvine2c80182005-01-15 22:15:51 +0000916void cleanup_insn(insn * i)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000917{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000918 extop *e;
919
920 while (i->eops) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000921 e = i->eops;
922 i->eops = i->eops->next;
923 nasm_free(e);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000924 }
925}