wasmtime 24.0.0 → 25.0.0

data/ext/cargo-vendor/cranelift-bitset-0.112.0/src/scalar.rs

@@ -0,0 +1,626 @@
+//! Scalar bitsets.
+
+use core::mem::size_of;
+use core::ops::{Add, BitAnd, BitOr, Not, Shl, Shr, Sub};
+
+/// A small bitset built on top of a single primitive integer type.
+///
+/// # Example
+///
+/// ```
+/// use cranelift_bitset::ScalarBitSet;
+///
+/// // Create a new bitset backed with a `u32`.
+/// let mut bitset = ScalarBitSet::<u32>::new();
+///
+/// // Bitsets are initially empty.
+/// assert!(bitset.is_empty());
+/// assert_eq!(bitset.len(), 0);
+///
+/// // Insert into the bitset.
+/// bitset.insert(4);
+/// bitset.insert(5);
+/// bitset.insert(6);
+///
+/// // Now the bitset is not empty.
+/// assert_eq!(bitset.len(), 3);
+/// assert!(!bitset.is_empty());
+/// assert!(bitset.contains(4));
+/// assert!(bitset.contains(5));
+/// assert!(bitset.contains(6));
+///
+/// // Remove an element from the bitset.
+/// let was_present = bitset.remove(6);
+/// assert!(was_present);
+/// assert!(!bitset.contains(6));
+/// assert_eq!(bitset.len(), 2);
+///
+/// // Can iterate over the elements in the set.
+/// let elems: Vec<_> = bitset.iter().collect();
+/// assert_eq!(elems, [4, 5]);
+/// ```
+#[derive(Clone, Copy, PartialEq, Eq)]
+#[cfg_attr(
+    feature = "enable-serde",
+    derive(serde_derive::Serialize, serde_derive::Deserialize)
+)]
+pub struct ScalarBitSet<T>(pub T);
+
+impl<T> core::fmt::Debug for ScalarBitSet<T>
+where
+    T: ScalarBitSetStorage,
+{
+    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
+        let mut s = f.debug_struct(core::any::type_name::<Self>());
+        for i in 0..Self::capacity() {
+            use alloc::string::ToString;
+            let i = u8::try_from(i).unwrap();
+            s.field(&i.to_string(), &self.contains(i));
+        }
+        s.finish()
+    }
+}
+
+impl<T> Default for ScalarBitSet<T>
+where
+    T: ScalarBitSetStorage,
+{
+    #[inline]
+    fn default() -> Self {
+        Self::new()
+    }
+}
+
+impl<T> ScalarBitSet<T>
+where
+    T: ScalarBitSetStorage,
+{
+    /// Create a new, empty bitset.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let bitset = ScalarBitSet::<u64>::new();
+    ///
+    /// assert!(bitset.is_empty());
+    /// ```
+    #[inline]
+    pub fn new() -> Self {
+        Self(T::from(0))
+    }
+
+    /// Construct a bitset with the half-open range `[lo, hi)` inserted.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let bitset = ScalarBitSet::<u64>::from_range(3, 6);
+    ///
+    /// assert_eq!(bitset.len(), 3);
+    ///
+    /// assert!(bitset.contains(3));
+    /// assert!(bitset.contains(4));
+    /// assert!(bitset.contains(5));
+    /// ```
+    ///
+    /// # Panics
+    ///
+    /// Panics if `lo > hi` or if `hi > Self::capacity()`.
+    ///
+    /// ```should_panic
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// // The lower bound may not be larger than the upper bound.
+    /// let bitset = ScalarBitSet::<u64>::from_range(6, 3);
+    /// ```
+    ///
+    /// ```should_panic
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// // The bounds must fit within the backing scalar type.
+    /// let bitset = ScalarBitSet::<u64>::from_range(3, 69);
+    /// ```
+    #[inline]
+    pub fn from_range(lo: u8, hi: u8) -> Self {
+        assert!(lo <= hi);
+        assert!(hi <= Self::capacity());
+
+        let one = T::from(1);
+
+        // We can't just do (one << hi) - one here as the shift may overflow
+        let hi_rng = if hi >= 1 {
+            (one << (hi - 1)) + ((one << (hi - 1)) - one)
+        } else {
+            T::from(0)
+        };
+
+        let lo_rng = (one << lo) - one;
+
+        Self(hi_rng - lo_rng)
+    }
+
+    /// The maximum number of bits that can be stored in this bitset.
+    ///
+    /// If you need more bits than this, use a
+    /// [`CompoundBitSet`][crate::CompoundBitSet] instead of a `ScalarBitSet`.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// assert_eq!(ScalarBitSet::<u8>::capacity(), 8);
+    /// assert_eq!(ScalarBitSet::<u64>::capacity(), 64);
+    /// ```
+    #[inline]
+    pub fn capacity() -> u8 {
+        u8::try_from(size_of::<T>()).unwrap() * 8
+    }
+
+    /// Get the number of elements in this set.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u64>::new();
+    ///
+    /// assert_eq!(bitset.len(), 0);
+    ///
+    /// bitset.insert(24);
+    /// bitset.insert(13);
+    /// bitset.insert(36);
+    ///
+    /// assert_eq!(bitset.len(), 3);
+    /// ```
+    #[inline]
+    pub fn len(&self) -> u8 {
+        self.0.count_ones()
+    }
+
+    /// Is this bitset empty?
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u16>::new();
+    ///
+    /// assert!(bitset.is_empty());
+    ///
+    /// bitset.insert(10);
+    ///
+    /// assert!(!bitset.is_empty());
+    /// ```
+    #[inline]
+    pub fn is_empty(&self) -> bool {
+        self.0 == T::from(0)
+    }
+
+    /// Check whether this bitset contains `i`.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u8>::new();
+    ///
+    /// assert!(!bitset.contains(7));
+    ///
+    /// bitset.insert(7);
+    ///
+    /// assert!(bitset.contains(7));
+    /// ```
+    ///
+    /// # Panics
+    ///
+    /// Panics if `i` is greater than or equal to [`Self::capacity()`][Self::capacity].
+    ///
+    /// ```should_panic
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u8>::new();
+    ///
+    /// // A `ScalarBitSet<u8>` can only hold the elements `0..=7`, so `8` is
+    /// // out of bounds and will trigger a panic.
+    /// bitset.contains(8);
+    /// ```
+    #[inline]
+    pub fn contains(&self, i: u8) -> bool {
+        assert!(i < Self::capacity());
+        self.0 & (T::from(1) << i) != T::from(0)
+    }
+
+    /// Insert `i` into this bitset.
+    ///
+    /// Returns whether the value was newly inserted. That is:
+    ///
+    /// * If the set did not previously contain `i` then `true` is returned.
+    ///
+    /// * If the set already contained `i` then `false` is returned.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u8>::new();
+    ///
+    /// // When an element is inserted that was not already present in the set,
+    /// // then `true` is returned.
+    /// let is_new = bitset.insert(7);
+    /// assert!(is_new);
+    ///
+    /// // The element is now present in the set.
+    /// assert!(bitset.contains(7));
+    ///
+    /// // And when the element is already in the set, `false` is returned from
+    /// // `insert`.
+    /// let is_new = bitset.insert(7);
+    /// assert!(!is_new);
+    /// ```
+    ///
+    /// # Panics
+    ///
+    /// Panics if `i` is greater than or equal to [`Self::capacity()`][Self::capacity].
+    ///
+    /// ```should_panic
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u32>::new();
+    ///
+    /// // A `ScalarBitSet<u32>` can only hold the elements `0..=31`, so `42` is
+    /// // out of bounds and will trigger a panic.
+    /// bitset.insert(42);
+    /// ```
+    #[inline]
+    pub fn insert(&mut self, i: u8) -> bool {
+        let is_new = !self.contains(i);
+        self.0 = self.0 | (T::from(1) << i);
+        is_new
+    }
+
+    /// Remove `i` from this bitset.
+    ///
+    /// Returns whether `i` was previously in this set or not.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u128>::new();
+    ///
+    /// // Removing an element that was not present in the set returns `false`.
+    /// let was_present = bitset.remove(100);
+    /// assert!(!was_present);
+    ///
+    /// // And when the element was in the set, `true` is returned.
+    /// bitset.insert(100);
+    /// let was_present = bitset.remove(100);
+    /// assert!(was_present);
+    /// ```
+    ///
+    /// # Panics
+    ///
+    /// Panics if `i` is greater than or equal to [`Self::capacity()`][Self::capacity].
+    ///
+    /// ```should_panic
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u16>::new();
+    ///
+    /// // A `ScalarBitSet<u16>` can only hold the elements `0..=15`, so `20` is
+    /// // out of bounds and will trigger a panic.
+    /// bitset.remove(20);
+    /// ```
+    #[inline]
+    pub fn remove(&mut self, i: u8) -> bool {
+        let was_present = self.contains(i);
+        self.0 = self.0 & !(T::from(1) << i);
+        was_present
+    }
+
+    /// Remove all entries from this bitset.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u32>::new();
+    ///
+    /// bitset.insert(10);
+    /// bitset.insert(20);
+    /// bitset.insert(30);
+    ///
+    /// bitset.clear();
+    ///
+    /// assert!(bitset.is_empty());
+    /// ```
+    #[inline]
+    pub fn clear(&mut self) {
+        self.0 = T::from(0);
+    }
+
+    /// Remove and return the smallest value in the bitset.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u64>::new();
+    ///
+    /// bitset.insert(0);
+    /// bitset.insert(24);
+    /// bitset.insert(13);
+    /// bitset.insert(36);
+    ///
+    /// assert_eq!(bitset.pop_min(), Some(0));
+    /// assert_eq!(bitset.pop_min(), Some(13));
+    /// assert_eq!(bitset.pop_min(), Some(24));
+    /// assert_eq!(bitset.pop_min(), Some(36));
+    /// assert_eq!(bitset.pop_min(), None);
+    /// ```
+    #[inline]
+    pub fn pop_min(&mut self) -> Option<u8> {
+        let min = self.min()?;
+        self.remove(min);
+        Some(min)
+    }
+
+    /// Remove and return the largest value in the bitset.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u64>::new();
+    ///
+    /// bitset.insert(0);
+    /// bitset.insert(24);
+    /// bitset.insert(13);
+    /// bitset.insert(36);
+    ///
+    /// assert_eq!(bitset.pop_max(), Some(36));
+    /// assert_eq!(bitset.pop_max(), Some(24));
+    /// assert_eq!(bitset.pop_max(), Some(13));
+    /// assert_eq!(bitset.pop_max(), Some(0));
+    /// assert_eq!(bitset.pop_max(), None);
+    /// ```
+    #[inline]
+    pub fn pop_max(&mut self) -> Option<u8> {
+        let max = self.max()?;
+        self.remove(max);
+        Some(max)
+    }
+
+    /// Return the smallest number contained in this bitset or `None` if this
+    /// bitset is empty.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u64>::new();
+    ///
+    /// // When the bitset is empty, `min` returns `None`.
+    /// assert_eq!(bitset.min(), None);
+    ///
+    /// bitset.insert(28);
+    /// bitset.insert(1);
+    /// bitset.insert(63);
+    ///
+    /// // When the bitset is not empty, it returns the smallest element.
+    /// assert_eq!(bitset.min(), Some(1));
+    /// ```
+    #[inline]
+    pub fn min(&self) -> Option<u8> {
+        if self.0 == T::from(0) {
+            None
+        } else {
+            Some(self.0.trailing_zeros())
+        }
+    }
+
+    /// Return the largest number contained in the bitset or None if this bitset
+    /// is empty
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u64>::new();
+    ///
+    /// // When the bitset is empty, `max` returns `None`.
+    /// assert_eq!(bitset.max(), None);
+    ///
+    /// bitset.insert(0);
+    /// bitset.insert(36);
+    /// bitset.insert(49);
+    ///
+    /// // When the bitset is not empty, it returns the smallest element.
+    /// assert_eq!(bitset.max(), Some(49));
+    /// ```
+    #[inline]
+    pub fn max(&self) -> Option<u8> {
+        if self.0 == T::from(0) {
+            None
+        } else {
+            let leading_zeroes = self.0.leading_zeros();
+            Some(Self::capacity() - leading_zeroes - 1)
+        }
+    }
+
+    /// Iterate over the items in this set.
+    ///
+    /// Items are always yielded in sorted order.
+    ///
+    /// # Example
+    ///
+    /// ```
+    /// use cranelift_bitset::ScalarBitSet;
+    ///
+    /// let mut bitset = ScalarBitSet::<u64>::new();
+    ///
+    /// bitset.insert(19);
+    /// bitset.insert(3);
+    /// bitset.insert(63);
+    /// bitset.insert(0);
+    ///
+    /// assert_eq!(
+    ///     bitset.iter().collect::<Vec<_>>(),
+    ///     [0, 3, 19, 63],
+    /// );
+    /// ```
+    #[inline]
+    pub fn iter(self) -> Iter<T> {
+        Iter { bitset: self }
+    }
+}
+
+impl<T> IntoIterator for ScalarBitSet<T>
+where
+    T: ScalarBitSetStorage,
+{
+    type Item = u8;
+
+    type IntoIter = Iter<T>;
+
+    #[inline]
+    fn into_iter(self) -> Self::IntoIter {
+        self.iter()
+    }
+}
+
+impl<'a, T> IntoIterator for &'a ScalarBitSet<T>
+where
+    T: ScalarBitSetStorage,
+{
+    type Item = u8;
+
+    type IntoIter = Iter<T>;
+
+    #[inline]
+    fn into_iter(self) -> Self::IntoIter {
+        self.iter()
+    }
+}
+
+impl<T: ScalarBitSetStorage> From<T> for ScalarBitSet<T> {
+    fn from(bits: T) -> Self {
+        Self(bits)
+    }
+}
+
+/// A trait implemented by all integers that can be used as the backing storage
+/// for a [`ScalarBitSet`].
+///
+/// You shouldn't have to implement this yourself, it is already implemented for
+/// `u{8,16,32,64,128}` and if you need more bits than that, then use
+/// [`CompoundBitSet`][crate::CompoundBitSet] instead.
+pub trait ScalarBitSetStorage:
+    Default
+    + From<u8>
+    + Shl<u8, Output = Self>
+    + Shr<u8, Output = Self>
+    + BitAnd<Output = Self>
+    + BitOr<Output = Self>
+    + Not<Output = Self>
+    + Sub<Output = Self>
+    + Add<Output = Self>
+    + PartialEq
+    + Copy
+{
+    /// Count the number of leading zeros.
+    fn leading_zeros(self) -> u8;
+
+    /// Count the number of trailing zeros.
+    fn trailing_zeros(self) -> u8;
+
+    /// Count the number of bits set in this integer.
+    fn count_ones(self) -> u8;
+}
+
+macro_rules! impl_storage {
+    ( $int:ty ) => {
+        impl ScalarBitSetStorage for $int {
+            fn leading_zeros(self) -> u8 {
+                u8::try_from(self.leading_zeros()).unwrap()
+            }
+
+            fn trailing_zeros(self) -> u8 {
+                u8::try_from(self.trailing_zeros()).unwrap()
+            }
+
+            fn count_ones(self) -> u8 {
+                u8::try_from(self.count_ones()).unwrap()
+            }
+        }
+    };
+}
+
+impl_storage!(u8);
+impl_storage!(u16);
+impl_storage!(u32);
+impl_storage!(u64);
+impl_storage!(u128);
+impl_storage!(usize);
+
+/// An iterator over the elements in a [`ScalarBitSet`].
+pub struct Iter<T> {
+    bitset: ScalarBitSet<T>,
+}
+
+impl<T> Iterator for Iter<T>
+where
+    T: ScalarBitSetStorage,
+{
+    type Item = u8;
+
+    #[inline]
+    fn next(&mut self) -> Option<u8> {
+        self.bitset.pop_min()
+    }
+}
+
+impl<T> DoubleEndedIterator for Iter<T>
+where
+    T: ScalarBitSetStorage,
+{
+    #[inline]
+    fn next_back(&mut self) -> Option<Self::Item> {
+        self.bitset.pop_max()
+    }
+}
+
+impl<T> ExactSizeIterator for Iter<T>
+where
+    T: ScalarBitSetStorage,
+{
+    #[inline]
+    fn len(&self) -> usize {
+        usize::from(self.bitset.len())
+    }
+}
+
+#[cfg(feature = "arbitrary")]
+impl<'a, T> arbitrary::Arbitrary<'a> for ScalarBitSet<T>
+where
+    T: ScalarBitSetStorage + arbitrary::Arbitrary<'a>,
+{
+    fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result<Self> {
+        T::arbitrary(u).map(Self)
+    }
+}

