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