Home
last modified time | relevance | path

Searched refs:__ptr_ (Results 1 – 16 of 16) sorted by relevance

/freebsd-13.1/contrib/llvm-project/libcxx/include/__memory/
H A Dauto_ptr.h28 _Tp* __ptr_; member
35 _Tp* __ptr_;
42 : __ptr_(__p.release()) {} in auto_ptr()
48 {reset(__p.__ptr_); return *this;}
52 {return *__ptr_;}
57 _Tp* __t = __ptr_; in release()
58 __ptr_ = nullptr; in release()
63 if (__ptr_ != __p)
64 delete __ptr_; variable
65 __ptr_ = __p;
[all …]
H A Dunique_ptr.h196 : __ptr_(__p, __d) {}
283 return *__ptr_.first();
287 return __ptr_.first();
291 return __ptr_.first();
295 return __ptr_.second();
299 return __ptr_.second();
316 __ptr_.first() = __p;
323 __ptr_.swap(__u.__ptr_);
510 return __ptr_.first();
541 __ptr_.first() = __p;
[all …]
H A Dallocation_guard.h57 … , __ptr_(allocator_traits<_Alloc>::allocate(__alloc_, __n_)) // initialization order is important in __allocation_guard()
62 if (__ptr_ != nullptr) { in ~__allocation_guard()
63 allocator_traits<_Alloc>::deallocate(__alloc_, __ptr_, __n_); in ~__allocation_guard()
69 _Pointer __tmp = __ptr_; in __release_ptr()
70 __ptr_ = nullptr; in __release_ptr()
76 return __ptr_; in __get()
82 _Pointer __ptr_; member
H A Dshared_ptr.h846 : __ptr_(__r.__ptr_),
859 : __ptr_(__r.__ptr_),
869 : __ptr_(__r.__ptr_),
882 : __ptr_(__r.__ptr_),
1426 : __ptr_(__r.__ptr_),
1439 : __ptr_(__r.__ptr_),
1452 : __ptr_(__r.__ptr_),
1462 : __ptr_(__r.__ptr_),
1475 : __ptr_(__r.__ptr_),
1578 : __ptr_(__r.__ptr_),
[all …]
/freebsd-13.1/contrib/llvm-project/libcxx/src/support/runtime/
H A Dexception_pointer_cxxabi.ipp17 __cxa_decrement_exception_refcount(__ptr_);
21 : __ptr_(other.__ptr_)
23 __cxa_increment_exception_refcount(__ptr_);
28 if (__ptr_ != other.__ptr_)
31 __cxa_decrement_exception_refcount(__ptr_);
32 __ptr_ = other.__ptr_;
38 : __ptr_(current_exception())
50 if (__ptr_ == nullptr)
52 rethrow_exception(__ptr_);
61 ptr.__ptr_ = __cxa_current_primary_exception();
[all …]
H A Dexception_pointer_glibcxx.ipp26 void* __ptr_;
43 : __ptr_(other.__ptr_)
57 : __ptr_(current_exception())
66 if (__ptr_ == nullptr)
68 rethrow_exception(__ptr_);
H A Dexception_pointer_unimplemented.ipp23 : __ptr_(other.__ptr_)
38 : __ptr_(current_exception())
58 if (__ptr_ == nullptr)
60 rethrow_exception(__ptr_);
H A Dexception_pointer_msvc.ipp75 nested_exception::nested_exception() noexcept : __ptr_(current_exception()) {}
81 if (__ptr_ == nullptr)
83 rethrow_exception(__ptr_);
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A D__node_handle56 __node_pointer_type __ptr_ = nullptr;
62 __ptr_ = nullptr;
69 if (__ptr_ != nullptr)
75 __alloc, true)(__ptr_);
76 __ptr_ = nullptr;
93 : __ptr_(__other.__ptr_),
96 __other.__ptr_ = nullptr;
111 __ptr_ = __other.__ptr_;
117 __other.__ptr_ = nullptr;
138 swap(__ptr_, __other.__ptr_);
[all …]
H A Dlist331 : __ptr_(__p.__ptr_)
348 __ptr_ = __p.__ptr_;
381 __ptr_ = __ptr_->__next_;
394 __ptr_ = __ptr_->__prev_;
448 : __ptr_(__p.__ptr_)
459 : __ptr_(__p.__ptr_)
476 __ptr_ = __p.__ptr_;
508 __ptr_ = __ptr_->__next_;
1526 __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
1592 __link_nodes(__p.__ptr_, __r.__ptr_, __e.__ptr_);
[all …]
H A Dexception145 void* __ptr_;
147 _LIBCPP_INLINE_VISIBILITY exception_ptr() _NOEXCEPT : __ptr_() {}
148 _LIBCPP_INLINE_VISIBILITY exception_ptr(nullptr_t) _NOEXCEPT : __ptr_() {}
155 {return __ptr_ != nullptr;}
159 {return __x.__ptr_ == __y.__ptr_;}
240 exception_ptr __ptr_;
249 _LIBCPP_INLINE_VISIBILITY exception_ptr nested_ptr() const _NOEXCEPT {return __ptr_;}
H A D__tree821 __iter_pointer __ptr_;
832 : __ptr_(nullptr)
863 {return __x.__ptr_ == __y.__ptr_;}
894 __iter_pointer __ptr_;
905 : __ptr_(nullptr)
915 : __ptr_(__p.__ptr_) {}
946 {return __x.__ptr_ == __y.__ptr_;}
954 : __ptr_(__p) {}
957 : __ptr_(__p) {}
2251 __begin_node() = __r.__ptr_;
[all …]
H A Dforward_list297 __iter_node_pointer __ptr_;
315 : __ptr_(__traits::__as_iter_node(__p)) {}
319 : __ptr_(__traits::__as_iter_node(__p)) {}
345 __ptr_ = __traits::__as_iter_node(__ptr_->__next_);
359 {return __x.__ptr_ == __y.__ptr_;}
379 __iter_node_pointer __ptr_;
392 : __ptr_(nullptr) {}
396 : __ptr_(__traits::__as_iter_node(__p)) {}
418 : __ptr_(__p.__ptr_) {}
429 __ptr_ = __traits::__as_iter_node(__ptr_->__next_);
[all …]
H A Ddeque304 pointer __ptr_;
322 : __m_iter_(__it.__m_iter_), __ptr_(__it.__ptr_) {}
332 __ptr_ = *__m_iter_;
346 if (__ptr_ == *__m_iter_)
351 --__ptr_;
420 {return __x.__ptr_ == __y.__ptr_;}
429 (__x.__m_iter_ == __y.__m_iter_ && __x.__ptr_ < __y.__ptr_);}
574 pointer __rb = __r.__ptr_;
604 pointer __fb = __f.__ptr_;
632 pointer __fb = __f.__ptr_;
[all …]
H A D__hash_table2182 pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_);
2197 pair<iterator, bool> __result = __node_insert_unique(__nh.__ptr_);
2262 iterator __result = __node_insert_multi(__nh.__ptr_);
2276 iterator __result = __node_insert_multi(__hint, __nh.__ptr_);
/freebsd-13.1/contrib/llvm-project/libcxx/include/experimental/
H A Dsimd829 __simd_storage<_Tp, _Abi>* __ptr_;
833 : __ptr_(__ptr), __index_(__index) {}
841 operator _Vp() const { return __ptr_->__get(__index_); }
844 __ptr_->__set(__index_, __value);
849 return std::move(*this) = __ptr_->__get(__index_) + 1;
853 auto __val = __ptr_->__get(__index_);
854 __ptr_->__set(__index_, __val + 1);
859 return std::move(*this) = __ptr_->__get(__index_) - 1;
863 auto __val = __ptr_->__get(__index_);
864 __ptr_->__set(__index_, __val - 1);
[all …]