407 lines
10 KiB
C
407 lines
10 KiB
C
/*
|
|
* Copyright (c) 1980 Regents of the University of California.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef lint
|
|
/*static char sccsid[] = "from: @(#)mkglue.c 5.10 (Berkeley) 1/15/91";*/
|
|
static char rcsid[] = "$Id: mkglue.c,v 1.6 1994/02/01 02:11:02 deraadt Exp $";
|
|
#endif /* not lint */
|
|
|
|
/*
|
|
* Make the bus adaptor interrupt glue files.
|
|
*/
|
|
#include <stdio.h>
|
|
#include "config.h"
|
|
#include "y.tab.h"
|
|
#include <ctype.h>
|
|
|
|
/*
|
|
* Create the UNIBUS interrupt vector glue file.
|
|
*/
|
|
ubglue()
|
|
{
|
|
register FILE *fp, *gp;
|
|
register struct device *dp, *mp;
|
|
|
|
fp = fopen(path("ubglue.s"), "w");
|
|
if (fp == 0) {
|
|
perror(path("ubglue.s"));
|
|
exit(1);
|
|
}
|
|
gp = fopen(path("ubvec.s"), "w");
|
|
if (gp == 0) {
|
|
perror(path("ubvec.s"));
|
|
exit(1);
|
|
}
|
|
for (dp = dtab; dp != 0; dp = dp->d_next) {
|
|
mp = dp->d_conn;
|
|
if (mp != 0 && mp != (struct device *)-1 &&
|
|
!eq(mp->d_name, "mba")) {
|
|
struct idlst *id, *id2;
|
|
|
|
for (id = dp->d_vec; id; id = id->id_next) {
|
|
for (id2 = dp->d_vec; id2; id2 = id2->id_next) {
|
|
if (id2 == id) {
|
|
dump_ubavec(fp, id->id,
|
|
dp->d_unit);
|
|
break;
|
|
}
|
|
if (!strcmp(id->id, id2->id))
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
dump_std(fp, gp);
|
|
for (dp = dtab; dp != 0; dp = dp->d_next) {
|
|
mp = dp->d_conn;
|
|
if (mp != 0 && mp != (struct device *)-1 &&
|
|
!eq(mp->d_name, "mba")) {
|
|
struct idlst *id, *id2;
|
|
|
|
for (id = dp->d_vec; id; id = id->id_next) {
|
|
for (id2 = dp->d_vec; id2; id2 = id2->id_next) {
|
|
if (id2 == id) {
|
|
dump_intname(fp, id->id,
|
|
dp->d_unit);
|
|
break;
|
|
}
|
|
if (!strcmp(id->id, id2->id))
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
dump_ctrs(fp);
|
|
(void) fclose(fp);
|
|
(void) fclose(gp);
|
|
}
|
|
|
|
static int cntcnt = 0; /* number of interrupt counters allocated */
|
|
|
|
/*
|
|
* Print a UNIBUS interrupt vector.
|
|
*/
|
|
dump_ubavec(fp, vector, number)
|
|
register FILE *fp;
|
|
char *vector;
|
|
int number;
|
|
{
|
|
char nbuf[80];
|
|
register char *v = nbuf;
|
|
|
|
(void) sprintf(v, "%s%d", vector, number);
|
|
fprintf(fp, "\t.globl\t_X%s\n\t.align\t2\n_X%s:\n\tpushr\t$0x3f\n",
|
|
v, v);
|
|
fprintf(fp, "\tincl\t_fltintrcnt+(4*%d)\n", cntcnt++);
|
|
if (strncmp(vector, "dzx", 3) == 0)
|
|
fprintf(fp, "\tmovl\t$%d,r0\n\tjmp\tdzdma\n\n", number);
|
|
else if (strncmp(vector, "dpx", 3) == 0)
|
|
fprintf(fp, "\tmovl\t$%d,r0\n\tjmp\tdpxdma\n\n", number);
|
|
else if (strncmp(vector, "dpr", 3) == 0)
|
|
fprintf(fp, "\tmovl\t$%d,r0\n\tjmp\tdprdma\n\n", number);
|
|
else {
|
|
if (strncmp(vector, "uur", 3) == 0) {
|
|
fprintf(fp, "#ifdef UUDMA\n");
|
|
fprintf(fp, "\tmovl\t$%d,r0\n\tjsb\tuudma\n", number);
|
|
fprintf(fp, "#endif\n");
|
|
}
|
|
fprintf(fp, "\tpushl\t$%d\n", number);
|
|
fprintf(fp, "\tcalls\t$1,_%s\n\tpopr\t$0x3f\n", vector);
|
|
fprintf(fp, "\tincl\t_cnt+V_INTR\n\trei\n\n");
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Create the VERSAbus interrupt vector glue file.
|
|
*/
|
|
vbglue()
|
|
{
|
|
register FILE *fp, *gp;
|
|
register struct device *dp, *mp;
|
|
|
|
fp = fopen(path("vbglue.s"), "w");
|
|
if (fp == 0) {
|
|
perror(path("vbglue.s"));
|
|
exit(1);
|
|
}
|
|
gp = fopen(path("vbvec.s"), "w");
|
|
if (gp == 0) {
|
|
perror(path("vbvec.s"));
|
|
exit(1);
|
|
}
|
|
for (dp = dtab; dp != 0; dp = dp->d_next) {
|
|
struct idlst *id, *id2;
|
|
|
|
mp = dp->d_conn;
|
|
if (mp == 0 || mp == (struct device *)-1 ||
|
|
eq(mp->d_name, "mba"))
|
|
continue;
|
|
for (id = dp->d_vec; id; id = id->id_next)
|
|
for (id2 = dp->d_vec; id2; id2 = id2->id_next) {
|
|
if (id == id2) {
|
|
dump_vbavec(fp, id->id, dp->d_unit);
|
|
break;
|
|
}
|
|
if (eq(id->id, id2->id))
|
|
break;
|
|
}
|
|
}
|
|
dump_std(fp, gp);
|
|
for (dp = dtab; dp != 0; dp = dp->d_next) {
|
|
mp = dp->d_conn;
|
|
if (mp != 0 && mp != (struct device *)-1 &&
|
|
!eq(mp->d_name, "mba")) {
|
|
struct idlst *id, *id2;
|
|
|
|
for (id = dp->d_vec; id; id = id->id_next) {
|
|
for (id2 = dp->d_vec; id2; id2 = id2->id_next) {
|
|
if (id2 == id) {
|
|
dump_intname(fp, id->id,
|
|
dp->d_unit);
|
|
break;
|
|
}
|
|
if (eq(id->id, id2->id))
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
dump_ctrs(fp);
|
|
(void) fclose(fp);
|
|
(void) fclose(gp);
|
|
}
|
|
|
|
/*
|
|
* Print a VERSAbus interrupt vector
|
|
*/
|
|
dump_vbavec(fp, vector, number)
|
|
register FILE *fp;
|
|
char *vector;
|
|
int number;
|
|
{
|
|
char nbuf[80];
|
|
register char *v = nbuf;
|
|
|
|
(void) sprintf(v, "%s%d", vector, number);
|
|
fprintf(fp, "SCBVEC(%s):\n", v);
|
|
fprintf(fp, "\tCHECK_SFE(4)\n");
|
|
fprintf(fp, "\tSAVE_FPSTAT(4)\n");
|
|
fprintf(fp, "\tPUSHR\n");
|
|
fprintf(fp, "\tincl\t_fltintrcnt+(4*%d)\n", cntcnt++);
|
|
fprintf(fp, "\tpushl\t$%d\n", number);
|
|
fprintf(fp, "\tcallf\t$8,_%s\n", vector);
|
|
fprintf(fp, "\tincl\t_cnt+V_INTR\n");
|
|
fprintf(fp, "\tPOPR\n");
|
|
fprintf(fp, "\tREST_FPSTAT\n");
|
|
fprintf(fp, "\trei\n\n");
|
|
}
|
|
|
|
/*
|
|
* HP9000/300 interrupts are auto-vectored.
|
|
* Code is hardwired in locore.s
|
|
*/
|
|
hpglue() {}
|
|
|
|
/*
|
|
* so are AMIGA interrupts
|
|
*/
|
|
amigaglue() {}
|
|
|
|
static char *vaxinames[] = {
|
|
"clock", "cnr", "cnx", "tur", "tux",
|
|
"mba0", "mba1", "mba2", "mba3",
|
|
"uba0", "uba1", "uba2", "uba3"
|
|
};
|
|
static char *tahoeinames[] = {
|
|
"clock", "cnr", "cnx", "rmtr", "rmtx", "buserr",
|
|
};
|
|
static struct stdintrs {
|
|
char **si_names; /* list of standard interrupt names */
|
|
int si_n; /* number of such names */
|
|
} stdintrs[] = {
|
|
{ vaxinames, sizeof (vaxinames) / sizeof (vaxinames[0]) },
|
|
{ tahoeinames, (sizeof (tahoeinames) / sizeof (tahoeinames[0])) }
|
|
};
|
|
/*
|
|
* Start the interrupt name table with the names
|
|
* of the standard vectors not directly associated
|
|
* with a bus. Also, dump the defines needed to
|
|
* reference the associated counters into a separate
|
|
* file which is prepended to locore.s.
|
|
*/
|
|
dump_std(fp, gp)
|
|
register FILE *fp, *gp;
|
|
{
|
|
register struct stdintrs *si = &stdintrs[machine-1];
|
|
register char **cpp;
|
|
register int i;
|
|
|
|
fprintf(fp, "\n\t.globl\t_intrnames\n");
|
|
fprintf(fp, "\n\t.globl\t_eintrnames\n");
|
|
fprintf(fp, "\t.data\n");
|
|
fprintf(fp, "_intrnames:\n");
|
|
cpp = si->si_names;
|
|
for (i = 0; i < si->si_n; i++) {
|
|
register char *cp, *tp;
|
|
char buf[80];
|
|
|
|
cp = *cpp;
|
|
if (cp[0] == 'i' && cp[1] == 'n' && cp[2] == 't') {
|
|
cp += 3;
|
|
if (*cp == 'r')
|
|
cp++;
|
|
}
|
|
for (tp = buf; *cp; cp++)
|
|
if (islower(*cp))
|
|
*tp++ = toupper(*cp);
|
|
else
|
|
*tp++ = *cp;
|
|
*tp = '\0';
|
|
fprintf(gp, "#define\tI_%s\t%d\n", buf, i*sizeof (long));
|
|
fprintf(fp, "\t.asciz\t\"%s\"\n", *cpp);
|
|
cpp++;
|
|
}
|
|
}
|
|
|
|
dump_intname(fp, vector, number)
|
|
register FILE *fp;
|
|
char *vector;
|
|
int number;
|
|
{
|
|
register char *cp = vector;
|
|
|
|
fprintf(fp, "\t.asciz\t\"");
|
|
/*
|
|
* Skip any "int" or "intr" in the name.
|
|
*/
|
|
while (*cp)
|
|
if (cp[0] == 'i' && cp[1] == 'n' && cp[2] == 't') {
|
|
cp += 3;
|
|
if (*cp == 'r')
|
|
cp++;
|
|
} else {
|
|
putc(*cp, fp);
|
|
cp++;
|
|
}
|
|
fprintf(fp, "%d\"\n", number);
|
|
}
|
|
|
|
/*
|
|
* Reserve space for the interrupt counters.
|
|
*/
|
|
dump_ctrs(fp)
|
|
register FILE *fp;
|
|
{
|
|
struct stdintrs *si = &stdintrs[machine-1];
|
|
|
|
fprintf(fp, "_eintrnames:\n");
|
|
fprintf(fp, "\n\t.globl\t_intrcnt\n");
|
|
fprintf(fp, "\n\t.globl\t_eintrcnt\n");
|
|
fprintf(fp, "\t.align 2\n");
|
|
fprintf(fp, "_intrcnt:\n");
|
|
fprintf(fp, "\t.space\t4 * %d\n", si->si_n);
|
|
fprintf(fp, "_fltintrcnt:\n");
|
|
fprintf(fp, "\t.space\t4 * %d\n", cntcnt);
|
|
fprintf(fp, "_eintrcnt:\n\n");
|
|
fprintf(fp, "\t.text\n");
|
|
}
|
|
|
|
/*
|
|
* Create the ISA interrupt vector glue file.
|
|
*/
|
|
vector() {
|
|
register FILE *fp, *gp;
|
|
register struct device *dp, *mp;
|
|
int count;
|
|
|
|
fp = fopen(path("vector.h"), "w");
|
|
if (fp == 0) {
|
|
perror(path("vector.h"));
|
|
exit(1);
|
|
}
|
|
fprintf(fp, "\
|
|
/*\n\
|
|
* AT/386\n\
|
|
* Macros for interrupt vector routines\n\
|
|
* Generated by config program\n\
|
|
*/\n\
|
|
\n");
|
|
|
|
fprintf(fp, "\
|
|
#define BUILD_VECTORS \\\n\
|
|
BUILD_VECTOR(clk, 0,0,0, _highmask, _clockintr,1,1, al);\\\n");
|
|
|
|
count=1;
|
|
for (dp = dtab; dp != 0; dp = dp->d_next) {
|
|
mp = dp->d_conn;
|
|
if (mp != 0 && /* mp != (struct device *)-1 &&*/
|
|
eq(mp->d_name, "isa")) {
|
|
struct idlst *id, *id2;
|
|
|
|
for (id = dp->d_vec; id; id = id->id_next) {
|
|
for (id2 = dp->d_vec; id2; id2 = id2->id_next) {
|
|
if (id2 == id) {
|
|
build_vector(fp, dp, id, count);
|
|
count++;
|
|
if (!strcmp(id->id, id2->id))
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
fprintf(fp, "\n\n#define NR_REAL_INT_HANDLERS %d\n", count);
|
|
(void) fclose(fp);
|
|
}
|
|
|
|
build_vector(fp, dp, id, offset)
|
|
register FILE *fp;
|
|
register struct device *dp;
|
|
struct idlst *id;
|
|
int offset;
|
|
{
|
|
fprintf(fp, "\tBUILD_%sVECTOR(%s%d, %d,%d,%d",
|
|
strcmp(dp->d_name, "sio") == 0 ? "FAST_" : "",
|
|
dp->d_name, dp->d_unit, dp->d_unit, dp->d_irq, offset);
|
|
if (eq(dp->d_mask, "null"))
|
|
fprintf(fp, ", _%s%dmask,", dp->d_name, dp->d_unit);
|
|
else
|
|
fprintf(fp, ", _%smask, ", dp->d_mask);
|
|
fprintf(fp, " _%s,%d,1", id->id, 1 + dp->d_irq / 8);
|
|
if (dp->d_irq < 8)
|
|
fprintf(fp, ", al");
|
|
else
|
|
fprintf(fp, "_AND_2, ah");
|
|
fprintf(fp, ");\\\n");
|
|
}
|