wasmtime 12.0.1 → 13.0.0

data/ext/cargo-vendor/cranelift-entity-0.99.1/src/sparse.rs

@@ -1,368 +0,0 @@
-//! Sparse mapping of entity references to larger value types.
-//!
-//! This module provides a `SparseMap` data structure which implements a sparse mapping from an
-//! `EntityRef` key to a value type that may be on the larger side. This implementation is based on
-//! the paper:
-//!
-//! > Briggs, Torczon, *An efficient representation for sparse sets*,
-//!   ACM Letters on Programming Languages and Systems, Volume 2, Issue 1-4, March-Dec. 1993.
-
-use crate::map::SecondaryMap;
-use crate::EntityRef;
-use alloc::vec::Vec;
-use core::mem;
-use core::slice;
-use core::u32;
-
-#[cfg(feature = "enable-serde")]
-use serde::{Deserialize, Serialize};
-
-/// Trait for extracting keys from values stored in a `SparseMap`.
-///
-/// All values stored in a `SparseMap` must keep track of their own key in the map and implement
-/// this trait to provide access to the key.
-pub trait SparseMapValue<K> {
-    /// Get the key of this sparse map value. This key is not allowed to change while the value
-    /// is a member of the map.
-    fn key(&self) -> K;
-}
-
-/// A sparse mapping of entity references.
-///
-/// A `SparseMap<K, V>` map provides:
-///
-/// - Memory usage equivalent to `SecondaryMap<K, u32>` + `Vec<V>`, so much smaller than
-///   `SecondaryMap<K, V>` for sparse mappings of larger `V` types.
-/// - Constant time lookup, slightly slower than `SecondaryMap`.
-/// - A very fast, constant time `clear()` operation.
-/// - Fast insert and erase operations.
-/// - Stable iteration that is as fast as a `Vec<V>`.
-///
-/// # Compared to `SecondaryMap`
-///
-/// When should we use a `SparseMap` instead of a secondary `SecondaryMap`? First of all,
-/// `SparseMap` does not provide the functionality of a `PrimaryMap` which can allocate and assign
-/// entity references to objects as they are pushed onto the map. It is only the secondary entity
-/// maps that can be replaced with a `SparseMap`.
-///
-/// - A secondary entity map assigns a default mapping to all keys. It doesn't distinguish between
-///   an unmapped key and one that maps to the default value. `SparseMap` does not require
-///   `Default` values, and it tracks accurately if a key has been mapped or not.
-/// - Iterating over the contents of an `SecondaryMap` is linear in the size of the *key space*,
-///   while iterating over a `SparseMap` is linear in the number of elements in the mapping. This
-///   is an advantage precisely when the mapping is sparse.
-/// - `SparseMap::clear()` is constant time and super-fast. `SecondaryMap::clear()` is linear in
-///   the size of the key space. (Or, rather the required `resize()` call following the `clear()`
-///   is).
-/// - `SparseMap` requires the values to implement `SparseMapValue<K>` which means that they must
-///   contain their own key.
-#[cfg_attr(feature = "enable-serde", derive(Serialize, Deserialize))]
-pub struct SparseMap<K, V>
-where
-    K: EntityRef,
-    V: SparseMapValue<K>,
-{
-    sparse: SecondaryMap<K, u32>,
-    dense: Vec<V>,
-}
-
-impl<K, V> SparseMap<K, V>
-where
-    K: EntityRef,
-    V: SparseMapValue<K>,
-{
-    /// Create a new empty mapping.
-    pub fn new() -> Self {
-        Self {
-            sparse: SecondaryMap::new(),
-            dense: Vec::new(),
-        }
-    }
-
-    /// Returns the number of elements in the map.
-    pub fn len(&self) -> usize {
-        self.dense.len()
-    }
-
-    /// Returns true is the map contains no elements.
-    pub fn is_empty(&self) -> bool {
-        self.dense.is_empty()
-    }
-
-    /// Remove all elements from the mapping.
-    pub fn clear(&mut self) {
-        self.dense.clear();
-    }
-
-    /// Returns a reference to the value corresponding to the key.
-    pub fn get(&self, key: K) -> Option<&V> {
-        if let Some(idx) = self.sparse.get(key).cloned() {
-            if let Some(entry) = self.dense.get(idx as usize) {
-                if entry.key() == key {
-                    return Some(entry);
-                }
-            }
-        }
-        None
-    }
-
-    /// Returns a mutable reference to the value corresponding to the key.
-    ///
-    /// Note that the returned value must not be mutated in a way that would change its key. This
-    /// would invalidate the sparse set data structure.
-    pub fn get_mut(&mut self, key: K) -> Option<&mut V> {
-        if let Some(idx) = self.sparse.get(key).cloned() {
-            if let Some(entry) = self.dense.get_mut(idx as usize) {
-                if entry.key() == key {
-                    return Some(entry);
-                }
-            }
-        }
-        None
-    }
-
-    /// Return the index into `dense` of the value corresponding to `key`.
-    fn index(&self, key: K) -> Option<usize> {
-        if let Some(idx) = self.sparse.get(key).cloned() {
-            let idx = idx as usize;
-            if let Some(entry) = self.dense.get(idx) {
-                if entry.key() == key {
-                    return Some(idx);
-                }
-            }
-        }
-        None
-    }
-
-    /// Return `true` if the map contains a value corresponding to `key`.
-    pub fn contains_key(&self, key: K) -> bool {
-        self.get(key).is_some()
-    }
-
-    /// Insert a value into the map.
-    ///
-    /// If the map did not have this key present, `None` is returned.
-    ///
-    /// If the map did have this key present, the value is updated, and the old value is returned.
-    ///
-    /// It is not necessary to provide a key since the value knows its own key already.
-    pub fn insert(&mut self, value: V) -> Option<V> {
-        let key = value.key();
-
-        // Replace the existing entry for `key` if there is one.
-        if let Some(entry) = self.get_mut(key) {
-            return Some(mem::replace(entry, value));
-        }
-
-        // There was no previous entry for `key`. Add it to the end of `dense`.
-        let idx = self.dense.len();
-        debug_assert!(idx <= u32::MAX as usize, "SparseMap overflow");
-        self.dense.push(value);
-        self.sparse[key] = idx as u32;
-        None
-    }
-
-    /// Remove a value from the map and return it.
-    pub fn remove(&mut self, key: K) -> Option<V> {
-        if let Some(idx) = self.index(key) {
-            let back = self.dense.pop().unwrap();
-
-            // Are we popping the back of `dense`?
-            if idx == self.dense.len() {
-                return Some(back);
-            }
-
-            // We're removing an element from the middle of `dense`.
-            // Replace the element at `idx` with the back of `dense`.
-            // Repair `sparse` first.
-            self.sparse[back.key()] = idx as u32;
-            return Some(mem::replace(&mut self.dense[idx], back));
-        }
-
-        // Nothing to remove.
-        None
-    }
-
-    /// Remove the last value from the map.
-    pub fn pop(&mut self) -> Option<V> {
-        self.dense.pop()
-    }
-
-    /// Get an iterator over the values in the map.
-    ///
-    /// The iteration order is entirely determined by the preceding sequence of `insert` and
-    /// `remove` operations. In particular, if no elements were removed, this is the insertion
-    /// order.
-    pub fn values(&self) -> slice::Iter<V> {
-        self.dense.iter()
-    }
-
-    /// Get the values as a slice.
-    pub fn as_slice(&self) -> &[V] {
-        self.dense.as_slice()
-    }
-}
-
-/// Iterating over the elements of a set.
-impl<'a, K, V> IntoIterator for &'a SparseMap<K, V>
-where
-    K: EntityRef,
-    V: SparseMapValue<K>,
-{
-    type Item = &'a V;
-    type IntoIter = slice::Iter<'a, V>;
-
-    fn into_iter(self) -> Self::IntoIter {
-        self.values()
-    }
-}
-
-/// Any `EntityRef` can be used as a sparse map value representing itself.
-impl<T> SparseMapValue<T> for T
-where
-    T: EntityRef,
-{
-    fn key(&self) -> Self {
-        *self
-    }
-}
-
-/// A sparse set of entity references.
-///
-/// Any type that implements `EntityRef` can be used as a sparse set value too.
-pub type SparseSet<T> = SparseMap<T, T>;
-
-#[cfg(test)]
-mod tests {
-    use super::*;
-    use crate::EntityRef;
-
-    /// An opaque reference to an instruction in a function.
-    #[derive(Copy, Clone, PartialEq, Eq, Hash, PartialOrd, Ord)]
-    pub struct Inst(u32);
-    entity_impl!(Inst, "inst");
-
-    // Mock key-value object for testing.
-    #[derive(PartialEq, Eq, Debug)]
-    struct Obj(Inst, &'static str);
-
-    impl SparseMapValue<Inst> for Obj {
-        fn key(&self) -> Inst {
-            self.0
-        }
-    }
-
-    #[test]
-    fn empty_immutable_map() {
-        let i1 = Inst::new(1);
-        let map: SparseMap<Inst, Obj> = SparseMap::new();
-
-        assert!(map.is_empty());
-        assert_eq!(map.len(), 0);
-        assert_eq!(map.get(i1), None);
-        assert_eq!(map.values().count(), 0);
-    }
-
-    #[test]
-    fn single_entry() {
-        let i0 = Inst::new(0);
-        let i1 = Inst::new(1);
-        let i2 = Inst::new(2);
-        let mut map = SparseMap::new();
-
-        assert!(map.is_empty());
-        assert_eq!(map.len(), 0);
-        assert_eq!(map.get(i1), None);
-        assert_eq!(map.get_mut(i1), None);
-        assert_eq!(map.remove(i1), None);
-
-        assert_eq!(map.insert(Obj(i1, "hi")), None);
-        assert!(!map.is_empty());
-        assert_eq!(map.len(), 1);
-        assert_eq!(map.get(i0), None);
-        assert_eq!(map.get(i1), Some(&Obj(i1, "hi")));
-        assert_eq!(map.get(i2), None);
-        assert_eq!(map.get_mut(i0), None);
-        assert_eq!(map.get_mut(i1), Some(&mut Obj(i1, "hi")));
-        assert_eq!(map.get_mut(i2), None);
-
-        assert_eq!(map.remove(i0), None);
-        assert_eq!(map.remove(i2), None);
-        assert_eq!(map.remove(i1), Some(Obj(i1, "hi")));
-        assert_eq!(map.len(), 0);
-        assert_eq!(map.get(i1), None);
-        assert_eq!(map.get_mut(i1), None);
-        assert_eq!(map.remove(i0), None);
-        assert_eq!(map.remove(i1), None);
-        assert_eq!(map.remove(i2), None);
-    }
-
-    #[test]
-    fn multiple_entries() {
-        let i0 = Inst::new(0);
-        let i1 = Inst::new(1);
-        let i2 = Inst::new(2);
-        let i3 = Inst::new(3);
-        let mut map = SparseMap::new();
-
-        assert_eq!(map.insert(Obj(i2, "foo")), None);
-        assert_eq!(map.insert(Obj(i1, "bar")), None);
-        assert_eq!(map.insert(Obj(i0, "baz")), None);
-
-        // Iteration order = insertion order when nothing has been removed yet.
-        assert_eq!(
-            map.values().map(|obj| obj.1).collect::<Vec<_>>(),
-            ["foo", "bar", "baz"]
-        );
-
-        assert_eq!(map.len(), 3);
-        assert_eq!(map.get(i0), Some(&Obj(i0, "baz")));
-        assert_eq!(map.get(i1), Some(&Obj(i1, "bar")));
-        assert_eq!(map.get(i2), Some(&Obj(i2, "foo")));
-        assert_eq!(map.get(i3), None);
-
-        // Remove front object, causing back to be swapped down.
-        assert_eq!(map.remove(i1), Some(Obj(i1, "bar")));
-        assert_eq!(map.len(), 2);
-        assert_eq!(map.get(i0), Some(&Obj(i0, "baz")));
-        assert_eq!(map.get(i1), None);
-        assert_eq!(map.get(i2), Some(&Obj(i2, "foo")));
-        assert_eq!(map.get(i3), None);
-
-        // Reinsert something at a previously used key.
-        assert_eq!(map.insert(Obj(i1, "barbar")), None);
-        assert_eq!(map.len(), 3);
-        assert_eq!(map.get(i0), Some(&Obj(i0, "baz")));
-        assert_eq!(map.get(i1), Some(&Obj(i1, "barbar")));
-        assert_eq!(map.get(i2), Some(&Obj(i2, "foo")));
-        assert_eq!(map.get(i3), None);
-
-        // Replace an entry.
-        assert_eq!(map.insert(Obj(i0, "bazbaz")), Some(Obj(i0, "baz")));
-        assert_eq!(map.len(), 3);
-        assert_eq!(map.get(i0), Some(&Obj(i0, "bazbaz")));
-        assert_eq!(map.get(i1), Some(&Obj(i1, "barbar")));
-        assert_eq!(map.get(i2), Some(&Obj(i2, "foo")));
-        assert_eq!(map.get(i3), None);
-
-        // Check the reference `IntoIter` impl.
-        let mut v = Vec::new();
-        for i in &map {
-            v.push(i.1);
-        }
-        assert_eq!(v.len(), map.len());
-    }
-
-    #[test]
-    fn entity_set() {
-        let i0 = Inst::new(0);
-        let i1 = Inst::new(1);
-        let mut set = SparseSet::new();
-
-        assert_eq!(set.insert(i0), None);
-        assert_eq!(set.insert(i0), Some(i0));
-        assert_eq!(set.insert(i1), None);
-        assert_eq!(set.get(i0), Some(&i0));
-        assert_eq!(set.get(i1), Some(&i1));
-    }
-}

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

@@ -1 +0,0 @@
-{"files":{"Cargo.toml":"b658d3707aaef9c62f0b5f64e1138783f957020d8b63d2fe725ae3ff7e6c9d91","LICENSE":"268872b9816f90fd8e85db5a28d33f8150ebb8dd016653fb39ef1f94f2686bc5","README.md":"dea43e8044284df50f8b8772e9b48ba8b109b45c74111ff73619775d57ad8d67","src/frontend.rs":"712cbce058ca2aea229debf0600c6b0eee0d02d3102bf49a52db96f67e3a0d03","src/lib.rs":"db8e171ea6e4a53896e53f9678f63ba22be34420953b2844c57b559086b3097b","src/ssa.rs":"9d1a47cb6d6328f31997f0ee09b0326067e4507284f363e5d09074e2c306f303","src/switch.rs":"ca77eeb97db8c43566c5cfc1cc5e7a0c394fc72e306b985117e47d6d6f5bb5cc","src/variable.rs":"ad628b3c6de9a8c008dc31f869bf9d853f2dd3b590dc4e2e3c6da70ba6bf7adf"},"package":"ba73c410c2d52e28fc4b49aab955a1c2f58580ff37a3b0641e23bccd6049e4b5"}

data/ext/cargo-vendor/cranelift-frontend-0.99.1/Cargo.toml

@@ -1,53 +0,0 @@
-# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
-#
-# When uploading crates to the registry Cargo will automatically
-# "normalize" Cargo.toml files for maximal compatibility
-# with all versions of Cargo and also rewrite `path` dependencies
-# to registry (e.g., crates.io) dependencies.
-#
-# If you are reading this file be aware that the original Cargo.toml
-# will likely look very different (and much more reasonable).
-# See Cargo.toml.orig for the original contents.
-
-[package]
-edition = "2021"
-name = "cranelift-frontend"
-version = "0.99.1"
-authors = ["The Cranelift Project Developers"]
-description = "Cranelift IR builder helper"
-documentation = "https://docs.rs/cranelift-frontend"
-readme = "README.md"
-categories = ["no-std"]
-license = "Apache-2.0 WITH LLVM-exception"
-repository = "https://github.com/bytecodealliance/wasmtime"
-
-[dependencies.cranelift-codegen]
-version = "0.99.1"
-
-[dependencies.hashbrown]
-version = "0.13.2"
-optional = true
-
-[dependencies.log]
-version = "0.4.8"
-default-features = false
-
-[dependencies.smallvec]
-version = "1.6.1"
-features = ["union"]
-
-[dependencies.target-lexicon]
-version = "0.12.3"
-features = ["std"]
-default-features = false
-
-[dev-dependencies.similar]
-version = "2.1.0"
-
-[features]
-core = [
-    "hashbrown",
-    "cranelift-codegen/core",
-]
-default = ["std"]
-std = ["cranelift-codegen/std"]

data/ext/cargo-vendor/cranelift-frontend-0.99.1/src/lib.rs

@@ -1,204 +0,0 @@
-//! Cranelift IR builder library.
-//!
-//! Provides a straightforward way to create a Cranelift IR function and fill it with instructions
-//! corresponding to your source program written in another language.
-//!
-//! To get started, create an [`FunctionBuilderContext`](struct.FunctionBuilderContext.html) and
-//! pass it as an argument to a [`FunctionBuilder`](struct.FunctionBuilder.html).
-//!
-//! # Mutable variables and Cranelift IR values
-//!
-//! The most interesting feature of this API is that it provides a single way to deal with all your
-//! variable problems. Indeed, the [`FunctionBuilder`](struct.FunctionBuilder.html) struct has a
-//! type `Variable` that should be an index of your source language variables. Then, through
-//! calling the functions
-//! [`declare_var`](struct.FunctionBuilder.html#method.declare_var),
-//! [`def_var`](struct.FunctionBuilder.html#method.def_var) and
-//! [`use_var`](struct.FunctionBuilder.html#method.use_var), the
-//! [`FunctionBuilder`](struct.FunctionBuilder.html) will create for you all the Cranelift IR
-//! values corresponding to your variables.
-//!
-//! This API has been designed to help you translate your mutable variables into
-//! [`SSA`](https://en.wikipedia.org/wiki/Static_single_assignment_form) form.
-//! [`use_var`](struct.FunctionBuilder.html#method.use_var) will return the Cranelift IR value
-//! that corresponds to your mutable variable at a precise point in the program. However, if you know
-//! beforehand that one of your variables is defined only once, for instance if it is the result
-//! of an intermediate expression in an expression-based language, then you can translate it
-//! directly by the Cranelift IR value returned by the instruction builder. Using the
-//! [`use_var`](struct.FunctionBuilder.html#method.use_var) API for such an immutable variable
-//! would also work but with a slight additional overhead (the SSA algorithm does not know
-//! beforehand if a variable is immutable or not).
-//!
-//! The moral is that you should use these three functions to handle all your mutable variables,
-//! even those that are not present in the source code but artifacts of the translation. It is up
-//! to you to keep a mapping between the mutable variables of your language and their `Variable`
-//! index that is used by Cranelift. Caution: as the `Variable` is used by Cranelift to index an
-//! array containing information about your mutable variables, when you create a new `Variable`
-//! with [`Variable::new(var_index)`] you should make sure that `var_index` is provided by a
-//! counter incremented by 1 each time you encounter a new mutable variable.
-//!
-//! # Example
-//!
-//! Here is a pseudo-program we want to transform into Cranelift IR:
-//!
-//! ```clif
-//! function(x) {
-//! x, y, z : i32
-//! block0:
-//!    y = 2;
-//!    z = x + y;
-//!    jump block1
-//! block1:
-//!    z = z + y;
-//!    brif y, block3, block2
-//! block2:
-//!    z = z - x;
-//!    return y
-//! block3:
-//!    y = y - x
-//!    jump block1
-//! }
-//! ```
-//!
-//! Here is how you build the corresponding Cranelift IR function using `FunctionBuilderContext`:
-//!
-//! ```rust
-//! extern crate cranelift_codegen;
-//! extern crate cranelift_frontend;
-//!
-//! use cranelift_codegen::entity::EntityRef;
-//! use cranelift_codegen::ir::types::*;
-//! use cranelift_codegen::ir::{AbiParam, UserFuncName, Function, InstBuilder, Signature};
-//! use cranelift_codegen::isa::CallConv;
-//! use cranelift_codegen::settings;
-//! use cranelift_codegen::verifier::verify_function;
-//! use cranelift_frontend::{FunctionBuilder, FunctionBuilderContext, Variable};
-//!
-//! let mut sig = Signature::new(CallConv::SystemV);
-//! sig.returns.push(AbiParam::new(I32));
-//! sig.params.push(AbiParam::new(I32));
-//! let mut fn_builder_ctx = FunctionBuilderContext::new();
-//! let mut func = Function::with_name_signature(UserFuncName::user(0, 0), sig);
-//! {
-//!     let mut builder = FunctionBuilder::new(&mut func, &mut fn_builder_ctx);
-//!
-//!     let block0 = builder.create_block();
-//!     let block1 = builder.create_block();
-//!     let block2 = builder.create_block();
-//!     let block3 = builder.create_block();
-//!     let x = Variable::new(0);
-//!     let y = Variable::new(1);
-//!     let z = Variable::new(2);
-//!     builder.declare_var(x, I32);
-//!     builder.declare_var(y, I32);
-//!     builder.declare_var(z, I32);
-//!     builder.append_block_params_for_function_params(block0);
-//!
-//!     builder.switch_to_block(block0);
-//!     builder.seal_block(block0);
-//!     {
-//!         let tmp = builder.block_params(block0)[0]; // the first function parameter
-//!         builder.def_var(x, tmp);
-//!     }
-//!     {
-//!         let tmp = builder.ins().iconst(I32, 2);
-//!         builder.def_var(y, tmp);
-//!     }
-//!     {
-//!         let arg1 = builder.use_var(x);
-//!         let arg2 = builder.use_var(y);
-//!         let tmp = builder.ins().iadd(arg1, arg2);
-//!         builder.def_var(z, tmp);
-//!     }
-//!     builder.ins().jump(block1, &[]);
-//!
-//!     builder.switch_to_block(block1);
-//!     {
-//!         let arg1 = builder.use_var(y);
-//!         let arg2 = builder.use_var(z);
-//!         let tmp = builder.ins().iadd(arg1, arg2);
-//!         builder.def_var(z, tmp);
-//!     }
-//!     {
-//!         let arg = builder.use_var(y);
-//!         builder.ins().brif(arg, block3, &[], block2, &[]);
-//!     }
-//!
-//!     builder.switch_to_block(block2);
-//!     builder.seal_block(block2);
-//!     {
-//!         let arg1 = builder.use_var(z);
-//!         let arg2 = builder.use_var(x);
-//!         let tmp = builder.ins().isub(arg1, arg2);
-//!         builder.def_var(z, tmp);
-//!     }
-//!     {
-//!         let arg = builder.use_var(y);
-//!         builder.ins().return_(&[arg]);
-//!     }
-//!
-//!     builder.switch_to_block(block3);
-//!     builder.seal_block(block3);
-//!
-//!     {
-//!         let arg1 = builder.use_var(y);
-//!         let arg2 = builder.use_var(x);
-//!         let tmp = builder.ins().isub(arg1, arg2);
-//!         builder.def_var(y, tmp);
-//!     }
-//!     builder.ins().jump(block1, &[]);
-//!     builder.seal_block(block1);
-//!
-//!     builder.finalize();
-//! }
-//!
-//! let flags = settings::Flags::new(settings::builder());
-//! let res = verify_function(&func, &flags);
-//! println!("{}", func.display());
-//! if let Err(errors) = res {
-//!     panic!("{}", errors);
-//! }
-//! ```
-
-#![deny(missing_docs, trivial_numeric_casts, unused_extern_crates)]
-#![warn(unused_import_braces)]
-#![cfg_attr(feature = "std", deny(unstable_features))]
-#![cfg_attr(feature = "cargo-clippy", allow(clippy::new_without_default))]
-#![cfg_attr(
-    feature = "cargo-clippy",
-    warn(
-        clippy::float_arithmetic,
-        clippy::mut_mut,
-        clippy::nonminimal_bool,
-        clippy::map_unwrap_or,
-        clippy::clippy::print_stdout,
-        clippy::unicode_not_nfc,
-        clippy::use_self
-    )
-)]
-#![no_std]
-
-#[allow(unused_imports)] // #[macro_use] is required for no_std
-#[macro_use]
-extern crate alloc;
-
-#[cfg(feature = "std")]
-#[macro_use]
-extern crate std;
-
-#[cfg(not(feature = "std"))]
-use hashbrown::HashMap;
-#[cfg(feature = "std")]
-use std::collections::HashMap;
-
-pub use crate::frontend::{FuncInstBuilder, FunctionBuilder, FunctionBuilderContext};
-pub use crate::switch::Switch;
-pub use crate::variable::Variable;
-
-mod frontend;
-mod ssa;
-mod switch;
-mod variable;
-
-/// Version number of this crate.
-pub const VERSION: &str = env!("CARGO_PKG_VERSION");

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

