![[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 / uae-cpu|
Return to build68k.c CVS log | Up to [HATARI the Atari ST Emulator] / hatari / src / uae-cpu |
1.1 root 1: /*
1.1.1.2 root 2: * UAE - The Un*x Amiga Emulator - CPU core
1.1 root 3: *
4: * Read 68000 CPU specs from file "table68k" and build table68k.c
5: *
6: * Copyright 1995,1996 Bernd Schmidt
1.1.1.2 root 7: *
8: * Adaptation to Hatari by Thomas Huth
9: *
1.1.1.9 ! root 10: * This file is distributed under the GNU General Public License, version 2
! 11: * or at your option any later version. Read the file gpl.txt for details.
1.1 root 12: */
1.1.1.7 root 13: const char Build68k_fileid[] = "Hatari build68k.c : " __DATE__ " " __TIME__;
1.1 root 14:
15: #include <assert.h>
16: #include <ctype.h>
1.1.1.3 root 17: #include <string.h>
1.1 root 18:
19: #include "readcpu.h"
20:
1.1.1.3 root 21:
1.1 root 22: static FILE *tablef;
23: static int nextch = 0;
24:
1.1.1.3 root 25:
1.1 root 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:
1.1.1.2 root 65: /*printf ("#include \"sysconfig.h\"\n");*/
1.1 root 66: printf ("#include \"sysdeps.h\"\n");
67: printf ("#include \"readcpu.h\"\n");
1.1.1.4 root 68: printf ("const struct instr_def defs68k[] = {\n");
1.1 root 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;
1.1.1.2 root 117: case 'p': currbit = bitp; break;
1.1 root 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: default: abort();
142: }
143: getnextch();
144:
145: switch (nextch) {
146: case '0': plevel = 0; break;
147: case '1': plevel = 1; break;
148: case '2': plevel = 2; break;
149: case '3': plevel = 3; break;
150: default: abort();
151: }
152: getnextch();
153:
154: while (isspace(nextch)) /* Get flag set information */
155: getnextch();
156:
157: if (nextch != ':')
158: abort();
159:
160: for(i = 0; i < 5; i++) {
161: getnextch();
162: switch(nextch){
163: case '-': flagset[i] = fa_unset; break;
164: case '/': flagset[i] = fa_isjmp; break;
1.1.1.2 root 165: case '+': flagset[i] = fa_isbranch; break;
1.1 root 166: case '0': flagset[i] = fa_zero; break;
167: case '1': flagset[i] = fa_one; break;
168: case 'x': flagset[i] = fa_dontcare; break;
169: case '?': flagset[i] = fa_unknown; break;
170: default: flagset[i] = fa_set; break;
171: }
172: }
173:
174: getnextch();
175: while (isspace(nextch))
176: getnextch();
177:
178: if (nextch != ':') /* Get flag used information */
179: abort();
180:
181: for(i = 0; i < 5; i++) {
182: getnextch();
183: switch(nextch){
184: case '-': flaguse[i] = fu_unused; break;
185: case '/': flaguse[i] = fu_isjmp; break;
186: case '+': flaguse[i] = fu_maybecc; break;
187: case '?': flaguse[i] = fu_unknown; break;
188: default: flaguse[i] = fu_used; break;
189: }
190: }
191:
192: getnextch();
193: while (isspace(nextch))
194: getnextch();
195:
196: if (nextch != ':') /* Get source/dest usage information */
197: abort();
198:
199: getnextch();
200: sduse = nextchtohex() << 4;
201: getnextch();
202: sduse |= nextchtohex();
203:
204: getnextch();
205: while (isspace(nextch))
206: getnextch();
207:
208: if (nextch != ':')
209: abort();
210:
1.1.1.7 root 211: if (fgets(opcstr, 250, tablef) == NULL) {
212: perror("fgets");
213: return -1;
214: }
215:
1.1 root 216: getnextch();
217: {
218: int j;
219: /* Remove superfluous spaces from the string */
220: char *opstrp = opcstr, *osendp;
221: int slen = 0;
222:
1.1.1.5 root 223: while (isspace((unsigned)(*opstrp)))
1.1 root 224: opstrp++;
225:
226: osendp = opstrp;
227: while (*osendp) {
1.1.1.5 root 228: if (!isspace ((unsigned)(*osendp)))
1.1 root 229: slen = osendp - opstrp + 1;
230: osendp++;
231: }
232: opstrp[slen] = 0;
233:
234: if (no_insns > 0)
235: printf(",\n");
236: no_insns++;
237: printf("{ %d, %d, {", bitpattern, n_variable);
238: for (j = 0; j < 16; j++) {
239: printf("%d", bitpos[j]);
240: if (j < 15)
241: printf(",");
242: }
243: printf ("}, %d, %d, %d, { ", bitmask, cpulevel, plevel);
244: for(i = 0; i < 5; i++) {
245: printf("{ %d, %d }%c ", flaguse[i], flagset[i], i == 4 ? ' ' : ',');
246: }
247: printf("}, %d, \"%s\"}", sduse, opstrp);
248: }
249: }
250: printf("};\nint n_defs68k = %d;\n", no_insns);
251: return 0;
252: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.