File: disas.c

package info (click to toggle)
faumachine 20100527-2
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 53,836 kB
  • ctags: 20,552
  • sloc: ansic: 179,550; asm: 3,645; makefile: 3,611; perl: 2,103; sh: 1,529; python: 600; xml: 563; lex: 210; vhdl: 204
file content (359 lines) | stat: -rw-r--r-- 6,087 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
/* $Id: disas.c,v 1.2 2009-01-28 17:21:54 potyra Exp $ 
 *
 * Copyright (C) 2008-2009 FAUmachine Team <info@faumachine.org>.
 * This program is free software. You can redistribute it and/or modify it
 * under the terms of the GNU General Public License, either version 2 of
 * the License, or (at your option) any later version. See COPYING.
 */

#include <assert.h>
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct block {
	struct block *prev;
	struct block *next;

	uint64_t addr;
	uint8_t start[1024*1024];
	uint8_t mem[1024*1024];
};

struct block *block_first;
struct block *block_last;

static int
dis_read(FILE *fp, uint64_t *addrp, uint8_t *bytep)
{
	char key[1024];
	int keylen;
	int c;

again:	;
	c = fgetc(fp);
	if (c == EOF) {
		return -1;
	}

	/*
	 * Skip CPU ID (if present).
	 */
	while ('0' <= c && c <= '9') {
		c = fgetc(fp);
	}
	if (c == ':') {
		c = fgetc(fp);
	}
	if (c == ' ') {
		c = fgetc(fp);
	}

	/*
	 * Get keyword.
	 */
	keylen = 0;
	while (('A' <= c && c <= 'Z')
	    || ('a' <= c && c <= 'z')) {
		key[keylen++] = c;
		c = fgetc(fp);
	}
	key[keylen] = '\0';

	/*
	 * Skip space (if any).
	 */
	while (c == ' '
	    || c == '\t') {
		c = fgetc(fp);
	}

	if (strcmp(key, "DIS") == 0) {
		/*
		 * DIS ...
		 */
		unsigned int count;

		count = 0;

		/*
		 * Read address.
		 */
		*addrp = 0;
		while (('0' <= c && c <= '9')
		    || ('A' <= c && c <= 'F')
		    || ('a' <= c && c <= 'f')) {
			*addrp *= 16;
			if ('0' <= c && c <= '9') {
				*addrp += c - '0';
			} else if ('A' <= c && c <= 'F') {
				*addrp += c - 'A' + 10;
			} else if ('a' <= c && c <= 'f') {
				*addrp += c - 'a' + 10;
			} else {
				assert(0);
			}
			c = fgetc(fp);
		}

		while (c != '\n' && c != EOF) {
			uint32_t val;
			unsigned int n;

			/*
			 * Skip space.
			 */
			if (c != ' ') goto skip;
			assert(c == ' ');
			c = fgetc(fp);

			/*
			 * Read byte/word/long.
			 */
			n = 0;
			val = 0;
			while (('0' <= c && c <= '9')
			    || ('A' <= c && c <= 'F')
			    || ('a' <= c && c <= 'f')) {
				val *= 16;
				if ('0' <= c && c <= '9') {
					val += c - '0';
				} else if ('A' <= c && c <= 'F') {
					val += c - 'A' + 10;
				} else if ('a' <= c && c <= 'f') {
					val += c - 'a' + 10;
				} else {
					assert(0);
				}
				n++;
				c = fgetc(fp);
			}
			if (n % 2 != 0) goto skip;
			assert(n % 2 == 0);
			n /= 2;
			switch (n) {
			case 1:
				*bytep++ = val;
				break;
			case 2:
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				break;
			case 4:
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				break;
			case 8:
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				val >>= 8;
				*bytep++ = val & 0xff;
				break;
			default:
				assert(0);
			}

			count += n;
		}

		assert(0 < count);
		return count;

	} else if (strcmp(key, "Executing") == 0) {
		/*
		 * Executing at ...
		 */

		/*
		 * Skip "at" and " ".
		 */
		if (c != 'a') goto skip;
		assert(c == 'a');
		c = fgetc(fp);
		if (c != 't') goto skip;
		assert(c == 't');
		c = fgetc(fp);

		if (c != ' ') goto skip;
		assert(c == ' ');
		c = fgetc(fp);

		/*
		 * Read address.
		 */
		*addrp = 0;
		while (('0' <= c && c <= '9')
		    || ('A' <= c && c <= 'F')
		    || ('a' <= c && c <= 'f')) {
			*addrp *= 16;
			if ('0' <= c && c <= '9') {
				*addrp += c - '0';
			} else if ('A' <= c && c <= 'F') {
				*addrp += c - 'A' + 10;
			} else if ('a' <= c && c <= 'f') {
				*addrp += c - 'a' + 10;
			} else {
				assert(0);
			}
			c = fgetc(fp);
		}

		/*
		 * Skip rest of line.
		 */
		while (c != '\n' && c != EOF) {
			c = fgetc(fp);
		}

		return 0;

	} else {
		/*
		 * Skip unknown line.
		 */
	skip:	;
		while (c != '\n' && c != EOF) {
			c = fgetc(fp);
		}
		goto again;
	}
}

static struct block *
block_get(uint64_t addr)
{
	struct block *b;

	addr &= ~(1024*1024-1);
	for (b = block_first; ; b = b->next) {
		if (! b) {
			/* Block not found. */
			b = (struct block *) malloc(sizeof(struct block));
			assert(b);

			b->addr = addr;
			memset(b->start, 0, sizeof(b->start));
			memset(b->mem, 0, sizeof(b->mem));

			b->prev = NULL;
			b->next = block_first;
			block_first = b;
			if (b->next) {
				b->next->prev = b;
			} else {
				block_last = b;
			}
			break;
		}
		if (b->addr == addr) {
			/* Block found. */
			break;
		}
	}
	return b;
}

static void
block_start(uint64_t addr)
{
	struct block *b;

	b = block_get(addr);
	assert(b);
	b->start[addr & (1024*1024-1)] = 1;
}

static void
block_mem(uint64_t addr, uint8_t val)
{
	struct block *b;

	b = block_get(addr);
	assert(b);
	b->mem[addr & (1024*1024-1)] = val;
}

int
main(void)
{
	uint64_t addr;
	uint8_t byte[16];
	unsigned int count;
	unsigned int i;
	struct block *b;

	/* Read data into blocks. */
	while ((count = dis_read(stdin, &addr, byte)) != -1) {
		if (count == 0) {
			block_start(addr);

		} else {
			for (i = 0; i < count; i++) {
				block_mem(addr + i, byte[i]);
			}
		}
	}

	/* Sort blocks. */
again:	;
	for (b = block_first; b && b->next; b = b->next) {
		if (b->next->addr < b->addr) {
			struct block *prev;
			struct block *act0;
			struct block *act1;
			struct block *next;

			act0 = b;
			act1 = b->next;
			prev = act0->prev;
			next = act1->next;

			act0->prev = act1;
			act0->next = next;
			act1->prev = prev;
			act1->next = act0;

			if (prev) {
				prev->next = act1;
			} else {
				block_first = act1;
			}
			if (next) {
				next->prev = act0;
			} else {
				block_last = act0;
			}
			goto again;
		}
	}

	printf("\t.text\n");
	for (b = block_first; b; b = b->next) {
		for (addr = 0; addr < 1024*1024; addr++) {
			if (b->start[addr]) {
				printf("org_%llx:\n", (unsigned long long) addr + b->addr);
			}
			printf("\t.byte 0x%02x\n", b->mem[addr]);
		}
	}

	return 0;
}