Проектування комп'ютера
Таненбаум Э. Архитектура компьютера.5-е изд. (+CD). - СПб.: Питер, 2007. - 844 с.
Patterson D., and Hennessy Jputer Architecture. A quantitative Approach. Second Edition. - Morgan Kaufmann Publishers, Inc., San Francisco, California, 1996. - 760 p.
Додатки
Доаток I (код програми-асемблера):
/* Assembler for LC */
#include <stdlib. h>
#include <stdio. h>
#include <string. h>
#define MAXLINELENGTH 1000
#define MAXNUMLABELS 65536
#define MAXLABELLENGTH 7 /* includes the null character termination */
#define ADD 0
#define NAND 1
#define LW 2
#define SW 3
#define BEQ 4
#define JALR 5
#define HALT 6
#define NOOP 7
#define div 8
#define imul 9
#define xidiv 10
#define andf 11
#define xorf 12
#define cmpge 13
#define jmae 14
#define jmnae 15
#define bsf 16
#define bsr 17
#define jne 18
#define push 19
#define pop 20
int readandfParse (FILE *, char *, char *, char *, char *, char *);
int translateSymbol (char labelArray [MAXNUMLABELS] [MAXLABELLENGTH], int labelAddress [MAXNUMLABELS], int, char *);
int isNumber (char *);
void testRegArg (char *);
void testAddrArg (char *);
int main (int argc, char *argv [])
{
char *inFileString, *outFileString;
FILE *inFilePtr, *outFilePtr;
int address;
char label [MAXLINELENGTH], opcode [MAXLINELENGTH], arg0 [MAXLINELENGTH],
arg1 [MAXLINELENGTH], arg2 [MAXLINELENGTH], argTmp [MAXLINELENGTH];
int i;
int numLabels=0;
int num;
int addressField;
char labelArray [MAXNUMLABELS] [MAXLABELLENGTH];
int labelAddress [MAXNUMLABELS];
if (argc! = 3) {
printf ("error: usage: %s <assembly-code-file> <machine-code-file>n",
argv [0]);
exit (1);
}
inFileString = argv [1];
outFileString = argv [2];
inFilePtr = fopen (inFileString, "r");
if (inFilePtr == NULL) {
printf ("error in opening %sn", inFileString);
exit (1);
}
outFilePtr = fopen (outFileString, "w");
if (outFilePtr == NULL) {
printf ("error in opening %sn", outFileString);
exit (1);
}
/* map symbols to addresses */
/* assume address start at 0 */
for (address=0; readandfParse (inFilePtr, label, opcode, arg0, arg1, arg2);
address++) {
/*
printf ("%d: label=%s, opcode=%s, arg0=%s, arg1=%s, arg2=%sn",
address, label, opcode, arg0, arg1, arg2);
*/
/* check for illegal opcode */
if (strcmp (opcode, "add") && strcmp (opcode, "nand") &&
strcmp (opcode, "lw") && strcmp (opcode, "sw") &&
strcmp (opcode, "beq") && strcmp (opcode, "jalr") &&
strcmp (opcode, "halt") && strcmp (opcode, "noop") &&
strcmp (opcode,". fill") && strcmp (opcode, "div") &&
strcmp (opcode, "imul") && strcmp (opcode, "xidiv") &&
strcmp (opcode, "andf") && strcmp (opcode, "xorf") &&
strcmp (opcode, "cmpge") && strcmp (opcode, "jmae") &&
strcmp (opcode, "jmnae") && strcmp (opcode, "bsr") &&
strcmp (opcode, "jne") && strcmp (opcode, "bsf") &&
strcmp (opcode, "push") && strcmp (opcode, "pop"))
{
printf ("error: unrecognized opcode %s at address %dn", opcode,
address);
exit (1);
}
/* check register fields */
if (! strcmp (opcode, "add") ||! strcmp (opcode, "nand") ||
! strcmp (opcode, "lw") ||! strcmp (opcode, "sw") ||
! strcmp (opcode, "beq") ||! strcmp (opcode, "jalr") ||
! strcmp (opcode, "div") ||! strcmp (opcode, "imul") ||
! strcmp (opcode, "xidiv") ||! strcmp (opcode, "andf") ||
! strcmp (opcode, "xorf") ||! strcmp (opcode, "cmpge") ||
! strcmp (opcode, "bsf") ||! strcmp (opcode, "bsr"))
{
testRegArg (arg0);
testRegArg (arg1);
}
if (! strcmp (opcode, "nand") ||! strcmp (opcode, "add") ||
! strcmp (opcode, "div") ||! strcmp (opcode, "imul") ||
! strcmp (opcode, "xidiv") ||! strcmp (opcode, "andf") ||
! strcmp (opcode, "xorf") ||! strcmp (opcode, "cmpge"))
{
testRegArg (arg2);
}
/* check addressField */
if (! strcmp (opcode, "lw") ||! strcmp (opcode, "sw") ||
! strcmp (opcode, "beq") ||! strcmp (opcode, "jmae") ||
! strcmp (opcode, "jmnae") ||! strcmp (opcode, "jne"))
{
testAddrArg (arg2);
}
if (! strcmp (opcode,". fill"))
{
testAddrArg (arg0);
}
/* check for enough arguments */
if ( (strcmp (opcode, "halt") && strcmp (opcode, "noop") &&
strcmp (opcode,". fill") && strcmp (opcode, "jalr") &&
strcmp (opcode, "bsf") && strcmp (opcode, "bsr") &&
strcmp (opcode, "pop") && strcmp (opcode, "push") &&
strcmp (opcode, "je") && arg2 [0] ==' ') ||
(! strcmp (opcode, "jalr") && arg1 [0] ==' ') ||
(! strcmp (opcode,". fill") && arg0 [0] ==' '))
{
printf ("error at address %d: not enough argumentsn", address);
exit (2);
}
if (label [0]! = ' ') {
/* check for labels that are too long */
if (strlen (label) >= MAXLABELLENGTH) {
printf ("label too longn");
exit (2);
}
/* make sure label starts with letter */
if (! sscanf (label, "% [a-zA-Z]", argTmp)) {
printf ("label doesn't start with lettern");
exit (2);
}
/* make sure label consists of only letters andf numbers */
sscanf (label, "% [a-zA-Z0-9]", argTmp);
if (strcmp (argTmp, label)) {
printf ("label has character other than letters andf numbersn");
exit (2);
}
/* look for duplicate label */
for (i=0; i<numLabels; i++) {
if (! strcmp (label, labelArray [i])) {
printf ("error: duplicate label %s at address %dn",
label, address);
exit (1);
}
}
/* see if there are too many labels */
if (numLabels >= MAXNUMLABELS) {
printf ("error: too many labels (label=%s) n", label);
exit (2);
}
strcpy (labelArray [numLabels], label);
labelAddress [numLabels++] = address;
}
}
for (i=0; i<numLabels; i++) {
/* printf ("%s = %dn", labelArray [i], labelAddress [i]); */
}
/* now do second pass (print machine code, with symbols filled in as
addresses) */
rewind (inFilePtr);
for (address=0; readandfParse (inFilePtr, label, opcode, arg0, arg1, arg2);
address++) {
if (! strcmp (opcode, "add")) {
num = (ADD << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "nand")) {
num = (NAND << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "div")) {
num = (div << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "imul")) {
num = (imul << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "xidiv")) {
num = (xidiv << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "andf")) {
num = (andf << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "xorf")) {
num = (xorf << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "cmpge")) {
num = (cmpge << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16) | atoi (arg2);
} else if (! strcmp (opcode, "jalr")) {
num = (JALR << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16);
} else if (! strcmp (opcode, "bsf")) {
num = (bsf << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16);
} else if (! strcmp (opcode, "push")) {
num = (push << 22);
} else if (! strcmp (opcode, "pop")) {
num = (pop << 22);
} else if (! strcmp (opcode, "halt")) {
num = (HALT << 22);
} else if (! strcmp (opcode, "noop")) {
num = (NOOP << 22);
} else if (! strcmp (opcode, "bsr")) {
num = (bsr << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16);
} else if (! strcmp (opcode, "lw") ||! strcmp (opcode, "sw") ||
! strcmp (opcode, "beq") ||! strcmp (opcode, "jmae") ||
! strcmp (opcode, "jmnae") ||! strcmp (opcode, "jne")) {
/* if arg2 is symbolic, then translate into an address */
if (! isNumber (arg2)) {
addressField = translateSymbol (labelArray, labelAddress,
numLabels, arg2);
/*
printf ("%s being translated into %dn", arg2, addressField);
*/
if (! strcmp (opcode, "beq") ||! strcmp (opcode, "jmae") ||! strcmp (opcode, "jmnae")) {
addressField = addressField-address-1;
}
} else {
addressField = atoi (arg2);
}
if (addressField < - 32768 || addressField > 32767) {
printf ("error: offset %d out of rangen", addressField);
exit (1);
}
/* truncate the offset field, in case it's negative */
addressField = addressField & 0xFFFF;
if (! strcmp (opcode, "beq")) {
num = (BEQ << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16)
| addressField;
} else if (! strcmp (opcode, "jmae")) {
num = (jmae << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16)
| (addressField);
} else if (! strcmp (opcode, "jmnae")) {
num = (jmnae << 22) | (atoi (arg0) << 19) | (atoi (arg1) << 16)
| (addressField);
} else if (! strcmp (opcode, "jne")) {
num = (jne << 22) | (addressField);
} else {
/* lw or sw */
if (! strcmp (opcode, "lw")) {
num = (LW << 22) | (atoi (arg0) << 19) |
(atoi (arg1) << 16) | addressField;
} else {
num = (SW << 22) | (atoi (arg0) << 19) |
(atoi (arg1) << 16) | addressField;
}
}
} else if (! strcmp (opcode,". fill")) {
if (! isNumber (arg0)) {
num = translateSymbol (labelArray, labelAddress, numLabels,
arg0);
} else {
num = atoi (arg0);
}
}
/* printf (" (address %d): %d (hex 0x%x) n", address, num, num); */
fprintf (outFilePtr, "%dn", num);
}
exit (0);
}
/*
* Read andf parse a line of the assembly-language file. Fields are returned
* in label, opcode, arg0, arg1, arg2 (these strings must have memory already
* allocated to them).
*
* Return values:
* 0 if reached end of file
* 1 if all went well
*
* exit (1) if line is too long.
*/
int readandfParse (FILE *inFilePtr, char *label, char *opcode, char *arg0,char *arg1, char *arg2)
{
char line [MAXLINELENGTH];
char *ptr = line;
/* delete prior values */
label [0] = opcode [0] = arg0 [0] = arg1 [0] = arg2 [0] = ' ';
/* read the line from the assembly-language file */
if (fgets (line, MAXLINELENGTH, inFilePtr) == NULL) {
/* reached end of file */
return (0);
}
/* check for line too long */
if (strlen (line) == MAXLINELENGTH-1) {
printf ("error: line too longn");
exit (1);
}
/* is there a label? */
ptr = line;
if (sscanf (ptr, "% [^tn]", label)) {
/* successfully read label; advance pointer over the label */
ptr += strlen (label);
}
/*
* Parse the rest of the line. Would be nice to have real regular
* expressions, but scanf will suffice.
*/
sscanf (ptr, "%* [tnr] % [^tnr] %* [tnr] % [^tnr] %* [tnr] % [^tnr] %* [tnr] % [^tnr] ",
opcode, arg0, arg1, arg2);
return (1);
}
int translateSymbol (char labelArray [MAXNUMLABELS] [MAXLABELLENGTH],
int labelAddress [MAXNUMLABELS], int numLabels, char *symbol)
{
int i;
/* search through address label table */
for (i=0; i<numLabels && strcmp (symbol, labelArray [i]); i++) {
}
if (i>=numLabels) {
printf ("error: missing label %sn", symbol);
exit (1);
}
return (labelAddress [i]);
}
int isNumber (char *string)
{
/* return 1 if string is a number */
int i;
return ( (sscanf (string, "%d", &i)) == 1);
}
/* Test register argument; make sure it's in range andf has no bad characters. */
void testRegArg (char *arg)
{
int num;
char c;
if (atoi (arg) < 0 || atoi (arg) > 7) {
printf ("error: register out of rangen");
exit (2);
}
if (sscanf (arg, "%d%c", &num, &c)! = 1) {
printf ("bad character in register argumentn");
exit (2);
}
}
/* Test addressField argument. */
void testAddrArg (char *arg)
{
int num;
char c;
/* test numeric addressField */
if (isNumber (arg)) {
if (sscanf (arg, "%d%c", &num, &c)! = 1) {
printf ("bad character in addressFieldn");
exit (2);
}
}
}
Додаток II (код симулятора)
/*Instruction-level simulator for the LC */
#include <stdio. h>
#include <stdlib. h>
#include <string>
#include <math. h>
#include <vector>
using namespace std;
#define NUMMEMORY 65536 /* maximum number of words in memory */
#define NUMREGS 8 /* number of machine registers */
#define MAXLINELENGTH 1000
#define STACKDEPTH 32
#define ADD 0
#define NAND 1
#define LW 2
#define SW 3
#define BEQ 4
#define JALR 5
#define HALT 6
#define NOOP 7
#define div 8
#define imul 9
#define xidiv 10
#define andf 11
#define xorf 12
#define cmpge 13
#define jmae 14
#define jmnae 15
#define bsf 16
#define bsr 17
#define jne 18
#define push 19
#define pop 20
typedef struct stateStruct {
int pc;
int mem [NUMMEMORY];
int reg [NUMREGS];
int numMemory;
vector <int> sStack;
int ZF;
} stateType;
void printState (stateType *);
void run (stateType);
int convertNum (int);
int main (int argc, char *argv [])
{
int i;
char line [MAXLINELENGTH];
stateType state;
FILE *filePtr;
if (argc! = 2) {
printf ("error: usage: %s <machine-code file>n", argv [0]);
exit (1);
}
/* initialize memories and registers */
for (i=0; i<NUMMEMORY; i++) {
state. mem [i] = 0;
}
for (i=0; i<NUMREGS; i++) {
state. reg [i] = 0;
}
state. ZF=0;
state. pc=0;
/* read machine-code file into instruction/data memory (starting at
address 0) */
filePtr = fopen (argv [1], "r");
if (filePtr == NULL) {
printf ("error: can't open file %sn", argv [1]);
perror ("fopen");
exit (1);
}
for (state. numMemory=0; fgets (line, MAXLINELENGTH, filePtr)! = NULL;
state. numMemory++) {
if (state. numMemory >= NUMMEMORY) {
printf ("exceeded memory sizen");
exit (1);
}
if (sscanf (line, "%d", state. mem+state. numMemory)! = 1) {
printf ("error in reading address %dn", state. numMemory);
exit (1);
}
printf ("memory [%d] =%dn", state. numMemory, state. mem [state. numMemory]);
}
printf ("n");
/* run never returns */
run (state);
return (0);
}
void run (stateType state)
{
int i;
int arg0, arg1, arg2, addressField;
int instructions=0;
int opcode;
int maxMem=-1; /* highest memory address touched during run */
for (; 1; instructions++) { /* infinite loop, exits when it executes halt */
printState (&state);
if (state. pc < 0 || state. pc >= NUMMEMORY) {
printf ("pc went out of the memory rangen");
exit (1);
}
maxMem = (state. pc > maxMem)? state. pc: maxMem;
/* this is to make the following code easier to read */
opcode = state. mem [state. pc] >> 22;
arg0 = (state. mem [state. pc] >> 19) & 0x7;
arg1 = (state. mem [state. pc] >> 16) & 0x7;
arg2 = state. mem [state. pc] & 0x7; /* only for add, nand */
addressField = convertNum (state. mem [state. pc] & 0xFFFF); /* for beq,
lw, sw */
state. pc++;
if (opcode == ADD) {
state. reg [arg2] = state. reg [arg0] + state. reg [arg1];
} else if (opcode == NAND) {
state. reg [arg2] = ~ (state. reg [arg0] & state. reg [arg1]);
} else if (opcode == LW) {
if (state. reg [arg0] + addressField < 0 ||
state. reg [arg0] + addressField >= NUMMEMORY) {
printf ("address out of boundsn");
exit (1);
}
state. reg [arg1] = state. mem [state. reg [arg0] + addressField];
if (state. reg [arg0] + addressField > maxMem) {
maxMem = state. reg [arg0] + addressField;
}
} else if (opcode == SW) {
if (state. reg [arg0] + addressField < 0 ||
state. reg [arg0] + addressField >= NUMMEMORY) {
printf ("address out of boundsn");
exit (1);
}
state. mem [state. reg [arg0] + addressField] = state. reg [arg1];
if (state. reg [arg0] + addressField > maxMem) {
maxMem = state. reg [arg0] + addressField;
}
} else if (opcode == BEQ) {
if (state. reg [arg0] == state. reg [arg1]) {
state. pc += addressField;
}
} else if (opcode == JALR) {
state. reg [arg1] = state. pc;
if (arg0! = 0)
state. pc = state. reg [arg0];
else
state. pc = 0;
} else if (opcode == NOOP) {
} else if (opcode == HALT) {
printf ("machine haltedn");
printf ("total of %d instructions executedn", instructions+1);
printf ("final state of machine: n");
printState (&state);
exit (0);
} else if (opcode == xidiv) {
state. reg [arg2] = state. reg [arg0] / state. reg [arg1];
state. reg [arg0] ^=state. reg [arg1] ^=state. reg [arg0] ^=state. reg [arg1];
} else if (opcode == div) {
state. reg [arg2] = (unsigned) state. reg [arg0] / (unsigned) state. reg [arg1];
} else if (opcode == imul) {
state. reg [arg2] = state. reg [arg0] * state. reg [arg1];
} else if (opcode == andf) {
state. reg [arg2] =