sync bela

Author: fcharlie

vendor/bela.lock

@@ -1 +1 @@
-https://github.com/fcharlie/bela/tree/b90164e04799c805a675c41de9ec081c67b1f5ba
+https://github.com/fcharlie/bela/tree/57c258b6414a09a413fd2054fe0f0b19fd2132d8

vendor/bela/include/bela/__phmap/VERSION

@@ -1,2 +1,2 @@
 https://github.com/greg7mdp/parallel-hashmap.git
-79cbd2dafd5aab3829064d1b48b71137623d8ff2
+77cab8192a879e5d27188f97e8f2080dd7e36ca8

vendor/bela/include/bela/__phmap/btree.h

@@ -108,7 +108,7 @@ namespace phmap {
             bool, std::is_copy_constructible<
                       type_traits_internal::SingleMemberUnion<T>>::value &&
             std::is_trivially_destructible<T>::value> {};
-
+#if 0
         template <class T>
         struct IsTriviallyMoveAssignableReference : std::false_type {};
 
@@ -119,7 +119,7 @@ namespace phmap {
         template <class T>
         struct IsTriviallyMoveAssignableReference<T&&>
             : std::is_trivially_move_assignable<T>::type {};
-
+#endif
     }  // namespace type_traits_internal
 
 
@@ -148,8 +148,8 @@ namespace phmap {
 
         public:
             static constexpr bool kValue =
-                (std::is_trivially_copyable<ExtentsRemoved>::value || !kIsCopyOrMoveConstructible) &&
-                (std::is_trivially_copy_assignable<ExtentsRemoved>::value || !kIsCopyOrMoveAssignable) &&
+                (phmap::is_trivially_copyable<ExtentsRemoved>::value || !kIsCopyOrMoveConstructible) &&
+                (phmap::is_trivially_copy_assignable<ExtentsRemoved>::value || !kIsCopyOrMoveAssignable) &&
                 (kIsCopyOrMoveConstructible || kIsCopyOrMoveAssignable) &&
                 std::is_trivially_destructible<ExtentsRemoved>::value &&
                 // We need to check for this explicitly because otherwise we'll say
@@ -3321,8 +3321,8 @@ namespace priv {
         // ----------------
         template <typename K = key_type>
         size_type count(const key_arg<K> &key) const {
-            auto equal_range = this->equal_range(key);
-            return std::distance(equal_range.first, equal_range.second);
+            auto er = this->equal_range(key);
+            return std::distance(er.first, er.second);
         }
         template <typename K = key_type>
         iterator find(const key_arg<K> &key) {
@@ -3362,8 +3362,8 @@ namespace priv {
         }
         template <typename K = key_type>
         size_type erase(const key_arg<K> &key) {
-            auto equal_range = this->equal_range(key);
-            return tree_.erase_range(equal_range.first, equal_range.second).first;
+            auto er = this->equal_range(key);
+            return tree_.erase_range(er.first, er.second).first;
         }
         node_type extract(iterator position) {
             // Use Move instead of Transfer, because the rebalancing code expects to

vendor/bela/include/bela/__phmap/phmap.h

@@ -2271,14 +2271,14 @@ class raw_hash_set
     }
 
     // Reset all ctrl bytes back to kEmpty, except the sentinel.
-    void reset_ctrl(size_t capacity) {
-        std::memset(ctrl_, kEmpty, capacity + Group::kWidth);
-        ctrl_[capacity] = kSentinel;
-        SanitizerPoisonMemoryRegion(slots_, sizeof(slot_type) * capacity);
+    void reset_ctrl(size_t new_capacity) {
+        std::memset(ctrl_, kEmpty, new_capacity + Group::kWidth);
+        ctrl_[new_capacity] = kSentinel;
+        SanitizerPoisonMemoryRegion(slots_, sizeof(slot_type) * new_capacity);
     }
 
-    void reset_growth_left(size_t capacity) {
-        growth_left() = CapacityToGrowth(capacity) - size_;
+    void reset_growth_left(size_t new_capacity) {
+        growth_left() = CapacityToGrowth(new_capacity) - size_;
     }
 
     size_t& growth_left() { return std::get<0>(settings_); }

vendor/bela/include/bela/__phmap/phmap_base.h

@@ -223,6 +223,36 @@ struct disjunction<> : std::false_type {};
 template <typename T>
 struct negation : std::integral_constant<bool, !T::value> {};
 
+#if defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__) && !defined(_MSC_VER) && !defined(__INTEL_COMPILER)
+    #define PHMAP_OLD_GCC 1
+#else
+    #define PHMAP_OLD_GCC 0
+#endif
+
+#if PHMAP_OLD_GCC
+  template <typename T>
+  struct is_trivially_copy_constructible
+     : std::integral_constant<bool,
+                              __has_trivial_copy(typename std::remove_reference<T>::type) &&
+                              std::is_copy_constructible<T>::value &&
+                              std::is_trivially_destructible<T>::value> {};
+ 
+  template <typename T>
+  struct is_trivially_copy_assignable :
+     std::integral_constant<bool,
+                            __has_trivial_assign(typename std::remove_reference<T>::type) &&
+                            phmap::is_copy_assignable<T>::value> {};
+
+  template <typename T>
+  struct is_trivially_copyable :
+     std::integral_constant<bool, __has_trivial_copy(typename std::remove_reference<T>::type)> {};
+
+#else
+  template <typename T> using is_trivially_copy_constructible = std::is_trivially_copy_constructible<T>;
+  template <typename T> using is_trivially_copy_assignable = std::is_trivially_copy_assignable<T>;
+  template <typename T> using is_trivially_copyable = std::is_trivially_copyable<T>;
+#endif
+
 // -----------------------------------------------------------------------------
 // C++14 "_t" trait aliases
 // -----------------------------------------------------------------------------
@@ -1788,8 +1818,8 @@ class optional_data_base : public optional_data_dtor_base<T>
 // supported now, so we use is_trivially_* traits instead.
 template <typename T,
           bool unused =
-          std::is_trivially_copy_constructible<T>::value &&
-          std::is_trivially_copy_assignable<typename std::remove_cv<T>::type>::value &&
+          phmap::is_trivially_copy_constructible<T>::value &&
+          phmap::is_trivially_copy_assignable<typename std::remove_cv<T>::type>::value &&
           std::is_trivially_destructible<T>::value>
 class optional_data;
 
@@ -2021,6 +2051,11 @@ struct optional_hash_base<T, decltype(std::hash<phmap::remove_const_t<T> >()(
 // -----------------------------------------------------------------------------
 // phmap::optional class definition
 // -----------------------------------------------------------------------------
+#if PHMAP_OLD_GCC
+    #define PHMAP_OPTIONAL_NOEXCEPT
+#else
+    #define PHMAP_OPTIONAL_NOEXCEPT noexcept
+#endif
 
 template <typename T>
 class optional : private optional_internal::optional_data<T>,
@@ -2047,7 +2082,7 @@ class optional : private optional_internal::optional_data<T>,
     optional(const optional& src) = default;
 
     // Move constructor, standard semantics
-    optional(optional&& src) noexcept = default;
+    optional(optional&& src) PHMAP_OPTIONAL_NOEXCEPT = default;
 
     // Constructs a non-empty `optional` direct-initialized value of type `T` from
     // the arguments `std::forward<Args>(args)...`  within the `optional`.
@@ -2187,7 +2222,7 @@ class optional : private optional_internal::optional_data<T>,
     optional& operator=(const optional& src) = default;
 
     // Move assignment operator, standard semantics
-    optional& operator=(optional&& src) noexcept = default;
+    optional& operator=(optional&& src) PHMAP_OPTIONAL_NOEXCEPT = default;
 
     // Value assignment operators
     template <

vendor/bela/include/bela/__phmap/phmap_config.h

@@ -120,7 +120,8 @@
     #define PHMAP_HAVE_BUILTIN(x) 0
 #endif
 
-#if (defined(_MSVC_LANG) && _MSVC_LANG >= 201703) || __cplusplus >= 201703
+#if (!defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 5) && \
+    ((defined(_MSVC_LANG) && _MSVC_LANG >= 201703L) || __cplusplus >= 201703L)
     #define PHMAP_HAVE_CC17 1
 #else
     #define PHMAP_HAVE_CC17 0
@@ -313,8 +314,12 @@
     #endif
 #endif
 
-#if PHMAP_HAVE_CC17 && (!defined(__has_include) || __has_include(<shared_mutex>))
-    #define PHMAP_HAVE_SHARED_MUTEX 1
+#if PHMAP_HAVE_CC17
+    #ifdef __has_include
+       #if __has_include(<shared_mutex>)
+           #define PHMAP_HAVE_SHARED_MUTEX 1
+       #endif
+    #endif
 #endif
 
 #ifndef PHMAP_HAVE_STD_STRING_VIEW

vendor/bela/src/belaund/llvm/VERSION

@@ -1 +1 @@
-llvm-project:54210573ae918f6e0cab59bc5955a66bc34b5f6c
+llvm-project:8be07adfb42d8d5d060b807d5445b6fefc949bee

vendor/bela/src/belaund/llvm/include/llvm/Demangle/ItaniumDemangle.h

@@ -2336,7 +2336,7 @@ template <class Float> class FloatLiteralImpl : public Node {
         Float value;
         char buf[sizeof(Float)];
       };
-      const char *t = &*Contents.begin();
+      const char *t = Contents.data();
       const char *last = t + N;
       char *e = buf;
       for (; t != last; ++t, ++e) {
@@ -3714,8 +3714,7 @@ Node *AbstractManglingParser<Derived, Alloc>::parseQualifiedType() {
       std::string_view ProtoSourceName(Qual.data() + Len, Qual.size() - Len);
       std::string_view Proto;
       {
-        ScopedOverride<const char *> SaveFirst(First,
-                                               &*ProtoSourceName.begin()),
+        ScopedOverride<const char *> SaveFirst(First, ProtoSourceName.data()),
             SaveLast(Last, &*ProtoSourceName.rbegin() + 1);
         Proto = parseBareSourceName();
       }

vendor/bela/src/belaund/llvm/lib/Demangle/ItaniumDemangle.cpp

@@ -18,6 +18,7 @@
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
+#include <exception>
 #include <functional>
 #include <utility>
 
@@ -79,7 +80,7 @@ struct DumpVisitor {
 
   void printStr(const char *S) { fprintf(stderr, "%s", S); }
   void print(std::string_view SV) {
-    fprintf(stderr, "\"%.*s\"", (int)SV.size(), &*SV.begin());
+    fprintf(stderr, "\"%.*s\"", (int)SV.size(), SV.data());
   }
   void print(const Node *N) {
     if (N)

vendor/bela/src/belaund/llvm/lib/Demangle/MicrosoftDemangle.cpp

@@ -268,7 +268,7 @@ std::string_view Demangler::copyString(std::string_view Borrowed) {
   // This is not a micro-optimization, it avoids UB, should Borrowed be an null
   // buffer.
   if (Borrowed.size())
-    std::memcpy(Stable, &*Borrowed.begin(), Borrowed.size());
+    std::memcpy(Stable, Borrowed.data(), Borrowed.size());
 
   return {Stable, Borrowed.size()};
 }
@@ -792,7 +792,7 @@ SymbolNode *Demangler::demangleMD5Name(std::string_view &MangledName) {
     Error = true;
     return nullptr;
   }
-  const char *Start = &*MangledName.begin();
+  const char *Start = MangledName.data();
   const size_t StartSize = MangledName.size();
   MangledName.remove_prefix(MD5Last + 1);
 
@@ -2382,7 +2382,7 @@ void Demangler::dumpBackReferences() {
     T->output(OB, OF_Default);
 
     std::string_view B = OB;
-    std::printf("  [%d] - %.*s\n", (int)I, (int)B.size(), &*B.begin());
+    std::printf("  [%d] - %.*s\n", (int)I, (int)B.size(), B.data());
   }
   std::free(OB.getBuffer());
 
@@ -2391,7 +2391,7 @@ void Demangler::dumpBackReferences() {
   std::printf("%d name backreferences\n", (int)Backrefs.NamesCount);
   for (size_t I = 0; I < Backrefs.NamesCount; ++I) {
     std::printf("  [%d] - %.*s\n", (int)I, (int)Backrefs.Names[I]->Name.size(),
-                &*Backrefs.Names[I]->Name.begin());
+                Backrefs.Names[I]->Name.data());
   }
   if (Backrefs.NamesCount > 0)
     std::printf("\n");
@@ -2404,7 +2404,7 @@ char *llvm::microsoftDemangle(std::string_view MangledName, size_t *NMangled,
   std::string_view Name{MangledName};
   SymbolNode *AST = D.parse(Name);
   if (!D.Error && NMangled)
-    *NMangled = Name.empty() ? 0 : &*Name.begin() - &*MangledName.begin();
+    *NMangled = MangledName.size() - Name.size();
 
   if (Flags & MSDF_DumpBackrefs)
     D.dumpBackReferences();