data/ext/cargo-vendor/cranelift-codegen-0.112.0/.cargo-checksum.json

@@ -0,0 +1 @@
+{"files":{"Cargo.toml":"fed6a0fda266101ad28d9695cc7a6c1f4bd5dbd4617464bd65d783cedfac8ef9","LICENSE":"268872b9816f90fd8e85db5a28d33f8150ebb8dd016653fb39ef1f94f2686bc5","README.md":"e5127227a7db4a8aa92fa6613ed71801025790e696bb41b0323fb7f3c6f7495a","benches/x64-evex-encoding.rs":"d44fe0567d4a2b8a9dd2e1daf0994601918f4853dcd073c8c99c15e40d6297c9","build.rs":"bf140336aa63a47e861dceac18ef5621d4c1c514637797299bb4d3555e451e1a","src/alias_analysis.rs":"3f46da1f44e31e8e06e2b963ed36efb5bad422d51ce312a130ba2dfa9dad9338","src/binemit/mod.rs":"9111acf47bb83a1c407e016db9432fa9a7aea2a4f9774398ec1058710abe1507","src/cfg_printer.rs":"7aeee3150cf32695ef3ff658142e08921ee90bd8bf526c9cabd28dc7acd318d0","src/constant_hash.rs":"8f53afb38891fbdab8553c7a89e61f0ce30947a22fb24ae84523c9a1ab025c3f","src/context.rs":"c1a85614ff09ce78ba5813fdbcc498960510cb0ed4d3427573d0aa9df1fae340","src/ctxhash.rs":"2ce7282cd3f7a99effa7090a9d5937e6699cc2901b59c32aa6a1ca644ee14c27","src/cursor.rs":"babf745cbf4785cd310c2848661315f5de2ee1da24220145c7839b637a57094f","src/data_value.rs":"a921966558d95baf975f12004667526949b0b9503937a2d13c9646a89ff7cf23","src/dbg.rs":"333ebc4fd0ac5ade2b129eef44a64a9c554718431dc78f22c9e11ffbd8eea342","src/dominator_tree.rs":"008e51c64bbe26a315677c24e0a40dfece5834f62cf3b6fbb73a34e9eecfa1fa","src/egraph.rs":"4314e61f5077c5cf6796c14636d9e9271992c574ecf988acecfa1b40301d6c69","src/egraph/cost.rs":"19ad392d4f7a93dd8d2763a8c78c0c696939377185096e62029d164bf34a4e46","src/egraph/elaborate.rs":"dfce1b2bc4aadc4c8de108c539796319c79e3e21877f223e4c4283d6947d70b4","src/flowgraph.rs":"24d62568ea09885cfb4a32437ef4d9e639f80749c80ebb7115f75d99d8ba604e","src/incremental_cache.rs":"79fa916cc8841912e22b95fdb38cb4d8dd4670898812d8a79a8fc699b3149f34","src/inst_predicates.rs":"cc2799beafa460397cb3c03b3e80263a317d5adfba0d658e0cfb4a043b4d9887","src/ir/atomic_rmw_op.rs":"f4bb1aba71533f50a27e0da76e22d06bf02e0a6af5bf77401576b5598b7d2725","src/ir/builder.rs":"6aa97b66754fc7476032d897813b0ed321044df11ae9019ba91260ce74384d9c","src/ir/condcodes.rs":"a03c9c208bb42e91c8f913c1ca556a7aeed17f1f99d40d68776c7680aa3af440","src/ir/constant.rs":"6dd36b8e2e2738c88bb5295677473eccd03cdc23bf8134641104ccee4028042c","src/ir/dfg.rs":"72796d88cc29bd575fddaebfaff974ecd0246f33208edd269cbeca2bfb4799a5","src/ir/dynamic_type.rs":"d9414af46a4f8bf598786948d33f53bd87b0cf0c01185a2774302c2fd2bb5376","src/ir/entities.rs":"2060005c5f77168bd6cf8396ecd063ca3e48e16857cca9b07a08a4c1e9f30c2b","src/ir/extfunc.rs":"2e6b3fe09c137853a7df64ee5d7d6e7d2a9fb55ff0e3d06955e4c8c797c22793","src/ir/extname.rs":"cc07a1baf6dd4c584b25b329e5213e9805a7e8529e07caa4b326dee0a97e845a","src/ir/function.rs":"0ea2ac359fb84a167e3d1755c593eb1fc369aa52fdbbbf88165fca9ab8009d3e","src/ir/globalvalue.rs":"5b8827bda454a61bbdb891914fefb9e0a430d7fa91585a9920492561e9a66391","src/ir/immediates.rs":"0a056a489ee0726149beab5f1170f9979ee2fd6df56dcc4feaa737be0e1d95e8","src/ir/instructions.rs":"f6950e7f6a8b7361089a1b7e8cf3dc10bda92088df3b678358afb658cca4aac1","src/ir/jumptable.rs":"80a27e75d620215482664a44d622c99ffd555af689e5886534421abf157caf46","src/ir/known_symbol.rs":"daad9ff92b224fae0ab3553e7366675830556b146933fec6946c697d635bf48a","src/ir/layout.rs":"a78335c797b6035f37f362b1d67520bab71dde7043a8ac5fc4ace77936986516","src/ir/libcall.rs":"7e3a55e8cf7401630f9818ea3dfa845f1af1c3e8f1d8dcb587f5df15fb996b4c","src/ir/memflags.rs":"e6174db77059855cc53cc233926c11f2f088b1006c4d9d74ba4eccf785aec223","src/ir/memtype.rs":"44153dd83b66caf2a9bfca9d1fc60719aa50685f318c997859293691d6697b5e","src/ir/mod.rs":"18beb1b78ea05588fc9af12324437bfa46c93511b7d1fc52eeb4af3ab25b10ad","src/ir/pcc.rs":"0eb1f13a6d6829db28691a849dfff3973b49b4f52dd4dff14c7e5ae432070794","src/ir/progpoint.rs":"4c03b2fbebcb8d5af8ff8effd353b9ca66fb5551eaf2434376617390c66047a8","src/ir/sourceloc.rs":"a4f2d0e51c50d9caab15f493999cb12916d525600de638b43e6f0b785b856404","src/ir/stackslot.rs":"4255305e0521a6afb73f6189ce0e0c971df745d6a9e411172bb9b5a5fc29e0b9","src/ir/trapcode.rs":"369600ee2d6ec8d1b9d4edc3a5a90d6a22c261268b945cd1748822047e967701","src/ir/types.rs":"b5e3bc6e1be08d33ccdb348bc0144f77db07b1db6a8d331341e0a8714cbf4953","src/ir/user_stack_maps.rs":"f8eae1999d149d07cdea97e4a538e43b75a5cd68786dbc3ec453c9b41feb1a3e","src/isa/aarch64/abi.rs":"9d0e789f935d14547988fea53d91314509384393d43c82a80f03baa4c84e2cab","src/isa/aarch64/inst.isle":"01f598d3e73e1ee8b28f474269af0a32ac7e2f7fc218a3286d2a6afc998e2ff4","src/isa/aarch64/inst/args.rs":"d7ed939496ea0d4ca371ad08c898e2611690b32276d221f7bff8475f46bbf907","src/isa/aarch64/inst/emit.rs":"238dea64fe35d8431ce8f964aaacadfb023353a7f375cbdbc6555d1b900146ff","src/isa/aarch64/inst/emit_tests.rs":"c5af8a64b28e16d45b5070c586fd163f7016fd439a7c6a268155e0b1fe2b0de6","src/isa/aarch64/inst/imms.rs":"6cf991147f681433921718f9c9f6b70fe940678300235e8230923204be27c1db","src/isa/aarch64/inst/mod.rs":"223cf9a98c876048c9469c33743335b1a307802978da9ada2e3ecddd69b88e09","src/isa/aarch64/inst/regs.rs":"14c43d0d7af38b97ff5c804695121958193cd567d55f0dcd005a138aabd0d8ea","src/isa/aarch64/inst/unwind.rs":"0d06a94e614794057f224554060c8d6e0da0a01e021b92c33a1dbb3854b414f6","src/isa/aarch64/inst/unwind/systemv.rs":"77edc0d8964a54b4eaa6413c84dfa5f1d748c58c089adf6810b89aa13a7a6d76","src/isa/aarch64/inst_neon.isle":"7c41eccc1808a0daecb5d1406a1ec3292904341cfacc4dd40bb1da7e3d932159","src/isa/aarch64/lower.isle":"f48bbd8027d3310e685ad3d7fcfc5613fca79b76a866a6d1488e3a839f61163b","src/isa/aarch64/lower.rs":"093ff5c1b1a44575a93d3d2fea45b5cfbb0d2e388805517d0ed9c9675201a5f0","src/isa/aarch64/lower/isle.rs":"890a2afc4caf68d676a4810e0972166a277a90d0a82a7094727c88766afed48c","src/isa/aarch64/lower/isle/generated_code.rs":"14eb64ead3efe928bea2d25438afe938f234b8202f912e11800a8c5687e3335d","src/isa/aarch64/lower_dynamic_neon.isle":"3ec49bfb7f99d00abda7ac37c9d801b61579381f7a436837a73fcb9209683e2b","src/isa/aarch64/mod.rs":"fc7859fb8714701ca5124726c31caf5a6276d03bf994c19937fa3519e57f970e","src/isa/aarch64/pcc.rs":"734a6ef1d32c9b9816fbe9aa7607f20d4a143f57f899cd38622fbd2c0d68ba34","src/isa/aarch64/settings.rs":"e0a1decd458bb18bb49051058c76f226786effb2ac28df1eb77a4f51baf8a491","src/isa/call_conv.rs":"182a0170743cf48266918d798d637c9c30e0d8aae7fdc64564a14c3d90b0576d","src/isa/mod.rs":"63e244ae1a0194d94bb0b8ae24433b411415c20a2902da78c1107b48da9b5636","src/isa/pulley32.rs":"2f3c4118f59478ab67ce0ada7466d61cb6abbc6335056b4b9749b642210d4ca0","src/isa/pulley64.rs":"add7db7131a8078bee82171487d9136f94b7c6493992d03e86edac16a98f9a3c","src/isa/pulley_shared/abi.rs":"4168edaf98563e79b630367fd81890874169b1cf7ab41192286516ce6e60986c","src/isa/pulley_shared/inst.isle":"37ed707ab4f55927f7993a79340a0052b2e72659ff10552b01bf0f4399f2e142","src/isa/pulley_shared/inst/args.rs":"74b94cbc8149873c6dd44f59f066ae2d05b8e707dea3ff7b635b500df1eb4a66","src/isa/pulley_shared/inst/emit.rs":"9fedf94b41823273d6bb439c200b3ac253a62276cfb1b114eb67087d358e0739","src/isa/pulley_shared/inst/mod.rs":"77afed1fa8c8cb521bc4d9ea56e25589b53fb94b3f1e6af4a01f7c95640d207a","src/isa/pulley_shared/inst/regs.rs":"a68a12e40bcb926d9e905b616f52eb45c13e1b34e0936cb23672a4a0369b81f1","src/isa/pulley_shared/lower.isle":"51d28eec1cb2d71db9ebd2849d1b31c9d0eac8daeda9797da5ed1691abd8588a","src/isa/pulley_shared/lower.rs":"e3965bcf3c351f6be17099b5fb9e9214a611120ed1262ec1fab9dd0174da0bf8","src/isa/pulley_shared/lower/isle.rs":"9c235c0e9728ff824b34094a4f03880093b1685e8554496c0991110d854a2e8c","src/isa/pulley_shared/lower/isle/generated_code.rs":"42f8a5a915246fcd9824aed029f790d9d1d8a1e1a4f0d0c8a2160d0ab05b5230","src/isa/pulley_shared/mod.rs":"b09fe0b95e341893ad3b7fc70a69186fad2c10b7fcaf346205c223bc0b99f1fa","src/isa/pulley_shared/settings.rs":"df3bfa05363825fb9ce1809cbf77a450e0fb9f95a464ac2d8eed96d7c070bc93","src/isa/riscv64/abi.rs":"b52d6685203b0d25b9e0a9765e06cc56cf8543f34063a2838678c6ca0885fd75","src/isa/riscv64/inst.isle":"df2fe3c023a06802252c41b7e566bb7c03ef63a8e26e41f7da73c59e11fc0276","src/isa/riscv64/inst/args.rs":"0b6cd55f1991edf891b95a9547de5171528c50439c4401cf6e91fad55bfa408f","src/isa/riscv64/inst/emit.rs":"fcd4c8f6a56b621ea2a24b4e93eb8c62ab8289c7db82df2e239499421d770cb4","src/isa/riscv64/inst/emit_tests.rs":"1fc922f98c309d9fed054e16009fa6ab386885247f49456ebdd406bd89359bf6","src/isa/riscv64/inst/encode.rs":"b2a633299da54b9afa1b1d6e3f9b27425dc1d378eabf8b457cd1716019de3fba","src/isa/riscv64/inst/imms.rs":"1a39539014ff253a3fbf529d5599c1475dd1eeedde58584c407eb506a39b10a9","src/isa/riscv64/inst/mod.rs":"af365d6fb8174a67db47f9723770ddf4ad55db4f4f253d091ca4eef8f49986eb","src/isa/riscv64/inst/regs.rs":"ff1007c76a73ed4d35fe83959bddd82e7ebd086ea6fee30109dbf2e092448b5f","src/isa/riscv64/inst/unwind.rs":"0d06a94e614794057f224554060c8d6e0da0a01e021b92c33a1dbb3854b414f6","src/isa/riscv64/inst/unwind/systemv.rs":"5563b6088f091d2750c3999ae03b7f23d92faffa905e90f06cc9a9e8d18fc4a9","src/isa/riscv64/inst/vector.rs":"c80826d19b42208fc1b705fb6df8dc728b806a073afb8be3017d188f7ed95b3d","src/isa/riscv64/inst_vector.isle":"e0c30ba4a34348134479bc7031cd7ad0bd0463f0fcbc44db6ecc1f1dd436f814","src/isa/riscv64/lower.isle":"77fd352f02db01cacdc03e21a09d5262903de912091354b420cb2b3047cb27c4","src/isa/riscv64/lower.rs":"544fca9dfc125ed05d6eed4b87f654c7a74533b83049b3a5d8f7cec3a695196d","src/isa/riscv64/lower/isle.rs":"00c5375aef56b90298a01dab79f85d80976a7dbf9b8e057006973488da1a8d33","src/isa/riscv64/lower/isle/generated_code.rs":"64b1255e1543a6f27a18409d6cb788f45872a3e8c23f1a1cd8f6bebf3de86b46","src/isa/riscv64/mod.rs":"edc53ebb4b9bef333fa545eb57d808f5ef1f3391fc6314f6085c2a4ba6f34ccd","src/isa/riscv64/settings.rs":"39c26a31ffa46e524859fef756ad7ea523b9609acd16b0748655cc58f2fe0ad3","src/isa/s390x/abi.rs":"8a72a6b3f7cf70caafddb3eaca5b4f72bfc0a7528c2ee824ad986f0cc4f5814c","src/isa/s390x/inst.isle":"3b0d88cc18c7a8cece64641aa0b9f84c1ee9fafeac0df8fb2dea65e41750161f","src/isa/s390x/inst/args.rs":"c52d49f38c17e0fc5bc94c82e59bfbb580aeea66586d12bffa49372f5d75bf90","src/isa/s390x/inst/emit.rs":"fb2243786bfded835d5a32c520b68be047cbf666e81fdf2c0a7b1e93567b9d88","src/isa/s390x/inst/emit_tests.rs":"a7158f6e4d1eaa556995f6f573ba4ac72564b6406074e61f4fdf42320b49e76e","src/isa/s390x/inst/imms.rs":"de587bbdba3115eb2f54f374943ff82d9c5e9cbba44cca50088bcf40eda47a12","src/isa/s390x/inst/mod.rs":"83fff80b8b19f95923ae1c073305adfe2df3b35e816ba27430e7e5b12165e383","src/isa/s390x/inst/regs.rs":"1c11ec3c09b65c1557ae51f520222479aed3abf300b456df58824b32fb5bc9d0","src/isa/s390x/inst/unwind.rs":"0d06a94e614794057f224554060c8d6e0da0a01e021b92c33a1dbb3854b414f6","src/isa/s390x/inst/unwind/systemv.rs":"963a5d0c7bcd1a4441da501151213f5135719f10f389884bc273dc1a3321d746","src/isa/s390x/lower.isle":"272e98c6577d70631f0c53d04e8427ebd9ed6465202307313ee9b4637d58f58a","src/isa/s390x/lower.rs":"a19eebe83a12f247110bdabb398769050a333e45e9f4babf8b197a3ec9aa4088","src/isa/s390x/lower/isle.rs":"99db27e880ba039543ce0bccdafa7451a2b0365434d84045b9bd8a24a6193ac2","src/isa/s390x/lower/isle/generated_code.rs":"f3f544cd7e3abf337fcecf0c5e259325beb88ecda3b7f5c5efa87ed5e392eacd","src/isa/s390x/mod.rs":"15f5f4eea0cb5bdd6ef6d3c0018fee88783127cf4253528db3153c370cf7257d","src/isa/s390x/settings.rs":"064f84148f1bbffe440792c8b0337899b3f5bb1fd8c72b4b8d7c56faa5b93517","src/isa/unwind.rs":"5a2b7d64fc08e357d19ae3c0dc1fecfdbb6ed94c7dc3d34a2caff9dc76d8954f","src/isa/unwind/systemv.rs":"8ca524f33fa97210a92169517d08baf780429a4d62661f5272cbc067d3dc3c4d","src/isa/unwind/winx64.rs":"8f9404c2e555c4a84f587e8a61461b3b06c66456eb10cec94cb31c70b77c8451","src/isa/x64/abi.rs":"2534742155d0d850e89470623864c24b5ec7c9be99bdc19bbec7ebd4bf57d963","src/isa/x64/encoding/evex.rs":"e482baa91b6d62235ef6bac98704f37d4324738725e08b60e41aaa0f738904db","src/isa/x64/encoding/mod.rs":"0a0b63345f26e355b1a3e8f25d22e444dd32f53b6cf8978208d1bd3c33418876","src/isa/x64/encoding/rex.rs":"93e3e71023940e03289f40eb2cb950f299b084708445025a0187ff2e131cd8d5","src/isa/x64/encoding/vex.rs":"7df5c330cab063649f484b487da3341cab8697a41be7a999b7dc9ebafc811476","src/isa/x64/inst.isle":"91b7acdabbf8c37473c2288e3be5da39d6bd8c108fbed204b2f6c563fe4b6de8","src/isa/x64/inst/args.rs":"7c42637a2641972b5b1673b73ee0dc755ae8f48fc4f9e9ae25f02ac40374e5ec","src/isa/x64/inst/emit.rs":"3de07a52af44814254c0a94de9ed5dbaa0608a14c11c73243ece8570811a4245","src/isa/x64/inst/emit_state.rs":"a6dbd1f8b704e39f9252a236f62a89c85e34fac3f4141724a5db536b35d73d68","src/isa/x64/inst/emit_tests.rs":"e4f4662b253a12130fd5c4187ff06b9a38923b4ebb3c35d8bc7bb89f5a47ab7d","src/isa/x64/inst/mod.rs":"fde63f2b426c2c114dd185f410db7ca83cbbcdf73ef37786114aaf6f8fae01a5","src/isa/x64/inst/regs.rs":"94a97f06d3cd14d74bd5f3ea01a8af4780d5de087dada68646c15e11c67f1b8f","src/isa/x64/inst/stack_switch.rs":"f4b7f1d6d27d4ae2f5629c00b992da5342e357467fa7b3ff964078a66f5f64a2","src/isa/x64/inst/unwind.rs":"3ef395c2108a0a3b5e48e52453276e212ea92f644a5007c427ed60f12c8daf1b","src/isa/x64/inst/unwind/systemv.rs":"5be5e4892917b884c7b99c7e14c980128032cb285c57ad39c29ff0ddecbff3a3","src/isa/x64/inst/unwind/winx64.rs":"e71e9dde687b85cdddfacad0f6000d18b24fdc29664cc208c244eb56a9d5b7c9","src/isa/x64/lower.isle":"0b3641586e15c557325349e42940edbb99008df05e90916d1589d9388c86940e","src/isa/x64/lower.rs":"2a82dc5bd1d2cade9b82c5c76310631630e258e6930c2c65ccd129a77f84203a","src/isa/x64/lower/isle.rs":"1876642272b76e89d48026a3f8b30e8318c4b09d093fbd34d94bef311a0e5837","src/isa/x64/lower/isle/generated_code.rs":"2dd77ced8a107223bfc456aaf1178282fdd30db8d5bad2de57b4294c7d584988","src/isa/x64/mod.rs":"04ddce806675a55ee3b31288e4f2f9f8d892ac852fc69e98cfbe96cb881c1bbb","src/isa/x64/pcc.rs":"f7cd0d6c6675c9a009eeab5727318d5a1a564a51de9fe08adbd89177366e48f0","src/isa/x64/settings.rs":"0e8cf4bbd126bce457045a4a51504f31188d95aaaa2ec9f896010443bc382fc4","src/isle_prelude.rs":"36d579bb1545ef82ccfda427ae752b72d7d49478a3391eb1f6ae54628231fd85","src/iterators.rs":"d399a80bc65b97f7d650978e19086dcc1d280ac96d60628eac3d17eb363b0d71","src/legalizer/globalvalue.rs":"32e771a49eee11edf67b7583571eba50d309f9b7a020790481720fc1bc92ee08","src/legalizer/mod.rs":"55c5d5f7cc82cae183d54ee19b770b23ccf9b0ef963110ee5655049a246cbe3b","src/lib.rs":"cbab95649e4bc240df28a69f2f355b8330fd54e267f41163f3d673a9347663ad","src/loop_analysis.rs":"8b722f758a083452cf5cde3894e3a36c91f0cd9a444be415f228d780ac197fbf","src/machinst/abi.rs":"6f93956b11b45fe4f40086fb534c65a9af2b1a0967fa0da38a0c6df389f83650","src/machinst/blockorder.rs":"348a7e2f60ed9423249044417ac3004526e3625aaf0c0516661d795ab2986108","src/machinst/buffer.rs":"1c79d0a4d6271adf44e67f045ae738b74b28e3ccf6ec3e6ced557d9c8e071191","src/machinst/compile.rs":"bffde9a00eab09a549346cceeb0128f41d5f3bf6b5bff58318af8ed6814e0f32","src/machinst/helpers.rs":"2e39db285fbc02c6e389dd85807697759c926ec6607597d30d46025f868a9c78","src/machinst/inst_common.rs":"0c6390c77b51ac50596099266c5629f83d1f273c16cb30aa3dd08025b05641ff","src/machinst/isle.rs":"8ebb54bfef825a03f01f23957488a1c391a78a7ea22725ef64b5e088fea9cc32","src/machinst/lower.rs":"eb522103ec8e2042018f053abffad71e142645386852645c1bb9e9ea80b9a64f","src/machinst/mod.rs":"3e41d40e36adececf6fe1075cb4d7b37c2a5dee36235b106f07755c4a261942e","src/machinst/pcc.rs":"8e6ad20c61cb1945c90be6d7e51319062abe422fc2f131693c8d8a63d0368990","src/machinst/reg.rs":"edce08b2425b55112197bee93837ea6bfa416936a20491c4a8c1ed595202ba39","src/machinst/valueregs.rs":"57441493fd6ce15caeba242c9e30c0378558405fabebbc6eea5b74d350b75d34","src/machinst/vcode.rs":"48e34a48e517bdcb570915b70727c55843b3cf90308fae065a29b6c911469bea","src/nan_canonicalization.rs":"886672f28c04caa52df495b9f164e1d658be54f1e1445934c9146f1a951fb831","src/opts.rs":"16bcc2d256f0904e08831662a6ecd2b96d7dea4ba105f156833dbe1dfb53d430","src/opts/README.md":"9afe9a86535cd8657949daa060b17ce6c362ea23bd50b34bf59cfe647b745097","src/opts/arithmetic.isle":"b7511ddf4d90f759697e932736c412ae74bbe043e7a1ac8424775981963bdf08","src/opts/bitops.isle":"5bf28767b51f56580d17827157e3b409533ab228c91a8908b8b1542777368f66","src/opts/cprop.isle":"149ecbad605020fcc3c8bb39fc6330e60772745f644abf142722a65197107786","src/opts/extends.isle":"6b679541de5fb6a95daa345e61cf08736e085f5cf54c221c0707a46380948b83","src/opts/generated_code.rs":"a1f736ddafaaa475e3483547eaba80b7d68595a5ef701139bb0652599fdb2139","src/opts/icmp.isle":"51ce489973c340c5934769d5e8e4eb42db5bf4e6850b09a53b6012f06f4558fb","src/opts/remat.isle":"f996f00c2b2d8607a32305b8665b7088779de0fb6fd23cabb38a2c8a2c9accc3","src/opts/selects.isle":"f6231ceb205851a0750417805f5d74bc31a0217390f4ad957bedbf4bf00bb099","src/opts/shifts.isle":"99915c5f4bb20138e67f4f15e314d06518201f3dbd6bc6cced6a746c7e93be59","src/opts/spaceship.isle":"c3e6fe70d31d11994260eb96bdd11da73621c6884b953f55f1011d9e8c9ae4f3","src/opts/spectre.isle":"c5f389770ad42c81dd681c4ca2b001608ba0219c175ffa1748819d87841295b9","src/opts/vector.isle":"c565199aab0f157b6d3adc99fdc15e9fd028073591faee392e337611065f887e","src/prelude.isle":"bd9cf60ce7ab0155d484494f035a824d362eab9d2ba1484da9bcdcf3a75f764c","src/prelude_lower.isle":"1287d46daad44daefe38ede6c3885ff9549c6337f651c16e107f54d928a3c5ae","src/prelude_opt.isle":"ade724882928e36448ed87a723aabab35dc12d579ac3f676706951c0544d9b92","src/print_errors.rs":"5fb555c4036a3193da7a7b9820f94d171a68b51965fe9aca297fb2563a42b608","src/ranges.rs":"a9fc274561b2536750ec0c5ec2dff02073e547a9a8d55876d344378f5cd5d1ea","src/remove_constant_phis.rs":"803a4300422bff6bfe8955c2593a2b4a146c28e9006ad704fcf6be548dd494df","src/result.rs":"1cf49ba5c2f1c213954e2ee4dba1719d71c7f6d1bee16d6d96431041be39beeb","src/scoped_hash_map.rs":"f2e682485abc7643c4417fc9a236ca166d788724b68e8fffcfff356682b691f4","src/settings.rs":"3f117ddf1e8a63bd0810638020c1af2fd0f2255cfb2a0926c11f5b499ef424d6","src/souper_harvest.rs":"a101686d3d5e23ec617ddbce222e0d1058b136e4d6dd8a2cbfb44be15aa3dbae","src/timing.rs":"a4e67bbcbda1a7168192214e91e16b233ec536e8f627dfb6b73f1871bd6b1a06","src/traversals.rs":"883e92937069e4338e119a8bbcee42bff2ba9f456e22cb7337f080bc466ede7e","src/unionfind.rs":"ee962db114bc364b9a4cda8b20cdc14e8589ae36e419cc148529a2f5d1fe4cc5","src/unreachable_code.rs":"607dd0f78067ed69da6c8fa1dde915b2fed1f71a39195086531ed6617e819544","src/value_label.rs":"c7684e75ef035aa0d6e79d74be5c93142b7d5800ef4b05c3a8198cf8e5761cca","src/verifier/mod.rs":"83f47938508090385159d419b7ae2c1acdcd29e978b9a494d40545c013b8dc52","src/write.rs":"f3b1fa8b95f5e3e9ed133cdbaefda5d5b78d5b6d916faa05796729bf4a0d759d"},"package":"548a3af0d36a36bab5c6a3bb8684816d501fd012c3328beb0f57dbbcb364c479"}