AUSAM/sys/sysd/source/proc3.c
#include "proc.h"
/* declarations for octal dumping and double word seeks */
int word[16];
int conv;
int base 010;
int basem 01000;
int max;
int gidx;
int gcnt;
int eof;
int addr[2];
int from[2];
int to[2];
int key;
int flg;
int nword 16; /* number of words across the page */
odump(start, len)
long start;
long len;
{
int f, k, w, i, a[2];
long l1, l2;
conv = 0;
if (aflg) {
conv =| 004;
max = 4;
}
if (cflg) {
conv =| 020;
max = 5;
}
if (oflg) {
conv =| 001;
max = 6;
}
if (bflg) {
conv =| 040;
max = 7;
}
l1 = start;
l2 = l1 + len;
offset(l1, from);
offset(l2, to);
bseek(from);
star();
do {
f = 1;
a[0] = addr[0];
a[1] = addr[1];
for (i = 0; i < nword; i++) {
w = getwd();
if (eof)
break;
word[i] = w;
if (i > 0)
f =& w==k;
else
k = w;
}
if (i > 0)
if (f && !eof) {
if (!flg || k!=key) {
dupl();
key = k;
from[0] = a[0];
from[1] = a[1];
}
flg =+ i;
} else {
dupl();
line(a, word, i);
}
} while (!eof);
puta(addr);
putchar('\n');
star();
putchar('\n');
}
dupl()
{
if (flg) {
flg = 0;
line(from, &key, 1);
}
}
puta(a)
int a[2];
{
putn(a[0], base, 4);
putn(a[1], base, 3);
putchar(' ');
}
line(a, w, n)
int a[2];
int w[];
{
int i, f, c;
f = 1;
for (c = 1; c != 0; c =+ c) {
if (!(c & conv))
continue;
if (f) {
puta(a);
f = 0;
} else
for (i = 0; i < 8; i++)
putchar(' ');
for (i = 0; i < n; i++) {
putx(w[i], c);
putchar(i==n-1? '\n': ' ');
}
}
}
putx(n, c)
{
switch(c) {
case 001:
pre(6);
putn(n, 8, 6);
break;
case 002:
pre(5);
putn(n, 10, 5);
break;
case 004:
pre(4);
putop(n);
break;
case 010:
pre(4);
putn(n, 16, 4);
break;
case 020:
pre(max>=7 ? 6 : 5);
putc(n);
putchar(' ');
if (max >= 7)
putchar(' ');
putc(n>>8);
break;
case 040:
pre(7);
putn(n&0377, 8, 3);
putchar(' ');
putn((n>>8)&0377, 8, 3);
break;
}
}
getwd()
{
int b1, b2;
b1 = getch();
if (b1 == -1) {
eof = 1;
return(0);
}
b2 = getch();
if (b2 == -1)
b2 = 0;
return(b1|(b2<<8));
}
getch()
{
if (gidx >= gcnt) {
gcnt = read(corefd, wkbuf, 512);
if (gcnt <= 0)
return(-1);
gidx = 0;
}
if (++addr[1] >= basem) {
addr[0]++;
addr[1] = 0;
}
if ((addr[0] > to[0]) || ((addr[0] == to[0]) && (addr[1] > to[1])))
return(-1);
return(wkbuf[gidx++] & 0377);
}
putc(c)
{
c =& 0377;
if (c>=040 && c<0177 && c!='\\') {
putchar(' ');
putchar(c);
return;
}
putchar('\\');
switch(c) {
case '\0':
putchar('0');
break;
case '\n':
putchar('n');
break;
case '\\':
putchar('\\');
break;
case '\t':
putchar('t');
break;
default:
putchar('?');
}
}
putn(n, b, c)
{
if (!c)
return;
putn(ldiv(0, n, b), b, c-1);
n = lrem(0, n, b);
if (n > 9)
putchar(n - 10 + 'a');
else
putchar(n + '0');
}
pre(n)
{
int i;
for (i = n; i < max; i++)
putchar(' ');
}
offset(l, v)
long l;
int *v;
{
v[0] = l / basem;
v[1] = l % basem;
DEBUG
printf("vector passed offset assigned; v[0] = %o, v[1] = %o\n", v[0], v[1]);
}
bseek(v)
int *v;
{
eof = 0;
gcnt = 0;
addr[1] = 0;
addr[0] = v[0] - 1;
DEBUG
printf("bseek to %d (%o) *512 bytes\n",addr[0],addr[0]);
seek(corefd, addr[0], 3);
while (v[0]!=addr[0] || v[1]!=addr[1])
if (getch() == -1)
break;
}
putop(n)
{
char *p;
int i, c;
p = getop(n);
for (i = 0; (c = *p++) != '\0'; i++)
putchar(c);
for (; i < 4; i++)
putchar(' ');
}
getop(n)
{
switch (n & 0170000) {
case 0000000:
switch (n & 0177000) {
case 0004000:
return("jsr");
case 0077000:
return("sob");
}
switch (n & 0177400) {
case 0000400:
return("br");
case 0001000:
return("bne");
case 0001400:
return("beq");
case 0002000:
return("bge");
case 0002400:
return("blt");
case 0003000:
return("bgt");
case 0003400:
return("ble");
}
switch (n & 0177700) {
case 0000100:
return("jmp");
case 0000300:
return("swab");
case 0005000:
return("clr");
case 0005100:
return("com");
case 0005200:
return("inc");
case 0005300:
return("dec");
case 0005400:
return("neg");
case 0005500:
return("adc");
case 0005600:
return("sbc");
case 0005700:
return("tst");
case 0006000:
return("ror");
case 0006100:
return("rol");
case 0006200:
return("asr");
case 0006300:
return("asl");
case 0006400:
return("mark");
case 0006500:
return("mfpi");
case 0006600:
return("mtpi");
case 0006700:
return("sxt");
}
switch (n & 0177740) {
case 0000240:
return("flag");
}
switch (n & 0177770) {
case 0000200:
return("rts");
case 0000230:
return("spl");
}
switch (n & 0177777) {
case 0000000:
return("halt");
case 0000001:
return("wait");
case 0000002:
return("rti");
case 0000003:
return("bpt");
case 0000004:
return("iot");
case 0000005:
return("rset");
case 0000006:
return("rtt");
}
break;
case 0010000:
return("mov");
case 0020000:
return("cmp");
case 0030000:
return("bit");
case 0040000:
return("bic");
case 0050000:
return("bis");
case 0060000:
return("add");
case 0070000:
switch (n & 0177000) {
case 0070000:
return("mul");
case 0071000:
return("div");
case 0072000:
return("ash");
case 0073000:
return("ashc");
case 0074000:
return("xor");
}
switch (n & 0177770) {
case 0075000:
return("fadd");
case 0075010:
return("fsub");
case 0075020:
return("fmul");
case 0075030:
return("fdiv");
}
break;
case 0100000:
switch (n & 0177400) {
case 0100000:
return("bpl");
case 0100400:
return("bmi");
case 0101000:
return("bhi");
case 0101400:
return("blos");
case 0102000:
return("bvc");
case 0102400:
return("bvs");
case 0103000:
return("bhis");
case 0103400:
return("blo");
case 0104000:
return("emt");
case 0104400:
return("sys");
}
switch (n & 0177700) {
case 0105000:
return("clrb");
case 0105100:
return("comb");
case 0105200:
return("incb");
case 0105300:
return("decb");
case 0105400:
return("negb");
case 0105500:
return("adcb");
case 0105600:
return("sbcb");
case 0105700:
return("tstb");
case 0106000:
return("rorb");
case 0106100:
return("rolb");
case 0106200:
return("asrb");
case 0106300:
return("aslb");
case 0106500:
return("mfpd");
case 0106600:
return("mtpd");
}
break;
case 0110000:
return("movb");
case 0120000:
return("cmpb");
case 0130000:
return("bitb");
case 0140000:
return("bicb");
case 0150000:
return("bisb");
case 0160000:
return("sub");
case 0170000:
switch (n & 0177000) {
case 0:0;
}
break;
}
return("???");
}