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