![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to build68k.c CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [UNIX Amiga Emulator] / uae / src|
Return to build68k.c CVS log | Up to [UNIX Amiga Emulator] / uae / src |
1.1.1.3 root 1: /*
1.1 root 2: * UAE - The Un*x Amiga Emulator
3: *
4: * Read 68000 CPU specs from file "table68k" and build table68k.c
5: *
6: * Copyright 1995,1996 Bernd Schmidt
7: */
8:
9: #include "sysconfig.h"
10: #include "sysdeps.h"
11:
12: #include <assert.h>
13: #include <ctype.h>
14:
15: #include "readcpu.h"
16:
17: static FILE *tablef;
18: static int nextch = 0;
19:
20: static void getnextch(void)
21: {
22: do {
23: nextch = fgetc(tablef);
24: if (nextch == '%') {
25: do {
26: nextch = fgetc(tablef);
1.1.1.3 root 27: } while (nextch != EOF && nextch != '\n');
1.1 root 28: }
1.1.1.3 root 29: } while (nextch != EOF && isspace(nextch));
30: }
31:
32: static int nextchtohex(void)
33: {
34: switch (isupper (nextch) ? tolower (nextch) : nextch) {
35: case '0': return 0;
36: case '1': return 1;
37: case '2': return 2;
38: case '3': return 3;
39: case '4': return 4;
40: case '5': return 5;
41: case '6': return 6;
42: case '7': return 7;
43: case '8': return 8;
44: case '9': return 9;
45: case 'a': return 10;
46: case 'b': return 11;
47: case 'c': return 12;
48: case 'd': return 13;
49: case 'e': return 14;
50: case 'f': return 15;
51: default: abort();
52: }
1.1 root 53: }
54:
55: int main(int argc, char **argv)
56: {
57: int no_insns = 0;
58:
59: printf ("#include \"sysconfig.h\"\n");
60: printf ("#include \"sysdeps.h\"\n");
61: printf ("#include \"readcpu.h\"\n");
62: printf ("struct instr_def defs68k[] = {\n");
1.1.1.3 root 63: #if 0
1.1 root 64: tablef = fopen("table68k","r");
65: if (tablef == NULL) {
66: fprintf(stderr, "table68k not found\n");
67: exit(1);
68: }
1.1.1.3 root 69: #else
70: tablef = stdin;
71: #endif
1.1 root 72: getnextch();
73: while (nextch != EOF) {
1.1.1.3 root 74: int cpulevel, plevel, sduse;
1.1 root 75: int i;
1.1.1.3 root 76:
1.1 root 77: char patbits[16];
78: char opcstr[256];
79: int bitpos[16];
80: int flagset[5], flaguse[5];
1.1.1.3 root 81:
82: unsigned int bitmask,bitpattern;
1.1 root 83: int n_variable;
1.1.1.3 root 84:
1.1 root 85: n_variable = 0;
86: bitmask = bitpattern = 0;
87: memset (bitpos, 0, sizeof(bitpos));
88: for(i=0; i<16; i++) {
89: int currbit;
90: bitmask <<= 1;
91: bitpattern <<= 1;
1.1.1.3 root 92:
1.1 root 93: switch (nextch) {
94: case '0': currbit = bit0; bitmask |= 1; break;
95: case '1': currbit = bit1; bitmask |= 1; bitpattern |= 1; break;
96: case 'c': currbit = bitc; break;
97: case 'C': currbit = bitC; break;
98: case 'f': currbit = bitf; break;
99: case 'i': currbit = biti; break;
100: case 'I': currbit = bitI; break;
101: case 'j': currbit = bitj; break;
102: case 'J': currbit = bitJ; break;
103: case 'k': currbit = bitk; break;
104: case 'K': currbit = bitK; break;
105: case 's': currbit = bits; break;
106: case 'S': currbit = bitS; break;
107: case 'd': currbit = bitd; break;
108: case 'D': currbit = bitD; break;
109: case 'r': currbit = bitr; break;
110: case 'R': currbit = bitR; break;
111: case 'z': currbit = bitz; break;
1.1.1.5 root 112: case 'p': currbit = bitp; break;
1.1 root 113: default: abort();
114: }
115: if (!(bitmask & 1)) {
116: bitpos[n_variable] = currbit;
117: n_variable++;
118: }
1.1.1.3 root 119:
120: if (nextch == '0' || nextch == '1')
1.1 root 121: bitmask |= 1;
1.1.1.3 root 122: if (nextch == '1')
1.1 root 123: bitpattern |= 1;
124: patbits[i] = nextch;
125: getnextch();
126: }
1.1.1.3 root 127:
1.1 root 128: while (isspace(nextch) || nextch == ':') /* Get CPU and privilege level */
129: getnextch();
1.1.1.3 root 130:
1.1 root 131: switch (nextch) {
132: case '0': cpulevel = 0; break;
133: case '1': cpulevel = 1; break;
134: case '2': cpulevel = 2; break;
1.1.1.2 root 135: case '3': cpulevel = 3; break;
136: case '4': cpulevel = 4; break;
1.1.1.7 ! root 137: case '5': cpulevel = 5; break;
! 138: case '6': cpulevel = 6; break;
1.1 root 139: default: abort();
140: }
141: getnextch();
1.1.1.3 root 142:
1.1 root 143: switch (nextch) {
144: case '0': plevel = 0; break;
145: case '1': plevel = 1; break;
146: case '2': plevel = 2; break;
147: case '3': plevel = 3; break;
148: default: abort();
149: }
150: getnextch();
151:
152: while (isspace(nextch)) /* Get flag set information */
153: getnextch();
1.1.1.3 root 154:
1.1 root 155: if (nextch != ':')
156: abort();
157:
158: for(i = 0; i < 5; i++) {
159: getnextch();
160: switch(nextch){
161: case '-': flagset[i] = fa_unset; break;
162: case '/': flagset[i] = fa_isjmp; break;
1.1.1.5 root 163: case '+': flagset[i] = fa_isbranch; break;
1.1 root 164: case '0': flagset[i] = fa_zero; break;
165: case '1': flagset[i] = fa_one; break;
166: case 'x': flagset[i] = fa_dontcare; break;
167: case '?': flagset[i] = fa_unknown; break;
168: default: flagset[i] = fa_set; break;
169: }
170: }
1.1.1.3 root 171:
1.1 root 172: getnextch();
173: while (isspace(nextch))
174: getnextch();
1.1.1.3 root 175:
1.1 root 176: if (nextch != ':') /* Get flag used information */
177: abort();
178:
179: for(i = 0; i < 5; i++) {
180: getnextch();
181: switch(nextch){
182: case '-': flaguse[i] = fu_unused; break;
183: case '/': flaguse[i] = fu_isjmp; break;
184: case '+': flaguse[i] = fu_maybecc; break;
185: case '?': flaguse[i] = fu_unknown; break;
186: default: flaguse[i] = fu_used; break;
187: }
188: }
1.1.1.3 root 189:
190: getnextch();
191: while (isspace(nextch))
192: getnextch();
193:
194: if (nextch != ':') /* Get source/dest usage information */
195: abort();
196:
197: getnextch();
198: sduse = nextchtohex() << 4;
199: getnextch();
200: sduse |= nextchtohex();
201:
1.1 root 202: getnextch();
203: while (isspace(nextch))
204: getnextch();
1.1.1.3 root 205:
1.1 root 206: if (nextch != ':')
207: abort();
208:
209: fgets(opcstr, 250, tablef);
210: getnextch();
1.1.1.3 root 211: {
1.1 root 212: int j;
213: /* Remove superfluous spaces from the string */
214: char *opstrp = opcstr, *osendp;
215: int slen = 0;
216:
217: while (isspace(*opstrp))
218: opstrp++;
1.1.1.3 root 219:
1.1 root 220: osendp = opstrp;
221: while (*osendp) {
222: if (!isspace (*osendp))
223: slen = osendp - opstrp + 1;
224: osendp++;
225: }
226: opstrp[slen] = 0;
1.1.1.3 root 227:
1.1 root 228: if (no_insns > 0)
229: printf(",\n");
230: no_insns++;
231: printf("{ %d, %d, {", bitpattern, n_variable);
232: for (j = 0; j < 16; j++) {
233: printf("%d", bitpos[j]);
234: if (j < 15)
235: printf(",");
236: }
1.1.1.3 root 237: printf ("}, %d, %d, %d, { ", bitmask, cpulevel, plevel);
1.1 root 238: for(i = 0; i < 5; i++) {
239: printf("{ %d, %d }%c ", flaguse[i], flagset[i], i == 4 ? ' ' : ',');
240: }
1.1.1.3 root 241: printf("}, %d, \"%s\"}", sduse, opstrp);
1.1 root 242: }
243: }
244: printf("};\nint n_defs68k = %d;\n", no_insns);
245: return 0;
246: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.