blob: 7a1c283d885eeae3795d5af8950eff41a5cfe359 [file] [log] [blame]
Louis Dionneeb8650a2021-11-17 21:25:011//===----------------------------------------------------------------------===//
Howard Hinnant3e519522010-05-11 19:42:162//
Chandler Carruth57b08b02019-01-19 10:56:403// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
Howard Hinnant3e519522010-05-11 19:42:166//
7//===----------------------------------------------------------------------===//
8
Louis Dionne0cc34ca2022-04-11 16:32:409#include <__config>
10#ifdef _LIBCPP_DEPRECATED_ABI_LEGACY_LIBRARY_DEFINITIONS_FOR_INLINE_FUNCTIONS
Louis Dionne9783f282023-12-18 19:01:3311# define _LIBCPP_SHARED_PTR_DEFINE_LEGACY_INLINE_FUNCTIONS
Louis Dionne0cc34ca2022-04-11 16:32:4012#endif
13
Arthur O'Dwyerbbb0f2c2022-02-11 18:00:3914#include <memory>
15
Jonathan Roelofsb3fcc672014-09-05 19:45:0516#ifndef _LIBCPP_HAS_NO_THREADS
Arthur O'Dwyerbbb0f2c2022-02-11 18:00:3917# include <mutex>
18# include <thread>
19# if defined(__ELF__) && defined(_LIBCPP_LINK_PTHREAD_LIB)
20# pragma comment(lib, "pthread")
21# endif
Jonathan Roelofsb3fcc672014-09-05 19:45:0522#endif
Arthur O'Dwyerbbb0f2c2022-02-11 18:00:3923
Eric Fiseliere8fd1642015-08-18 21:08:5424#include "include/atomic_support.h"
Howard Hinnant3e519522010-05-11 19:42:1625
26_LIBCPP_BEGIN_NAMESPACE_STD
27
Louis Dionne56013052021-03-01 17:09:4528bad_weak_ptr::~bad_weak_ptr() noexcept {}
Howard Hinnant3e519522010-05-11 19:42:1629
Louis Dionne9783f282023-12-18 19:01:3330const char* bad_weak_ptr::what() const noexcept { return "bad_weak_ptr"; }
Howard Hinnant3e519522010-05-11 19:42:1631
Louis Dionne9783f282023-12-18 19:01:3332__shared_count::~__shared_count() {}
Howard Hinnant3e519522010-05-11 19:42:1633
Louis Dionne9783f282023-12-18 19:01:3334__shared_weak_count::~__shared_weak_count() {}
Kevin Huf08de522017-01-17 02:46:3335
Louis Dionne0cc34ca2022-04-11 16:32:4036#if defined(_LIBCPP_SHARED_PTR_DEFINE_LEGACY_INLINE_FUNCTIONS)
Louis Dionne9783f282023-12-18 19:01:3337void __shared_count::__add_shared() noexcept { __libcpp_atomic_refcount_increment(__shared_owners_); }
38
39bool __shared_count::__release_shared() noexcept {
40 if (__libcpp_atomic_refcount_decrement(__shared_owners_) == -1) {
41 __on_zero_shared();
42 return true;
43 }
44 return false;
Howard Hinnant3e519522010-05-11 19:42:1645}
46
Louis Dionne9783f282023-12-18 19:01:3347void __shared_weak_count::__add_shared() noexcept { __shared_count::__add_shared(); }
Howard Hinnant3e519522010-05-11 19:42:1648
Louis Dionne9783f282023-12-18 19:01:3349void __shared_weak_count::__add_weak() noexcept { __libcpp_atomic_refcount_increment(__shared_weak_owners_); }
Howard Hinnant3e519522010-05-11 19:42:1650
Louis Dionne9783f282023-12-18 19:01:3351void __shared_weak_count::__release_shared() noexcept {
52 if (__shared_count::__release_shared())
53 __release_weak();
Howard Hinnant3e519522010-05-11 19:42:1654}
Louis Dionne0cc34ca2022-04-11 16:32:4055#endif // _LIBCPP_SHARED_PTR_DEFINE_LEGACY_INLINE_FUNCTIONS
Eric Fiselier11f60452017-01-17 03:16:2656
Louis Dionne9783f282023-12-18 19:01:3357void __shared_weak_count::__release_weak() noexcept {
58 // NOTE: The acquire load here is an optimization of the very
59 // common case where a shared pointer is being destructed while
60 // having no other contended references.
61 //
62 // BENEFIT: We avoid expensive atomic stores like XADD and STREX
63 // in a common case. Those instructions are slow and do nasty
64 // things to caches.
65 //
66 // IS THIS SAFE? Yes. During weak destruction, if we see that we
67 // are the last reference, we know that no-one else is accessing
68 // us. If someone were accessing us, then they would be doing so
69 // while the last shared / weak_ptr was being destructed, and
70 // that's undefined anyway.
71 //
72 // If we see anything other than a 0, then we have possible
73 // contention, and need to use an atomicrmw primitive.
74 // The same arguments don't apply for increment, where it is legal
75 // (though inadvisable) to share shared_ptr references between
76 // threads, and have them all get copied at once. The argument
77 // also doesn't apply for __release_shared, because an outstanding
78 // weak_ptr::lock() could read / modify the shared count.
79 if (__libcpp_atomic_load(&__shared_weak_owners_, _AO_Acquire) == 0) {
80 // no need to do this store, because we are about
81 // to destroy everything.
82 //__libcpp_atomic_store(&__shared_weak_owners_, -1, _AO_Release);
83 __on_zero_shared_weak();
84 } else if (__libcpp_atomic_refcount_decrement(__shared_weak_owners_) == -1)
85 __on_zero_shared_weak();
Howard Hinnant3e519522010-05-11 19:42:1686}
87
Louis Dionne9783f282023-12-18 19:01:3388__shared_weak_count* __shared_weak_count::lock() noexcept {
89 long object_owners = __libcpp_atomic_load(&__shared_owners_);
90 while (object_owners != -1) {
91 if (__libcpp_atomic_compare_exchange(&__shared_owners_, &object_owners, object_owners + 1))
92 return this;
93 }
94 return nullptr;
Howard Hinnant3e519522010-05-11 19:42:1695}
96
Louis Dionne9783f282023-12-18 19:01:3397const void* __shared_weak_count::__get_deleter(const type_info&) const noexcept { return nullptr; }
Howard Hinnant3e519522010-05-11 19:42:1698
Louis Dionne92832e42021-11-17 15:59:3199#if !defined(_LIBCPP_HAS_NO_THREADS)
Howard Hinnante4b2a742012-08-19 15:13:16100
Louis Dionne9783f282023-12-18 19:01:33101static constexpr std::size_t __sp_mut_count = 32;
102static constinit __libcpp_mutex_t mut_back[__sp_mut_count] = {
Asiri Rathnayakec7e42392016-05-06 14:06:29103 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER,
104 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER,
105 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER,
Louis Dionne5b386ac92022-05-26 21:42:06106 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER,
107 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER,
108 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER,
109 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER,
Louis Dionne9783f282023-12-18 19:01:33110 _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER, _LIBCPP_MUTEX_INITIALIZER};
Howard Hinnant5efca642013-03-16 00:17:53111
Louis Dionne9783f282023-12-18 19:01:33112constexpr __sp_mut::__sp_mut(void* p) noexcept : __lx_(p) {}
113
114void __sp_mut::lock() noexcept {
115 auto m = static_cast<__libcpp_mutex_t*>(__lx_);
116 __libcpp_mutex_lock(m);
Howard Hinnantd77851e2012-07-30 01:40:57117}
118
Louis Dionne9783f282023-12-18 19:01:33119void __sp_mut::unlock() noexcept { __libcpp_mutex_unlock(static_cast<__libcpp_mutex_t*>(__lx_)); }
Howard Hinnantd77851e2012-07-30 01:40:57120
Louis Dionne9783f282023-12-18 19:01:33121__sp_mut& __get_sp_mut(const void* p) {
122 static constinit __sp_mut muts[__sp_mut_count] = {
123 &mut_back[0], &mut_back[1], &mut_back[2], &mut_back[3], &mut_back[4], &mut_back[5], &mut_back[6],
124 &mut_back[7], &mut_back[8], &mut_back[9], &mut_back[10], &mut_back[11], &mut_back[12], &mut_back[13],
125 &mut_back[14], &mut_back[15], &mut_back[16], &mut_back[17], &mut_back[18], &mut_back[19], &mut_back[20],
126 &mut_back[21], &mut_back[22], &mut_back[23], &mut_back[24], &mut_back[25], &mut_back[26], &mut_back[27],
127 &mut_back[28], &mut_back[29], &mut_back[30], &mut_back[31]};
128 return muts[hash<const void*>()(p) & (__sp_mut_count - 1)];
Howard Hinnantd77851e2012-07-30 01:40:57129}
130
Louis Dionne92832e42021-11-17 15:59:31131#endif // !defined(_LIBCPP_HAS_NO_THREADS)
Howard Hinnantd77851e2012-07-30 01:40:57132
Louis Dionne9783f282023-12-18 19:01:33133void* align(size_t alignment, size_t size, void*& ptr, size_t& space) {
134 void* r = nullptr;
135 if (size <= space) {
136 char* p1 = static_cast<char*>(ptr);
137 char* p2 = reinterpret_cast<char*>(reinterpret_cast<uintptr_t>(p1 + (alignment - 1)) & -alignment);
138 size_t d = static_cast<size_t>(p2 - p1);
139 if (d <= space - size) {
140 r = p2;
141 ptr = r;
142 space -= d;
Howard Hinnant3e519522010-05-11 19:42:16143 }
Louis Dionne9783f282023-12-18 19:01:33144 }
145 return r;
Howard Hinnant3e519522010-05-11 19:42:16146}
147
148_LIBCPP_END_NAMESPACE_STD