@@ -1 +0,0 @@
-{"files":{"Cargo.toml":"50ef997f14569cf0e3b751b65448d463863d909ab9d09786e2b31d762070bef4","README.md":"cde3f7281c7a6c3195784341904495770914d41414546e65e0b4e66478676121","build.rs":"8375c4b7b30a6e381790be5dceed9b093a85edfdfdfd346f63a92c112f158454","isle_examples/fail/bad_converters.isle":"3c439432aca313302fc0bd360b48b3e0229074b7e630e8099a6f01ff7966f913","isle_examples/fail/bound_var_type_mismatch.isle":"c846f2a17a0e774fb4d389bfde643d501805c932bf8e062ef346abdfaf744de4","isle_examples/fail/converter_extractor_constructor.isle":"9603f8e41be92f30b0f2a513e4ad788b53423c61d5391ffba86d45163f36345a","isle_examples/fail/error1.isle":"016096ba09f12c36a22b8398606f99ea0eb54976d9d56cfecd65c25d6ac7f298","isle_examples/fail/extra_parens.isle":"60410fd0b1ebbe38c2059358e7ebe9c39f7e30ad5e7f8c629cbe600d98c48611","isle_examples/fail/impure_expression.isle":"85362308be72512aa508e501a20155a5a76f394ac14b62bd246421deeea384aa","isle_examples/fail/impure_rhs.isle":"c9efb0c694494938bdc85c9cb6985df2dc33ace980e1fb8f80bf3960e7dfcc3f","isle_examples/fail/multi_internal_etor.isle":"1da74314c83125528b3acc36582800423d9f972af7fd06f15b6b4c1f8d6eb9c6","isle_examples/fail/multi_prio.isle":"1b9a780f03cf824d4a2d1de69378ccb6586bcb9a1f514638363600028e78c5de","isle_examples/link/borrows.isle":"9a78ab0461496be950c070da48ac0be03aea83afa9f7efbfbcaeee86ee340485","isle_examples/link/borrows_main.rs":"d14d5c191613c45a2687493ace29e8dcda532be9a09a792ee04d96b7a2994978","isle_examples/link/iflets.isle":"fc9074e965b9eaf8ee57484108556ed09bfa7b122ba1a072fe1404483213bb6b","isle_examples/link/iflets_main.rs":"71d96686f7bea89a084fa676d87f198c630e9f8e23ad1927ea0df15af3eba19d","isle_examples/link/multi_constructor.isle":"eaacf20ed3f8701dde763f99aa64bbbadf51c4165347ba481798d6fb2deb7cf6","isle_examples/link/multi_constructor_main.rs":"adaf93c18c860b1d75a0d0b393df223ad44332627fa4064f7ea83ace8af06cc0","isle_examples/link/multi_extractor.isle":"50b858ecf8be26f77bd112b9b75a88caac1420d8bcf89ad1369a0b7965822aa4","isle_examples/link/multi_extractor_main.rs":"334e0b3a3ec638fc188979873a42449b183c41735d05822b2350e38e31b57ef3","isle_examples/link/test.isle":"283ec1108eb3391454d6b6d083f58dffb5804a988627d8b95294c935c497d275","isle_examples/link/test_main.rs":"0362fa81349db33cda6b97d81da90a86509d52e8085ad499bd5be18724965878","isle_examples/pass/bound_var.isle":"cbd97a1a25879e6afd78357811fb1f277e2585a5e74acc595c8e027936f07b8e","isle_examples/pass/construct_and_extract.isle":"203c0a8c762603f22a1f2593b2b9f427c14e63f18c56ef8d1d6107634af3bdcd","isle_examples/pass/conversions.isle":"3e9820cd9eb6223026994a971f3c64a5e4045450451d650d244afb531a1b3fb8","isle_examples/pass/conversions_extern.isle":"24ca717c100bf477efad53c5adb207f88bf33e7c0ea07ec4d485cb86b8da996b","isle_examples/pass/let.isle":"cc6eb7b5685f265135692d1203b83431df5ef089064608cf6fe4feb4286e5d0f","isle_examples/pass/nodebug.isle":"16e58d125a37fe001c03136a70c5270d2b90a719ee266a39705aaabb2aadf174","isle_examples/pass/prio_trie_bug.isle":"f0a5f6290822ce8498756e7bbd892124355ec2a7faa200792395fc5c3385f467","isle_examples/pass/test2.isle":"d767d11f4dffc25b47fe29e6ae9f90eb36d247ee80cc98a2ffe938130b0776e7","isle_examples/pass/test3.isle":"8f0fa6c70f5ffa8713c912f4409b195980bd2c37b1e393973085975fa62049d3","isle_examples/pass/test4.isle":"a580492320964fabc0cb2fec66fd94b2759342088f9e74152d616a4d82d517f3","isle_examples/pass/tutorial.isle":"23c16d1a0af4c2a212cb581d6e1f7a9538c4507af1daf68434b9073d0f38d94c","isle_examples/run/iconst.isle":"0c38f0352da2b0e295cc075febfedb7fd20dbe7483520640f8f1bf59da7223b9","isle_examples/run/iconst_main.rs":"f1b921b205d0f6120faaccd8138e5db8c42e9ab548eb3fbef643f3cfc8be03d0","isle_examples/run/let_shadowing.isle":"46fb8bb300b31081a5dcb5061efe21ee573c007b5b425bd51afd08c67293341e","isle_examples/run/let_shadowing_main.rs":"466f9b79f06f1cfa259c4f9c05a892df99d3fd0de1e62b97a6ab372f4509f6a9","src/ast.rs":"a14a10e77b705d5809cef3e772b67e49d36a05464e4c1af810413989ae0d6569","src/codegen.rs":"0219ddc39d2032c197114b20ee2bb78e2ed5e33ca905405fe604604e9a875137","src/compile.rs":"beaf5bb5ba6b8ee14e5ded9be3f5374d1f46b4d211d9bbe04b504c19d8664aaf","src/error.rs":"15d5cb5dde6c4d997e107320521e42ca75d9118d5a0949c97d3eec8d60c61964","src/lexer.rs":"3828292eb2a682999501aef82d4ea7de757ae084d4f92ff1a1f1cee28cfecdf1","src/lib.rs":"232d341fd343a5476a69ea607e1bb956c97dc051d2c2f33baedfa5f971b4e873","src/log.rs":"abfe10789b25940da3a559bb7be30f928bb35574b4a8f0875bdd75350d25c0e9","src/overlap.rs":"923eb3770e1a2a4a05dd05982f3c591cbc2c5bf49b62674eae92ceb906506a66","src/parser.rs":"22c8bb28a9f89b73e78cd40f5ce6809708e6f5b41ffa1bdae67f1cab55ba2d50","src/sema.rs":"ebb37f519c25aff73c967eb769b97cbe9a5c477408772708a82f171deb530b24","src/serialize.rs":"9126bfbb79440e68a0c5149e5c1232378a8db977c7a40200d0dc62da8a05f814","src/trie_again.rs":"e8571b42a9a3f9e5083d4ccdeaa4fbab14a209b6d30fc8d5d4884dd7b83fce2b","tests/run_tests.rs":"3c86434adcf2e6b28db7719286f2328c347fd0f5bb7827f607d3a7686021732e"},"package":"61acaa7646020e0444bb3a22d212a5bae0e3b3969b18e1276a037ccd6493a8fd"}

