Buckets:
arudradey/ml-cpu-storage / emsdk /upstream /emscripten /system /lib /libcxx /src /include /refstring.h
| //===----------------------------------------------------------------------===// | |
| // | |
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | |
| // See https://llvm.org/LICENSE.txt for license information. | |
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | |
| // | |
| //===----------------------------------------------------------------------===// | |
| // MacOS and iOS used to ship with libstdc++, and still support old applications | |
| // linking against libstdc++. The libc++ and libstdc++ exceptions are supposed | |
| // to be ABI compatible, such that they can be thrown from one library and caught | |
| // in the other. | |
| // | |
| // For that reason, we must look for libstdc++ in the same process and if found, | |
| // check the string stored in the exception object to see if it is the GCC empty | |
| // string singleton before manipulating the reference count. This is done so that | |
| // if an exception is created with a zero-length string in libstdc++, libc++abi | |
| // won't try to delete the memory. | |
| _LIBCPP_BEGIN_NAMESPACE_STD | |
| namespace __refstring_imp { | |
| namespace { | |
| typedef int count_t; | |
| struct _Rep_base { | |
| std::size_t len; | |
| std::size_t cap; | |
| count_t count; | |
| }; | |
| inline _Rep_base* rep_from_data(const char* data_) noexcept { | |
| char* data = const_cast<char*>(data_); | |
| return reinterpret_cast<_Rep_base*>(data - sizeof(_Rep_base)); | |
| } | |
| inline char* data_from_rep(_Rep_base* rep) noexcept { | |
| char* data = reinterpret_cast<char*>(rep); | |
| return data + sizeof(*rep); | |
| } | |
| inline const char* compute_gcc_empty_string_storage() noexcept { | |
| void* handle = dlopen("/usr/lib/libstdc++.6.dylib", RTLD_NOLOAD); | |
| if (handle == nullptr) | |
| return nullptr; | |
| void* sym = dlsym(handle, "_ZNSs4_Rep20_S_empty_rep_storageE"); | |
| if (sym == nullptr) | |
| return nullptr; | |
| return data_from_rep(reinterpret_cast<_Rep_base*>(sym)); | |
| } | |
| inline const char* get_gcc_empty_string_storage() noexcept { | |
| static const char* p = compute_gcc_empty_string_storage(); | |
| return p; | |
| } | |
| } // namespace | |
| } // namespace __refstring_imp | |
| using namespace __refstring_imp; | |
| inline __libcpp_refstring::__libcpp_refstring(const char* msg) { | |
| std::size_t len = strlen(msg); | |
| _Rep_base* rep = static_cast<_Rep_base*>(::operator new(sizeof(*rep) + len + 1)); | |
| rep->len = len; | |
| rep->cap = len; | |
| rep->count = 0; | |
| char* data = data_from_rep(rep); | |
| std::memcpy(data, msg, len + 1); | |
| __imp_ = data; | |
| } | |
| inline __libcpp_refstring::__libcpp_refstring(const __libcpp_refstring& s) noexcept : __imp_(s.__imp_) { | |
| if (__uses_refcount()) | |
| __libcpp_atomic_add(&rep_from_data(__imp_)->count, 1); | |
| } | |
| inline __libcpp_refstring& __libcpp_refstring::operator=(__libcpp_refstring const& s) noexcept { | |
| bool adjust_old_count = __uses_refcount(); | |
| struct _Rep_base* old_rep = rep_from_data(__imp_); | |
| __imp_ = s.__imp_; | |
| if (__uses_refcount()) | |
| __libcpp_atomic_add(&rep_from_data(__imp_)->count, 1); | |
| if (adjust_old_count) { | |
| if (__libcpp_atomic_add(&old_rep->count, count_t(-1)) < 0) { | |
| ::operator delete(old_rep); | |
| } | |
| } | |
| return *this; | |
| } | |
| inline __libcpp_refstring::~__libcpp_refstring() { | |
| if (__uses_refcount()) { | |
| _Rep_base* rep = rep_from_data(__imp_); | |
| if (__libcpp_atomic_add(&rep->count, count_t(-1)) < 0) { | |
| ::operator delete(rep); | |
| } | |
| } | |
| } | |
| inline bool __libcpp_refstring::__uses_refcount() const { | |
| return __imp_ != get_gcc_empty_string_storage(); | |
| return true; | |
| } | |
| _LIBCPP_END_NAMESPACE_STD | |
Xet Storage Details
- Size:
- 3.98 kB
- Xet hash:
- 3e81a16c936160b4f797a4b172a7bff34cce4853b19e38a26d73a8c81ceb85a4
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.