a628dc315e
* Shuffle around the wiggle crates This commit reorganizes the wiggle crates slightly by performing the following transforms: * The `crates/wiggle` crate, previously named `wiggle`, was moved to `crates/wiggle/crates/macro` and is renamed to `wiggle-macro`. * The `crates/wiggle/crates/runtime` crate, previously named `wiggle-runtime`, was moved to `crates/wiggle` and is renamed to `wiggle`. * The new `wiggle` crate depends on `wiggle-macro` and reexports the macro. The goal here is that consumers only deal with the `wiggle` crate itself. No more crates depend on `wiggle-runtime` and all dependencies are entirely on just the `wiggle` crate. * Remove the `crates/wiggle/crates` directory Move everything into `crates/wiggle` directly, like `wasi-common` * Add wiggle-macro to test-all script * Fixup a test
87 lines
2.0 KiB
Rust
87 lines
2.0 KiB
Rust
/// Represents a contiguous region in memory.
|
|
#[derive(Debug, Copy, Clone, PartialEq, Eq)]
|
|
pub struct Region {
|
|
pub start: u32,
|
|
pub len: u32,
|
|
}
|
|
|
|
impl Region {
|
|
pub fn new(start: u32, len: u32) -> Self {
|
|
Self { start, len }
|
|
}
|
|
|
|
/// Checks if this `Region` overlaps with `rhs` `Region`.
|
|
pub fn overlaps(&self, rhs: Region) -> bool {
|
|
// Zero-length regions can never overlap!
|
|
if self.len == 0 || rhs.len == 0 {
|
|
return false;
|
|
}
|
|
|
|
let self_start = self.start as u64;
|
|
let self_end = self_start + (self.len - 1) as u64;
|
|
|
|
let rhs_start = rhs.start as u64;
|
|
let rhs_end = rhs_start + (rhs.len - 1) as u64;
|
|
|
|
if self_start <= rhs_start {
|
|
self_end >= rhs_start
|
|
} else {
|
|
rhs_end >= self_start
|
|
}
|
|
}
|
|
|
|
pub fn extend(&self, times: u32) -> Self {
|
|
let len = self.len * times;
|
|
Self {
|
|
start: self.start,
|
|
len,
|
|
}
|
|
}
|
|
}
|
|
|
|
#[cfg(test)]
|
|
mod test {
|
|
use super::*;
|
|
|
|
#[test]
|
|
fn zero_length() {
|
|
let r1 = Region::new(0, 0);
|
|
let r2 = Region::new(0, 1);
|
|
assert!(!r1.overlaps(r2));
|
|
|
|
let r1 = Region::new(0, 1);
|
|
let r2 = Region::new(0, 0);
|
|
assert!(!r1.overlaps(r2));
|
|
}
|
|
|
|
#[test]
|
|
fn nonoverlapping() {
|
|
let r1 = Region::new(0, 10);
|
|
let r2 = Region::new(10, 10);
|
|
assert!(!r1.overlaps(r2));
|
|
|
|
let r1 = Region::new(10, 10);
|
|
let r2 = Region::new(0, 10);
|
|
assert!(!r1.overlaps(r2));
|
|
}
|
|
|
|
#[test]
|
|
fn overlapping() {
|
|
let r1 = Region::new(0, 10);
|
|
let r2 = Region::new(9, 10);
|
|
assert!(r1.overlaps(r2));
|
|
|
|
let r1 = Region::new(0, 10);
|
|
let r2 = Region::new(2, 5);
|
|
assert!(r1.overlaps(r2));
|
|
|
|
let r1 = Region::new(9, 10);
|
|
let r2 = Region::new(0, 10);
|
|
assert!(r1.overlaps(r2));
|
|
|
|
let r1 = Region::new(2, 5);
|
|
let r2 = Region::new(0, 10);
|
|
assert!(r1.overlaps(r2));
|
|
}
|
|
}
|