Adding upstream version 110.0.1.upstream/110.0.1upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

3 files changed, 380 insertions, 0 deletions

diff --git a/third_party/rust/phf_macros/.cargo-checksum.json b/third_party/rust/phf_macros/.cargo-checksum.json
new file mode 100644
index 0000000000..e30dfb7c6d
--- /dev/null
+++ b/third_party/rust/phf_macros/.cargo-checksum.json
@@ -0,0 +1 @@
+{"files":{"Cargo.toml":"f9628d68a6b9f56d0ad2053a3eea00f3b27af054c7942c14bd49cda6326f8db7","src/lib.rs":"257a8c25c688b9421b196e47e727eb1dd5bb435a7786e931ef14e323da9e0d09"},"package":"58fdf3184dd560f160dd73922bea2d5cd6e8f064bf4b13110abd81b03697b4e0"}
\ No newline at end of file
diff --git a/third_party/rust/phf_macros/Cargo.toml b/third_party/rust/phf_macros/Cargo.toml
new file mode 100644
index 0000000000..ccc1ce51fa
--- /dev/null
+++ b/third_party/rust/phf_macros/Cargo.toml
@@ -0,0 +1,61 @@
+# 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 = "2018"
+name = "phf_macros"
+version = "0.10.0"
+authors = ["Steven Fackler <sfackler@gmail.com>"]
+include = ["src/lib.rs"]
+description = "Macros to generate types in the phf crate"
+readme = "../README.md"
+license = "MIT"
+repository = "https://github.com/sfackler/rust-phf"
+
+[lib]
+proc-macro = true
+[dependencies.phf_generator]
+version = "0.10.0"
+
+[dependencies.phf_shared]
+version = "0.10.0"
+default-features = false
+
+[dependencies.proc-macro-hack]
+version = "0.5.4"
+
+[dependencies.proc-macro2]
+version = "1"
+
+[dependencies.quote]
+version = "1"
+
+[dependencies.syn]
+version = "1"
+features = ["full"]
+
+[dependencies.unicase_]
+version = "2.4.0"
+optional = true
+package = "unicase"
+[dev-dependencies.phf]
+version = "0.9"
+features = ["macros", "unicase"]
+
+[dev-dependencies.trybuild]
+version = "1.0"
+
+[dev-dependencies.unicase_]
+version = "2.4.0"
+package = "unicase"
+
+[features]
+unicase = ["unicase_", "phf_shared/unicase"]
diff --git a/third_party/rust/phf_macros/src/lib.rs b/third_party/rust/phf_macros/src/lib.rs
new file mode 100644
index 0000000000..a7a3d703c7
--- /dev/null
+++ b/third_party/rust/phf_macros/src/lib.rs
@@ -0,0 +1,318 @@
+// FIXME: Remove `extern crate` below when we bump MSRV to 1.42 or higher.
+extern crate proc_macro;
+
+use phf_generator::HashState;
+use phf_shared::PhfHash;
+use proc_macro::TokenStream;
+use quote::quote;
+use std::collections::HashSet;
+use std::hash::Hasher;
+use syn::parse::{self, Parse, ParseStream};
+use syn::punctuated::Punctuated;
+#[cfg(feature = "unicase")]
+use syn::ExprLit;
+use syn::{parse_macro_input, Error, Expr, Lit, Token, UnOp};
+#[cfg(feature = "unicase")]
+use unicase_::UniCase;
+
+#[derive(Hash, PartialEq, Eq, Clone)]
+enum ParsedKey {
+    Str(String),
+    Binary(Vec<u8>),
+    Char(char),
+    I8(i8),
+    I16(i16),
+    I32(i32),
+    I64(i64),
+    I128(i128),
+    U8(u8),
+    U16(u16),
+    U32(u32),
+    U64(u64),
+    U128(u128),
+    Bool(bool),
+    #[cfg(feature = "unicase")]
+    UniCase(UniCase<String>),
+}
+
+impl PhfHash for ParsedKey {
+    fn phf_hash<H>(&self, state: &mut H)
+    where
+        H: Hasher,
+    {
+        match self {
+            ParsedKey::Str(s) => s.phf_hash(state),
+            ParsedKey::Binary(s) => s.phf_hash(state),
+            ParsedKey::Char(s) => s.phf_hash(state),
+            ParsedKey::I8(s) => s.phf_hash(state),
+            ParsedKey::I16(s) => s.phf_hash(state),
+            ParsedKey::I32(s) => s.phf_hash(state),
+            ParsedKey::I64(s) => s.phf_hash(state),
+            ParsedKey::I128(s) => s.phf_hash(state),
+            ParsedKey::U8(s) => s.phf_hash(state),
+            ParsedKey::U16(s) => s.phf_hash(state),
+            ParsedKey::U32(s) => s.phf_hash(state),
+            ParsedKey::U64(s) => s.phf_hash(state),
+            ParsedKey::U128(s) => s.phf_hash(state),
+            ParsedKey::Bool(s) => s.phf_hash(state),
+            #[cfg(feature = "unicase")]
+            ParsedKey::UniCase(s) => s.phf_hash(state),
+        }
+    }
+}
+
+impl ParsedKey {
+    fn from_expr(expr: &Expr) -> Option<ParsedKey> {
+        match expr {
+            Expr::Lit(lit) => match &lit.lit {
+                Lit::Str(s) => Some(ParsedKey::Str(s.value())),
+                Lit::ByteStr(s) => Some(ParsedKey::Binary(s.value())),
+                Lit::Byte(s) => Some(ParsedKey::U8(s.value())),
+                Lit::Char(s) => Some(ParsedKey::Char(s.value())),
+                Lit::Int(s) => match s.suffix() {
+                    // we've lost the sign at this point, so `-128i8` looks like `128i8`,
+                    // which doesn't fit in an `i8`; parse it as a `u8` and cast (to `0i8`),
+                    // which is handled below, by `Unary`
+                    "i8" => Some(ParsedKey::I8(s.base10_parse::<u8>().unwrap() as i8)),
+                    "i16" => Some(ParsedKey::I16(s.base10_parse::<u16>().unwrap() as i16)),
+                    "i32" => Some(ParsedKey::I32(s.base10_parse::<u32>().unwrap() as i32)),
+                    "i64" => Some(ParsedKey::I64(s.base10_parse::<u64>().unwrap() as i64)),
+                    "i128" => Some(ParsedKey::I128(s.base10_parse::<u128>().unwrap() as i128)),
+                    "u8" => Some(ParsedKey::U8(s.base10_parse::<u8>().unwrap())),
+                    "u16" => Some(ParsedKey::U16(s.base10_parse::<u16>().unwrap())),
+                    "u32" => Some(ParsedKey::U32(s.base10_parse::<u32>().unwrap())),
+                    "u64" => Some(ParsedKey::U64(s.base10_parse::<u64>().unwrap())),
+                    "u128" => Some(ParsedKey::U128(s.base10_parse::<u128>().unwrap())),
+                    _ => None,
+                },
+                Lit::Bool(s) => Some(ParsedKey::Bool(s.value)),
+                _ => None,
+            },
+            Expr::Array(array) => {
+                let mut buf = vec![];
+                for expr in &array.elems {
+                    match expr {
+                        Expr::Lit(lit) => match &lit.lit {
+                            Lit::Int(s) => match s.suffix() {
+                                "u8" | "" => buf.push(s.base10_parse::<u8>().unwrap()),
+                                _ => return None,
+                            },
+                            _ => return None,
+                        },
+                        _ => return None,
+                    }
+                }
+                Some(ParsedKey::Binary(buf))
+            }
+            Expr::Unary(unary) => {
+                // if we received an integer literal (always unsigned) greater than i__::max_value()
+                // then casting it to a signed integer type of the same width will negate it to
+                // the same absolute value so we don't need to negate it here
+                macro_rules! try_negate (
+                    ($val:expr) => {if $val < 0 { $val } else { -$val }}
+                );
+
+                match unary.op {
+                    UnOp::Neg(_) => match ParsedKey::from_expr(&unary.expr)? {
+                        ParsedKey::I8(v) => Some(ParsedKey::I8(try_negate!(v))),
+                        ParsedKey::I16(v) => Some(ParsedKey::I16(try_negate!(v))),
+                        ParsedKey::I32(v) => Some(ParsedKey::I32(try_negate!(v))),
+                        ParsedKey::I64(v) => Some(ParsedKey::I64(try_negate!(v))),
+                        ParsedKey::I128(v) => Some(ParsedKey::I128(try_negate!(v))),
+                        _ => None,
+                    },
+                    _ => None,
+                }
+            }
+            Expr::Group(group) => ParsedKey::from_expr(&group.expr),
+            #[cfg(feature = "unicase")]
+            Expr::Call(call) => {
+                if let Expr::Path(ep) = call.func.as_ref() {
+                    let segments = &mut ep.path.segments.iter().rev();
+                    let last = &segments.next()?.ident;
+                    let last_ahead = &segments.next()?.ident;
+                    let is_unicode = last_ahead == "UniCase" && last == "unicode";
+                    let is_ascii = last_ahead == "UniCase" && last == "ascii";
+                    if call.args.len() == 1 && (is_unicode || is_ascii) {
+                        if let Some(Expr::Lit(ExprLit {
+                            attrs: _,
+                            lit: Lit::Str(s),
+                        })) = call.args.first()
+                        {
+                            let v = if is_unicode {
+                                UniCase::unicode(s.value())
+                            } else {
+                                UniCase::ascii(s.value())
+                            };
+                            Some(ParsedKey::UniCase(v))
+                        } else {
+                            None
+                        }
+                    } else {
+                        None
+                    }
+                } else {
+                    None
+                }
+            }
+            _ => None,
+        }
+    }
+}
+
+struct Key {
+    parsed: ParsedKey,
+    expr: Expr,
+}
+
+impl PhfHash for Key {
+    fn phf_hash<H>(&self, state: &mut H)
+    where
+        H: Hasher,
+    {
+        self.parsed.phf_hash(state)
+    }
+}
+
+impl Parse for Key {
+    fn parse(input: ParseStream<'_>) -> parse::Result<Key> {
+        let expr = input.parse()?;
+        let parsed = ParsedKey::from_expr(&expr)
+            .ok_or_else(|| Error::new_spanned(&expr, "unsupported key expression"))?;
+
+        Ok(Key { parsed, expr })
+    }
+}
+
+struct Entry {
+    key: Key,
+    value: Expr,
+}
+
+impl PhfHash for Entry {
+    fn phf_hash<H>(&self, state: &mut H)
+    where
+        H: Hasher,
+    {
+        self.key.phf_hash(state)
+    }
+}
+
+impl Parse for Entry {
+    fn parse(input: ParseStream<'_>) -> parse::Result<Entry> {
+        let key = input.parse()?;
+        input.parse::<Token![=>]>()?;
+        let value = input.parse()?;
+        Ok(Entry { key, value })
+    }
+}
+
+struct Map(Vec<Entry>);
+
+impl Parse for Map {
+    fn parse(input: ParseStream<'_>) -> parse::Result<Map> {
+        let parsed = Punctuated::<Entry, Token![,]>::parse_terminated(input)?;
+        let map = parsed.into_iter().collect::<Vec<_>>();
+        check_duplicates(&map)?;
+        Ok(Map(map))
+    }
+}
+
+struct Set(Vec<Entry>);
+
+impl Parse for Set {
+    fn parse(input: ParseStream<'_>) -> parse::Result<Set> {
+        let parsed = Punctuated::<Key, Token![,]>::parse_terminated(input)?;
+        let set = parsed
+            .into_iter()
+            .map(|key| Entry {
+                key,
+                value: syn::parse_str("()").unwrap(),
+            })
+            .collect::<Vec<_>>();
+        check_duplicates(&set)?;
+        Ok(Set(set))
+    }
+}
+
+fn check_duplicates(entries: &[Entry]) -> parse::Result<()> {
+    let mut keys = HashSet::new();
+    for entry in entries {
+        if !keys.insert(&entry.key.parsed) {
+            return Err(Error::new_spanned(&entry.key.expr, "duplicate key"));
+        }
+    }
+    Ok(())
+}
+
+fn build_map(entries: &[Entry], state: HashState) -> proc_macro2::TokenStream {
+    let key = state.key;
+    let disps = state.disps.iter().map(|&(d1, d2)| quote!((#d1, #d2)));
+    let entries = state.map.iter().map(|&idx| {
+        let key = &entries[idx].key.expr;
+        let value = &entries[idx].value;
+        quote!((#key, #value))
+    });
+
+    quote! {
+        phf::Map {
+            key: #key,
+            disps: &[#(#disps),*],
+            entries: &[#(#entries),*],
+        }
+    }
+}
+
+fn build_ordered_map(entries: &[Entry], state: HashState) -> proc_macro2::TokenStream {
+    let key = state.key;
+    let disps = state.disps.iter().map(|&(d1, d2)| quote!((#d1, #d2)));
+    let idxs = state.map.iter().map(|idx| quote!(#idx));
+    let entries = entries.iter().map(|entry| {
+        let key = &entry.key.expr;
+        let value = &entry.value;
+        quote!((#key, #value))
+    });
+
+    quote! {
+        phf::OrderedMap {
+            key: #key,
+            disps: &[#(#disps),*],
+            idxs: &[#(#idxs),*],
+            entries: &[#(#entries),*],
+        }
+    }
+}
+
+#[::proc_macro_hack::proc_macro_hack]
+pub fn phf_map(input: TokenStream) -> TokenStream {
+    let map = parse_macro_input!(input as Map);
+    let state = phf_generator::generate_hash(&map.0);
+
+    build_map(&map.0, state).into()
+}
+
+#[::proc_macro_hack::proc_macro_hack]
+pub fn phf_set(input: TokenStream) -> TokenStream {
+    let set = parse_macro_input!(input as Set);
+    let state = phf_generator::generate_hash(&set.0);
+
+    let map = build_map(&set.0, state);
+    quote!(phf::Set { map: #map }).into()
+}
+
+#[::proc_macro_hack::proc_macro_hack]
+pub fn phf_ordered_map(input: TokenStream) -> TokenStream {
+    let map = parse_macro_input!(input as Map);
+    let state = phf_generator::generate_hash(&map.0);
+
+    build_ordered_map(&map.0, state).into()
+}
+
+#[::proc_macro_hack::proc_macro_hack]
+pub fn phf_ordered_set(input: TokenStream) -> TokenStream {
+    let set = parse_macro_input!(input as Set);
+    let state = phf_generator::generate_hash(&set.0);
+
+    let map = build_ordered_map(&set.0, state);
+    quote!(phf::OrderedSet { map: #map }).into()
+}