root/dev/microcode/aic7xxx/aicasm.c

DEFINITIONS

1. patch_t
2. TAILQ_HEAD
3. usage
4. back_patch
5. output_code
6. dump_scope
7. emit_patch
8. output_listing
9. check_patch
10. stop
11. seq_alloc
12. cs_alloc
13. scope_alloc
14. process_scope

    1 /* $OpenBSD: aicasm.c,v 1.14 2005/10/04 23:46:14 krw Exp $ */
    2 /*
    3  * Aic7xxx SCSI host adapter firmware asssembler
    4  *
    5  * Copyright (c) 1997, 1998, 2000, 2001 Justin T. Gibbs.
    6  * Copyright (c) 2001, 2002 Adaptec Inc.
    7  * All rights reserved.
    8  *
    9  * Redistribution and use in source and binary forms, with or without
   10  * modification, are permitted provided that the following conditions
   11  * are met:
   12  * 1. Redistributions of source code must retain the above copyright
   13  *    notice, this list of conditions, and the following disclaimer,
   14  *    without modification.
   15  * 2. Redistributions in binary form must reproduce at minimum a disclaimer
   16  *    substantially similar to the "NO WARRANTY" disclaimer below
   17  *    ("Disclaimer") and any redistribution must be conditioned upon
   18  *    including a substantially similar Disclaimer requirement for further
   19  *    binary redistribution.
   20  * 3. Neither the names of the above-listed copyright holders nor the names
   21  *    of any contributors may be used to endorse or promote products derived
   22  *    from this software without specific prior written permission.
   23  *
   24  * Alternatively, this software may be distributed under the terms of the
   25  * GNU General Public License ("GPL") version 2 as published by the Free
   26  * Software Foundation.
   27  *
   28  * NO WARRANTY
   29  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   30  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   31  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
   32  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
   33  * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   34  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   35  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   36  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
   37  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
   38  * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
   39  * POSSIBILITY OF SUCH DAMAGES.
   40  *
   41  * $Id: aicasm.c,v 1.14 2005/10/04 23:46:14 krw Exp $
   42  *
   43  * $FreeBSD: src/sys/dev/aic7xxx/aicasm/aicasm.c,v 1.37 2004/03/12 21:45:25 trhodes Exp $
   44  */
   45 #include <sys/cdefs.h>
   46 #include <sys/types.h>
   47 #include <sys/mman.h>
   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>
   58 #if linux
   59 #include <endian.h>
   60 #else
   61 #include <machine/endian.h>
   62 #endif
   64 #include "aicasm.h"
   65 #include "aicasm_symbol.h"
   66 #include "aicasm_insformat.h"
   68 typedef struct patch {
TAILQ_ENTRY(patch) links;
   70         int             patch_func;
u_int           begin;
u_int           skip_instr;
u_int           skip_patch;
   74 } patch_t;
TAILQ_HEAD(patch_list, patch) patches;
   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, int start_instr,
   85                        int *skip_addr, int *func_vals);
   87 struct path_list search_path;
   88 int includes_search_curdir;
   89 char *appname;
   90 char *stock_include_file;
FILE *ofile;
   92 char *ofilename;
   93 char *regfilename;
FILE *regfile;
   95 char *listfilename;
FILE *listfile;
   97 char *regdiagfilename;
FILE *regdiagfile;
   99 int   src_mode;
  100 int   dst_mode;
  102 static TAILQ_HEAD(,instruction) seq_program;
  103 struct cs_tailq cs_tailq;
  104 struct scope_list scope_stack;
symlist_t patch_functions;
  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);
  116 int main(int argc, char *argv[]);
  118 int
