1 /*- 2 * Aic7xxx SCSI host adapter firmware asssembler 3 * 4 * SPDX-License-Identifier: BSD-3-Clause 5 * 6 * Copyright (c) 1997, 1998, 2000, 2001 Justin T. Gibbs. 7 * Copyright (c) 2001, 2002 Adaptec Inc. 8 * All rights reserved. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions, and the following disclaimer, 15 * without modification. 16 * 2. Redistributions in binary form must reproduce at minimum a disclaimer 17 * substantially similar to the "NO WARRANTY" disclaimer below 18 * ("Disclaimer") and any redistribution must be conditioned upon 19 * including a substantially similar Disclaimer requirement for further 20 * binary redistribution. 21 * 3. Neither the names of the above-listed copyright holders nor the names 22 * of any contributors may be used to endorse or promote products derived 23 * from this software without specific prior written permission. 24 * 25 * Alternatively, this software may be distributed under the terms of the 26 * GNU General Public License ("GPL") version 2 as published by the Free 27 * Software Foundation. 28 * 29 * NO WARRANTY 30 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 31 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 32 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR 33 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 34 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 38 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING 39 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 40 * POSSIBILITY OF SUCH DAMAGES. 41 * 42 * $Id: //depot/aic7xxx/aic7xxx/aicasm/aicasm.c#23 $ 43 * 44 * $FreeBSD$ 45 */ 46 #include <sys/types.h> 47 #include <sys/mman.h> 48 49 #include <ctype.h> 50 #include <inttypes.h> 51 #include <regex.h> 52 #include <stdio.h> 53 #include <stdlib.h> 54 #include <string.h> 55 #include <sysexits.h> 56 #include <unistd.h> 57 58 #if defined(__linux__) || defined(__GLIBC__) 59 #include <endian.h> 60 #else 61 #include <machine/endian.h> 62 #endif 63 64 #include "aicasm.h" 65 #include "aicasm_symbol.h" 66 #include "aicasm_insformat.h" 67 68 typedef struct patch { 69 STAILQ_ENTRY(patch) links; 70 int patch_func; 71 u_int begin; 72 u_int skip_instr; 73 u_int skip_patch; 74 } patch_t; 75 76 STAILQ_HEAD(patch_list, patch) patches; 77 78 static void usage(void); 79 static void back_patch(void); 80 static void output_code(void); 81 static void output_listing(char *ifilename); 82 static void dump_scope(scope_t *scope); 83 static void emit_patch(scope_t *scope, int patch); 84 static int check_patch(patch_t **start_patch, unsigned int start_instr, 85 unsigned int *skip_addr, int *func_vals); 86 87 struct path_list search_path; 88 int includes_search_curdir; 89 char *appname; 90 char *stock_include_file; 91 FILE *ofile; 92 char *ofilename; 93 char *regfilename; 94 FILE *regfile; 95 char *listfilename; 96 FILE *listfile; 97 char *regdiagfilename; 98 FILE *regdiagfile; 99 int src_mode; 100 int dst_mode; 101 102 static STAILQ_HEAD(,instruction) seq_program; 103 struct cs_tailq cs_tailq; 104 struct scope_list scope_stack; 105 symlist_t patch_functions; 106 107 #if DEBUG 108 extern int yy_flex_debug; 109 extern int mm_flex_debug; 110 extern int yydebug; 111 extern int mmdebug; 112 #endif 113 extern FILE *yyin; 114 extern int yyparse(void); 115 116 int main(int argc, char *argv[]); 117 118 int 119 main(int argc, char *argv[]) 120 { 121 int ch; 122 int retval; 123 char *inputfilename; 124 scope_t *sentinal; 125 126 STAILQ_INIT(&patches); 127 SLIST_INIT(&search_path); 128 STAILQ_INIT(&seq_program); 129 TAILQ_INIT(&cs_tailq); 130 SLIST_INIT(&scope_stack); 131 132 /* Set Sentinal scope node */ 133 sentinal = scope_alloc(); 134 sentinal->type = SCOPE_ROOT; 135 136 includes_search_curdir = 1; 137 appname = *argv; 138 regfile = NULL; 139 listfile = NULL; 140 #if DEBUG 141 yy_flex_debug = 0; 142 mm_flex_debug = 0; 143 yydebug = 0; 144 mmdebug = 0; 145 #endif 146 while ((ch = getopt(argc, argv, "d:i:l:n:o:p:r:I:X")) != -1) { 147 switch(ch) { 148 case 'd': 149 #if DEBUG 150 if (strcmp(optarg, "s") == 0) { 151 yy_flex_debug = 1; 152 mm_flex_debug = 1; 153 } else if (strcmp(optarg, "p") == 0) { 154 yydebug = 1; 155 mmdebug = 1; 156 } else { 157 fprintf(stderr, "%s: -d Requires either an " 158 "'s' or 'p' argument\n", appname); 159 usage(); 160 } 161 #else 162 stop("-d: Assembler not built with debugging " 163 "information", EX_SOFTWARE); 164 #endif 165 break; 166 case 'i': 167 stock_include_file = optarg; 168 break; 169 case 'l': 170 /* Create a program listing */ 171 if ((listfile = fopen(optarg, "w")) == NULL) { 172 perror(optarg); 173 stop(NULL, EX_CANTCREAT); 174 } 175 listfilename = optarg; 176 break; 177 case 'n': 178 /* Don't complain about the -nostdinc directrive */ 179 if (strcmp(optarg, "ostdinc")) { 180 fprintf(stderr, "%s: Unknown option -%c%s\n", 181 appname, ch, optarg); 182 usage(); 183 /* NOTREACHED */ 184 } 185 break; 186 case 'o': 187 if ((ofile = fopen(optarg, "w")) == NULL) { 188 perror(optarg); 189 stop(NULL, EX_CANTCREAT); 190 } 191 ofilename = optarg; 192 break; 193 case 'p': 194 /* Create Register Diagnostic "printing" Functions */ 195 if ((regdiagfile = fopen(optarg, "w")) == NULL) { 196 perror(optarg); 197 stop(NULL, EX_CANTCREAT); 198 } 199 regdiagfilename = optarg; 200 break; 201 case 'r': 202 if ((regfile = fopen(optarg, "w")) == NULL) { 203 perror(optarg); 204 stop(NULL, EX_CANTCREAT); 205 } 206 regfilename = optarg; 207 break; 208 case 'I': 209 { 210 path_entry_t include_dir; 211 212 if (strcmp(optarg, "-") == 0) { 213 if (includes_search_curdir == 0) { 214 fprintf(stderr, "%s: Warning - '-I-' " 215 "specified multiple " 216 "times\n", appname); 217 } 218 includes_search_curdir = 0; 219 for (include_dir = SLIST_FIRST(&search_path); 220 include_dir != NULL; 221 include_dir = SLIST_NEXT(include_dir, 222 links)) 223 /* 224 * All entries before a '-I-' only 225 * apply to includes specified with 226 * quotes instead of "<>". 227 */ 228 include_dir->quoted_includes_only = 1; 229 } else { 230 include_dir = 231 (path_entry_t)malloc(sizeof(*include_dir)); 232 if (include_dir == NULL) { 233 perror(optarg); 234 stop(NULL, EX_OSERR); 235 } 236 include_dir->directory = strdup(optarg); 237 if (include_dir->directory == NULL) { 238 perror(optarg); 239 stop(NULL, EX_OSERR); 240 } 241 include_dir->quoted_includes_only = 0; 242 SLIST_INSERT_HEAD(&search_path, include_dir, 243 links); 244 } 245 break; 246 } 247 case 'X': 248 /* icc version of -nostdinc */ 249 break; 250 case '?': 251 default: 252 usage(); 253 /* NOTREACHED */ 254 } 255 } 256 argc -= optind; 257 argv += optind; 258 259 if (argc != 1) { 260 fprintf(stderr, "%s: No input file specifiled\n", appname); 261 usage(); 262 /* NOTREACHED */ 263 } 264 265 if (regdiagfile != NULL 266 && (regfile == NULL || stock_include_file == NULL)) { 267 fprintf(stderr, 268 "%s: The -p option requires the -r and -i options.\n", 269 appname); 270 usage(); 271 /* NOTREACHED */ 272 } 273 symtable_open(); 274 inputfilename = *argv; 275 include_file(*argv, SOURCE_FILE); 276 retval = yyparse(); 277 if (retval == 0) { 278 if (SLIST_FIRST(&scope_stack) == NULL 279 || SLIST_FIRST(&scope_stack)->type != SCOPE_ROOT) { 280 stop("Unterminated conditional expression", EX_DATAERR); 281 /* NOTREACHED */ 282 } 283 284 /* Process outmost scope */ 285 process_scope(SLIST_FIRST(&scope_stack)); 286 /* 287 * Decend the tree of scopes and insert/emit 288 * patches as appropriate. We perform a depth first 289 * tranversal, recursively handling each scope. 290 */ 291 /* start at the root scope */ 292 dump_scope(SLIST_FIRST(&scope_stack)); 293 294 /* Patch up forward jump addresses */ 295 back_patch(); 296 297 if (ofile != NULL) 298 output_code(); 299 if (regfile != NULL) 300 symtable_dump(regfile, regdiagfile); 301 if (listfile != NULL) 302 output_listing(inputfilename); 303 } 304 305 stop(NULL, 0); 306 /* NOTREACHED */ 307 return (0); 308 } 309 310 static void 311 usage(void) 312 { 313 314 (void)fprintf(stderr, 315 "usage: %-16s [-nostdinc|-X] [-I-] [-I directory] [-o output_file]\n" 316 " [-r register_output_file [-p register_diag_file -i includefile]]\n" 317 " [-l program_list_file]\n" 318 " input_file\n", appname); 319 exit(EX_USAGE); 320 } 321 322 static void 323 back_patch(void) 324 { 325 struct instruction *cur_instr; 326 327 for (cur_instr = STAILQ_FIRST(&seq_program); 328 cur_instr != NULL; 329 cur_instr = STAILQ_NEXT(cur_instr, links)) { 330 if (cur_instr->patch_label != NULL) { 331 struct ins_format3 *f3_instr; 332 u_int address; 333 334 if (cur_instr->patch_label->type != LABEL) { 335 char buf[255]; 336 337 snprintf(buf, sizeof(buf), 338 "Undefined label %s", 339 cur_instr->patch_label->name); 340 stop(buf, EX_DATAERR); 341 /* NOTREACHED */ 342 } 343 f3_instr = &cur_instr->format.format3; 344 address = f3_instr->address; 345 address += cur_instr->patch_label->info.linfo->address; 346 f3_instr->address = address; 347 } 348 } 349 } 350 351 static void 352 output_code(void) 353 { 354 struct instruction *cur_instr; 355 patch_t *cur_patch; 356 critical_section_t *cs; 357 symbol_node_t *cur_node; 358 int instrcount; 359 360 instrcount = 0; 361 fprintf(ofile, 362 "/*\n" 363 " * DO NOT EDIT - This file is automatically generated\n" 364 " * from the following source files:\n" 365 " *\n" 366 "%s */\n", versions); 367 368 fprintf(ofile, "static uint8_t seqprog[] = {\n"); 369 for (cur_instr = STAILQ_FIRST(&seq_program); 370 cur_instr != NULL; 371 cur_instr = STAILQ_NEXT(cur_instr, links)) { 372 373 fprintf(ofile, "%s\t0x%02x, 0x%02x, 0x%02x, 0x%02x", 374 cur_instr == STAILQ_FIRST(&seq_program) ? "" : ",\n", 375 #if BYTE_ORDER == LITTLE_ENDIAN 376 cur_instr->format.bytes[0], 377 cur_instr->format.bytes[1], 378 cur_instr->format.bytes[2], 379 cur_instr->format.bytes[3]); 380 #else 381 cur_instr->format.bytes[3], 382 cur_instr->format.bytes[2], 383 cur_instr->format.bytes[1], 384 cur_instr->format.bytes[0]); 385 #endif 386 instrcount++; 387 } 388 fprintf(ofile, "\n};\n\n"); 389 390 if (patch_arg_list == NULL) 391 stop("Patch argument list not defined", 392 EX_DATAERR); 393 394 /* 395 * Output patch information. Patch functions first. 396 */ 397 fprintf(ofile, 398 "typedef int %spatch_func_t (%s);\n", prefix, patch_arg_list); 399 400 for (cur_node = SLIST_FIRST(&patch_functions); 401 cur_node != NULL; 402 cur_node = SLIST_NEXT(cur_node,links)) { 403 fprintf(ofile, 404 "static %spatch_func_t %spatch%d_func;\n" 405 "\n" 406 "static int\n" 407 "%spatch%d_func(%s)\n" 408 "{\n" 409 " return (%s);\n" 410 "}\n\n", 411 prefix, 412 prefix, 413 cur_node->symbol->info.condinfo->func_num, 414 prefix, 415 cur_node->symbol->info.condinfo->func_num, 416 patch_arg_list, 417 cur_node->symbol->name); 418 } 419 420 fprintf(ofile, 421 "static struct patch {\n" 422 " %spatch_func_t *patch_func;\n" 423 " uint32_t begin :10,\n" 424 " skip_instr :10,\n" 425 " skip_patch :12;\n" 426 "} patches[] = {\n", prefix); 427 428 for (cur_patch = STAILQ_FIRST(&patches); 429 cur_patch != NULL; 430 cur_patch = STAILQ_NEXT(cur_patch,links)) { 431 fprintf(ofile, "%s\t{ %spatch%d_func, %d, %d, %d }", 432 cur_patch == STAILQ_FIRST(&patches) ? "" : ",\n", 433 prefix, 434 cur_patch->patch_func, cur_patch->begin, 435 cur_patch->skip_instr, cur_patch->skip_patch); 436 } 437 438 fprintf(ofile, "\n};\n\n"); 439 440 fprintf(ofile, 441 "static struct cs {\n" 442 " uint16_t begin;\n" 443 " uint16_t end;\n" 444 "} critical_sections[] = {\n"); 445 446 for (cs = TAILQ_FIRST(&cs_tailq); 447 cs != NULL; 448 cs = TAILQ_NEXT(cs, links)) { 449 fprintf(ofile, "%s\t{ %d, %d }", 450 cs == TAILQ_FIRST(&cs_tailq) ? "" : ",\n", 451 cs->begin_addr, cs->end_addr); 452 } 453 454 fprintf(ofile, "\n};\n\n"); 455 456 fprintf(ofile, 457 "static const int num_critical_sections = sizeof(critical_sections)\n" 458 " / sizeof(*critical_sections);\n"); 459 460 fprintf(stderr, "%s: %d instructions used\n", appname, instrcount); 461 } 462 463 static void 464 dump_scope(scope_t *scope) 465 { 466 scope_t *cur_scope; 467 468 /* 469 * Emit the first patch for this scope 470 */ 471 emit_patch(scope, 0); 472 473 /* 474 * Dump each scope within this one. 475 */ 476 cur_scope = TAILQ_FIRST(&scope->inner_scope); 477 478 while (cur_scope != NULL) { 479 480 dump_scope(cur_scope); 481 482 cur_scope = TAILQ_NEXT(cur_scope, scope_links); 483 } 484 485 /* 486 * Emit the second, closing, patch for this scope 487 */ 488 emit_patch(scope, 1); 489 } 490 491 void 492 emit_patch(scope_t *scope, int patch) 493 { 494 patch_info_t *pinfo; 495 patch_t *new_patch; 496 497 pinfo = &scope->patches[patch]; 498 499 if (pinfo->skip_instr == 0) 500 /* No-Op patch */ 501 return; 502 503 new_patch = (patch_t *)malloc(sizeof(*new_patch)); 504 505 if (new_patch == NULL) 506 stop("Could not malloc patch structure", EX_OSERR); 507 508 memset(new_patch, 0, sizeof(*new_patch)); 509 510 if (patch == 0) { 511 new_patch->patch_func = scope->func_num; 512 new_patch->begin = scope->begin_addr; 513 } else { 514 new_patch->patch_func = 0; 515 new_patch->begin = scope->end_addr; 516 } 517 new_patch->skip_instr = pinfo->skip_instr; 518 new_patch->skip_patch = pinfo->skip_patch; 519 STAILQ_INSERT_TAIL(&patches, new_patch, links); 520 } 521 522 void 523 output_listing(char *ifilename) 524 { 525 char buf[1024]; 526 FILE *ifile; 527 struct instruction *cur_instr; 528 patch_t *cur_patch; 529 symbol_node_t *cur_func; 530 int *func_values; 531 int instrcount; 532 int instrptr; 533 unsigned int line; 534 int func_count; 535 unsigned int skip_addr; 536 537 instrcount = 0; 538 instrptr = 0; 539 line = 1; 540 skip_addr = 0; 541 if ((ifile = fopen(ifilename, "r")) == NULL) { 542 perror(ifilename); 543 stop(NULL, EX_DATAERR); 544 } 545 546 /* 547 * Determine which options to apply to this listing. 548 */ 549 for (func_count = 0, cur_func = SLIST_FIRST(&patch_functions); 550 cur_func != NULL; 551 cur_func = SLIST_NEXT(cur_func, links)) 552 func_count++; 553 554 func_values = NULL; 555 if (func_count != 0) { 556 func_values = (int *)malloc(func_count * sizeof(int)); 557 558 if (func_values == NULL) 559 stop("Could not malloc", EX_OSERR); 560 561 func_values[0] = 0; /* FALSE func */ 562 func_count--; 563 564 /* 565 * Ask the user to fill in the return values for 566 * the rest of the functions. 567 */ 568 569 570 for (cur_func = SLIST_FIRST(&patch_functions); 571 cur_func != NULL && SLIST_NEXT(cur_func, links) != NULL; 572 cur_func = SLIST_NEXT(cur_func, links), func_count--) { 573 int input; 574 575 fprintf(stdout, "\n(%s)\n", cur_func->symbol->name); 576 fprintf(stdout, 577 "Enter the return value for " 578 "this expression[T/F]:"); 579 580 while (1) { 581 582 input = getchar(); 583 input = toupper(input); 584 585 if (input == 'T') { 586 func_values[func_count] = 1; 587 break; 588 } else if (input == 'F') { 589 func_values[func_count] = 0; 590 break; 591 } 592 } 593 if (isatty(fileno(stdin)) == 0) 594 putchar(input); 595 } 596 fprintf(stdout, "\nThanks!\n"); 597 } 598 599 /* Now output the listing */ 600 cur_patch = STAILQ_FIRST(&patches); 601 for (cur_instr = STAILQ_FIRST(&seq_program); 602 cur_instr != NULL; 603 cur_instr = STAILQ_NEXT(cur_instr, links), instrcount++) { 604 605 if (check_patch(&cur_patch, instrcount, 606 &skip_addr, func_values) == 0) { 607 /* Don't count this instruction as it is in a patch 608 * that was removed. 609 */ 610 continue; 611 } 612 613 while (line < cur_instr->srcline) { 614 fgets(buf, sizeof(buf), ifile); 615 fprintf(listfile, " \t%s", buf); 616 line++; 617 } 618 fprintf(listfile, "%04x %02x%02x%02x%02x", instrptr, 619 #if BYTE_ORDER == LITTLE_ENDIAN 620 cur_instr->format.bytes[0], 621 cur_instr->format.bytes[1], 622 cur_instr->format.bytes[2], 623 cur_instr->format.bytes[3]); 624 #else 625 cur_instr->format.bytes[3], 626 cur_instr->format.bytes[2], 627 cur_instr->format.bytes[1], 628 cur_instr->format.bytes[0]); 629 #endif 630 /* 631 * Macro expansions can cause several instructions 632 * to be output for a single source line. Only 633 * advance the line once in these cases. 634 */ 635 if (line == cur_instr->srcline) { 636 fgets(buf, sizeof(buf), ifile); 637 fprintf(listfile, "\t%s", buf); 638 line++; 639 } else { 640 fprintf(listfile, "\n"); 641 } 642 instrptr++; 643 } 644 free(func_values); 645 646 /* Dump the remainder of the file */ 647 while(fgets(buf, sizeof(buf), ifile) != NULL) 648 fprintf(listfile, " %s", buf); 649 650 fclose(ifile); 651 } 652 653 static int 654 check_patch(patch_t **start_patch, unsigned int start_instr, 655 unsigned int *skip_addr, int *func_vals) 656 { 657 patch_t *cur_patch; 658 659 cur_patch = *start_patch; 660 661 while (cur_patch != NULL && start_instr == cur_patch->begin) { 662 if (func_vals[cur_patch->patch_func] == 0) { 663 int skip; 664 665 /* Start rejecting code */ 666 *skip_addr = start_instr + cur_patch->skip_instr; 667 for (skip = cur_patch->skip_patch; 668 skip > 0 && cur_patch != NULL; 669 skip--) 670 cur_patch = STAILQ_NEXT(cur_patch, links); 671 } else { 672 /* Accepted this patch. Advance to the next 673 * one and wait for our instruction pointer to 674 * hit this point. 675 */ 676 cur_patch = STAILQ_NEXT(cur_patch, links); 677 } 678 } 679 680 *start_patch = cur_patch; 681 if (start_instr < *skip_addr) 682 /* Still skipping */ 683 return (0); 684 685 return (1); 686 } 687 688 /* 689 * Print out error information if appropriate, and clean up before 690 * terminating the program. 691 */ 692 void 693 stop(const char *string, int err_code) 694 { 695 if (string != NULL) { 696 fprintf(stderr, "%s: ", appname); 697 if (yyfilename != NULL) { 698 fprintf(stderr, "Stopped at file %s, line %d - ", 699 yyfilename, yylineno); 700 } 701 fprintf(stderr, "%s\n", string); 702 } 703 704 if (ofile != NULL) { 705 fclose(ofile); 706 if (err_code != 0) { 707 fprintf(stderr, "%s: Removing %s due to error\n", 708 appname, ofilename); 709 unlink(ofilename); 710 } 711 } 712 713 if (regfile != NULL) { 714 fclose(regfile); 715 if (err_code != 0) { 716 fprintf(stderr, "%s: Removing %s due to error\n", 717 appname, regfilename); 718 unlink(regfilename); 719 } 720 } 721 722 if (listfile != NULL) { 723 fclose(listfile); 724 if (err_code != 0) { 725 fprintf(stderr, "%s: Removing %s due to error\n", 726 appname, listfilename); 727 unlink(listfilename); 728 } 729 } 730 731 symlist_free(&patch_functions); 732 symtable_close(); 733 734 exit(err_code); 735 } 736 737 struct instruction * 738 seq_alloc(void) 739 { 740 struct instruction *new_instr; 741 742 new_instr = (struct instruction *)malloc(sizeof(struct instruction)); 743 if (new_instr == NULL) 744 stop("Unable to malloc instruction object", EX_SOFTWARE); 745 memset(new_instr, 0, sizeof(*new_instr)); 746 STAILQ_INSERT_TAIL(&seq_program, new_instr, links); 747 new_instr->srcline = yylineno; 748 return new_instr; 749 } 750 751 critical_section_t * 752 cs_alloc(void) 753 { 754 critical_section_t *new_cs; 755 756 new_cs= (critical_section_t *)malloc(sizeof(critical_section_t)); 757 if (new_cs == NULL) 758 stop("Unable to malloc critical_section object", EX_SOFTWARE); 759 memset(new_cs, 0, sizeof(*new_cs)); 760 761 TAILQ_INSERT_TAIL(&cs_tailq, new_cs, links); 762 return new_cs; 763 } 764 765 scope_t * 766 scope_alloc(void) 767 { 768 scope_t *new_scope; 769 770 new_scope = (scope_t *)malloc(sizeof(scope_t)); 771 if (new_scope == NULL) 772 stop("Unable to malloc scope object", EX_SOFTWARE); 773 memset(new_scope, 0, sizeof(*new_scope)); 774 TAILQ_INIT(&new_scope->inner_scope); 775 776 if (SLIST_FIRST(&scope_stack) != NULL) { 777 TAILQ_INSERT_TAIL(&SLIST_FIRST(&scope_stack)->inner_scope, 778 new_scope, scope_links); 779 } 780 /* This patch is now the current scope */ 781 SLIST_INSERT_HEAD(&scope_stack, new_scope, scope_stack_links); 782 return new_scope; 783 } 784 785 void 786 process_scope(scope_t *scope) 787 { 788 /* 789 * We are "leaving" this scope. We should now have 790 * enough information to process the lists of scopes 791 * we encapsulate. 792 */ 793 scope_t *cur_scope; 794 u_int skip_patch_count; 795 u_int skip_instr_count; 796 797 cur_scope = TAILQ_LAST(&scope->inner_scope, scope_tailq); 798 skip_patch_count = 0; 799 skip_instr_count = 0; 800 while (cur_scope != NULL) { 801 u_int patch0_patch_skip; 802 803 patch0_patch_skip = 0; 804 switch (cur_scope->type) { 805 case SCOPE_IF: 806 case SCOPE_ELSE_IF: 807 if (skip_instr_count != 0) { 808 /* Create a tail patch */ 809 patch0_patch_skip++; 810 cur_scope->patches[1].skip_patch = 811 skip_patch_count + 1; 812 cur_scope->patches[1].skip_instr = 813 skip_instr_count; 814 } 815 816 /* Count Head patch */ 817 patch0_patch_skip++; 818 819 /* Count any patches contained in our inner scope */ 820 patch0_patch_skip += cur_scope->inner_scope_patches; 821 822 cur_scope->patches[0].skip_patch = patch0_patch_skip; 823 cur_scope->patches[0].skip_instr = 824 cur_scope->end_addr - cur_scope->begin_addr; 825 826 skip_instr_count += cur_scope->patches[0].skip_instr; 827 828 skip_patch_count += patch0_patch_skip; 829 if (cur_scope->type == SCOPE_IF) { 830 scope->inner_scope_patches += skip_patch_count; 831 skip_patch_count = 0; 832 skip_instr_count = 0; 833 } 834 break; 835 case SCOPE_ELSE: 836 /* Count any patches contained in our innter scope */ 837 skip_patch_count += cur_scope->inner_scope_patches; 838 839 skip_instr_count += cur_scope->end_addr 840 - cur_scope->begin_addr; 841 break; 842 case SCOPE_ROOT: 843 stop("Unexpected scope type encountered", EX_SOFTWARE); 844 /* NOTREACHED */ 845 } 846 847 cur_scope = TAILQ_PREV(cur_scope, scope_tailq, scope_links); 848 } 849 } 850