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
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
|
/* This file is part of the program psim.
Copyright (C) 1994-1995, Andrew Cagney <cagney@highland.com.au>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include <getopt.h>
#include "misc.h"
#include "lf.h"
#include "table.h"
#include "config.h"
#include "filter.h"
#include "ld-decode.h"
#include "ld-cache.h"
#include "ld-insn.h"
#include "igen.h"
#include "gen-model.h"
#include "gen-icache.h"
#include "gen-itable.h"
#include "gen-idecode.h"
#include "gen-semantics.h"
#include "gen-support.h"
int hi_bit_nr;
int insn_bit_size = max_insn_bit_size;
igen_code code = generate_calls;
int generate_expanded_instructions;
int icache_size = 1024;
int generate_smp;
/****************************************************************/
static int
print_insn_bits(lf *file, insn_bits *bits)
{
int nr = 0;
if (bits == NULL)
return nr;
nr += print_insn_bits(file, bits->last);
nr += lf_putchr(file, '_');
nr += lf_putstr(file, bits->field->val_string);
if (bits->opcode->is_boolean && bits->value == 0)
nr += lf_putint(file, bits->opcode->boolean_constant);
else if (!bits->opcode->is_boolean) {
if (bits->opcode->last < bits->field->last)
nr += lf_putint(file, bits->value << (bits->field->last - bits->opcode->last));
else
nr += lf_putint(file, bits->value);
}
return nr;
}
extern int
print_function_name(lf *file,
const char *basename,
insn_bits *expanded_bits,
lf_function_name_prefixes prefix)
{
int nr = 0;
/* the prefix */
switch (prefix) {
case function_name_prefix_semantics:
nr += lf_putstr(file, "semantic_");
break;
case function_name_prefix_idecode:
nr += lf_printf(file, "idecode_");
break;
case function_name_prefix_itable:
nr += lf_putstr(file, "itable_");
break;
case function_name_prefix_icache:
nr += lf_putstr(file, "icache_");
break;
default:
break;
}
/* the function name */
{
const char *pos;
for (pos = basename;
*pos != '\0';
pos++) {
switch (*pos) {
case '/':
case '-':
break;
case ' ':
nr += lf_putchr(file, '_');
break;
default:
nr += lf_putchr(file, *pos);
break;
}
}
}
/* the suffix */
if (generate_expanded_instructions)
nr += print_insn_bits(file, expanded_bits);
return nr;
}
void
print_my_defines(lf *file,
insn_bits *expanded_bits,
table_entry *file_entry)
{
/* #define MY_INDEX xxxxx */
lf_indent_suppress(file);
lf_printf(file, "#undef MY_INDEX\n");
lf_indent_suppress(file);
lf_printf(file, "#define MY_INDEX ");
print_function_name(file,
file_entry->fields[insn_name],
NULL,
function_name_prefix_itable);
lf_printf(file, "\n");
/* #define MY_PREFIX xxxxxx */
lf_indent_suppress(file);
lf_printf(file, "#undef MY_PREFIX\n");
lf_indent_suppress(file);
lf_printf(file, "#define MY_PREFIX ");
print_function_name(file,
file_entry->fields[insn_name],
expanded_bits,
function_name_prefix_none);
lf_printf(file, "\n");
}
void
print_itrace(lf *file,
table_entry *file_entry,
int idecode)
{
lf_print__external_reference(file, file_entry->line_nr, file_entry->file_name);
lf_printf(file, "ITRACE(trace_%s, (\"%s %s\\n\"));\n",
(idecode ? "idecode" : "semantics"),
(idecode ? "idecode" : "semantics"),
file_entry->fields[insn_name]);
lf_print__internal_reference(file);
}
/****************************************************************/
static void
gen_semantics_h(insn_table *table,
lf *file,
igen_code generate)
{
lf_printf(file, "typedef %s idecode_semantic\n(%s);\n",
SEMANTIC_FUNCTION_TYPE,
SEMANTIC_FUNCTION_FORMAL);
lf_printf(file, "\n");
if ((code & generate_calls)) {
if (generate_expanded_instructions)
insn_table_traverse_tree(table,
file, NULL,
1,
NULL, /* start */
print_semantic_declaration, /* leaf */
NULL, /* end */
NULL); /* padding */
else
insn_table_traverse_insn(table,
file, NULL,
print_semantic_declaration);
}
else {
lf_print__this_file_is_empty(file);
}
}
static void
gen_semantics_c(insn_table *table,
cache_table *cache_rules,
lf *file,
igen_code generate)
{
if ((code & generate_calls)) {
lf_printf(file, "\n");
lf_printf(file, "#include \"cpu.h\"\n");
lf_printf(file, "#include \"idecode.h\"\n");
lf_printf(file, "#include \"semantics.h\"\n");
lf_printf(file, "#include \"support.h\"\n");
lf_printf(file, "\n");
if (generate_expanded_instructions)
insn_table_traverse_tree(table,
file, cache_rules,
1,
NULL, /* start */
print_semantic_definition, /* leaf */
NULL, /* end */
NULL); /* padding */
else
insn_table_traverse_insn(table,
file, cache_rules,
print_semantic_definition);
}
else {
lf_print__this_file_is_empty(file);
}
}
/****************************************************************/
static void
gen_icache_h(insn_table *table,
lf *file,
igen_code generate)
{
lf_printf(file, "typedef %s idecode_icache\n(%s);\n",
ICACHE_FUNCTION_TYPE,
ICACHE_FUNCTION_FORMAL);
lf_printf(file, "\n");
if ((code & generate_calls)
&& (code & generate_with_icache)) {
insn_table_traverse_function(table,
file, NULL,
print_icache_internal_function_declaration);
if (generate_expanded_instructions)
insn_table_traverse_tree(table,
file, NULL,
1,
NULL, /* start */
print_icache_declaration, /* leaf */
NULL, /* end */
NULL); /* padding */
else
insn_table_traverse_insn(table,
file, NULL,
print_icache_declaration);
}
else {
lf_print__this_file_is_empty(file);
}
}
static void
gen_icache_c(insn_table *table,
cache_table *cache_rules,
lf *file,
igen_code generate)
{
/* output `internal' invalid/floating-point unavailable functions
where needed */
if ((code & generate_calls)
&& (code & generate_with_icache)) {
lf_printf(file, "\n");
lf_printf(file, "#include \"cpu.h\"\n");
lf_printf(file, "#include \"idecode.h\"\n");
lf_printf(file, "#include \"semantics.h\"\n");
lf_printf(file, "#include \"icache.h\"\n");
lf_printf(file, "#include \"support.h\"\n");
lf_printf(file, "\n");
insn_table_traverse_function(table,
file, NULL,
print_icache_internal_function_definition);
lf_printf(file, "\n");
if (generate_expanded_instructions)
insn_table_traverse_tree(table,
file, cache_rules,
1,
NULL, /* start */
print_icache_definition, /* leaf */
NULL, /* end */
NULL); /* padding */
else
insn_table_traverse_insn(table,
file, cache_rules,
print_icache_definition);
}
else {
lf_print__this_file_is_empty(file);
}
}
/****************************************************************/
int
main(int argc,
char **argv,
char **envp)
{
cache_table *cache_rules = NULL;
lf_file_references file_references = lf_include_references;
decode_table *decode_rules = NULL;
filter *filters = NULL;
insn_table *instructions = NULL;
char *real_file_name = NULL;
int is_header = 0;
int ch;
if (argc == 1) {
printf("Usage:\n");
printf(" igen <config-opts> ... <input-opts>... <output-opts>...\n");
printf("Config options:\n");
printf(" -F <filter-out-flag> eg -F 64 to skip 64bit instructions\n");
printf(" -E Expand (duplicate) semantic functions\n");
printf(" -I <icache-size> Generate cracking cache version\n");
printf(" -C Include semantics in cache functions\n");
printf(" -S Include insn (instruction) in icache\n");
printf(" -R Use defines to reference cache vars\n");
printf(" -L Supress line numbering in output files\n");
printf(" -B <bit-size> Set the number of bits in an instruction\n");
printf(" -H <high-bit> Set the nr of the high (msb bit)\n");
printf(" -N <nr-cpus> Specify the max number of cpus the simulation will support\n");
printf(" -J Use jumps instead of function calls\n");
printf("\n");
printf("Input options (ucase version also dumps loaded table):\n");
printf(" -o <opcode-rules>\n");
printf(" -k <cache-rules>\n");
printf(" -i <instruction-table>\n");
printf("\n");
printf("Output options:\n");
printf(" -n <real-name> Specify the real name of for the next output file\n");
printf(" -h Generate header file\n");
printf(" -c <output-file> output icache\n");
printf(" -d <output-file> output idecode\n");
printf(" -m <output-file> output model\n");
printf(" -s <output-file> output schematic\n");
printf(" -t <output-file> output itable\n");
printf(" -f <output-file> output support functions\n");
}
while ((ch = getopt(argc, argv,
"F:EI:RSLJCB:H:N:o:k:i:n:hc:d:m:s:t:f:"))
!= -1) {
fprintf(stderr, "\t-%c %s\n", ch, (optarg ? optarg : ""));
switch(ch) {
case 'C':
code |= generate_with_icache;
code |= generate_with_semantic_icache;
break;
case 'S':
code |= generate_with_icache;
code |= generate_with_insn_in_icache;
break;
case 'L':
file_references = lf_omit_references;
break;
case 'E':
generate_expanded_instructions = 1;
break;
case 'I':
icache_size = a2i(optarg);
code |= generate_with_icache;
break;
case 'N':
generate_smp = a2i(optarg);
break;
case 'R':
code |= generate_with_direct_access;
break;
case 'B':
insn_bit_size = a2i(optarg);
ASSERT(insn_bit_size > 0 && insn_bit_size <= max_insn_bit_size
&& (hi_bit_nr == insn_bit_size-1 || hi_bit_nr == 0));
break;
case 'H':
hi_bit_nr = a2i(optarg);
ASSERT(hi_bit_nr == insn_bit_size-1 || hi_bit_nr == 0);
break;
case 'F':
filters = new_filter(optarg, filters);
break;
case 'J':
code &= ~generate_calls;
code |= generate_jumps;
break;
case 'i':
if (decode_rules == NULL || cache_rules == NULL) {
fprintf(stderr, "Must specify decode and cache tables\n");
exit (1);
}
instructions = load_insn_table(optarg, decode_rules, filters);
fprintf(stderr, "\texpanding ...\n");
insn_table_expand_insns(instructions);
break;
case 'o':
decode_rules = load_decode_table(optarg, hi_bit_nr);
break;
case 'k':
cache_rules = load_cache_table(optarg, hi_bit_nr);
break;
case 'n':
real_file_name = strdup(optarg);
break;
case 'h':
is_header = 1;
break;
case 's':
case 'd':
case 'm':
case 't':
case 'f':
case 'c':
{
lf *file = lf_open(optarg, real_file_name, file_references,
(is_header ? lf_is_h : lf_is_c),
argv[0]);
lf_print__file_start(file);
ASSERT(instructions != NULL);
switch (ch) {
case 's':
if(is_header)
gen_semantics_h(instructions, file, code);
else
gen_semantics_c(instructions, cache_rules, file, code);
break;
case 'd':
if (is_header)
gen_idecode_h(file, instructions, cache_rules);
else
gen_idecode_c(file, instructions, cache_rules);
break;
case 'm':
if (is_header)
gen_model_h(instructions, file);
else
gen_model_c(instructions, file);
break;
case 't':
if (is_header)
gen_itable_h(instructions, file);
else
gen_itable_c(instructions, file);
break;
case 'f':
if (is_header)
gen_support_h(instructions, file);
else
gen_support_c(instructions, file);
break;
case 'c':
if (is_header)
gen_icache_h(instructions, file, code);
else
gen_icache_c(instructions, cache_rules, file, code);
break;
}
lf_print__file_finish(file);
lf_close(file);
is_header = 0;
}
real_file_name = NULL;
break;
default:
error("unknown option\n");
}
}
return 0;
}
|