main(int argc, char *argv[])
  120 {
  121         extern char *optarg;
  122         extern int optind;
  123         int  ch;
  124         int  retval;
  125         char *inputfilename;
scope_t *sentinal;
TAILQ_INIT(&patches);
SLIST_INIT(&search_path);
TAILQ_INIT(&seq_program);
TAILQ_INIT(&cs_tailq);
SLIST_INIT(&scope_stack);
  134         /* Set Sentinal scope node */
sentinal = scope_alloc();
sentinal->type = SCOPE_ROOT;
includes_search_curdir = 1;
appname = *argv;
regfile = NULL;
listfile = NULL;
  142 #if DEBUG
yy_flex_debug = 0;
mm_flex_debug = 0;
yydebug = 0;
mmdebug = 0;
  147 #endif
  148         while ((ch = getopt(argc, argv, "d:i:l:n:o:p:r:I:X")) != -1) {
  149                 switch(ch) {
  150                 case 'd':
  151 #if DEBUG
  152                         if (strcmp(optarg, "s") == 0) {
yy_flex_debug = 1;
mm_flex_debug = 1;
  155                         } else if (strcmp(optarg, "p") == 0) {
yydebug = 1;
mmdebug = 1;
  158                         } else {
fprintf(stderr, "%s: -d Requires either an "
  160                                         "'s' or 'p' argument\n", appname);
usage();
  162                         }
  163 #else
stop("-d: Assembler not built with debugging "
  165                              "information", EX_SOFTWARE);
  166 #endif
  167                         break;
  168                 case 'i':
stock_include_file = optarg;
  170                         break;
  171                 case 'l':
  172                         /* Create a program listing */
  173                         if ((listfile = fopen(optarg, "w")) == NULL) {
perror(optarg);
stop(NULL, EX_CANTCREAT);
  176                         }
listfilename = optarg;
  178                         break;
  179                 case 'n':
  180                         /* Don't complain about the -nostdinc directrive */
  181                         if (strcmp(optarg, "ostdinc")) {
fprintf(stderr, "%s: Unknown option -%c%s\n",
appname, ch, optarg);
usage();
  185                                 /* NOTREACHED */
  186                         }
  187                         break;
  188                 case 'o':
  189                         if ((ofile = fopen(optarg, "w")) == NULL) {
perror(optarg);
stop(NULL, EX_CANTCREAT);
  192                         }
ofilename = optarg;
  194                         break;
  195                 case 'p':
  196                         /* Create Register Diagnostic "printing" Functions */
  197                         if ((regdiagfile = fopen(optarg, "w")) == NULL) {
perror(optarg);
stop(NULL, EX_CANTCREAT);
  200                         }
regdiagfilename = optarg;
  202                         break;
  203                 case 'r':
  204                         if ((regfile = fopen(optarg, "w")) == NULL) {
perror(optarg);
stop(NULL, EX_CANTCREAT);
  207                         }
regfilename = optarg;
  209                         break;
  210                 case 'I':
  211                 {
path_entry_t include_dir;
  214                         if (strcmp(optarg, "-") == 0) {
  215                                 if (includes_search_curdir == 0) {
fprintf(stderr, "%s: Warning - '-I-' "
  217                                                         "specified multiple "
  218                                                         "times\n", appname);
  219                                 }
includes_search_curdir = 0;
  221                                 for (include_dir = SLIST_FIRST(&search_path);
include_dir != NULL;
include_dir = SLIST_NEXT(include_dir,
links))
  225                                         /*
  226                                          * All entries before a '-I-' only
  227                                          * apply to includes specified with
  228                                          * quotes instead of "<>".
  229                                          */
include_dir->quoted_includes_only = 1;
  231                         } else {
include_dir =
  233                                     (path_entry_t)malloc(sizeof(*include_dir));
  234                                 if (include_dir == NULL) {
perror(optarg);
stop(NULL, EX_OSERR);
  237                                 }
include_dir->directory = strdup(optarg);
  239                                 if (include_dir->directory == NULL) {
perror(optarg);
stop(NULL, EX_OSERR);
  242                                 }
include_dir->quoted_includes_only = 0;
SLIST_INSERT_HEAD(&search_path, include_dir,
links);
  246                         }
  247                         break;
  248                 }
  249                 case 'X':
  250                         /* icc version of -nostdinc */
  251                         break;
  252                 case '?':
  253                 default:
usage();
  255                         /* NOTREACHED */
  256                 }
  257         }
argc -= optind;
argv += optind;
  261         if (argc != 1) {
fprintf(stderr, "%s: No input file specifiled\n", appname);
usage();
  264                 /* NOTREACHED */
  265         }
  267         if (regdiagfile != NULL
  268          && (regfile == NULL || stock_include_file == NULL)) {
fprintf(stderr,
  270                         "%s: The -p option requires the -r and -i options.\n",
appname);
usage();
  273                 /* NOTREACHED */
  274         }
symtable_open();
inputfilename = *argv;
include_file(*argv, SOURCE_FILE);
retval = yyparse();
  279         if (retval == 0) {
  280                 if (SLIST_FIRST(&scope_stack) == NULL
  281                  || SLIST_FIRST(&scope_stack)->type != SCOPE_ROOT) {
stop("Unterminated conditional expression", EX_DATAERR);
  283                         /* NOTREACHED */
  284                 }
  286                 /* Process outmost scope */
process_scope(SLIST_FIRST(&scope_stack));
  288                 /*
  289                  * Decend the tree of scopes and insert/emit
  290                  * patches as appropriate.  We perform a depth first
  291                  * tranversal, recursively handling each scope.
  292                  */
  293                 /* start at the root scope */
dump_scope(SLIST_FIRST(&scope_stack));
  296                 /* Patch up forward jump addresses */
back_patch();
  299                 if (ofile != NULL)
output_code();
  301                 if (regfile != NULL)
symtable_dump(regfile, regdiagfile);
  303                 if (listfile != NULL)
output_listing(inputfilename);
  305         }
stop(NULL, 0);
  308         /* NOTREACHED */
  309         return (0);
  310 }
  312 static void
