blob: 5983af544562ddf96df8eae47d01ec87964b31f8 [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"
26
H. Peter Anvine2c80182005-01-15 22:15:51 +000027extern int in_abs_seg; /* ABSOLUTE segment flag */
Keith Kaniosb7a89542007-04-12 02:40:54 +000028extern int32_t abs_seg; /* ABSOLUTE segment */
29extern int32_t abs_offset; /* ABSOLUTE segment offset */
H. Peter Anvind0e365d2002-05-26 18:19:19 +000030
H. Peter Anvine2c80182005-01-15 22:15:51 +000031#include "regflags.c" /* List of register flags */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000032
H. Peter Anvine2c80182005-01-15 22:15:51 +000033static int is_comma_next(void);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000034
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000035static int i;
36static struct tokenval tokval;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000037static efunc error;
H. Peter Anvine2c80182005-01-15 22:15:51 +000038static struct ofmt *outfmt; /* Structure of addresses of output routines */
H. Peter Anvin12e46512007-10-03 21:30:57 -070039static struct location *location; /* Pointer to current line's segment,offset */
H. Peter Anvineba20a72002-04-30 20:53:55 +000040
H. Peter Anvin12e46512007-10-03 21:30:57 -070041void parser_global_info(struct ofmt *output, struct location * locp)
H. Peter Anvineba20a72002-04-30 20:53:55 +000042{
43 outfmt = output;
44 location = locp;
45}
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000046
H. Peter Anvinde4b89b2007-10-01 15:41:25 -070047static int prefix_slot(enum prefixes prefix)
48{
49 switch (prefix) {
50 case R_CS:
51 case R_DS:
52 case R_SS:
53 case R_ES:
54 case R_FS:
55 case R_GS:
56 return PPS_SEG;
57 case P_LOCK:
58 case P_REP:
59 case P_REPE:
60 case P_REPZ:
61 case P_REPNE:
62 case P_REPNZ:
63 return PPS_LREP;
64 case P_O16:
65 case P_O32:
66 case P_O64:
67 case P_OSP:
68 return PPS_OSIZE;
69 case P_A16:
70 case P_A32:
71 case P_A64:
72 case P_ASP:
73 return PPS_ASIZE;
74 default:
75 error(ERR_PANIC, "Invalid value %d passed to prefix_slot()", prefix);
76 return -1;
77 }
78}
79
80static void process_size_override(insn * result, int operand)
81{
82 if (tasm_compatible_mode) {
83 switch ((int)tokval.t_integer) {
84 /* For TASM compatibility a size override inside the
85 * brackets changes the size of the operand, not the
86 * address type of the operand as it does in standard
87 * NASM syntax. Hence:
88 *
89 * mov eax,[DWORD val]
90 *
91 * is valid syntax in TASM compatibility mode. Note that
92 * you lose the ability to override the default address
93 * type for the instruction, but we never use anything
94 * but 32-bit flat model addressing in our code.
95 */
96 case S_BYTE:
97 result->oprs[operand].type |= BITS8;
98 break;
99 case S_WORD:
100 result->oprs[operand].type |= BITS16;
101 break;
102 case S_DWORD:
103 case S_LONG:
104 result->oprs[operand].type |= BITS32;
105 break;
106 case S_QWORD:
107 result->oprs[operand].type |= BITS64;
108 break;
109 case S_TWORD:
110 result->oprs[operand].type |= BITS80;
111 break;
112 case S_OWORD:
113 result->oprs[operand].type |= BITS128;
114 break;
115 default:
116 error(ERR_NONFATAL,
117 "invalid operand size specification");
118 break;
119 }
120 } else {
121 /* Standard NASM compatible syntax */
122 switch ((int)tokval.t_integer) {
123 case S_NOSPLIT:
124 result->oprs[operand].eaflags |= EAF_TIMESTWO;
125 break;
126 case S_REL:
127 result->oprs[operand].eaflags |= EAF_REL;
128 break;
129 case S_ABS:
130 result->oprs[operand].eaflags |= EAF_ABS;
131 break;
132 case S_BYTE:
133 result->oprs[operand].disp_size = 8;
134 result->oprs[operand].eaflags |= EAF_BYTEOFFS;
135 break;
136 case P_A16:
137 case P_A32:
138 case P_A64:
139 if (result->prefixes[PPS_ASIZE] &&
140 result->prefixes[PPS_ASIZE] != tokval.t_integer)
141 error(ERR_NONFATAL,
142 "conflicting address size specifications");
143 else
144 result->prefixes[PPS_ASIZE] = tokval.t_integer;
145 break;
146 case S_WORD:
147 result->oprs[operand].disp_size = 16;
148 result->oprs[operand].eaflags |= EAF_WORDOFFS;
149 break;
150 case S_DWORD:
151 case S_LONG:
152 result->oprs[operand].disp_size = 32;
153 result->oprs[operand].eaflags |= EAF_WORDOFFS;
154 break;
155 case S_QWORD:
156 result->oprs[operand].disp_size = 64;
157 result->oprs[operand].eaflags |= EAF_WORDOFFS;
158 break;
159 default:
160 error(ERR_NONFATAL, "invalid size specification in"
161 " effective address");
162 break;
163 }
164 }
165}
166
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000167insn *parse_line(int pass, char *buffer, insn * result,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000168 efunc errfunc, evalfunc evaluate, ldfunc ldef)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000169{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000170 int operand;
171 int critical;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000172 struct eval_hints hints;
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700173 int j;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800174 bool first;
175 bool insn_is_label = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000176
H. Peter Anvin9c987692007-11-04 21:09:32 -0800177restart_parse:
178 first = true;
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700179 result->forw_ref = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000180 error = errfunc;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000181
H. Peter Anvin76690a12002-04-30 20:52:49 +0000182 stdscan_reset();
183 stdscan_bufptr = buffer;
184 i = stdscan(NULL, &tokval);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000185
H. Peter Anvine2c80182005-01-15 22:15:51 +0000186 result->label = NULL; /* Assume no label */
187 result->eops = NULL; /* must do this, whatever happens */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000188 result->operands = 0; /* must initialize this */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000189
H. Peter Anvine2c80182005-01-15 22:15:51 +0000190 if (i == 0) { /* blank line - ignore */
191 result->opcode = -1; /* and no instruction either */
192 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000193 }
194 if (i != TOKEN_ID && i != TOKEN_INSN && i != TOKEN_PREFIX &&
H. Peter Anvine2c80182005-01-15 22:15:51 +0000195 (i != TOKEN_REG || (REG_SREG & ~reg_flags[tokval.t_integer]))) {
196 error(ERR_NONFATAL, "label or instruction expected"
197 " at start of line");
198 result->opcode = -1;
199 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000200 }
201
H. Peter Anvin9c987692007-11-04 21:09:32 -0800202 if (i == TOKEN_ID || (insn_is_label && i == TOKEN_INSN)) {
203 /* there's a label here */
204 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000205 result->label = tokval.t_charptr;
206 i = stdscan(NULL, &tokval);
207 if (i == ':') { /* skip over the optional colon */
208 i = stdscan(NULL, &tokval);
209 } else if (i == 0) {
210 error(ERR_WARNING | ERR_WARN_OL | ERR_PASS1,
211 "label alone on a line without a colon might be in error");
212 }
213 if (i != TOKEN_INSN || tokval.t_integer != I_EQU) {
214 /*
215 * FIXME: location->segment could be NO_SEG, in which case
216 * it is possible we should be passing 'abs_seg'. Look into this.
217 * Work out whether that is *really* what we should be doing.
218 * Generally fix things. I think this is right as it is, but
219 * am still not certain.
220 */
221 ldef(result->label, in_abs_seg ? abs_seg : location->segment,
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700222 location->offset, NULL, true, false, outfmt, errfunc);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000223 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000224 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000225
H. Peter Anvine2c80182005-01-15 22:15:51 +0000226 if (i == 0) {
227 result->opcode = -1; /* this line contains just a label */
228 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000229 }
230
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700231 for (j = 0; j < MAXPREFIX; j++)
232 result->prefixes[j] = P_none;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000233 result->times = 1L;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000234
235 while (i == TOKEN_PREFIX ||
H. Peter Anvine2c80182005-01-15 22:15:51 +0000236 (i == TOKEN_REG && !(REG_SREG & ~reg_flags[tokval.t_integer])))
H. Peter Anvineba20a72002-04-30 20:53:55 +0000237 {
H. Peter Anvin9c987692007-11-04 21:09:32 -0800238 first = false;
239
H. Peter Anvine2c80182005-01-15 22:15:51 +0000240 /*
241 * Handle special case: the TIMES prefix.
242 */
243 if (i == TOKEN_PREFIX && tokval.t_integer == P_TIMES) {
244 expr *value;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000245
H. Peter Anvine2c80182005-01-15 22:15:51 +0000246 i = stdscan(NULL, &tokval);
247 value =
248 evaluate(stdscan, NULL, &tokval, NULL, pass0, error, NULL);
249 i = tokval.t_type;
250 if (!value) { /* but, error in evaluator */
251 result->opcode = -1; /* unrecoverable parse error: */
252 return result; /* ignore this instruction */
253 }
254 if (!is_simple(value)) {
255 error(ERR_NONFATAL,
256 "non-constant argument supplied to TIMES");
257 result->times = 1L;
258 } else {
259 result->times = value->value;
260 if (value->value < 0) {
261 error(ERR_NONFATAL, "TIMES value %d is negative",
262 value->value);
263 result->times = 0;
264 }
265 }
266 } else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700267 int slot = prefix_slot(tokval.t_integer);
268 if (result->prefixes[slot]) {
Charles Crayne052c0bd2007-10-29 18:24:59 -0700269 if (result->prefixes[slot] == tokval.t_integer)
H. Peter Anvin9c987692007-11-04 21:09:32 -0800270 error(ERR_WARNING,
Charles Crayne052c0bd2007-10-29 18:24:59 -0700271 "instruction has redundant prefixes");
272 else
273 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700274 "instruction has conflicting prefixes");
275 }
276 result->prefixes[slot] = tokval.t_integer;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000277 i = stdscan(NULL, &tokval);
278 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000279 }
280
281 if (i != TOKEN_INSN) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700282 int j;
283 enum prefixes pfx;
284
285 for (j = 0; j < MAXPREFIX; j++)
286 if ((pfx = result->prefixes[j]) != P_none)
287 break;
H. Peter Anvincb583b92007-10-28 22:04:42 -0700288
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700289 if (i == 0 && pfx != P_none) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000290 /*
291 * Instruction prefixes are present, but no actual
292 * instruction. This is allowed: at this point we
293 * invent a notional instruction of RESB 0.
294 */
295 result->opcode = I_RESB;
296 result->operands = 1;
297 result->oprs[0].type = IMMEDIATE;
298 result->oprs[0].offset = 0L;
299 result->oprs[0].segment = result->oprs[0].wrt = NO_SEG;
300 return result;
301 } else {
302 error(ERR_NONFATAL, "parser: instruction expected");
303 result->opcode = -1;
304 return result;
305 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000306 }
307
308 result->opcode = tokval.t_integer;
309 result->condition = tokval.t_inttwo;
310
311 /*
312 * RESB, RESW and RESD cannot be satisfied with incorrectly
313 * evaluated operands, since the correct values _must_ be known
314 * on the first pass. Hence, even in pass one, we set the
315 * `critical' flag on calling evaluate(), so that it will bomb
316 * out on undefined symbols. Nasty, but there's nothing we can
317 * do about it.
318 *
319 * For the moment, EQU has the same difficulty, so we'll
320 * include that.
321 */
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700322 if (result->opcode == I_RESB || result->opcode == I_RESW ||
323 result->opcode == I_RESD || result->opcode == I_RESQ ||
324 result->opcode == I_REST || result->opcode == I_RESO ||
325 result->opcode == I_EQU || 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 ||
334 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 Anvin141d7cf2007-09-18 16:39:03 -0700404 default:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000405 error(ERR_NONFATAL, "floating-point constant"
H. Peter Anvin2ce02742007-10-29 20:20:12 -0700406 " encountered in unknown instruction");
H. Peter Anvine2c80182005-01-15 22:15:51 +0000407 /*
408 * fix suggested by Pedro Gimeno... original line
409 * was:
410 * eop->type = EOT_NOTHING;
411 */
412 eop->stringlen = 0;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700413 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000414 }
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700415 eop = nasm_realloc(eop, sizeof(extop) + eop->stringlen);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000416 tail = &eop->next;
417 *fixptr = eop;
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000418 eop->stringval = (char *)eop + sizeof(extop);
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700419 if (!eop->stringlen ||
H. Peter Anvine2c80182005-01-15 22:15:51 +0000420 !float_const(tokval.t_charptr, sign,
Keith Kaniosb7a89542007-04-12 02:40:54 +0000421 (uint8_t *)eop->stringval,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000422 eop->stringlen, error))
423 eop->type = EOT_NOTHING;
424 i = stdscan(NULL, &tokval); /* eat the comma */
425 continue;
426 }
427 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000428
H. Peter Anvine2c80182005-01-15 22:15:51 +0000429 /* anything else */
430 {
431 expr *value;
432 value = evaluate(stdscan, NULL, &tokval, NULL,
433 critical, error, NULL);
434 i = tokval.t_type;
435 if (!value) { /* error in evaluator */
436 result->opcode = -1; /* unrecoverable parse error: */
437 return result; /* ignore this instruction */
438 }
439 if (is_unknown(value)) {
440 eop->type = EOT_DB_NUMBER;
441 eop->offset = 0; /* doesn't matter what we put */
442 eop->segment = eop->wrt = NO_SEG; /* likewise */
443 } else if (is_reloc(value)) {
444 eop->type = EOT_DB_NUMBER;
445 eop->offset = reloc_value(value);
446 eop->segment = reloc_seg(value);
447 eop->wrt = reloc_wrt(value);
448 } else {
449 error(ERR_NONFATAL,
450 "operand %d: expression is not simple"
451 " or relocatable", oper_num);
452 }
453 }
H. Peter Anvin6768eb72002-04-30 20:52:26 +0000454
H. Peter Anvine2c80182005-01-15 22:15:51 +0000455 /*
456 * We're about to call stdscan(), which will eat the
457 * comma that we're currently sitting on between
458 * arguments. However, we'd better check first that it
459 * _is_ a comma.
460 */
461 if (i == 0) /* also could be EOL */
462 break;
463 if (i != ',') {
464 error(ERR_NONFATAL, "comma expected after operand %d",
465 oper_num);
466 result->opcode = -1; /* unrecoverable parse error: */
467 return result; /* ignore this instruction */
468 }
469 }
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000470
H. Peter Anvine2c80182005-01-15 22:15:51 +0000471 if (result->opcode == I_INCBIN) {
472 /*
473 * Correct syntax for INCBIN is that there should be
474 * one string operand, followed by one or two numeric
475 * operands.
476 */
477 if (!result->eops || result->eops->type != EOT_DB_STRING)
478 error(ERR_NONFATAL, "`incbin' expects a file name");
479 else if (result->eops->next &&
480 result->eops->next->type != EOT_DB_NUMBER)
481 error(ERR_NONFATAL, "`incbin': second parameter is",
482 " non-numeric");
483 else if (result->eops->next && result->eops->next->next &&
484 result->eops->next->next->type != EOT_DB_NUMBER)
485 error(ERR_NONFATAL, "`incbin': third parameter is",
486 " non-numeric");
487 else if (result->eops->next && result->eops->next->next &&
488 result->eops->next->next->next)
489 error(ERR_NONFATAL,
490 "`incbin': more than three parameters");
H. Peter Anvineba20a72002-04-30 20:53:55 +0000491 else
H. Peter Anvine2c80182005-01-15 22:15:51 +0000492 return result;
493 /*
494 * If we reach here, one of the above errors happened.
495 * Throw the instruction away.
496 */
497 result->opcode = -1;
498 return result;
499 } else /* DB ... */ if (oper_num == 0)
500 error(ERR_WARNING | ERR_PASS1,
501 "no operand for data declaration");
502 else
503 result->operands = oper_num;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000504
H. Peter Anvine2c80182005-01-15 22:15:51 +0000505 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000506 }
507
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700508 /* right. Now we begin to parse the operands. There may be up to four
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000509 * of these, separated by commas, and terminated by a zero token. */
510
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700511 for (operand = 0; operand < MAX_OPERANDS; operand++) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700512 expr *value; /* used most of the time */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000513 int mref; /* is this going to be a memory ref? */
514 int bracket; /* is it a [] mref, or a & mref? */
515 int setsize = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000516
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700517 result->oprs[operand].disp_size = 0; /* have to zero this whatever */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000518 result->oprs[operand].eaflags = 0; /* and this */
519 result->oprs[operand].opflags = 0;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000520
H. Peter Anvine2c80182005-01-15 22:15:51 +0000521 i = stdscan(NULL, &tokval);
522 if (i == 0)
523 break; /* end of operands: get out of here */
H. Peter Anvin9c987692007-11-04 21:09:32 -0800524 else if (first && i == ':') {
525 insn_is_label = true;
526 goto restart_parse;
527 }
528 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000529 result->oprs[operand].type = 0; /* so far, no override */
530 while (i == TOKEN_SPECIAL) { /* size specifiers */
531 switch ((int)tokval.t_integer) {
532 case S_BYTE:
533 if (!setsize) /* we want to use only the first */
534 result->oprs[operand].type |= BITS8;
535 setsize = 1;
536 break;
537 case S_WORD:
538 if (!setsize)
539 result->oprs[operand].type |= BITS16;
540 setsize = 1;
541 break;
542 case S_DWORD:
543 case S_LONG:
544 if (!setsize)
545 result->oprs[operand].type |= BITS32;
546 setsize = 1;
547 break;
548 case S_QWORD:
549 if (!setsize)
550 result->oprs[operand].type |= BITS64;
551 setsize = 1;
552 break;
553 case S_TWORD:
554 if (!setsize)
555 result->oprs[operand].type |= BITS80;
556 setsize = 1;
557 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700558 case S_OWORD:
559 if (!setsize)
560 result->oprs[operand].type |= BITS128;
561 setsize = 1;
562 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000563 case S_TO:
564 result->oprs[operand].type |= TO;
565 break;
566 case S_STRICT:
567 result->oprs[operand].type |= STRICT;
568 break;
569 case S_FAR:
570 result->oprs[operand].type |= FAR;
571 break;
572 case S_NEAR:
573 result->oprs[operand].type |= NEAR;
574 break;
575 case S_SHORT:
576 result->oprs[operand].type |= SHORT;
577 break;
578 default:
579 error(ERR_NONFATAL, "invalid operand size specification");
580 }
581 i = stdscan(NULL, &tokval);
582 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000583
H. Peter Anvine2c80182005-01-15 22:15:51 +0000584 if (i == '[' || i == '&') { /* memory reference */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700585 mref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000586 bracket = (i == '[');
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700587 i = stdscan(NULL, &tokval); /* then skip the colon */
588 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
589 process_size_override(result, operand);
590 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000591 }
592 } else { /* immediate operand, or register */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700593 mref = false;
594 bracket = false; /* placate optimisers */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000595 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000596
H. Peter Anvine2c80182005-01-15 22:15:51 +0000597 if ((result->oprs[operand].type & FAR) && !mref &&
598 result->opcode != I_JMP && result->opcode != I_CALL) {
599 error(ERR_NONFATAL, "invalid use of FAR operand specifier");
600 }
Debbie Wiles63b53f72002-06-04 19:31:24 +0000601
H. Peter Anvine2c80182005-01-15 22:15:51 +0000602 value = evaluate(stdscan, NULL, &tokval,
603 &result->oprs[operand].opflags,
604 critical, error, &hints);
605 i = tokval.t_type;
606 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700607 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000608 }
609 if (!value) { /* error in evaluator */
610 result->opcode = -1; /* unrecoverable parse error: */
611 return result; /* ignore this instruction */
612 }
613 if (i == ':' && mref) { /* it was seg:offset */
614 /*
615 * Process the segment override.
616 */
617 if (value[1].type != 0 || value->value != 1 ||
618 REG_SREG & ~reg_flags[value->type])
619 error(ERR_NONFATAL, "invalid segment override");
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700620 else if (result->prefixes[PPS_SEG])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000621 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700622 "instruction has conflicting segment overrides");
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000623 else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700624 result->prefixes[PPS_SEG] = value->type;
H. Peter Anvin490bbcd2007-08-29 20:30:31 +0000625 if (!(REG_FSGS & ~reg_flags[value->type]))
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000626 result->oprs[operand].eaflags |= EAF_FSGS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000627 }
H. Peter Anvin76690a12002-04-30 20:52:49 +0000628
H. Peter Anvine2c80182005-01-15 22:15:51 +0000629 i = stdscan(NULL, &tokval); /* then skip the colon */
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700630 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
631 process_size_override(result, operand);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000632 i = stdscan(NULL, &tokval);
633 }
634 value = evaluate(stdscan, NULL, &tokval,
635 &result->oprs[operand].opflags,
636 critical, error, &hints);
637 i = tokval.t_type;
638 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700639 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000640 }
641 /* and get the offset */
642 if (!value) { /* but, error in evaluator */
643 result->opcode = -1; /* unrecoverable parse error: */
644 return result; /* ignore this instruction */
645 }
646 }
647 if (mref && bracket) { /* find ] at the end */
648 if (i != ']') {
649 error(ERR_NONFATAL, "parser: expecting ]");
650 do { /* error recovery again */
651 i = stdscan(NULL, &tokval);
652 } while (i != 0 && i != ',');
653 } else /* we got the required ] */
654 i = stdscan(NULL, &tokval);
655 } else { /* immediate operand */
656 if (i != 0 && i != ',' && i != ':') {
657 error(ERR_NONFATAL, "comma or end of line expected");
658 do { /* error recovery */
659 i = stdscan(NULL, &tokval);
660 } while (i != 0 && i != ',');
661 } else if (i == ':') {
662 result->oprs[operand].type |= COLON;
663 }
664 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000665
H. Peter Anvine2c80182005-01-15 22:15:51 +0000666 /* now convert the exprs returned from evaluate() into operand
667 * descriptions... */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000668
H. Peter Anvine2c80182005-01-15 22:15:51 +0000669 if (mref) { /* it's a memory reference */
670 expr *e = value;
671 int b, i, s; /* basereg, indexreg, scale */
Keith Kanios7a68f302007-04-16 04:56:06 +0000672 int64_t o; /* offset */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000673
H. Peter Anvine2c80182005-01-15 22:15:51 +0000674 b = i = -1, o = s = 0;
675 result->oprs[operand].hintbase = hints.base;
676 result->oprs[operand].hinttype = hints.type;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000677
H. Peter Anvine2c80182005-01-15 22:15:51 +0000678 if (e->type && e->type <= EXPR_REG_END) { /* this bit's a register */
679 if (e->value == 1) /* in fact it can be basereg */
680 b = e->type;
681 else /* no, it has to be indexreg */
682 i = e->type, s = e->value;
683 e++;
684 }
685 if (e->type && e->type <= EXPR_REG_END) { /* it's a 2nd register */
686 if (b != -1) /* If the first was the base, ... */
687 i = e->type, s = e->value; /* second has to be indexreg */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000688
H. Peter Anvine2c80182005-01-15 22:15:51 +0000689 else if (e->value != 1) { /* If both want to be index */
690 error(ERR_NONFATAL,
691 "beroset-p-592-invalid effective address");
692 result->opcode = -1;
693 return result;
694 } else
695 b = e->type;
696 e++;
697 }
698 if (e->type != 0) { /* is there an offset? */
699 if (e->type <= EXPR_REG_END) { /* in fact, is there an error? */
700 error(ERR_NONFATAL,
701 "beroset-p-603-invalid effective address");
702 result->opcode = -1;
703 return result;
704 } else {
705 if (e->type == EXPR_UNKNOWN) {
706 o = 0; /* doesn't matter what */
707 result->oprs[operand].wrt = NO_SEG; /* nor this */
708 result->oprs[operand].segment = NO_SEG; /* or this */
709 while (e->type)
710 e++; /* go to the end of the line */
711 } else {
712 if (e->type == EXPR_SIMPLE) {
713 o = e->value;
714 e++;
715 }
716 if (e->type == EXPR_WRT) {
717 result->oprs[operand].wrt = e->value;
718 e++;
719 } else
720 result->oprs[operand].wrt = NO_SEG;
721 /*
722 * Look for a segment base type.
723 */
724 if (e->type && e->type < EXPR_SEGBASE) {
725 error(ERR_NONFATAL,
726 "beroset-p-630-invalid effective address");
727 result->opcode = -1;
728 return result;
729 }
730 while (e->type && e->value == 0)
731 e++;
732 if (e->type && e->value != 1) {
733 error(ERR_NONFATAL,
734 "beroset-p-637-invalid effective address");
735 result->opcode = -1;
736 return result;
737 }
738 if (e->type) {
739 result->oprs[operand].segment =
740 e->type - EXPR_SEGBASE;
741 e++;
742 } else
743 result->oprs[operand].segment = NO_SEG;
744 while (e->type && e->value == 0)
745 e++;
746 if (e->type) {
747 error(ERR_NONFATAL,
748 "beroset-p-650-invalid effective address");
749 result->opcode = -1;
750 return result;
751 }
752 }
753 }
754 } else {
755 o = 0;
756 result->oprs[operand].wrt = NO_SEG;
757 result->oprs[operand].segment = NO_SEG;
758 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000759
H. Peter Anvine2c80182005-01-15 22:15:51 +0000760 if (e->type != 0) { /* there'd better be nothing left! */
761 error(ERR_NONFATAL,
762 "beroset-p-663-invalid effective address");
763 result->opcode = -1;
764 return result;
765 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000766
H. Peter Anvin0da6b582007-09-12 20:32:39 -0700767 /* It is memory, but it can match any r/m operand */
768 result->oprs[operand].type |= MEMORY_ANY;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000769
770 if (b == -1 && (i == -1 || s == 0)) {
771 int is_rel = globalbits == 64 &&
772 !(result->oprs[operand].eaflags & EAF_ABS) &&
773 ((globalrel &&
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000774 !(result->oprs[operand].eaflags & EAF_FSGS)) ||
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000775 (result->oprs[operand].eaflags & EAF_REL));
776
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700777 result->oprs[operand].type |= is_rel ? IP_REL : MEM_OFFS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000778 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000779 result->oprs[operand].basereg = b;
780 result->oprs[operand].indexreg = i;
781 result->oprs[operand].scale = s;
782 result->oprs[operand].offset = o;
783 } else { /* it's not a memory reference */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000784
H. Peter Anvine2c80182005-01-15 22:15:51 +0000785 if (is_just_unknown(value)) { /* it's immediate but unknown */
786 result->oprs[operand].type |= IMMEDIATE;
787 result->oprs[operand].offset = 0; /* don't care */
788 result->oprs[operand].segment = NO_SEG; /* don't care again */
789 result->oprs[operand].wrt = NO_SEG; /* still don't care */
790 } else if (is_reloc(value)) { /* it's immediate */
791 result->oprs[operand].type |= IMMEDIATE;
792 result->oprs[operand].offset = reloc_value(value);
793 result->oprs[operand].segment = reloc_seg(value);
794 result->oprs[operand].wrt = reloc_wrt(value);
795 if (is_simple(value)) {
796 if (reloc_value(value) == 1)
797 result->oprs[operand].type |= UNITY;
798 if (optimizing >= 0 &&
799 !(result->oprs[operand].type & STRICT)) {
800 if (reloc_value(value) >= -128 &&
801 reloc_value(value) <= 127)
802 result->oprs[operand].type |= SBYTE;
803 }
804 }
805 } else { /* it's a register */
H. Peter Anvin68222142007-11-18 22:18:09 -0800806 unsigned int rs;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000807
H. Peter Anvine2c80182005-01-15 22:15:51 +0000808 if (value->type >= EXPR_SIMPLE || value->value != 1) {
809 error(ERR_NONFATAL, "invalid operand type");
810 result->opcode = -1;
811 return result;
812 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000813
H. Peter Anvine2c80182005-01-15 22:15:51 +0000814 /*
815 * check that its only 1 register, not an expression...
816 */
817 for (i = 1; value[i].type; i++)
818 if (value[i].value) {
819 error(ERR_NONFATAL, "invalid operand type");
820 result->opcode = -1;
821 return result;
822 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000823
H. Peter Anvine2c80182005-01-15 22:15:51 +0000824 /* clear overrides, except TO which applies to FPU regs */
825 if (result->oprs[operand].type & ~TO) {
826 /*
827 * we want to produce a warning iff the specified size
828 * is different from the register size
829 */
H. Peter Anvin68222142007-11-18 22:18:09 -0800830 rs = result->oprs[operand].type & SIZE_MASK;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000831 } else
H. Peter Anvin68222142007-11-18 22:18:09 -0800832 rs = 0;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000833
834 result->oprs[operand].type &= TO;
835 result->oprs[operand].type |= REGISTER;
836 result->oprs[operand].type |= reg_flags[value->type];
837 result->oprs[operand].basereg = value->type;
838
H. Peter Anvin68222142007-11-18 22:18:09 -0800839 if (rs && (result->oprs[operand].type & SIZE_MASK) != rs)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000840 error(ERR_WARNING | ERR_PASS1,
841 "register size specification ignored");
842 }
843 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000844 }
845
H. Peter Anvine2c80182005-01-15 22:15:51 +0000846 result->operands = operand; /* set operand count */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000847
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700848/* clear remaining operands */
849while (operand < MAX_OPERANDS)
850 result->oprs[operand++].type = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000851
852 /*
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700853 * Transform RESW, RESD, RESQ, REST, RESO into RESB.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000854 */
855 switch (result->opcode) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000856 case I_RESW:
857 result->opcode = I_RESB;
858 result->oprs[0].offset *= 2;
859 break;
860 case I_RESD:
861 result->opcode = I_RESB;
862 result->oprs[0].offset *= 4;
863 break;
864 case I_RESQ:
865 result->opcode = I_RESB;
866 result->oprs[0].offset *= 8;
867 break;
868 case I_REST:
869 result->opcode = I_RESB;
870 result->oprs[0].offset *= 10;
871 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700872 case I_RESO:
873 result->opcode = I_RESB;
874 result->oprs[0].offset *= 16;
875 break;
H. Peter Anvin16b0a332007-09-12 20:27:41 -0700876 default:
877 break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000878 }
879
880 return result;
881}
882
H. Peter Anvine2c80182005-01-15 22:15:51 +0000883static int is_comma_next(void)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000884{
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000885 char *p;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000886 int i;
887 struct tokenval tv;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000888
H. Peter Anvin76690a12002-04-30 20:52:49 +0000889 p = stdscan_bufptr;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000890 i = stdscan(NULL, &tv);
H. Peter Anvin76690a12002-04-30 20:52:49 +0000891 stdscan_bufptr = p;
892 return (i == ',' || i == ';' || !i);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000893}
894
H. Peter Anvine2c80182005-01-15 22:15:51 +0000895void cleanup_insn(insn * i)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000896{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000897 extop *e;
898
899 while (i->eops) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000900 e = i->eops;
901 i->eops = i->eops->next;
902 nasm_free(e);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000903 }
904}