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
|
/* SPIM S20 MIPS simulator.
Dump the op.h file in a readable format to allow checking of encodings.
Copyright (c) 1990-2010, James R. Larus.
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
Neither the name of the James R. Larus nor the names of its contributors may be
used to endorse or promote products derived from this software without specific
prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdio.h>
typedef struct inst_t
{
char *opcode;
union
{
unsigned int x;
struct
{
unsigned int funct:6;
unsigned int pad:10;
unsigned int rt:5;
unsigned int rs:5;
unsigned int op:6;
} f;
};
} inst;
#define OP(a, b, c, d) {a, d},
inst ops [] = {
#include "op.h"
};
int
compare_ops (inst *p1, inst *p2)
{
if (p1->f.op < p2->f.op)
return (-1);
else if (p1->f.op > p2->f.op)
return (1);
else
{
if (p1->f.rs < p2->f.rs)
return (-1);
else if (p1->f.rs > p2->f.rs)
return (1);
else
{
if (p1->f.rt < p2->f.rt)
return (-1);
else if (p1->f.rt > p2->f.rt)
return (1);
else
{
if (p1->f.funct < p2->f.funct)
return (-1);
else if (p1->f.funct > p2->f.funct)
return (1);
else
return 0;
}
}
}
}
main (int argc, char** argv)
{
/* Remove pseudo ops (opcode == -1) from table */
int empty, next;
for (empty = 0, next = 0; next < (sizeof(ops) / sizeof(ops[0])); next += 1)
{
if (-1 == ops[next].x)
{
}
else
{
ops[empty] = ops[next];
empty += 1;
}
}
/* Radix sort instructions by field: op, rs, rt, funct */
qsort (ops, empty, sizeof(ops[0]), compare_ops);
/* Print related instructions in groups */
int i;
for (i = 0; i < empty; i += 1)
{
if (0 < i && ops[i - 1].f.op != ops[i].f.op)
printf ("\n");
printf ("%10s op=%2d rs=%2d rt=%2d funct=%02x 0x%08x\n",
ops[i].opcode,
ops[i].f.op,
ops[i].f.rs,
ops[i].f.rt,
ops[i].f.funct,
ops[i].x);
}
}
|