usage()
  314 {
  316         (void)fprintf(stderr,
  317 "usage: %-16s [-nostdinc|-X] [-I-] [-I directory] [-o output_file]\n"
  318 "       [-r register_output_file [-p register_diag_file -i includefile]]\n"
  319 "       [-l program_list_file]\n"
  320 "       input_file\n", appname);
exit(EX_USAGE);
  322 }
  324 static void
back_patch()
  326 {
  327         struct instruction *cur_instr;
  329         for (cur_instr = TAILQ_FIRST(&seq_program);
cur_instr != NULL;
cur_instr = TAILQ_NEXT(cur_instr, links)) {
  332                 if (cur_instr->patch_label != NULL) {
  333                         struct ins_format3 *f3_instr;
u_int address;
  336                         if (cur_instr->patch_label->type != LABEL) {
  337                                 char buf[255];
snprintf(buf, sizeof(buf),
  340                                          "Undefined label %s",
cur_instr->patch_label->name);
stop(buf, EX_DATAERR);
  343                                 /* NOTREACHED */
  344                         }
f3_instr = &cur_instr->format.format3;
address = f3_instr->address;
address += cur_instr->patch_label->info.linfo->address;
f3_instr->address = address;
  349                 }
  350         }
  351 }
  353 static void
output_code()
  355 {
  356         struct instruction *cur_instr;
patch_t *cur_patch;
critical_section_t *cs;
symbol_node_t *cur_node;
  360         int instrcount;
instrcount = 0;
fprintf(ofile,
  364 "/*\n"
  365 " * DO NOT EDIT - This file is automatically generated\n"
  366 " *              from the following source files:\n"
  367 " *\n"
  368 "%s */\n", versions);
fprintf(ofile, "static const uint8_t seqprog[] = {\n");
  371         for (cur_instr = TAILQ_FIRST(&seq_program);
cur_instr != NULL;
cur_instr = TAILQ_NEXT(cur_instr, links)) {
fprintf(ofile, "%s\t0x%02x, 0x%02x, 0x%02x, 0x%02x",
cur_instr == TAILQ_FIRST(&seq_program) ? "" : ",\n",
  377 #if BYTE_ORDER == LITTLE_ENDIAN
cur_instr->format.bytes[0],
cur_instr->format.bytes[1],
cur_instr->format.bytes[2],
cur_instr->format.bytes[3]);
  382 #else
cur_instr->format.bytes[3],
cur_instr->format.bytes[2],
cur_instr->format.bytes[1],
cur_instr->format.bytes[0]);
  387 #endif
instrcount++;
  389         }
fprintf(ofile, "\n};\n\n");
  392         if (patch_arg_list == NULL)
stop("Patch argument list not defined",
EX_DATAERR);
  396         /*
  397          *  Output patch information.  Patch functions first.
  398          */
fprintf(ofile,
  400 "typedef int %spatch_func_t (%s);\n", prefix, patch_arg_list);
  402         for (cur_node = SLIST_FIRST(&patch_functions);
cur_node != NULL;
cur_node = SLIST_NEXT(cur_node,links)) {
fprintf(ofile,
  406 "static %spatch_func_t %spatch%d_func;\n"
  407 "\n"
  408 "static int\n"
  409 "%spatch%d_func(%s)\n"
  410 "{\n"
  411 "       return (%s);\n"
  412 "}\n\n",
prefix,
prefix,
cur_node->symbol->info.condinfo->func_num,
prefix,
cur_node->symbol->info.condinfo->func_num,
patch_arg_list,
cur_node->symbol->name);
  420         }
