/netbsd-current/external/apache2/llvm/dist/libcxx/src/ |
H A D | valarray.cpp | 25 size_t __k = __size_.size() != 0; local 27 __k *= __size_[__i]; 28 __1d_.resize(__k); 31 __k = 0; 32 __1d_[__k] = __start; 40 ++__k; 41 __1d_[__k] = __1d_[__k-1] + __stride_[__i]; 43 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
H A D | specfun.h | 358 comp_ellint_1f(float __k) argument 359 { return __detail::__comp_ellint_1<float>(__k); } 368 comp_ellint_1l(long double __k) argument 369 { return __detail::__comp_ellint_1<long double>(__k); } 385 * @tparam _Tp The floating-point type of the modulus @c __k. 386 * @param __k The modulus, <tt> abs(__k) <= 1 </tt> 387 * @throw std::domain_error if <tt> abs(__k) > 1 </tt>. 391 comp_ellint_1(_Tp __k) argument 394 return __detail::__comp_ellint_1<__type>(__k); 406 comp_ellint_2f(float __k) argument 416 comp_ellint_2l(long double __k) argument 438 comp_ellint_2(_Tp __k) argument 453 comp_ellint_3f(float __k, float __nu) argument 463 comp_ellint_3l(long double __k, long double __nu) argument 489 comp_ellint_3(_Tp __k, _Tpn __nu) argument 696 ellint_1f(float __k, float __phi) argument 706 ellint_1l(long double __k, long double __phi) argument 729 ellint_1(_Tp __k, _Tpp __phi) argument 744 ellint_2f(float __k, float __phi) argument 754 ellint_2l(long double __k, long double __phi) argument 777 ellint_2(_Tp __k, _Tpp __phi) argument 792 ellint_3f(float __k, float __nu, float __phi) argument 802 ellint_3l(long double __k, long double __nu, long double __phi) argument 830 ellint_3(_Tp __k, _Tpn __nu, _Tpp __phi) argument [all...] |
H A D | stl_map.h | 481 * @param __k The key for which data should be retrieved. 492 operator[](const key_type& __k) argument 497 iterator __i = lower_bound(__k); 498 // __i->first is greater than or equivalent to __k. 499 if (__i == end() || key_comp()(__k, (*__i).first)) 502 std::tuple<const key_type&>(__k), 505 __i = insert(__i, value_type(__k, mapped_type())); 512 operator[](key_type&& __k) argument 517 iterator __i = lower_bound(__k); 518 // __i->first is greater than or equivalent to __k 537 at(const key_type& __k) argument 691 try_emplace(const key_type& __k, _Args&&... __args) argument 708 try_emplace(key_type&& __k, _Args&&... __args) argument 751 try_emplace(const_iterator __hint, const key_type& __k, _Args&&... __args) argument 770 try_emplace(const_iterator __hint, key_type&& __k, _Args&&... __args) argument 918 insert_or_assign(const key_type& __k, _Obj&& __obj) argument 936 insert_or_assign(key_type&& __k, _Obj&& __obj) argument 973 insert_or_assign(const_iterator __hint, const key_type& __k, _Obj&& __obj) argument 994 insert_or_assign(const_iterator __hint, key_type&& __k, _Obj&& __obj) argument [all...] |
H A D | hashtable.h | 650 bucket(const key_type& __k) const 651 { return _M_bucket_index(__k, this->_M_hash_code(__k)); } 708 find(const key_type& __k); 711 find(const key_type& __k) const; 714 count(const key_type& __k) const; 717 equal_range(const key_type& __k); 720 equal_range(const key_type& __k) const; 729 _M_bucket_index(const key_type& __k, __hash_code __c) const argument 730 { return __hash_code_base::_M_bucket_index(__k, __ 858 erase(const key_type& __k) argument 886 const key_type& __k = __nh._M_key(); local 915 const key_type& __k = __nh._M_key(); local 956 extract(const _Key& __k) argument 979 const key_type& __k = this->_M_extract()(*__pos); local 1729 const key_type& __k = this->_M_extract()(__node._M_node->_M_v()); local 1755 const key_type& __k = this->_M_extract()(__node._M_node->_M_v()); local 1861 const key_type& __k = this->_M_extract()(__v); local 1894 const key_type& __k = this->_M_extract()(__node._M_node->_M_v()); local [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | specfun.h | 358 comp_ellint_1f(float __k) argument 359 { return __detail::__comp_ellint_1<float>(__k); } 368 comp_ellint_1l(long double __k) argument 369 { return __detail::__comp_ellint_1<long double>(__k); } 385 * @tparam _Tp The floating-point type of the modulus @c __k. 386 * @param __k The modulus, <tt> abs(__k) <= 1 </tt> 387 * @throw std::domain_error if <tt> abs(__k) > 1 </tt>. 391 comp_ellint_1(_Tp __k) argument 394 return __detail::__comp_ellint_1<__type>(__k); 406 comp_ellint_2f(float __k) argument 416 comp_ellint_2l(long double __k) argument 438 comp_ellint_2(_Tp __k) argument 453 comp_ellint_3f(float __k, float __nu) argument 463 comp_ellint_3l(long double __k, long double __nu) argument 489 comp_ellint_3(_Tp __k, _Tpn __nu) argument 696 ellint_1f(float __k, float __phi) argument 706 ellint_1l(long double __k, long double __phi) argument 729 ellint_1(_Tp __k, _Tpp __phi) argument 744 ellint_2f(float __k, float __phi) argument 754 ellint_2l(long double __k, long double __phi) argument 777 ellint_2(_Tp __k, _Tpp __phi) argument 792 ellint_3f(float __k, float __nu, float __phi) argument 802 ellint_3l(long double __k, long double __nu, long double __phi) argument 830 ellint_3(_Tp __k, _Tpn __nu, _Tpp __phi) argument [all...] |
H A D | stl_map.h | 491 * @param __k The key for which data should be retrieved. 502 operator[](const key_type& __k) argument 507 iterator __i = lower_bound(__k); 508 // __i->first is greater than or equivalent to __k. 509 if (__i == end() || key_comp()(__k, (*__i).first)) 512 std::tuple<const key_type&>(__k), 515 __i = insert(__i, value_type(__k, mapped_type())); 522 operator[](key_type&& __k) argument 527 iterator __i = lower_bound(__k); 528 // __i->first is greater than or equivalent to __k 547 at(const key_type& __k) argument 595 const key_type& __k = __a; local 721 try_emplace(const key_type& __k, _Args&&... __args) argument 738 try_emplace(key_type&& __k, _Args&&... __args) argument 781 try_emplace(const_iterator __hint, const key_type& __k, _Args&&... __args) argument 800 try_emplace(const_iterator __hint, key_type&& __k, _Args&&... __args) argument 854 const key_type& __k = __x.first; local 966 insert_or_assign(const key_type& __k, _Obj&& __obj) argument 984 insert_or_assign(key_type&& __k, _Obj&& __obj) argument 1021 insert_or_assign(const_iterator __hint, const key_type& __k, _Obj&& __obj) argument 1042 insert_or_assign(const_iterator __hint, key_type&& __k, _Obj&& __obj) argument [all...] |
H A D | stl_tree.h | 831 _M_get_insert_unique_pos(const key_type& __k); 834 _M_get_insert_equal_pos(const key_type& __k); 838 const key_type& __k); 842 const key_type& __k); 911 const _Key& __k); 915 const _Key& __k) const; 919 const _Key& __k); 923 const _Key& __k) const; 1262 find(const key_type& __k); 1265 find(const key_type& __k) cons [all...] |
H A D | hashtable.h | 684 bucket(const key_type& __k) const 685 { return _M_bucket_index(this->_M_hash_code(__k)); } 742 find(const key_type& __k); 745 find(const key_type& __k) const; 748 count(const key_type& __k) const; 751 equal_range(const key_type& __k); 754 equal_range(const key_type& __k) const; 763 _M_find_tr(const _Kt& __k); 769 _M_find_tr(const _Kt& __k) const; 775 _M_count_tr(const _Kt& __k) cons 890 _S_forward_key(_Kt&& __k) argument 894 _S_forward_key(const key_type& __k) argument 898 _S_forward_key(key_type&& __k) argument 972 erase(const key_type& __k) argument 1000 const key_type& __k = __nh._M_key(); local 1029 const key_type& __k = __nh._M_key(); local 1070 extract(const _Key& __k) argument 1093 const key_type& __k = _ExtractKey{}(*__pos); local 2064 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v()); local 2100 const key_type& __k = _ExtractKey{}(__node._M_node->_M_v()); local 2186 const key_type& __k = _ExtractKey{}(__node->_M_v()); local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
H A D | search.h | 59 _DifferenceType __k = 0; local 62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1])) 63 __k = __off[__k]; 64 __off[__j] = ++__k;
|
H A D | losertree.h | 91 * @param __k The number of sequences to merge. 94 _LoserTreeBase(unsigned int __k, _Compare __comp) argument 97 _M_ik = __k; 179 _LoserTree(unsigned int __k, _Compare __comp) argument 180 : _Base::_LoserTreeBase(__k, __comp) 272 _LoserTree(unsigned int __k, _Compare __comp) argument 273 : _Base::_LoserTreeBase(__k, __comp) 373 _LoserTreePointerBase(unsigned int __k, argument 377 _M_ik = __k; 418 _LoserTreePointer(unsigned int __k, _Compar argument 500 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()) argument 588 _LoserTreeUnguardedBase(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 655 _LoserTreeUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 743 _LoserTreeUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 843 _LoserTreePointerUnguardedBase(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 900 _LoserTreePointerUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 986 _LoserTreePointerUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
H A D | search.h | 59 _DifferenceType __k = 0; local 62 while ((__k >= 0) && !(__elements[__k] == __elements[__j-1])) 63 __k = __off[__k]; 64 __off[__j] = ++__k;
|
H A D | losertree.h | 91 * @param __k The number of sequences to merge. 94 _LoserTreeBase(unsigned int __k, _Compare __comp) argument 97 _M_ik = __k; 179 _LoserTree(unsigned int __k, _Compare __comp) argument 180 : _Base::_LoserTreeBase(__k, __comp) 272 _LoserTree(unsigned int __k, _Compare __comp) argument 273 : _Base::_LoserTreeBase(__k, __comp) 373 _LoserTreePointerBase(unsigned int __k, argument 377 _M_ik = __k; 418 _LoserTreePointer(unsigned int __k, _Compar argument 500 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>()) argument 588 _LoserTreeUnguardedBase(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 655 _LoserTreeUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 743 _LoserTreeUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 843 _LoserTreePointerUnguardedBase(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 900 _LoserTreePointerUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument 986 _LoserTreePointerUnguarded(unsigned int __k, const _Tp& __sentinel, _Compare __comp = std::less<_Tp>()) argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/experimental/bits/ |
H A D | simd_neon.h | 61 _S_masked_load(_SimdWrapper<_Tp, _Np> __merge, _MaskMember<_Tp> __k, 65 if (__k[__i] != 0) 76 _MaskMember<_Tp> __k) 79 if (__k[__i] != 0) 403 _GLIBCXX_SIMD_INTRINSIC static bool _S_all_of(simd_mask<_Tp, _Abi> __k) argument 406 = __vector_bitcast<char>(__k._M_data) 408 if constexpr (sizeof(__k) == 16) 413 else if constexpr (sizeof(__k) <= 8) 422 _GLIBCXX_SIMD_INTRINSIC static bool _S_any_of(simd_mask<_Tp, _Abi> __k) argument 425 = __vector_bitcast<char>(__k 75 _S_masked_store_nocvt(_SimdWrapper<_Tp, _Np> __v, _Tp* __mem, _MaskMember<_Tp> __k) argument 441 _S_none_of(simd_mask<_Tp, _Abi> __k) argument 458 _S_some_of(simd_mask<_Tp, _Abi> __k) argument 475 _S_popcount(simd_mask<_Tp, _Abi> __k) argument 508 _S_find_first_set(simd_mask<_Tp, _Abi> __k) argument 518 _S_find_last_set(simd_mask<_Tp, _Abi> __k) argument [all...] |
H A D | simd_x86.h | 323 __maskload_epi32(const int* __ptr, _Tp __k) argument 325 if constexpr (sizeof(__k) == 16) 326 return _mm_maskload_epi32(__ptr, __k); 328 return _mm256_maskload_epi32(__ptr, __k); 335 __maskload_epi64(const _LLong* __ptr, _Tp __k) argument 337 if constexpr (sizeof(__k) == 16) 338 return _mm_maskload_epi64(__ptr, __k); 340 return _mm256_maskload_epi64(__ptr, __k); 347 __maskload_ps(const float* __ptr, _Tp __k) argument 349 if constexpr (sizeof(__k) 359 __maskload_pd(const double* __ptr, _Tp __k) argument 762 _S_blend(_SimdWrapper<bool, _Np> __k, _SimdWrapper<_Tp, _Np> __at0, _SimdWrapper<_Tp, _Np> __at1) argument 787 _S_blend(_SimdWrapper<__int_for_sizeof_t<_Tp>, _Np> __k, _SimdWrapper<_Tp, _Np> __at0, _SimdWrapper<_Tp, _Np> __at1) argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/ |
H A D | parallel_impl.h | 46 const _DifferenceType __k = __res - __first; local 47 for (_DifferenceType __old = __extremum; __comp(__k, __old); 50 __extremum.compare_exchange_weak(__old, __k);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/ |
H A D | parallel_impl.h | 46 const _DifferenceType __k = __res - __first; local 47 for (_DifferenceType __old = __extremum; __comp(__k, __old); 50 __extremum.compare_exchange_weak(__old, __k);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/tr1/ |
H A D | hashtable_policy.h | 508 operator[](const _Key& __k); 515 operator[](const _Key& __k) argument 518 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k); 519 std::size_t __n = __h->_M_bucket_index(__k, __code, 523 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 525 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()), 591 _M_bucket_index(const _Key& __k, _Hash_code_type, argument 593 { return _M_ranged_hash(__k, __n); } 601 _M_compare(const _Key& __k, _Hash_code_type, argument 603 { return _M_eq(__k, _M_extrac 680 _M_compare(const _Key& __k, _Hash_code_type, _Hash_node<_Value, false>* __n) const argument 747 _M_compare(const _Key& __k, _Hash_code_type __c, _Hash_node<_Value, true>* __n) const argument [all...] |
H A D | hashtable.h | 290 bucket(const key_type& __k) const 292 return this->_M_bucket_index(__k, this->_M_hash_code(__k), 331 find(const key_type& __k); 334 find(const key_type& __k) const; 337 count(const key_type& __k) const; 340 equal_range(const key_type& __k); 343 equal_range(const key_type& __k) const; 704 find(const key_type& __k) argument 706 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); 763 equal_range(const key_type& __k) argument 836 _M_find_node(_Node* __p, const key_type& __k, typename _Hashtable::_Hash_code_type __code) const argument 870 const key_type& __k = this->_M_extract(__v); local 901 const key_type& __k = this->_M_extract(__v); local 928 const key_type& __k = this->_M_extract(__v); local 1044 erase(const key_type& __k) argument [all...] |
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/tr1/ |
H A D | hashtable_policy.h | 508 operator[](const _Key& __k); 515 operator[](const _Key& __k) argument 518 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k); 519 std::size_t __n = __h->_M_bucket_index(__k, __code, 523 __h->_M_find_node(__h->_M_buckets[__n], __k, __code); 525 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()), 591 _M_bucket_index(const _Key& __k, _Hash_code_type, argument 593 { return _M_ranged_hash(__k, __n); } 601 _M_compare(const _Key& __k, _Hash_code_type, argument 603 { return _M_eq(__k, _M_extrac 680 _M_compare(const _Key& __k, _Hash_code_type, _Hash_node<_Value, false>* __n) const argument 747 _M_compare(const _Key& __k, _Hash_code_type __c, _Hash_node<_Value, true>* __n) const argument [all...] |
H A D | hashtable.h | 290 bucket(const key_type& __k) const 292 return this->_M_bucket_index(__k, this->_M_hash_code(__k), 331 find(const key_type& __k); 334 find(const key_type& __k) const; 337 count(const key_type& __k) const; 340 equal_range(const key_type& __k); 343 equal_range(const key_type& __k) const; 704 find(const key_type& __k) argument 706 typename _Hashtable::_Hash_code_type __code = this->_M_hash_code(__k); 763 equal_range(const key_type& __k) argument 836 _M_find_node(_Node* __p, const key_type& __k, typename _Hashtable::_Hash_code_type __code) const argument 870 const key_type& __k = this->_M_extract(__v); local 901 const key_type& __k = this->_M_extract(__v); local 928 const key_type& __k = this->_M_extract(__v); local 1044 erase(const key_type& __k) argument [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/config/locale/dragonfly/ |
H A D | ctype_members.cc | 273 for (size_t __k = 0; __k <= 11; ++__k) 275 _M_bit[__k] = static_cast<mask>(_ISbit(__k)); 276 _M_wmask[__k] = _M_convert_to_wmask(_M_bit[__k]);
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/config/locale/gnu/ |
H A D | ctype_members.cc | 294 for (size_t __k = 0; __k <= 11; ++__k) 296 _M_bit[__k] = static_cast<mask>(_ISbit(__k)); 297 _M_wmask[__k] = _M_convert_to_wmask(_M_bit[__k]);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/config/locale/dragonfly/ |
H A D | ctype_members.cc | 273 for (size_t __k = 0; __k <= 11; ++__k) 275 _M_bit[__k] = static_cast<mask>(_ISbit(__k)); 276 _M_wmask[__k] = _M_convert_to_wmask(_M_bit[__k]);
|
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/config/locale/gnu/ |
H A D | ctype_members.cc | 294 for (size_t __k = 0; __k <= 11; ++__k) 296 _M_bit[__k] = static_cast<mask>(_ISbit(__k)); 297 _M_wmask[__k] = _M_convert_to_wmask(_M_bit[__k]);
|
/netbsd-current/sys/external/bsd/drm2/include/linux/ |
H A D | interval_tree_generic.h | 64 const KT *__k = __vk; \ 67 if (__nlast < *__k) \ 69 if (*__k < __nstart) \
|