mirror of
https://github.com/saymrwulf/xous-core.git
synced 2026-11-15 08:30:02 +00:00
add arithmetic tests
this exercises a simple stack-based routine to check that the RAMs are correctly wired. Note that due to a lack of creativity on my side, only cores 0, 1, and 3 are exercised; it's just assumed that core 2 works as well since everything is instantiated by loop.
This commit is contained in:
parent
d665805523
commit
43db94061d
3 changed files with 142 additions and 1 deletions
141
libs/xous-bio-bdma/src/bio_tests/arith.rs
Normal file
141
libs/xous-bio-bdma/src/bio_tests/arith.rs
Normal file
|
|
@ -0,0 +1,141 @@
|
|||
use crate::*;
|
||||
|
||||
pub fn stack_test() -> usize {
|
||||
print!("Stack test\r");
|
||||
// clear prior test config state
|
||||
let mut test_cfg = CSR::new(utra::csrtest::HW_CSRTEST_BASE as *mut u32);
|
||||
test_cfg.wo(utra::csrtest::WTEST, 0);
|
||||
|
||||
let mut bio_ss = BioSharedState::new();
|
||||
// stop all the machines, so that code can be loaded
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_CTRL, 0x0);
|
||||
bio_ss.load_code(stack_test0_code(), 0, BioCore::Core0);
|
||||
bio_ss.load_code(stack_test1_code(), 0, BioCore::Core1);
|
||||
bio_ss.load_code(stack_test2_code(), 0, BioCore::Core3);
|
||||
|
||||
// These actually "don't matter" because there are no synchronization instructions in the code
|
||||
// Everything runs at "full tilt"
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_QDIV0, 0x10_0000);
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_QDIV1, 0x5_8000);
|
||||
// bio_ss.bio.wo(utra::bio_bdma::SFR_QDIV2, 0x1_0000); // this machine not used in this test
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_QDIV3, 0x1_0000);
|
||||
// start the machine
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_CTRL, 0xBBB);
|
||||
|
||||
// pass two values in
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_TXF0, 3);
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_TXF0, 5);
|
||||
bio_ss.bio.wo(utra::bio_bdma::SFR_TXF0, 4);
|
||||
// wait for the computation to return
|
||||
while bio_ss.bio.rf(utra::bio_bdma::SFR_FLEVEL_PCLK_REGFIFO_LEVEL3) == 0 {}
|
||||
let result = bio_ss.bio.r(utra::bio_bdma::SFR_RXF3);
|
||||
let check = test_sum(test_sum(test_sum(3)));
|
||||
print!("Got {}\r", result);
|
||||
if result != check {
|
||||
print!("Computed {}, should be {}", result, check);
|
||||
0
|
||||
} else {
|
||||
while bio_ss.bio.rf(utra::bio_bdma::SFR_FLEVEL_PCLK_REGFIFO_LEVEL3) == 0 {}
|
||||
let result = bio_ss.bio.r(utra::bio_bdma::SFR_RXF3);
|
||||
let check = test_sum(test_sum(test_sum(5)));
|
||||
print!("Got {}\r", result);
|
||||
if result != check {
|
||||
print!("Computed {}, should be {}", result, check);
|
||||
0
|
||||
} else {
|
||||
while bio_ss.bio.rf(utra::bio_bdma::SFR_FLEVEL_PCLK_REGFIFO_LEVEL3) == 0 {}
|
||||
let result = bio_ss.bio.r(utra::bio_bdma::SFR_RXF3);
|
||||
let check = test_sum(test_sum(test_sum(4)));
|
||||
print!("Got {}\r", result);
|
||||
if result != check {
|
||||
print!("Computed {}, should be {}", result, check);
|
||||
0
|
||||
} else {
|
||||
print!("===stack test PASS===\r");
|
||||
1
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/// the recursive function implemented below
|
||||
fn test_sum(a: u32) -> u32 { if a == 0 { 0 } else { a + test_sum(a - 1) } }
|
||||
|
||||
// the recursive function above, written out in RV32 assembly and BIO entry-points
|
||||
#[rustfmt::skip]
|
||||
bio_code!(stack_test0_code, STACK_TEST0_START, STACK_TEST0_END,
|
||||
// number to sum to comes into x16
|
||||
// compute sum = N + N-1 + N-2 + ... 0
|
||||
"20:",
|
||||
"mv a0, x16", // get the argument
|
||||
"jal ra, 30f",
|
||||
"mv x17, a0", // return the value
|
||||
"j 20b", // go back for more
|
||||
"30:",
|
||||
"addi sp, sp, -8",
|
||||
"sw ra, 4(sp)",
|
||||
"sw a0, 0(sp)",
|
||||
"bne a0, x0, 40f", // recurse
|
||||
"add sp, sp, 8",
|
||||
"ret", // if a0=0, return a0=0
|
||||
"40:",
|
||||
"addi a0, a0, -1",
|
||||
"jal ra, 30b",
|
||||
"lw t0, 0(sp)",
|
||||
"add a0, t0, a0",
|
||||
"lw ra, 4(sp)",
|
||||
"add sp, sp, 8",
|
||||
"ret"
|
||||
);
|
||||
// cascade another computation on the previous result
|
||||
#[rustfmt::skip]
|
||||
bio_code!(stack_test1_code, STACK_TEST1_START, STACK_TEST1_END,
|
||||
// number to sum to comes into x16
|
||||
// compute sum = N + N-1 + N-2 + ... 0
|
||||
"20:",
|
||||
"mv a0, x17", // get the argument
|
||||
"jal ra, 30f",
|
||||
"mv x18, a0", // return the value
|
||||
"j 20b", // go back for more
|
||||
"30:",
|
||||
"addi sp, sp, -8",
|
||||
"sw ra, 4(sp)",
|
||||
"sw a0, 0(sp)",
|
||||
"bne a0, x0, 40f", // recurse
|
||||
"add sp, sp, 8",
|
||||
"ret", // if a0=0, return a0=0
|
||||
"40:",
|
||||
"addi a0, a0, -1",
|
||||
"jal ra, 30b",
|
||||
"lw t0, 0(sp)",
|
||||
"add a0, t0, a0",
|
||||
"lw ra, 4(sp)",
|
||||
"add sp, sp, 8",
|
||||
"ret"
|
||||
);
|
||||
// ...and one more time
|
||||
#[rustfmt::skip]
|
||||
bio_code!(stack_test2_code, STACK_TEST2_START, STACK_TEST2_END,
|
||||
// number to sum to comes into x16
|
||||
// compute sum = N + N-1 + N-2 + ... 0
|
||||
"20:",
|
||||
"mv a0, x18", // get the argument
|
||||
"jal ra, 30f",
|
||||
"mv x19, a0", // return the value
|
||||
"j 20b", // go back for more
|
||||
"30:",
|
||||
"addi sp, sp, -8",
|
||||
"sw ra, 4(sp)",
|
||||
"sw a0, 0(sp)",
|
||||
"bne a0, x0, 40f", // recurse
|
||||
"add sp, sp, 8",
|
||||
"ret", // if a0=0, return a0=0
|
||||
"40:",
|
||||
"addi a0, a0, -1",
|
||||
"jal ra, 30b",
|
||||
"lw t0, 0(sp)",
|
||||
"add a0, t0, a0",
|
||||
"lw ra, 4(sp)",
|
||||
"add sp, sp, 8",
|
||||
"ret"
|
||||
);
|
||||
|
|
@ -1,3 +1,4 @@
|
|||
pub mod arith;
|
||||
pub(crate) mod debug;
|
||||
pub mod i2c;
|
||||
pub mod spi;
|
||||
|
|
|
|||
|
|
@ -1,6 +1,5 @@
|
|||
use utralib::utra::bio_bdma::{SFR_EVENT_STATUS_SFR_EVENT_STATUS, SFR_FLEVEL_PCLK_REGFIFO_LEVEL1};
|
||||
|
||||
use super::report_api;
|
||||
use crate::*;
|
||||
|
||||
pub fn spi_test() -> usize {
|
||||
|
|
|
|||
Loading…
Reference in a new issue