bjoernager/rust
bjoernager/rust
1
Fork 0
Code Issues Pull requests Activity

Remove unused HybridBitSet methods from BitSetExt.

Browse source
This commit is contained in:
Nicholas Nethercote 2024-11-23 09:03:35 +11:00
parent ded4dfde19
commit 346929cb80
2 changed files with 2 additions and 34 deletions
Download patch file Download diff file Expand all files Collapse all files

16
compiler/rustc_mir_dataflow/src/framework/lattice.rs
View file

@ -40,7 +40,7 @@
use std::iter;
use rustc_index::bit_set::{BitSet, ChunkedBitSet, HybridBitSet};
use rustc_index::bit_set::{BitSet, ChunkedBitSet};
use rustc_index::{Idx, IndexVec};
use crate::framework::BitSetExt;
@ -227,20 +227,6 @@ impl<T, S: BitSetExt<T>> BitSetExt<T> for MaybeReachable<S> {
fn contains(&self, elem: T) -> bool {
self.contains(elem)
}
fn union(&mut self, other: &HybridBitSet<T>) {
match self {
MaybeReachable::Unreachable => {}
MaybeReachable::Reachable(set) => set.union(other),
}
}
fn subtract(&mut self, other: &HybridBitSet<T>) {
match self {
MaybeReachable::Unreachable => {}
MaybeReachable::Reachable(set) => set.subtract(other),
}
}
}
impl<V: Clone> Clone for MaybeReachable<V> {

20
compiler/rustc_mir_dataflow/src/framework/mod.rs
View file

@ -35,7 +35,7 @@
use std::cmp::Ordering;
use rustc_data_structures::work_queue::WorkQueue;
use rustc_index::bit_set::{BitSet, ChunkedBitSet, HybridBitSet};
use rustc_index::bit_set::{BitSet, ChunkedBitSet};
use rustc_index::{Idx, IndexVec};
use rustc_middle::bug;
use rustc_middle::mir::{self, BasicBlock, CallReturnPlaces, Location, TerminatorEdges, traversal};
@ -63,36 +63,18 @@ pub use self::visitor::{ResultsVisitor, visit_results};
/// operations needed by all of them.
pub trait BitSetExt<T> {
fn contains(&self, elem: T) -> bool;
fn union(&mut self, other: &HybridBitSet<T>);
fn subtract(&mut self, other: &HybridBitSet<T>);
}
impl<T: Idx> BitSetExt<T> for BitSet<T> {
fn contains(&self, elem: T) -> bool {
self.contains(elem)
}
fn union(&mut self, other: &HybridBitSet<T>) {
self.union(other);
}
fn subtract(&mut self, other: &HybridBitSet<T>) {
self.subtract(other);
}
}
impl<T: Idx> BitSetExt<T> for ChunkedBitSet<T> {
fn contains(&self, elem: T) -> bool {
self.contains(elem)
}
fn union(&mut self, other: &HybridBitSet<T>) {
self.union(other);
}
fn subtract(&mut self, other: &HybridBitSet<T>) {
self.subtract(other);
}
}
/// A dataflow problem with an arbitrarily complex transfer function.