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
|
// Copyright 2015 David Li
// This file is part of rustv.
// rustv 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 3 of the License, or
// (at your option) any later version.
// rustv 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 rustv. If not, see <http://www.gnu.org/licenses/>.
#![feature(step_by)]
pub mod isa;
pub mod binary;
pub mod memory;
pub mod simulator;
#[test]
fn it_works() {
use std::rc::Rc;
use std::cell::RefCell;
use std::path::Path;
match binary::Binary::new_from_hex_file(Path::new("../riscv/kernel.hex")) {
Ok(b) => {
let memory = memory::Memory::new_from_binary(0x2000, b);
let memory_ref = Rc::new(RefCell::new(Box::new(memory) as Box<memory::MemoryInterface>));
let cache = Rc::new( RefCell::new( Box::new( memory::DirectMappedCache::new(4, 4, memory_ref.clone())) as Box<memory::MemoryInterface>) );
let core = simulator::Core::new(cache.clone());
let mut simulator = simulator::Simulator::new(vec![core], memory_ref.clone());
simulator.run();
},
Err(err) => println!("Error: {:?}", err),
}
}
#[cfg(test)]
mod tests {
#[test]
fn cache_address_parsing() {
use memory::*;
use std::rc::Rc;
use std::cell::RefCell;
let memory = Memory::new(16);
let memory_ref = Rc::new(RefCell::new(Box::new(memory) as Box<MemoryInterface>));
let dm_cache_word = DirectMappedCache::new(4, 1, memory_ref.clone());
let dm_cache_doubleword = DirectMappedCache::new(4, 2, memory_ref.clone());
assert_eq!(dm_cache_word.parse_address(0xFFFFFFFD),
(0xFFFFFFF, 3, 1));
assert_eq!(dm_cache_doubleword.parse_address(0xFFFFFFFD),
(0x7FFFFFF, 3, 5));
}
#[test]
fn memory_rw() {
use std::rc::Rc;
use std::cell::RefCell;
use memory::*;
let size = 0xFF;
let mut memory = Memory::new(size);
assert_eq!(memory.write_word(0, 0xF0),
Err(MemoryError::InvalidAddress));
assert_eq!(memory.write_byte(0, 0xF0),
Err(MemoryError::InvalidAddress));
assert_eq!(memory.write_byte(1, 0xF0),
Err(MemoryError::InvalidAddress));
assert_eq!(memory.write_byte(2, 0xF0),
Err(MemoryError::InvalidAddress));
for address in (4..size).step_by(4) {
assert_eq!(memory.write_word(address, 0xF0), Ok(()));
assert_eq!(memory.read_word(address), Ok(0xF0));
}
assert_eq!(memory.write_word(0x10, 0x01234567), Ok(()));
assert_eq!(memory.write_word(0x14, 0xDEADBEEF), Ok(()));
assert_eq!(memory.read_byte(0x10), Ok(0x67));
assert_eq!(memory.read_byte(0x11), Ok(0x45));
assert_eq!(memory.read_byte(0x12), Ok(0x23));
assert_eq!(memory.read_byte(0x13), Ok(0x01));
let stall = memory.latency();
let memory_box = Box::new(memory) as Box<MemoryInterface>;
let memory_ref = Rc::new(RefCell::new(memory_box));
let mut dm_cache = DirectMappedCache::new(4, 4, memory_ref.clone());
assert_eq!(dm_cache.read_word(0x10), Err(MemoryError::CacheMiss {
stall_cycles: stall,
}));
for _ in 0..100 {
dm_cache.step();
}
assert_eq!(dm_cache.read_word(0x10), Ok(0x01234567));
assert_eq!(dm_cache.read_word(0x14), Ok(0xDEADBEEF));
assert_eq!(dm_cache.read_word(0x18), Ok(0xF0));
assert_eq!(dm_cache.read_word(0x1C), Ok(0xF0));
assert_eq!(dm_cache.read_byte(0x10), Ok(0x67));
assert_eq!(dm_cache.read_byte(0x11), Ok(0x45));
assert_eq!(dm_cache.read_byte(0x12), Ok(0x23));
assert_eq!(dm_cache.read_byte(0x13), Ok(0x01));
assert_eq!(dm_cache.write_word(0x18, 0xBEEFBEEF), Ok(()));
assert_eq!(dm_cache.read_word(0x18), Ok(0xBEEFBEEF));
assert_eq!(memory_ref.borrow_mut().read_word(0x18), Ok(0xBEEFBEEF));
}
}
|