fprintf(ofile,
  423 "static const struct patch {\n"
  424 "       %spatch_func_t          *patch_func;\n"
  425 "       uint32_t                 begin          :10,\n"
  426 "                                skip_instr     :10,\n"
  427 "                                skip_patch     :12;\n"
  428 "} patches[] = {\n", prefix);
  430         for (cur_patch = TAILQ_FIRST(&patches);
cur_patch != NULL;
cur_patch = TAILQ_NEXT(cur_patch,links)) {
fprintf(ofile, "%s\t{ %spatch%d_func, %d, %d, %d }",
cur_patch == TAILQ_FIRST(&patches) ? "" : ",\n",
prefix,
cur_patch->patch_func, cur_patch->begin,
cur_patch->skip_instr, cur_patch->skip_patch);
  438         }
fprintf(ofile, "\n};\n\n");
fprintf(ofile,
  443 "static const struct cs {\n"
  444 "       uint16_t        begin;\n"
  445 "       uint16_t        end;\n"
  446 "} critical_sections[] = {\n");
  448         for (cs = TAILQ_FIRST(&cs_tailq);
cs != NULL;
cs = TAILQ_NEXT(cs, links)) {
fprintf(ofile, "%s\t{ %d, %d }",
cs == TAILQ_FIRST(&cs_tailq) ? "" : ",\n",
cs->begin_addr, cs->end_addr);
  454         }
fprintf(ofile, "\n};\n\n");
fprintf(ofile,
  459 "#define NUM_CRITICAL_SECTIONS (sizeof(critical_sections) / sizeof(*critical_sections))\n");
fprintf(stderr, "%s: %d instructions used\n", appname, instrcount);
  462 }
  464 static void
dump_scope(scope_t *scope)
  466 {
scope_t *cur_scope;
  469         /*
  470          * Emit the first patch for this scope
  471          */
emit_patch(scope, 0);
  474         /*
  475          * Dump each scope within this one.
  476          */
cur_scope = TAILQ_FIRST(&scope->inner_scope);
  479         while (cur_scope != NULL) {
dump_scope(cur_scope);
cur_scope = TAILQ_NEXT(cur_scope, scope_links);
  484         }
  486         /*
  487          * Emit the second, closing, patch for this scope
  488          */
emit_patch(scope, 1);
  490 }
  492 void
emit_patch(scope_t *scope, int patch)
  494 {
patch_info_t *pinfo;
patch_t *new_patch;
pinfo = &scope->patches[patch];
  500         if (pinfo->skip_instr == 0)
  501                 /* No-Op patch */
  502                 return;
new_patch = (patch_t *)malloc(sizeof(*new_patch));
  506         if (new_patch == NULL)
stop("Could not malloc patch structure", EX_OSERR);
memset(new_patch, 0, sizeof(*new_patch));
  511         if (patch == 0) {
new_patch->patch_func = scope->func_num;
new_patch->begin = scope->begin_addr;
  514         } else {
new_patch->patch_func = 0;
new_patch->begin = scope->end_addr;
  517         }
new_patch->skip_instr = pinfo->skip_instr;
new_patch->skip_patch = pinfo->skip_patch;
TAILQ_INSERT_TAIL(&patches, new_patch, links);
  521 }
  523 void
