Home
last modified time | relevance | path

Searched refs:_Dp (Results 1 – 23 of 23) sorted by relevance

/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Ddebug-info-template-partial-specialization.cpp4 template <class _Tp, class _Dp, bool > struct __pointer_type1 {};
9 template <class _Tp, class _Dp> struct __pointer_type1<_Tp, _Dp, false>
14 template <class _Tp, class _Dp>
21 typedef typename __pointer_type_imp::__pointer_type1<_Tp, _Dp, false>::type type;
24 template <class _Tp, class _Dp = default_delete<_Tp> > class unique_ptr
26 typedef typename __pointer_type2<_Tp, _Dp>::type pointer;
27 unique_ptr(pointer __p, _Dp __d) {} in unique_ptr()
/llvm-project-15.0.7/libcxx/include/__random/
H A Dshuffle_order_engine.h41 template <uint64_t _Np, uint64_t _Dp>
44 static_assert(_Dp != 0, "__uratio divide by 0");
45 static _LIBCPP_CONSTEXPR const uint64_t __gcd = __ugcd<_Np, _Dp>::value;
48 static _LIBCPP_CONSTEXPR const uint64_t den = _Dp / __gcd;
174 template <uint64_t _Np, uint64_t _Dp>
178 (__uratio<_Np, _Dp>::num > 0xFFFFFFFFFFFFFFFFull / (_Max - _Min)),
181 __eval(__uratio<_Np, _Dp>)
182 {return __evalf<__uratio<_Np, _Dp>::num, __uratio<_Np, _Dp>::den>();}
184 template <uint64_t _Np, uint64_t _Dp>
188 __uratio<_Np, _Dp>::num <= 0xFFFFFFFFFFFFFFFFull / (_Max - _Min),
[all …]
H A Dmersenne_twister_engine.h37 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
46 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
57 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
66 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
161 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
171 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
182 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
417 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
461 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
475 _UInt _Ap, size_t _Up, _UInt _Dp, size_t _Sp,
[all …]
/llvm-project-15.0.7/libcxx/include/
H A D__bit_reference113 template <class _Cp, class _Dp>
1275 template <class _Dp>
1279 template <class _Dp>
1285 friend __bit_iterator<_Dp, false> __copy_aligned(__bit_iterator<_Dp, _IC> __first,
1290 friend __bit_iterator<_Dp, false> __copy_unaligned(__bit_iterator<_Dp, _IC> __first,
1295 friend __bit_iterator<_Dp, false> copy(__bit_iterator<_Dp, _IC> __first,
1310 friend __bit_iterator<_Dp, false> copy_backward(__bit_iterator<_Dp, _IC> __first,
1322 template <class _Dp>
1324 friend __bit_iterator<_Dp, false> rotate(__bit_iterator<_Dp, false>,
1344 …friend __bit_iterator<_Dp, _IC> __find_bool_true(__bit_iterator<_Dp, _IC>, typename _Dp::size_type…
[all …]
H A Dforward_list925 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
947 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
1138 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1154 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1168 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1195 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1210 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1226 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1243 unique_ptr<__node, _Dp> __h(__node_traits::allocate(__a, 1), _Dp(__a, 1));
1382 unique_ptr<__node, _Dp> __h(nullptr, _Dp(__a, 1));
[all …]
H A Dany468 typedef __allocator_destructor<_Alloc> _Dp;
470 unique_ptr<_Tp, _Dp> __hold(_ATraits::allocate(__a, 1), _Dp(__a, 1));
H A Dfuture1768 typedef __allocator_destructor<_Ap> _Dp;
1769 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
1792 typedef __allocator_destructor<_Ap> _Dp;
1793 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
H A Dostream1113 template<class _CharT, class _Traits, class _Yp, class _Dp>
1117 …val<basic_ostream<_CharT, _Traits>&>() << declval<typename unique_ptr<_Yp, _Dp>::pointer>()))>::ty…
1120 operator<<(basic_ostream<_CharT, _Traits>& __os, unique_ptr<_Yp, _Dp> const& __p)
H A Ddeque480 template <class _Vp, class _Pp, class _Rp, class _MP, class _Dp, _Dp>
2465 typedef __allocator_destructor<_Allocator> _Dp;
2466 unique_ptr<pointer, _Dp> __hold(
2468 _Dp(__a, __base::__block_size));
2608 typedef __allocator_destructor<_Allocator> _Dp;
2609 unique_ptr<pointer, _Dp> __hold(
2611 _Dp(__a, __base::__block_size));
H A D__hash_table1190 typedef __hash_node_destructor<__node_allocator> _Dp;
1191 typedef unique_ptr<__node, _Dp> __node_holder;
2364 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2381 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2506 return __node_holder(__cn->__upcast(), _Dp(__node_alloc(), true));
H A Dmap1543 typedef __map_node_destructor<__node_allocator> _Dp;
1544 typedef unique_ptr<__node, _Dp> __node_holder;
1621 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2213 typedef __map_node_destructor<__node_allocator> _Dp;
2214 typedef unique_ptr<__node, _Dp> __node_holder;
H A Dunordered_map1061 typedef __hash_map_node_destructor<__node_allocator> _Dp;
1062 typedef unique_ptr<__node, _Dp> __node_holder;
1824 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
1949 typedef __hash_map_node_destructor<__node_allocator> _Dp;
1950 typedef unique_ptr<__node, _Dp> __node_holder;
H A D__tree1418 typedef __tree_node_destructor<__node_allocator> _Dp;
1419 typedef unique_ptr<__node, _Dp> __node_holder;
2132 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2728 return __node_holder(__np, _Dp(__node_alloc(), true));
/llvm-project-15.0.7/libcxx/include/__memory/
H A Dunique_ptr.h112 typedef _Dp deleter_type;
155 (is_reference<_Dp>::value && is_same<_Dp, _UDel>::value) ||
156 (!is_reference<_Dp>::value && is_convertible<_UDel, _Dp>::value)
315 template <class _Tp, class _Dp>
319 typedef _Dp deleter_type;
377 (is_reference<_Dp>::value && is_same<_Dp, _UDel>::value) ||
378 (!is_reference<_Dp>::value && is_convertible<_UDel, _Dp>::value)
547 template <class _Tp, class _Dp>
550 __is_swappable<_Dp>::value,
553 swap(unique_ptr<_Tp, _Dp>& __x, unique_ptr<_Tp, _Dp>& __y) _NOEXCEPT {__x.swap(__y);}
[all …]
H A Dshared_ptr.h264 __data_.first().second().~_Dp(); in __on_zero_shared()
393 template <class _Dp, class _Pt,
400 template <class _Dp, class _Pt>
467 shared_ptr(_Yp* __p, _Dp __d)
524 template<class _Dp>
550 template<class _Dp, class _Alloc>
784 void reset(_Yp* __p, _Dp __d)
867 template <class _Dp>
939 template<class _Tp, class _Dp>
1376 template<class _Dp, class _Tp>
[all …]
/llvm-project-15.0.7/libcxx/include/__compare/
H A Dstrong_order.h45 template<class _Tp, class _Up, class _Dp = decay_t<_Tp>>
46 requires is_same_v<_Dp, decay_t<_Up>> && is_floating_point_v<_Dp>
50 if constexpr (numeric_limits<_Dp>::is_iec559 && sizeof(_Dp) == sizeof(int32_t)) { in __go()
56 } else if constexpr (numeric_limits<_Dp>::is_iec559 && sizeof(_Dp) == sizeof(int64_t)) { in __go()
67 if constexpr (numeric_limits<_Dp>::radix == 2) { in __go()
94 …static_assert(sizeof(_Dp) == 0, "std::strong_order is unimplemented for this floating-point type"); in __go()
H A Dweak_order.h40 template<class _Tp, class _Up, class _Dp = decay_t<_Tp>>
41 requires is_same_v<_Dp, decay_t<_Up>> && is_floating_point_v<_Dp>
/llvm-project-15.0.7/libcxx/include/__type_traits/
H A Dis_base_of.h21 template <class _Bp, class _Dp>
23 : public integral_constant<bool, __is_base_of(_Bp, _Dp)> {};
26 template <class _Bp, class _Dp>
27 inline constexpr bool is_base_of_v = __is_base_of(_Bp, _Dp);
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dshuffle.h100 typedef uniform_int_distribution<ptrdiff_t> _Dp; in random_shuffle() typedef
101 typedef typename _Dp::param_type _Pp; in random_shuffle()
105 _Dp __uid; in random_shuffle()
143 typedef uniform_int_distribution<ptrdiff_t> _Dp; in __shuffle() typedef
144 typedef typename _Dp::param_type _Pp; in __shuffle()
151 _Dp __uid; in __shuffle()
/llvm-project-15.0.7/libcxx/include/__concepts/
H A Dderived_from.h25 template<class _Dp, class _Bp>
27 is_base_of_v<_Bp, _Dp> &&
28 is_convertible_v<const volatile _Dp*, const volatile _Bp*>;
/llvm-project-15.0.7/libcxx/include/__format/
H A Dformat_arg.h153 using _Dp = remove_cvref_t<_Tp>; in __handle()
154 using _Formatter = typename _Context::template formatter_type<_Dp>; in __handle()
156 requires { _Formatter().format(declval<const _Dp&>(), declval<_Context&>()); }; in __handle()
157 using _Qp = conditional_t<__const_formattable, const _Dp, _Dp>; in __handle()
163 __ctx.advance_to(__f.format(*const_cast<_Qp*>(static_cast<const _Dp*>(__ptr)), __ctx)); in __handle()
/llvm-project-15.0.7/libcxx/include/__functional/
H A Dfunction.h198 unique_ptr<__alloc_func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
325 unique_ptr<__func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
1364 unique_ptr<__func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
1450 unique_ptr<__func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
1536 unique_ptr<__func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
1622 unique_ptr<__func, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
1798 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
1825 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
2076 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
2103 unique_ptr<__base, _Dp> __hold(__a.allocate(1), _Dp(__a, 1));
[all …]
/llvm-project-15.0.7/libcxx/include/ext/
H A Dhash_map503 typedef __hash_map_node_destructor<__node_allocator> _Dp;
504 typedef std::unique_ptr<__node, _Dp> __node_holder;
675 __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
774 typedef __hash_map_node_destructor<__node_allocator> _Dp;
775 typedef std::unique_ptr<__node, _Dp> __node_holder;