qiurui
/
asterinas
mirror of https://github.com/asterinas/asterinas.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Remove IntervalSet::find_one unreachable code

This commit is contained in:
Hang Shu 2025-11-06 10:48:03 +00:00 committed by Chengjun Chen
parent 0fb306e0af
commit e27b16ec4b
1 changed files with 5 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
kernel/src/vm/vmar/interval_set.rs
View File

@ -70,18 +70,11 @@ where
/// that contains the point.
pub fn find_one(&self, point: &K) -> Option<&V> {
let cursor = self.btree.lower_bound(core::ops::Bound::Excluded(point));
// There's one previous element and one following element that may
// contain the point. If they don't, there's no other chances.
if let Some((_, v)) = cursor.peek_prev() {
if v.range().end > *point {
return Some(v);
}
} else if let Some((_, v)) = cursor.peek_next() {
if v.range().start <= *point {
return Some(v);
}
}
None
// There's only one previous element that may contain the point.
// If it doesn't, there's no other chances.
cursor
.peek_prev()
.and_then(|(_, v)| (v.range().end > *point).then_some(v))
}
/// Finds all interval items that intersect with the given range.