1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706
|
%{
/* SPIM S20 MIPS simulator.
Lexical scanner.
Copyright (c) 1990-2010, James R. Larus.
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
Neither the name of the James R. Larus nor the names of its contributors may be
used to endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
int fileno(FILE *stream);
#include "spim.h"
#include "string-stream.h"
#include "spim-utils.h"
#include "inst.h"
#include "reg.h"
#include "sym-tbl.h"
#include "parser.h"
#include "scanner.h"
#include "y.tab.h"
#ifndef YY_CHAR
#define YY_CHAR char
#endif
#define YY_NO_UNISTD_H
/* Exported Variables: */
int only_id;
int line_no; /* Line number in input file*/
/* Local Variables: */
/* Track which line we are reading and where it began in the buffer. */
static int current_line_no = 0;
static YY_CHAR *current_line = NULL;
static double scan_float; /* Where FP values are kept */
static int line_returned = 0; /* Returned current line yet? */
static int eof_returned = 0; /* Return EOF token yet? */
/* Local functions: */
static int check_keyword (YY_CHAR *id, int allow_pseudo_ops);
static YY_CHAR *copy_str (YY_CHAR *str, int chop);
static YY_CHAR scan_escape (YY_CHAR **str);
#undef yywrap
%}
%%
[ \t] {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
}
[\n] {
line_no += 1;
return (Y_NL);
}
[\r] { /* Ignore carrage returns */ }
[;] {
return (Y_NL);
}
[\001] { /* Marker character inserted to allow scanner to
return Y_EOF before returning hard EOF. */
return (Y_EOF);
}
"#".* {
/* Ignore comments */
}
(-[0-9]+)|([0-9]+) {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
yylval.i = atoi (yytext);
return (Y_INT);
}
((0x)|(-0x))[0-9A-Fa-f]+ {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
if (*yytext == '-')
{
sscanf(yytext+3, "%x", &(yylval.i));
yylval.i = -yylval.i;
}
else
{
sscanf(yytext+2, "%x", &(yylval.i));
}
return (Y_INT);
}
(\+|\-)?[0-9]+\.[0-9]*(e)?(\+|\-)?[0-9]* {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
scan_float = atof (yytext);
yylval.p = (double*) &scan_float;
return (Y_FP);
}
[a-zA-Z_\.][a-zA-Z0-9_\.]* {
int token = check_keyword (yytext,
!bare_machine
&& accept_pseudo_insts);
label *l;
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
if (!only_id && token != 0)
{
/* Keyword */
yylval.i = token;
current_line = yytext;
return (token);
}
if (only_id && token != 0)
yyerror ("Cannot use opcodes as labels");
if ((l = label_is_defined (yytext)) != NULL
&& l->const_flag)
{
/* Defined label */
yylval.i = (int) l->addr;
return (Y_INT);
}
else
{
/* Not-yet defined label */
yylval.p = (char*) str_copy (yytext);
return (Y_ID);
}
}
\$[a-zA-Z0-9_\.$]+ {
int reg_no = register_name_to_number (yytext + 1);
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
if (reg_no != -1
&& *(yytext + 1) == 'f'
&& *(yytext + 2) != 'p')
{
/* Floating point register ($f0) */
yylval.i = reg_no;
return (Y_FP_REG);
}
if (0 <= reg_no && reg_no < R_LENGTH)
{
/* Register ($r0) */
yylval.i = reg_no;
return (Y_REG);
}
else
{
/* Otherwise, an integer or identifier */
label *l = label_is_defined (yytext);
if (l != NULL && l->const_flag)
{
yylval.i = (int) l->addr;
return (Y_INT);
}
else
{
yylval.p = (char*) str_copy (yytext);
return (Y_ID);
}
}
}
[:()+-]|">"|"=" {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
return (*yytext);
}
"," {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
/* Skip commas */
}
"?" {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
yylval.p = (char*) str_copy (yytext);
/* For top level */
return (Y_ID);
}
\"(([^""])|(\\\"))*\" {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
yylval.p = (char*) copy_str (yytext + 1, 1);
return (Y_STR);
}
\'(([^''])|(\\[^'']))\' {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
if (*(yytext + 1) == '\\')
{
YY_CHAR *escape = yytext + 1;
yylval.i = (int) scan_escape (&escape);
}
else
{
yylval.i = (int) *(yytext + 1);
return (Y_INT);
}
}
. {
if (current_line == NULL)
{
current_line_no = line_no;
current_line = yytext;
}
yyerror ("Unknown character");
}
%%
void
initialize_scanner (FILE *in_file)
{
yyin = in_file;
#ifdef FLEX_SCANNER
yyrestart(in_file);
#define YY_FLEX_VERSION (YY_FLEX_MAJOR_VERSION * 1000 + YY_FLEX_MINOR_VERSION * 100 + YY_FLEX_SUBMINOR_VERSION)
#if YY_FLEX_VERSION >= 2533
/* flex 2.5.33 flipped the polarity of this flag (sigh) */
yy_init = 0;
#else
yy_init = 1;
#endif
#endif
line_no = 1;
current_line = NULL;
line_returned = 0;
eof_returned = 0;
}
void
scanner_start_line ()
{
current_line = NULL;
line_returned = 0;
}
/* This is a work-around for a bug in flex v 2.5.31 (but not earlier or
later versions such as 2.5.4) that left this symbol undefined. */
#ifndef yytext_ptr
#define yytext_ptr yytext
#endif
/* Use yywrap to insert a marker character, which causes the
scanner to return Y_EOF, before return a hard EOF. This
wouldn't be necessary, except that bison does not allow
the parser to use EOF (= 0) as a non-terminal */
int yywrap()
{
if (eof_returned)
return (1);
else
{
unput ('\001');
eof_returned = 1;
#ifdef FLEX_SCANNER
yy_did_buffer_switch_on_eof = 1;
#endif
return (0);
}
}
/* A backslash has just been read, return the character designated by *STR. */
static YY_CHAR
scan_escape (YY_CHAR **str)
{
YY_CHAR first = **str;
*str += 1;
switch (first)
{
case 'a': return '\a';
case 'b': return '\b';
case 'f': return '\f';
case 'n': return '\n';
case 'r': return '\r';
case 't': return '\t';
case '\\': return '\\';
case '"': return '"';
case '\'': return '\'';
case 'x':
case 'X':
{
YY_CHAR c1 = **str, c2 = *(*str + 1);
int b = 0;
if ('0' <= c1 && c1 <= '9') b = c1 - '0';
else if ('A' <= c1 && c1 <= 'F') b = c1 - 'A' + 10;
else if ('a' <= c1 && c1 <= 'f') b = c1 - 'a' + 10;
else yyerror ("Bad character in \\X construct in string");
b <<= 4;
if ('0' <= c2 && c2 <= '9') b += c2 - '0';
else if ('A' <= c2 && c2 <= 'F') b += c2 - 'A' + 10;
else if ('a' <= c2 && c2 <= 'f') b += c2 - 'a' + 10;
else yyerror ("Bad character in \\X construct in string");
*str += 2;
return (YY_CHAR) b;
}
default:
{
char message[] = "Bad character \\X";
message[strlen (message) - 1] = first;
yyerror (message);
return '\0';
}
}
}
/* Return a freshly-allocated copy of STRING with the last CHOP
characters removed. */
static YY_CHAR *
copy_str (YY_CHAR *str, int chop)
{
int new_len = strlen (str) - chop;
YY_CHAR *new_str = (YY_CHAR *) xmalloc (new_len + 1), *n;
for (n = new_str; *str != '\0' && new_len > 0; new_len -= 1)
if (*str == '\\')
switch (*(str + 1))
{
case 'n':
{
*n ++ = '\n';
str += 2;
new_len -= 1;
continue;
}
case 't':
{
*n ++ = '\t';
str += 2;
new_len -= 1;
continue;
}
case '"':
{
*n ++ = '"';
str += 2;
new_len -= 1;
continue;
}
case '0': /* \nnn */
case '1':
case '2':
case '3':
{
YY_CHAR c2 = *(str + 2), c3 = *(str + 3);
int b = (*(str + 1) - '0') << 3;
if ('0' <= c2 && c2 <= '7')
b = (c2 - '0') << 3;
else
yyerror ("Bad character in \\ooo construct in string");
if ('0' <= c3 && c3 <= '7')
b += c3 - '0';
else
yyerror ("Bad character in \\ooo construct in string");
*n ++ = (YY_CHAR) b;
str += 4;
new_len -= 3;
continue;
}
case 'X':
{
YY_CHAR c2 = *(str + 2), c3 = *(str + 3);
int b = 0;
if ('0' <= c2 && c2 <= '9')
b = c2 - '0';
else if ('A' <= c2 && c2 <= 'F')
b = c2 - 'A' + 10;
else
yyerror ("Bad character in \\X construct in string");
b <<= 4;
if ('0' <= c3 && c3 <= '9')
b += c3 - '0';
else if ('A' <= c3 && c3 <= 'F')
b += c3 - 'A' + 10;
else
yyerror ("Bad character in \\X construct in string");
*n ++ = (YY_CHAR) b;
str += 4;
new_len -= 3;
continue;
}
default:
{
*n ++ = *str ++;
continue;
}
}
else
*n ++ = *str ++;
*n = '\0';
return (new_str);
}
/* On a parse error, write out the current line and print a caret (^)
below the point at which the error occured. Also, reset the input
stream to the begining of the next line. */
void
print_erroneous_line ()
{
int prefix_length = yytext - current_line;
int i, c;
YY_CHAR buffer[1024], *bp = buffer;
if (current_line == NULL) return;
/* Print part of line that has been consumed. */
if (0 <= prefix_length)
{
/* yytext and current_line point to same line */
error (" ");
c = *(current_line + prefix_length);
*(current_line + prefix_length) = '\0';
error ("%s", current_line);
*(current_line + prefix_length) = (char)c;
error ("%s", yytext);
}
else
{
/* yytext and current_line point to different lines */
error (" ");
error ("%s", current_line);
prefix_length = strlen(current_line);
}
/* Flush the rest of the line (not consumed) from lex input. */
if (*yytext != '\n')
{
while ((c = input ()) != '\n' && c != EOF && c != 1)
*bp ++ = (char)c;
*bp = '\0';
error ("%s\n", buffer);
if (c == '\n') unput ('\n');
current_line = NULL;
}
/* Print marker to point at which consumption stopped. */
if (1024 <= prefix_length) return;
error (" ");
for (i = 0; i < prefix_length; i ++) buffer[i] = ' ';
buffer[i] = '\0';
error ("%s^\n", buffer);
}
static name_val_val keyword_tbl [] = {
#undef OP
#define OP(NAME, OPCODE, TYPE, R_OPCODE) {NAME, OPCODE, TYPE},
#include "op.h"
};
static int
check_keyword (YY_CHAR *id, int allow_pseudo_ops)
{
name_val_val *entry =
map_string_to_name_val_val (keyword_tbl,
sizeof(keyword_tbl) / sizeof (name_val_val),
id);
if (entry == NULL)
return (0);
else if (!allow_pseudo_ops && entry->value2 == PSEUDO_OP)
return (0);
else
return (entry->value1);
}
static name_val_val register_tbl [] = {
{"a0", 4, 0},
{"a1", 5, 0},
{"a2", 6, 0},
{"a3", 7, 0},
{"at", 1, 0},
{"fp", 30, 0},
{"gp", 28, 0},
{"k0", 26, 0},
{"k1", 27, 0},
{"kt0", 26, 0},
{"kt1", 27, 0},
{"ra", 31, 0},
{"s0", 16, 0},
{"s1", 17, 0},
{"s2", 18, 0},
{"s3", 19, 0},
{"s4", 20, 0},
{"s5", 21, 0},
{"s6", 22, 0},
{"s7", 23, 0},
{"s8", 30, 0},
{"sp", 29, 0},
{"t0", 8, 0},
{"t1", 9, 0},
{"t2", 10, 0},
{"t3", 11, 0},
{"t4", 12, 0},
{"t5", 13, 0},
{"t6", 14, 0},
{"t7", 15, 0},
{"t8", 24, 0},
{"t9", 25, 0},
{"v0", 2, 0},
{"v1", 3, 0},
{"zero", 0, 0}
};
int
register_name_to_number (char *name)
{
int c1 = *name, c2 = *(name + 1);
if ('0' <= c1 && c1 <= '9'
&& (c2 == '\0' || (('0' <= c2 && c2 <= '9') && *(name + 2) == '\0')))
return (atoi (name));
else if (c1 == 'f' && c2 >= '0' && c2 <= '9')
return atoi (name + 1);
else
{
name_val_val *entry =
map_string_to_name_val_val (register_tbl,
sizeof (register_tbl) / sizeof (name_val_val),
name);
if (entry == NULL)
return (-1);
else
return (entry->value1);
}
}
/* Exactly once, return the current source line, as a printable string
with a line number. Subsequent calls receive NULL instead of the
line. */
char *
source_line ()
{
if (line_returned)
return (NULL);
else if (current_line == NULL) /* Error on line */
return (NULL);
else
{
YY_CHAR *eol1, c1;
YY_CHAR *null1 = NULL;
char *r;
/* Find end of line: */
for (eol1 = current_line; *eol1 != '\0' && *eol1 != '\n'; ) eol1 += 1;
#ifdef FLEX_SCANNER
/* Ran into null byte, inserted by yylex. In necessary, look further
for newline. (This only works for scanners produced by flex. Other
versions of lex need similar code, or source code lines will end
early. */
if (*eol1 == '\0' && yy_hold_char != '\n')
{
null1 = eol1;
*eol1 = yy_hold_char;
for ( ; *eol1 != '\0' && *eol1 != '\n'; )
eol1 += 1;
}
#endif
/* Save end-of-line character and null terminate string so it can
be printed. */
c1 = *eol1;
*eol1 = '\0';
r = (char *) xmalloc (eol1 - current_line + 10);
sprintf (r, "%d: %s", current_line_no, current_line);
/* Restore end-of-line character and, if necessary, yylex's null byte. */
*eol1 = c1;
if (null1 != NULL)
{
*null1 = '\0';
}
line_returned = 1;
return ((char *) r);
}
}
|