blob: 450511b6c3620d95f745a136f1ebeb9aee5f90a9 [file] [log] [blame]
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00001/* parser.c source line parser for the Netwide Assembler
2 *
3 * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
4 * Julian Hall. All rights reserved. The software is
Beroset095e6a22007-12-29 09:44:23 -05005 * redistributable under the license given in the file "LICENSE"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00006 * distributed in the NASM archive.
7 *
8 * initial version 27/iii/95 by Simon Tatham
9 */
10
H. Peter Anvinfe501952007-10-02 21:53:51 -070011#include "compiler.h"
12
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000013#include <stdio.h>
14#include <stdlib.h>
15#include <stddef.h>
16#include <string.h>
17#include <ctype.h>
Keith Kaniosb7a89542007-04-12 02:40:54 +000018#include <inttypes.h>
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000019
20#include "nasm.h"
H. Peter Anvin24cfef42002-09-12 16:34:06 +000021#include "insns.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000022#include "nasmlib.h"
H. Peter Anvin74cc5e52007-08-30 22:35:34 +000023#include "stdscan.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000024#include "parser.h"
25#include "float.h"
H. Peter Anvina4835d42008-05-20 14:21:29 -070026#include "tables.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000027
H. Peter Anvine2c80182005-01-15 22:15:51 +000028extern int in_abs_seg; /* ABSOLUTE segment flag */
Keith Kaniosb7a89542007-04-12 02:40:54 +000029extern int32_t abs_seg; /* ABSOLUTE segment */
30extern int32_t abs_offset; /* ABSOLUTE segment offset */
H. Peter Anvind0e365d2002-05-26 18:19:19 +000031
H. Peter Anvine2c80182005-01-15 22:15:51 +000032static int is_comma_next(void);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000033
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000034static int i;
35static struct tokenval tokval;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000036static efunc error;
H. Peter Anvine2c80182005-01-15 22:15:51 +000037static struct ofmt *outfmt; /* Structure of addresses of output routines */
H. Peter Anvin12e46512007-10-03 21:30:57 -070038static struct location *location; /* Pointer to current line's segment,offset */
H. Peter Anvineba20a72002-04-30 20:53:55 +000039
H. Peter Anvin12e46512007-10-03 21:30:57 -070040void parser_global_info(struct ofmt *output, struct location * locp)
H. Peter Anvineba20a72002-04-30 20:53:55 +000041{
42 outfmt = output;
43 location = locp;
44}
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000045
H. Peter Anvinde4b89b2007-10-01 15:41:25 -070046static int prefix_slot(enum prefixes prefix)
47{
48 switch (prefix) {
H. Peter Anvinc2acf7b2009-02-21 18:22:56 -080049 case P_WAIT:
50 return PPS_WAIT;
H. Peter Anvinde4b89b2007-10-01 15:41:25 -070051 case R_CS:
52 case R_DS:
53 case R_SS:
54 case R_ES:
55 case R_FS:
56 case R_GS:
57 return PPS_SEG;
58 case P_LOCK:
59 case P_REP:
60 case P_REPE:
61 case P_REPZ:
62 case P_REPNE:
63 case P_REPNZ:
64 return PPS_LREP;
65 case P_O16:
66 case P_O32:
67 case P_O64:
68 case P_OSP:
69 return PPS_OSIZE;
70 case P_A16:
71 case P_A32:
72 case P_A64:
73 case P_ASP:
74 return PPS_ASIZE;
75 default:
76 error(ERR_PANIC, "Invalid value %d passed to prefix_slot()", prefix);
77 return -1;
78 }
79}
80
81static void process_size_override(insn * result, int operand)
82{
83 if (tasm_compatible_mode) {
84 switch ((int)tokval.t_integer) {
85 /* For TASM compatibility a size override inside the
86 * brackets changes the size of the operand, not the
87 * address type of the operand as it does in standard
88 * NASM syntax. Hence:
89 *
90 * mov eax,[DWORD val]
91 *
92 * is valid syntax in TASM compatibility mode. Note that
93 * you lose the ability to override the default address
94 * type for the instruction, but we never use anything
95 * but 32-bit flat model addressing in our code.
96 */
97 case S_BYTE:
98 result->oprs[operand].type |= BITS8;
99 break;
100 case S_WORD:
101 result->oprs[operand].type |= BITS16;
102 break;
103 case S_DWORD:
104 case S_LONG:
105 result->oprs[operand].type |= BITS32;
106 break;
107 case S_QWORD:
108 result->oprs[operand].type |= BITS64;
109 break;
110 case S_TWORD:
111 result->oprs[operand].type |= BITS80;
112 break;
113 case S_OWORD:
114 result->oprs[operand].type |= BITS128;
115 break;
116 default:
117 error(ERR_NONFATAL,
118 "invalid operand size specification");
119 break;
120 }
121 } else {
122 /* Standard NASM compatible syntax */
123 switch ((int)tokval.t_integer) {
124 case S_NOSPLIT:
125 result->oprs[operand].eaflags |= EAF_TIMESTWO;
126 break;
127 case S_REL:
128 result->oprs[operand].eaflags |= EAF_REL;
129 break;
130 case S_ABS:
131 result->oprs[operand].eaflags |= EAF_ABS;
132 break;
133 case S_BYTE:
134 result->oprs[operand].disp_size = 8;
135 result->oprs[operand].eaflags |= EAF_BYTEOFFS;
136 break;
137 case P_A16:
138 case P_A32:
139 case P_A64:
140 if (result->prefixes[PPS_ASIZE] &&
141 result->prefixes[PPS_ASIZE] != tokval.t_integer)
142 error(ERR_NONFATAL,
143 "conflicting address size specifications");
144 else
145 result->prefixes[PPS_ASIZE] = tokval.t_integer;
146 break;
147 case S_WORD:
148 result->oprs[operand].disp_size = 16;
149 result->oprs[operand].eaflags |= EAF_WORDOFFS;
150 break;
151 case S_DWORD:
152 case S_LONG:
153 result->oprs[operand].disp_size = 32;
154 result->oprs[operand].eaflags |= EAF_WORDOFFS;
155 break;
156 case S_QWORD:
157 result->oprs[operand].disp_size = 64;
158 result->oprs[operand].eaflags |= EAF_WORDOFFS;
159 break;
160 default:
161 error(ERR_NONFATAL, "invalid size specification in"
162 " effective address");
163 break;
164 }
165 }
166}
167
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000168insn *parse_line(int pass, char *buffer, insn * result,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000169 efunc errfunc, evalfunc evaluate, ldfunc ldef)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000170{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000171 int operand;
172 int critical;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000173 struct eval_hints hints;
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700174 int j;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800175 bool first;
176 bool insn_is_label = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000177
H. Peter Anvin9c987692007-11-04 21:09:32 -0800178restart_parse:
179 first = true;
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700180 result->forw_ref = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000181 error = errfunc;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000182
H. Peter Anvin76690a12002-04-30 20:52:49 +0000183 stdscan_reset();
184 stdscan_bufptr = buffer;
185 i = stdscan(NULL, &tokval);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000186
H. Peter Anvine2c80182005-01-15 22:15:51 +0000187 result->label = NULL; /* Assume no label */
188 result->eops = NULL; /* must do this, whatever happens */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000189 result->operands = 0; /* must initialize this */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000190
H. Peter Anvine2c80182005-01-15 22:15:51 +0000191 if (i == 0) { /* blank line - ignore */
192 result->opcode = -1; /* and no instruction either */
193 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000194 }
195 if (i != TOKEN_ID && i != TOKEN_INSN && i != TOKEN_PREFIX &&
H. Peter Anvina4835d42008-05-20 14:21:29 -0700196 (i != TOKEN_REG || (REG_SREG & ~nasm_reg_flags[tokval.t_integer]))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000197 error(ERR_NONFATAL, "label or instruction expected"
198 " at start of line");
199 result->opcode = -1;
200 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000201 }
202
H. Peter Anvin9c987692007-11-04 21:09:32 -0800203 if (i == TOKEN_ID || (insn_is_label && i == TOKEN_INSN)) {
204 /* there's a label here */
205 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000206 result->label = tokval.t_charptr;
207 i = stdscan(NULL, &tokval);
208 if (i == ':') { /* skip over the optional colon */
209 i = stdscan(NULL, &tokval);
210 } else if (i == 0) {
211 error(ERR_WARNING | ERR_WARN_OL | ERR_PASS1,
212 "label alone on a line without a colon might be in error");
213 }
214 if (i != TOKEN_INSN || tokval.t_integer != I_EQU) {
215 /*
216 * FIXME: location->segment could be NO_SEG, in which case
217 * it is possible we should be passing 'abs_seg'. Look into this.
218 * Work out whether that is *really* what we should be doing.
219 * Generally fix things. I think this is right as it is, but
220 * am still not certain.
221 */
222 ldef(result->label, in_abs_seg ? abs_seg : location->segment,
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700223 location->offset, NULL, true, false, outfmt, errfunc);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000224 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000225 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000226
H. Peter Anvine2c80182005-01-15 22:15:51 +0000227 if (i == 0) {
228 result->opcode = -1; /* this line contains just a label */
229 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000230 }
231
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700232 for (j = 0; j < MAXPREFIX; j++)
233 result->prefixes[j] = P_none;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000234 result->times = 1L;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000235
236 while (i == TOKEN_PREFIX ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700237 (i == TOKEN_REG && !(REG_SREG & ~nasm_reg_flags[tokval.t_integer])))
H. Peter Anvineba20a72002-04-30 20:53:55 +0000238 {
H. Peter Anvin9c987692007-11-04 21:09:32 -0800239 first = false;
240
H. Peter Anvine2c80182005-01-15 22:15:51 +0000241 /*
242 * Handle special case: the TIMES prefix.
243 */
244 if (i == TOKEN_PREFIX && tokval.t_integer == P_TIMES) {
245 expr *value;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000246
H. Peter Anvine2c80182005-01-15 22:15:51 +0000247 i = stdscan(NULL, &tokval);
248 value =
249 evaluate(stdscan, NULL, &tokval, NULL, pass0, error, NULL);
250 i = tokval.t_type;
251 if (!value) { /* but, error in evaluator */
252 result->opcode = -1; /* unrecoverable parse error: */
253 return result; /* ignore this instruction */
254 }
255 if (!is_simple(value)) {
256 error(ERR_NONFATAL,
257 "non-constant argument supplied to TIMES");
258 result->times = 1L;
259 } else {
260 result->times = value->value;
Charles Crayne7f596e72008-09-23 21:49:09 -0700261 if (value->value < 0 && pass0 == 2) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000262 error(ERR_NONFATAL, "TIMES value %d is negative",
263 value->value);
264 result->times = 0;
265 }
266 }
267 } else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700268 int slot = prefix_slot(tokval.t_integer);
269 if (result->prefixes[slot]) {
Charles Crayne052c0bd2007-10-29 18:24:59 -0700270 if (result->prefixes[slot] == tokval.t_integer)
H. Peter Anvin9c987692007-11-04 21:09:32 -0800271 error(ERR_WARNING,
Charles Crayne052c0bd2007-10-29 18:24:59 -0700272 "instruction has redundant prefixes");
273 else
274 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700275 "instruction has conflicting prefixes");
276 }
277 result->prefixes[slot] = tokval.t_integer;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000278 i = stdscan(NULL, &tokval);
279 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000280 }
281
282 if (i != TOKEN_INSN) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700283 int j;
284 enum prefixes pfx;
285
286 for (j = 0; j < MAXPREFIX; j++)
287 if ((pfx = result->prefixes[j]) != P_none)
288 break;
H. Peter Anvincb583b92007-10-28 22:04:42 -0700289
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700290 if (i == 0 && pfx != P_none) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000291 /*
292 * Instruction prefixes are present, but no actual
293 * instruction. This is allowed: at this point we
294 * invent a notional instruction of RESB 0.
295 */
296 result->opcode = I_RESB;
297 result->operands = 1;
298 result->oprs[0].type = IMMEDIATE;
299 result->oprs[0].offset = 0L;
300 result->oprs[0].segment = result->oprs[0].wrt = NO_SEG;
301 return result;
302 } else {
303 error(ERR_NONFATAL, "parser: instruction expected");
304 result->opcode = -1;
305 return result;
306 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000307 }
308
309 result->opcode = tokval.t_integer;
310 result->condition = tokval.t_inttwo;
311
312 /*
Charles Crayne2581c862008-09-10 19:21:52 -0700313 * INCBIN cannot be satisfied with incorrectly
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000314 * evaluated operands, since the correct values _must_ be known
315 * on the first pass. Hence, even in pass one, we set the
316 * `critical' flag on calling evaluate(), so that it will bomb
Charles Crayne2581c862008-09-10 19:21:52 -0700317 * out on undefined symbols.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000318 */
Charles Crayne2581c862008-09-10 19:21:52 -0700319 if (result->opcode == I_INCBIN) {
Charles Crayne5a7976c2008-03-26 17:20:21 -0700320 critical = (pass0 < 2 ? 1 : 2);
321
H. Peter Anvine2c80182005-01-15 22:15:51 +0000322 } else
323 critical = (pass == 2 ? 2 : 0);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000324
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700325 if (result->opcode == I_DB || result->opcode == I_DW ||
326 result->opcode == I_DD || result->opcode == I_DQ ||
327 result->opcode == I_DT || result->opcode == I_DO ||
H. Peter Anvindfb91802008-05-20 11:43:53 -0700328 result->opcode == I_DY || result->opcode == I_INCBIN) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000329 extop *eop, **tail = &result->eops, **fixptr;
330 int oper_num = 0;
H. Peter Anvin518df302008-06-14 16:53:48 -0700331 int32_t sign;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000332
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700333 result->eops_float = false;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000334
H. Peter Anvine2c80182005-01-15 22:15:51 +0000335 /*
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700336 * Begin to read the DB/DW/DD/DQ/DT/DO/INCBIN operands.
H. Peter Anvine2c80182005-01-15 22:15:51 +0000337 */
338 while (1) {
339 i = stdscan(NULL, &tokval);
340 if (i == 0)
341 break;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800342 else if (first && i == ':') {
343 insn_is_label = true;
344 goto restart_parse;
345 }
346 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000347 fixptr = tail;
348 eop = *tail = nasm_malloc(sizeof(extop));
349 tail = &eop->next;
350 eop->next = NULL;
351 eop->type = EOT_NOTHING;
352 oper_num++;
H. Peter Anvin518df302008-06-14 16:53:48 -0700353 sign = +1;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000354
H. Peter Anvin518df302008-06-14 16:53:48 -0700355 /* is_comma_next() here is to distinguish this from
356 a string used as part of an expression... */
H. Peter Anvin11627042008-06-09 20:45:19 -0700357 if (i == TOKEN_STR && is_comma_next()) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000358 eop->type = EOT_DB_STRING;
359 eop->stringval = tokval.t_charptr;
360 eop->stringlen = tokval.t_inttwo;
361 i = stdscan(NULL, &tokval); /* eat the comma */
H. Peter Anvin518df302008-06-14 16:53:48 -0700362 } else if (i == TOKEN_STRFUNC) {
363 bool parens = false;
364 const char *funcname = tokval.t_charptr;
365 enum strfunc func = tokval.t_integer;
366 i = stdscan(NULL, &tokval);
367 if (i == '(') {
368 parens = true;
369 i = stdscan(NULL, &tokval);
370 }
371 if (i != TOKEN_STR) {
372 error(ERR_NONFATAL,
373 "%s must be followed by a string constant",
374 funcname);
375 eop->type = EOT_NOTHING;
376 } else {
377 eop->type = EOT_DB_STRING_FREE;
378 eop->stringlen =
379 string_transform(tokval.t_charptr, tokval.t_inttwo,
380 &eop->stringval, func);
381 if (eop->stringlen == (size_t)-1) {
382 error(ERR_NONFATAL, "invalid string for transform");
383 eop->type = EOT_NOTHING;
384 }
385 }
386 if (parens && i && i != ')') {
387 i = stdscan(NULL, &tokval);
388 if (i != ')') {
389 error(ERR_NONFATAL, "unterminated %s function",
390 funcname);
391 }
392 }
393 if (i && i != ',')
394 i = stdscan(NULL, &tokval);
395 } else if (i == '-' || i == '+') {
396 char *save = stdscan_bufptr;
397 int token = i;
398 sign = (i == '-') ? -1 : 1;
399 i = stdscan(NULL, &tokval);
400 if (i != TOKEN_FLOAT) {
401 stdscan_bufptr = save;
402 i = tokval.t_type = token;
403 goto is_expression;
404 } else {
405 goto is_float;
406 }
407 } else if (i == TOKEN_FLOAT) {
408 is_float:
409 eop->type = EOT_DB_STRING;
410 result->eops_float = true;
411 switch (result->opcode) {
412 case I_DB:
413 eop->stringlen = 1;
414 break;
415 case I_DW:
416 eop->stringlen = 2;
417 break;
418 case I_DD:
419 eop->stringlen = 4;
420 break;
421 case I_DQ:
422 eop->stringlen = 8;
423 break;
424 case I_DT:
425 eop->stringlen = 10;
426 break;
427 case I_DO:
428 eop->stringlen = 16;
429 break;
430 case I_DY:
431 error(ERR_NONFATAL, "floating-point constant"
432 " encountered in DY instruction");
433 eop->stringlen = 0;
434 break;
435 default:
436 error(ERR_NONFATAL, "floating-point constant"
437 " encountered in unknown instruction");
438 /*
439 * fix suggested by Pedro Gimeno... original line
440 * was:
441 * eop->type = EOT_NOTHING;
442 */
443 eop->stringlen = 0;
444 break;
445 }
446 eop = nasm_realloc(eop, sizeof(extop) + eop->stringlen);
447 tail = &eop->next;
448 *fixptr = eop;
449 eop->stringval = (char *)eop + sizeof(extop);
450 if (!eop->stringlen ||
451 !float_const(tokval.t_charptr, sign,
452 (uint8_t *)eop->stringval,
453 eop->stringlen, error))
454 eop->type = EOT_NOTHING;
455 i = stdscan(NULL, &tokval); /* eat the comma */
456 } else {
457 /* anything else, assume it is an expression */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000458 expr *value;
H. Peter Anvin518df302008-06-14 16:53:48 -0700459
460 is_expression:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000461 value = evaluate(stdscan, NULL, &tokval, NULL,
462 critical, error, NULL);
463 i = tokval.t_type;
464 if (!value) { /* error in evaluator */
465 result->opcode = -1; /* unrecoverable parse error: */
466 return result; /* ignore this instruction */
467 }
468 if (is_unknown(value)) {
469 eop->type = EOT_DB_NUMBER;
470 eop->offset = 0; /* doesn't matter what we put */
471 eop->segment = eop->wrt = NO_SEG; /* likewise */
472 } else if (is_reloc(value)) {
473 eop->type = EOT_DB_NUMBER;
474 eop->offset = reloc_value(value);
475 eop->segment = reloc_seg(value);
476 eop->wrt = reloc_wrt(value);
477 } else {
478 error(ERR_NONFATAL,
479 "operand %d: expression is not simple"
480 " or relocatable", oper_num);
481 }
482 }
H. Peter Anvin6768eb72002-04-30 20:52:26 +0000483
H. Peter Anvine2c80182005-01-15 22:15:51 +0000484 /*
485 * We're about to call stdscan(), which will eat the
486 * comma that we're currently sitting on between
487 * arguments. However, we'd better check first that it
488 * _is_ a comma.
489 */
490 if (i == 0) /* also could be EOL */
491 break;
492 if (i != ',') {
493 error(ERR_NONFATAL, "comma expected after operand %d",
494 oper_num);
495 result->opcode = -1; /* unrecoverable parse error: */
496 return result; /* ignore this instruction */
497 }
498 }
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000499
H. Peter Anvine2c80182005-01-15 22:15:51 +0000500 if (result->opcode == I_INCBIN) {
501 /*
502 * Correct syntax for INCBIN is that there should be
503 * one string operand, followed by one or two numeric
504 * operands.
505 */
506 if (!result->eops || result->eops->type != EOT_DB_STRING)
507 error(ERR_NONFATAL, "`incbin' expects a file name");
508 else if (result->eops->next &&
509 result->eops->next->type != EOT_DB_NUMBER)
510 error(ERR_NONFATAL, "`incbin': second parameter is",
511 " non-numeric");
512 else if (result->eops->next && result->eops->next->next &&
513 result->eops->next->next->type != EOT_DB_NUMBER)
514 error(ERR_NONFATAL, "`incbin': third parameter is",
515 " non-numeric");
516 else if (result->eops->next && result->eops->next->next &&
517 result->eops->next->next->next)
518 error(ERR_NONFATAL,
519 "`incbin': more than three parameters");
H. Peter Anvineba20a72002-04-30 20:53:55 +0000520 else
H. Peter Anvine2c80182005-01-15 22:15:51 +0000521 return result;
522 /*
523 * If we reach here, one of the above errors happened.
524 * Throw the instruction away.
525 */
526 result->opcode = -1;
527 return result;
528 } else /* DB ... */ if (oper_num == 0)
529 error(ERR_WARNING | ERR_PASS1,
530 "no operand for data declaration");
531 else
532 result->operands = oper_num;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000533
H. Peter Anvine2c80182005-01-15 22:15:51 +0000534 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000535 }
536
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700537 /* right. Now we begin to parse the operands. There may be up to four
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000538 * of these, separated by commas, and terminated by a zero token. */
539
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700540 for (operand = 0; operand < MAX_OPERANDS; operand++) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700541 expr *value; /* used most of the time */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000542 int mref; /* is this going to be a memory ref? */
543 int bracket; /* is it a [] mref, or a & mref? */
544 int setsize = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000545
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700546 result->oprs[operand].disp_size = 0; /* have to zero this whatever */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000547 result->oprs[operand].eaflags = 0; /* and this */
548 result->oprs[operand].opflags = 0;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000549
H. Peter Anvine2c80182005-01-15 22:15:51 +0000550 i = stdscan(NULL, &tokval);
551 if (i == 0)
552 break; /* end of operands: get out of here */
H. Peter Anvin9c987692007-11-04 21:09:32 -0800553 else if (first && i == ':') {
554 insn_is_label = true;
555 goto restart_parse;
556 }
557 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000558 result->oprs[operand].type = 0; /* so far, no override */
559 while (i == TOKEN_SPECIAL) { /* size specifiers */
560 switch ((int)tokval.t_integer) {
561 case S_BYTE:
562 if (!setsize) /* we want to use only the first */
563 result->oprs[operand].type |= BITS8;
564 setsize = 1;
565 break;
566 case S_WORD:
567 if (!setsize)
568 result->oprs[operand].type |= BITS16;
569 setsize = 1;
570 break;
571 case S_DWORD:
572 case S_LONG:
573 if (!setsize)
574 result->oprs[operand].type |= BITS32;
575 setsize = 1;
576 break;
577 case S_QWORD:
578 if (!setsize)
579 result->oprs[operand].type |= BITS64;
580 setsize = 1;
581 break;
582 case S_TWORD:
583 if (!setsize)
584 result->oprs[operand].type |= BITS80;
585 setsize = 1;
586 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700587 case S_OWORD:
588 if (!setsize)
589 result->oprs[operand].type |= BITS128;
590 setsize = 1;
591 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700592 case S_YWORD:
593 if (!setsize)
594 result->oprs[operand].type |= BITS256;
595 setsize = 1;
596 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000597 case S_TO:
598 result->oprs[operand].type |= TO;
599 break;
600 case S_STRICT:
601 result->oprs[operand].type |= STRICT;
602 break;
603 case S_FAR:
604 result->oprs[operand].type |= FAR;
605 break;
606 case S_NEAR:
607 result->oprs[operand].type |= NEAR;
608 break;
609 case S_SHORT:
610 result->oprs[operand].type |= SHORT;
611 break;
612 default:
613 error(ERR_NONFATAL, "invalid operand size specification");
614 }
615 i = stdscan(NULL, &tokval);
616 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000617
H. Peter Anvine2c80182005-01-15 22:15:51 +0000618 if (i == '[' || i == '&') { /* memory reference */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700619 mref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000620 bracket = (i == '[');
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700621 i = stdscan(NULL, &tokval); /* then skip the colon */
622 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
623 process_size_override(result, operand);
624 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000625 }
626 } else { /* immediate operand, or register */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700627 mref = false;
628 bracket = false; /* placate optimisers */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000629 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000630
H. Peter Anvine2c80182005-01-15 22:15:51 +0000631 if ((result->oprs[operand].type & FAR) && !mref &&
632 result->opcode != I_JMP && result->opcode != I_CALL) {
633 error(ERR_NONFATAL, "invalid use of FAR operand specifier");
634 }
Debbie Wiles63b53f72002-06-04 19:31:24 +0000635
H. Peter Anvine2c80182005-01-15 22:15:51 +0000636 value = evaluate(stdscan, NULL, &tokval,
637 &result->oprs[operand].opflags,
638 critical, error, &hints);
639 i = tokval.t_type;
640 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700641 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000642 }
643 if (!value) { /* error in evaluator */
644 result->opcode = -1; /* unrecoverable parse error: */
645 return result; /* ignore this instruction */
646 }
647 if (i == ':' && mref) { /* it was seg:offset */
648 /*
649 * Process the segment override.
650 */
651 if (value[1].type != 0 || value->value != 1 ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700652 REG_SREG & ~nasm_reg_flags[value->type])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000653 error(ERR_NONFATAL, "invalid segment override");
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700654 else if (result->prefixes[PPS_SEG])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000655 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700656 "instruction has conflicting segment overrides");
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000657 else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700658 result->prefixes[PPS_SEG] = value->type;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700659 if (!(REG_FSGS & ~nasm_reg_flags[value->type]))
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000660 result->oprs[operand].eaflags |= EAF_FSGS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000661 }
H. Peter Anvin76690a12002-04-30 20:52:49 +0000662
H. Peter Anvine2c80182005-01-15 22:15:51 +0000663 i = stdscan(NULL, &tokval); /* then skip the colon */
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700664 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
665 process_size_override(result, operand);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000666 i = stdscan(NULL, &tokval);
667 }
668 value = evaluate(stdscan, NULL, &tokval,
669 &result->oprs[operand].opflags,
670 critical, error, &hints);
671 i = tokval.t_type;
672 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700673 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000674 }
675 /* and get the offset */
676 if (!value) { /* but, error in evaluator */
677 result->opcode = -1; /* unrecoverable parse error: */
678 return result; /* ignore this instruction */
679 }
680 }
Victor van den Elzen02846d32009-06-23 03:47:07 +0200681
682 bool recover = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000683 if (mref && bracket) { /* find ] at the end */
684 if (i != ']') {
685 error(ERR_NONFATAL, "parser: expecting ]");
Victor van den Elzen02846d32009-06-23 03:47:07 +0200686 recover = true;
687 } else { /* we got the required ] */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000688 i = stdscan(NULL, &tokval);
Victor van den Elzen02846d32009-06-23 03:47:07 +0200689 if (i != 0 && i != ',') {
690 error(ERR_NONFATAL, "comma or end of line expected");
691 recover = true;
692 }
693 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000694 } else { /* immediate operand */
695 if (i != 0 && i != ',' && i != ':') {
Victor van den Elzen02846d32009-06-23 03:47:07 +0200696 error(ERR_NONFATAL, "comma, colon or end of line expected");
697 recover = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000698 } else if (i == ':') {
699 result->oprs[operand].type |= COLON;
700 }
701 }
Victor van den Elzen02846d32009-06-23 03:47:07 +0200702 if (recover) {
703 do { /* error recovery */
704 i = stdscan(NULL, &tokval);
705 } while (i != 0 && i != ',');
706 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000707
H. Peter Anvine2c80182005-01-15 22:15:51 +0000708 /* now convert the exprs returned from evaluate() into operand
709 * descriptions... */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000710
H. Peter Anvine2c80182005-01-15 22:15:51 +0000711 if (mref) { /* it's a memory reference */
712 expr *e = value;
713 int b, i, s; /* basereg, indexreg, scale */
Keith Kanios7a68f302007-04-16 04:56:06 +0000714 int64_t o; /* offset */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000715
H. Peter Anvine2c80182005-01-15 22:15:51 +0000716 b = i = -1, o = s = 0;
717 result->oprs[operand].hintbase = hints.base;
718 result->oprs[operand].hinttype = hints.type;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000719
H. Peter Anvine2c80182005-01-15 22:15:51 +0000720 if (e->type && e->type <= EXPR_REG_END) { /* this bit's a register */
721 if (e->value == 1) /* in fact it can be basereg */
722 b = e->type;
723 else /* no, it has to be indexreg */
724 i = e->type, s = e->value;
725 e++;
726 }
727 if (e->type && e->type <= EXPR_REG_END) { /* it's a 2nd register */
728 if (b != -1) /* If the first was the base, ... */
729 i = e->type, s = e->value; /* second has to be indexreg */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000730
H. Peter Anvine2c80182005-01-15 22:15:51 +0000731 else if (e->value != 1) { /* If both want to be index */
732 error(ERR_NONFATAL,
733 "beroset-p-592-invalid effective address");
734 result->opcode = -1;
735 return result;
736 } else
737 b = e->type;
738 e++;
739 }
740 if (e->type != 0) { /* is there an offset? */
741 if (e->type <= EXPR_REG_END) { /* in fact, is there an error? */
742 error(ERR_NONFATAL,
743 "beroset-p-603-invalid effective address");
744 result->opcode = -1;
745 return result;
746 } else {
747 if (e->type == EXPR_UNKNOWN) {
Victor van den Elzen154e5922009-02-25 17:32:00 +0100748 result->oprs[operand].opflags |= OPFLAG_UNKNOWN;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000749 o = 0; /* doesn't matter what */
750 result->oprs[operand].wrt = NO_SEG; /* nor this */
751 result->oprs[operand].segment = NO_SEG; /* or this */
752 while (e->type)
753 e++; /* go to the end of the line */
754 } else {
755 if (e->type == EXPR_SIMPLE) {
756 o = e->value;
757 e++;
758 }
759 if (e->type == EXPR_WRT) {
760 result->oprs[operand].wrt = e->value;
761 e++;
762 } else
763 result->oprs[operand].wrt = NO_SEG;
764 /*
765 * Look for a segment base type.
766 */
767 if (e->type && e->type < EXPR_SEGBASE) {
768 error(ERR_NONFATAL,
769 "beroset-p-630-invalid effective address");
770 result->opcode = -1;
771 return result;
772 }
773 while (e->type && e->value == 0)
774 e++;
775 if (e->type && e->value != 1) {
776 error(ERR_NONFATAL,
777 "beroset-p-637-invalid effective address");
778 result->opcode = -1;
779 return result;
780 }
781 if (e->type) {
782 result->oprs[operand].segment =
783 e->type - EXPR_SEGBASE;
784 e++;
785 } else
786 result->oprs[operand].segment = NO_SEG;
787 while (e->type && e->value == 0)
788 e++;
789 if (e->type) {
790 error(ERR_NONFATAL,
791 "beroset-p-650-invalid effective address");
792 result->opcode = -1;
793 return result;
794 }
795 }
796 }
797 } else {
798 o = 0;
799 result->oprs[operand].wrt = NO_SEG;
800 result->oprs[operand].segment = NO_SEG;
801 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000802
H. Peter Anvine2c80182005-01-15 22:15:51 +0000803 if (e->type != 0) { /* there'd better be nothing left! */
804 error(ERR_NONFATAL,
805 "beroset-p-663-invalid effective address");
806 result->opcode = -1;
807 return result;
808 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000809
H. Peter Anvin0da6b582007-09-12 20:32:39 -0700810 /* It is memory, but it can match any r/m operand */
811 result->oprs[operand].type |= MEMORY_ANY;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000812
813 if (b == -1 && (i == -1 || s == 0)) {
814 int is_rel = globalbits == 64 &&
815 !(result->oprs[operand].eaflags & EAF_ABS) &&
816 ((globalrel &&
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000817 !(result->oprs[operand].eaflags & EAF_FSGS)) ||
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000818 (result->oprs[operand].eaflags & EAF_REL));
819
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700820 result->oprs[operand].type |= is_rel ? IP_REL : MEM_OFFS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000821 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000822 result->oprs[operand].basereg = b;
823 result->oprs[operand].indexreg = i;
824 result->oprs[operand].scale = s;
825 result->oprs[operand].offset = o;
826 } else { /* it's not a memory reference */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000827
H. Peter Anvine2c80182005-01-15 22:15:51 +0000828 if (is_just_unknown(value)) { /* it's immediate but unknown */
829 result->oprs[operand].type |= IMMEDIATE;
Victor van den Elzen154e5922009-02-25 17:32:00 +0100830 result->oprs[operand].opflags |= OPFLAG_UNKNOWN;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000831 result->oprs[operand].offset = 0; /* don't care */
832 result->oprs[operand].segment = NO_SEG; /* don't care again */
833 result->oprs[operand].wrt = NO_SEG; /* still don't care */
Victor van den Elzen154e5922009-02-25 17:32:00 +0100834
835 if(optimizing >= 0 && !(result->oprs[operand].type & STRICT))
836 {
837 /* Be optimistic */
838 result->oprs[operand].type |= SBYTE16 | SBYTE32 | SBYTE64;
839 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000840 } else if (is_reloc(value)) { /* it's immediate */
841 result->oprs[operand].type |= IMMEDIATE;
842 result->oprs[operand].offset = reloc_value(value);
843 result->oprs[operand].segment = reloc_seg(value);
844 result->oprs[operand].wrt = reloc_wrt(value);
845 if (is_simple(value)) {
846 if (reloc_value(value) == 1)
847 result->oprs[operand].type |= UNITY;
848 if (optimizing >= 0 &&
849 !(result->oprs[operand].type & STRICT)) {
H. Peter Anvin32cd4c22008-04-04 13:34:53 -0700850 int64_t v64 = reloc_value(value);
851 int32_t v32 = (int32_t)v64;
852 int16_t v16 = (int16_t)v32;
853
854 if (v64 >= -128 && v64 <= 127)
855 result->oprs[operand].type |= SBYTE64;
856 if (v32 >= -128 && v32 <= 127)
857 result->oprs[operand].type |= SBYTE32;
858 if (v16 >= -128 && v16 <= 127)
859 result->oprs[operand].type |= SBYTE16;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000860 }
861 }
862 } else { /* it's a register */
H. Peter Anvin68222142007-11-18 22:18:09 -0800863 unsigned int rs;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000864
H. Peter Anvine2c80182005-01-15 22:15:51 +0000865 if (value->type >= EXPR_SIMPLE || value->value != 1) {
866 error(ERR_NONFATAL, "invalid operand type");
867 result->opcode = -1;
868 return result;
869 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000870
H. Peter Anvine2c80182005-01-15 22:15:51 +0000871 /*
872 * check that its only 1 register, not an expression...
873 */
874 for (i = 1; value[i].type; i++)
875 if (value[i].value) {
876 error(ERR_NONFATAL, "invalid operand type");
877 result->opcode = -1;
878 return result;
879 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000880
H. Peter Anvine2c80182005-01-15 22:15:51 +0000881 /* clear overrides, except TO which applies to FPU regs */
882 if (result->oprs[operand].type & ~TO) {
883 /*
884 * we want to produce a warning iff the specified size
885 * is different from the register size
886 */
H. Peter Anvin68222142007-11-18 22:18:09 -0800887 rs = result->oprs[operand].type & SIZE_MASK;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000888 } else
H. Peter Anvin68222142007-11-18 22:18:09 -0800889 rs = 0;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000890
891 result->oprs[operand].type &= TO;
892 result->oprs[operand].type |= REGISTER;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700893 result->oprs[operand].type |= nasm_reg_flags[value->type];
H. Peter Anvine2c80182005-01-15 22:15:51 +0000894 result->oprs[operand].basereg = value->type;
895
H. Peter Anvin68222142007-11-18 22:18:09 -0800896 if (rs && (result->oprs[operand].type & SIZE_MASK) != rs)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000897 error(ERR_WARNING | ERR_PASS1,
898 "register size specification ignored");
899 }
900 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000901 }
902
H. Peter Anvine2c80182005-01-15 22:15:51 +0000903 result->operands = operand; /* set operand count */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000904
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700905/* clear remaining operands */
906while (operand < MAX_OPERANDS)
907 result->oprs[operand++].type = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000908
909 /*
H. Peter Anvindfb91802008-05-20 11:43:53 -0700910 * Transform RESW, RESD, RESQ, REST, RESO, RESY into RESB.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000911 */
912 switch (result->opcode) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000913 case I_RESW:
914 result->opcode = I_RESB;
915 result->oprs[0].offset *= 2;
916 break;
917 case I_RESD:
918 result->opcode = I_RESB;
919 result->oprs[0].offset *= 4;
920 break;
921 case I_RESQ:
922 result->opcode = I_RESB;
923 result->oprs[0].offset *= 8;
924 break;
925 case I_REST:
926 result->opcode = I_RESB;
927 result->oprs[0].offset *= 10;
928 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700929 case I_RESO:
930 result->opcode = I_RESB;
931 result->oprs[0].offset *= 16;
932 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700933 case I_RESY:
934 result->opcode = I_RESB;
935 result->oprs[0].offset *= 32;
936 break;
H. Peter Anvin16b0a332007-09-12 20:27:41 -0700937 default:
938 break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000939 }
940
941 return result;
942}
943
H. Peter Anvine2c80182005-01-15 22:15:51 +0000944static int is_comma_next(void)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000945{
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000946 char *p;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000947 int i;
948 struct tokenval tv;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000949
H. Peter Anvin76690a12002-04-30 20:52:49 +0000950 p = stdscan_bufptr;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000951 i = stdscan(NULL, &tv);
H. Peter Anvin76690a12002-04-30 20:52:49 +0000952 stdscan_bufptr = p;
953 return (i == ',' || i == ';' || !i);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000954}
955
H. Peter Anvine2c80182005-01-15 22:15:51 +0000956void cleanup_insn(insn * i)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000957{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000958 extop *e;
959
H. Peter Anvin2aa77392008-06-15 17:39:45 -0700960 while ((e = i->eops)) {
961 i->eops = e->next;
962 if (e->type == EOT_DB_STRING_FREE)
963 nasm_free(e->stringval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000964 nasm_free(e);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000965 }
966}