data/ext/cargo-vendor/cranelift-isle-0.99.1/Cargo.toml

@@ -1,37 +0,0 @@
-# THIS FILE IS AUTOMATICALLY GENERATED BY CARGO
-#
-# When uploading crates to the registry Cargo will automatically
-# "normalize" Cargo.toml files for maximal compatibility
-# with all versions of Cargo and also rewrite `path` dependencies
-# to registry (e.g., crates.io) dependencies.
-#
-# If you are reading this file be aware that the original Cargo.toml
-# will likely look very different (and much more reasonable).
-# See Cargo.toml.orig for the original contents.
-
-[package]
-edition = "2021"
-name = "cranelift-isle"
-version = "0.99.1"
-authors = ["The Cranelift Project Developers"]
-description = "ISLE: Instruction Selection and Lowering Expressions. A domain-specific language for instruction selection in Cranelift."
-readme = "README.md"
-license = "Apache-2.0 WITH LLVM-exception"
-repository = "https://github.com/bytecodealliance/wasmtime/tree/main/cranelift/isle"
-
-[dependencies.codespan-reporting]
-version = "0.11.1"
-optional = true
-
-[dependencies.log]
-version = "0.4.8"
-optional = true
-default-features = false
-
-[dev-dependencies.tempfile]
-version = "3"
-
-[features]
-default = []
-fancy-errors = ["codespan-reporting"]
-logging = ["log"]

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

@@ -1 +0,0 @@
-{"files":{"Cargo.toml":"f22db43710352d422c1ff9cd588d7cc8b868db422f126fac9798f800f689cb28","LICENSE":"268872b9816f90fd8e85db5a28d33f8150ebb8dd016653fb39ef1f94f2686bc5","README.md":"3dcebfe863bb34056d13c895732889ba1b732f9e958ff3c32284b3565eaacbd6","src/lib.rs":"8953cc9c92c4f730b68879c64954420426a755237bdd9cb84d12e9bab4acd9d4","src/riscv.rs":"664397ca90791bc0d39e85c6cda176383fef9cff17f9d191f70d1982e2c97313"},"package":"543f52ef487498253ebe5df321373c5c314da74ada0e92f13451b6f887194f87"}