1/*-
2 * Aic7xxx SCSI host adapter firmware asssembler
3 *
4 * Copyright (c) 1997, 1998, 2000, 2001 Justin T. Gibbs.
5 * Copyright (c) 2001, 2002 Adaptec Inc.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 *    notice, this list of conditions, and the following disclaimer,
13 *    without modification.
14 * 2. Redistributions in binary form must reproduce at minimum a disclaimer
15 *    substantially similar to the "NO WARRANTY" disclaimer below
16 *    ("Disclaimer") and any redistribution must be conditioned upon
17 *    including a substantially similar Disclaimer requirement for further
18 *    binary redistribution.
19 * 3. Neither the names of the above-listed copyright holders nor the names
20 *    of any contributors may be used to endorse or promote products derived
21 *    from this software without specific prior written permission.
22 *
23 * Alternatively, this software may be distributed under the terms of the
24 * GNU General Public License ("GPL") version 2 as published by the Free
25 * Software Foundation.
26 *
27 * NO WARRANTY
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR
31 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32 * HOLDERS OR CONTRIBUTORS BE LIABLE FOR SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
36 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
37 * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
38 * POSSIBILITY OF SUCH DAMAGES.
39 *
40 * $Id: //depot/aic7xxx/aic7xxx/aicasm/aicasm.c#23 $
41 *
42 * $FreeBSD$
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
66typedef 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
74STAILQ_HEAD(patch_list, patch) patches;
75
76static void usage(void);
77static void back_patch(void);
78static void output_code(void);
79static void output_listing(char *ifilename);
80static void dump_scope(scope_t *scope);
81static void emit_patch(scope_t *scope, int patch);
82static int check_patch(patch_t **start_patch, unsigned int start_instr,
83		       unsigned int *skip_addr, int *func_vals);
84
85struct path_list search_path;
86int includes_search_curdir;
87char *appname;
88char *stock_include_file;
89FILE *ofile;
90char *ofilename;
91char *regfilename;
92FILE *regfile;
93char *listfilename;
94FILE *listfile;
95char *regdiagfilename;
96FILE *regdiagfile;
97int   src_mode;
98int   dst_mode;
99
100static STAILQ_HEAD(,instruction) seq_program;
101struct cs_tailq cs_tailq;
102struct scope_list scope_stack;
103symlist_t patch_functions;
104
105#if DEBUG
106extern int yy_flex_debug;
107extern int mm_flex_debug;
108extern int yydebug;
109extern int mmdebug;
110#endif
111extern FILE *yyin;
112extern int yyparse(void);
113
114int main(int argc, char *argv[]);
115
116int
117main(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 directrive */
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 specifiled\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		 * Decend the tree of scopes and insert/emit
286		 * patches as appropriate.  We perform a depth first
287		 * tranversal, 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
308static void
309usage(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
320static void
321back_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
349static void
350output_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
371		fprintf(ofile, "%s\t0x%02x, 0x%02x, 0x%02x, 0x%02x",
372			cur_instr == STAILQ_FIRST(&seq_program) ? "" : ",\n",
373#if BYTE_ORDER == LITTLE_ENDIAN
374			cur_instr->format.bytes[0],
375			cur_instr->format.bytes[1],
376			cur_instr->format.bytes[2],
377			cur_instr->format.bytes[3]);
378#else
379			cur_instr->format.bytes[3],
380			cur_instr->format.bytes[2],
381			cur_instr->format.bytes[1],
382			cur_instr->format.bytes[0]);
383#endif
384		instrcount++;
385	}
386	fprintf(ofile, "\n};\n\n");
387
388	if (patch_arg_list == NULL)
389		stop("Patch argument list not defined",
390		     EX_DATAERR);
391
392	/*
393	 *  Output patch information.  Patch functions first.
394	 */
395	fprintf(ofile,
396"typedef int %spatch_func_t (%s);\n", prefix, patch_arg_list);
397
398	for (cur_node = SLIST_FIRST(&patch_functions);
399	     cur_node != NULL;
400	     cur_node = SLIST_NEXT(cur_node,links)) {
401		fprintf(ofile,
402"static %spatch_func_t %spatch%d_func;\n"
403"\n"
404"static int\n"
405"%spatch%d_func(%s)\n"
406"{\n"
407"	return (%s);\n"
408"}\n\n",
409			prefix,
410			prefix,
411			cur_node->symbol->info.condinfo->func_num,
412			prefix,
413			cur_node->symbol->info.condinfo->func_num,
414			patch_arg_list,
415			cur_node->symbol->name);
416	}
417
418	fprintf(ofile,
419"static struct patch {\n"
420"	%spatch_func_t		*patch_func;\n"
421"	uint32_t		 begin		:10,\n"
422"				 skip_instr	:10,\n"
423"				 skip_patch	:12;\n"
424"} patches[] = {\n", prefix);
425
426	for (cur_patch = STAILQ_FIRST(&patches);
427	     cur_patch != NULL;
428	     cur_patch = STAILQ_NEXT(cur_patch,links)) {
429		fprintf(ofile, "%s\t{ %spatch%d_func, %d, %d, %d }",
430			cur_patch == STAILQ_FIRST(&patches) ? "" : ",\n",
431			prefix,
432			cur_patch->patch_func, cur_patch->begin,
433			cur_patch->skip_instr, cur_patch->skip_patch);
434	}
435
436	fprintf(ofile, "\n};\n\n");
437
438	fprintf(ofile,
439"static struct cs {\n"
440"	uint16_t	begin;\n"
441"	uint16_t	end;\n"
442"} critical_sections[] = {\n");
443
444	for (cs = TAILQ_FIRST(&cs_tailq);
445	     cs != NULL;
446	     cs = TAILQ_NEXT(cs, links)) {
447		fprintf(ofile, "%s\t{ %d, %d }",
448			cs == TAILQ_FIRST(&cs_tailq) ? "" : ",\n",
449			cs->begin_addr, cs->end_addr);
450	}
451
452	fprintf(ofile, "\n};\n\n");
453
454	fprintf(ofile,
455"static const int num_critical_sections = sizeof(critical_sections)\n"
456"				       / sizeof(*critical_sections);\n");
457
458	fprintf(stderr, "%s: %d instructions used\n", appname, instrcount);
459}
460
461static void
462dump_scope(scope_t *scope)
463{
464	scope_t *cur_scope;
465
466	/*
467	 * Emit the first patch for this scope
468	 */
469	emit_patch(scope, 0);
470
471	/*
472	 * Dump each scope within this one.
473	 */
474	cur_scope = TAILQ_FIRST(&scope->inner_scope);
475
476	while (cur_scope != NULL) {
477
478		dump_scope(cur_scope);
479
480		cur_scope = TAILQ_NEXT(cur_scope, scope_links);
481	}
482
483	/*
484	 * Emit the second, closing, patch for this scope
485	 */
486	emit_patch(scope, 1);
487}
488
489void
490emit_patch(scope_t *scope, int patch)
491{
492	patch_info_t *pinfo;
493	patch_t *new_patch;
494
495	pinfo = &scope->patches[patch];
496
497	if (pinfo->skip_instr == 0)
498		/* No-Op patch */
499		return;
500
501	new_patch = (patch_t *)malloc(sizeof(*new_patch));
502
503	if (new_patch == NULL)
504		stop("Could not malloc patch structure", EX_OSERR);
505
506	memset(new_patch, 0, sizeof(*new_patch));
507
508	if (patch == 0) {
509		new_patch->patch_func = scope->func_num;
510		new_patch->begin = scope->begin_addr;
511	} else {
512		new_patch->patch_func = 0;
513		new_patch->begin = scope->end_addr;
514	}
515	new_patch->skip_instr = pinfo->skip_instr;
516	new_patch->skip_patch = pinfo->skip_patch;
517	STAILQ_INSERT_TAIL(&patches, new_patch, links);
518}
519
520void
521output_listing(char *ifilename)
522{
523	char buf[1024];
524	FILE *ifile;
525	struct instruction *cur_instr;
526	patch_t *cur_patch;
527	symbol_node_t *cur_func;
528	int *func_values;
529	int instrcount;
530	int instrptr;
531	unsigned int line;
532	int func_count;
533	unsigned int skip_addr;
534
535	instrcount = 0;
536	instrptr = 0;
537	line = 1;
538	skip_addr = 0;
539	if ((ifile = fopen(ifilename, "r")) == NULL) {
540		perror(ifilename);
541		stop(NULL, EX_DATAERR);
542	}
543
544	/*
545	 * Determine which options to apply to this listing.
546	 */
547	for (func_count = 0, cur_func = SLIST_FIRST(&patch_functions);
548	    cur_func != NULL;
549	    cur_func = SLIST_NEXT(cur_func, links))
550		func_count++;
551
552	func_values = NULL;
553	if (func_count != 0) {
554		func_values = (int *)malloc(func_count * sizeof(int));
555
556		if (func_values == NULL)
557			stop("Could not malloc", EX_OSERR);
558
559		func_values[0] = 0; /* FALSE func */
560		func_count--;
561
562		/*
563		 * Ask the user to fill in the return values for
564		 * the rest of the functions.
565		 */
566
567
568		for (cur_func = SLIST_FIRST(&patch_functions);
569		     cur_func != NULL && SLIST_NEXT(cur_func, links) != NULL;
570		     cur_func = SLIST_NEXT(cur_func, links), func_count--) {
571			int input;
572
573			fprintf(stdout, "\n(%s)\n", cur_func->symbol->name);
574			fprintf(stdout,
575				"Enter the return value for "
576				"this expression[T/F]:");
577
578			while (1) {
579
580				input = getchar();
581				input = toupper(input);
582
583				if (input == 'T') {
584					func_values[func_count] = 1;
585					break;
586				} else if (input == 'F') {
587					func_values[func_count] = 0;
588					break;
589				}
590			}
591			if (isatty(fileno(stdin)) == 0)
592				putchar(input);
593		}
594		fprintf(stdout, "\nThanks!\n");
595	}
596
597	/* Now output the listing */
598	cur_patch = STAILQ_FIRST(&patches);
599	for (cur_instr = STAILQ_FIRST(&seq_program);
600	     cur_instr != NULL;
601	     cur_instr = STAILQ_NEXT(cur_instr, links), instrcount++) {
602
603		if (check_patch(&cur_patch, instrcount,
604				&skip_addr, func_values) == 0) {
605			/* Don't count this instruction as it is in a patch
606			 * that was removed.
607			 */
608                        continue;
609		}
610
611		while (line < cur_instr->srcline) {
612			fgets(buf, sizeof(buf), ifile);
613				fprintf(listfile, "             \t%s", buf);
614				line++;
615		}
616		fprintf(listfile, "%04x %02x%02x%02x%02x", instrptr,
617#if BYTE_ORDER == LITTLE_ENDIAN
618			cur_instr->format.bytes[0],
619			cur_instr->format.bytes[1],
620			cur_instr->format.bytes[2],
621			cur_instr->format.bytes[3]);
622#else
623			cur_instr->format.bytes[3],
624			cur_instr->format.bytes[2],
625			cur_instr->format.bytes[1],
626			cur_instr->format.bytes[0]);
627#endif
628		/*
629		 * Macro expansions can cause several instructions
630		 * to be output for a single source line.  Only
631		 * advance the line once in these cases.
632		 */
633		if (line == cur_instr->srcline) {
634			fgets(buf, sizeof(buf), ifile);
635			fprintf(listfile, "\t%s", buf);
636			line++;
637		} else {
638			fprintf(listfile, "\n");
639		}
640		instrptr++;
641	}
642	free(func_values);
643
644	/* Dump the remainder of the file */
645	while(fgets(buf, sizeof(buf), ifile) != NULL)
646		fprintf(listfile, "             %s", buf);
647
648	fclose(ifile);
649}
650
651static int
652check_patch(patch_t **start_patch, unsigned int start_instr,
653	    unsigned int *skip_addr, int *func_vals)
654{
655	patch_t *cur_patch;
656
657	cur_patch = *start_patch;
658
659	while (cur_patch != NULL && start_instr == cur_patch->begin) {
660		if (func_vals[cur_patch->patch_func] == 0) {
661			int skip;
662
663			/* Start rejecting code */
664			*skip_addr = start_instr + cur_patch->skip_instr;
665			for (skip = cur_patch->skip_patch;
666			     skip > 0 && cur_patch != NULL;
667			     skip--)
668				cur_patch = STAILQ_NEXT(cur_patch, links);
669		} else {
670			/* Accepted this patch.  Advance to the next
671			 * one and wait for our intruction pointer to
672			 * hit this point.
673			 */
674			cur_patch = STAILQ_NEXT(cur_patch, links);
675		}
676	}
677
678	*start_patch = cur_patch;
679	if (start_instr < *skip_addr)
680		/* Still skipping */
681		return (0);
682
683	return (1);
684}
685
686/*
687 * Print out error information if appropriate, and clean up before
688 * terminating the program.
689 */
690void
691stop(const char *string, int err_code)
692{
693	if (string != NULL) {
694		fprintf(stderr, "%s: ", appname);
695		if (yyfilename != NULL) {
696			fprintf(stderr, "Stopped at file %s, line %d - ",
697				yyfilename, yylineno);
698		}
699		fprintf(stderr, "%s\n", string);
700	}
701
702	if (ofile != NULL) {
703		fclose(ofile);
704		if (err_code != 0) {
705			fprintf(stderr, "%s: Removing %s due to error\n",
706				appname, ofilename);
707			unlink(ofilename);
708		}
709	}
710
711	if (regfile != NULL) {
712		fclose(regfile);
713		if (err_code != 0) {
714			fprintf(stderr, "%s: Removing %s due to error\n",
715				appname, regfilename);
716			unlink(regfilename);
717		}
718	}
719
720	if (listfile != NULL) {
721		fclose(listfile);
722		if (err_code != 0) {
723			fprintf(stderr, "%s: Removing %s due to error\n",
724				appname, listfilename);
725			unlink(listfilename);
726		}
727	}
728
729	symlist_free(&patch_functions);
730	symtable_close();
731
732	exit(err_code);
733}
734
735struct instruction *
736seq_alloc(void)
737{
738	struct instruction *new_instr;
739
740	new_instr = (struct instruction *)malloc(sizeof(struct instruction));
741	if (new_instr == NULL)
742		stop("Unable to malloc instruction object", EX_SOFTWARE);
743	memset(new_instr, 0, sizeof(*new_instr));
744	STAILQ_INSERT_TAIL(&seq_program, new_instr, links);
745	new_instr->srcline = yylineno;
746	return new_instr;
747}
748
749critical_section_t *
750cs_alloc(void)
751{
752	critical_section_t *new_cs;
753
754	new_cs= (critical_section_t *)malloc(sizeof(critical_section_t));
755	if (new_cs == NULL)
756		stop("Unable to malloc critical_section object", EX_SOFTWARE);
757	memset(new_cs, 0, sizeof(*new_cs));
758
759	TAILQ_INSERT_TAIL(&cs_tailq, new_cs, links);
760	return new_cs;
761}
762
763scope_t *
764scope_alloc(void)
765{
766	scope_t *new_scope;
767
768	new_scope = (scope_t *)malloc(sizeof(scope_t));
769	if (new_scope == NULL)
770		stop("Unable to malloc scope object", EX_SOFTWARE);
771	memset(new_scope, 0, sizeof(*new_scope));
772	TAILQ_INIT(&new_scope->inner_scope);
773
774	if (SLIST_FIRST(&scope_stack) != NULL) {
775		TAILQ_INSERT_TAIL(&SLIST_FIRST(&scope_stack)->inner_scope,
776				  new_scope, scope_links);
777	}
778	/* This patch is now the current scope */
779	SLIST_INSERT_HEAD(&scope_stack, new_scope, scope_stack_links);
780	return new_scope;
781}
782
783void
784process_scope(scope_t *scope)
785{
786	/*
787	 * We are "leaving" this scope.  We should now have
788	 * enough information to process the lists of scopes
789	 * we encapsulate.
790	 */
791	scope_t *cur_scope;
792	u_int skip_patch_count;
793	u_int skip_instr_count;
794
795	cur_scope = TAILQ_LAST(&scope->inner_scope, scope_tailq);
796	skip_patch_count = 0;
797	skip_instr_count = 0;
798	while (cur_scope != NULL) {
799		u_int patch0_patch_skip;
800
801		patch0_patch_skip = 0;
802		switch (cur_scope->type) {
803		case SCOPE_IF:
804		case SCOPE_ELSE_IF:
805			if (skip_instr_count != 0) {
806				/* Create a tail patch */
807				patch0_patch_skip++;
808				cur_scope->patches[1].skip_patch =
809				    skip_patch_count + 1;
810				cur_scope->patches[1].skip_instr =
811				    skip_instr_count;
812			}
813
814			/* Count Head patch */
815			patch0_patch_skip++;
816
817			/* Count any patches contained in our inner scope */
818			patch0_patch_skip += cur_scope->inner_scope_patches;
819
820			cur_scope->patches[0].skip_patch = patch0_patch_skip;
821			cur_scope->patches[0].skip_instr =
822			    cur_scope->end_addr - cur_scope->begin_addr;
823
824			skip_instr_count += cur_scope->patches[0].skip_instr;
825
826			skip_patch_count += patch0_patch_skip;
827			if (cur_scope->type == SCOPE_IF) {
828				scope->inner_scope_patches += skip_patch_count;
829				skip_patch_count = 0;
830			        skip_instr_count = 0;
831			}
832			break;
833		case SCOPE_ELSE:
834			/* Count any patches contained in our innter scope */
835			skip_patch_count += cur_scope->inner_scope_patches;
836
837			skip_instr_count += cur_scope->end_addr
838					  - cur_scope->begin_addr;
839			break;
840		case SCOPE_ROOT:
841			stop("Unexpected scope type encountered", EX_SOFTWARE);
842			/* NOTREACHED */
843		}
844
845		cur_scope = TAILQ_PREV(cur_scope, scope_tailq, scope_links);
846	}
847}
848