blob: 8011733cce1aa44ad9f030450d6494b8d4800d9e [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
5 * redistributable under the licence given in the file "Licence"
6 * 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) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000326 critical = pass0;
327 } else
328 critical = (pass == 2 ? 2 : 0);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000329
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700330 if (result->opcode == I_DB || result->opcode == I_DW ||
331 result->opcode == I_DD || result->opcode == I_DQ ||
332 result->opcode == I_DT || result->opcode == I_DO ||
333 result->opcode == I_INCBIN) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000334 extop *eop, **tail = &result->eops, **fixptr;
335 int oper_num = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000336
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700337 result->eops_float = false;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000338
H. Peter Anvine2c80182005-01-15 22:15:51 +0000339 /*
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700340 * Begin to read the DB/DW/DD/DQ/DT/DO/INCBIN operands.
H. Peter Anvine2c80182005-01-15 22:15:51 +0000341 */
342 while (1) {
343 i = stdscan(NULL, &tokval);
344 if (i == 0)
345 break;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800346 else if (first && i == ':') {
347 insn_is_label = true;
348 goto restart_parse;
349 }
350 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000351 fixptr = tail;
352 eop = *tail = nasm_malloc(sizeof(extop));
353 tail = &eop->next;
354 eop->next = NULL;
355 eop->type = EOT_NOTHING;
356 oper_num++;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000357
H. Peter Anvine2c80182005-01-15 22:15:51 +0000358 if (i == TOKEN_NUM && tokval.t_charptr && is_comma_next()) {
359 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 */
363 continue;
364 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000365
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700366 if ((i == TOKEN_FLOAT && is_comma_next())
367 || i == '-' || i == '+') {
368 int32_t sign = +1;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000369
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700370 if (i == '+' || i == '-') {
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000371 char *save = stdscan_bufptr;
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700372 int token = i;
373 sign = (i == '-') ? -1 : 1;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000374 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000375 if (i != TOKEN_FLOAT || !is_comma_next()) {
376 stdscan_bufptr = save;
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700377 i = tokval.t_type = token;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000378 }
379 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000380
H. Peter Anvine2c80182005-01-15 22:15:51 +0000381 if (i == TOKEN_FLOAT) {
382 eop->type = EOT_DB_STRING;
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700383 result->eops_float = true;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700384 switch (result->opcode) {
H. Peter Anvin2ce02742007-10-29 20:20:12 -0700385 case I_DB:
386 eop->stringlen = 1;
387 break;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700388 case I_DW:
389 eop->stringlen = 2;
390 break;
391 case I_DD:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000392 eop->stringlen = 4;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700393 break;
394 case I_DQ:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000395 eop->stringlen = 8;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700396 break;
397 case I_DT:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000398 eop->stringlen = 10;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700399 break;
H. Peter Anvincfbe7c32007-09-18 17:49:09 -0700400 case I_DO:
401 eop->stringlen = 16;
402 break;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700403 default:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000404 error(ERR_NONFATAL, "floating-point constant"
H. Peter Anvin2ce02742007-10-29 20:20:12 -0700405 " encountered in unknown instruction");
H. Peter Anvine2c80182005-01-15 22:15:51 +0000406 /*
407 * fix suggested by Pedro Gimeno... original line
408 * was:
409 * eop->type = EOT_NOTHING;
410 */
411 eop->stringlen = 0;
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700412 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000413 }
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700414 eop = nasm_realloc(eop, sizeof(extop) + eop->stringlen);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000415 tail = &eop->next;
416 *fixptr = eop;
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000417 eop->stringval = (char *)eop + sizeof(extop);
H. Peter Anvin141d7cf2007-09-18 16:39:03 -0700418 if (!eop->stringlen ||
H. Peter Anvine2c80182005-01-15 22:15:51 +0000419 !float_const(tokval.t_charptr, sign,
Keith Kaniosb7a89542007-04-12 02:40:54 +0000420 (uint8_t *)eop->stringval,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000421 eop->stringlen, error))
422 eop->type = EOT_NOTHING;
423 i = stdscan(NULL, &tokval); /* eat the comma */
424 continue;
425 }
426 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000427
H. Peter Anvine2c80182005-01-15 22:15:51 +0000428 /* anything else */
429 {
430 expr *value;
431 value = evaluate(stdscan, NULL, &tokval, NULL,
432 critical, error, NULL);
433 i = tokval.t_type;
434 if (!value) { /* error in evaluator */
435 result->opcode = -1; /* unrecoverable parse error: */
436 return result; /* ignore this instruction */
437 }
438 if (is_unknown(value)) {
439 eop->type = EOT_DB_NUMBER;
440 eop->offset = 0; /* doesn't matter what we put */
441 eop->segment = eop->wrt = NO_SEG; /* likewise */
442 } else if (is_reloc(value)) {
443 eop->type = EOT_DB_NUMBER;
444 eop->offset = reloc_value(value);
445 eop->segment = reloc_seg(value);
446 eop->wrt = reloc_wrt(value);
447 } else {
448 error(ERR_NONFATAL,
449 "operand %d: expression is not simple"
450 " or relocatable", oper_num);
451 }
452 }
H. Peter Anvin6768eb72002-04-30 20:52:26 +0000453
H. Peter Anvine2c80182005-01-15 22:15:51 +0000454 /*
455 * We're about to call stdscan(), which will eat the
456 * comma that we're currently sitting on between
457 * arguments. However, we'd better check first that it
458 * _is_ a comma.
459 */
460 if (i == 0) /* also could be EOL */
461 break;
462 if (i != ',') {
463 error(ERR_NONFATAL, "comma expected after operand %d",
464 oper_num);
465 result->opcode = -1; /* unrecoverable parse error: */
466 return result; /* ignore this instruction */
467 }
468 }
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000469
H. Peter Anvine2c80182005-01-15 22:15:51 +0000470 if (result->opcode == I_INCBIN) {
471 /*
472 * Correct syntax for INCBIN is that there should be
473 * one string operand, followed by one or two numeric
474 * operands.
475 */
476 if (!result->eops || result->eops->type != EOT_DB_STRING)
477 error(ERR_NONFATAL, "`incbin' expects a file name");
478 else if (result->eops->next &&
479 result->eops->next->type != EOT_DB_NUMBER)
480 error(ERR_NONFATAL, "`incbin': second parameter is",
481 " non-numeric");
482 else if (result->eops->next && result->eops->next->next &&
483 result->eops->next->next->type != EOT_DB_NUMBER)
484 error(ERR_NONFATAL, "`incbin': third parameter is",
485 " non-numeric");
486 else if (result->eops->next && result->eops->next->next &&
487 result->eops->next->next->next)
488 error(ERR_NONFATAL,
489 "`incbin': more than three parameters");
H. Peter Anvineba20a72002-04-30 20:53:55 +0000490 else
H. Peter Anvine2c80182005-01-15 22:15:51 +0000491 return result;
492 /*
493 * If we reach here, one of the above errors happened.
494 * Throw the instruction away.
495 */
496 result->opcode = -1;
497 return result;
498 } else /* DB ... */ if (oper_num == 0)
499 error(ERR_WARNING | ERR_PASS1,
500 "no operand for data declaration");
501 else
502 result->operands = oper_num;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000503
H. Peter Anvine2c80182005-01-15 22:15:51 +0000504 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000505 }
506
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700507 /* right. Now we begin to parse the operands. There may be up to four
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000508 * of these, separated by commas, and terminated by a zero token. */
509
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700510 for (operand = 0; operand < MAX_OPERANDS; operand++) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700511 expr *value; /* used most of the time */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000512 int mref; /* is this going to be a memory ref? */
513 int bracket; /* is it a [] mref, or a & mref? */
514 int setsize = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000515
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700516 result->oprs[operand].disp_size = 0; /* have to zero this whatever */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000517 result->oprs[operand].eaflags = 0; /* and this */
518 result->oprs[operand].opflags = 0;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000519
H. Peter Anvine2c80182005-01-15 22:15:51 +0000520 i = stdscan(NULL, &tokval);
521 if (i == 0)
522 break; /* end of operands: get out of here */
H. Peter Anvin9c987692007-11-04 21:09:32 -0800523 else if (first && i == ':') {
524 insn_is_label = true;
525 goto restart_parse;
526 }
527 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000528 result->oprs[operand].type = 0; /* so far, no override */
529 while (i == TOKEN_SPECIAL) { /* size specifiers */
530 switch ((int)tokval.t_integer) {
531 case S_BYTE:
532 if (!setsize) /* we want to use only the first */
533 result->oprs[operand].type |= BITS8;
534 setsize = 1;
535 break;
536 case S_WORD:
537 if (!setsize)
538 result->oprs[operand].type |= BITS16;
539 setsize = 1;
540 break;
541 case S_DWORD:
542 case S_LONG:
543 if (!setsize)
544 result->oprs[operand].type |= BITS32;
545 setsize = 1;
546 break;
547 case S_QWORD:
548 if (!setsize)
549 result->oprs[operand].type |= BITS64;
550 setsize = 1;
551 break;
552 case S_TWORD:
553 if (!setsize)
554 result->oprs[operand].type |= BITS80;
555 setsize = 1;
556 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700557 case S_OWORD:
558 if (!setsize)
559 result->oprs[operand].type |= BITS128;
560 setsize = 1;
561 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000562 case S_TO:
563 result->oprs[operand].type |= TO;
564 break;
565 case S_STRICT:
566 result->oprs[operand].type |= STRICT;
567 break;
568 case S_FAR:
569 result->oprs[operand].type |= FAR;
570 break;
571 case S_NEAR:
572 result->oprs[operand].type |= NEAR;
573 break;
574 case S_SHORT:
575 result->oprs[operand].type |= SHORT;
576 break;
577 default:
578 error(ERR_NONFATAL, "invalid operand size specification");
579 }
580 i = stdscan(NULL, &tokval);
581 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000582
H. Peter Anvine2c80182005-01-15 22:15:51 +0000583 if (i == '[' || i == '&') { /* memory reference */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700584 mref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000585 bracket = (i == '[');
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700586 i = stdscan(NULL, &tokval); /* then skip the colon */
587 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
588 process_size_override(result, operand);
589 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000590 }
591 } else { /* immediate operand, or register */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700592 mref = false;
593 bracket = false; /* placate optimisers */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000594 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000595
H. Peter Anvine2c80182005-01-15 22:15:51 +0000596 if ((result->oprs[operand].type & FAR) && !mref &&
597 result->opcode != I_JMP && result->opcode != I_CALL) {
598 error(ERR_NONFATAL, "invalid use of FAR operand specifier");
599 }
Debbie Wiles63b53f72002-06-04 19:31:24 +0000600
H. Peter Anvine2c80182005-01-15 22:15:51 +0000601 value = evaluate(stdscan, NULL, &tokval,
602 &result->oprs[operand].opflags,
603 critical, error, &hints);
604 i = tokval.t_type;
605 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700606 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000607 }
608 if (!value) { /* error in evaluator */
609 result->opcode = -1; /* unrecoverable parse error: */
610 return result; /* ignore this instruction */
611 }
612 if (i == ':' && mref) { /* it was seg:offset */
613 /*
614 * Process the segment override.
615 */
616 if (value[1].type != 0 || value->value != 1 ||
617 REG_SREG & ~reg_flags[value->type])
618 error(ERR_NONFATAL, "invalid segment override");
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700619 else if (result->prefixes[PPS_SEG])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000620 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700621 "instruction has conflicting segment overrides");
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000622 else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700623 result->prefixes[PPS_SEG] = value->type;
H. Peter Anvin490bbcd2007-08-29 20:30:31 +0000624 if (!(REG_FSGS & ~reg_flags[value->type]))
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000625 result->oprs[operand].eaflags |= EAF_FSGS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000626 }
H. Peter Anvin76690a12002-04-30 20:52:49 +0000627
H. Peter Anvine2c80182005-01-15 22:15:51 +0000628 i = stdscan(NULL, &tokval); /* then skip the colon */
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700629 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
630 process_size_override(result, operand);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000631 i = stdscan(NULL, &tokval);
632 }
633 value = evaluate(stdscan, NULL, &tokval,
634 &result->oprs[operand].opflags,
635 critical, error, &hints);
636 i = tokval.t_type;
637 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700638 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000639 }
640 /* and get the offset */
641 if (!value) { /* but, error in evaluator */
642 result->opcode = -1; /* unrecoverable parse error: */
643 return result; /* ignore this instruction */
644 }
645 }
646 if (mref && bracket) { /* find ] at the end */
647 if (i != ']') {
648 error(ERR_NONFATAL, "parser: expecting ]");
649 do { /* error recovery again */
650 i = stdscan(NULL, &tokval);
651 } while (i != 0 && i != ',');
652 } else /* we got the required ] */
653 i = stdscan(NULL, &tokval);
654 } else { /* immediate operand */
655 if (i != 0 && i != ',' && i != ':') {
656 error(ERR_NONFATAL, "comma or end of line expected");
657 do { /* error recovery */
658 i = stdscan(NULL, &tokval);
659 } while (i != 0 && i != ',');
660 } else if (i == ':') {
661 result->oprs[operand].type |= COLON;
662 }
663 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000664
H. Peter Anvine2c80182005-01-15 22:15:51 +0000665 /* now convert the exprs returned from evaluate() into operand
666 * descriptions... */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000667
H. Peter Anvine2c80182005-01-15 22:15:51 +0000668 if (mref) { /* it's a memory reference */
669 expr *e = value;
670 int b, i, s; /* basereg, indexreg, scale */
Keith Kanios7a68f302007-04-16 04:56:06 +0000671 int64_t o; /* offset */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000672
H. Peter Anvine2c80182005-01-15 22:15:51 +0000673 b = i = -1, o = s = 0;
674 result->oprs[operand].hintbase = hints.base;
675 result->oprs[operand].hinttype = hints.type;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000676
H. Peter Anvine2c80182005-01-15 22:15:51 +0000677 if (e->type && e->type <= EXPR_REG_END) { /* this bit's a register */
678 if (e->value == 1) /* in fact it can be basereg */
679 b = e->type;
680 else /* no, it has to be indexreg */
681 i = e->type, s = e->value;
682 e++;
683 }
684 if (e->type && e->type <= EXPR_REG_END) { /* it's a 2nd register */
685 if (b != -1) /* If the first was the base, ... */
686 i = e->type, s = e->value; /* second has to be indexreg */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000687
H. Peter Anvine2c80182005-01-15 22:15:51 +0000688 else if (e->value != 1) { /* If both want to be index */
689 error(ERR_NONFATAL,
690 "beroset-p-592-invalid effective address");
691 result->opcode = -1;
692 return result;
693 } else
694 b = e->type;
695 e++;
696 }
697 if (e->type != 0) { /* is there an offset? */
698 if (e->type <= EXPR_REG_END) { /* in fact, is there an error? */
699 error(ERR_NONFATAL,
700 "beroset-p-603-invalid effective address");
701 result->opcode = -1;
702 return result;
703 } else {
704 if (e->type == EXPR_UNKNOWN) {
705 o = 0; /* doesn't matter what */
706 result->oprs[operand].wrt = NO_SEG; /* nor this */
707 result->oprs[operand].segment = NO_SEG; /* or this */
708 while (e->type)
709 e++; /* go to the end of the line */
710 } else {
711 if (e->type == EXPR_SIMPLE) {
712 o = e->value;
713 e++;
714 }
715 if (e->type == EXPR_WRT) {
716 result->oprs[operand].wrt = e->value;
717 e++;
718 } else
719 result->oprs[operand].wrt = NO_SEG;
720 /*
721 * Look for a segment base type.
722 */
723 if (e->type && e->type < EXPR_SEGBASE) {
724 error(ERR_NONFATAL,
725 "beroset-p-630-invalid effective address");
726 result->opcode = -1;
727 return result;
728 }
729 while (e->type && e->value == 0)
730 e++;
731 if (e->type && e->value != 1) {
732 error(ERR_NONFATAL,
733 "beroset-p-637-invalid effective address");
734 result->opcode = -1;
735 return result;
736 }
737 if (e->type) {
738 result->oprs[operand].segment =
739 e->type - EXPR_SEGBASE;
740 e++;
741 } else
742 result->oprs[operand].segment = NO_SEG;
743 while (e->type && e->value == 0)
744 e++;
745 if (e->type) {
746 error(ERR_NONFATAL,
747 "beroset-p-650-invalid effective address");
748 result->opcode = -1;
749 return result;
750 }
751 }
752 }
753 } else {
754 o = 0;
755 result->oprs[operand].wrt = NO_SEG;
756 result->oprs[operand].segment = NO_SEG;
757 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000758
H. Peter Anvine2c80182005-01-15 22:15:51 +0000759 if (e->type != 0) { /* there'd better be nothing left! */
760 error(ERR_NONFATAL,
761 "beroset-p-663-invalid effective address");
762 result->opcode = -1;
763 return result;
764 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000765
H. Peter Anvin0da6b582007-09-12 20:32:39 -0700766 /* It is memory, but it can match any r/m operand */
767 result->oprs[operand].type |= MEMORY_ANY;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000768
769 if (b == -1 && (i == -1 || s == 0)) {
770 int is_rel = globalbits == 64 &&
771 !(result->oprs[operand].eaflags & EAF_ABS) &&
772 ((globalrel &&
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000773 !(result->oprs[operand].eaflags & EAF_FSGS)) ||
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000774 (result->oprs[operand].eaflags & EAF_REL));
775
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700776 result->oprs[operand].type |= is_rel ? IP_REL : MEM_OFFS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000777 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000778 result->oprs[operand].basereg = b;
779 result->oprs[operand].indexreg = i;
780 result->oprs[operand].scale = s;
781 result->oprs[operand].offset = o;
782 } else { /* it's not a memory reference */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000783
H. Peter Anvine2c80182005-01-15 22:15:51 +0000784 if (is_just_unknown(value)) { /* it's immediate but unknown */
785 result->oprs[operand].type |= IMMEDIATE;
786 result->oprs[operand].offset = 0; /* don't care */
787 result->oprs[operand].segment = NO_SEG; /* don't care again */
788 result->oprs[operand].wrt = NO_SEG; /* still don't care */
789 } else if (is_reloc(value)) { /* it's immediate */
790 result->oprs[operand].type |= IMMEDIATE;
791 result->oprs[operand].offset = reloc_value(value);
792 result->oprs[operand].segment = reloc_seg(value);
793 result->oprs[operand].wrt = reloc_wrt(value);
794 if (is_simple(value)) {
795 if (reloc_value(value) == 1)
796 result->oprs[operand].type |= UNITY;
797 if (optimizing >= 0 &&
798 !(result->oprs[operand].type & STRICT)) {
799 if (reloc_value(value) >= -128 &&
800 reloc_value(value) <= 127)
801 result->oprs[operand].type |= SBYTE;
802 }
803 }
804 } else { /* it's a register */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000805
H. Peter Anvine2c80182005-01-15 22:15:51 +0000806 if (value->type >= EXPR_SIMPLE || value->value != 1) {
807 error(ERR_NONFATAL, "invalid operand type");
808 result->opcode = -1;
809 return result;
810 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000811
H. Peter Anvine2c80182005-01-15 22:15:51 +0000812 /*
813 * check that its only 1 register, not an expression...
814 */
815 for (i = 1; value[i].type; i++)
816 if (value[i].value) {
817 error(ERR_NONFATAL, "invalid operand type");
818 result->opcode = -1;
819 return result;
820 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000821
H. Peter Anvine2c80182005-01-15 22:15:51 +0000822 /* clear overrides, except TO which applies to FPU regs */
823 if (result->oprs[operand].type & ~TO) {
824 /*
825 * we want to produce a warning iff the specified size
826 * is different from the register size
827 */
828 i = result->oprs[operand].type & SIZE_MASK;
829 } else
830 i = 0;
831
832 result->oprs[operand].type &= TO;
833 result->oprs[operand].type |= REGISTER;
834 result->oprs[operand].type |= reg_flags[value->type];
835 result->oprs[operand].basereg = value->type;
836
837 if (i && (result->oprs[operand].type & SIZE_MASK) != i)
838 error(ERR_WARNING | ERR_PASS1,
839 "register size specification ignored");
840 }
841 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000842 }
843
H. Peter Anvine2c80182005-01-15 22:15:51 +0000844 result->operands = operand; /* set operand count */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000845
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700846/* clear remaining operands */
847while (operand < MAX_OPERANDS)
848 result->oprs[operand++].type = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000849
850 /*
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700851 * Transform RESW, RESD, RESQ, REST, RESO into RESB.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000852 */
853 switch (result->opcode) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000854 case I_RESW:
855 result->opcode = I_RESB;
856 result->oprs[0].offset *= 2;
857 break;
858 case I_RESD:
859 result->opcode = I_RESB;
860 result->oprs[0].offset *= 4;
861 break;
862 case I_RESQ:
863 result->opcode = I_RESB;
864 result->oprs[0].offset *= 8;
865 break;
866 case I_REST:
867 result->opcode = I_RESB;
868 result->oprs[0].offset *= 10;
869 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700870 case I_RESO:
871 result->opcode = I_RESB;
872 result->oprs[0].offset *= 16;
873 break;
H. Peter Anvin16b0a332007-09-12 20:27:41 -0700874 default:
875 break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000876 }
877
878 return result;
879}
880
H. Peter Anvine2c80182005-01-15 22:15:51 +0000881static int is_comma_next(void)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000882{
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000883 char *p;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000884 int i;
885 struct tokenval tv;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000886
H. Peter Anvin76690a12002-04-30 20:52:49 +0000887 p = stdscan_bufptr;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000888 i = stdscan(NULL, &tv);
H. Peter Anvin76690a12002-04-30 20:52:49 +0000889 stdscan_bufptr = p;
890 return (i == ',' || i == ';' || !i);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000891}
892
H. Peter Anvine2c80182005-01-15 22:15:51 +0000893void cleanup_insn(insn * i)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000894{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000895 extop *e;
896
897 while (i->eops) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000898 e = i->eops;
899 i->eops = i->eops->next;
900 nasm_free(e);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000901 }
902}