output_listing(char *ifilename)
  525 {
  526         char buf[1024];
FILE *ifile;
  528         struct instruction *cur_instr;
patch_t *cur_patch;
symbol_node_t *cur_func;
  531         int *func_values;
  532         int instrcount;
  533         int instrptr;
  534         int line;
  535         int func_count;
  536         int skip_addr;
instrcount = 0;
instrptr = 0;
line = 1;
skip_addr = 0;
  542         if ((ifile = fopen(ifilename, "r")) == NULL) {
perror(ifilename);
stop(NULL, EX_DATAERR);
  545         }
  547         /*
  548          * Determine which options to apply to this listing.
  549          */
  550         for (func_count = 0, cur_func = SLIST_FIRST(&patch_functions);
cur_func != NULL;
cur_func = SLIST_NEXT(cur_func, links))
func_count++;
func_values = NULL;
  556         if (func_count != 0) {
func_values = (int *)malloc(func_count * sizeof(int));
  559                 if (func_values == NULL)
stop("Could not malloc", EX_OSERR);
func_values[0] = 0; /* FALSE func */
func_count--;
  565                 /*
  566                  * Ask the user to fill in the return values for
  567                  * the rest of the functions.
  568                  */
  571                 for (cur_func = SLIST_FIRST(&patch_functions);
cur_func != NULL && SLIST_NEXT(cur_func, links) != NULL;
cur_func = SLIST_NEXT(cur_func, links), func_count--) {
  574                         int input;
fprintf(stdout, "\n(%s)\n", cur_func->symbol->name);
fprintf(stdout,
  578                                 "Enter the return value for "
  579                                 "this expression[T/F]:");
  581                         while (1) {
input = getchar();
input = toupper(input);
  586                                 if (input == 'T') {
func_values[func_count] = 1;
  588                                         break;
  589                                 } else if (input == 'F') {
func_values[func_count] = 0;
  591                                         break;
  592                                 }
  593                         }
  594                         if (isatty(fileno(stdin)) == 0)
putchar(input);
  596                 }
fprintf(stdout, "\nThanks!\n");
  598         }
  600         /* Now output the listing */
cur_patch = TAILQ_FIRST(&patches);
  602         for (cur_instr = TAILQ_FIRST(&seq_program);
cur_instr != NULL;
cur_instr = TAILQ_NEXT(cur_instr, links), instrcount++) {
  606                 if (check_patch(&cur_patch, instrcount,
  607                                 &skip_addr, func_values) == 0) {
  608                         /* Don't count this instruction as it is in a patch
  609                          * that was removed.
  610                          */
  611                         continue;
  612                 }
  614                 while (line < cur_instr->srcline) {
fgets(buf, sizeof(buf), ifile);
fprintf(listfile, "             \t%s", buf);
line++;
  618                 }
fprintf(listfile, "%04x %02x%02x%02x%02x", instrptr,
  620 #if BYTE_ORDER == LITTLE_ENDIAN
cur_instr->format.bytes[0],
cur_instr->format.bytes[1],
cur_instr->format.bytes[2],
cur_instr->format.bytes[3]);
  625 #else
cur_instr->format.bytes[3],
cur_instr->format.bytes[2],
cur_instr->format.bytes[1],
cur_instr->format.bytes[0]);
  630 #endif
  631                 /*
  632                  * Macro expansions can cause several instructions
  633                  * to be output for a single source line.  Only
  634                  * advance the line once in these cases.
  635                  */
  636                 if (line == cur_instr->srcline) {
fgets(buf, sizeof(buf), ifile);
fprintf(listfile, "\t%s", buf);
line++;
  640                 } else {
fprintf(listfile, "\n");
  642                 }
instrptr++;
  644         }
  645         /* Dump the remainder of the file */
  646         while(fgets(buf, sizeof(buf), ifile) != NULL)
fprintf(listfile, "             %s", buf);
fclose(ifile);
  650 }
  652 static int
check_patch(patch_t **start_patch, int start_instr,
  654             int *skip_addr, int *func_vals)
  655 {
patch_t *cur_patch;
cur_patch = *start_patch;
  660         while (cur_patch != NULL && start_instr == cur_patch->begin) {
  661                 if (func_vals[cur_patch->patch_func] == 0) {
  662                         int skip;
  664                         /* Start rejecting code */
  665                         *skip_addr = start_instr + cur_patch->skip_instr;
  666                         for (skip = cur_patch->skip_patch;
skip > 0 && cur_patch != NULL;
skip--)
cur_patch = TAILQ_NEXT(cur_patch, links);
  670                 } else {
  671                         /* Accepted this patch.  Advance to the next
  672                          * one and wait for our intruction pointer to
  673                          * hit this point.
  674                          */
cur_patch = TAILQ_NEXT(cur_patch, links);
  676                 }
  677         }
  679         *start_patch = cur_patch;
  680         if (start_instr < *skip_addr)
  681                 /* Still skipping */
  682                 return (0);
  684         return (1);
  685 }
  687 /*
  688  * Print out error information if appropriate, and clean up before
  689  * terminating the program.
  690  */
  691 void
