File: | tools/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/AppleObjCRuntimeV1.cpp |
Warning: | line 67, column 29 Use of memory after it is freed |
[?] Use j/k keys for keyboard navigation
1 | //===-- AppleObjCRuntimeV1.cpp --------------------------------------*- C++ | |||
2 | //-*-===// | |||
3 | // | |||
4 | // The LLVM Compiler Infrastructure | |||
5 | // | |||
6 | // This file is distributed under the University of Illinois Open Source | |||
7 | // License. See LICENSE.TXT for details. | |||
8 | // | |||
9 | //===----------------------------------------------------------------------===// | |||
10 | ||||
11 | #include "AppleObjCRuntimeV1.h" | |||
12 | #include "AppleObjCDeclVendor.h" | |||
13 | #include "AppleObjCTrampolineHandler.h" | |||
14 | ||||
15 | #include "clang/AST/Type.h" | |||
16 | ||||
17 | #include "lldb/Breakpoint/BreakpointLocation.h" | |||
18 | #include "lldb/Core/Module.h" | |||
19 | #include "lldb/Core/PluginManager.h" | |||
20 | #include "lldb/Core/Scalar.h" | |||
21 | #include "lldb/Expression/FunctionCaller.h" | |||
22 | #include "lldb/Expression/UtilityFunction.h" | |||
23 | #include "lldb/Symbol/ClangASTContext.h" | |||
24 | #include "lldb/Symbol/Symbol.h" | |||
25 | #include "lldb/Target/ExecutionContext.h" | |||
26 | #include "lldb/Target/Process.h" | |||
27 | #include "lldb/Target/RegisterContext.h" | |||
28 | #include "lldb/Target/Target.h" | |||
29 | #include "lldb/Target/Thread.h" | |||
30 | #include "lldb/Utility/ConstString.h" | |||
31 | #include "lldb/Utility/Log.h" | |||
32 | #include "lldb/Utility/Status.h" | |||
33 | #include "lldb/Utility/StreamString.h" | |||
34 | ||||
35 | #include <vector> | |||
36 | ||||
37 | using namespace lldb; | |||
38 | using namespace lldb_private; | |||
39 | ||||
40 | AppleObjCRuntimeV1::AppleObjCRuntimeV1(Process *process) | |||
41 | : AppleObjCRuntime(process), m_hash_signature(), | |||
42 | m_isa_hash_table_ptr(LLDB_INVALID_ADDRESS(18446744073709551615UL)) {} | |||
43 | ||||
44 | // for V1 runtime we just try to return a class name as that is the minimum | |||
45 | // level of support | |||
46 | // required for the data formatters to work | |||
47 | bool AppleObjCRuntimeV1::GetDynamicTypeAndAddress( | |||
48 | ValueObject &in_value, lldb::DynamicValueType use_dynamic, | |||
49 | TypeAndOrName &class_type_or_name, Address &address, | |||
50 | Value::ValueType &value_type) { | |||
51 | class_type_or_name.Clear(); | |||
52 | value_type = Value::ValueType::eValueTypeScalar; | |||
53 | if (CouldHaveDynamicValue(in_value)) { | |||
54 | auto class_descriptor(GetClassDescriptor(in_value)); | |||
55 | if (class_descriptor && class_descriptor->IsValid() && | |||
56 | class_descriptor->GetClassName()) { | |||
57 | const addr_t object_ptr = in_value.GetPointerValue(); | |||
58 | address.SetRawAddress(object_ptr); | |||
59 | class_type_or_name.SetName(class_descriptor->GetClassName()); | |||
60 | } | |||
61 | } | |||
62 | return class_type_or_name.IsEmpty() == false; | |||
63 | } | |||
64 | ||||
65 | //------------------------------------------------------------------ | |||
66 | // Static Functions | |||
67 | //------------------------------------------------------------------ | |||
68 | lldb_private::LanguageRuntime * | |||
69 | AppleObjCRuntimeV1::CreateInstance(Process *process, | |||
70 | lldb::LanguageType language) { | |||
71 | // FIXME: This should be a MacOS or iOS process, and we need to look for the | |||
72 | // OBJC section to make | |||
73 | // sure we aren't using the V1 runtime. | |||
74 | if (language == eLanguageTypeObjC) { | |||
75 | ModuleSP objc_module_sp; | |||
76 | ||||
77 | if (AppleObjCRuntime::GetObjCVersion(process, objc_module_sp) == | |||
78 | ObjCRuntimeVersions::eAppleObjC_V1) | |||
79 | return new AppleObjCRuntimeV1(process); | |||
80 | else | |||
81 | return NULL__null; | |||
82 | } else | |||
83 | return NULL__null; | |||
84 | } | |||
85 | ||||
86 | void AppleObjCRuntimeV1::Initialize() { | |||
87 | PluginManager::RegisterPlugin( | |||
88 | GetPluginNameStatic(), "Apple Objective C Language Runtime - Version 1", | |||
89 | CreateInstance); | |||
90 | } | |||
91 | ||||
92 | void AppleObjCRuntimeV1::Terminate() { | |||
93 | PluginManager::UnregisterPlugin(CreateInstance); | |||
94 | } | |||
95 | ||||
96 | lldb_private::ConstString AppleObjCRuntimeV1::GetPluginNameStatic() { | |||
97 | static ConstString g_name("apple-objc-v1"); | |||
98 | return g_name; | |||
99 | } | |||
100 | ||||
101 | //------------------------------------------------------------------ | |||
102 | // PluginInterface protocol | |||
103 | //------------------------------------------------------------------ | |||
104 | ConstString AppleObjCRuntimeV1::GetPluginName() { | |||
105 | return GetPluginNameStatic(); | |||
106 | } | |||
107 | ||||
108 | uint32_t AppleObjCRuntimeV1::GetPluginVersion() { return 1; } | |||
109 | ||||
110 | BreakpointResolverSP | |||
111 | AppleObjCRuntimeV1::CreateExceptionResolver(Breakpoint *bkpt, bool catch_bp, | |||
112 | bool throw_bp) { | |||
113 | BreakpointResolverSP resolver_sp; | |||
114 | ||||
115 | if (throw_bp) | |||
116 | resolver_sp.reset(new BreakpointResolverName( | |||
117 | bkpt, "objc_exception_throw", eFunctionNameTypeBase, | |||
118 | eLanguageTypeUnknown, Breakpoint::Exact, 0, eLazyBoolNo)); | |||
119 | // FIXME: don't do catch yet. | |||
120 | return resolver_sp; | |||
121 | } | |||
122 | ||||
123 | struct BufStruct { | |||
124 | char contents[2048]; | |||
125 | }; | |||
126 | ||||
127 | UtilityFunction *AppleObjCRuntimeV1::CreateObjectChecker(const char *name) { | |||
128 | std::unique_ptr<BufStruct> buf(new BufStruct); | |||
129 | ||||
130 | int strformatsize = snprintf(&buf->contents[0], sizeof(buf->contents), | |||
131 | "struct __objc_class " | |||
132 | " \n" | |||
133 | "{ " | |||
134 | " \n" | |||
135 | " struct __objc_class *isa; " | |||
136 | " \n" | |||
137 | " struct __objc_class *super_class; " | |||
138 | " \n" | |||
139 | " const char *name; " | |||
140 | " \n" | |||
141 | " // rest of struct elided because unused " | |||
142 | " \n" | |||
143 | "}; " | |||
144 | " \n" | |||
145 | " " | |||
146 | " \n" | |||
147 | "struct __objc_object " | |||
148 | " \n" | |||
149 | "{ " | |||
150 | " \n" | |||
151 | " struct __objc_class *isa; " | |||
152 | " \n" | |||
153 | "}; " | |||
154 | " \n" | |||
155 | " " | |||
156 | " \n" | |||
157 | "extern \"C\" void " | |||
158 | " \n" | |||
159 | "%s(void *$__lldb_arg_obj, void *$__lldb_arg_selector) " | |||
160 | " \n" | |||
161 | "{ " | |||
162 | " \n" | |||
163 | " struct __objc_object *obj = (struct " | |||
164 | "__objc_object*)$__lldb_arg_obj; \n" | |||
165 | " if ($__lldb_arg_obj == (void *)0) " | |||
166 | " \n" | |||
167 | " return; // nil is ok " | |||
168 | " (int)strlen(obj->isa->name); " | |||
169 | " \n" | |||
170 | "} " | |||
171 | " \n", | |||
172 | name); | |||
173 | assert(strformatsize < (int)sizeof(buf->contents))(static_cast <bool> (strformatsize < (int)sizeof(buf ->contents)) ? void (0) : __assert_fail ("strformatsize < (int)sizeof(buf->contents)" , "/build/llvm-toolchain-snapshot-6.0~svn321639/tools/lldb/source/Plugins/LanguageRuntime/ObjC/AppleObjCRuntime/AppleObjCRuntimeV1.cpp" , 173, __extension__ __PRETTY_FUNCTION__)); | |||
174 | (void)strformatsize; | |||
175 | ||||
176 | Status error; | |||
177 | return GetTargetRef().GetUtilityFunctionForLanguage( | |||
178 | buf->contents, eLanguageTypeObjC, name, error); | |||
179 | } | |||
180 | ||||
181 | AppleObjCRuntimeV1::ClassDescriptorV1::ClassDescriptorV1( | |||
182 | ValueObject &isa_pointer) { | |||
183 | Initialize(isa_pointer.GetValueAsUnsigned(0), isa_pointer.GetProcessSP()); | |||
184 | } | |||
185 | ||||
186 | AppleObjCRuntimeV1::ClassDescriptorV1::ClassDescriptorV1( | |||
187 | ObjCISA isa, lldb::ProcessSP process_sp) { | |||
188 | Initialize(isa, process_sp); | |||
189 | } | |||
190 | ||||
191 | void AppleObjCRuntimeV1::ClassDescriptorV1::Initialize( | |||
192 | ObjCISA isa, lldb::ProcessSP process_sp) { | |||
193 | if (!isa || !process_sp) { | |||
194 | m_valid = false; | |||
195 | return; | |||
196 | } | |||
197 | ||||
198 | m_valid = true; | |||
199 | ||||
200 | Status error; | |||
201 | ||||
202 | m_isa = process_sp->ReadPointerFromMemory(isa, error); | |||
203 | ||||
204 | if (error.Fail()) { | |||
205 | m_valid = false; | |||
206 | return; | |||
207 | } | |||
208 | ||||
209 | uint32_t ptr_size = process_sp->GetAddressByteSize(); | |||
210 | ||||
211 | if (!IsPointerValid(m_isa, ptr_size)) { | |||
212 | m_valid = false; | |||
213 | return; | |||
214 | } | |||
215 | ||||
216 | m_parent_isa = process_sp->ReadPointerFromMemory(m_isa + ptr_size, error); | |||
217 | ||||
218 | if (error.Fail()) { | |||
219 | m_valid = false; | |||
220 | return; | |||
221 | } | |||
222 | ||||
223 | if (!IsPointerValid(m_parent_isa, ptr_size, true)) { | |||
224 | m_valid = false; | |||
225 | return; | |||
226 | } | |||
227 | ||||
228 | lldb::addr_t name_ptr = | |||
229 | process_sp->ReadPointerFromMemory(m_isa + 2 * ptr_size, error); | |||
230 | ||||
231 | if (error.Fail()) { | |||
232 | m_valid = false; | |||
233 | return; | |||
234 | } | |||
235 | ||||
236 | lldb::DataBufferSP buffer_sp(new DataBufferHeap(1024, 0)); | |||
237 | ||||
238 | size_t count = process_sp->ReadCStringFromMemory( | |||
239 | name_ptr, (char *)buffer_sp->GetBytes(), 1024, error); | |||
240 | ||||
241 | if (error.Fail()) { | |||
242 | m_valid = false; | |||
243 | return; | |||
244 | } | |||
245 | ||||
246 | if (count) | |||
247 | m_name = ConstString((char *)buffer_sp->GetBytes()); | |||
248 | else | |||
249 | m_name = ConstString(); | |||
250 | ||||
251 | m_instance_size = process_sp->ReadUnsignedIntegerFromMemory( | |||
252 | m_isa + 5 * ptr_size, ptr_size, 0, error); | |||
253 | ||||
254 | if (error.Fail()) { | |||
255 | m_valid = false; | |||
256 | return; | |||
257 | } | |||
258 | ||||
259 | m_process_wp = lldb::ProcessWP(process_sp); | |||
260 | } | |||
261 | ||||
262 | AppleObjCRuntime::ClassDescriptorSP | |||
263 | AppleObjCRuntimeV1::ClassDescriptorV1::GetSuperclass() { | |||
264 | if (!m_valid) | |||
265 | return AppleObjCRuntime::ClassDescriptorSP(); | |||
266 | ProcessSP process_sp = m_process_wp.lock(); | |||
267 | if (!process_sp) | |||
268 | return AppleObjCRuntime::ClassDescriptorSP(); | |||
269 | return ObjCLanguageRuntime::ClassDescriptorSP( | |||
270 | new AppleObjCRuntimeV1::ClassDescriptorV1(m_parent_isa, process_sp)); | |||
271 | } | |||
272 | ||||
273 | AppleObjCRuntime::ClassDescriptorSP | |||
274 | AppleObjCRuntimeV1::ClassDescriptorV1::GetMetaclass() const { | |||
275 | return ClassDescriptorSP(); | |||
276 | } | |||
277 | ||||
278 | bool AppleObjCRuntimeV1::ClassDescriptorV1::Describe( | |||
279 | std::function<void(ObjCLanguageRuntime::ObjCISA)> const &superclass_func, | |||
280 | std::function<bool(const char *, const char *)> const &instance_method_func, | |||
281 | std::function<bool(const char *, const char *)> const &class_method_func, | |||
282 | std::function<bool(const char *, const char *, lldb::addr_t, | |||
283 | uint64_t)> const &ivar_func) const { | |||
284 | return false; | |||
285 | } | |||
286 | ||||
287 | lldb::addr_t AppleObjCRuntimeV1::GetISAHashTablePointer() { | |||
288 | if (m_isa_hash_table_ptr == LLDB_INVALID_ADDRESS(18446744073709551615UL)) { | |||
289 | ModuleSP objc_module_sp(GetObjCModule()); | |||
290 | ||||
291 | if (!objc_module_sp) | |||
292 | return LLDB_INVALID_ADDRESS(18446744073709551615UL); | |||
293 | ||||
294 | static ConstString g_objc_debug_class_hash("_objc_debug_class_hash"); | |||
295 | ||||
296 | const Symbol *symbol = objc_module_sp->FindFirstSymbolWithNameAndType( | |||
297 | g_objc_debug_class_hash, lldb::eSymbolTypeData); | |||
298 | if (symbol && symbol->ValueIsAddress()) { | |||
299 | Process *process = GetProcess(); | |||
300 | if (process) { | |||
301 | ||||
302 | lldb::addr_t objc_debug_class_hash_addr = | |||
303 | symbol->GetAddressRef().GetLoadAddress(&process->GetTarget()); | |||
304 | ||||
305 | if (objc_debug_class_hash_addr != LLDB_INVALID_ADDRESS(18446744073709551615UL)) { | |||
306 | Status error; | |||
307 | lldb::addr_t objc_debug_class_hash_ptr = | |||
308 | process->ReadPointerFromMemory(objc_debug_class_hash_addr, error); | |||
309 | if (objc_debug_class_hash_ptr != 0 && | |||
310 | objc_debug_class_hash_ptr != LLDB_INVALID_ADDRESS(18446744073709551615UL)) { | |||
311 | m_isa_hash_table_ptr = objc_debug_class_hash_ptr; | |||
312 | } | |||
313 | } | |||
314 | } | |||
315 | } | |||
316 | } | |||
317 | return m_isa_hash_table_ptr; | |||
318 | } | |||
319 | ||||
320 | void AppleObjCRuntimeV1::UpdateISAToDescriptorMapIfNeeded() { | |||
321 | // TODO: implement HashTableSignature... | |||
322 | Process *process = GetProcess(); | |||
323 | ||||
324 | if (process) { | |||
| ||||
325 | // Update the process stop ID that indicates the last time we updated the | |||
326 | // map, whether it was successful or not. | |||
327 | m_isa_to_descriptor_stop_id = process->GetStopID(); | |||
328 | ||||
329 | Log *log(GetLogIfAllCategoriesSet(LIBLLDB_LOG_PROCESS(1u << 1))); | |||
330 | ||||
331 | ProcessSP process_sp = process->shared_from_this(); | |||
332 | ||||
333 | ModuleSP objc_module_sp(GetObjCModule()); | |||
334 | ||||
335 | if (!objc_module_sp) | |||
336 | return; | |||
337 | ||||
338 | uint32_t isa_count = 0; | |||
339 | ||||
340 | lldb::addr_t hash_table_ptr = GetISAHashTablePointer(); | |||
341 | if (hash_table_ptr != LLDB_INVALID_ADDRESS(18446744073709551615UL)) { | |||
342 | // Read the NXHashTable struct: | |||
343 | // | |||
344 | // typedef struct { | |||
345 | // const NXHashTablePrototype *prototype; | |||
346 | // unsigned count; | |||
347 | // unsigned nbBuckets; | |||
348 | // void *buckets; | |||
349 | // const void *info; | |||
350 | // } NXHashTable; | |||
351 | ||||
352 | Status error; | |||
353 | DataBufferHeap buffer(1024, 0); | |||
354 | if (process->ReadMemory(hash_table_ptr, buffer.GetBytes(), 20, error) == | |||
355 | 20) { | |||
356 | const uint32_t addr_size = m_process->GetAddressByteSize(); | |||
357 | const ByteOrder byte_order = m_process->GetByteOrder(); | |||
358 | DataExtractor data(buffer.GetBytes(), buffer.GetByteSize(), byte_order, | |||
359 | addr_size); | |||
360 | lldb::offset_t offset = addr_size; // Skip prototype | |||
361 | const uint32_t count = data.GetU32(&offset); | |||
362 | const uint32_t num_buckets = data.GetU32(&offset); | |||
363 | const addr_t buckets_ptr = data.GetPointer(&offset); | |||
364 | if (m_hash_signature.NeedsUpdate(count, num_buckets, buckets_ptr)) { | |||
365 | m_hash_signature.UpdateSignature(count, num_buckets, buckets_ptr); | |||
366 | ||||
367 | const uint32_t data_size = num_buckets * 2 * sizeof(uint32_t); | |||
368 | buffer.SetByteSize(data_size); | |||
369 | ||||
370 | if (process->ReadMemory(buckets_ptr, buffer.GetBytes(), data_size, | |||
371 | error) == data_size) { | |||
372 | data.SetData(buffer.GetBytes(), buffer.GetByteSize(), byte_order); | |||
373 | offset = 0; | |||
374 | for (uint32_t bucket_idx = 0; bucket_idx < num_buckets; | |||
375 | ++bucket_idx) { | |||
376 | const uint32_t bucket_isa_count = data.GetU32(&offset); | |||
377 | const lldb::addr_t bucket_data = data.GetU32(&offset); | |||
378 | ||||
379 | if (bucket_isa_count == 0) | |||
380 | continue; | |||
381 | ||||
382 | isa_count += bucket_isa_count; | |||
383 | ||||
384 | ObjCISA isa; | |||
385 | if (bucket_isa_count == 1) { | |||
386 | // When we only have one entry in the bucket, the bucket data is | |||
387 | // the "isa" | |||
388 | isa = bucket_data; | |||
389 | if (isa) { | |||
390 | if (!ISAIsCached(isa)) { | |||
391 | ClassDescriptorSP descriptor_sp( | |||
392 | new ClassDescriptorV1(isa, process_sp)); | |||
393 | ||||
394 | if (log && log->GetVerbose()) | |||
395 | log->Printf("AppleObjCRuntimeV1 added (ObjCISA)0x%" PRIx64"l" "x" | |||
396 | " from _objc_debug_class_hash to " | |||
397 | "isa->descriptor cache", | |||
398 | isa); | |||
399 | ||||
400 | AddClass(isa, descriptor_sp); | |||
401 | } | |||
402 | } | |||
403 | } else { | |||
404 | // When we have more than one entry in the bucket, the bucket | |||
405 | // data is a pointer | |||
406 | // to an array of "isa" values | |||
407 | addr_t isa_addr = bucket_data; | |||
408 | for (uint32_t isa_idx = 0; isa_idx < bucket_isa_count; | |||
409 | ++isa_idx, isa_addr += addr_size) { | |||
410 | isa = m_process->ReadPointerFromMemory(isa_addr, error); | |||
411 | ||||
412 | if (isa && isa != LLDB_INVALID_ADDRESS(18446744073709551615UL)) { | |||
413 | if (!ISAIsCached(isa)) { | |||
414 | ClassDescriptorSP descriptor_sp( | |||
415 | new ClassDescriptorV1(isa, process_sp)); | |||
416 | ||||
417 | if (log && log->GetVerbose()) | |||
418 | log->Printf( | |||
419 | "AppleObjCRuntimeV1 added (ObjCISA)0x%" PRIx64"l" "x" | |||
420 | " from _objc_debug_class_hash to isa->descriptor " | |||
421 | "cache", | |||
422 | isa); | |||
423 | ||||
424 | AddClass(isa, descriptor_sp); | |||
425 | } | |||
426 | } | |||
427 | } | |||
428 | } | |||
429 | } | |||
430 | } | |||
431 | } | |||
432 | } | |||
433 | } | |||
434 | } else { | |||
435 | m_isa_to_descriptor_stop_id = UINT32_MAX(4294967295U); | |||
436 | } | |||
437 | } | |||
438 | ||||
439 | DeclVendor *AppleObjCRuntimeV1::GetDeclVendor() { | |||
440 | return nullptr; | |||
441 | } |
1 | //===-- ObjCLanguageRuntime.h -----------------------------------*- C++ -*-===// |
2 | // |
3 | // The LLVM Compiler Infrastructure |
4 | // |
5 | // This file is distributed under the University of Illinois Open Source |
6 | // License. See LICENSE.TXT for details. |
7 | // |
8 | //===----------------------------------------------------------------------===// |
9 | |
10 | #ifndef liblldb_ObjCLanguageRuntime_h_ |
11 | #define liblldb_ObjCLanguageRuntime_h_ |
12 | |
13 | // C Includes |
14 | // C++ Includes |
15 | #include <functional> |
16 | #include <map> |
17 | #include <memory> |
18 | #include <unordered_set> |
19 | |
20 | // Other libraries and framework includes |
21 | #include "llvm/Support/Casting.h" |
22 | |
23 | // Project includes |
24 | #include "lldb/Core/PluginInterface.h" |
25 | #include "lldb/Core/ThreadSafeDenseMap.h" |
26 | #include "lldb/Symbol/CompilerType.h" |
27 | #include "lldb/Symbol/DeclVendor.h" |
28 | #include "lldb/Symbol/Type.h" |
29 | #include "lldb/Target/LanguageRuntime.h" |
30 | #include "lldb/lldb-private.h" |
31 | |
32 | class CommandObjectObjC_ClassTable_Dump; |
33 | |
34 | namespace lldb_private { |
35 | |
36 | class UtilityFunction; |
37 | |
38 | class ObjCLanguageRuntime : public LanguageRuntime { |
39 | public: |
40 | enum class ObjCRuntimeVersions { |
41 | eObjC_VersionUnknown = 0, |
42 | eAppleObjC_V1 = 1, |
43 | eAppleObjC_V2 = 2 |
44 | }; |
45 | |
46 | typedef lldb::addr_t ObjCISA; |
47 | |
48 | class ClassDescriptor; |
49 | typedef std::shared_ptr<ClassDescriptor> ClassDescriptorSP; |
50 | |
51 | // the information that we want to support retrieving from an ObjC class |
52 | // this needs to be pure virtual since there are at least 2 different |
53 | // implementations |
54 | // of the runtime, and more might come |
55 | class ClassDescriptor { |
56 | public: |
57 | ClassDescriptor() |
58 | : m_is_kvo(eLazyBoolCalculate), m_is_cf(eLazyBoolCalculate), |
59 | m_type_wp() {} |
60 | |
61 | virtual ~ClassDescriptor() = default; |
62 | |
63 | virtual ConstString GetClassName() = 0; |
64 | |
65 | virtual ClassDescriptorSP GetSuperclass() = 0; |
66 | |
67 | virtual ClassDescriptorSP GetMetaclass() const = 0; |
68 | |
69 | // virtual if any implementation has some other version-specific rules |
70 | // but for the known v1/v2 this is all that needs to be done |
71 | virtual bool IsKVO() { |
72 | if (m_is_kvo == eLazyBoolCalculate) { |
73 | const char *class_name = GetClassName().AsCString(); |
74 | if (class_name && *class_name) |
75 | m_is_kvo = |
76 | (LazyBool)(strstr(class_name, "NSKVONotifying_") == class_name); |
77 | } |
78 | return (m_is_kvo == eLazyBoolYes); |
79 | } |
80 | |
81 | // virtual if any implementation has some other version-specific rules |
82 | // but for the known v1/v2 this is all that needs to be done |
83 | virtual bool IsCFType() { |
84 | if (m_is_cf == eLazyBoolCalculate) { |
85 | const char *class_name = GetClassName().AsCString(); |
86 | if (class_name && *class_name) |
87 | m_is_cf = (LazyBool)(strcmp(class_name, "__NSCFType") == 0 || |
88 | strcmp(class_name, "NSCFType") == 0); |
89 | } |
90 | return (m_is_cf == eLazyBoolYes); |
91 | } |
92 | |
93 | virtual bool IsValid() = 0; |
94 | |
95 | virtual bool GetTaggedPointerInfo(uint64_t *info_bits = nullptr, |
96 | uint64_t *value_bits = nullptr, |
97 | uint64_t *payload = nullptr) = 0; |
98 | |
99 | virtual uint64_t GetInstanceSize() = 0; |
100 | |
101 | // use to implement version-specific additional constraints on pointers |
102 | virtual bool CheckPointer(lldb::addr_t value, uint32_t ptr_size) const { |
103 | return true; |
104 | } |
105 | |
106 | virtual ObjCISA GetISA() = 0; |
107 | |
108 | // This should return true iff the interface could be completed |
109 | virtual bool |
110 | Describe(std::function<void(ObjCISA)> const &superclass_func, |
111 | std::function<bool(const char *, const char *)> const |
112 | &instance_method_func, |
113 | std::function<bool(const char *, const char *)> const |
114 | &class_method_func, |
115 | std::function<bool(const char *, const char *, lldb::addr_t, |
116 | uint64_t)> const &ivar_func) const { |
117 | return false; |
118 | } |
119 | |
120 | lldb::TypeSP GetType() { return m_type_wp.lock(); } |
121 | |
122 | void SetType(const lldb::TypeSP &type_sp) { m_type_wp = type_sp; } |
123 | |
124 | struct iVarDescriptor { |
125 | ConstString m_name; |
126 | CompilerType m_type; |
127 | uint64_t m_size; |
128 | int32_t m_offset; |
129 | }; |
130 | |
131 | virtual size_t GetNumIVars() { return 0; } |
132 | |
133 | virtual iVarDescriptor GetIVarAtIndex(size_t idx) { |
134 | return iVarDescriptor(); |
135 | } |
136 | |
137 | protected: |
138 | bool IsPointerValid(lldb::addr_t value, uint32_t ptr_size, |
139 | bool allow_NULLs = false, bool allow_tagged = false, |
140 | bool check_version_specific = false) const; |
141 | |
142 | private: |
143 | LazyBool m_is_kvo; |
144 | LazyBool m_is_cf; |
145 | lldb::TypeWP m_type_wp; |
146 | }; |
147 | |
148 | class EncodingToType { |
149 | public: |
150 | virtual ~EncodingToType(); |
151 | |
152 | virtual CompilerType RealizeType(ClangASTContext &ast_ctx, const char *name, |
153 | bool for_expression); |
154 | virtual CompilerType RealizeType(const char *name, bool for_expression); |
155 | |
156 | virtual CompilerType RealizeType(clang::ASTContext &ast_ctx, |
157 | const char *name, bool for_expression) = 0; |
158 | |
159 | protected: |
160 | std::unique_ptr<ClangASTContext> m_scratch_ast_ctx_ap; |
161 | }; |
162 | |
163 | class ObjCExceptionPrecondition : public Breakpoint::BreakpointPrecondition { |
164 | public: |
165 | ObjCExceptionPrecondition(); |
166 | |
167 | ~ObjCExceptionPrecondition() override = default; |
168 | |
169 | bool EvaluatePrecondition(StoppointCallbackContext &context) override; |
170 | void GetDescription(Stream &stream, lldb::DescriptionLevel level) override; |
171 | Status ConfigurePrecondition(Args &args) override; |
172 | |
173 | protected: |
174 | void AddClassName(const char *class_name); |
175 | |
176 | private: |
177 | std::unordered_set<std::string> m_class_names; |
178 | }; |
179 | |
180 | class TaggedPointerVendor { |
181 | public: |
182 | virtual ~TaggedPointerVendor() = default; |
183 | |
184 | virtual bool IsPossibleTaggedPointer(lldb::addr_t ptr) = 0; |
185 | |
186 | virtual ObjCLanguageRuntime::ClassDescriptorSP |
187 | GetClassDescriptor(lldb::addr_t ptr) = 0; |
188 | |
189 | protected: |
190 | TaggedPointerVendor() = default; |
191 | |
192 | private: |
193 | DISALLOW_COPY_AND_ASSIGN(TaggedPointerVendor)TaggedPointerVendor(const TaggedPointerVendor &) = delete ; const TaggedPointerVendor &operator=(const TaggedPointerVendor &) = delete; |
194 | }; |
195 | |
196 | ~ObjCLanguageRuntime() override; |
197 | |
198 | virtual TaggedPointerVendor *GetTaggedPointerVendor() { return nullptr; } |
199 | |
200 | typedef std::shared_ptr<EncodingToType> EncodingToTypeSP; |
201 | |
202 | virtual EncodingToTypeSP GetEncodingToType(); |
203 | |
204 | virtual ClassDescriptorSP GetClassDescriptor(ValueObject &in_value); |
205 | |
206 | ClassDescriptorSP GetNonKVOClassDescriptor(ValueObject &in_value); |
207 | |
208 | virtual ClassDescriptorSP |
209 | GetClassDescriptorFromClassName(const ConstString &class_name); |
210 | |
211 | virtual ClassDescriptorSP GetClassDescriptorFromISA(ObjCISA isa); |
212 | |
213 | ClassDescriptorSP GetNonKVOClassDescriptor(ObjCISA isa); |
214 | |
215 | lldb::LanguageType GetLanguageType() const override { |
216 | return lldb::eLanguageTypeObjC; |
217 | } |
218 | |
219 | virtual bool IsModuleObjCLibrary(const lldb::ModuleSP &module_sp) = 0; |
220 | |
221 | virtual bool ReadObjCLibrary(const lldb::ModuleSP &module_sp) = 0; |
222 | |
223 | virtual bool HasReadObjCLibrary() = 0; |
224 | |
225 | virtual lldb::ThreadPlanSP GetStepThroughTrampolinePlan(Thread &thread, |
226 | bool stop_others) = 0; |
227 | |
228 | lldb::addr_t LookupInMethodCache(lldb::addr_t class_addr, lldb::addr_t sel); |
229 | |
230 | void AddToMethodCache(lldb::addr_t class_addr, lldb::addr_t sel, |
231 | lldb::addr_t impl_addr); |
232 | |
233 | TypeAndOrName LookupInClassNameCache(lldb::addr_t class_addr); |
234 | |
235 | void AddToClassNameCache(lldb::addr_t class_addr, const char *name, |
236 | lldb::TypeSP type_sp); |
237 | |
238 | void AddToClassNameCache(lldb::addr_t class_addr, |
239 | const TypeAndOrName &class_or_type_name); |
240 | |
241 | lldb::TypeSP LookupInCompleteClassCache(ConstString &name); |
242 | |
243 | virtual UtilityFunction *CreateObjectChecker(const char *) = 0; |
244 | |
245 | virtual ObjCRuntimeVersions GetRuntimeVersion() const { |
246 | return ObjCRuntimeVersions::eObjC_VersionUnknown; |
247 | } |
248 | |
249 | bool IsValidISA(ObjCISA isa) { |
250 | UpdateISAToDescriptorMap(); |
251 | return m_isa_to_descriptor.count(isa) > 0; |
252 | } |
253 | |
254 | virtual void UpdateISAToDescriptorMapIfNeeded() = 0; |
255 | |
256 | void UpdateISAToDescriptorMap() { |
257 | if (m_process && m_process->GetStopID() != m_isa_to_descriptor_stop_id) { |
258 | UpdateISAToDescriptorMapIfNeeded(); |
259 | } |
260 | } |
261 | |
262 | virtual ObjCISA GetISA(const ConstString &name); |
263 | |
264 | virtual ConstString GetActualTypeName(ObjCISA isa); |
265 | |
266 | virtual ObjCISA GetParentClass(ObjCISA isa); |
267 | |
268 | virtual DeclVendor *GetDeclVendor() { return nullptr; } |
269 | |
270 | // Finds the byte offset of the child_type ivar in parent_type. If it can't |
271 | // find the |
272 | // offset, returns LLDB_INVALID_IVAR_OFFSET. |
273 | |
274 | virtual size_t GetByteOffsetForIvar(CompilerType &parent_qual_type, |
275 | const char *ivar_name); |
276 | |
277 | // Given the name of an Objective-C runtime symbol (e.g., ivar offset symbol), |
278 | // try to determine from the runtime what the value of that symbol would be. |
279 | // Useful when the underlying binary is stripped. |
280 | virtual lldb::addr_t LookupRuntimeSymbol(const ConstString &name) { |
281 | return LLDB_INVALID_ADDRESS(18446744073709551615UL); |
282 | } |
283 | |
284 | bool HasNewLiteralsAndIndexing() { |
285 | if (m_has_new_literals_and_indexing == eLazyBoolCalculate) { |
286 | if (CalculateHasNewLiteralsAndIndexing()) |
287 | m_has_new_literals_and_indexing = eLazyBoolYes; |
288 | else |
289 | m_has_new_literals_and_indexing = eLazyBoolNo; |
290 | } |
291 | |
292 | return (m_has_new_literals_and_indexing == eLazyBoolYes); |
293 | } |
294 | |
295 | virtual void SymbolsDidLoad(const ModuleList &module_list) { |
296 | m_negative_complete_class_cache.clear(); |
297 | } |
298 | |
299 | bool GetTypeBitSize(const CompilerType &compiler_type, |
300 | uint64_t &size) override; |
301 | |
302 | protected: |
303 | //------------------------------------------------------------------ |
304 | // Classes that inherit from ObjCLanguageRuntime can see and modify these |
305 | //------------------------------------------------------------------ |
306 | ObjCLanguageRuntime(Process *process); |
307 | |
308 | virtual bool CalculateHasNewLiteralsAndIndexing() { return false; } |
309 | |
310 | bool ISAIsCached(ObjCISA isa) const { |
311 | return m_isa_to_descriptor.find(isa) != m_isa_to_descriptor.end(); |
312 | } |
313 | |
314 | bool AddClass(ObjCISA isa, const ClassDescriptorSP &descriptor_sp) { |
315 | if (isa != 0) { |
316 | m_isa_to_descriptor[isa] = descriptor_sp; |
317 | return true; |
318 | } |
319 | return false; |
320 | } |
321 | |
322 | bool AddClass(ObjCISA isa, const ClassDescriptorSP &descriptor_sp, |
323 | const char *class_name); |
324 | |
325 | bool AddClass(ObjCISA isa, const ClassDescriptorSP &descriptor_sp, |
326 | uint32_t class_name_hash) { |
327 | if (isa != 0) { |
328 | m_isa_to_descriptor[isa] = descriptor_sp; |
329 | m_hash_to_isa_map.insert(std::make_pair(class_name_hash, isa)); |
330 | return true; |
331 | } |
332 | return false; |
333 | } |
334 | |
335 | private: |
336 | // We keep a map of <Class,Selector>->Implementation so we don't have to call |
337 | // the resolver |
338 | // function over and over. |
339 | |
340 | // FIXME: We need to watch for the loading of Protocols, and flush the cache |
341 | // for any |
342 | // class that we see so changed. |
343 | |
344 | struct ClassAndSel { |
345 | ClassAndSel() { |
346 | sel_addr = LLDB_INVALID_ADDRESS(18446744073709551615UL); |
347 | class_addr = LLDB_INVALID_ADDRESS(18446744073709551615UL); |
348 | } |
349 | |
350 | ClassAndSel(lldb::addr_t in_sel_addr, lldb::addr_t in_class_addr) |
351 | : class_addr(in_class_addr), sel_addr(in_sel_addr) {} |
352 | |
353 | bool operator==(const ClassAndSel &rhs) { |
354 | if (class_addr == rhs.class_addr && sel_addr == rhs.sel_addr) |
355 | return true; |
356 | else |
357 | return false; |
358 | } |
359 | |
360 | bool operator<(const ClassAndSel &rhs) const { |
361 | if (class_addr < rhs.class_addr) |
362 | return true; |
363 | else if (class_addr > rhs.class_addr) |
364 | return false; |
365 | else { |
366 | if (sel_addr < rhs.sel_addr) |
367 | return true; |
368 | else |
369 | return false; |
370 | } |
371 | } |
372 | |
373 | lldb::addr_t class_addr; |
374 | lldb::addr_t sel_addr; |
375 | }; |
376 | |
377 | typedef std::map<ClassAndSel, lldb::addr_t> MsgImplMap; |
378 | typedef std::map<ObjCISA, ClassDescriptorSP> ISAToDescriptorMap; |
379 | typedef std::multimap<uint32_t, ObjCISA> HashToISAMap; |
380 | typedef ISAToDescriptorMap::iterator ISAToDescriptorIterator; |
381 | typedef HashToISAMap::iterator HashToISAIterator; |
382 | typedef ThreadSafeDenseMap<void *, uint64_t> TypeSizeCache; |
383 | |
384 | MsgImplMap m_impl_cache; |
385 | LazyBool m_has_new_literals_and_indexing; |
386 | ISAToDescriptorMap m_isa_to_descriptor; |
387 | HashToISAMap m_hash_to_isa_map; |
388 | TypeSizeCache m_type_size_cache; |
389 | |
390 | protected: |
391 | uint32_t m_isa_to_descriptor_stop_id; |
392 | |
393 | typedef std::map<ConstString, lldb::TypeWP> CompleteClassMap; |
394 | CompleteClassMap m_complete_class_cache; |
395 | |
396 | struct ConstStringSetHelpers { |
397 | size_t operator()(const ConstString &arg) const // for hashing |
398 | { |
399 | return (size_t)arg.GetCString(); |
400 | } |
401 | bool operator()(const ConstString &arg1, |
402 | const ConstString &arg2) const // for equality |
403 | { |
404 | return arg1.operator==(arg2); |
405 | } |
406 | }; |
407 | typedef std::unordered_set<ConstString, ConstStringSetHelpers, |
408 | ConstStringSetHelpers> |
409 | CompleteClassSet; |
410 | CompleteClassSet m_negative_complete_class_cache; |
411 | |
412 | ISAToDescriptorIterator GetDescriptorIterator(const ConstString &name); |
413 | |
414 | friend class ::CommandObjectObjC_ClassTable_Dump; |
415 | |
416 | std::pair<ISAToDescriptorIterator, ISAToDescriptorIterator> |
417 | GetDescriptorIteratorPair(bool update_if_needed = true); |
418 | |
419 | void ReadObjCLibraryIfNeeded(const ModuleList &module_list); |
420 | |
421 | DISALLOW_COPY_AND_ASSIGN(ObjCLanguageRuntime)ObjCLanguageRuntime(const ObjCLanguageRuntime &) = delete ; const ObjCLanguageRuntime &operator=(const ObjCLanguageRuntime &) = delete; |
422 | }; |
423 | |
424 | } // namespace lldb_private |
425 | |
426 | #endif // liblldb_ObjCLanguageRuntime_h_ |
1 | // shared_ptr and weak_ptr implementation -*- C++ -*- |
2 | |
3 | // Copyright (C) 2007-2017 Free Software Foundation, Inc. |
4 | // |
5 | // This file is part of the GNU ISO C++ Library. This library is free |
6 | // software; you can redistribute it and/or modify it under the |
7 | // terms of the GNU General Public License as published by the |
8 | // Free Software Foundation; either version 3, or (at your option) |
9 | // any later version. |
10 | |
11 | // This library is distributed in the hope that it will be useful, |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | // GNU General Public License for more details. |
15 | |
16 | // Under Section 7 of GPL version 3, you are granted additional |
17 | // permissions described in the GCC Runtime Library Exception, version |
18 | // 3.1, as published by the Free Software Foundation. |
19 | |
20 | // You should have received a copy of the GNU General Public License and |
21 | // a copy of the GCC Runtime Library Exception along with this program; |
22 | // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
23 | // <http://www.gnu.org/licenses/>. |
24 | |
25 | // GCC Note: Based on files from version 1.32.0 of the Boost library. |
26 | |
27 | // shared_count.hpp |
28 | // Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd. |
29 | |
30 | // shared_ptr.hpp |
31 | // Copyright (C) 1998, 1999 Greg Colvin and Beman Dawes. |
32 | // Copyright (C) 2001, 2002, 2003 Peter Dimov |
33 | |
34 | // weak_ptr.hpp |
35 | // Copyright (C) 2001, 2002, 2003 Peter Dimov |
36 | |
37 | // enable_shared_from_this.hpp |
38 | // Copyright (C) 2002 Peter Dimov |
39 | |
40 | // Distributed under the Boost Software License, Version 1.0. (See |
41 | // accompanying file LICENSE_1_0.txt or copy at |
42 | // http://www.boost.org/LICENSE_1_0.txt) |
43 | |
44 | /** @file |
45 | * This is an internal header file, included by other library headers. |
46 | * Do not attempt to use it directly. @headername{memory} |
47 | */ |
48 | |
49 | #ifndef _SHARED_PTR_H1 |
50 | #define _SHARED_PTR_H1 1 |
51 | |
52 | #include <bits/shared_ptr_base.h> |
53 | |
54 | namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default"))) |
55 | { |
56 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
57 | |
58 | /** |
59 | * @addtogroup pointer_abstractions |
60 | * @{ |
61 | */ |
62 | |
63 | /// 20.7.2.2.11 shared_ptr I/O |
64 | template<typename _Ch, typename _Tr, typename _Tp, _Lock_policy _Lp> |
65 | inline std::basic_ostream<_Ch, _Tr>& |
66 | operator<<(std::basic_ostream<_Ch, _Tr>& __os, |
67 | const __shared_ptr<_Tp, _Lp>& __p) |
68 | { |
69 | __os << __p.get(); |
70 | return __os; |
71 | } |
72 | |
73 | /// 20.7.2.2.10 shared_ptr get_deleter |
74 | template<typename _Del, typename _Tp, _Lock_policy _Lp> |
75 | inline _Del* |
76 | get_deleter(const __shared_ptr<_Tp, _Lp>& __p) noexcept |
77 | { |
78 | #if __cpp_rtti199711 |
79 | return static_cast<_Del*>(__p._M_get_deleter(typeid(_Del))); |
80 | #else |
81 | return 0; |
82 | #endif |
83 | } |
84 | |
85 | |
86 | /** |
87 | * @brief A smart pointer with reference-counted copy semantics. |
88 | * |
89 | * The object pointed to is deleted when the last shared_ptr pointing to |
90 | * it is destroyed or reset. |
91 | */ |
92 | template<typename _Tp> |
93 | class shared_ptr : public __shared_ptr<_Tp> |
94 | { |
95 | template<typename... _Args> |
96 | using _Constructible = typename enable_if< |
97 | is_constructible<__shared_ptr<_Tp>, _Args...>::value |
98 | >::type; |
99 | |
100 | template<typename _Arg> |
101 | using _Assignable = typename enable_if< |
102 | is_assignable<__shared_ptr<_Tp>&, _Arg>::value, shared_ptr& |
103 | >::type; |
104 | |
105 | public: |
106 | |
107 | using element_type = typename __shared_ptr<_Tp>::element_type; |
108 | |
109 | #if __cplusplus201103L > 201402L |
110 | # define __cpp_lib_shared_ptr_weak_type 201606 |
111 | using weak_type = weak_ptr<_Tp>; |
112 | #endif |
113 | /** |
114 | * @brief Construct an empty %shared_ptr. |
115 | * @post use_count()==0 && get()==0 |
116 | */ |
117 | constexpr shared_ptr() noexcept : __shared_ptr<_Tp>() { } |
118 | |
119 | shared_ptr(const shared_ptr&) noexcept = default; |
120 | |
121 | /** |
122 | * @brief Construct a %shared_ptr that owns the pointer @a __p. |
123 | * @param __p A pointer that is convertible to element_type*. |
124 | * @post use_count() == 1 && get() == __p |
125 | * @throw std::bad_alloc, in which case @c delete @a __p is called. |
126 | */ |
127 | template<typename _Yp, typename = _Constructible<_Yp*>> |
128 | explicit |
129 | shared_ptr(_Yp* __p) : __shared_ptr<_Tp>(__p) { } |
130 | |
131 | /** |
132 | * @brief Construct a %shared_ptr that owns the pointer @a __p |
133 | * and the deleter @a __d. |
134 | * @param __p A pointer. |
135 | * @param __d A deleter. |
136 | * @post use_count() == 1 && get() == __p |
137 | * @throw std::bad_alloc, in which case @a __d(__p) is called. |
138 | * |
139 | * Requirements: _Deleter's copy constructor and destructor must |
140 | * not throw |
141 | * |
142 | * __shared_ptr will release __p by calling __d(__p) |
143 | */ |
144 | template<typename _Yp, typename _Deleter, |
145 | typename = _Constructible<_Yp*, _Deleter>> |
146 | shared_ptr(_Yp* __p, _Deleter __d) |
147 | : __shared_ptr<_Tp>(__p, std::move(__d)) { } |
148 | |
149 | /** |
150 | * @brief Construct a %shared_ptr that owns a null pointer |
151 | * and the deleter @a __d. |
152 | * @param __p A null pointer constant. |
153 | * @param __d A deleter. |
154 | * @post use_count() == 1 && get() == __p |
155 | * @throw std::bad_alloc, in which case @a __d(__p) is called. |
156 | * |
157 | * Requirements: _Deleter's copy constructor and destructor must |
158 | * not throw |
159 | * |
160 | * The last owner will call __d(__p) |
161 | */ |
162 | template<typename _Deleter> |
163 | shared_ptr(nullptr_t __p, _Deleter __d) |
164 | : __shared_ptr<_Tp>(__p, std::move(__d)) { } |
165 | |
166 | /** |
167 | * @brief Construct a %shared_ptr that owns the pointer @a __p |
168 | * and the deleter @a __d. |
169 | * @param __p A pointer. |
170 | * @param __d A deleter. |
171 | * @param __a An allocator. |
172 | * @post use_count() == 1 && get() == __p |
173 | * @throw std::bad_alloc, in which case @a __d(__p) is called. |
174 | * |
175 | * Requirements: _Deleter's copy constructor and destructor must |
176 | * not throw _Alloc's copy constructor and destructor must not |
177 | * throw. |
178 | * |
179 | * __shared_ptr will release __p by calling __d(__p) |
180 | */ |
181 | template<typename _Yp, typename _Deleter, typename _Alloc, |
182 | typename = _Constructible<_Yp*, _Deleter, _Alloc>> |
183 | shared_ptr(_Yp* __p, _Deleter __d, _Alloc __a) |
184 | : __shared_ptr<_Tp>(__p, std::move(__d), std::move(__a)) { } |
185 | |
186 | /** |
187 | * @brief Construct a %shared_ptr that owns a null pointer |
188 | * and the deleter @a __d. |
189 | * @param __p A null pointer constant. |
190 | * @param __d A deleter. |
191 | * @param __a An allocator. |
192 | * @post use_count() == 1 && get() == __p |
193 | * @throw std::bad_alloc, in which case @a __d(__p) is called. |
194 | * |
195 | * Requirements: _Deleter's copy constructor and destructor must |
196 | * not throw _Alloc's copy constructor and destructor must not |
197 | * throw. |
198 | * |
199 | * The last owner will call __d(__p) |
200 | */ |
201 | template<typename _Deleter, typename _Alloc> |
202 | shared_ptr(nullptr_t __p, _Deleter __d, _Alloc __a) |
203 | : __shared_ptr<_Tp>(__p, std::move(__d), std::move(__a)) { } |
204 | |
205 | // Aliasing constructor |
206 | |
207 | /** |
208 | * @brief Constructs a %shared_ptr instance that stores @a __p |
209 | * and shares ownership with @a __r. |
210 | * @param __r A %shared_ptr. |
211 | * @param __p A pointer that will remain valid while @a *__r is valid. |
212 | * @post get() == __p && use_count() == __r.use_count() |
213 | * |
214 | * This can be used to construct a @c shared_ptr to a sub-object |
215 | * of an object managed by an existing @c shared_ptr. |
216 | * |
217 | * @code |
218 | * shared_ptr< pair<int,int> > pii(new pair<int,int>()); |
219 | * shared_ptr<int> pi(pii, &pii->first); |
220 | * assert(pii.use_count() == 2); |
221 | * @endcode |
222 | */ |
223 | template<typename _Yp> |
224 | shared_ptr(const shared_ptr<_Yp>& __r, element_type* __p) noexcept |
225 | : __shared_ptr<_Tp>(__r, __p) { } |
226 | |
227 | /** |
228 | * @brief If @a __r is empty, constructs an empty %shared_ptr; |
229 | * otherwise construct a %shared_ptr that shares ownership |
230 | * with @a __r. |
231 | * @param __r A %shared_ptr. |
232 | * @post get() == __r.get() && use_count() == __r.use_count() |
233 | */ |
234 | template<typename _Yp, |
235 | typename = _Constructible<const shared_ptr<_Yp>&>> |
236 | shared_ptr(const shared_ptr<_Yp>& __r) noexcept |
237 | : __shared_ptr<_Tp>(__r) { } |
238 | |
239 | /** |
240 | * @brief Move-constructs a %shared_ptr instance from @a __r. |
241 | * @param __r A %shared_ptr rvalue. |
242 | * @post *this contains the old value of @a __r, @a __r is empty. |
243 | */ |
244 | shared_ptr(shared_ptr&& __r) noexcept |
245 | : __shared_ptr<_Tp>(std::move(__r)) { } |
246 | |
247 | /** |
248 | * @brief Move-constructs a %shared_ptr instance from @a __r. |
249 | * @param __r A %shared_ptr rvalue. |
250 | * @post *this contains the old value of @a __r, @a __r is empty. |
251 | */ |
252 | template<typename _Yp, typename = _Constructible<shared_ptr<_Yp>>> |
253 | shared_ptr(shared_ptr<_Yp>&& __r) noexcept |
254 | : __shared_ptr<_Tp>(std::move(__r)) { } |
255 | |
256 | /** |
257 | * @brief Constructs a %shared_ptr that shares ownership with @a __r |
258 | * and stores a copy of the pointer stored in @a __r. |
259 | * @param __r A weak_ptr. |
260 | * @post use_count() == __r.use_count() |
261 | * @throw bad_weak_ptr when __r.expired(), |
262 | * in which case the constructor has no effect. |
263 | */ |
264 | template<typename _Yp, typename = _Constructible<const weak_ptr<_Yp>&>> |
265 | explicit shared_ptr(const weak_ptr<_Yp>& __r) |
266 | : __shared_ptr<_Tp>(__r) { } |
267 | |
268 | #if _GLIBCXX_USE_DEPRECATED1 |
269 | template<typename _Yp, typename = _Constructible<auto_ptr<_Yp>>> |
270 | shared_ptr(auto_ptr<_Yp>&& __r); |
271 | #endif |
272 | |
273 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
274 | // 2399. shared_ptr's constructor from unique_ptr should be constrained |
275 | template<typename _Yp, typename _Del, |
276 | typename = _Constructible<unique_ptr<_Yp, _Del>>> |
277 | shared_ptr(unique_ptr<_Yp, _Del>&& __r) |
278 | : __shared_ptr<_Tp>(std::move(__r)) { } |
279 | |
280 | #if __cplusplus201103L <= 201402L && _GLIBCXX_USE_DEPRECATED1 |
281 | // This non-standard constructor exists to support conversions that |
282 | // were possible in C++11 and C++14 but are ill-formed in C++17. |
283 | // If an exception is thrown this constructor has no effect. |
284 | template<typename _Yp, typename _Del, |
285 | _Constructible<unique_ptr<_Yp, _Del>, __sp_array_delete>* = 0> |
286 | shared_ptr(unique_ptr<_Yp, _Del>&& __r) |
287 | : __shared_ptr<_Tp>(std::move(__r), __sp_array_delete()) { } |
288 | #endif |
289 | |
290 | /** |
291 | * @brief Construct an empty %shared_ptr. |
292 | * @post use_count() == 0 && get() == nullptr |
293 | */ |
294 | constexpr shared_ptr(nullptr_t) noexcept : shared_ptr() { } |
295 | |
296 | shared_ptr& operator=(const shared_ptr&) noexcept = default; |
297 | |
298 | template<typename _Yp> |
299 | _Assignable<const shared_ptr<_Yp>&> |
300 | operator=(const shared_ptr<_Yp>& __r) noexcept |
301 | { |
302 | this->__shared_ptr<_Tp>::operator=(__r); |
303 | return *this; |
304 | } |
305 | |
306 | #if _GLIBCXX_USE_DEPRECATED1 |
307 | template<typename _Yp> |
308 | _Assignable<auto_ptr<_Yp>> |
309 | operator=(auto_ptr<_Yp>&& __r) |
310 | { |
311 | this->__shared_ptr<_Tp>::operator=(std::move(__r)); |
312 | return *this; |
313 | } |
314 | #endif |
315 | |
316 | shared_ptr& |
317 | operator=(shared_ptr&& __r) noexcept |
318 | { |
319 | this->__shared_ptr<_Tp>::operator=(std::move(__r)); |
320 | return *this; |
321 | } |
322 | |
323 | template<class _Yp> |
324 | _Assignable<shared_ptr<_Yp>> |
325 | operator=(shared_ptr<_Yp>&& __r) noexcept |
326 | { |
327 | this->__shared_ptr<_Tp>::operator=(std::move(__r)); |
328 | return *this; |
329 | } |
330 | |
331 | template<typename _Yp, typename _Del> |
332 | _Assignable<unique_ptr<_Yp, _Del>> |
333 | operator=(unique_ptr<_Yp, _Del>&& __r) |
334 | { |
335 | this->__shared_ptr<_Tp>::operator=(std::move(__r)); |
336 | return *this; |
337 | } |
338 | |
339 | private: |
340 | // This constructor is non-standard, it is used by allocate_shared. |
341 | template<typename _Alloc, typename... _Args> |
342 | shared_ptr(_Sp_make_shared_tag __tag, const _Alloc& __a, |
343 | _Args&&... __args) |
344 | : __shared_ptr<_Tp>(__tag, __a, std::forward<_Args>(__args)...) |
345 | { } |
346 | |
347 | template<typename _Yp, typename _Alloc, typename... _Args> |
348 | friend shared_ptr<_Yp> |
349 | allocate_shared(const _Alloc& __a, _Args&&... __args); |
350 | |
351 | // This constructor is non-standard, it is used by weak_ptr::lock(). |
352 | shared_ptr(const weak_ptr<_Tp>& __r, std::nothrow_t) |
353 | : __shared_ptr<_Tp>(__r, std::nothrow) { } |
354 | |
355 | friend class weak_ptr<_Tp>; |
356 | }; |
357 | |
358 | #if __cpp_deduction_guides >= 201606 |
359 | template<typename _Tp> |
360 | shared_ptr(weak_ptr<_Tp>) -> shared_ptr<_Tp>; |
361 | template<typename _Tp, typename _Del> |
362 | shared_ptr(unique_ptr<_Tp, _Del>) -> shared_ptr<_Tp>; |
363 | #endif |
364 | |
365 | // 20.7.2.2.7 shared_ptr comparisons |
366 | template<typename _Tp, typename _Up> |
367 | inline bool |
368 | operator==(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept |
369 | { return __a.get() == __b.get(); } |
370 | |
371 | template<typename _Tp> |
372 | inline bool |
373 | operator==(const shared_ptr<_Tp>& __a, nullptr_t) noexcept |
374 | { return !__a; } |
375 | |
376 | template<typename _Tp> |
377 | inline bool |
378 | operator==(nullptr_t, const shared_ptr<_Tp>& __a) noexcept |
379 | { return !__a; } |
380 | |
381 | template<typename _Tp, typename _Up> |
382 | inline bool |
383 | operator!=(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept |
384 | { return __a.get() != __b.get(); } |
385 | |
386 | template<typename _Tp> |
387 | inline bool |
388 | operator!=(const shared_ptr<_Tp>& __a, nullptr_t) noexcept |
389 | { return (bool)__a; } |
390 | |
391 | template<typename _Tp> |
392 | inline bool |
393 | operator!=(nullptr_t, const shared_ptr<_Tp>& __a) noexcept |
394 | { return (bool)__a; } |
395 | |
396 | template<typename _Tp, typename _Up> |
397 | inline bool |
398 | operator<(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept |
399 | { |
400 | using _Tp_elt = typename shared_ptr<_Tp>::element_type; |
401 | using _Up_elt = typename shared_ptr<_Up>::element_type; |
402 | using _Vp = typename common_type<_Tp_elt*, _Up_elt*>::type; |
403 | return less<_Vp>()(__a.get(), __b.get()); |
404 | } |
405 | |
406 | template<typename _Tp> |
407 | inline bool |
408 | operator<(const shared_ptr<_Tp>& __a, nullptr_t) noexcept |
409 | { |
410 | using _Tp_elt = typename shared_ptr<_Tp>::element_type; |
411 | return less<_Tp_elt*>()(__a.get(), nullptr); |
412 | } |
413 | |
414 | template<typename _Tp> |
415 | inline bool |
416 | operator<(nullptr_t, const shared_ptr<_Tp>& __a) noexcept |
417 | { |
418 | using _Tp_elt = typename shared_ptr<_Tp>::element_type; |
419 | return less<_Tp_elt*>()(nullptr, __a.get()); |
420 | } |
421 | |
422 | template<typename _Tp, typename _Up> |
423 | inline bool |
424 | operator<=(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept |
425 | { return !(__b < __a); } |
426 | |
427 | template<typename _Tp> |
428 | inline bool |
429 | operator<=(const shared_ptr<_Tp>& __a, nullptr_t) noexcept |
430 | { return !(nullptr < __a); } |
431 | |
432 | template<typename _Tp> |
433 | inline bool |
434 | operator<=(nullptr_t, const shared_ptr<_Tp>& __a) noexcept |
435 | { return !(__a < nullptr); } |
436 | |
437 | template<typename _Tp, typename _Up> |
438 | inline bool |
439 | operator>(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept |
440 | { return (__b < __a); } |
441 | |
442 | template<typename _Tp> |
443 | inline bool |
444 | operator>(const shared_ptr<_Tp>& __a, nullptr_t) noexcept |
445 | { return nullptr < __a; } |
446 | |
447 | template<typename _Tp> |
448 | inline bool |
449 | operator>(nullptr_t, const shared_ptr<_Tp>& __a) noexcept |
450 | { return __a < nullptr; } |
451 | |
452 | template<typename _Tp, typename _Up> |
453 | inline bool |
454 | operator>=(const shared_ptr<_Tp>& __a, const shared_ptr<_Up>& __b) noexcept |
455 | { return !(__a < __b); } |
456 | |
457 | template<typename _Tp> |
458 | inline bool |
459 | operator>=(const shared_ptr<_Tp>& __a, nullptr_t) noexcept |
460 | { return !(__a < nullptr); } |
461 | |
462 | template<typename _Tp> |
463 | inline bool |
464 | operator>=(nullptr_t, const shared_ptr<_Tp>& __a) noexcept |
465 | { return !(nullptr < __a); } |
466 | |
467 | template<typename _Tp> |
468 | struct less<shared_ptr<_Tp>> : public _Sp_less<shared_ptr<_Tp>> |
469 | { }; |
470 | |
471 | // 20.7.2.2.8 shared_ptr specialized algorithms. |
472 | template<typename _Tp> |
473 | inline void |
474 | swap(shared_ptr<_Tp>& __a, shared_ptr<_Tp>& __b) noexcept |
475 | { __a.swap(__b); } |
476 | |
477 | // 20.7.2.2.9 shared_ptr casts. |
478 | template<typename _Tp, typename _Up> |
479 | inline shared_ptr<_Tp> |
480 | static_pointer_cast(const shared_ptr<_Up>& __r) noexcept |
481 | { |
482 | using _Sp = shared_ptr<_Tp>; |
483 | return _Sp(__r, static_cast<typename _Sp::element_type*>(__r.get())); |
484 | } |
485 | |
486 | template<typename _Tp, typename _Up> |
487 | inline shared_ptr<_Tp> |
488 | const_pointer_cast(const shared_ptr<_Up>& __r) noexcept |
489 | { |
490 | using _Sp = shared_ptr<_Tp>; |
491 | return _Sp(__r, const_cast<typename _Sp::element_type*>(__r.get())); |
492 | } |
493 | |
494 | template<typename _Tp, typename _Up> |
495 | inline shared_ptr<_Tp> |
496 | dynamic_pointer_cast(const shared_ptr<_Up>& __r) noexcept |
497 | { |
498 | using _Sp = shared_ptr<_Tp>; |
499 | if (auto* __p = dynamic_cast<typename _Sp::element_type*>(__r.get())) |
500 | return _Sp(__r, __p); |
501 | return _Sp(); |
502 | } |
503 | |
504 | #if __cplusplus201103L > 201402L |
505 | template<typename _Tp, typename _Up> |
506 | inline shared_ptr<_Tp> |
507 | reinterpret_pointer_cast(const shared_ptr<_Up>& __r) noexcept |
508 | { |
509 | using _Sp = shared_ptr<_Tp>; |
510 | return _Sp(__r, reinterpret_cast<typename _Sp::element_type*>(__r.get())); |
511 | } |
512 | #endif |
513 | |
514 | /** |
515 | * @brief A smart pointer with weak semantics. |
516 | * |
517 | * With forwarding constructors and assignment operators. |
518 | */ |
519 | template<typename _Tp> |
520 | class weak_ptr : public __weak_ptr<_Tp> |
521 | { |
522 | template<typename _Arg> |
523 | using _Constructible = typename enable_if< |
524 | is_constructible<__weak_ptr<_Tp>, _Arg>::value |
525 | >::type; |
526 | |
527 | template<typename _Arg> |
528 | using _Assignable = typename enable_if< |
529 | is_assignable<__weak_ptr<_Tp>&, _Arg>::value, weak_ptr& |
530 | >::type; |
531 | |
532 | public: |
533 | constexpr weak_ptr() noexcept = default; |
534 | |
535 | template<typename _Yp, |
536 | typename = _Constructible<const shared_ptr<_Yp>&>> |
537 | weak_ptr(const shared_ptr<_Yp>& __r) noexcept |
538 | : __weak_ptr<_Tp>(__r) { } |
539 | |
540 | weak_ptr(const weak_ptr&) noexcept = default; |
541 | |
542 | template<typename _Yp, typename = _Constructible<const weak_ptr<_Yp>&>> |
543 | weak_ptr(const weak_ptr<_Yp>& __r) noexcept |
544 | : __weak_ptr<_Tp>(__r) { } |
545 | |
546 | weak_ptr(weak_ptr&&) noexcept = default; |
547 | |
548 | template<typename _Yp, typename = _Constructible<weak_ptr<_Yp>>> |
549 | weak_ptr(weak_ptr<_Yp>&& __r) noexcept |
550 | : __weak_ptr<_Tp>(std::move(__r)) { } |
551 | |
552 | weak_ptr& |
553 | operator=(const weak_ptr& __r) noexcept = default; |
554 | |
555 | template<typename _Yp> |
556 | _Assignable<const weak_ptr<_Yp>&> |
557 | operator=(const weak_ptr<_Yp>& __r) noexcept |
558 | { |
559 | this->__weak_ptr<_Tp>::operator=(__r); |
560 | return *this; |
561 | } |
562 | |
563 | template<typename _Yp> |
564 | _Assignable<const shared_ptr<_Yp>&> |
565 | operator=(const shared_ptr<_Yp>& __r) noexcept |
566 | { |
567 | this->__weak_ptr<_Tp>::operator=(__r); |
568 | return *this; |
569 | } |
570 | |
571 | weak_ptr& |
572 | operator=(weak_ptr&& __r) noexcept = default; |
573 | |
574 | template<typename _Yp> |
575 | _Assignable<weak_ptr<_Yp>> |
576 | operator=(weak_ptr<_Yp>&& __r) noexcept |
577 | { |
578 | this->__weak_ptr<_Tp>::operator=(std::move(__r)); |
579 | return *this; |
580 | } |
581 | |
582 | shared_ptr<_Tp> |
583 | lock() const noexcept |
584 | { return shared_ptr<_Tp>(*this, std::nothrow); } |
585 | }; |
586 | |
587 | #if __cpp_deduction_guides >= 201606 |
588 | template<typename _Tp> |
589 | weak_ptr(shared_ptr<_Tp>) -> weak_ptr<_Tp>; |
590 | #endif |
591 | |
592 | // 20.7.2.3.6 weak_ptr specialized algorithms. |
593 | template<typename _Tp> |
594 | inline void |
595 | swap(weak_ptr<_Tp>& __a, weak_ptr<_Tp>& __b) noexcept |
596 | { __a.swap(__b); } |
597 | |
598 | |
599 | /// Primary template owner_less |
600 | template<typename _Tp = void> |
601 | struct owner_less; |
602 | |
603 | /// Void specialization of owner_less |
604 | template<> |
605 | struct owner_less<void> : _Sp_owner_less<void, void> |
606 | { }; |
607 | |
608 | /// Partial specialization of owner_less for shared_ptr. |
609 | template<typename _Tp> |
610 | struct owner_less<shared_ptr<_Tp>> |
611 | : public _Sp_owner_less<shared_ptr<_Tp>, weak_ptr<_Tp>> |
612 | { }; |
613 | |
614 | /// Partial specialization of owner_less for weak_ptr. |
615 | template<typename _Tp> |
616 | struct owner_less<weak_ptr<_Tp>> |
617 | : public _Sp_owner_less<weak_ptr<_Tp>, shared_ptr<_Tp>> |
618 | { }; |
619 | |
620 | /** |
621 | * @brief Base class allowing use of member function shared_from_this. |
622 | */ |
623 | template<typename _Tp> |
624 | class enable_shared_from_this |
625 | { |
626 | protected: |
627 | constexpr enable_shared_from_this() noexcept { } |
628 | |
629 | enable_shared_from_this(const enable_shared_from_this&) noexcept { } |
630 | |
631 | enable_shared_from_this& |
632 | operator=(const enable_shared_from_this&) noexcept |
633 | { return *this; } |
634 | |
635 | ~enable_shared_from_this() { } |
636 | |
637 | public: |
638 | shared_ptr<_Tp> |
639 | shared_from_this() |
640 | { return shared_ptr<_Tp>(this->_M_weak_this); } |
641 | |
642 | shared_ptr<const _Tp> |
643 | shared_from_this() const |
644 | { return shared_ptr<const _Tp>(this->_M_weak_this); } |
645 | |
646 | #if __cplusplus201103L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11 |
647 | #define __cpp_lib_enable_shared_from_this 201603 |
648 | weak_ptr<_Tp> |
649 | weak_from_this() noexcept |
650 | { return this->_M_weak_this; } |
651 | |
652 | weak_ptr<const _Tp> |
653 | weak_from_this() const noexcept |
654 | { return this->_M_weak_this; } |
655 | #endif |
656 | |
657 | private: |
658 | template<typename _Tp1> |
659 | void |
660 | _M_weak_assign(_Tp1* __p, const __shared_count<>& __n) const noexcept |
661 | { _M_weak_this._M_assign(__p, __n); } |
662 | |
663 | // Found by ADL when this is an associated class. |
664 | friend const enable_shared_from_this* |
665 | __enable_shared_from_this_base(const __shared_count<>&, |
666 | const enable_shared_from_this* __p) |
667 | { return __p; } |
668 | |
669 | template<typename, _Lock_policy> |
670 | friend class __shared_ptr; |
671 | |
672 | mutable weak_ptr<_Tp> _M_weak_this; |
673 | }; |
674 | |
675 | /** |
676 | * @brief Create an object that is owned by a shared_ptr. |
677 | * @param __a An allocator. |
678 | * @param __args Arguments for the @a _Tp object's constructor. |
679 | * @return A shared_ptr that owns the newly created object. |
680 | * @throw An exception thrown from @a _Alloc::allocate or from the |
681 | * constructor of @a _Tp. |
682 | * |
683 | * A copy of @a __a will be used to allocate memory for the shared_ptr |
684 | * and the new object. |
685 | */ |
686 | template<typename _Tp, typename _Alloc, typename... _Args> |
687 | inline shared_ptr<_Tp> |
688 | allocate_shared(const _Alloc& __a, _Args&&... __args) |
689 | { |
690 | return shared_ptr<_Tp>(_Sp_make_shared_tag(), __a, |
691 | std::forward<_Args>(__args)...); |
692 | } |
693 | |
694 | /** |
695 | * @brief Create an object that is owned by a shared_ptr. |
696 | * @param __args Arguments for the @a _Tp object's constructor. |
697 | * @return A shared_ptr that owns the newly created object. |
698 | * @throw std::bad_alloc, or an exception thrown from the |
699 | * constructor of @a _Tp. |
700 | */ |
701 | template<typename _Tp, typename... _Args> |
702 | inline shared_ptr<_Tp> |
703 | make_shared(_Args&&... __args) |
704 | { |
705 | typedef typename std::remove_const<_Tp>::type _Tp_nc; |
706 | return std::allocate_shared<_Tp>(std::allocator<_Tp_nc>(), |
707 | std::forward<_Args>(__args)...); |
708 | } |
709 | |
710 | /// std::hash specialization for shared_ptr. |
711 | template<typename _Tp> |
712 | struct hash<shared_ptr<_Tp>> |
713 | : public __hash_base<size_t, shared_ptr<_Tp>> |
714 | { |
715 | size_t |
716 | operator()(const shared_ptr<_Tp>& __s) const noexcept |
717 | { |
718 | return std::hash<typename shared_ptr<_Tp>::element_type*>()(__s.get()); |
719 | } |
720 | }; |
721 | |
722 | // @} group pointer_abstractions |
723 | |
724 | _GLIBCXX_END_NAMESPACE_VERSION |
725 | } // namespace |
726 | |
727 | #endif // _SHARED_PTR_H |
1 | // shared_ptr and weak_ptr implementation details -*- C++ -*- |
2 | |
3 | // Copyright (C) 2007-2017 Free Software Foundation, Inc. |
4 | // |
5 | // This file is part of the GNU ISO C++ Library. This library is free |
6 | // software; you can redistribute it and/or modify it under the |
7 | // terms of the GNU General Public License as published by the |
8 | // Free Software Foundation; either version 3, or (at your option) |
9 | // any later version. |
10 | |
11 | // This library is distributed in the hope that it will be useful, |
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of |
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | // GNU General Public License for more details. |
15 | |
16 | // Under Section 7 of GPL version 3, you are granted additional |
17 | // permissions described in the GCC Runtime Library Exception, version |
18 | // 3.1, as published by the Free Software Foundation. |
19 | |
20 | // You should have received a copy of the GNU General Public License and |
21 | // a copy of the GCC Runtime Library Exception along with this program; |
22 | // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see |
23 | // <http://www.gnu.org/licenses/>. |
24 | |
25 | // GCC Note: Based on files from version 1.32.0 of the Boost library. |
26 | |
27 | // shared_count.hpp |
28 | // Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd. |
29 | |
30 | // shared_ptr.hpp |
31 | // Copyright (C) 1998, 1999 Greg Colvin and Beman Dawes. |
32 | // Copyright (C) 2001, 2002, 2003 Peter Dimov |
33 | |
34 | // weak_ptr.hpp |
35 | // Copyright (C) 2001, 2002, 2003 Peter Dimov |
36 | |
37 | // enable_shared_from_this.hpp |
38 | // Copyright (C) 2002 Peter Dimov |
39 | |
40 | // Distributed under the Boost Software License, Version 1.0. (See |
41 | // accompanying file LICENSE_1_0.txt or copy at |
42 | // http://www.boost.org/LICENSE_1_0.txt) |
43 | |
44 | /** @file bits/shared_ptr_base.h |
45 | * This is an internal header file, included by other library headers. |
46 | * Do not attempt to use it directly. @headername{memory} |
47 | */ |
48 | |
49 | #ifndef _SHARED_PTR_BASE_H1 |
50 | #define _SHARED_PTR_BASE_H1 1 |
51 | |
52 | #if __cpp_rtti199711 |
53 | # include <typeinfo> |
54 | #endif |
55 | #include <bits/allocated_ptr.h> |
56 | #include <bits/refwrap.h> |
57 | #include <bits/stl_function.h> |
58 | #include <ext/aligned_buffer.h> |
59 | |
60 | namespace std _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default"))) |
61 | { |
62 | _GLIBCXX_BEGIN_NAMESPACE_VERSION |
63 | |
64 | #if _GLIBCXX_USE_DEPRECATED1 |
65 | template<typename> class auto_ptr; |
66 | #endif |
67 | |
68 | /** |
69 | * @brief Exception possibly thrown by @c shared_ptr. |
70 | * @ingroup exceptions |
71 | */ |
72 | class bad_weak_ptr : public std::exception |
73 | { |
74 | public: |
75 | virtual char const* what() const noexcept; |
76 | |
77 | virtual ~bad_weak_ptr() noexcept; |
78 | }; |
79 | |
80 | // Substitute for bad_weak_ptr object in the case of -fno-exceptions. |
81 | inline void |
82 | __throw_bad_weak_ptr() |
83 | { _GLIBCXX_THROW_OR_ABORT(bad_weak_ptr())(__builtin_abort()); } |
84 | |
85 | using __gnu_cxx::_Lock_policy; |
86 | using __gnu_cxx::__default_lock_policy; |
87 | using __gnu_cxx::_S_single; |
88 | using __gnu_cxx::_S_mutex; |
89 | using __gnu_cxx::_S_atomic; |
90 | |
91 | // Empty helper class except when the template argument is _S_mutex. |
92 | template<_Lock_policy _Lp> |
93 | class _Mutex_base |
94 | { |
95 | protected: |
96 | // The atomic policy uses fully-fenced builtins, single doesn't care. |
97 | enum { _S_need_barriers = 0 }; |
98 | }; |
99 | |
100 | template<> |
101 | class _Mutex_base<_S_mutex> |
102 | : public __gnu_cxx::__mutex |
103 | { |
104 | protected: |
105 | // This policy is used when atomic builtins are not available. |
106 | // The replacement atomic operations might not have the necessary |
107 | // memory barriers. |
108 | enum { _S_need_barriers = 1 }; |
109 | }; |
110 | |
111 | template<_Lock_policy _Lp = __default_lock_policy> |
112 | class _Sp_counted_base |
113 | : public _Mutex_base<_Lp> |
114 | { |
115 | public: |
116 | _Sp_counted_base() noexcept |
117 | : _M_use_count(1), _M_weak_count(1) { } |
118 | |
119 | virtual |
120 | ~_Sp_counted_base() noexcept |
121 | { } |
122 | |
123 | // Called when _M_use_count drops to zero, to release the resources |
124 | // managed by *this. |
125 | virtual void |
126 | _M_dispose() noexcept = 0; |
127 | |
128 | // Called when _M_weak_count drops to zero. |
129 | virtual void |
130 | _M_destroy() noexcept |
131 | { delete this; } |
132 | |
133 | virtual void* |
134 | _M_get_deleter(const std::type_info&) noexcept = 0; |
135 | |
136 | void |
137 | _M_add_ref_copy() |
138 | { __gnu_cxx::__atomic_add_dispatch(&_M_use_count, 1); } |
139 | |
140 | void |
141 | _M_add_ref_lock(); |
142 | |
143 | bool |
144 | _M_add_ref_lock_nothrow(); |
145 | |
146 | void |
147 | _M_release() noexcept |
148 | { |
149 | // Be race-detector-friendly. For more info see bits/c++config. |
150 | _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&_M_use_count); |
151 | if (__gnu_cxx::__exchange_and_add_dispatch(&_M_use_count, -1) == 1) |
152 | { |
153 | _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&_M_use_count); |
154 | _M_dispose(); |
155 | // There must be a memory barrier between dispose() and destroy() |
156 | // to ensure that the effects of dispose() are observed in the |
157 | // thread that runs destroy(). |
158 | // See http://gcc.gnu.org/ml/libstdc++/2005-11/msg00136.html |
159 | if (_Mutex_base<_Lp>::_S_need_barriers) |
160 | { |
161 | __atomic_thread_fence (__ATOMIC_ACQ_REL4); |
162 | } |
163 | |
164 | // Be race-detector-friendly. For more info see bits/c++config. |
165 | _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&_M_weak_count); |
166 | if (__gnu_cxx::__exchange_and_add_dispatch(&_M_weak_count, |
167 | -1) == 1) |
168 | { |
169 | _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&_M_weak_count); |
170 | _M_destroy(); |
171 | } |
172 | } |
173 | } |
174 | |
175 | void |
176 | _M_weak_add_ref() noexcept |
177 | { __gnu_cxx::__atomic_add_dispatch(&_M_weak_count, 1); } |
178 | |
179 | void |
180 | _M_weak_release() noexcept |
181 | { |
182 | // Be race-detector-friendly. For more info see bits/c++config. |
183 | _GLIBCXX_SYNCHRONIZATION_HAPPENS_BEFORE(&_M_weak_count); |
184 | if (__gnu_cxx::__exchange_and_add_dispatch(&_M_weak_count, -1) == 1) |
185 | { |
186 | _GLIBCXX_SYNCHRONIZATION_HAPPENS_AFTER(&_M_weak_count); |
187 | if (_Mutex_base<_Lp>::_S_need_barriers) |
188 | { |
189 | // See _M_release(), |
190 | // destroy() must observe results of dispose() |
191 | __atomic_thread_fence (__ATOMIC_ACQ_REL4); |
192 | } |
193 | _M_destroy(); |
194 | } |
195 | } |
196 | |
197 | long |
198 | _M_get_use_count() const noexcept |
199 | { |
200 | // No memory barrier is used here so there is no synchronization |
201 | // with other threads. |
202 | return __atomic_load_n(&_M_use_count, __ATOMIC_RELAXED0); |
203 | } |
204 | |
205 | private: |
206 | _Sp_counted_base(_Sp_counted_base const&) = delete; |
207 | _Sp_counted_base& operator=(_Sp_counted_base const&) = delete; |
208 | |
209 | _Atomic_word _M_use_count; // #shared |
210 | _Atomic_word _M_weak_count; // #weak + (#shared != 0) |
211 | }; |
212 | |
213 | template<> |
214 | inline void |
215 | _Sp_counted_base<_S_single>:: |
216 | _M_add_ref_lock() |
217 | { |
218 | if (_M_use_count == 0) |
219 | __throw_bad_weak_ptr(); |
220 | ++_M_use_count; |
221 | } |
222 | |
223 | template<> |
224 | inline void |
225 | _Sp_counted_base<_S_mutex>:: |
226 | _M_add_ref_lock() |
227 | { |
228 | __gnu_cxx::__scoped_lock sentry(*this); |
229 | if (__gnu_cxx::__exchange_and_add_dispatch(&_M_use_count, 1) == 0) |
230 | { |
231 | _M_use_count = 0; |
232 | __throw_bad_weak_ptr(); |
233 | } |
234 | } |
235 | |
236 | template<> |
237 | inline void |
238 | _Sp_counted_base<_S_atomic>:: |
239 | _M_add_ref_lock() |
240 | { |
241 | // Perform lock-free add-if-not-zero operation. |
242 | _Atomic_word __count = _M_get_use_count(); |
243 | do |
244 | { |
245 | if (__count == 0) |
246 | __throw_bad_weak_ptr(); |
247 | // Replace the current counter value with the old value + 1, as |
248 | // long as it's not changed meanwhile. |
249 | } |
250 | while (!__atomic_compare_exchange_n(&_M_use_count, &__count, __count + 1, |
251 | true, __ATOMIC_ACQ_REL4, |
252 | __ATOMIC_RELAXED0)); |
253 | } |
254 | |
255 | template<> |
256 | inline bool |
257 | _Sp_counted_base<_S_single>:: |
258 | _M_add_ref_lock_nothrow() |
259 | { |
260 | if (_M_use_count == 0) |
261 | return false; |
262 | ++_M_use_count; |
263 | return true; |
264 | } |
265 | |
266 | template<> |
267 | inline bool |
268 | _Sp_counted_base<_S_mutex>:: |
269 | _M_add_ref_lock_nothrow() |
270 | { |
271 | __gnu_cxx::__scoped_lock sentry(*this); |
272 | if (__gnu_cxx::__exchange_and_add_dispatch(&_M_use_count, 1) == 0) |
273 | { |
274 | _M_use_count = 0; |
275 | return false; |
276 | } |
277 | return true; |
278 | } |
279 | |
280 | template<> |
281 | inline bool |
282 | _Sp_counted_base<_S_atomic>:: |
283 | _M_add_ref_lock_nothrow() |
284 | { |
285 | // Perform lock-free add-if-not-zero operation. |
286 | _Atomic_word __count = _M_get_use_count(); |
287 | do |
288 | { |
289 | if (__count == 0) |
290 | return false; |
291 | // Replace the current counter value with the old value + 1, as |
292 | // long as it's not changed meanwhile. |
293 | } |
294 | while (!__atomic_compare_exchange_n(&_M_use_count, &__count, __count + 1, |
295 | true, __ATOMIC_ACQ_REL4, |
296 | __ATOMIC_RELAXED0)); |
297 | return true; |
298 | } |
299 | |
300 | template<> |
301 | inline void |
302 | _Sp_counted_base<_S_single>::_M_add_ref_copy() |
303 | { ++_M_use_count; } |
304 | |
305 | template<> |
306 | inline void |
307 | _Sp_counted_base<_S_single>::_M_release() noexcept |
308 | { |
309 | if (--_M_use_count == 0) |
310 | { |
311 | _M_dispose(); |
312 | if (--_M_weak_count == 0) |
313 | _M_destroy(); |
314 | } |
315 | } |
316 | |
317 | template<> |
318 | inline void |
319 | _Sp_counted_base<_S_single>::_M_weak_add_ref() noexcept |
320 | { ++_M_weak_count; } |
321 | |
322 | template<> |
323 | inline void |
324 | _Sp_counted_base<_S_single>::_M_weak_release() noexcept |
325 | { |
326 | if (--_M_weak_count == 0) |
327 | _M_destroy(); |
328 | } |
329 | |
330 | template<> |
331 | inline long |
332 | _Sp_counted_base<_S_single>::_M_get_use_count() const noexcept |
333 | { return _M_use_count; } |
334 | |
335 | |
336 | // Forward declarations. |
337 | template<typename _Tp, _Lock_policy _Lp = __default_lock_policy> |
338 | class __shared_ptr; |
339 | |
340 | template<typename _Tp, _Lock_policy _Lp = __default_lock_policy> |
341 | class __weak_ptr; |
342 | |
343 | template<typename _Tp, _Lock_policy _Lp = __default_lock_policy> |
344 | class __enable_shared_from_this; |
345 | |
346 | template<typename _Tp> |
347 | class shared_ptr; |
348 | |
349 | template<typename _Tp> |
350 | class weak_ptr; |
351 | |
352 | template<typename _Tp> |
353 | struct owner_less; |
354 | |
355 | template<typename _Tp> |
356 | class enable_shared_from_this; |
357 | |
358 | template<_Lock_policy _Lp = __default_lock_policy> |
359 | class __weak_count; |
360 | |
361 | template<_Lock_policy _Lp = __default_lock_policy> |
362 | class __shared_count; |
363 | |
364 | |
365 | // Counted ptr with no deleter or allocator support |
366 | template<typename _Ptr, _Lock_policy _Lp> |
367 | class _Sp_counted_ptr final : public _Sp_counted_base<_Lp> |
368 | { |
369 | public: |
370 | explicit |
371 | _Sp_counted_ptr(_Ptr __p) noexcept |
372 | : _M_ptr(__p) { } |
373 | |
374 | virtual void |
375 | _M_dispose() noexcept |
376 | { delete _M_ptr; } |
377 | |
378 | virtual void |
379 | _M_destroy() noexcept |
380 | { delete this; } |
381 | |
382 | virtual void* |
383 | _M_get_deleter(const std::type_info&) noexcept |
384 | { return nullptr; } |
385 | |
386 | _Sp_counted_ptr(const _Sp_counted_ptr&) = delete; |
387 | _Sp_counted_ptr& operator=(const _Sp_counted_ptr&) = delete; |
388 | |
389 | private: |
390 | _Ptr _M_ptr; |
391 | }; |
392 | |
393 | template<> |
394 | inline void |
395 | _Sp_counted_ptr<nullptr_t, _S_single>::_M_dispose() noexcept { } |
396 | |
397 | template<> |
398 | inline void |
399 | _Sp_counted_ptr<nullptr_t, _S_mutex>::_M_dispose() noexcept { } |
400 | |
401 | template<> |
402 | inline void |
403 | _Sp_counted_ptr<nullptr_t, _S_atomic>::_M_dispose() noexcept { } |
404 | |
405 | template<int _Nm, typename _Tp, |
406 | bool __use_ebo = !__is_final(_Tp) && __is_empty(_Tp)> |
407 | struct _Sp_ebo_helper; |
408 | |
409 | /// Specialization using EBO. |
410 | template<int _Nm, typename _Tp> |
411 | struct _Sp_ebo_helper<_Nm, _Tp, true> : private _Tp |
412 | { |
413 | explicit _Sp_ebo_helper(const _Tp& __tp) : _Tp(__tp) { } |
414 | explicit _Sp_ebo_helper(_Tp&& __tp) : _Tp(std::move(__tp)) { } |
415 | |
416 | static _Tp& |
417 | _S_get(_Sp_ebo_helper& __eboh) { return static_cast<_Tp&>(__eboh); } |
418 | }; |
419 | |
420 | /// Specialization not using EBO. |
421 | template<int _Nm, typename _Tp> |
422 | struct _Sp_ebo_helper<_Nm, _Tp, false> |
423 | { |
424 | explicit _Sp_ebo_helper(const _Tp& __tp) : _M_tp(__tp) { } |
425 | explicit _Sp_ebo_helper(_Tp&& __tp) : _M_tp(std::move(__tp)) { } |
426 | |
427 | static _Tp& |
428 | _S_get(_Sp_ebo_helper& __eboh) |
429 | { return __eboh._M_tp; } |
430 | |
431 | private: |
432 | _Tp _M_tp; |
433 | }; |
434 | |
435 | // Support for custom deleter and/or allocator |
436 | template<typename _Ptr, typename _Deleter, typename _Alloc, _Lock_policy _Lp> |
437 | class _Sp_counted_deleter final : public _Sp_counted_base<_Lp> |
438 | { |
439 | class _Impl : _Sp_ebo_helper<0, _Deleter>, _Sp_ebo_helper<1, _Alloc> |
440 | { |
441 | typedef _Sp_ebo_helper<0, _Deleter> _Del_base; |
442 | typedef _Sp_ebo_helper<1, _Alloc> _Alloc_base; |
443 | |
444 | public: |
445 | _Impl(_Ptr __p, _Deleter __d, const _Alloc& __a) noexcept |
446 | : _M_ptr(__p), _Del_base(std::move(__d)), _Alloc_base(__a) |
447 | { } |
448 | |
449 | _Deleter& _M_del() noexcept { return _Del_base::_S_get(*this); } |
450 | _Alloc& _M_alloc() noexcept { return _Alloc_base::_S_get(*this); } |
451 | |
452 | _Ptr _M_ptr; |
453 | }; |
454 | |
455 | public: |
456 | using __allocator_type = __alloc_rebind<_Alloc, _Sp_counted_deleter>; |
457 | |
458 | // __d(__p) must not throw. |
459 | _Sp_counted_deleter(_Ptr __p, _Deleter __d) noexcept |
460 | : _M_impl(__p, std::move(__d), _Alloc()) { } |
461 | |
462 | // __d(__p) must not throw. |
463 | _Sp_counted_deleter(_Ptr __p, _Deleter __d, const _Alloc& __a) noexcept |
464 | : _M_impl(__p, std::move(__d), __a) { } |
465 | |
466 | ~_Sp_counted_deleter() noexcept { } |
467 | |
468 | virtual void |
469 | _M_dispose() noexcept |
470 | { _M_impl._M_del()(_M_impl._M_ptr); } |
471 | |
472 | virtual void |
473 | _M_destroy() noexcept |
474 | { |
475 | __allocator_type __a(_M_impl._M_alloc()); |
476 | __allocated_ptr<__allocator_type> __guard_ptr{ __a, this }; |
477 | this->~_Sp_counted_deleter(); |
478 | } |
479 | |
480 | virtual void* |
481 | _M_get_deleter(const std::type_info& __ti) noexcept |
482 | { |
483 | #if __cpp_rtti199711 |
484 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
485 | // 2400. shared_ptr's get_deleter() should use addressof() |
486 | return __ti == typeid(_Deleter) |
487 | ? std::__addressof(_M_impl._M_del()) |
488 | : nullptr; |
489 | #else |
490 | return nullptr; |
491 | #endif |
492 | } |
493 | |
494 | private: |
495 | _Impl _M_impl; |
496 | }; |
497 | |
498 | // helpers for make_shared / allocate_shared |
499 | |
500 | struct _Sp_make_shared_tag { }; |
501 | |
502 | template<typename _Tp, typename _Alloc, _Lock_policy _Lp> |
503 | class _Sp_counted_ptr_inplace final : public _Sp_counted_base<_Lp> |
504 | { |
505 | class _Impl : _Sp_ebo_helper<0, _Alloc> |
506 | { |
507 | typedef _Sp_ebo_helper<0, _Alloc> _A_base; |
508 | |
509 | public: |
510 | explicit _Impl(_Alloc __a) noexcept : _A_base(__a) { } |
511 | |
512 | _Alloc& _M_alloc() noexcept { return _A_base::_S_get(*this); } |
513 | |
514 | __gnu_cxx::__aligned_buffer<_Tp> _M_storage; |
515 | }; |
516 | |
517 | public: |
518 | using __allocator_type = __alloc_rebind<_Alloc, _Sp_counted_ptr_inplace>; |
519 | |
520 | template<typename... _Args> |
521 | _Sp_counted_ptr_inplace(_Alloc __a, _Args&&... __args) |
522 | : _M_impl(__a) |
523 | { |
524 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
525 | // 2070. allocate_shared should use allocator_traits<A>::construct |
526 | allocator_traits<_Alloc>::construct(__a, _M_ptr(), |
527 | std::forward<_Args>(__args)...); // might throw |
528 | } |
529 | |
530 | ~_Sp_counted_ptr_inplace() noexcept { } |
531 | |
532 | virtual void |
533 | _M_dispose() noexcept |
534 | { |
535 | allocator_traits<_Alloc>::destroy(_M_impl._M_alloc(), _M_ptr()); |
536 | } |
537 | |
538 | // Override because the allocator needs to know the dynamic type |
539 | virtual void |
540 | _M_destroy() noexcept |
541 | { |
542 | __allocator_type __a(_M_impl._M_alloc()); |
543 | __allocated_ptr<__allocator_type> __guard_ptr{ __a, this }; |
544 | this->~_Sp_counted_ptr_inplace(); |
545 | } |
546 | |
547 | // Sneaky trick so __shared_ptr can get the managed pointer |
548 | virtual void* |
549 | _M_get_deleter(const std::type_info& __ti) noexcept |
550 | { |
551 | #if __cpp_rtti199711 |
552 | if (__ti == typeid(_Sp_make_shared_tag)) |
553 | return const_cast<typename remove_cv<_Tp>::type*>(_M_ptr()); |
554 | #endif |
555 | return nullptr; |
556 | } |
557 | |
558 | private: |
559 | _Tp* _M_ptr() noexcept { return _M_impl._M_storage._M_ptr(); } |
560 | |
561 | _Impl _M_impl; |
562 | }; |
563 | |
564 | // The default deleter for shared_ptr<T[]> and shared_ptr<T[N]>. |
565 | struct __sp_array_delete |
566 | { |
567 | template<typename _Yp> |
568 | void operator()(_Yp* __p) const { delete[] __p; } |
569 | }; |
570 | |
571 | template<_Lock_policy _Lp> |
572 | class __shared_count |
573 | { |
574 | public: |
575 | constexpr __shared_count() noexcept : _M_pi(0) |
576 | { } |
577 | |
578 | template<typename _Ptr> |
579 | explicit |
580 | __shared_count(_Ptr __p) : _M_pi(0) |
581 | { |
582 | __tryif (true) |
583 | { |
584 | _M_pi = new _Sp_counted_ptr<_Ptr, _Lp>(__p); |
585 | } |
586 | __catch(...)if (false) |
587 | { |
588 | delete __p; |
589 | __throw_exception_again; |
590 | } |
591 | } |
592 | |
593 | template<typename _Ptr> |
594 | __shared_count(_Ptr __p, /* is_array = */ false_type) |
595 | : __shared_count(__p) |
596 | { } |
597 | |
598 | template<typename _Ptr> |
599 | __shared_count(_Ptr __p, /* is_array = */ true_type) |
600 | : __shared_count(__p, __sp_array_delete{}, allocator<void>()) |
601 | { } |
602 | |
603 | template<typename _Ptr, typename _Deleter> |
604 | __shared_count(_Ptr __p, _Deleter __d) |
605 | : __shared_count(__p, std::move(__d), allocator<void>()) |
606 | { } |
607 | |
608 | template<typename _Ptr, typename _Deleter, typename _Alloc> |
609 | __shared_count(_Ptr __p, _Deleter __d, _Alloc __a) : _M_pi(0) |
610 | { |
611 | typedef _Sp_counted_deleter<_Ptr, _Deleter, _Alloc, _Lp> _Sp_cd_type; |
612 | __tryif (true) |
613 | { |
614 | typename _Sp_cd_type::__allocator_type __a2(__a); |
615 | auto __guard = std::__allocate_guarded(__a2); |
616 | _Sp_cd_type* __mem = __guard.get(); |
617 | ::new (__mem) _Sp_cd_type(__p, std::move(__d), std::move(__a)); |
618 | _M_pi = __mem; |
619 | __guard = nullptr; |
620 | } |
621 | __catch(...)if (false) |
622 | { |
623 | __d(__p); // Call _Deleter on __p. |
624 | __throw_exception_again; |
625 | } |
626 | } |
627 | |
628 | template<typename _Tp, typename _Alloc, typename... _Args> |
629 | __shared_count(_Sp_make_shared_tag, _Tp*, const _Alloc& __a, |
630 | _Args&&... __args) |
631 | : _M_pi(0) |
632 | { |
633 | typedef _Sp_counted_ptr_inplace<_Tp, _Alloc, _Lp> _Sp_cp_type; |
634 | typename _Sp_cp_type::__allocator_type __a2(__a); |
635 | auto __guard = std::__allocate_guarded(__a2); |
636 | _Sp_cp_type* __mem = __guard.get(); |
637 | ::new (__mem) _Sp_cp_type(std::move(__a), |
638 | std::forward<_Args>(__args)...); |
639 | _M_pi = __mem; |
640 | __guard = nullptr; |
641 | } |
642 | |
643 | #if _GLIBCXX_USE_DEPRECATED1 |
644 | // Special case for auto_ptr<_Tp> to provide the strong guarantee. |
645 | template<typename _Tp> |
646 | explicit |
647 | __shared_count(std::auto_ptr<_Tp>&& __r); |
648 | #endif |
649 | |
650 | // Special case for unique_ptr<_Tp,_Del> to provide the strong guarantee. |
651 | template<typename _Tp, typename _Del> |
652 | explicit |
653 | __shared_count(std::unique_ptr<_Tp, _Del>&& __r) : _M_pi(0) |
654 | { |
655 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
656 | // 2415. Inconsistency between unique_ptr and shared_ptr |
657 | if (__r.get() == nullptr) |
658 | return; |
659 | |
660 | using _Ptr = typename unique_ptr<_Tp, _Del>::pointer; |
661 | using _Del2 = typename conditional<is_reference<_Del>::value, |
662 | reference_wrapper<typename remove_reference<_Del>::type>, |
663 | _Del>::type; |
664 | using _Sp_cd_type |
665 | = _Sp_counted_deleter<_Ptr, _Del2, allocator<void>, _Lp>; |
666 | using _Alloc = allocator<_Sp_cd_type>; |
667 | using _Alloc_traits = allocator_traits<_Alloc>; |
668 | _Alloc __a; |
669 | _Sp_cd_type* __mem = _Alloc_traits::allocate(__a, 1); |
670 | _Alloc_traits::construct(__a, __mem, __r.release(), |
671 | __r.get_deleter()); // non-throwing |
672 | _M_pi = __mem; |
673 | } |
674 | |
675 | // Throw bad_weak_ptr when __r._M_get_use_count() == 0. |
676 | explicit __shared_count(const __weak_count<_Lp>& __r); |
677 | |
678 | // Does not throw if __r._M_get_use_count() == 0, caller must check. |
679 | explicit __shared_count(const __weak_count<_Lp>& __r, std::nothrow_t); |
680 | |
681 | ~__shared_count() noexcept |
682 | { |
683 | if (_M_pi != nullptr) |
684 | _M_pi->_M_release(); |
685 | } |
686 | |
687 | __shared_count(const __shared_count& __r) noexcept |
688 | : _M_pi(__r._M_pi) |
689 | { |
690 | if (_M_pi != 0) |
691 | _M_pi->_M_add_ref_copy(); |
692 | } |
693 | |
694 | __shared_count& |
695 | operator=(const __shared_count& __r) noexcept |
696 | { |
697 | _Sp_counted_base<_Lp>* __tmp = __r._M_pi; |
698 | if (__tmp != _M_pi) |
699 | { |
700 | if (__tmp != 0) |
701 | __tmp->_M_add_ref_copy(); |
702 | if (_M_pi != 0) |
703 | _M_pi->_M_release(); |
704 | _M_pi = __tmp; |
705 | } |
706 | return *this; |
707 | } |
708 | |
709 | void |
710 | _M_swap(__shared_count& __r) noexcept |
711 | { |
712 | _Sp_counted_base<_Lp>* __tmp = __r._M_pi; |
713 | __r._M_pi = _M_pi; |
714 | _M_pi = __tmp; |
715 | } |
716 | |
717 | long |
718 | _M_get_use_count() const noexcept |
719 | { return _M_pi != 0 ? _M_pi->_M_get_use_count() : 0; } |
720 | |
721 | bool |
722 | _M_unique() const noexcept |
723 | { return this->_M_get_use_count() == 1; } |
724 | |
725 | void* |
726 | _M_get_deleter(const std::type_info& __ti) const noexcept |
727 | { return _M_pi ? _M_pi->_M_get_deleter(__ti) : nullptr; } |
728 | |
729 | bool |
730 | _M_less(const __shared_count& __rhs) const noexcept |
731 | { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } |
732 | |
733 | bool |
734 | _M_less(const __weak_count<_Lp>& __rhs) const noexcept |
735 | { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } |
736 | |
737 | // Friend function injected into enclosing namespace and found by ADL |
738 | friend inline bool |
739 | operator==(const __shared_count& __a, const __shared_count& __b) noexcept |
740 | { return __a._M_pi == __b._M_pi; } |
741 | |
742 | private: |
743 | friend class __weak_count<_Lp>; |
744 | |
745 | _Sp_counted_base<_Lp>* _M_pi; |
746 | }; |
747 | |
748 | |
749 | template<_Lock_policy _Lp> |
750 | class __weak_count |
751 | { |
752 | public: |
753 | constexpr __weak_count() noexcept : _M_pi(nullptr) |
754 | { } |
755 | |
756 | __weak_count(const __shared_count<_Lp>& __r) noexcept |
757 | : _M_pi(__r._M_pi) |
758 | { |
759 | if (_M_pi != nullptr) |
760 | _M_pi->_M_weak_add_ref(); |
761 | } |
762 | |
763 | __weak_count(const __weak_count& __r) noexcept |
764 | : _M_pi(__r._M_pi) |
765 | { |
766 | if (_M_pi != nullptr) |
767 | _M_pi->_M_weak_add_ref(); |
768 | } |
769 | |
770 | __weak_count(__weak_count&& __r) noexcept |
771 | : _M_pi(__r._M_pi) |
772 | { __r._M_pi = nullptr; } |
773 | |
774 | ~__weak_count() noexcept |
775 | { |
776 | if (_M_pi != nullptr) |
777 | _M_pi->_M_weak_release(); |
778 | } |
779 | |
780 | __weak_count& |
781 | operator=(const __shared_count<_Lp>& __r) noexcept |
782 | { |
783 | _Sp_counted_base<_Lp>* __tmp = __r._M_pi; |
784 | if (__tmp != nullptr) |
785 | __tmp->_M_weak_add_ref(); |
786 | if (_M_pi != nullptr) |
787 | _M_pi->_M_weak_release(); |
788 | _M_pi = __tmp; |
789 | return *this; |
790 | } |
791 | |
792 | __weak_count& |
793 | operator=(const __weak_count& __r) noexcept |
794 | { |
795 | _Sp_counted_base<_Lp>* __tmp = __r._M_pi; |
796 | if (__tmp != nullptr) |
797 | __tmp->_M_weak_add_ref(); |
798 | if (_M_pi != nullptr) |
799 | _M_pi->_M_weak_release(); |
800 | _M_pi = __tmp; |
801 | return *this; |
802 | } |
803 | |
804 | __weak_count& |
805 | operator=(__weak_count&& __r) noexcept |
806 | { |
807 | if (_M_pi != nullptr) |
808 | _M_pi->_M_weak_release(); |
809 | _M_pi = __r._M_pi; |
810 | __r._M_pi = nullptr; |
811 | return *this; |
812 | } |
813 | |
814 | void |
815 | _M_swap(__weak_count& __r) noexcept |
816 | { |
817 | _Sp_counted_base<_Lp>* __tmp = __r._M_pi; |
818 | __r._M_pi = _M_pi; |
819 | _M_pi = __tmp; |
820 | } |
821 | |
822 | long |
823 | _M_get_use_count() const noexcept |
824 | { return _M_pi != nullptr ? _M_pi->_M_get_use_count() : 0; } |
825 | |
826 | bool |
827 | _M_less(const __weak_count& __rhs) const noexcept |
828 | { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } |
829 | |
830 | bool |
831 | _M_less(const __shared_count<_Lp>& __rhs) const noexcept |
832 | { return std::less<_Sp_counted_base<_Lp>*>()(this->_M_pi, __rhs._M_pi); } |
833 | |
834 | // Friend function injected into enclosing namespace and found by ADL |
835 | friend inline bool |
836 | operator==(const __weak_count& __a, const __weak_count& __b) noexcept |
837 | { return __a._M_pi == __b._M_pi; } |
838 | |
839 | private: |
840 | friend class __shared_count<_Lp>; |
841 | |
842 | _Sp_counted_base<_Lp>* _M_pi; |
843 | }; |
844 | |
845 | // Now that __weak_count is defined we can define this constructor: |
846 | template<_Lock_policy _Lp> |
847 | inline |
848 | __shared_count<_Lp>::__shared_count(const __weak_count<_Lp>& __r) |
849 | : _M_pi(__r._M_pi) |
850 | { |
851 | if (_M_pi != nullptr) |
852 | _M_pi->_M_add_ref_lock(); |
853 | else |
854 | __throw_bad_weak_ptr(); |
855 | } |
856 | |
857 | // Now that __weak_count is defined we can define this constructor: |
858 | template<_Lock_policy _Lp> |
859 | inline |
860 | __shared_count<_Lp>:: |
861 | __shared_count(const __weak_count<_Lp>& __r, std::nothrow_t) |
862 | : _M_pi(__r._M_pi) |
863 | { |
864 | if (_M_pi != nullptr) |
865 | if (!_M_pi->_M_add_ref_lock_nothrow()) |
866 | _M_pi = nullptr; |
867 | } |
868 | |
869 | #define __cpp_lib_shared_ptr_arrays201603 201603 |
870 | |
871 | // Helper traits for shared_ptr of array: |
872 | |
873 | // A pointer type Y* is said to be compatible with a pointer type T* when |
874 | // either Y* is convertible to T* or Y is U[N] and T is U cv []. |
875 | template<typename _Yp_ptr, typename _Tp_ptr> |
876 | struct __sp_compatible_with |
877 | : false_type |
878 | { }; |
879 | |
880 | template<typename _Yp, typename _Tp> |
881 | struct __sp_compatible_with<_Yp*, _Tp*> |
882 | : is_convertible<_Yp*, _Tp*>::type |
883 | { }; |
884 | |
885 | template<typename _Up, size_t _Nm> |
886 | struct __sp_compatible_with<_Up(*)[_Nm], _Up(*)[]> |
887 | : true_type |
888 | { }; |
889 | |
890 | template<typename _Up, size_t _Nm> |
891 | struct __sp_compatible_with<_Up(*)[_Nm], const _Up(*)[]> |
892 | : true_type |
893 | { }; |
894 | |
895 | template<typename _Up, size_t _Nm> |
896 | struct __sp_compatible_with<_Up(*)[_Nm], volatile _Up(*)[]> |
897 | : true_type |
898 | { }; |
899 | |
900 | template<typename _Up, size_t _Nm> |
901 | struct __sp_compatible_with<_Up(*)[_Nm], const volatile _Up(*)[]> |
902 | : true_type |
903 | { }; |
904 | |
905 | // Test conversion from Y(*)[N] to U(*)[N] without forming invalid type Y[N]. |
906 | template<typename _Up, size_t _Nm, typename _Yp, typename = void> |
907 | struct __sp_is_constructible_arrN |
908 | : false_type |
909 | { }; |
910 | |
911 | template<typename _Up, size_t _Nm, typename _Yp> |
912 | struct __sp_is_constructible_arrN<_Up, _Nm, _Yp, __void_t<_Yp[_Nm]>> |
913 | : is_convertible<_Yp(*)[_Nm], _Up(*)[_Nm]>::type |
914 | { }; |
915 | |
916 | // Test conversion from Y(*)[] to U(*)[] without forming invalid type Y[]. |
917 | template<typename _Up, typename _Yp, typename = void> |
918 | struct __sp_is_constructible_arr |
919 | : false_type |
920 | { }; |
921 | |
922 | template<typename _Up, typename _Yp> |
923 | struct __sp_is_constructible_arr<_Up, _Yp, __void_t<_Yp[]>> |
924 | : is_convertible<_Yp(*)[], _Up(*)[]>::type |
925 | { }; |
926 | |
927 | // Trait to check if shared_ptr<T> can be constructed from Y*. |
928 | template<typename _Tp, typename _Yp> |
929 | struct __sp_is_constructible; |
930 | |
931 | // When T is U[N], Y(*)[N] shall be convertible to T*; |
932 | template<typename _Up, size_t _Nm, typename _Yp> |
933 | struct __sp_is_constructible<_Up[_Nm], _Yp> |
934 | : __sp_is_constructible_arrN<_Up, _Nm, _Yp>::type |
935 | { }; |
936 | |
937 | // when T is U[], Y(*)[] shall be convertible to T*; |
938 | template<typename _Up, typename _Yp> |
939 | struct __sp_is_constructible<_Up[], _Yp> |
940 | : __sp_is_constructible_arr<_Up, _Yp>::type |
941 | { }; |
942 | |
943 | // otherwise, Y* shall be convertible to T*. |
944 | template<typename _Tp, typename _Yp> |
945 | struct __sp_is_constructible |
946 | : is_convertible<_Yp*, _Tp*>::type |
947 | { }; |
948 | |
949 | |
950 | // Define operator* and operator-> for shared_ptr<T>. |
951 | template<typename _Tp, _Lock_policy _Lp, |
952 | bool = is_array<_Tp>::value, bool = is_void<_Tp>::value> |
953 | class __shared_ptr_access |
954 | { |
955 | public: |
956 | using element_type = _Tp; |
957 | |
958 | element_type& |
959 | operator*() const noexcept |
960 | { |
961 | __glibcxx_assert(_M_get() != nullptr); |
962 | return *_M_get(); |
963 | } |
964 | |
965 | element_type* |
966 | operator->() const noexcept |
967 | { |
968 | _GLIBCXX_DEBUG_PEDASSERT(_M_get() != nullptr); |
969 | return _M_get(); |
970 | } |
971 | |
972 | private: |
973 | element_type* |
974 | _M_get() const noexcept |
975 | { return static_cast<const __shared_ptr<_Tp, _Lp>*>(this)->get(); } |
976 | }; |
977 | |
978 | // Define operator-> for shared_ptr<cv void>. |
979 | template<typename _Tp, _Lock_policy _Lp> |
980 | class __shared_ptr_access<_Tp, _Lp, false, true> |
981 | { |
982 | public: |
983 | using element_type = _Tp; |
984 | |
985 | element_type* |
986 | operator->() const noexcept |
987 | { |
988 | auto __ptr = static_cast<const __shared_ptr<_Tp, _Lp>*>(this)->get(); |
989 | _GLIBCXX_DEBUG_PEDASSERT(__ptr != nullptr); |
990 | return __ptr; |
991 | } |
992 | }; |
993 | |
994 | // Define operator[] for shared_ptr<T[]> and shared_ptr<T[N]>. |
995 | template<typename _Tp, _Lock_policy _Lp> |
996 | class __shared_ptr_access<_Tp, _Lp, true, false> |
997 | { |
998 | public: |
999 | using element_type = typename remove_extent<_Tp>::type; |
1000 | |
1001 | #if __cplusplus201103L <= 201402L |
1002 | [[__deprecated__("shared_ptr<T[]>::operator* is absent from C++17")]] |
1003 | element_type& |
1004 | operator*() const noexcept |
1005 | { |
1006 | __glibcxx_assert(_M_get() != nullptr); |
1007 | return *_M_get(); |
1008 | } |
1009 | |
1010 | [[__deprecated__("shared_ptr<T[]>::operator-> is absent from C++17")]] |
1011 | element_type* |
1012 | operator->() const noexcept |
1013 | { |
1014 | _GLIBCXX_DEBUG_PEDASSERT(_M_get() != nullptr); |
1015 | return _M_get(); |
1016 | } |
1017 | #endif |
1018 | |
1019 | element_type& |
1020 | operator[](ptrdiff_t __i) const |
1021 | { |
1022 | __glibcxx_assert(_M_get() != nullptr); |
1023 | __glibcxx_assert(!extent<_Tp>::value || __i < extent<_Tp>::value); |
1024 | return _M_get()[__i]; |
1025 | } |
1026 | |
1027 | private: |
1028 | element_type* |
1029 | _M_get() const noexcept |
1030 | { return static_cast<const __shared_ptr<_Tp, _Lp>*>(this)->get(); } |
1031 | }; |
1032 | |
1033 | template<typename _Tp, _Lock_policy _Lp> |
1034 | class __shared_ptr |
1035 | : public __shared_ptr_access<_Tp, _Lp> |
1036 | { |
1037 | public: |
1038 | using element_type = typename remove_extent<_Tp>::type; |
1039 | |
1040 | private: |
1041 | // Constraint for taking ownership of a pointer of type _Yp*: |
1042 | template<typename _Yp> |
1043 | using _SafeConv |
1044 | = typename enable_if<__sp_is_constructible<_Tp, _Yp>::value>::type; |
1045 | |
1046 | // Constraint for construction from shared_ptr and weak_ptr: |
1047 | template<typename _Yp, typename _Res = void> |
1048 | using _Compatible = typename |
1049 | enable_if<__sp_compatible_with<_Yp*, _Tp*>::value, _Res>::type; |
1050 | |
1051 | // Constraint for assignment from shared_ptr and weak_ptr: |
1052 | template<typename _Yp> |
1053 | using _Assignable = _Compatible<_Yp, __shared_ptr&>; |
1054 | |
1055 | // Constraint for construction from unique_ptr: |
1056 | template<typename _Yp, typename _Del, typename _Res = void, |
1057 | typename _Ptr = typename unique_ptr<_Yp, _Del>::pointer> |
1058 | using _UniqCompatible = typename enable_if<__and_< |
1059 | __sp_compatible_with<_Yp*, _Tp*>, is_convertible<_Ptr, element_type*> |
1060 | >::value, _Res>::type; |
1061 | |
1062 | // Constraint for assignment from unique_ptr: |
1063 | template<typename _Yp, typename _Del> |
1064 | using _UniqAssignable = _UniqCompatible<_Yp, _Del, __shared_ptr&>; |
1065 | |
1066 | public: |
1067 | |
1068 | #if __cplusplus201103L > 201402L |
1069 | using weak_type = __weak_ptr<_Tp, _Lp>; |
1070 | #endif |
1071 | |
1072 | constexpr __shared_ptr() noexcept |
1073 | : _M_ptr(0), _M_refcount() |
1074 | { } |
1075 | |
1076 | template<typename _Yp, typename = _SafeConv<_Yp>> |
1077 | explicit |
1078 | __shared_ptr(_Yp* __p) |
1079 | : _M_ptr(__p), _M_refcount(__p, typename is_array<_Tp>::type()) |
1080 | { |
1081 | static_assert( !is_void<_Yp>::value, "incomplete type" ); |
1082 | static_assert( sizeof(_Yp) > 0, "incomplete type" ); |
1083 | _M_enable_shared_from_this_with(__p); |
1084 | } |
1085 | |
1086 | template<typename _Yp, typename _Deleter, typename = _SafeConv<_Yp>> |
1087 | __shared_ptr(_Yp* __p, _Deleter __d) |
1088 | : _M_ptr(__p), _M_refcount(__p, std::move(__d)) |
1089 | { |
1090 | static_assert(__is_invocable<_Deleter&, _Yp*&>::value, |
1091 | "deleter expression d(p) is well-formed"); |
1092 | _M_enable_shared_from_this_with(__p); |
1093 | } |
1094 | |
1095 | template<typename _Yp, typename _Deleter, typename _Alloc, |
1096 | typename = _SafeConv<_Yp>> |
1097 | __shared_ptr(_Yp* __p, _Deleter __d, _Alloc __a) |
1098 | : _M_ptr(__p), _M_refcount(__p, std::move(__d), std::move(__a)) |
1099 | { |
1100 | static_assert(__is_invocable<_Deleter&, _Yp*&>::value, |
1101 | "deleter expression d(p) is well-formed"); |
1102 | _M_enable_shared_from_this_with(__p); |
1103 | } |
1104 | |
1105 | template<typename _Deleter> |
1106 | __shared_ptr(nullptr_t __p, _Deleter __d) |
1107 | : _M_ptr(0), _M_refcount(__p, std::move(__d)) |
1108 | { } |
1109 | |
1110 | template<typename _Deleter, typename _Alloc> |
1111 | __shared_ptr(nullptr_t __p, _Deleter __d, _Alloc __a) |
1112 | : _M_ptr(0), _M_refcount(__p, std::move(__d), std::move(__a)) |
1113 | { } |
1114 | |
1115 | template<typename _Yp> |
1116 | __shared_ptr(const __shared_ptr<_Yp, _Lp>& __r, |
1117 | element_type* __p) noexcept |
1118 | : _M_ptr(__p), _M_refcount(__r._M_refcount) // never throws |
1119 | { } |
1120 | |
1121 | __shared_ptr(const __shared_ptr&) noexcept = default; |
1122 | __shared_ptr& operator=(const __shared_ptr&) noexcept = default; |
1123 | ~__shared_ptr() = default; |
1124 | |
1125 | template<typename _Yp, typename = _Compatible<_Yp>> |
1126 | __shared_ptr(const __shared_ptr<_Yp, _Lp>& __r) noexcept |
1127 | : _M_ptr(__r._M_ptr), _M_refcount(__r._M_refcount) |
1128 | { } |
1129 | |
1130 | __shared_ptr(__shared_ptr&& __r) noexcept |
1131 | : _M_ptr(__r._M_ptr), _M_refcount() |
1132 | { |
1133 | _M_refcount._M_swap(__r._M_refcount); |
1134 | __r._M_ptr = 0; |
1135 | } |
1136 | |
1137 | template<typename _Yp, typename = _Compatible<_Yp>> |
1138 | __shared_ptr(__shared_ptr<_Yp, _Lp>&& __r) noexcept |
1139 | : _M_ptr(__r._M_ptr), _M_refcount() |
1140 | { |
1141 | _M_refcount._M_swap(__r._M_refcount); |
1142 | __r._M_ptr = 0; |
1143 | } |
1144 | |
1145 | template<typename _Yp, typename = _Compatible<_Yp>> |
1146 | explicit __shared_ptr(const __weak_ptr<_Yp, _Lp>& __r) |
1147 | : _M_refcount(__r._M_refcount) // may throw |
1148 | { |
1149 | // It is now safe to copy __r._M_ptr, as |
1150 | // _M_refcount(__r._M_refcount) did not throw. |
1151 | _M_ptr = __r._M_ptr; |
1152 | } |
1153 | |
1154 | // If an exception is thrown this constructor has no effect. |
1155 | template<typename _Yp, typename _Del, |
1156 | typename = _UniqCompatible<_Yp, _Del>> |
1157 | __shared_ptr(unique_ptr<_Yp, _Del>&& __r) |
1158 | : _M_ptr(__r.get()), _M_refcount() |
1159 | { |
1160 | auto __raw = _S_raw_ptr(__r.get()); |
1161 | _M_refcount = __shared_count<_Lp>(std::move(__r)); |
1162 | _M_enable_shared_from_this_with(__raw); |
1163 | } |
1164 | |
1165 | #if __cplusplus201103L <= 201402L && _GLIBCXX_USE_DEPRECATED1 |
1166 | protected: |
1167 | // If an exception is thrown this constructor has no effect. |
1168 | template<typename _Tp1, typename _Del, |
1169 | typename enable_if<__and_< |
1170 | __not_<is_array<_Tp>>, is_array<_Tp1>, |
1171 | is_convertible<typename unique_ptr<_Tp1, _Del>::pointer, _Tp*> |
1172 | >::value, bool>::type = true> |
1173 | __shared_ptr(unique_ptr<_Tp1, _Del>&& __r, __sp_array_delete) |
1174 | : _M_ptr(__r.get()), _M_refcount() |
1175 | { |
1176 | auto __raw = _S_raw_ptr(__r.get()); |
1177 | _M_refcount = __shared_count<_Lp>(std::move(__r)); |
1178 | _M_enable_shared_from_this_with(__raw); |
1179 | } |
1180 | public: |
1181 | #endif |
1182 | |
1183 | #if _GLIBCXX_USE_DEPRECATED1 |
1184 | // Postcondition: use_count() == 1 and __r.get() == 0 |
1185 | template<typename _Yp, typename = _Compatible<_Yp>> |
1186 | __shared_ptr(auto_ptr<_Yp>&& __r); |
1187 | #endif |
1188 | |
1189 | constexpr __shared_ptr(nullptr_t) noexcept : __shared_ptr() { } |
1190 | |
1191 | template<typename _Yp> |
1192 | _Assignable<_Yp> |
1193 | operator=(const __shared_ptr<_Yp, _Lp>& __r) noexcept |
1194 | { |
1195 | _M_ptr = __r._M_ptr; |
1196 | _M_refcount = __r._M_refcount; // __shared_count::op= doesn't throw |
1197 | return *this; |
1198 | } |
1199 | |
1200 | #if _GLIBCXX_USE_DEPRECATED1 |
1201 | template<typename _Yp> |
1202 | _Assignable<_Yp> |
1203 | operator=(auto_ptr<_Yp>&& __r) |
1204 | { |
1205 | __shared_ptr(std::move(__r)).swap(*this); |
1206 | return *this; |
1207 | } |
1208 | #endif |
1209 | |
1210 | __shared_ptr& |
1211 | operator=(__shared_ptr&& __r) noexcept |
1212 | { |
1213 | __shared_ptr(std::move(__r)).swap(*this); |
1214 | return *this; |
1215 | } |
1216 | |
1217 | template<class _Yp> |
1218 | _Assignable<_Yp> |
1219 | operator=(__shared_ptr<_Yp, _Lp>&& __r) noexcept |
1220 | { |
1221 | __shared_ptr(std::move(__r)).swap(*this); |
1222 | return *this; |
1223 | } |
1224 | |
1225 | template<typename _Yp, typename _Del> |
1226 | _UniqAssignable<_Yp, _Del> |
1227 | operator=(unique_ptr<_Yp, _Del>&& __r) |
1228 | { |
1229 | __shared_ptr(std::move(__r)).swap(*this); |
1230 | return *this; |
1231 | } |
1232 | |
1233 | void |
1234 | reset() noexcept |
1235 | { __shared_ptr().swap(*this); } |
1236 | |
1237 | template<typename _Yp> |
1238 | _SafeConv<_Yp> |
1239 | reset(_Yp* __p) // _Yp must be complete. |
1240 | { |
1241 | // Catch self-reset errors. |
1242 | __glibcxx_assert(__p == 0 || __p != _M_ptr); |
1243 | __shared_ptr(__p).swap(*this); |
1244 | } |
1245 | |
1246 | template<typename _Yp, typename _Deleter> |
1247 | _SafeConv<_Yp> |
1248 | reset(_Yp* __p, _Deleter __d) |
1249 | { __shared_ptr(__p, std::move(__d)).swap(*this); } |
1250 | |
1251 | template<typename _Yp, typename _Deleter, typename _Alloc> |
1252 | _SafeConv<_Yp> |
1253 | reset(_Yp* __p, _Deleter __d, _Alloc __a) |
1254 | { __shared_ptr(__p, std::move(__d), std::move(__a)).swap(*this); } |
1255 | |
1256 | element_type* |
1257 | get() const noexcept |
1258 | { return _M_ptr; } |
1259 | |
1260 | explicit operator bool() const // never throws |
1261 | { return _M_ptr == 0 ? false : true; } |
1262 | |
1263 | bool |
1264 | unique() const noexcept |
1265 | { return _M_refcount._M_unique(); } |
1266 | |
1267 | long |
1268 | use_count() const noexcept |
1269 | { return _M_refcount._M_get_use_count(); } |
1270 | |
1271 | void |
1272 | swap(__shared_ptr<_Tp, _Lp>& __other) noexcept |
1273 | { |
1274 | std::swap(_M_ptr, __other._M_ptr); |
1275 | _M_refcount._M_swap(__other._M_refcount); |
1276 | } |
1277 | |
1278 | template<typename _Tp1> |
1279 | bool |
1280 | owner_before(__shared_ptr<_Tp1, _Lp> const& __rhs) const noexcept |
1281 | { return _M_refcount._M_less(__rhs._M_refcount); } |
1282 | |
1283 | template<typename _Tp1> |
1284 | bool |
1285 | owner_before(__weak_ptr<_Tp1, _Lp> const& __rhs) const noexcept |
1286 | { return _M_refcount._M_less(__rhs._M_refcount); } |
1287 | |
1288 | #if __cpp_rtti199711 |
1289 | protected: |
1290 | // This constructor is non-standard, it is used by allocate_shared. |
1291 | template<typename _Alloc, typename... _Args> |
1292 | __shared_ptr(_Sp_make_shared_tag __tag, const _Alloc& __a, |
1293 | _Args&&... __args) |
1294 | : _M_ptr(), _M_refcount(__tag, (_Tp*)0, __a, |
1295 | std::forward<_Args>(__args)...) |
1296 | { |
1297 | // _M_ptr needs to point to the newly constructed object. |
1298 | // This relies on _Sp_counted_ptr_inplace::_M_get_deleter. |
1299 | void* __p = _M_refcount._M_get_deleter(typeid(__tag)); |
1300 | _M_ptr = static_cast<_Tp*>(__p); |
1301 | _M_enable_shared_from_this_with(_M_ptr); |
1302 | } |
1303 | #else |
1304 | template<typename _Alloc> |
1305 | struct _Deleter |
1306 | { |
1307 | void operator()(typename _Alloc::value_type* __ptr) |
1308 | { |
1309 | __allocated_ptr<_Alloc> __guard{ _M_alloc, __ptr }; |
1310 | allocator_traits<_Alloc>::destroy(_M_alloc, __guard.get()); |
1311 | } |
1312 | _Alloc _M_alloc; |
1313 | }; |
1314 | |
1315 | template<typename _Alloc, typename... _Args> |
1316 | __shared_ptr(_Sp_make_shared_tag __tag, const _Alloc& __a, |
1317 | _Args&&... __args) |
1318 | : _M_ptr(), _M_refcount() |
1319 | { |
1320 | typedef typename allocator_traits<_Alloc>::template |
1321 | rebind_traits<typename std::remove_cv<_Tp>::type> __traits; |
1322 | _Deleter<typename __traits::allocator_type> __del = { __a }; |
1323 | auto __guard = std::__allocate_guarded(__del._M_alloc); |
1324 | auto __ptr = __guard.get(); |
1325 | // _GLIBCXX_RESOLVE_LIB_DEFECTS |
1326 | // 2070. allocate_shared should use allocator_traits<A>::construct |
1327 | __traits::construct(__del._M_alloc, __ptr, |
1328 | std::forward<_Args>(__args)...); |
1329 | __guard = nullptr; |
1330 | __shared_count<_Lp> __count(__ptr, __del, __del._M_alloc); |
1331 | _M_refcount._M_swap(__count); |
1332 | _M_ptr = __ptr; |
1333 | _M_enable_shared_from_this_with(_M_ptr); |
1334 | } |
1335 | #endif |
1336 | |
1337 | template<typename _Tp1, _Lock_policy _Lp1, typename _Alloc, |
1338 | typename... _Args> |
1339 | friend __shared_ptr<_Tp1, _Lp1> |
1340 | __allocate_shared(const _Alloc& __a, _Args&&... __args); |
1341 | |
1342 | // This constructor is used by __weak_ptr::lock() and |
1343 | // shared_ptr::shared_ptr(const weak_ptr&, std::nothrow_t). |
1344 | __shared_ptr(const __weak_ptr<_Tp, _Lp>& __r, std::nothrow_t) |
1345 | : _M_refcount(__r._M_refcount, std::nothrow) |
1346 | { |
1347 | _M_ptr = _M_refcount._M_get_use_count() ? __r._M_ptr : nullptr; |
1348 | } |
1349 | |
1350 | friend class __weak_ptr<_Tp, _Lp>; |
1351 | |
1352 | private: |
1353 | |
1354 | template<typename _Yp> |
1355 | using __esft_base_t = decltype(__enable_shared_from_this_base( |
1356 | std::declval<const __shared_count<_Lp>&>(), |
1357 | std::declval<_Yp*>())); |
1358 | |
1359 | // Detect an accessible and unambiguous enable_shared_from_this base. |
1360 | template<typename _Yp, typename = void> |
1361 | struct __has_esft_base |
1362 | : false_type { }; |
1363 | |
1364 | template<typename _Yp> |
1365 | struct __has_esft_base<_Yp, __void_t<__esft_base_t<_Yp>>> |
1366 | : __not_<is_array<_Tp>> { }; // No enable shared_from_this for arrays |
1367 | |
1368 | template<typename _Yp, typename _Yp2 = typename remove_cv<_Yp>::type> |
1369 | typename enable_if<__has_esft_base<_Yp2>::value>::type |
1370 | _M_enable_shared_from_this_with(_Yp* __p) noexcept |
1371 | { |
1372 | if (auto __base = __enable_shared_from_this_base(_M_refcount, __p)) |
1373 | __base->_M_weak_assign(const_cast<_Yp2*>(__p), _M_refcount); |
1374 | } |
1375 | |
1376 | template<typename _Yp, typename _Yp2 = typename remove_cv<_Yp>::type> |
1377 | typename enable_if<!__has_esft_base<_Yp2>::value>::type |
1378 | _M_enable_shared_from_this_with(_Yp*) noexcept |
1379 | { } |
1380 | |
1381 | void* |
1382 | _M_get_deleter(const std::type_info& __ti) const noexcept |
1383 | { return _M_refcount._M_get_deleter(__ti); } |
1384 | |
1385 | template<typename _Tp1> |
1386 | static _Tp1* |
1387 | _S_raw_ptr(_Tp1* __ptr) |
1388 | { return __ptr; } |
1389 | |
1390 | template<typename _Tp1> |
1391 | static auto |
1392 | _S_raw_ptr(_Tp1 __ptr) -> decltype(std::__addressof(*__ptr)) |
1393 | { return std::__addressof(*__ptr); } |
1394 | |
1395 | template<typename _Tp1, _Lock_policy _Lp1> friend class __shared_ptr; |
1396 | template<typename _Tp1, _Lock_policy _Lp1> friend class __weak_ptr; |
1397 | |
1398 | template<typename _Del, typename _Tp1, _Lock_policy _Lp1> |
1399 | friend _Del* get_deleter(const __shared_ptr<_Tp1, _Lp1>&) noexcept; |
1400 | |
1401 | element_type* _M_ptr; // Contained pointer. |
1402 | __shared_count<_Lp> _M_refcount; // Reference counter. |
1403 | }; |
1404 | |
1405 | |
1406 | // 20.7.2.2.7 shared_ptr comparisons |
1407 | template<typename _Tp1, typename _Tp2, _Lock_policy _Lp> |
1408 | inline bool |
1409 | operator==(const __shared_ptr<_Tp1, _Lp>& __a, |
1410 | const __shared_ptr<_Tp2, _Lp>& __b) noexcept |
1411 | { return __a.get() == __b.get(); } |
1412 | |
1413 | template<typename _Tp, _Lock_policy _Lp> |
1414 | inline bool |
1415 | operator==(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept |
1416 | { return !__a; } |
1417 | |
1418 | template<typename _Tp, _Lock_policy _Lp> |
1419 | inline bool |
1420 | operator==(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept |
1421 | { return !__a; } |
1422 | |
1423 | template<typename _Tp1, typename _Tp2, _Lock_policy _Lp> |
1424 | inline bool |
1425 | operator!=(const __shared_ptr<_Tp1, _Lp>& __a, |
1426 | const __shared_ptr<_Tp2, _Lp>& __b) noexcept |
1427 | { return __a.get() != __b.get(); } |
1428 | |
1429 | template<typename _Tp, _Lock_policy _Lp> |
1430 | inline bool |
1431 | operator!=(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept |
1432 | { return (bool)__a; } |
1433 | |
1434 | template<typename _Tp, _Lock_policy _Lp> |
1435 | inline bool |
1436 | operator!=(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept |
1437 | { return (bool)__a; } |
1438 | |
1439 | template<typename _Tp, typename _Up, _Lock_policy _Lp> |
1440 | inline bool |
1441 | operator<(const __shared_ptr<_Tp, _Lp>& __a, |
1442 | const __shared_ptr<_Up, _Lp>& __b) noexcept |
1443 | { |
1444 | using _Tp_elt = typename __shared_ptr<_Tp, _Lp>::element_type; |
1445 | using _Up_elt = typename __shared_ptr<_Up, _Lp>::element_type; |
1446 | using _Vp = typename common_type<_Tp_elt*, _Up_elt*>::type; |
1447 | return less<_Vp>()(__a.get(), __b.get()); |
1448 | } |
1449 | |
1450 | template<typename _Tp, _Lock_policy _Lp> |
1451 | inline bool |
1452 | operator<(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept |
1453 | { |
1454 | using _Tp_elt = typename __shared_ptr<_Tp, _Lp>::element_type; |
1455 | return less<_Tp_elt*>()(__a.get(), nullptr); |
1456 | } |
1457 | |
1458 | template<typename _Tp, _Lock_policy _Lp> |
1459 | inline bool |
1460 | operator<(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept |
1461 | { |
1462 | using _Tp_elt = typename __shared_ptr<_Tp, _Lp>::element_type; |
1463 | return less<_Tp_elt*>()(nullptr, __a.get()); |
1464 | } |
1465 | |
1466 | template<typename _Tp1, typename _Tp2, _Lock_policy _Lp> |
1467 | inline bool |
1468 | operator<=(const __shared_ptr<_Tp1, _Lp>& __a, |
1469 | const __shared_ptr<_Tp2, _Lp>& __b) noexcept |
1470 | { return !(__b < __a); } |
1471 | |
1472 | template<typename _Tp, _Lock_policy _Lp> |
1473 | inline bool |
1474 | operator<=(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept |
1475 | { return !(nullptr < __a); } |
1476 | |
1477 | template<typename _Tp, _Lock_policy _Lp> |
1478 | inline bool |
1479 | operator<=(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept |
1480 | { return !(__a < nullptr); } |
1481 | |
1482 | template<typename _Tp1, typename _Tp2, _Lock_policy _Lp> |
1483 | inline bool |
1484 | operator>(const __shared_ptr<_Tp1, _Lp>& __a, |
1485 | const __shared_ptr<_Tp2, _Lp>& __b) noexcept |
1486 | { return (__b < __a); } |
1487 | |
1488 | template<typename _Tp, _Lock_policy _Lp> |
1489 | inline bool |
1490 | operator>(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept |
1491 | { return nullptr < __a; } |
1492 | |
1493 | template<typename _Tp, _Lock_policy _Lp> |
1494 | inline bool |
1495 | operator>(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept |
1496 | { return __a < nullptr; } |
1497 | |
1498 | template<typename _Tp1, typename _Tp2, _Lock_policy _Lp> |
1499 | inline bool |
1500 | operator>=(const __shared_ptr<_Tp1, _Lp>& __a, |
1501 | const __shared_ptr<_Tp2, _Lp>& __b) noexcept |
1502 | { return !(__a < __b); } |
1503 | |
1504 | template<typename _Tp, _Lock_policy _Lp> |
1505 | inline bool |
1506 | operator>=(const __shared_ptr<_Tp, _Lp>& __a, nullptr_t) noexcept |
1507 | { return !(__a < nullptr); } |
1508 | |
1509 | template<typename _Tp, _Lock_policy _Lp> |
1510 | inline bool |
1511 | operator>=(nullptr_t, const __shared_ptr<_Tp, _Lp>& __a) noexcept |
1512 | { return !(nullptr < __a); } |
1513 | |
1514 | template<typename _Sp> |
1515 | struct _Sp_less : public binary_function<_Sp, _Sp, bool> |
1516 | { |
1517 | bool |
1518 | operator()(const _Sp& __lhs, const _Sp& __rhs) const noexcept |
1519 | { |
1520 | typedef typename _Sp::element_type element_type; |
1521 | return std::less<element_type*>()(__lhs.get(), __rhs.get()); |
1522 | } |
1523 | }; |
1524 | |
1525 | template<typename _Tp, _Lock_policy _Lp> |
1526 | struct less<__shared_ptr<_Tp, _Lp>> |
1527 | : public _Sp_less<__shared_ptr<_Tp, _Lp>> |
1528 | { }; |
1529 | |
1530 | // 20.7.2.2.8 shared_ptr specialized algorithms. |
1531 | template<typename _Tp, _Lock_policy _Lp> |
1532 | inline void |
1533 | swap(__shared_ptr<_Tp, _Lp>& __a, __shared_ptr<_Tp, _Lp>& __b) noexcept |
1534 | { __a.swap(__b); } |
1535 | |
1536 | // 20.7.2.2.9 shared_ptr casts |
1537 | |
1538 | // The seemingly equivalent code: |
1539 | // shared_ptr<_Tp, _Lp>(static_cast<_Tp*>(__r.get())) |
1540 | // will eventually result in undefined behaviour, attempting to |
1541 | // delete the same object twice. |
1542 | /// static_pointer_cast |
1543 | template<typename _Tp, typename _Tp1, _Lock_policy _Lp> |
1544 | inline __shared_ptr<_Tp, _Lp> |
1545 | static_pointer_cast(const __shared_ptr<_Tp1, _Lp>& __r) noexcept |
1546 | { |
1547 | using _Sp = __shared_ptr<_Tp, _Lp>; |
1548 | return _Sp(__r, static_cast<typename _Sp::element_type*>(__r.get())); |
1549 | } |
1550 | |
1551 | // The seemingly equivalent code: |
1552 | // shared_ptr<_Tp, _Lp>(const_cast<_Tp*>(__r.get())) |
1553 | // will eventually result in undefined behaviour, attempting to |
1554 | // delete the same object twice. |
1555 | /// const_pointer_cast |
1556 | template<typename _Tp, typename _Tp1, _Lock_policy _Lp> |
1557 | inline __shared_ptr<_Tp, _Lp> |
1558 | const_pointer_cast(const __shared_ptr<_Tp1, _Lp>& __r) noexcept |
1559 | { |
1560 | using _Sp = __shared_ptr<_Tp, _Lp>; |
1561 | return _Sp(__r, const_cast<typename _Sp::element_type*>(__r.get())); |
1562 | } |
1563 | |
1564 | // The seemingly equivalent code: |
1565 | // shared_ptr<_Tp, _Lp>(dynamic_cast<_Tp*>(__r.get())) |
1566 | // will eventually result in undefined behaviour, attempting to |
1567 | // delete the same object twice. |
1568 | /// dynamic_pointer_cast |
1569 | template<typename _Tp, typename _Tp1, _Lock_policy _Lp> |
1570 | inline __shared_ptr<_Tp, _Lp> |
1571 | dynamic_pointer_cast(const __shared_ptr<_Tp1, _Lp>& __r) noexcept |
1572 | { |
1573 | using _Sp = __shared_ptr<_Tp, _Lp>; |
1574 | if (auto* __p = dynamic_cast<typename _Sp::element_type*>(__r.get())) |
1575 | return _Sp(__r, __p); |
1576 | return _Sp(); |
1577 | } |
1578 | |
1579 | #if __cplusplus201103L > 201402L |
1580 | template<typename _Tp, typename _Tp1, _Lock_policy _Lp> |
1581 | inline __shared_ptr<_Tp, _Lp> |
1582 | reinterpret_pointer_cast(const __shared_ptr<_Tp1, _Lp>& __r) noexcept |
1583 | { |
1584 | using _Sp = __shared_ptr<_Tp, _Lp>; |
1585 | return _Sp(__r, reinterpret_cast<typename _Sp::element_type*>(__r.get())); |
1586 | } |
1587 | #endif |
1588 | |
1589 | template<typename _Tp, _Lock_policy _Lp> |
1590 | class __weak_ptr |
1591 | { |
1592 | template<typename _Yp, typename _Res = void> |
1593 | using _Compatible = typename |
1594 | enable_if<__sp_compatible_with<_Yp*, _Tp*>::value, _Res>::type; |
1595 | |
1596 | // Constraint for assignment from shared_ptr and weak_ptr: |
1597 | template<typename _Yp> |
1598 | using _Assignable = _Compatible<_Yp, __weak_ptr&>; |
1599 | |
1600 | public: |
1601 | using element_type = typename remove_extent<_Tp>::type; |
1602 | |
1603 | constexpr __weak_ptr() noexcept |
1604 | : _M_ptr(nullptr), _M_refcount() |
1605 | { } |
1606 | |
1607 | __weak_ptr(const __weak_ptr&) noexcept = default; |
1608 | |
1609 | ~__weak_ptr() = default; |
1610 | |
1611 | // The "obvious" converting constructor implementation: |
1612 | // |
1613 | // template<typename _Tp1> |
1614 | // __weak_ptr(const __weak_ptr<_Tp1, _Lp>& __r) |
1615 | // : _M_ptr(__r._M_ptr), _M_refcount(__r._M_refcount) // never throws |
1616 | // { } |
1617 | // |
1618 | // has a serious problem. |
1619 | // |
1620 | // __r._M_ptr may already have been invalidated. The _M_ptr(__r._M_ptr) |
1621 | // conversion may require access to *__r._M_ptr (virtual inheritance). |
1622 | // |
1623 | // It is not possible to avoid spurious access violations since |
1624 | // in multithreaded programs __r._M_ptr may be invalidated at any point. |
1625 | template<typename _Yp, typename = _Compatible<_Yp>> |
1626 | __weak_ptr(const __weak_ptr<_Yp, _Lp>& __r) noexcept |
1627 | : _M_refcount(__r._M_refcount) |
1628 | { _M_ptr = __r.lock().get(); } |
1629 | |
1630 | template<typename _Yp, typename = _Compatible<_Yp>> |
1631 | __weak_ptr(const __shared_ptr<_Yp, _Lp>& __r) noexcept |
1632 | : _M_ptr(__r._M_ptr), _M_refcount(__r._M_refcount) |
1633 | { } |
1634 | |
1635 | __weak_ptr(__weak_ptr&& __r) noexcept |
1636 | : _M_ptr(__r._M_ptr), _M_refcount(std::move(__r._M_refcount)) |
1637 | { __r._M_ptr = nullptr; } |
1638 | |
1639 | template<typename _Yp, typename = _Compatible<_Yp>> |
1640 | __weak_ptr(__weak_ptr<_Yp, _Lp>&& __r) noexcept |
1641 | : _M_ptr(__r.lock().get()), _M_refcount(std::move(__r._M_refcount)) |
1642 | { __r._M_ptr = nullptr; } |
1643 | |
1644 | __weak_ptr& |
1645 | operator=(const __weak_ptr& __r) noexcept = default; |
1646 | |
1647 | template<typename _Yp> |
1648 | _Assignable<_Yp> |
1649 | operator=(const __weak_ptr<_Yp, _Lp>& __r) noexcept |
1650 | { |
1651 | _M_ptr = __r.lock().get(); |
1652 | _M_refcount = __r._M_refcount; |
1653 | return *this; |
1654 | } |
1655 | |
1656 | template<typename _Yp> |
1657 | _Assignable<_Yp> |
1658 | operator=(const __shared_ptr<_Yp, _Lp>& __r) noexcept |
1659 | { |
1660 | _M_ptr = __r._M_ptr; |
1661 | _M_refcount = __r._M_refcount; |
1662 | return *this; |
1663 | } |
1664 | |
1665 | __weak_ptr& |
1666 | operator=(__weak_ptr&& __r) noexcept |
1667 | { |
1668 | _M_ptr = __r._M_ptr; |
1669 | _M_refcount = std::move(__r._M_refcount); |
1670 | __r._M_ptr = nullptr; |
1671 | return *this; |
1672 | } |
1673 | |
1674 | template<typename _Yp> |
1675 | _Assignable<_Yp> |
1676 | operator=(__weak_ptr<_Yp, _Lp>&& __r) noexcept |
1677 | { |
1678 | _M_ptr = __r.lock().get(); |
1679 | _M_refcount = std::move(__r._M_refcount); |
1680 | __r._M_ptr = nullptr; |
1681 | return *this; |
1682 | } |
1683 | |
1684 | __shared_ptr<_Tp, _Lp> |
1685 | lock() const noexcept |
1686 | { return __shared_ptr<element_type, _Lp>(*this, std::nothrow); } |
1687 | |
1688 | long |
1689 | use_count() const noexcept |
1690 | { return _M_refcount._M_get_use_count(); } |
1691 | |
1692 | bool |
1693 | expired() const noexcept |
1694 | { return _M_refcount._M_get_use_count() == 0; } |
1695 | |
1696 | template<typename _Tp1> |
1697 | bool |
1698 | owner_before(const __shared_ptr<_Tp1, _Lp>& __rhs) const noexcept |
1699 | { return _M_refcount._M_less(__rhs._M_refcount); } |
1700 | |
1701 | template<typename _Tp1> |
1702 | bool |
1703 | owner_before(const __weak_ptr<_Tp1, _Lp>& __rhs) const noexcept |
1704 | { return _M_refcount._M_less(__rhs._M_refcount); } |
1705 | |
1706 | void |
1707 | reset() noexcept |
1708 | { __weak_ptr().swap(*this); } |
1709 | |
1710 | void |
1711 | swap(__weak_ptr& __s) noexcept |
1712 | { |
1713 | std::swap(_M_ptr, __s._M_ptr); |
1714 | _M_refcount._M_swap(__s._M_refcount); |
1715 | } |
1716 | |
1717 | private: |
1718 | // Used by __enable_shared_from_this. |
1719 | void |
1720 | _M_assign(_Tp* __ptr, const __shared_count<_Lp>& __refcount) noexcept |
1721 | { |
1722 | if (use_count() == 0) |
1723 | { |
1724 | _M_ptr = __ptr; |
1725 | _M_refcount = __refcount; |
1726 | } |
1727 | } |
1728 | |
1729 | template<typename _Tp1, _Lock_policy _Lp1> friend class __shared_ptr; |
1730 | template<typename _Tp1, _Lock_policy _Lp1> friend class __weak_ptr; |
1731 | friend class __enable_shared_from_this<_Tp, _Lp>; |
1732 | friend class enable_shared_from_this<_Tp>; |
1733 | |
1734 | element_type* _M_ptr; // Contained pointer. |
1735 | __weak_count<_Lp> _M_refcount; // Reference counter. |
1736 | }; |
1737 | |
1738 | // 20.7.2.3.6 weak_ptr specialized algorithms. |
1739 | template<typename _Tp, _Lock_policy _Lp> |
1740 | inline void |
1741 | swap(__weak_ptr<_Tp, _Lp>& __a, __weak_ptr<_Tp, _Lp>& __b) noexcept |
1742 | { __a.swap(__b); } |
1743 | |
1744 | template<typename _Tp, typename _Tp1> |
1745 | struct _Sp_owner_less : public binary_function<_Tp, _Tp, bool> |
1746 | { |
1747 | bool |
1748 | operator()(const _Tp& __lhs, const _Tp& __rhs) const noexcept |
1749 | { return __lhs.owner_before(__rhs); } |
1750 | |
1751 | bool |
1752 | operator()(const _Tp& __lhs, const _Tp1& __rhs) const noexcept |
1753 | { return __lhs.owner_before(__rhs); } |
1754 | |
1755 | bool |
1756 | operator()(const _Tp1& __lhs, const _Tp& __rhs) const noexcept |
1757 | { return __lhs.owner_before(__rhs); } |
1758 | }; |
1759 | |
1760 | template<> |
1761 | struct _Sp_owner_less<void, void> |
1762 | { |
1763 | template<typename _Tp, typename _Up> |
1764 | auto |
1765 | operator()(const _Tp& __lhs, const _Up& __rhs) const noexcept |
1766 | -> decltype(__lhs.owner_before(__rhs)) |
1767 | { return __lhs.owner_before(__rhs); } |
1768 | |
1769 | using is_transparent = void; |
1770 | }; |
1771 | |
1772 | template<typename _Tp, _Lock_policy _Lp> |
1773 | struct owner_less<__shared_ptr<_Tp, _Lp>> |
1774 | : public _Sp_owner_less<__shared_ptr<_Tp, _Lp>, __weak_ptr<_Tp, _Lp>> |
1775 | { }; |
1776 | |
1777 | template<typename _Tp, _Lock_policy _Lp> |
1778 | struct owner_less<__weak_ptr<_Tp, _Lp>> |
1779 | : public _Sp_owner_less<__weak_ptr<_Tp, _Lp>, __shared_ptr<_Tp, _Lp>> |
1780 | { }; |
1781 | |
1782 | |
1783 | template<typename _Tp, _Lock_policy _Lp> |
1784 | class __enable_shared_from_this |
1785 | { |
1786 | protected: |
1787 | constexpr __enable_shared_from_this() noexcept { } |
1788 | |
1789 | __enable_shared_from_this(const __enable_shared_from_this&) noexcept { } |
1790 | |
1791 | __enable_shared_from_this& |
1792 | operator=(const __enable_shared_from_this&) noexcept |
1793 | { return *this; } |
1794 | |
1795 | ~__enable_shared_from_this() { } |
1796 | |
1797 | public: |
1798 | __shared_ptr<_Tp, _Lp> |
1799 | shared_from_this() |
1800 | { return __shared_ptr<_Tp, _Lp>(this->_M_weak_this); } |
1801 | |
1802 | __shared_ptr<const _Tp, _Lp> |
1803 | shared_from_this() const |
1804 | { return __shared_ptr<const _Tp, _Lp>(this->_M_weak_this); } |
1805 | |
1806 | #if __cplusplus201103L > 201402L || !defined(__STRICT_ANSI__1) // c++1z or gnu++11 |
1807 | __weak_ptr<_Tp, _Lp> |
1808 | weak_from_this() noexcept |
1809 | { return this->_M_weak_this; } |
1810 | |
1811 | __weak_ptr<const _Tp, _Lp> |
1812 | weak_from_this() const noexcept |
1813 | { return this->_M_weak_this; } |
1814 | #endif |
1815 | |
1816 | private: |
1817 | template<typename _Tp1> |
1818 | void |
1819 | _M_weak_assign(_Tp1* __p, const __shared_count<_Lp>& __n) const noexcept |
1820 | { _M_weak_this._M_assign(__p, __n); } |
1821 | |
1822 | friend const __enable_shared_from_this* |
1823 | __enable_shared_from_this_base(const __shared_count<_Lp>&, |
1824 | const __enable_shared_from_this* __p) |
1825 | { return __p; } |
1826 | |
1827 | template<typename, _Lock_policy> |
1828 | friend class __shared_ptr; |
1829 | |
1830 | mutable __weak_ptr<_Tp, _Lp> _M_weak_this; |
1831 | }; |
1832 | |
1833 | template<typename _Tp, _Lock_policy _Lp, typename _Alloc, typename... _Args> |
1834 | inline __shared_ptr<_Tp, _Lp> |
1835 | __allocate_shared(const _Alloc& __a, _Args&&... __args) |
1836 | { |
1837 | return __shared_ptr<_Tp, _Lp>(_Sp_make_shared_tag(), __a, |
1838 | std::forward<_Args>(__args)...); |
1839 | } |
1840 | |
1841 | template<typename _Tp, _Lock_policy _Lp, typename... _Args> |
1842 | inline __shared_ptr<_Tp, _Lp> |
1843 | __make_shared(_Args&&... __args) |
1844 | { |
1845 | typedef typename std::remove_const<_Tp>::type _Tp_nc; |
1846 | return std::__allocate_shared<_Tp, _Lp>(std::allocator<_Tp_nc>(), |
1847 | std::forward<_Args>(__args)...); |
1848 | } |
1849 | |
1850 | /// std::hash specialization for __shared_ptr. |
1851 | template<typename _Tp, _Lock_policy _Lp> |
1852 | struct hash<__shared_ptr<_Tp, _Lp>> |
1853 | : public __hash_base<size_t, __shared_ptr<_Tp, _Lp>> |
1854 | { |
1855 | size_t |
1856 | operator()(const __shared_ptr<_Tp, _Lp>& __s) const noexcept |
1857 | { |
1858 | return hash<typename __shared_ptr<_Tp, _Lp>::element_type*>()( |
1859 | __s.get()); |
1860 | } |
1861 | }; |
1862 | |
1863 | _GLIBCXX_END_NAMESPACE_VERSION |
1864 | } // namespace |
1865 | |
1866 | #endif // _SHARED_PTR_BASE_H |
1 | // Support for atomic operations -*- C++ -*- | |||
2 | ||||
3 | // Copyright (C) 2004-2017 Free Software Foundation, Inc. | |||
4 | // | |||
5 | // This file is part of the GNU ISO C++ Library. This library is free | |||
6 | // software; you can redistribute it and/or modify it under the | |||
7 | // terms of the GNU General Public License as published by the | |||
8 | // Free Software Foundation; either version 3, or (at your option) | |||
9 | // any later version. | |||
10 | ||||
11 | // This library is distributed in the hope that it will be useful, | |||
12 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | |||
13 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |||
14 | // GNU General Public License for more details. | |||
15 | ||||
16 | // Under Section 7 of GPL version 3, you are granted additional | |||
17 | // permissions described in the GCC Runtime Library Exception, version | |||
18 | // 3.1, as published by the Free Software Foundation. | |||
19 | ||||
20 | // You should have received a copy of the GNU General Public License and | |||
21 | // a copy of the GCC Runtime Library Exception along with this program; | |||
22 | // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see | |||
23 | // <http://www.gnu.org/licenses/>. | |||
24 | ||||
25 | /** @file ext/atomicity.h | |||
26 | * This file is a GNU extension to the Standard C++ Library. | |||
27 | */ | |||
28 | ||||
29 | #ifndef _GLIBCXX_ATOMICITY_H1 | |||
30 | #define _GLIBCXX_ATOMICITY_H1 1 | |||
31 | ||||
32 | #pragma GCC system_header | |||
33 | ||||
34 | #include <bits/c++config.h> | |||
35 | #include <bits/gthr.h> | |||
36 | #include <bits/atomic_word.h> | |||
37 | ||||
38 | namespace __gnu_cxx _GLIBCXX_VISIBILITY(default)__attribute__ ((__visibility__ ("default"))) | |||
39 | { | |||
40 | _GLIBCXX_BEGIN_NAMESPACE_VERSION | |||
41 | ||||
42 | // Functions for portable atomic access. | |||
43 | // To abstract locking primitives across all thread policies, use: | |||
44 | // __exchange_and_add_dispatch | |||
45 | // __atomic_add_dispatch | |||
46 | #ifdef _GLIBCXX_ATOMIC_BUILTINS1 | |||
47 | static inline _Atomic_word | |||
48 | __exchange_and_add(volatile _Atomic_word* __mem, int __val) | |||
49 | { return __atomic_fetch_add(__mem, __val, __ATOMIC_ACQ_REL4); } | |||
50 | ||||
51 | static inline void | |||
52 | __atomic_add(volatile _Atomic_word* __mem, int __val) | |||
53 | { __atomic_fetch_add(__mem, __val, __ATOMIC_ACQ_REL4); } | |||
54 | #else | |||
55 | _Atomic_word | |||
56 | __attribute__ ((__unused__)) | |||
57 | __exchange_and_add(volatile _Atomic_word*, int) throw (); | |||
58 | ||||
59 | void | |||
60 | __attribute__ ((__unused__)) | |||
61 | __atomic_add(volatile _Atomic_word*, int) throw (); | |||
62 | #endif | |||
63 | ||||
64 | static inline _Atomic_word | |||
65 | __exchange_and_add_single(_Atomic_word* __mem, int __val) | |||
66 | { | |||
67 | _Atomic_word __result = *__mem; | |||
| ||||
68 | *__mem += __val; | |||
69 | return __result; | |||
70 | } | |||
71 | ||||
72 | static inline void | |||
73 | __atomic_add_single(_Atomic_word* __mem, int __val) | |||
74 | { *__mem += __val; } | |||
75 | ||||
76 | static inline _Atomic_word | |||
77 | __attribute__ ((__unused__)) | |||
78 | __exchange_and_add_dispatch(_Atomic_word* __mem, int __val) | |||
79 | { | |||
80 | #ifdef __GTHREADS1 | |||
81 | if (__gthread_active_p()) | |||
82 | return __exchange_and_add(__mem, __val); | |||
83 | else | |||
84 | return __exchange_and_add_single(__mem, __val); | |||
85 | #else | |||
86 | return __exchange_and_add_single(__mem, __val); | |||
87 | #endif | |||
88 | } | |||
89 | ||||
90 | static inline void | |||
91 | __attribute__ ((__unused__)) | |||
92 | __atomic_add_dispatch(_Atomic_word* __mem, int __val) | |||
93 | { | |||
94 | #ifdef __GTHREADS1 | |||
95 | if (__gthread_active_p()) | |||
96 | __atomic_add(__mem, __val); | |||
97 | else | |||
98 | __atomic_add_single(__mem, __val); | |||
99 | #else | |||
100 | __atomic_add_single(__mem, __val); | |||
101 | #endif | |||
102 | } | |||
103 | ||||
104 | _GLIBCXX_END_NAMESPACE_VERSION | |||
105 | } // namespace | |||
106 | ||||
107 | // Even if the CPU doesn't need a memory barrier, we need to ensure | |||
108 | // that the compiler doesn't reorder memory accesses across the | |||
109 | // barriers. | |||
110 | #ifndef _GLIBCXX_READ_MEM_BARRIER__atomic_thread_fence (2) | |||
111 | #define _GLIBCXX_READ_MEM_BARRIER__atomic_thread_fence (2) __atomic_thread_fence (__ATOMIC_ACQUIRE2) | |||
112 | #endif | |||
113 | #ifndef _GLIBCXX_WRITE_MEM_BARRIER__atomic_thread_fence (3) | |||
114 | #define _GLIBCXX_WRITE_MEM_BARRIER__atomic_thread_fence (3) __atomic_thread_fence (__ATOMIC_RELEASE3) | |||
115 | #endif | |||
116 | ||||
117 | #endif |