GitHub - fkay/machine_problem_5513: Freelancer MIPS

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
.gitattributes		.gitattributes
MP.txt		MP.txt
Makefile.win		Makefile.win
README.txt		README.txt
cse410-10-pipelining-a.pdf		cse410-10-pipelining-a.pdf
decode.cpp		decode.cpp
decode.h		decode.h
decode.o		decode.o
execute.cpp		execute.cpp
execute.h		execute.h
execute.o		execute.o
fetch.cpp		fetch.cpp
fetch.h		fetch.h
fetch.o		fetch.o
instruction.cpp		instruction.cpp
instruction.h		instruction.h
instruction.o		instruction.o
makefile		makefile
memaccess.cpp		memaccess.cpp
memaccess.h		memaccess.h
memaccess.o		memaccess.o
pipeline.cpp		pipeline.cpp
pipeline.dev		pipeline.dev
pipeline.exe		pipeline.exe
pipeline.layout		pipeline.layout
pipeline.o		pipeline.o
pipeline_golden		pipeline_golden
stage.cpp		stage.cpp
stage.h		stage.h
stage.o		stage.o
writeback.cpp		writeback.cpp
writeback.h		writeback.h
writeback.o		writeback.o

Repository files navigation

This implements a simple pipeline.

Code starts at address 0.
Each instruction is 4 byte
Data starts at address 1024*1024
Data is laid out in little endian form
Only integer register
All operations are on integer
32 bit registers
R0 always 0

Output:
Contents of each register, in sorted order
Contents of each address accessed in the program, in sorted order

Simulate whole program or first 1000 clock cycles whichever happens first