stop(const char *string, int err_code)
  693 {
  694         if (string != NULL) {
fprintf(stderr, "%s: ", appname);
  696                 if (yyfilename != NULL) {
fprintf(stderr, "Stopped at file %s, line %d - ",
yyfilename, yylineno);
  699                 }
fprintf(stderr, "%s\n", string);
  701         }
  703         if (ofile != NULL) {
fclose(ofile);
  705                 if (err_code != 0) {
fprintf(stderr, "%s: Removing %s due to error\n",
appname, ofilename);
unlink(ofilename);
  709                 }
  710         }
  712         if (regfile != NULL) {
fclose(regfile);
  714                 if (err_code != 0) {
fprintf(stderr, "%s: Removing %s due to error\n",
appname, regfilename);
unlink(regfilename);
  718                 }
  719         }
  721         if (listfile != NULL) {
fclose(listfile);
  723                 if (err_code != 0) {
fprintf(stderr, "%s: Removing %s due to error\n",
appname, listfilename);
unlink(listfilename);
  727                 }
  728         }
symlist_free(&patch_functions);
symtable_close();
exit(err_code);
  734 }
  736 struct instruction *
seq_alloc()
  738 {
  739         struct instruction *new_instr;
new_instr = (struct instruction *)malloc(sizeof(struct instruction));
  742         if (new_instr == NULL)
stop("Unable to malloc instruction object", EX_SOFTWARE);
memset(new_instr, 0, sizeof(*new_instr));
TAILQ_INSERT_TAIL(&seq_program, new_instr, links);
new_instr->srcline = yylineno;
  747         return new_instr;
  748 }
critical_section_t *
cs_alloc()
  752 {
critical_section_t *new_cs;
new_cs= (critical_section_t *)malloc(sizeof(critical_section_t));
  756         if (new_cs == NULL)
stop("Unable to malloc critical_section object", EX_SOFTWARE);
memset(new_cs, 0, sizeof(*new_cs));
TAILQ_INSERT_TAIL(&cs_tailq, new_cs, links);
  761         return new_cs;
  762 }
scope_t *
scope_alloc()
  766 {
scope_t *new_scope;
new_scope = (scope_t *)malloc(sizeof(scope_t));
  770         if (new_scope == NULL)
stop("Unable to malloc scope object", EX_SOFTWARE);
memset(new_scope, 0, sizeof(*new_scope));
TAILQ_INIT(&new_scope->inner_scope);
  775         if (SLIST_FIRST(&scope_stack) != NULL) {
TAILQ_INSERT_TAIL(&SLIST_FIRST(&scope_stack)->inner_scope,
new_scope, scope_links);
  778         }
  779         /* This patch is now the current scope */
SLIST_INSERT_HEAD(&scope_stack, new_scope, scope_stack_links);
  781         return new_scope;
  782 }
  784 void
process_scope(scope_t *scope)
  786 {
  787         /*
  788          * We are "leaving" this scope.  We should now have
  789          * enough information to process the lists of scopes
  790          * we encapsulate.
  791          */
scope_t *cur_scope;
u_int skip_patch_count;
u_int skip_instr_count;
cur_scope = TAILQ_LAST(&scope->inner_scope, scope_tailq);
skip_patch_count = 0;
skip_instr_count = 0;
  799         while (cur_scope != NULL) {
u_int patch0_patch_skip;
patch0_patch_skip = 0;
  803                 switch (cur_scope->type) {
  804                 case SCOPE_IF:
  805                 case SCOPE_ELSE_IF:
  806                         if (skip_instr_count != 0) {
  807                                 /* Create a tail patch */
patch0_patch_skip++;
cur_scope->patches[1].skip_patch =
skip_patch_count + 1;
cur_scope->patches[1].skip_instr =
skip_instr_count;
  813                         }
  815                         /* Count Head patch */
patch0_patch_skip++;
  818                         /* Count any patches contained in our inner scope */
patch0_patch_skip += cur_scope->inner_scope_patches;
cur_scope->patches[0].skip_patch = patch0_patch_skip;
cur_scope->patches[0].skip_instr =
cur_scope->end_addr - cur_scope->begin_addr;
skip_instr_count += cur_scope->patches[0].skip_instr;
skip_patch_count += patch0_patch_skip;
  828                         if (cur_scope->type == SCOPE_IF) {
scope->inner_scope_patches += skip_patch_count;
skip_patch_count = 0;
skip_instr_count = 0;
  832                         }
  833                         break;
  834                 case SCOPE_ELSE:
  835                         /* Count any patches contained in our innter scope */
skip_patch_count += cur_scope->inner_scope_patches;
skip_instr_count += cur_scope->end_addr
  839                                           - cur_scope->begin_addr;
  840                         break;
  841                 case SCOPE_ROOT:
stop("Unexpected scope type encountered", EX_SOFTWARE);
  843                         /* NOTREACHED */
  844                 }
cur_scope = TAILQ_PREV(cur_scope, scope_tailq, scope_links);
  847         }
  848 }