wasmtime 12.0.1 → 13.0.0

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

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

@@ -0,0 +1 @@
+{"files":{"Cargo.toml":"b311c0e17c3a9ffb973adef19296b0af9e225cfc673899430231bc5253601014","LICENSE":"268872b9816f90fd8e85db5a28d33f8150ebb8dd016653fb39ef1f94f2686bc5","README.md":"e5127227a7db4a8aa92fa6613ed71801025790e696bb41b0323fb7f3c6f7495a","benches/x64-evex-encoding.rs":"d44fe0567d4a2b8a9dd2e1daf0994601918f4853dcd073c8c99c15e40d6297c9","build.rs":"3e9ca6781ef9a2a5160fe9d2aee0c994daaec2152edf97f38d91c56276701aad","src/alias_analysis.rs":"237987373be696035c2f389ce50895eb2eb24b448b6b769d2dc059c71a48251f","src/binemit/mod.rs":"b25e4bdc981b63a3a095237fc10e6a44ced939d7dfb634eb710d0d5e6d877e1f","src/binemit/stack_map.rs":"56fc98d53f05af11b36dee2f4a466adca907225b9c9327526c3af06af49844df","src/bitset.rs":"9ccedd1edb5bd448450a852707c0229ceb7e3812c48c2d0b05eaa17ad982f0d0","src/cfg_printer.rs":"5679b6b4ce2234aff00825d7e97ba9bed85dd19c4973d4b0fc7abd4914979e59","src/constant_hash.rs":"8f53afb38891fbdab8553c7a89e61f0ce30947a22fb24ae84523c9a1ab025c3f","src/context.rs":"17e65a334f15956cfeaa8c268ee76babcd4c217439165ee638598407e185d355","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":"e7dd88a04f5136da0187f7a49c845b68bb1cbc9f40927a12e05ca65972798805","src/inst_predicates.rs":"bd704ea76cdbc656d040a623b2f6cde96f5fd93d35c893de5b7b68f925c6c2a5","src/ir/atomic_rmw_op.rs":"f4bb1aba71533f50a27e0da76e22d06bf02e0a6af5bf77401576b5598b7d2725","src/ir/builder.rs":"6aa97b66754fc7476032d897813b0ed321044df11ae9019ba91260ce74384d9c","src/ir/condcodes.rs":"a03c9c208bb42e91c8f913c1ca556a7aeed17f1f99d40d68776c7680aa3af440","src/ir/constant.rs":"78f160600b19b850a70dc8242b581908d746da97324d59bc5a417076d237e62b","src/ir/dfg.rs":"21b0bbe338ab2469e939364712dd6f4d9b234767c8a1ba21b16fe4dde164832a","src/ir/dynamic_type.rs":"61d2fc20f0f0d0a56c45f19db5656692f49c3b7ba5519490891c548561e51d41","src/ir/entities.rs":"48c806be7003c4fdca2bf82d7811bf67e6310b0c7345c064e174624dd6af4bb5","src/ir/extfunc.rs":"014a51a484b15baf5524e71886e0576456cd0eef74cb7232f96f3876fcd92022","src/ir/extname.rs":"3c2613c7c0c7eade8011985252025981b93cdb84f33231d7dcb182d97bd05e72","src/ir/function.rs":"a7bed5e3d8a5e6220d5babc12a882d61090edff1bcaa7683187ae597dfb3ed7e","src/ir/globalvalue.rs":"a9a4973aac26bd5309ecb3faf58e4202b34787a00fa293e49133da4cd153386b","src/ir/immediates.rs":"668ca054683e29415bbc55ef60a9d36448d1571710d5c810984b4924d0bcdf58","src/ir/instructions.rs":"e47b86ac6de1a957a8bcd236f735fc17dc3d69a081740fb4b2f6603519b45a23","src/ir/jumptable.rs":"5b49da5fbae2a6840bc96613e4d5fa6834fbdff2d03125e67b90c93f186de5e6","src/ir/known_symbol.rs":"daad9ff92b224fae0ab3553e7366675830556b146933fec6946c697d635bf48a","src/ir/layout.rs":"792555a52159ea6a868ef594f45987f6d53c6084547ca2cc0a415e425d5efb42","src/ir/libcall.rs":"7e3a55e8cf7401630f9818ea3dfa845f1af1c3e8f1d8dcb587f5df15fb996b4c","src/ir/memflags.rs":"c5a29158c7cd065f40a486b72ab196a3cf6764c50b958994b9440d6b27737ab7","src/ir/mod.rs":"8ca102449dd06e2859270a78151a20f1a5b2a8aa27d5e7b40056d7dd8a6fdce9","src/ir/progpoint.rs":"9aef1caef3bd18b825865a3380563cec92bad2046eaae81640fb7cc14e41e493","src/ir/sourceloc.rs":"a4f2d0e51c50d9caab15f493999cb12916d525600de638b43e6f0b785b856404","src/ir/stackslot.rs":"91a4ccd739fa6e7d9912dec0849e1df1d9a5e656d6da80d1e1b01a0665fcd6cf","src/ir/table.rs":"5284de52d4efe3ba65b7c1b6d4b107a62f0be588788208408a8cfaef188a2398","src/ir/trapcode.rs":"7fc41749d7c293f39d090dd087eab1481bc71b6ff3fb5e6242cc50adc4e7e43e","src/ir/types.rs":"112581966df3b9dfecf51bfe68a5029cdc7621866eb0821bc03c51990ec98656","src/isa/aarch64/abi.rs":"e812e13e94bf3340d97ee56618fae052a82ae36afeb79bfacc7b7cfb34f4d022","src/isa/aarch64/inst.isle":"1f39b148451a6d77643ef7b2101233074e28ad7177099f4fe3a6ee241ec04069","src/isa/aarch64/inst/args.rs":"84b626aa3ef13a4e9585f288dc42113100ec2feae18ab62035d500d2a707eb08","src/isa/aarch64/inst/emit.rs":"dcbdd6254e159cc5adf5c074da2b209f1b78a902febb0a6942a4c305c7ed60e2","src/isa/aarch64/inst/emit_tests.rs":"c971396a706e8f426299c10cfc710c9cb6231522ab4c0182d076d1d2b238e901","src/isa/aarch64/inst/imms.rs":"fd2c311e838b95caacad2319a7817b3f182540f3b9c8dcab9d94a9c2008320ce","src/isa/aarch64/inst/mod.rs":"803446727d4acb3fa853e12c1cd12502945d17cd3fcd70490afe392ef2587c72","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":"236197814a8f2a72fc9d3af9010e55382e641c21f5392c77579c004c2f9fc4c4","src/isa/aarch64/lower.rs":"2c6a45cfef6c962d3162d9596feacd04dbf5d923f182f6909ab09d83ae9f0373","src/isa/aarch64/lower/isle.rs":"808d9a591e2bd468074fa2909376a23a9901579aa5ed885a6340edf0c1ddb975","src/isa/aarch64/lower/isle/generated_code.rs":"451a70316fbd23e034f8e2d4a324ffe1b796f29f160e524092a740b07f4907ab","src/isa/aarch64/lower_dynamic_neon.isle":"3ec49bfb7f99d00abda7ac37c9d801b61579381f7a436837a73fcb9209683e2b","src/isa/aarch64/mod.rs":"70ebbf2cae551675b01f7ba1577df979601ad3294e66c1861af1ab39ed2d0b1d","src/isa/aarch64/settings.rs":"5c38308257b8643e910af8d69dd2939d0343adb774e8de1320ae36a2b7b109f7","src/isa/call_conv.rs":"e7204d21d48d74ca893c6f4c1badabe73727a5d76ac4be708783a3b581eac488","src/isa/mod.rs":"79a1ae5afea7d94dc7fbc2cb77d81dceec46fb05d969d87580f7a4ac03892a4a","src/isa/riscv64/abi.rs":"e69a563f11e55bad5a47b361efbb2db9d3434362a9839b936320f778dee9cd37","src/isa/riscv64/inst.isle":"ad604d5ac337fc9bc2656a9dc93e4b66a8a5ddaf66abd2013b65bfe333df7694","src/isa/riscv64/inst/args.rs":"18ac52527cc4e37cbbc7e80769625f7f2795c922d1f387a665d53745da3b5b7f","src/isa/riscv64/inst/emit.rs":"ab489853a975f33c14ce617fb41d4db811a4170f3cf52155638873aa09b5e80d","src/isa/riscv64/inst/emit_tests.rs":"5b24a8bd56b661dc2524bf69ac026c6c7673763a99c0d1a34e71131d2e330d2e","src/isa/riscv64/inst/encode.rs":"0cee771a1f5a8c1aa67e1a4f4c1cc5b4f20402481e6cd31e387228eec290e92b","src/isa/riscv64/inst/imms.rs":"1a08f4b3bfdc2f0ea97b9d10c43cd6b1a68f79e415f3cd58f36cee6f6388e2c6","src/isa/riscv64/inst/mod.rs":"a506dd1f24d6024ef8ce5faf65ec8622d75edb04e58ab839a0896dc15b40daab","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":"a64372fab1c2e008a849cc4215e593077627a503bbb3619dcf34725372232c45","src/isa/riscv64/inst_vector.isle":"846bde3e256dbd936a4ad6e80779eb78d00d43d590dabe3095302b36c5fb0f9a","src/isa/riscv64/lower.isle":"3324d12adbc5a042dafc936e4080eb51ad4131f4849d62174d42accbd3f7617b","src/isa/riscv64/lower.rs":"43a2f3b81ba5c921dc6e053a5b49bacf826b8373e815b89004edb862764f2174","src/isa/riscv64/lower/isle.rs":"4148fdc8da4e90ee66fcf8cf5103466cf615f8c7ce590dcc9ce09ed840166f2e","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":"91d541cb77909c9ee877ead9ac238c42823e1a5e4ba4cb9da7a98595361da355","src/isa/s390x/inst.isle":"ef2a02c96f578154d62c3d1eacdf8f9dbc0424e8da8327e9c277bc683f81100e","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":"a091c7e181a059204157df808c5b034f001c536c2e2cf48200763c6dfe9fa49e","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":"dfa2791ff4460d27bca9ed3b5818a03193dec62c40dda1cb4e757e73fc744bdf","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":"0416a09832c73d6779e3f578f38da92cb0def94291f64854a4788e4d3fa56e0b","src/isa/unwind/systemv.rs":"040cfa49ac7fa6facb7938c339e91973552c5d5e924ca924c915abe1933a1972","src/isa/unwind/winx64.rs":"8f9404c2e555c4a84f587e8a61461b3b06c66456eb10cec94cb31c70b77c8451","src/isa/x64/abi.rs":"1d257f98dcf0104fb082132e5588b16beb4f99458058bd51d3927f845fcf08d2","src/isa/x64/encoding/evex.rs":"7d4354e6b57944f624c2cf5a662e9bc8a2c020314022d200604a3465949270f2","src/isa/x64/encoding/mod.rs":"0a0b63345f26e355b1a3e8f25d22e444dd32f53b6cf8978208d1bd3c33418876","src/isa/x64/encoding/rex.rs":"f3ce0a150cad2d47f2569ea31ca7614760eda6fe852af93ec33f5d7d14501688","src/isa/x64/encoding/vex.rs":"7518d403e490795dee0c32daa117629d9610bf12586e1231f933dcb877b775fc","src/isa/x64/inst.isle":"c37ab7000f18aff6ae9a31e6f8b10028c5b12033eff9a4a464b6dba63f373d9d","src/isa/x64/inst/args.rs":"572f4c646b76277f0a59912fb2c5627093b3d3fb90f8728faf70090bf807b081","src/isa/x64/inst/emit.rs":"e7fb91813996cc97c9921f18bb95b41d5289fa3b4fa4bc6e8cc36f13bcdec94e","src/isa/x64/inst/emit_state.rs":"b2706b4a35a153cd2b9b31ecd96c013f75b5a589dbfa7f9dbd6b4605d5f6f3da","src/isa/x64/inst/emit_tests.rs":"47ebae1e14b01d91320560423ab2ee04848dfff37dac72fe575824b5a91605bb","src/isa/x64/inst/mod.rs":"f457d8917e8a075d61679fb4d6902b84a1825fbfe79e55ddfdc770e2d475bad8","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":"49b794ff9a21fc4c05be9e1ecec11711628a872742c5f79265bf938181ccd002","src/isa/x64/lower.rs":"207d6b12209229b9684c58d734a6250cfa9edb25d0c600e402baa4ada5318dd7","src/isa/x64/lower/isle.rs":"70d50a2c4d8fdd56061bb14d15d23b50768acef1f62091130e780d7e081eec2f","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":"17df77b44404ac09712142e5586c43c1b327790c20e47e36bc501da282839323","src/iterators.rs":"d399a80bc65b97f7d650978e19086dcc1d280ac96d60628eac3d17eb363b0d71","src/legalizer/globalvalue.rs":"1224fabe125bd745d2d2f67f95311dfd737c5900d9bbe5b6323654c7a39287c4","src/legalizer/mod.rs":"2d09afa270e606a5ea553babf6a3f5cfdd42fbe4541b1c3272d010cafb86a86a","src/legalizer/table.rs":"60b356b9af9ff443db8c939a915ffb462011bc32d50bce55207b01f15834122f","src/lib.rs":"bc0e3749af6fad17381545307279e9bfbe179289716b93ecf5e888b0e18bf986","src/loop_analysis.rs":"8b722f758a083452cf5cde3894e3a36c91f0cd9a444be415f228d780ac197fbf","src/machinst/abi.rs":"0516128c1dfad43ce5e1e442a71262b58a70e4cb37d2526fad0e57cfe3a5f13c","src/machinst/blockorder.rs":"b033146270e62aff56274ae12cd14273e4c7636542ef806bf0fa20605e361a24","src/machinst/buffer.rs":"ebd761e1d899f3ccb9127a4e94ddca4a9027fa37731bbe8572372244e5eff105","src/machinst/compile.rs":"8ec728f9024354388a936e57aa3ddc445187fbe1822e3054d2101ace69d071b4","src/machinst/helpers.rs":"0da745e5a3bf853c0906fbd4dcd6bd42a13d9085ce7f1f4678fdad353d279d52","src/machinst/inst_common.rs":"ce7ee9c4fe59b9a8d899ffd25e3c783cfc0f0b236958cf683368fd63d959ed1e","src/machinst/isle.rs":"08ce39618c1a8589198c1ae8c97c7715c63f64832469072480d75c32db4b205d","src/machinst/lower.rs":"c9756acf7ef28927e7ce6c5fec4c3f88ad385fcdecc9c2af5d6622dfe3f0ac82","src/machinst/mod.rs":"719d6e185b70587bf412d4f23ca5dcf89de5fe8b642871df3e5ecbec698a770d","src/machinst/reg.rs":"d9104391d9d8c5d64a238dfa11da0816d57158a91f733dcb9f124916e0417061","src/machinst/valueregs.rs":"b3db7cc4c944bf3e0e2fe9292e37174a2218c5f3f03f280543e3ac0e77efbef7","src/machinst/vcode.rs":"9dc14505563c09e821abd86f8cea52ad3cd923015835da1deb7b4dc6761e67e2","src/nan_canonicalization.rs":"67eb44595ea5f315203d89259cb313a088595c99aada35b800934922f0f81f1a","src/opts.rs":"3708918505230c4d74e2f92b5dea56a3979dadb1a079c84be01fc3531e8e966f","src/opts/README.md":"7d15730545d0c65ff7b7dc72daa68a120ff1675d2b7e6daaaf7e8068deae8877","src/opts/arithmetic.isle":"f0389262957ef2309eeec123dae7b4258ad6a036d32abf52ca3c64411135b7a1","src/opts/bitops.isle":"16b84da91e8a06dacf63242f2d6a90ca10f3f8b42a315ee734367894fbbb9af4","src/opts/cprop.isle":"436c603b15e6024a4b2fcc1f3e72234fffeac4b4e2d496a87862d1567e927b3a","src/opts/extends.isle":"4d0036102c92e9ae8fd6b2abb81b887f180bffe1c7394397e8e4dca390994ea0","src/opts/generated_code.rs":"4118df519dab79662071dd857471ab67a0d5428d2190904d3caca11f3bb8595e","src/opts/icmp.isle":"3859980213207027e86baa5f9ce717b88bf530d395ae982bbfd7b21b95c84513","src/opts/remat.isle":"f996f00c2b2d8607a32305b8665b7088779de0fb6fd23cabb38a2c8a2c9accc3","src/opts/selects.isle":"3dc2092caf8241ca1c86ac0ed3b86e07b7c27b48dbc0b9c16469b2ec1a2159d7","src/opts/shifts.isle":"629c8c4b4e74388f67efb183b173d86b60059da34143804918748dfa4e54efd3","src/opts/vector.isle":"3a45f5b33f1619618fc34875b456023525dffd02aa76afbb6941d77c5bfe9330","src/prelude.isle":"8c88738b2365ae1af8113e204f205d04281c1c88f4431aa159f8713b2cf2bfb1","src/prelude_lower.isle":"e7ee97ba482812a49eb70204eea80e186e6127b440096163f12d54905e8135e2","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":"207f8147d0eec1c51a0e367d7761f4efa9b18c2288a074a4ecee6704dbe2c83a","src/verifier/mod.rs":"8f7cab9eff81628fe7d5c1f409c8a3117018cd499af1ae91410a23caa5ae33b1","src/write.rs":"6ff8b48f47cfaad25e4953de0fc6aa705ef94858350e576ba41390c60b8ca67b"},"package":"5528483314c2dd5da438576cd8a9d0b3cedad66fb8a4727f90cd319a81950038"}