wasmtime 12.0.1 → 13.0.0

data/ext/cargo-vendor/cranelift-bforest-0.99.1/src/set.rs

@@ -1,598 +0,0 @@
-//! Forest of sets.
-
-use super::{Comparator, Forest, Node, NodeData, NodePool, Path, SetValue, INNER_SIZE};
-use crate::packed_option::PackedOption;
-#[cfg(test)]
-use alloc::string::String;
-#[cfg(test)]
-use core::fmt;
-use core::marker::PhantomData;
-
-/// Tag type defining forest types for a set.
-struct SetTypes<K>(PhantomData<K>);
-
-impl<K> Forest for SetTypes<K>
-where
-    K: Copy,
-{
-    type Key = K;
-    type Value = SetValue;
-    type LeafKeys = [K; 2 * INNER_SIZE - 1];
-    type LeafValues = [SetValue; 2 * INNER_SIZE - 1];
-
-    fn splat_key(key: Self::Key) -> Self::LeafKeys {
-        [key; 2 * INNER_SIZE - 1]
-    }
-
-    fn splat_value(value: Self::Value) -> Self::LeafValues {
-        [value; 2 * INNER_SIZE - 1]
-    }
-}
-
-/// Memory pool for a forest of `Set` instances.
-pub struct SetForest<K>
-where
-    K: Copy,
-{
-    nodes: NodePool<SetTypes<K>>,
-}
-
-impl<K> SetForest<K>
-where
-    K: Copy,
-{
-    /// Create a new empty forest.
-    pub fn new() -> Self {
-        Self {
-            nodes: NodePool::new(),
-        }
-    }
-
-    /// Clear all sets in the forest.
-    ///
-    /// All `Set` instances belong to this forest are invalidated and should no longer be used.
-    pub fn clear(&mut self) {
-        self.nodes.clear();
-    }
-}
-
-/// B-tree representing an ordered set of `K`s using `C` for comparing elements.
-///
-/// This is not a general-purpose replacement for `BTreeSet`. See the [module
-/// documentation](index.html) for more information about design tradeoffs.
-///
-/// Sets can be cloned, but that operation should only be used as part of cloning the whole forest
-/// they belong to. *Cloning a set does not allocate new memory for the clone*. It creates an alias
-/// of the same memory.
-#[derive(Clone)]
-pub struct Set<K>
-where
-    K: Copy,
-{
-    root: PackedOption<Node>,
-    unused: PhantomData<K>,
-}
-
-impl<K> Set<K>
-where
-    K: Copy,
-{
-    /// Make an empty set.
-    pub fn new() -> Self {
-        Self {
-            root: None.into(),
-            unused: PhantomData,
-        }
-    }
-
-    /// Is this an empty set?
-    pub fn is_empty(&self) -> bool {
-        self.root.is_none()
-    }
-
-    /// Does the set contain `key`?.
-    pub fn contains<C: Comparator<K>>(&self, key: K, forest: &SetForest<K>, comp: &C) -> bool {
-        self.root
-            .expand()
-            .and_then(|root| Path::default().find(key, root, &forest.nodes, comp))
-            .is_some()
-    }
-
-    /// Try to insert `key` into the set.
-    ///
-    /// If the set did not contain `key`, insert it and return true.
-    ///
-    /// If `key` is already present, don't change the set and return false.
-    pub fn insert<C: Comparator<K>>(
-        &mut self,
-        key: K,
-        forest: &mut SetForest<K>,
-        comp: &C,
-    ) -> bool {
-        self.cursor(forest, comp).insert(key)
-    }
-
-    /// Remove `key` from the set and return true.
-    ///
-    /// If `key` was not present in the set, return false.
-    pub fn remove<C: Comparator<K>>(
-        &mut self,
-        key: K,
-        forest: &mut SetForest<K>,
-        comp: &C,
-    ) -> bool {
-        let mut c = self.cursor(forest, comp);
-        if c.goto(key) {
-            c.remove();
-            true
-        } else {
-            false
-        }
-    }
-
-    /// Remove all entries.
-    pub fn clear(&mut self, forest: &mut SetForest<K>) {
-        if let Some(root) = self.root.take() {
-            forest.nodes.free_tree(root);
-        }
-    }
-
-    /// Retains only the elements specified by the predicate.
-    ///
-    /// Remove all elements where the predicate returns false.
-    pub fn retain<F>(&mut self, forest: &mut SetForest<K>, mut predicate: F)
-    where
-        F: FnMut(K) -> bool,
-    {
-        let mut path = Path::default();
-        if let Some(root) = self.root.expand() {
-            path.first(root, &forest.nodes);
-        }
-        while let Some((node, entry)) = path.leaf_pos() {
-            if predicate(forest.nodes[node].unwrap_leaf().0[entry]) {
-                path.next(&forest.nodes);
-            } else {
-                self.root = path.remove(&mut forest.nodes).into();
-            }
-        }
-    }
-
-    /// Create a cursor for navigating this set. The cursor is initially positioned off the end of
-    /// the set.
-    pub fn cursor<'a, C: Comparator<K>>(
-        &'a mut self,
-        forest: &'a mut SetForest<K>,
-        comp: &'a C,
-    ) -> SetCursor<'a, K, C> {
-        SetCursor::new(self, forest, comp)
-    }
-
-    /// Create an iterator traversing this set. The iterator type is `K`.
-    pub fn iter<'a>(&'a self, forest: &'a SetForest<K>) -> SetIter<'a, K> {
-        SetIter {
-            root: self.root,
-            pool: &forest.nodes,
-            path: Path::default(),
-        }
-    }
-}
-
-impl<K> Default for Set<K>
-where
-    K: Copy,
-{
-    fn default() -> Self {
-        Self::new()
-    }
-}
-
-/// A position in a `Set` used to navigate and modify the ordered set.
-///
-/// A cursor always points at an element in the set, or "off the end" which is a position after the
-/// last element in the set.
-pub struct SetCursor<'a, K, C>
-where
-    K: 'a + Copy,
-    C: 'a + Comparator<K>,
-{
-    root: &'a mut PackedOption<Node>,
-    pool: &'a mut NodePool<SetTypes<K>>,
-    comp: &'a C,
-    path: Path<SetTypes<K>>,
-}
-
-impl<'a, K, C> SetCursor<'a, K, C>
-where
-    K: Copy,
-    C: Comparator<K>,
-{
-    /// Create a cursor with a default (invalid) location.
-    fn new(container: &'a mut Set<K>, forest: &'a mut SetForest<K>, comp: &'a C) -> Self {
-        Self {
-            root: &mut container.root,
-            pool: &mut forest.nodes,
-            comp,
-            path: Path::default(),
-        }
-    }
-
-    /// Is this cursor pointing to an empty set?
-    pub fn is_empty(&self) -> bool {
-        self.root.is_none()
-    }
-
-    /// Move cursor to the next element and return it.
-    ///
-    /// If the cursor reaches the end, return `None` and leave the cursor at the off-the-end
-    /// position.
-    #[cfg_attr(feature = "cargo-clippy", allow(clippy::should_implement_trait))]
-    pub fn next(&mut self) -> Option<K> {
-        self.path.next(self.pool).map(|(k, _)| k)
-    }
-
-    /// Move cursor to the previous element and return it.
-    ///
-    /// If the cursor is already pointing at the first element, leave it there and return `None`.
-    pub fn prev(&mut self) -> Option<K> {
-        self.root
-            .expand()
-            .and_then(|root| self.path.prev(root, self.pool).map(|(k, _)| k))
-    }
-
-    /// Get the current element, or `None` if the cursor is at the end.
-    pub fn elem(&self) -> Option<K> {
-        self.path
-            .leaf_pos()
-            .and_then(|(node, entry)| self.pool[node].unwrap_leaf().0.get(entry).cloned())
-    }
-
-    /// Move this cursor to `elem`.
-    ///
-    /// If `elem` is in the set, place the cursor at `elem` and return true.
-    ///
-    /// If `elem` is not in the set, place the cursor at the next larger element (or the end) and
-    /// return false.
-    pub fn goto(&mut self, elem: K) -> bool {
-        match self.root.expand() {
-            None => false,
-            Some(root) => {
-                if self.path.find(elem, root, self.pool, self.comp).is_some() {
-                    true
-                } else {
-                    self.path.normalize(self.pool);
-                    false
-                }
-            }
-        }
-    }
-
-    /// Move this cursor to the first element.
-    pub fn goto_first(&mut self) -> Option<K> {
-        self.root.map(|root| self.path.first(root, self.pool).0)
-    }
-
-    /// Try to insert `elem` into the set and leave the cursor at the inserted element.
-    ///
-    /// If the set did not contain `elem`, insert it and return true.
-    ///
-    /// If `elem` is already present, don't change the set, place the cursor at `goto(elem)`, and
-    /// return false.
-    pub fn insert(&mut self, elem: K) -> bool {
-        match self.root.expand() {
-            None => {
-                let root = self.pool.alloc_node(NodeData::leaf(elem, SetValue()));
-                *self.root = root.into();
-                self.path.set_root_node(root);
-                true
-            }
-            Some(root) => {
-                // TODO: Optimize the case where `self.path` is already at the correct insert pos.
-                if self.path.find(elem, root, self.pool, self.comp).is_none() {
-                    *self.root = self.path.insert(elem, SetValue(), self.pool).into();
-                    true
-                } else {
-                    false
-                }
-            }
-        }
-    }
-
-    /// Remove the current element (if any) and return it.
-    /// This advances the cursor to the next element after the removed one.
-    pub fn remove(&mut self) -> Option<K> {
-        let elem = self.elem();
-        if elem.is_some() {
-            *self.root = self.path.remove(self.pool).into();
-        }
-        elem
-    }
-}
-
-#[cfg(test)]
-impl<'a, K, C> SetCursor<'a, K, C>
-where
-    K: Copy + fmt::Display,
-    C: Comparator<K>,
-{
-    fn verify(&self) {
-        self.path.verify(self.pool);
-        self.root.map(|root| self.pool.verify_tree(root, self.comp));
-    }
-
-    /// Get a text version of the path to the current position.
-    fn tpath(&self) -> String {
-        use alloc::string::ToString;
-        self.path.to_string()
-    }
-}
-
-/// An iterator visiting the elements of a `Set`.
-pub struct SetIter<'a, K>
-where
-    K: 'a + Copy,
-{
-    root: PackedOption<Node>,
-    pool: &'a NodePool<SetTypes<K>>,
-    path: Path<SetTypes<K>>,
-}
-
-impl<'a, K> Iterator for SetIter<'a, K>
-where
-    K: 'a + Copy,
-{
-    type Item = K;
-
-    fn next(&mut self) -> Option<Self::Item> {
-        // We use `self.root` to indicate if we need to go to the first element. Reset to `None`
-        // once we've returned the first element. This also works for an empty tree since the
-        // `path.next()` call returns `None` when the path is empty. This also fuses the iterator.
-        match self.root.take() {
-            Some(root) => Some(self.path.first(root, self.pool).0),
-            None => self.path.next(self.pool).map(|(k, _)| k),
-        }
-    }
-}
-
-#[cfg(test)]
-mod tests {
-    use super::super::NodeData;
-    use super::*;
-    use alloc::vec::Vec;
-    use core::mem;
-
-    #[test]
-    fn node_size() {
-        // check that nodes are cache line sized when keys are 32 bits.
-        type F = SetTypes<u32>;
-        assert_eq!(mem::size_of::<NodeData<F>>(), 64);
-    }
-
-    #[test]
-    fn empty() {
-        let mut f = SetForest::<u32>::new();
-        f.clear();
-
-        let mut s = Set::<u32>::new();
-        assert!(s.is_empty());
-        s.clear(&mut f);
-        assert!(!s.contains(7, &f, &()));
-
-        // Iterator for an empty set.
-        assert_eq!(s.iter(&f).next(), None);
-
-        s.retain(&mut f, |_| unreachable!());
-
-        let mut c = SetCursor::new(&mut s, &mut f, &());
-        c.verify();
-        assert_eq!(c.elem(), None);
-
-        assert_eq!(c.goto_first(), None);
-        assert_eq!(c.tpath(), "<empty path>");
-    }
-
-    #[test]
-    fn simple_cursor() {
-        let mut f = SetForest::<u32>::new();
-        let mut s = Set::<u32>::new();
-        let mut c = SetCursor::new(&mut s, &mut f, &());
-
-        assert!(c.insert(50));
-        c.verify();
-        assert_eq!(c.elem(), Some(50));
-
-        assert!(c.insert(100));
-        c.verify();
-        assert_eq!(c.elem(), Some(100));
-
-        assert!(c.insert(10));
-        c.verify();
-        assert_eq!(c.elem(), Some(10));
-
-        // Basic movement.
-        assert_eq!(c.next(), Some(50));
-        assert_eq!(c.next(), Some(100));
-        assert_eq!(c.next(), None);
-        assert_eq!(c.next(), None);
-        assert_eq!(c.prev(), Some(100));
-        assert_eq!(c.prev(), Some(50));
-        assert_eq!(c.prev(), Some(10));
-        assert_eq!(c.prev(), None);
-        assert_eq!(c.prev(), None);
-
-        assert!(c.goto(50));
-        assert_eq!(c.elem(), Some(50));
-        assert_eq!(c.remove(), Some(50));
-        c.verify();
-
-        assert_eq!(c.elem(), Some(100));
-        assert_eq!(c.remove(), Some(100));
-        c.verify();
-        assert_eq!(c.elem(), None);
-        assert_eq!(c.remove(), None);
-        c.verify();
-    }
-
-    #[test]
-    fn two_level_sparse_tree() {
-        let mut f = SetForest::<u32>::new();
-        let mut s = Set::<u32>::new();
-        let mut c = SetCursor::new(&mut s, &mut f, &());
-
-        // Insert enough elements that we get a two-level tree.
-        // Each leaf node holds 8 elements
-        assert!(c.is_empty());
-        for i in 0..50 {
-            assert!(c.insert(i));
-            assert_eq!(c.elem(), Some(i));
-        }
-        assert!(!c.is_empty());
-
-        assert_eq!(c.goto_first(), Some(0));
-        assert_eq!(c.tpath(), "node2[0]--node0[0]");
-
-        assert_eq!(c.prev(), None);
-        for i in 1..50 {
-            assert_eq!(c.next(), Some(i));
-        }
-        assert_eq!(c.next(), None);
-        for i in (0..50).rev() {
-            assert_eq!(c.prev(), Some(i));
-        }
-        assert_eq!(c.prev(), None);
-
-        assert!(c.goto(25));
-        for i in 25..50 {
-            assert_eq!(c.remove(), Some(i));
-            assert!(!c.is_empty());
-            c.verify();
-        }
-
-        for i in (0..25).rev() {
-            assert!(!c.is_empty());
-            assert_eq!(c.elem(), None);
-            assert_eq!(c.prev(), Some(i));
-            assert_eq!(c.remove(), Some(i));
-            c.verify();
-        }
-        assert_eq!(c.elem(), None);
-        assert!(c.is_empty());
-    }
-
-    #[test]
-    fn three_level_sparse_tree() {
-        let mut f = SetForest::<u32>::new();
-        let mut s = Set::<u32>::new();
-        let mut c = SetCursor::new(&mut s, &mut f, &());
-
-        // Insert enough elements that we get a 3-level tree.
-        // Each leaf node holds 8 elements when filled up sequentially.
-        // Inner nodes hold 8 node pointers.
-        assert!(c.is_empty());
-        for i in 0..150 {
-            assert!(c.insert(i));
-            assert_eq!(c.elem(), Some(i));
-        }
-        assert!(!c.is_empty());
-
-        assert!(c.goto(0));
-        assert_eq!(c.tpath(), "node11[0]--node2[0]--node0[0]");
-
-        assert_eq!(c.prev(), None);
-        for i in 1..150 {
-            assert_eq!(c.next(), Some(i));
-        }
-        assert_eq!(c.next(), None);
-        for i in (0..150).rev() {
-            assert_eq!(c.prev(), Some(i));
-        }
-        assert_eq!(c.prev(), None);
-
-        assert!(c.goto(125));
-        for i in 125..150 {
-            assert_eq!(c.remove(), Some(i));
-            assert!(!c.is_empty());
-            c.verify();
-        }
-
-        for i in (0..125).rev() {
-            assert!(!c.is_empty());
-            assert_eq!(c.elem(), None);
-            assert_eq!(c.prev(), Some(i));
-            assert_eq!(c.remove(), Some(i));
-            c.verify();
-        }
-        assert_eq!(c.elem(), None);
-        assert!(c.is_empty());
-    }
-
-    // Generate a densely populated 4-level tree.
-    //
-    // Level 1: 1 root
-    // Level 2: 8 inner
-    // Level 3: 64 inner
-    // Level 4: 512 leafs, up to 7680 elements
-    //
-    // A 3-level tree can hold at most 960 elements.
-    fn dense4l(f: &mut SetForest<i32>) -> Set<i32> {
-        f.clear();
-        let mut s = Set::new();
-
-        // Insert 400 elements in 7 passes over the range to avoid the half-full leaf node pattern
-        // that comes from sequential insertion. This will generate a normal leaf layer.
-        for n in 0..4000 {
-            assert!(s.insert((n * 7) % 4000, f, &()));
-        }
-        s
-    }
-
-    #[test]
-    fn four_level() {
-        let mut f = SetForest::<i32>::new();
-        let mut s = dense4l(&mut f);
-
-        assert_eq!(
-            s.iter(&f).collect::<Vec<_>>()[0..10],
-            [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
-        );
-
-        let mut c = s.cursor(&mut f, &());
-
-        c.verify();
-
-        // Peel off a whole sub-tree of the root by deleting from the front.
-        // The 900 element is near the front of the second sub-tree.
-        assert!(c.goto(900));
-        assert_eq!(c.tpath(), "node48[1]--node47[0]--node26[0]--node20[4]");
-        assert!(c.goto(0));
-        for i in 0..900 {
-            assert!(!c.is_empty());
-            assert_eq!(c.remove(), Some(i));
-        }
-        c.verify();
-        assert_eq!(c.elem(), Some(900));
-
-        // Delete backwards from somewhere in the middle.
-        assert!(c.goto(3000));
-        for i in (2000..3000).rev() {
-            assert_eq!(c.prev(), Some(i));
-            assert_eq!(c.remove(), Some(i));
-            assert_eq!(c.elem(), Some(3000));
-        }
-        c.verify();
-
-        // Remove everything in a scattered manner, triggering many collapsing patterns.
-        for i in 0..4000 {
-            if c.goto((i * 7) % 4000) {
-                c.remove();
-            }
-        }
-        assert!(c.is_empty());
-    }
-
-    #[test]
-    fn four_level_clear() {
-        let mut f = SetForest::<i32>::new();
-        let mut s = dense4l(&mut f);
-        s.clear(&mut f);
-    }
-}

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

@@ -1 +0,0 @@
-{"files":{"Cargo.toml":"1f218350e312ab08e131b8eeb7e4cdaac18cc57de793a1012efc66a30b045772","LICENSE":"268872b9816f90fd8e85db5a28d33f8150ebb8dd016653fb39ef1f94f2686bc5","README.md":"e5127227a7db4a8aa92fa6613ed71801025790e696bb41b0323fb7f3c6f7495a","benches/x64-evex-encoding.rs":"d44fe0567d4a2b8a9dd2e1daf0994601918f4853dcd073c8c99c15e40d6297c9","build.rs":"3e9ca6781ef9a2a5160fe9d2aee0c994daaec2152edf97f38d91c56276701aad","src/alias_analysis.rs":"237987373be696035c2f389ce50895eb2eb24b448b6b769d2dc059c71a48251f","src/binemit/mod.rs":"c658523e4ca0b1d07ed569f66842a4eaf566b57ba4b91662d976cb0345663257","src/binemit/stack_map.rs":"1e056308807fcecda4cfd52e9d20061fb448cf506066a1e99fdd596aabc8d9a6","src/bitset.rs":"dd457ff136e6143a6740d06bb2321cf89e3a57135b99985a32b502b20b37cbc7","src/cfg_printer.rs":"5679b6b4ce2234aff00825d7e97ba9bed85dd19c4973d4b0fc7abd4914979e59","src/constant_hash.rs":"8f53afb38891fbdab8553c7a89e61f0ce30947a22fb24ae84523c9a1ab025c3f","src/context.rs":"c24f2f39085731009ae89de241b32284b182bb024de28477658a5a04eb06618c","src/ctxhash.rs":"cfd729fbd2cd8f438dc3dab39b803c8c31b4829ba4064b4629a08020132054ed","src/cursor.rs":"babf745cbf4785cd310c2848661315f5de2ee1da24220145c7839b637a57094f","src/data_value.rs":"a0308dc4f077efba852e08f6eaa63bb12377bc84560cdb6b35ede1f32fcf3c06","src/dbg.rs":"1898d94cff0975815eb348651702e95c8f2f63886501d3b7043ee75668480472","src/dce.rs":"2de09da660ce6255edac96f26d7cbdd71db0f1c89c29692b320daae1a80d5b4d","src/dominator_tree.rs":"bc4712da18212fe6740ddad3d82bd8202059b0859249cbabb40b3162478e8e1f","src/egraph.rs":"4b88465cbc350b5687851484f5e0d3fc9b7ab569cd97ade50afecfa036b01792","src/egraph/cost.rs":"0be99b1d558dc849eeaf7edb62360f4676d3044c743c4f7b46baf5f3c070f26b","src/egraph/domtree.rs":"402fde65416c1d1d3ac59eff133281559f3d2872f340b701150d2d611ab922a4","src/egraph/elaborate.rs":"2a85fea86adcc37e1573e0ffe9cf7d8ea8f3625bb8e5641bc2ea41866633a96c","src/flowgraph.rs":"43c575f18b109aca45cde41a1197eec061ba73f9189251d7060b8c71d2b22233","src/fx.rs":"d2a5cacf38c0c00a30cb1c49fa0aaabbd8d78bb49a42e0b83a5e0e6cf33c245e","src/incremental_cache.rs":"f77bb8dd23eb869a3c99b48ac862f4246f2596fd79d90d9341c68b468f68f57c","src/inst_predicates.rs":"bd704ea76cdbc656d040a623b2f6cde96f5fd93d35c893de5b7b68f925c6c2a5","src/ir/atomic_rmw_op.rs":"5052aaa09a731e7286433fb386f2971adb92205d517c778c080b773630b0bf1c","src/ir/builder.rs":"6aa97b66754fc7476032d897813b0ed321044df11ae9019ba91260ce74384d9c","src/ir/condcodes.rs":"4583d604e9f54e8288cd162e2d2430fb3d56791a1f57327a32f2cdf2d389805f","src/ir/constant.rs":"c127527c5bc7dc6f37c281ee68e4a9613b8409f49543872c354cc1a33e3d1878","src/ir/dfg.rs":"f71431b3870bbc95b04e88cc325f7de63b0cc078ea9cf576e61cf1be02b9bb5f","src/ir/dynamic_type.rs":"53c221a9709ff6face754f058a99d36cba61a490bff41e612cf2f0fe8ac863b2","src/ir/entities.rs":"bc9febc1f917b07043f6dcc5a29f6f811a22fc763083640d53d20e134e311a93","src/ir/extfunc.rs":"8b80cd4a7c82d801bad94218618843b45929ffeef0985fcf7c783a6cbaf8c950","src/ir/extname.rs":"1c64f6f00a574df282277a060bbf5564b5c51a61723eb218f183d0f0db293138","src/ir/function.rs":"1d3b88cce214d9f06d1d671a410b02ab075f38c8ee43d4a70f14c0b5ddb83190","src/ir/globalvalue.rs":"876c5249af31e874df339d5d6ce0fe5b5e4d66a1e267998656352da0c481107c","src/ir/immediates.rs":"39bdd1b75958e2899954f66d17a371dfd59a547c2cf127e29e3407580c6b888c","src/ir/instructions.rs":"309b85105569dc75331799526e257c7ced7ee3fe62901f68d23e93afd57b66ac","src/ir/jumptable.rs":"6e0bd58344848f9e16cdc9e796fdefe74a6750dbf1818a94aa76fbb6b29ce3c2","src/ir/known_symbol.rs":"8d6216401bda8a66b15b920d6d8952892bc561e430e8f2cb66d5aa11f0606b77","src/ir/layout.rs":"792555a52159ea6a868ef594f45987f6d53c6084547ca2cc0a415e425d5efb42","src/ir/libcall.rs":"335cee601260572a473c00071bae6070503089751be1459624528ed62a8ba228","src/ir/memflags.rs":"884937d069fbe7b5bf914fa9044d0fd67da9b03686af670a2ad3929780f29175","src/ir/mod.rs":"9df681140625cef52a49ec8b1aea14ec7b9bf3d46817bb9f65756f51930ea001","src/ir/progpoint.rs":"9aef1caef3bd18b825865a3380563cec92bad2046eaae81640fb7cc14e41e493","src/ir/sourceloc.rs":"118c44f629b94f083cc39c38aebef4dbd4938b65a4f7d74ef5134f605afef5f6","src/ir/stackslot.rs":"9de2c32e40f17fe487671656f525767ae236cabc73514c6fab7e75cbc7b3c98b","src/ir/table.rs":"a407e774553044775033e4ef3dd59236ea04c8df373bf2b53146f4769bb2d8ad","src/ir/trapcode.rs":"1e1a0bcd0ae0623efb0ed256c2ac58ceb08788ad7fe92ffe1ef13a953cb2788a","src/ir/types.rs":"a7a37ec281153d51d613385e3320eb85f833248cfcc1d99fe5bd48dbe64260fb","src/isa/aarch64/abi.rs":"9a50076d25185c413139c1087b9f0ec1d2e001ca9cc0a9399ac71e31a567b8aa","src/isa/aarch64/inst.isle":"b4209f554e3e9723e34edd567dab51828834c1ea2254247b594d850995f4c986","src/isa/aarch64/inst/args.rs":"8e067f366ced6ae13948cb8321895f5216b42bd85b38616f29bbb75368d47ac5","src/isa/aarch64/inst/emit.rs":"0cff9c345714bb683e2fd62dc2d2b71b44f4e6a793ed0bd418683ca7b4693b97","src/isa/aarch64/inst/emit_tests.rs":"d560fb3eef448ac8453da1700cd2d2b59a6cab4a4fa7f3fd578067f07bda67aa","src/isa/aarch64/inst/imms.rs":"fd2c311e838b95caacad2319a7817b3f182540f3b9c8dcab9d94a9c2008320ce","src/isa/aarch64/inst/mod.rs":"ab701471888ea60d8ecd43b748d6f55ff4b8ff40ed5af0ad4aa1715fbc6837ca","src/isa/aarch64/inst/regs.rs":"ad33cc5642e0f6a6d2e8327222ce62247bd7de249d86bd36783a5ccdfeb73d00","src/isa/aarch64/inst/unwind.rs":"0d06a94e614794057f224554060c8d6e0da0a01e021b92c33a1dbb3854b414f6","src/isa/aarch64/inst/unwind/systemv.rs":"741cb8a8c77d28801a22e52dcb34f77f1e748f0d680255073d6de7922bdedf0d","src/isa/aarch64/inst_neon.isle":"7c41eccc1808a0daecb5d1406a1ec3292904341cfacc4dd40bb1da7e3d932159","src/isa/aarch64/lower.isle":"b6b97c2e86900ce7628bd904ced6595dab2046a3f377c0efe5dbe657565394a9","src/isa/aarch64/lower.rs":"64325cbc7a4ffeb12c5f78eed84aa051808947c761daa31bb2502fe6394b2ea4","src/isa/aarch64/lower/isle.rs":"a2da8cbf9b9ed1f66b4d9f99fce93ab174336ea759125ee4d136bb63fba5cb4c","src/isa/aarch64/lower/isle/generated_code.rs":"451a70316fbd23e034f8e2d4a324ffe1b796f29f160e524092a740b07f4907ab","src/isa/aarch64/lower_dynamic_neon.isle":"8f72b80b081c1f326950f1e5cafdf1cd14f4b9ba4450e718a42b442b43772426","src/isa/aarch64/mod.rs":"70ebbf2cae551675b01f7ba1577df979601ad3294e66c1861af1ab39ed2d0b1d","src/isa/aarch64/settings.rs":"5c38308257b8643e910af8d69dd2939d0343adb774e8de1320ae36a2b7b109f7","src/isa/call_conv.rs":"32b5939b8ec62656ec4bd163cc2ba7e3d4759269a8b7539e2e2301bdbd5f0a6a","src/isa/mod.rs":"79a1ae5afea7d94dc7fbc2cb77d81dceec46fb05d969d87580f7a4ac03892a4a","src/isa/riscv64/abi.rs":"88b8643a77d9817039a43c422cc6a450efc35b24a5b98a0278b4a89053a4682f","src/isa/riscv64/inst.isle":"286c799f628ac7a240dca0a320a6b8e5b4cb037794ab04ba65af31c8a6390ac3","src/isa/riscv64/inst/args.rs":"cffb77ac43d030460df731824a87581aba8f4e2aa303014f40146802a5df0cf5","src/isa/riscv64/inst/emit.rs":"b1aa147851c90edb315d13edab20fe93ec879913b6e8a9b65dcda4c4fffecb25","src/isa/riscv64/inst/emit_tests.rs":"5b24a8bd56b661dc2524bf69ac026c6c7673763a99c0d1a34e71131d2e330d2e","src/isa/riscv64/inst/encode.rs":"99193d7863920e55307f7913450f66d299b77fda6910cad79708d3d4695f8755","src/isa/riscv64/inst/imms.rs":"6b81bf748c3bf3e7b7033f0f04ca3a435b1bbaa778ec69c403549eff9c5ef1cf","src/isa/riscv64/inst/mod.rs":"b31b125f4a117af1bbfd586e1abbefea5217d3b2312940b97dbf8677166e0024","src/isa/riscv64/inst/regs.rs":"5f828e55d506dcb651710181912f366f9898a12067f243bb6d911fb91e653296","src/isa/riscv64/inst/unwind.rs":"0d06a94e614794057f224554060c8d6e0da0a01e021b92c33a1dbb3854b414f6","src/isa/riscv64/inst/unwind/systemv.rs":"10ccd22030a4911a0ea4d419502f4fe66b2364e910c036cd070b64224ad3e800","src/isa/riscv64/inst/vector.rs":"5d85d48d462a145407d9e802f1a6b2e3b1159f88a36211ae9cf795b88ca464b1","src/isa/riscv64/inst_vector.isle":"530ff68e3d7dc44d26a89abf49b3d7468ece79522a3c399e3f0284bc09ce1535","src/isa/riscv64/lower.isle":"ce66397b5f0a8685c99d9943346b897375e9a3bbf95e33e6c32a28f271f33aac","src/isa/riscv64/lower.rs":"43a2f3b81ba5c921dc6e053a5b49bacf826b8373e815b89004edb862764f2174","src/isa/riscv64/lower/isle.rs":"c0444ee65e0b14ca722983643369afb626064c2d8753528cedefcf9b8e9e41a3","src/isa/riscv64/lower/isle/generated_code.rs":"ef99375c9ca3013102c98f87a8c84c4171d550cb6ecfe5849bf81bb21f272891","src/isa/riscv64/mod.rs":"ab724fd13d560494c5b1fb06f90dff0ee2477585f6a08548e929544672251933","src/isa/riscv64/settings.rs":"39c26a31ffa46e524859fef756ad7ea523b9609acd16b0748655cc58f2fe0ad3","src/isa/s390x/abi.rs":"f66c2fb2cd3f39a3a1b43a1b6f17a6e3cc6f8be281e4280b7e5d13ea1174d025","src/isa/s390x/inst.isle":"98046e53a425f63b7a1d77ad2c25ee62674bd1c1e56162339435fbfb93a67494","src/isa/s390x/inst/args.rs":"a2e67d87b265aed0fea3d7250bfbd3c5742cc56d9c5d3ec26fbfc9f7fcfd837a","src/isa/s390x/inst/emit.rs":"ec60d6c94ef44fb0bf99a6b586a2a9af54b5cd5173163c53572cf23992d6d5e5","src/isa/s390x/inst/emit_tests.rs":"c16c8280f7864ce6164cf6aeadbf8895ffb683ac5ce69eeb8b6f9994500bdfb1","src/isa/s390x/inst/imms.rs":"6ebc56fe65eab3b00438d6c87a8681fe4bbb70c1cd4086e816d6d768149c8715","src/isa/s390x/inst/mod.rs":"2470279f49287d6a83ff5168055644e138bf35e223c90d3fc55bbf63f0e20df8","src/isa/s390x/inst/regs.rs":"675b2cad6caa970e70ada65665fae6c8bb8d47e6008c604d6b2e9f115311a05b","src/isa/s390x/inst/unwind.rs":"0d06a94e614794057f224554060c8d6e0da0a01e021b92c33a1dbb3854b414f6","src/isa/s390x/inst/unwind/systemv.rs":"0a394167318d2227f70f6d46653a395faa89fa6ade2312374b3fc0d3d3439ca0","src/isa/s390x/lower.isle":"f88e96da8adfb9143539be7fd5b6602a5d45081cc2c6cac5531ca5b7a7d903f5","src/isa/s390x/lower.rs":"5bee34b4f4d7aeedb6e87591f3267e0d91006e531627c098f152263085fd5ec6","src/isa/s390x/lower/isle.rs":"24eb951ca2ccd79875b8ed834abb260d657cc1e70deabb7324a31265adfe59c1","src/isa/s390x/lower/isle/generated_code.rs":"8023d945019bc36ce26de7d48dd3010bff215e2a0eeb4b2fdbc4d5cd3146d5ab","src/isa/s390x/mod.rs":"8f1538f2d4bc1f2424a71ea1c7f906c3369a062564846ea3c27a3780d3de59c0","src/isa/s390x/settings.rs":"064f84148f1bbffe440792c8b0337899b3f5bb1fd8c72b4b8d7c56faa5b93517","src/isa/unwind.rs":"3d600ce0aa11e44a30f446a7a117c66ed2747de8b28bddc513d126201301dc9a","src/isa/unwind/systemv.rs":"2b06611e78927de2abc282a851909007d2e83107b7dd590097c59359d35a0508","src/isa/unwind/winx64.rs":"88743c4299c6663c089ba1c8a6a6af1ffdec9b3963293ee1786b62d85df8b5e5","src/isa/x64/abi.rs":"dc7b7ee99d3738d3ae62b01ce83a9716eb352592c83b10bfa8ae8fc843a9ffb3","src/isa/x64/encoding/evex.rs":"8e218feb50c229cf8002138ec866bcd2ac67de7f6edd29993226788bac07c69e","src/isa/x64/encoding/mod.rs":"0a0b63345f26e355b1a3e8f25d22e444dd32f53b6cf8978208d1bd3c33418876","src/isa/x64/encoding/rex.rs":"f96973f2581672089e91045497cc15ad2ecfe129d4c19deedf2160717a7c7350","src/isa/x64/encoding/vex.rs":"7518d403e490795dee0c32daa117629d9610bf12586e1231f933dcb877b775fc","src/isa/x64/inst.isle":"66e55c47c28421ecbfba765b491f94bd8dfcae4e2856f33640c7461b386b5ab7","src/isa/x64/inst/args.rs":"67f9408698ea861d388ce2af18492f966a62fd79bae389b64cec8de5539b2975","src/isa/x64/inst/emit.rs":"7369d6735406e67e98ef5a4ca9e9e7cec19d0422769dbd9e18f2c826f45fb142","src/isa/x64/inst/emit_state.rs":"b2706b4a35a153cd2b9b31ecd96c013f75b5a589dbfa7f9dbd6b4605d5f6f3da","src/isa/x64/inst/emit_tests.rs":"23507878b063114402482191dbb587175030c990263f82186110198be6c70f79","src/isa/x64/inst/mod.rs":"ee75ebf832f2222890a3853e9286c0c4b7029efa581cc6321dd4ea8a4e8d44ae","src/isa/x64/inst/regs.rs":"20167e9268dcb1273fd5b4101564d2342d842a21e7236285a74b78e837188069","src/isa/x64/inst/unwind.rs":"3ef395c2108a0a3b5e48e52453276e212ea92f644a5007c427ed60f12c8daf1b","src/isa/x64/inst/unwind/systemv.rs":"9a2f503ab94d1ac90c2a187b89a5beafeb101c33ba624c26afd8fe9a4fb8cb65","src/isa/x64/inst/unwind/winx64.rs":"e71e9dde687b85cdddfacad0f6000d18b24fdc29664cc208c244eb56a9d5b7c9","src/isa/x64/lower.isle":"1d12bac337ee3779646e77b23d4c2ca2ee48f738ae1ce0a0263d7266c1d1024a","src/isa/x64/lower.rs":"1659d3e38c922eced0aac43af36f07cf2cfeb80b5f41e62a862f0a60f7da2168","src/isa/x64/lower/isle.rs":"0cff98207e3e479a76298d9378e315373cf4f946339e5ffa7bba9a8593c1f7c1","src/isa/x64/lower/isle/generated_code.rs":"4a0a84669a42942bd9837323590fb267914baa2e4cfa9f313fe16b3a4434388e","src/isa/x64/mod.rs":"0bfd5ac122c7a472ff8d19727fc31720093ea609512e48da562b1c5e0b1519cf","src/isa/x64/settings.rs":"0e8cf4bbd126bce457045a4a51504f31188d95aaaa2ec9f896010443bc382fc4","src/isle_prelude.rs":"f75d8331c4bcc9b8f305bdd180e1330b4ebf11d89ea55f06dfde0ac78702fd14","src/iterators.rs":"d399a80bc65b97f7d650978e19086dcc1d280ac96d60628eac3d17eb363b0d71","src/legalizer/globalvalue.rs":"1224fabe125bd745d2d2f67f95311dfd737c5900d9bbe5b6323654c7a39287c4","src/legalizer/mod.rs":"3bce3bd0c87ef5c6c634b18c136aa85cb09e1cfdfa81859aa8b446e04bbb2d17","src/legalizer/table.rs":"60b356b9af9ff443db8c939a915ffb462011bc32d50bce55207b01f15834122f","src/lib.rs":"22f6dbc48b7a8b495f4683e71ee998f8ec403eb88fb9ac8c3a5afabf27355a62","src/loop_analysis.rs":"8b722f758a083452cf5cde3894e3a36c91f0cd9a444be415f228d780ac197fbf","src/machinst/abi.rs":"8a3884f55c675f948b739a3339dbe7d214292519d6a8ba9934f59c7cafc43f07","src/machinst/blockorder.rs":"b033146270e62aff56274ae12cd14273e4c7636542ef806bf0fa20605e361a24","src/machinst/buffer.rs":"9ad0d3a122c4e04ce0d8e41d19535e7002c68213f1dd9961a4ab237636c2650b","src/machinst/compile.rs":"8ec728f9024354388a936e57aa3ddc445187fbe1822e3054d2101ace69d071b4","src/machinst/helpers.rs":"0da745e5a3bf853c0906fbd4dcd6bd42a13d9085ce7f1f4678fdad353d279d52","src/machinst/inst_common.rs":"ce7ee9c4fe59b9a8d899ffd25e3c783cfc0f0b236958cf683368fd63d959ed1e","src/machinst/isle.rs":"0ef3cb7cd75a46843fca3bcf6b8ac1ded5af3270402e5bf6e065d3b5db397fb3","src/machinst/lower.rs":"c9756acf7ef28927e7ce6c5fec4c3f88ad385fcdecc9c2af5d6622dfe3f0ac82","src/machinst/mod.rs":"97c48a0839c69d3d0b3041e271492939936f45aa62b80f859832e664c8b5d4cc","src/machinst/reg.rs":"5a00faf0e38c00f70c48daeb5b47382a41ff725429e854375b419c85f4652f76","src/machinst/valueregs.rs":"b3db7cc4c944bf3e0e2fe9292e37174a2218c5f3f03f280543e3ac0e77efbef7","src/machinst/vcode.rs":"4c589bc6d5544dd088b6a5ef0d89aa49be14b0d4cf519980c3e96cde7397ba73","src/nan_canonicalization.rs":"67eb44595ea5f315203d89259cb313a088595c99aada35b800934922f0f81f1a","src/opts.rs":"3708918505230c4d74e2f92b5dea56a3979dadb1a079c84be01fc3531e8e966f","src/opts/README.md":"7d15730545d0c65ff7b7dc72daa68a120ff1675d2b7e6daaaf7e8068deae8877","src/opts/arithmetic.isle":"f0389262957ef2309eeec123dae7b4258ad6a036d32abf52ca3c64411135b7a1","src/opts/bitops.isle":"10c87329b5da4028a750e140cdb8ffa17779181ad2e3fb4ac8164b5b83cafffd","src/opts/cprop.isle":"9397edbb9331cf610791ca03b771cd7f716650b53d673dd2b0d1ddeca4db8c43","src/opts/extends.isle":"e8c725bf5a67a07662e1b1459c1589f0610b85ae9011e4405050bacdc6089683","src/opts/generated_code.rs":"4118df519dab79662071dd857471ab67a0d5428d2190904d3caca11f3bb8595e","src/opts/icmp.isle":"4b1bc175f950fa187b7c9ebd6bb4ba3780ff86972e023792ce033da0b0f25fbf","src/opts/remat.isle":"f996f00c2b2d8607a32305b8665b7088779de0fb6fd23cabb38a2c8a2c9accc3","src/opts/selects.isle":"9c719191b367f59439d05f4fe2e6e82e74407f1fc89b583a4919831c7e114157","src/opts/shifts.isle":"629c8c4b4e74388f67efb183b173d86b60059da34143804918748dfa4e54efd3","src/opts/vector.isle":"c186cc45902c99a9c81b4181e04ecb76bd621e0f11fc7219c29fb5349f38f9ca","src/prelude.isle":"157d9a6f43d2095a956405da862f796ca64db5845da1e930601d1fbaf7f88fa0","src/prelude_lower.isle":"41043a10f14ee1598a1ebda8599417d0c3fa5645dd8c319b71a183f29132dd98","src/prelude_opt.isle":"80046a0eb96369cc3970366670c52bcae23d4852cd3a9d364ad413434f16319b","src/print_errors.rs":"af74ce5d9d9863607022353f39fbb5fe16fff43de3a4abea366209df3ba77e3d","src/remove_constant_phis.rs":"e814421ee2825ec73e701176d6b6a87e77758420e63711837a649ee26172927b","src/result.rs":"7d156f2aa6442cb5d7eed4bd86633a2e27119c3f9affc98feb5aeaf10b07b20e","src/scoped_hash_map.rs":"e2c3ff8bb5aa214fc68dd4a596e20b4fc70b3bc8ed81dd41988170dc4d883dff","src/settings.rs":"6d1041b6f89f336a08662eeb6c8068812bd616712266f11c327f0b2a99e931d1","src/souper_harvest.rs":"a101686d3d5e23ec617ddbce222e0d1058b136e4d6dd8a2cbfb44be15aa3dbae","src/timing.rs":"aa04c7c6670e4576456d9e59dac5ba27f2272e40f41a41361531ce3c5d19b085","src/unionfind.rs":"e01f9094c0a463f0700bbf5ecdb76b5b50e73b81c795e1846953bf6634b56d1a","src/unreachable_code.rs":"607dd0f78067ed69da6c8fa1dde915b2fed1f71a39195086531ed6617e819544","src/value_label.rs":"a2b663f93bbfc84731b4f41347a26ae9e27ea9e8028c6b374dc222412eb9c493","src/verifier/mod.rs":"bd8659ae57d8e7ed54218cdcab1e31eedc7c43b7a9d3a3fcdf34696a983bf408","src/write.rs":"6ff8b48f47cfaad25e4953de0fc6aa705ef94858350e576ba41390c60b8ca67b"},"package":"38849e3b19bc9a6dbf8bc188876b76e6ba288089a5567be573de50f44801375c"}