blob: 6893c981a0d2723d2e10af982e453e0ece6e0c14 [file] [log] [blame]
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00001/* parser.c source line parser for the Netwide Assembler
2 *
3 * The Netwide Assembler is copyright (C) 1996 Simon Tatham and
4 * Julian Hall. All rights reserved. The software is
Beroset095e6a22007-12-29 09:44:23 -05005 * redistributable under the license given in the file "LICENSE"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +00006 * distributed in the NASM archive.
7 *
8 * initial version 27/iii/95 by Simon Tatham
9 */
10
H. Peter Anvinfe501952007-10-02 21:53:51 -070011#include "compiler.h"
12
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000013#include <stdio.h>
14#include <stdlib.h>
15#include <stddef.h>
16#include <string.h>
17#include <ctype.h>
Keith Kaniosb7a89542007-04-12 02:40:54 +000018#include <inttypes.h>
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000019
20#include "nasm.h"
H. Peter Anvin24cfef42002-09-12 16:34:06 +000021#include "insns.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000022#include "nasmlib.h"
H. Peter Anvin74cc5e52007-08-30 22:35:34 +000023#include "stdscan.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000024#include "parser.h"
25#include "float.h"
H. Peter Anvina4835d42008-05-20 14:21:29 -070026#include "tables.h"
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000027
H. Peter Anvine2c80182005-01-15 22:15:51 +000028extern int in_abs_seg; /* ABSOLUTE segment flag */
Keith Kaniosb7a89542007-04-12 02:40:54 +000029extern int32_t abs_seg; /* ABSOLUTE segment */
30extern int32_t abs_offset; /* ABSOLUTE segment offset */
H. Peter Anvind0e365d2002-05-26 18:19:19 +000031
H. Peter Anvine2c80182005-01-15 22:15:51 +000032static int is_comma_next(void);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000033
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000034static int i;
35static struct tokenval tokval;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000036static efunc error;
H. Peter Anvine2c80182005-01-15 22:15:51 +000037static struct ofmt *outfmt; /* Structure of addresses of output routines */
H. Peter Anvin12e46512007-10-03 21:30:57 -070038static struct location *location; /* Pointer to current line's segment,offset */
H. Peter Anvineba20a72002-04-30 20:53:55 +000039
H. Peter Anvin12e46512007-10-03 21:30:57 -070040void parser_global_info(struct ofmt *output, struct location * locp)
H. Peter Anvineba20a72002-04-30 20:53:55 +000041{
42 outfmt = output;
43 location = locp;
44}
H. Peter Anvinea6e34d2002-04-30 20:51:32 +000045
H. Peter Anvinde4b89b2007-10-01 15:41:25 -070046static int prefix_slot(enum prefixes prefix)
47{
48 switch (prefix) {
49 case R_CS:
50 case R_DS:
51 case R_SS:
52 case R_ES:
53 case R_FS:
54 case R_GS:
55 return PPS_SEG;
56 case P_LOCK:
57 case P_REP:
58 case P_REPE:
59 case P_REPZ:
60 case P_REPNE:
61 case P_REPNZ:
62 return PPS_LREP;
63 case P_O16:
64 case P_O32:
65 case P_O64:
66 case P_OSP:
67 return PPS_OSIZE;
68 case P_A16:
69 case P_A32:
70 case P_A64:
71 case P_ASP:
72 return PPS_ASIZE;
73 default:
74 error(ERR_PANIC, "Invalid value %d passed to prefix_slot()", prefix);
75 return -1;
76 }
77}
78
79static void process_size_override(insn * result, int operand)
80{
81 if (tasm_compatible_mode) {
82 switch ((int)tokval.t_integer) {
83 /* For TASM compatibility a size override inside the
84 * brackets changes the size of the operand, not the
85 * address type of the operand as it does in standard
86 * NASM syntax. Hence:
87 *
88 * mov eax,[DWORD val]
89 *
90 * is valid syntax in TASM compatibility mode. Note that
91 * you lose the ability to override the default address
92 * type for the instruction, but we never use anything
93 * but 32-bit flat model addressing in our code.
94 */
95 case S_BYTE:
96 result->oprs[operand].type |= BITS8;
97 break;
98 case S_WORD:
99 result->oprs[operand].type |= BITS16;
100 break;
101 case S_DWORD:
102 case S_LONG:
103 result->oprs[operand].type |= BITS32;
104 break;
105 case S_QWORD:
106 result->oprs[operand].type |= BITS64;
107 break;
108 case S_TWORD:
109 result->oprs[operand].type |= BITS80;
110 break;
111 case S_OWORD:
112 result->oprs[operand].type |= BITS128;
113 break;
114 default:
115 error(ERR_NONFATAL,
116 "invalid operand size specification");
117 break;
118 }
119 } else {
120 /* Standard NASM compatible syntax */
121 switch ((int)tokval.t_integer) {
122 case S_NOSPLIT:
123 result->oprs[operand].eaflags |= EAF_TIMESTWO;
124 break;
125 case S_REL:
126 result->oprs[operand].eaflags |= EAF_REL;
127 break;
128 case S_ABS:
129 result->oprs[operand].eaflags |= EAF_ABS;
130 break;
131 case S_BYTE:
132 result->oprs[operand].disp_size = 8;
133 result->oprs[operand].eaflags |= EAF_BYTEOFFS;
134 break;
135 case P_A16:
136 case P_A32:
137 case P_A64:
138 if (result->prefixes[PPS_ASIZE] &&
139 result->prefixes[PPS_ASIZE] != tokval.t_integer)
140 error(ERR_NONFATAL,
141 "conflicting address size specifications");
142 else
143 result->prefixes[PPS_ASIZE] = tokval.t_integer;
144 break;
145 case S_WORD:
146 result->oprs[operand].disp_size = 16;
147 result->oprs[operand].eaflags |= EAF_WORDOFFS;
148 break;
149 case S_DWORD:
150 case S_LONG:
151 result->oprs[operand].disp_size = 32;
152 result->oprs[operand].eaflags |= EAF_WORDOFFS;
153 break;
154 case S_QWORD:
155 result->oprs[operand].disp_size = 64;
156 result->oprs[operand].eaflags |= EAF_WORDOFFS;
157 break;
158 default:
159 error(ERR_NONFATAL, "invalid size specification in"
160 " effective address");
161 break;
162 }
163 }
164}
165
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000166insn *parse_line(int pass, char *buffer, insn * result,
H. Peter Anvine2c80182005-01-15 22:15:51 +0000167 efunc errfunc, evalfunc evaluate, ldfunc ldef)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000168{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000169 int operand;
170 int critical;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000171 struct eval_hints hints;
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700172 int j;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800173 bool first;
174 bool insn_is_label = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000175
H. Peter Anvin9c987692007-11-04 21:09:32 -0800176restart_parse:
177 first = true;
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700178 result->forw_ref = false;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000179 error = errfunc;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000180
H. Peter Anvin76690a12002-04-30 20:52:49 +0000181 stdscan_reset();
182 stdscan_bufptr = buffer;
183 i = stdscan(NULL, &tokval);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000184
H. Peter Anvine2c80182005-01-15 22:15:51 +0000185 result->label = NULL; /* Assume no label */
186 result->eops = NULL; /* must do this, whatever happens */
Keith Kaniosb7a89542007-04-12 02:40:54 +0000187 result->operands = 0; /* must initialize this */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000188
H. Peter Anvine2c80182005-01-15 22:15:51 +0000189 if (i == 0) { /* blank line - ignore */
190 result->opcode = -1; /* and no instruction either */
191 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000192 }
193 if (i != TOKEN_ID && i != TOKEN_INSN && i != TOKEN_PREFIX &&
H. Peter Anvina4835d42008-05-20 14:21:29 -0700194 (i != TOKEN_REG || (REG_SREG & ~nasm_reg_flags[tokval.t_integer]))) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000195 error(ERR_NONFATAL, "label or instruction expected"
196 " at start of line");
197 result->opcode = -1;
198 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000199 }
200
H. Peter Anvin9c987692007-11-04 21:09:32 -0800201 if (i == TOKEN_ID || (insn_is_label && i == TOKEN_INSN)) {
202 /* there's a label here */
203 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000204 result->label = tokval.t_charptr;
205 i = stdscan(NULL, &tokval);
206 if (i == ':') { /* skip over the optional colon */
207 i = stdscan(NULL, &tokval);
208 } else if (i == 0) {
209 error(ERR_WARNING | ERR_WARN_OL | ERR_PASS1,
210 "label alone on a line without a colon might be in error");
211 }
212 if (i != TOKEN_INSN || tokval.t_integer != I_EQU) {
213 /*
214 * FIXME: location->segment could be NO_SEG, in which case
215 * it is possible we should be passing 'abs_seg'. Look into this.
216 * Work out whether that is *really* what we should be doing.
217 * Generally fix things. I think this is right as it is, but
218 * am still not certain.
219 */
220 ldef(result->label, in_abs_seg ? abs_seg : location->segment,
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700221 location->offset, NULL, true, false, outfmt, errfunc);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000222 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000223 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000224
H. Peter Anvine2c80182005-01-15 22:15:51 +0000225 if (i == 0) {
226 result->opcode = -1; /* this line contains just a label */
227 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000228 }
229
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700230 for (j = 0; j < MAXPREFIX; j++)
231 result->prefixes[j] = P_none;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000232 result->times = 1L;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000233
234 while (i == TOKEN_PREFIX ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700235 (i == TOKEN_REG && !(REG_SREG & ~nasm_reg_flags[tokval.t_integer])))
H. Peter Anvineba20a72002-04-30 20:53:55 +0000236 {
H. Peter Anvin9c987692007-11-04 21:09:32 -0800237 first = false;
238
H. Peter Anvine2c80182005-01-15 22:15:51 +0000239 /*
240 * Handle special case: the TIMES prefix.
241 */
242 if (i == TOKEN_PREFIX && tokval.t_integer == P_TIMES) {
243 expr *value;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000244
H. Peter Anvine2c80182005-01-15 22:15:51 +0000245 i = stdscan(NULL, &tokval);
246 value =
247 evaluate(stdscan, NULL, &tokval, NULL, pass0, error, NULL);
248 i = tokval.t_type;
249 if (!value) { /* but, error in evaluator */
250 result->opcode = -1; /* unrecoverable parse error: */
251 return result; /* ignore this instruction */
252 }
253 if (!is_simple(value)) {
254 error(ERR_NONFATAL,
255 "non-constant argument supplied to TIMES");
256 result->times = 1L;
257 } else {
258 result->times = value->value;
Charles Crayne7f596e72008-09-23 21:49:09 -0700259 if (value->value < 0 && pass0 == 2) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000260 error(ERR_NONFATAL, "TIMES value %d is negative",
261 value->value);
262 result->times = 0;
263 }
264 }
265 } else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700266 int slot = prefix_slot(tokval.t_integer);
267 if (result->prefixes[slot]) {
Charles Crayne052c0bd2007-10-29 18:24:59 -0700268 if (result->prefixes[slot] == tokval.t_integer)
H. Peter Anvin9c987692007-11-04 21:09:32 -0800269 error(ERR_WARNING,
Charles Crayne052c0bd2007-10-29 18:24:59 -0700270 "instruction has redundant prefixes");
271 else
272 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700273 "instruction has conflicting prefixes");
274 }
275 result->prefixes[slot] = tokval.t_integer;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000276 i = stdscan(NULL, &tokval);
277 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000278 }
279
280 if (i != TOKEN_INSN) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700281 int j;
282 enum prefixes pfx;
283
284 for (j = 0; j < MAXPREFIX; j++)
285 if ((pfx = result->prefixes[j]) != P_none)
286 break;
H. Peter Anvincb583b92007-10-28 22:04:42 -0700287
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700288 if (i == 0 && pfx != P_none) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000289 /*
290 * Instruction prefixes are present, but no actual
291 * instruction. This is allowed: at this point we
292 * invent a notional instruction of RESB 0.
293 */
294 result->opcode = I_RESB;
295 result->operands = 1;
296 result->oprs[0].type = IMMEDIATE;
297 result->oprs[0].offset = 0L;
298 result->oprs[0].segment = result->oprs[0].wrt = NO_SEG;
299 return result;
300 } else {
301 error(ERR_NONFATAL, "parser: instruction expected");
302 result->opcode = -1;
303 return result;
304 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000305 }
306
307 result->opcode = tokval.t_integer;
308 result->condition = tokval.t_inttwo;
309
310 /*
Charles Crayne2581c862008-09-10 19:21:52 -0700311 * INCBIN cannot be satisfied with incorrectly
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000312 * evaluated operands, since the correct values _must_ be known
313 * on the first pass. Hence, even in pass one, we set the
314 * `critical' flag on calling evaluate(), so that it will bomb
Charles Crayne2581c862008-09-10 19:21:52 -0700315 * out on undefined symbols.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000316 */
Charles Crayne2581c862008-09-10 19:21:52 -0700317 if (result->opcode == I_INCBIN) {
Charles Crayne5a7976c2008-03-26 17:20:21 -0700318 critical = (pass0 < 2 ? 1 : 2);
319
H. Peter Anvine2c80182005-01-15 22:15:51 +0000320 } else
321 critical = (pass == 2 ? 2 : 0);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000322
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700323 if (result->opcode == I_DB || result->opcode == I_DW ||
324 result->opcode == I_DD || result->opcode == I_DQ ||
325 result->opcode == I_DT || result->opcode == I_DO ||
H. Peter Anvindfb91802008-05-20 11:43:53 -0700326 result->opcode == I_DY || result->opcode == I_INCBIN) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000327 extop *eop, **tail = &result->eops, **fixptr;
328 int oper_num = 0;
H. Peter Anvin518df302008-06-14 16:53:48 -0700329 int32_t sign;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000330
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700331 result->eops_float = false;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000332
H. Peter Anvine2c80182005-01-15 22:15:51 +0000333 /*
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700334 * Begin to read the DB/DW/DD/DQ/DT/DO/INCBIN operands.
H. Peter Anvine2c80182005-01-15 22:15:51 +0000335 */
336 while (1) {
337 i = stdscan(NULL, &tokval);
338 if (i == 0)
339 break;
H. Peter Anvin9c987692007-11-04 21:09:32 -0800340 else if (first && i == ':') {
341 insn_is_label = true;
342 goto restart_parse;
343 }
344 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000345 fixptr = tail;
346 eop = *tail = nasm_malloc(sizeof(extop));
347 tail = &eop->next;
348 eop->next = NULL;
349 eop->type = EOT_NOTHING;
350 oper_num++;
H. Peter Anvin518df302008-06-14 16:53:48 -0700351 sign = +1;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000352
H. Peter Anvin518df302008-06-14 16:53:48 -0700353 /* is_comma_next() here is to distinguish this from
354 a string used as part of an expression... */
H. Peter Anvin11627042008-06-09 20:45:19 -0700355 if (i == TOKEN_STR && is_comma_next()) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000356 eop->type = EOT_DB_STRING;
357 eop->stringval = tokval.t_charptr;
358 eop->stringlen = tokval.t_inttwo;
359 i = stdscan(NULL, &tokval); /* eat the comma */
H. Peter Anvin518df302008-06-14 16:53:48 -0700360 } else if (i == TOKEN_STRFUNC) {
361 bool parens = false;
362 const char *funcname = tokval.t_charptr;
363 enum strfunc func = tokval.t_integer;
364 i = stdscan(NULL, &tokval);
365 if (i == '(') {
366 parens = true;
367 i = stdscan(NULL, &tokval);
368 }
369 if (i != TOKEN_STR) {
370 error(ERR_NONFATAL,
371 "%s must be followed by a string constant",
372 funcname);
373 eop->type = EOT_NOTHING;
374 } else {
375 eop->type = EOT_DB_STRING_FREE;
376 eop->stringlen =
377 string_transform(tokval.t_charptr, tokval.t_inttwo,
378 &eop->stringval, func);
379 if (eop->stringlen == (size_t)-1) {
380 error(ERR_NONFATAL, "invalid string for transform");
381 eop->type = EOT_NOTHING;
382 }
383 }
384 if (parens && i && i != ')') {
385 i = stdscan(NULL, &tokval);
386 if (i != ')') {
387 error(ERR_NONFATAL, "unterminated %s function",
388 funcname);
389 }
390 }
391 if (i && i != ',')
392 i = stdscan(NULL, &tokval);
393 } else if (i == '-' || i == '+') {
394 char *save = stdscan_bufptr;
395 int token = i;
396 sign = (i == '-') ? -1 : 1;
397 i = stdscan(NULL, &tokval);
398 if (i != TOKEN_FLOAT) {
399 stdscan_bufptr = save;
400 i = tokval.t_type = token;
401 goto is_expression;
402 } else {
403 goto is_float;
404 }
405 } else if (i == TOKEN_FLOAT) {
406 is_float:
407 eop->type = EOT_DB_STRING;
408 result->eops_float = true;
409 switch (result->opcode) {
410 case I_DB:
411 eop->stringlen = 1;
412 break;
413 case I_DW:
414 eop->stringlen = 2;
415 break;
416 case I_DD:
417 eop->stringlen = 4;
418 break;
419 case I_DQ:
420 eop->stringlen = 8;
421 break;
422 case I_DT:
423 eop->stringlen = 10;
424 break;
425 case I_DO:
426 eop->stringlen = 16;
427 break;
428 case I_DY:
429 error(ERR_NONFATAL, "floating-point constant"
430 " encountered in DY instruction");
431 eop->stringlen = 0;
432 break;
433 default:
434 error(ERR_NONFATAL, "floating-point constant"
435 " encountered in unknown instruction");
436 /*
437 * fix suggested by Pedro Gimeno... original line
438 * was:
439 * eop->type = EOT_NOTHING;
440 */
441 eop->stringlen = 0;
442 break;
443 }
444 eop = nasm_realloc(eop, sizeof(extop) + eop->stringlen);
445 tail = &eop->next;
446 *fixptr = eop;
447 eop->stringval = (char *)eop + sizeof(extop);
448 if (!eop->stringlen ||
449 !float_const(tokval.t_charptr, sign,
450 (uint8_t *)eop->stringval,
451 eop->stringlen, error))
452 eop->type = EOT_NOTHING;
453 i = stdscan(NULL, &tokval); /* eat the comma */
454 } else {
455 /* anything else, assume it is an expression */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000456 expr *value;
H. Peter Anvin518df302008-06-14 16:53:48 -0700457
458 is_expression:
H. Peter Anvine2c80182005-01-15 22:15:51 +0000459 value = evaluate(stdscan, NULL, &tokval, NULL,
460 critical, error, NULL);
461 i = tokval.t_type;
462 if (!value) { /* error in evaluator */
463 result->opcode = -1; /* unrecoverable parse error: */
464 return result; /* ignore this instruction */
465 }
466 if (is_unknown(value)) {
467 eop->type = EOT_DB_NUMBER;
468 eop->offset = 0; /* doesn't matter what we put */
469 eop->segment = eop->wrt = NO_SEG; /* likewise */
470 } else if (is_reloc(value)) {
471 eop->type = EOT_DB_NUMBER;
472 eop->offset = reloc_value(value);
473 eop->segment = reloc_seg(value);
474 eop->wrt = reloc_wrt(value);
475 } else {
476 error(ERR_NONFATAL,
477 "operand %d: expression is not simple"
478 " or relocatable", oper_num);
479 }
480 }
H. Peter Anvin6768eb72002-04-30 20:52:26 +0000481
H. Peter Anvine2c80182005-01-15 22:15:51 +0000482 /*
483 * We're about to call stdscan(), which will eat the
484 * comma that we're currently sitting on between
485 * arguments. However, we'd better check first that it
486 * _is_ a comma.
487 */
488 if (i == 0) /* also could be EOL */
489 break;
490 if (i != ',') {
491 error(ERR_NONFATAL, "comma expected after operand %d",
492 oper_num);
493 result->opcode = -1; /* unrecoverable parse error: */
494 return result; /* ignore this instruction */
495 }
496 }
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000497
H. Peter Anvine2c80182005-01-15 22:15:51 +0000498 if (result->opcode == I_INCBIN) {
499 /*
500 * Correct syntax for INCBIN is that there should be
501 * one string operand, followed by one or two numeric
502 * operands.
503 */
504 if (!result->eops || result->eops->type != EOT_DB_STRING)
505 error(ERR_NONFATAL, "`incbin' expects a file name");
506 else if (result->eops->next &&
507 result->eops->next->type != EOT_DB_NUMBER)
508 error(ERR_NONFATAL, "`incbin': second parameter is",
509 " non-numeric");
510 else if (result->eops->next && result->eops->next->next &&
511 result->eops->next->next->type != EOT_DB_NUMBER)
512 error(ERR_NONFATAL, "`incbin': third parameter is",
513 " non-numeric");
514 else if (result->eops->next && result->eops->next->next &&
515 result->eops->next->next->next)
516 error(ERR_NONFATAL,
517 "`incbin': more than three parameters");
H. Peter Anvineba20a72002-04-30 20:53:55 +0000518 else
H. Peter Anvine2c80182005-01-15 22:15:51 +0000519 return result;
520 /*
521 * If we reach here, one of the above errors happened.
522 * Throw the instruction away.
523 */
524 result->opcode = -1;
525 return result;
526 } else /* DB ... */ if (oper_num == 0)
527 error(ERR_WARNING | ERR_PASS1,
528 "no operand for data declaration");
529 else
530 result->operands = oper_num;
H. Peter Anvind7ed89e2002-04-30 20:52:08 +0000531
H. Peter Anvine2c80182005-01-15 22:15:51 +0000532 return result;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000533 }
534
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700535 /* right. Now we begin to parse the operands. There may be up to four
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000536 * of these, separated by commas, and terminated by a zero token. */
537
H. Peter Anvin8f94f982007-09-17 16:31:33 -0700538 for (operand = 0; operand < MAX_OPERANDS; operand++) {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700539 expr *value; /* used most of the time */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000540 int mref; /* is this going to be a memory ref? */
541 int bracket; /* is it a [] mref, or a & mref? */
542 int setsize = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000543
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700544 result->oprs[operand].disp_size = 0; /* have to zero this whatever */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000545 result->oprs[operand].eaflags = 0; /* and this */
546 result->oprs[operand].opflags = 0;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000547
H. Peter Anvine2c80182005-01-15 22:15:51 +0000548 i = stdscan(NULL, &tokval);
549 if (i == 0)
550 break; /* end of operands: get out of here */
H. Peter Anvin9c987692007-11-04 21:09:32 -0800551 else if (first && i == ':') {
552 insn_is_label = true;
553 goto restart_parse;
554 }
555 first = false;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000556 result->oprs[operand].type = 0; /* so far, no override */
557 while (i == TOKEN_SPECIAL) { /* size specifiers */
558 switch ((int)tokval.t_integer) {
559 case S_BYTE:
560 if (!setsize) /* we want to use only the first */
561 result->oprs[operand].type |= BITS8;
562 setsize = 1;
563 break;
564 case S_WORD:
565 if (!setsize)
566 result->oprs[operand].type |= BITS16;
567 setsize = 1;
568 break;
569 case S_DWORD:
570 case S_LONG:
571 if (!setsize)
572 result->oprs[operand].type |= BITS32;
573 setsize = 1;
574 break;
575 case S_QWORD:
576 if (!setsize)
577 result->oprs[operand].type |= BITS64;
578 setsize = 1;
579 break;
580 case S_TWORD:
581 if (!setsize)
582 result->oprs[operand].type |= BITS80;
583 setsize = 1;
584 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700585 case S_OWORD:
586 if (!setsize)
587 result->oprs[operand].type |= BITS128;
588 setsize = 1;
589 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700590 case S_YWORD:
591 if (!setsize)
592 result->oprs[operand].type |= BITS256;
593 setsize = 1;
594 break;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000595 case S_TO:
596 result->oprs[operand].type |= TO;
597 break;
598 case S_STRICT:
599 result->oprs[operand].type |= STRICT;
600 break;
601 case S_FAR:
602 result->oprs[operand].type |= FAR;
603 break;
604 case S_NEAR:
605 result->oprs[operand].type |= NEAR;
606 break;
607 case S_SHORT:
608 result->oprs[operand].type |= SHORT;
609 break;
610 default:
611 error(ERR_NONFATAL, "invalid operand size specification");
612 }
613 i = stdscan(NULL, &tokval);
614 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000615
H. Peter Anvine2c80182005-01-15 22:15:51 +0000616 if (i == '[' || i == '&') { /* memory reference */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700617 mref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000618 bracket = (i == '[');
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700619 i = stdscan(NULL, &tokval); /* then skip the colon */
620 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
621 process_size_override(result, operand);
622 i = stdscan(NULL, &tokval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000623 }
624 } else { /* immediate operand, or register */
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700625 mref = false;
626 bracket = false; /* placate optimisers */
H. Peter Anvine2c80182005-01-15 22:15:51 +0000627 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000628
H. Peter Anvine2c80182005-01-15 22:15:51 +0000629 if ((result->oprs[operand].type & FAR) && !mref &&
630 result->opcode != I_JMP && result->opcode != I_CALL) {
631 error(ERR_NONFATAL, "invalid use of FAR operand specifier");
632 }
Debbie Wiles63b53f72002-06-04 19:31:24 +0000633
H. Peter Anvine2c80182005-01-15 22:15:51 +0000634 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 if (!value) { /* error in evaluator */
642 result->opcode = -1; /* unrecoverable parse error: */
643 return result; /* ignore this instruction */
644 }
645 if (i == ':' && mref) { /* it was seg:offset */
646 /*
647 * Process the segment override.
648 */
649 if (value[1].type != 0 || value->value != 1 ||
H. Peter Anvina4835d42008-05-20 14:21:29 -0700650 REG_SREG & ~nasm_reg_flags[value->type])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000651 error(ERR_NONFATAL, "invalid segment override");
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700652 else if (result->prefixes[PPS_SEG])
H. Peter Anvine2c80182005-01-15 22:15:51 +0000653 error(ERR_NONFATAL,
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700654 "instruction has conflicting segment overrides");
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000655 else {
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700656 result->prefixes[PPS_SEG] = value->type;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700657 if (!(REG_FSGS & ~nasm_reg_flags[value->type]))
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000658 result->oprs[operand].eaflags |= EAF_FSGS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000659 }
H. Peter Anvin76690a12002-04-30 20:52:49 +0000660
H. Peter Anvine2c80182005-01-15 22:15:51 +0000661 i = stdscan(NULL, &tokval); /* then skip the colon */
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700662 while (i == TOKEN_SPECIAL || i == TOKEN_PREFIX) {
663 process_size_override(result, operand);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000664 i = stdscan(NULL, &tokval);
665 }
666 value = evaluate(stdscan, NULL, &tokval,
667 &result->oprs[operand].opflags,
668 critical, error, &hints);
669 i = tokval.t_type;
670 if (result->oprs[operand].opflags & OPFLAG_FORWARD) {
H. Peter Anvin6867acc2007-10-10 14:58:45 -0700671 result->forw_ref = true;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000672 }
673 /* and get the offset */
674 if (!value) { /* but, error in evaluator */
675 result->opcode = -1; /* unrecoverable parse error: */
676 return result; /* ignore this instruction */
677 }
678 }
679 if (mref && bracket) { /* find ] at the end */
680 if (i != ']') {
681 error(ERR_NONFATAL, "parser: expecting ]");
682 do { /* error recovery again */
683 i = stdscan(NULL, &tokval);
684 } while (i != 0 && i != ',');
685 } else /* we got the required ] */
686 i = stdscan(NULL, &tokval);
687 } else { /* immediate operand */
688 if (i != 0 && i != ',' && i != ':') {
689 error(ERR_NONFATAL, "comma or end of line expected");
690 do { /* error recovery */
691 i = stdscan(NULL, &tokval);
692 } while (i != 0 && i != ',');
693 } else if (i == ':') {
694 result->oprs[operand].type |= COLON;
695 }
696 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000697
H. Peter Anvine2c80182005-01-15 22:15:51 +0000698 /* now convert the exprs returned from evaluate() into operand
699 * descriptions... */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000700
H. Peter Anvine2c80182005-01-15 22:15:51 +0000701 if (mref) { /* it's a memory reference */
702 expr *e = value;
703 int b, i, s; /* basereg, indexreg, scale */
Keith Kanios7a68f302007-04-16 04:56:06 +0000704 int64_t o; /* offset */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000705
H. Peter Anvine2c80182005-01-15 22:15:51 +0000706 b = i = -1, o = s = 0;
707 result->oprs[operand].hintbase = hints.base;
708 result->oprs[operand].hinttype = hints.type;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000709
H. Peter Anvine2c80182005-01-15 22:15:51 +0000710 if (e->type && e->type <= EXPR_REG_END) { /* this bit's a register */
711 if (e->value == 1) /* in fact it can be basereg */
712 b = e->type;
713 else /* no, it has to be indexreg */
714 i = e->type, s = e->value;
715 e++;
716 }
717 if (e->type && e->type <= EXPR_REG_END) { /* it's a 2nd register */
718 if (b != -1) /* If the first was the base, ... */
719 i = e->type, s = e->value; /* second has to be indexreg */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000720
H. Peter Anvine2c80182005-01-15 22:15:51 +0000721 else if (e->value != 1) { /* If both want to be index */
722 error(ERR_NONFATAL,
723 "beroset-p-592-invalid effective address");
724 result->opcode = -1;
725 return result;
726 } else
727 b = e->type;
728 e++;
729 }
730 if (e->type != 0) { /* is there an offset? */
731 if (e->type <= EXPR_REG_END) { /* in fact, is there an error? */
732 error(ERR_NONFATAL,
733 "beroset-p-603-invalid effective address");
734 result->opcode = -1;
735 return result;
736 } else {
737 if (e->type == EXPR_UNKNOWN) {
738 o = 0; /* doesn't matter what */
739 result->oprs[operand].wrt = NO_SEG; /* nor this */
740 result->oprs[operand].segment = NO_SEG; /* or this */
741 while (e->type)
742 e++; /* go to the end of the line */
743 } else {
744 if (e->type == EXPR_SIMPLE) {
745 o = e->value;
746 e++;
747 }
748 if (e->type == EXPR_WRT) {
749 result->oprs[operand].wrt = e->value;
750 e++;
751 } else
752 result->oprs[operand].wrt = NO_SEG;
753 /*
754 * Look for a segment base type.
755 */
756 if (e->type && e->type < EXPR_SEGBASE) {
757 error(ERR_NONFATAL,
758 "beroset-p-630-invalid effective address");
759 result->opcode = -1;
760 return result;
761 }
762 while (e->type && e->value == 0)
763 e++;
764 if (e->type && e->value != 1) {
765 error(ERR_NONFATAL,
766 "beroset-p-637-invalid effective address");
767 result->opcode = -1;
768 return result;
769 }
770 if (e->type) {
771 result->oprs[operand].segment =
772 e->type - EXPR_SEGBASE;
773 e++;
774 } else
775 result->oprs[operand].segment = NO_SEG;
776 while (e->type && e->value == 0)
777 e++;
778 if (e->type) {
779 error(ERR_NONFATAL,
780 "beroset-p-650-invalid effective address");
781 result->opcode = -1;
782 return result;
783 }
784 }
785 }
786 } else {
787 o = 0;
788 result->oprs[operand].wrt = NO_SEG;
789 result->oprs[operand].segment = NO_SEG;
790 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000791
H. Peter Anvine2c80182005-01-15 22:15:51 +0000792 if (e->type != 0) { /* there'd better be nothing left! */
793 error(ERR_NONFATAL,
794 "beroset-p-663-invalid effective address");
795 result->opcode = -1;
796 return result;
797 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000798
H. Peter Anvin0da6b582007-09-12 20:32:39 -0700799 /* It is memory, but it can match any r/m operand */
800 result->oprs[operand].type |= MEMORY_ANY;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000801
802 if (b == -1 && (i == -1 || s == 0)) {
803 int is_rel = globalbits == 64 &&
804 !(result->oprs[operand].eaflags & EAF_ABS) &&
805 ((globalrel &&
H. Peter Anvin150e20d2007-08-29 15:19:19 +0000806 !(result->oprs[operand].eaflags & EAF_FSGS)) ||
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000807 (result->oprs[operand].eaflags & EAF_REL));
808
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700809 result->oprs[operand].type |= is_rel ? IP_REL : MEM_OFFS;
H. Peter Anvin99c4ecd2007-08-28 23:06:00 +0000810 }
H. Peter Anvine2c80182005-01-15 22:15:51 +0000811 result->oprs[operand].basereg = b;
812 result->oprs[operand].indexreg = i;
813 result->oprs[operand].scale = s;
814 result->oprs[operand].offset = o;
815 } else { /* it's not a memory reference */
H. Peter Anvineba20a72002-04-30 20:53:55 +0000816
H. Peter Anvine2c80182005-01-15 22:15:51 +0000817 if (is_just_unknown(value)) { /* it's immediate but unknown */
818 result->oprs[operand].type |= IMMEDIATE;
819 result->oprs[operand].offset = 0; /* don't care */
820 result->oprs[operand].segment = NO_SEG; /* don't care again */
821 result->oprs[operand].wrt = NO_SEG; /* still don't care */
822 } else if (is_reloc(value)) { /* it's immediate */
823 result->oprs[operand].type |= IMMEDIATE;
824 result->oprs[operand].offset = reloc_value(value);
825 result->oprs[operand].segment = reloc_seg(value);
826 result->oprs[operand].wrt = reloc_wrt(value);
827 if (is_simple(value)) {
828 if (reloc_value(value) == 1)
829 result->oprs[operand].type |= UNITY;
830 if (optimizing >= 0 &&
831 !(result->oprs[operand].type & STRICT)) {
H. Peter Anvin32cd4c22008-04-04 13:34:53 -0700832 int64_t v64 = reloc_value(value);
833 int32_t v32 = (int32_t)v64;
834 int16_t v16 = (int16_t)v32;
835
836 if (v64 >= -128 && v64 <= 127)
837 result->oprs[operand].type |= SBYTE64;
838 if (v32 >= -128 && v32 <= 127)
839 result->oprs[operand].type |= SBYTE32;
840 if (v16 >= -128 && v16 <= 127)
841 result->oprs[operand].type |= SBYTE16;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000842 }
843 }
844 } else { /* it's a register */
H. Peter Anvin68222142007-11-18 22:18:09 -0800845 unsigned int rs;
H. Peter Anvineba20a72002-04-30 20:53:55 +0000846
H. Peter Anvine2c80182005-01-15 22:15:51 +0000847 if (value->type >= EXPR_SIMPLE || value->value != 1) {
848 error(ERR_NONFATAL, "invalid operand type");
849 result->opcode = -1;
850 return result;
851 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000852
H. Peter Anvine2c80182005-01-15 22:15:51 +0000853 /*
854 * check that its only 1 register, not an expression...
855 */
856 for (i = 1; value[i].type; i++)
857 if (value[i].value) {
858 error(ERR_NONFATAL, "invalid operand type");
859 result->opcode = -1;
860 return result;
861 }
H. Peter Anvineba20a72002-04-30 20:53:55 +0000862
H. Peter Anvine2c80182005-01-15 22:15:51 +0000863 /* clear overrides, except TO which applies to FPU regs */
864 if (result->oprs[operand].type & ~TO) {
865 /*
866 * we want to produce a warning iff the specified size
867 * is different from the register size
868 */
H. Peter Anvin68222142007-11-18 22:18:09 -0800869 rs = result->oprs[operand].type & SIZE_MASK;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000870 } else
H. Peter Anvin68222142007-11-18 22:18:09 -0800871 rs = 0;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000872
873 result->oprs[operand].type &= TO;
874 result->oprs[operand].type |= REGISTER;
H. Peter Anvina4835d42008-05-20 14:21:29 -0700875 result->oprs[operand].type |= nasm_reg_flags[value->type];
H. Peter Anvine2c80182005-01-15 22:15:51 +0000876 result->oprs[operand].basereg = value->type;
877
H. Peter Anvin68222142007-11-18 22:18:09 -0800878 if (rs && (result->oprs[operand].type & SIZE_MASK) != rs)
H. Peter Anvine2c80182005-01-15 22:15:51 +0000879 error(ERR_WARNING | ERR_PASS1,
880 "register size specification ignored");
881 }
882 }
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000883 }
884
H. Peter Anvine2c80182005-01-15 22:15:51 +0000885 result->operands = operand; /* set operand count */
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000886
H. Peter Anvinde4b89b2007-10-01 15:41:25 -0700887/* clear remaining operands */
888while (operand < MAX_OPERANDS)
889 result->oprs[operand++].type = 0;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000890
891 /*
H. Peter Anvindfb91802008-05-20 11:43:53 -0700892 * Transform RESW, RESD, RESQ, REST, RESO, RESY into RESB.
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000893 */
894 switch (result->opcode) {
H. Peter Anvine2c80182005-01-15 22:15:51 +0000895 case I_RESW:
896 result->opcode = I_RESB;
897 result->oprs[0].offset *= 2;
898 break;
899 case I_RESD:
900 result->opcode = I_RESB;
901 result->oprs[0].offset *= 4;
902 break;
903 case I_RESQ:
904 result->opcode = I_RESB;
905 result->oprs[0].offset *= 8;
906 break;
907 case I_REST:
908 result->opcode = I_RESB;
909 result->oprs[0].offset *= 10;
910 break;
H. Peter Anvin41c9f6f2007-09-18 13:01:32 -0700911 case I_RESO:
912 result->opcode = I_RESB;
913 result->oprs[0].offset *= 16;
914 break;
H. Peter Anvindfb91802008-05-20 11:43:53 -0700915 case I_RESY:
916 result->opcode = I_RESB;
917 result->oprs[0].offset *= 32;
918 break;
H. Peter Anvin16b0a332007-09-12 20:27:41 -0700919 default:
920 break;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000921 }
922
923 return result;
924}
925
H. Peter Anvine2c80182005-01-15 22:15:51 +0000926static int is_comma_next(void)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000927{
Keith Kaniosa6dfa782007-04-13 16:47:53 +0000928 char *p;
H. Peter Anvin76690a12002-04-30 20:52:49 +0000929 int i;
930 struct tokenval tv;
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000931
H. Peter Anvin76690a12002-04-30 20:52:49 +0000932 p = stdscan_bufptr;
H. Peter Anvine2c80182005-01-15 22:15:51 +0000933 i = stdscan(NULL, &tv);
H. Peter Anvin76690a12002-04-30 20:52:49 +0000934 stdscan_bufptr = p;
935 return (i == ',' || i == ';' || !i);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000936}
937
H. Peter Anvine2c80182005-01-15 22:15:51 +0000938void cleanup_insn(insn * i)
H. Peter Anvineba20a72002-04-30 20:53:55 +0000939{
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000940 extop *e;
941
H. Peter Anvin2aa77392008-06-15 17:39:45 -0700942 while ((e = i->eops)) {
943 i->eops = e->next;
944 if (e->type == EOT_DB_STRING_FREE)
945 nasm_free(e->stringval);
H. Peter Anvine2c80182005-01-15 22:15:51 +0000946 nasm_free(e);
H. Peter Anvinea6e34d2002-04-30 20:51:32 +0000947 }
948}