wasmtime 28.0.0 → 29.0.0

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

@@ -1,626 +0,0 @@
-//! 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.115.0/.cargo-checksum.json

@@ -1 +0,0 @@
-{"files":{"Cargo.toml":"c6a7f5979334d51d1bc8e3700c6599d8b83ea2ec4d7766a1c2f232b7e0ca66f3","LICENSE":"268872b9816f90fd8e85db5a28d33f8150ebb8dd016653fb39ef1f94f2686bc5","README.md":"e5127227a7db4a8aa92fa6613ed71801025790e696bb41b0323fb7f3c6f7495a","benches/x64-evex-encoding.rs":"d44fe0567d4a2b8a9dd2e1daf0994601918f4853dcd073c8c99c15e40d6297c9","build.rs":"9b9b2130b4c31f587c5ec44d06be95c24721d8cc8faa979c4562b7ef1adf5989","src/alias_analysis.rs":"3f46da1f44e31e8e06e2b963ed36efb5bad422d51ce312a130ba2dfa9dad9338","src/binemit/mod.rs":"676bb0cf363a5376f72189d1aede572052d6f52a39b04d9304f865525a529dce","src/cfg_printer.rs":"7aeee3150cf32695ef3ff658142e08921ee90bd8bf526c9cabd28dc7acd318d0","src/constant_hash.rs":"8f53afb38891fbdab8553c7a89e61f0ce30947a22fb24ae84523c9a1ab025c3f","src/context.rs":"bb41ecd2af1890ccfe2223267ef5084e5cc73a8eb0d33771bfa6c98b2255d08e","src/ctxhash.rs":"2ce7282cd3f7a99effa7090a9d5937e6699cc2901b59c32aa6a1ca644ee14c27","src/cursor.rs":"babf745cbf4785cd310c2848661315f5de2ee1da24220145c7839b637a57094f","src/data_value.rs":"a921966558d95baf975f12004667526949b0b9503937a2d13c9646a89ff7cf23","src/dbg.rs":"333ebc4fd0ac5ade2b129eef44a64a9c554718431dc78f22c9e11ffbd8eea342","src/dominator_tree.rs":"5e46df574071ed3778d356e7f6777fbaea5738e1e24efeaea3d7fe5e58902589","src/egraph.rs":"3072479d9536dd031d39aa44377c8e4d040bb3681f78347070bc7592cb8f9e21","src/egraph/cost.rs":"19ad392d4f7a93dd8d2763a8c78c0c696939377185096e62029d164bf34a4e46","src/egraph/elaborate.rs":"dfce1b2bc4aadc4c8de108c539796319c79e3e21877f223e4c4283d6947d70b4","src/flowgraph.rs":"779c1710dc6055cc311471c1955bd975ea08b16bbfb73d46e2880e0655a20e02","src/incremental_cache.rs":"79fa916cc8841912e22b95fdb38cb4d8dd4670898812d8a79a8fc699b3149f34","src/inst_predicates.rs":"cc2799beafa460397cb3c03b3e80263a317d5adfba0d658e0cfb4a043b4d9887","src/inst_specs.isle":"b986c37cf353cf0c544fe21df8246b48ee84ad10d030d97cd8d2ad1d5832b241","src/ir/atomic_rmw_op.rs":"f4bb1aba71533f50a27e0da76e22d06bf02e0a6af5bf77401576b5598b7d2725","src/ir/builder.rs":"5c29c6bce5e202fb1c0f465781cb1abf7d9f97ee8c4cfa5e98bb0b2888393d8a","src/ir/condcodes.rs":"a03c9c208bb42e91c8f913c1ca556a7aeed17f1f99d40d68776c7680aa3af440","src/ir/constant.rs":"6dd36b8e2e2738c88bb5295677473eccd03cdc23bf8134641104ccee4028042c","src/ir/dfg.rs":"9b13f4e9741bdfbb3f45e45192eb4d8a8443f1c1ae950f20ce15024f00a8ac41","src/ir/dynamic_type.rs":"d9414af46a4f8bf598786948d33f53bd87b0cf0c01185a2774302c2fd2bb5376","src/ir/entities.rs":"02d15550bc6b045beefbca4ba8c374924a23f4754a6e44a707788b8b1c9ced2f","src/ir/extfunc.rs":"2e6b3fe09c137853a7df64ee5d7d6e7d2a9fb55ff0e3d06955e4c8c797c22793","src/ir/extname.rs":"cc07a1baf6dd4c584b25b329e5213e9805a7e8529e07caa4b326dee0a97e845a","src/ir/function.rs":"f426a19e7d5a023cba6ffab935d47261f2e9977aa0c34d776811f63559dc2b2d","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":"39171d349225d413c00965ad3104052bb0204583e7fbefe79c9e06ec9c632451","src/ir/libcall.rs":"7e3a55e8cf7401630f9818ea3dfa845f1af1c3e8f1d8dcb587f5df15fb996b4c","src/ir/memflags.rs":"33007bfe5c9c7309601eebd619553bf005fab4f37976586fb34ad99c23e0af0b","src/ir/memtype.rs":"44153dd83b66caf2a9bfca9d1fc60719aa50685f318c997859293691d6697b5e","src/ir/mod.rs":"18beb1b78ea05588fc9af12324437bfa46c93511b7d1fc52eeb4af3ab25b10ad","src/ir/pcc.rs":"3c805442b8a7f56ffe125c43ee423eb539925c0b808748e03d88c4bb824944e3","src/ir/progpoint.rs":"4c03b2fbebcb8d5af8ff8effd353b9ca66fb5551eaf2434376617390c66047a8","src/ir/sourceloc.rs":"a4f2d0e51c50d9caab15f493999cb12916d525600de638b43e6f0b785b856404","src/ir/stackslot.rs":"4255305e0521a6afb73f6189ce0e0c971df745d6a9e411172bb9b5a5fc29e0b9","src/ir/trapcode.rs":"fe5a0b09e35a87308acc57b3de03d61e5607061e9734862799e95437907fdb3a","src/ir/types.rs":"b5e3bc6e1be08d33ccdb348bc0144f77db07b1db6a8d331341e0a8714cbf4953","src/ir/user_stack_maps.rs":"f8eae1999d149d07cdea97e4a538e43b75a5cd68786dbc3ec453c9b41feb1a3e","src/isa/aarch64/abi.rs":"8e1f44387b6a516282432e10f46e5a4d2de825e47de727bfb77be073b0d12afc","src/isa/aarch64/inst.isle":"c0e40aaacb17efccb97fe4fa270baf179c1417c58ca133682c90e0c21889721b","src/isa/aarch64/inst/args.rs":"d7ed939496ea0d4ca371ad08c898e2611690b32276d221f7bff8475f46bbf907","src/isa/aarch64/inst/emit.rs":"b3dee7ed6554ab2fa8e5f8687ff259c03859be6f0975726ded5b349f20677dd0","src/isa/aarch64/inst/emit_tests.rs":"e09772eea06bb3759bb79a1c11fa06916f0e2e574835e9c2530849528626d362","src/isa/aarch64/inst/imms.rs":"6cf991147f681433921718f9c9f6b70fe940678300235e8230923204be27c1db","src/isa/aarch64/inst/mod.rs":"72ec6fa0938389f1bd93182ce3e95c82c4d88b39bc5b36d759a02ad9783fe680","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":"112109995ed2f55da031f32621573494558964bf1c4a8da0d8dd5be518423516","src/isa/aarch64/lower.rs":"093ff5c1b1a44575a93d3d2fea45b5cfbb0d2e388805517d0ed9c9675201a5f0","src/isa/aarch64/lower/isle.rs":"e703c35480e020c24263d74933d89b029f8e23716919cf40054eb57ada82cf8e","src/isa/aarch64/lower/isle/generated_code.rs":"14eb64ead3efe928bea2d25438afe938f234b8202f912e11800a8c5687e3335d","src/isa/aarch64/lower_dynamic_neon.isle":"3e112cb6c3b3a3ce014b9556ca1742172dad063c0c883b3dbeda2b3cbdaf88bd","src/isa/aarch64/mod.rs":"05c0e97530c8c9df31cdb706ebbd717f408dbb5a9e4b5a6f0c99962b2b871f60","src/isa/aarch64/pcc.rs":"734a6ef1d32c9b9816fbe9aa7607f20d4a143f57f899cd38622fbd2c0d68ba34","src/isa/aarch64/settings.rs":"e0a1decd458bb18bb49051058c76f226786effb2ac28df1eb77a4f51baf8a491","src/isa/call_conv.rs":"a9b949c9077c05d525f40a5646b5d30eeb34241dfc831ad12872050b7c74b2fd","src/isa/mod.rs":"adbc3a33159641c5f578d17bc06fc8f4f5fd7f763b23b36feb269e4d2d16440b","src/isa/pulley32.rs":"2f3c4118f59478ab67ce0ada7466d61cb6abbc6335056b4b9749b642210d4ca0","src/isa/pulley64.rs":"add7db7131a8078bee82171487d9136f94b7c6493992d03e86edac16a98f9a3c","src/isa/pulley_shared/abi.rs":"050fe5fcd18dfbdc21cf450ccdc330b67f92bd64e6f29bfa27c057a7de8298f8","src/isa/pulley_shared/inst.isle":"274c97a24b9407d8e4c9fffca5c9b9bf033dc5dad65713b7853406b92221f72b","src/isa/pulley_shared/inst/args.rs":"07c565620f932be6328f3fb8cd0a8b278963c663c7d47154e7c72e861feabdde","src/isa/pulley_shared/inst/emit.rs":"679d2003b3112aced50f4ec96ad02cd0be6946c4d99cb5518d42ad6d1c6e3260","src/isa/pulley_shared/inst/mod.rs":"eaddef380af1f5832fd71b03bec112e8a18119b9716d25fb45c9d57379461adc","src/isa/pulley_shared/inst/regs.rs":"c83a63540d4e3c94723214eff95dc3a42a693511f61e810b32aa0fb527d00f86","src/isa/pulley_shared/lower.isle":"f75b4b1c5bd4ad9d2fb5e41ce689e9b43d781946c4fba76f0f390ec7dce5373b","src/isa/pulley_shared/lower.rs":"e3965bcf3c351f6be17099b5fb9e9214a611120ed1262ec1fab9dd0174da0bf8","src/isa/pulley_shared/lower/isle.rs":"0d1a51f359a7f7c81ddb2eb24e775bde9b8060b9fc12f1c4fc50f37ec23352a5","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":"47d866226c1580ab6ee6794f0e3cc15d318be37b11ccea824a3acb7f78e018fb","src/isa/riscv64/inst.isle":"73c755a94c369c8963d629c77b299a69bacaec8a8e471e443a84f21cf075428b","src/isa/riscv64/inst/args.rs":"0b6cd55f1991edf891b95a9547de5171528c50439c4401cf6e91fad55bfa408f","src/isa/riscv64/inst/emit.rs":"faa08557d8b6f7aa65e630d9be733666a18003f3c5a6163de3e562f1bca7617e","src/isa/riscv64/inst/emit_tests.rs":"1fc922f98c309d9fed054e16009fa6ab386885247f49456ebdd406bd89359bf6","src/isa/riscv64/inst/encode.rs":"b2a633299da54b9afa1b1d6e3f9b27425dc1d378eabf8b457cd1716019de3fba","src/isa/riscv64/inst/imms.rs":"47c4c97f8b799e6e3c69b8d968de290dcc2daa76c6b9aa4e83a785037a79ae45","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":"5ea53b582f58e531192d199e976e0e9c3b34f1eb4497ee50f993a45ebcd0075b","src/isa/riscv64/lower.isle":"c46aca90b8f54a93fc28038bdb445b7eaadf873c59e1540e48bf08c63c35d578","src/isa/riscv64/lower.rs":"544fca9dfc125ed05d6eed4b87f654c7a74533b83049b3a5d8f7cec3a695196d","src/isa/riscv64/lower/isle.rs":"add3a3f37866bec2ea856f179536a46fcfe36a2ad03ba18b3a8a9fb9c7a8fe91","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":"1c739d00b3eaa3f2c259eab89d69c06d3410057048629a2ef0478b88adab4df4","src/isa/s390x/inst.isle":"e24d5081d1c4fab88d3c84044e19bdfb3f83d75c4f092d5e8627acf318d3bf5e","src/isa/s390x/inst/args.rs":"ed71f8c9f849a1faa87511f82022c7b47d62d2dc309752bcb3edb5114eec7d59","src/isa/s390x/inst/emit.rs":"4dd2c25295884a086ceae705060c778ef0e31c95fac89428107ce63338b4a431","src/isa/s390x/inst/emit_tests.rs":"3f71d804441d2e299690f9814de026c456fa567904931e6ca5f4f6dab78154d2","src/isa/s390x/inst/imms.rs":"de587bbdba3115eb2f54f374943ff82d9c5e9cbba44cca50088bcf40eda47a12","src/isa/s390x/inst/mod.rs":"b516db6954f9bfd97c2e08fb3ae0634b6dc721e66effe08b6d9b3736b31ff343","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":"c98e13076e01d13a79c763672ef28006e29f89dadb22e03e964187ee82de57a3","src/isa/s390x/lower.rs":"a19eebe83a12f247110bdabb398769050a333e45e9f4babf8b197a3ec9aa4088","src/isa/s390x/lower/isle.rs":"4271a61924d57a300f5a34e585446f3decf022edb069f8645df2071197164eb2","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":"c7d44abeb0cadc547663359f4c2a9600896ba4295d9bb9c70cd03abc2a30a1b0","src/isa/unwind/systemv.rs":"93affbf82faf637b2b3c84b966c18bee2603f15ec925899e023bed97dd9cc33c","src/isa/unwind/winarm64.rs":"f9419335200c3ab959d9bf27d2e402df4421dd427d9e8bf21bc3e7bb9a2c8a52","src/isa/unwind/winx64.rs":"05a7fb3adc5c99e6c6da589cf411e28bb05fe68fc5a41ea4fce3cddd22dfdbe8","src/isa/winch.rs":"e8098d0cf3e3bda6312ed8232b24744ddbbed643baa71306caa4b5a7e585378d","src/isa/x64/abi.rs":"666c0ad736e87b17eea31c8e23a31dca09681b8ce2e7efa82f85b229af3cf0b3","src/isa/x64/encoding/evex.rs":"e482baa91b6d62235ef6bac98704f37d4324738725e08b60e41aaa0f738904db","src/isa/x64/encoding/mod.rs":"0a0b63345f26e355b1a3e8f25d22e444dd32f53b6cf8978208d1bd3c33418876","src/isa/x64/encoding/rex.rs":"3e4698e53d3445135fbc786ad4c88b25ca873a2519d95902fd8e0e01c2483ede","src/isa/x64/encoding/vex.rs":"7df5c330cab063649f484b487da3341cab8697a41be7a999b7dc9ebafc811476","src/isa/x64/inst.isle":"080289aa1458973a399fa4068c7c5de82efe1b5768b9dc4faa488b855b9f28b7","src/isa/x64/inst/args.rs":"9896bcc8e20edac09c63a10c8759a34005170727c38ebdc140042ca7ffb5b337","src/isa/x64/inst/emit.rs":"081a9a6b379146b2d3afca9f9e6f2a5bc8317e8152ae939c5aa458eebaaeebf4","src/isa/x64/inst/emit_state.rs":"a6dbd1f8b704e39f9252a236f62a89c85e34fac3f4141724a5db536b35d73d68","src/isa/x64/inst/emit_tests.rs":"1da26f80261fc41103bf3b650759250efc821a33bf50698e785f5e3f2b4628e4","src/isa/x64/inst/mod.rs":"95bb71ecfa6e0eda810e7b32fa8057143c258411b641cf5e199b0fd407cb39d8","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":"915b7a785c663c66ba914b3facfc27375b564175f4690d35c65f548d3f92e99c","src/isa/x64/lower.rs":"2a82dc5bd1d2cade9b82c5c76310631630e258e6930c2c65ccd129a77f84203a","src/isa/x64/lower/isle.rs":"8999212e3659bec41b94aff7f6a24287b989eee786b19cc00a3a0c9a2b5a5885","src/isa/x64/lower/isle/generated_code.rs":"2dd77ced8a107223bfc456aaf1178282fdd30db8d5bad2de57b4294c7d584988","src/isa/x64/mod.rs":"04ddce806675a55ee3b31288e4f2f9f8d892ac852fc69e98cfbe96cb881c1bbb","src/isa/x64/pcc.rs":"098e72838d6ba08a977d49050714941e6d8b109551d902e4e10a932ea99b3fcc","src/isa/x64/settings.rs":"0e8cf4bbd126bce457045a4a51504f31188d95aaaa2ec9f896010443bc382fc4","src/isle_prelude.rs":"335758f61d4651dc21597f796fed41f8f5fa0891403bb370d0dbca1905180ff8","src/iterators.rs":"d399a80bc65b97f7d650978e19086dcc1d280ac96d60628eac3d17eb363b0d71","src/legalizer/globalvalue.rs":"32e771a49eee11edf67b7583571eba50d309f9b7a020790481720fc1bc92ee08","src/legalizer/mod.rs":"8ed2537bac41763c3d52b592b1bbff78537a4d27dd7c348703846ea3872eb692","src/lib.rs":"419f52bfed4029b4ea4d1697ed19f69631007583fbae3e1ec91544470905e448","src/loop_analysis.rs":"db38e668da56f1e719c8be9db4ae63b8752c1563c985fd9a53d77bb5e8754c59","src/machinst/abi.rs":"e325d9e6e75a78d758f2de6246e0e53db5531dee3beadb37b868bddf443b89a1","src/machinst/blockorder.rs":"6b945ba2d672e3b439058203788cc5e7a59b8a65345b171b2f14c7ee15499c7e","src/machinst/buffer.rs":"d901f2524886cb680bb0f1015bf68ee3965a6475bbd138a747de9df2badd1af5","src/machinst/compile.rs":"ba6822a449af747ff957fa095fd684807b4745e8002969e73a5779827de7a2dd","src/machinst/helpers.rs":"2e39db285fbc02c6e389dd85807697759c926ec6607597d30d46025f868a9c78","src/machinst/inst_common.rs":"0e63e1100ee2652ded93d375078c23cc704a46efb5bd4f9e5362345e71780424","src/machinst/isle.rs":"911359dbb0a8493e370a6b0f540d1bfa06e838763f57d100fb3aecf7ed56cb91","src/machinst/lower.rs":"4aeec44340a1adb500ae08ed46f74964127d354d5092247c9445f5f6d483be7f","src/machinst/mod.rs":"fa298a04ec446eb32079a0fe54ec5e28a990c5c09545dedabfc708d5624e0c4a","src/machinst/pcc.rs":"8e6ad20c61cb1945c90be6d7e51319062abe422fc2f131693c8d8a63d0368990","src/machinst/reg.rs":"441869d600766449f1497aa4f0e943186ad9b7756adf264420e82ec7bd99f7e9","src/machinst/valueregs.rs":"46d22cb5dd0f3a145113745dc4f6502343c6e51b95be4de244f164c00b0ced0c","src/machinst/vcode.rs":"48e34a48e517bdcb570915b70727c55843b3cf90308fae065a29b6c911469bea","src/nan_canonicalization.rs":"886672f28c04caa52df495b9f164e1d658be54f1e1445934c9146f1a951fb831","src/opts.rs":"16bcc2d256f0904e08831662a6ecd2b96d7dea4ba105f156833dbe1dfb53d430","src/opts/README.md":"9afe9a86535cd8657949daa060b17ce6c362ea23bd50b34bf59cfe647b745097","src/opts/arithmetic.isle":"1045f04f4c5f9ef117639afb3921ec3c8986db4e48ca07e8821305c22484e5c9","src/opts/bitops.isle":"20384674384605179cdd60a69fa0a8d7454114fd56ea8a2606f7d6edbcdb07da","src/opts/cprop.isle":"650599f3f73fb3e2430810ff9d861ad3cd961a70d4e506dfe0af13d3febc2b96","src/opts/extends.isle":"484deed3ae552ec5c18db96e9c07e8bef4cce92a740887e10e55b7617987a4d4","src/opts/generated_code.rs":"a1f736ddafaaa475e3483547eaba80b7d68595a5ef701139bb0652599fdb2139","src/opts/icmp.isle":"c7bd0acbb4096a5cb8403d97aa1da9e4dc1de0bc1b66de0be12e2ea07e62bbd9","src/opts/remat.isle":"f996f00c2b2d8607a32305b8665b7088779de0fb6fd23cabb38a2c8a2c9accc3","src/opts/selects.isle":"f6231ceb205851a0750417805f5d74bc31a0217390f4ad957bedbf4bf00bb099","src/opts/shifts.isle":"8d1f596ab9e6a00b50810de898def196733256023c8aa0684dc6e63c74ca8615","src/opts/spaceship.isle":"c3e6fe70d31d11994260eb96bdd11da73621c6884b953f55f1011d9e8c9ae4f3","src/opts/spectre.isle":"c5f389770ad42c81dd681c4ca2b001608ba0219c175ffa1748819d87841295b9","src/opts/vector.isle":"c565199aab0f157b6d3adc99fdc15e9fd028073591faee392e337611065f887e","src/prelude.isle":"b90bbda70d48e2e1a968f35b24d52e97c30620f15dcd4cc7c399836cf894c9ed","src/prelude_lower.isle":"c8b7430fbd46f370048452eefe1bf8eb58c1f8606471d570813f47a88071da74","src/prelude_opt.isle":"e7a43732d8abe3eebbbcd2722e30fc4416a0b78d54280d52382eee3d41578619","src/print_errors.rs":"5fb555c4036a3193da7a7b9820f94d171a68b51965fe9aca297fb2563a42b608","src/ranges.rs":"a9fc274561b2536750ec0c5ec2dff02073e547a9a8d55876d344378f5cd5d1ea","src/remove_constant_phis.rs":"ed3e9c8930d85ccc6540fe569a9dbfc944c957f70e9678497f6143f14c8774fe","src/result.rs":"1cf49ba5c2f1c213954e2ee4dba1719d71c7f6d1bee16d6d96431041be39beeb","src/scoped_hash_map.rs":"f2e682485abc7643c4417fc9a236ca166d788724b68e8fffcfff356682b691f4","src/settings.rs":"67fe94fcd7a07b280d45a995d82226f9d775f49aa234848e8d60b4244aa9acb5","src/souper_harvest.rs":"a101686d3d5e23ec617ddbce222e0d1058b136e4d6dd8a2cbfb44be15aa3dbae","src/timing.rs":"a4e67bbcbda1a7168192214e91e16b233ec536e8f627dfb6b73f1871bd6b1a06","src/traversals.rs":"f52e4980cdabb0e2af92577781992551db3fce4bcc82a584b489aa124e34274d","src/unionfind.rs":"ee962db114bc364b9a4cda8b20cdc14e8589ae36e419cc148529a2f5d1fe4cc5","src/unreachable_code.rs":"607dd0f78067ed69da6c8fa1dde915b2fed1f71a39195086531ed6617e819544","src/value_label.rs":"c7684e75ef035aa0d6e79d74be5c93142b7d5800ef4b05c3a8198cf8e5761cca","src/verifier/mod.rs":"83f47938508090385159d419b7ae2c1acdcd29e978b9a494d40545c013b8dc52","src/write.rs":"f3b1fa8b95f5e3e9ed133cdbaefda5d5b78d5b6d916faa05796729bf4a0d759d"},"package":"fd96ce9cf8efebd7f5ab8ced5a0ce44250280bbae9f593d74a6d7effc3582a35"}