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
|
// 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(associated_consts)]
pub mod isa;
pub mod binary;
pub mod memory;
pub mod simulator;
#[test]
fn it_works() {
use std::path::Path;
match binary::Binary::new_from_hex_file(Path::new("../riscv/kernel.hex")) {
Ok(b) => {
let mut simulator = simulator::Simulator::new(1, b);
simulator.run();
},
Err(err) => println!("Error: {:?}", err),
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn cache_address_parsing() {
let dm_cache_word = memory::Cache::new(4, 1, 1);
let dm_cache_doubleword = memory::Cache::new(4, 1, 2);
let fa_cache_doubleword = memory::Cache::new(1, 4, 2);
assert_eq!(dm_cache_word.parse_address(0xFFFFFFFD),
(0xFFFFFFF, 3, 1));
assert_eq!(dm_cache_doubleword.parse_address(0xFFFFFFFD),
(0x7FFFFFF, 3, 5));
assert_eq!(fa_cache_doubleword.parse_address(0xFFFFFFFD),
(0x1FFFFFFF, 0, 5));
}
}
|
