Searched refs:__n (Results 276 - 300 of 368) sorted by relevance

<<1112131415

/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
H A Dboost_concept_check.h624 _Tp& __j = __i += __n; // require assignment addition operator
625 __i = __i + __n; __i = __n + __i; // require addition with difference type
626 _Tp& __k = __i -= __n; // require assignment subtraction op
627 __i = __i - __n; // require subtraction with
629 __n = __i - __j; // require difference operator
630 _Ref __r = __i[__n]; // require element access operator
634 typename std::iterator_traits<_Tp>::difference_type __n;
645 typename std::iterator_traits<_Tp>::difference_type __n;
669 __n
[all...]
H A Dutility.h114 size_t __n = __sz; local
119 if (__n < __sz) // more than one _Tp found
121 __n = __i;
124 return __n;
H A Dshared_ptr.h960 _M_weak_assign(_Tp1* __p, const __shared_count<>& __n) const noexcept
961 { _M_weak_this._M_assign(__p, __n); }
1017 __make_shared_arr_tag(size_t __n, const _Alloc& __a = _Alloc()) noexcept
1022 if (__builtin_mul_overflow(__s, __n, &__n))
1024 return _Sp_counted_array_base<_UpAlloc>{_UpAlloc(__a), __n};
1030 allocate_shared(const _Alloc& __a, size_t __n) argument
1032 return shared_ptr<_Tp>(std::__make_shared_arr_tag<_Tp>(__n, __a));
1037 make_shared(size_t __n) argument
1039 return shared_ptr<_Tp>(std::__make_shared_arr_tag<_Tp>(__n));
1044 allocate_shared(const _Alloc& __a, size_t __n, const remove_extent_t<_Tp>& __u) argument
1053 make_shared(size_t __n, const remove_extent_t<_Tp>& __u) argument
1135 allocate_shared_for_overwrite(const _Alloc& __a, size_t __n) argument
1143 make_shared_for_overwrite(size_t __n) argument
[all...]
H A Diterator_concepts.h357 typename incrementable_traits<_Iter>::difference_type __n)
359 { __it += __n } -> same_as<_Iter&>;
360 { __it -= __n } -> same_as<_Iter&>;
361 { __it + __n } -> same_as<_Iter>;
362 { __n + __it } -> same_as<_Iter>;
363 { __it - __n } -> same_as<_Iter>;
364 { __it - __it } -> same_as<decltype(__n)>;
365 { __it[__n] } -> convertible_to<iter_reference_t<_Iter>>;
687 const iter_difference_t<_Iter> __n)
689 { __i += __n }
[all...]
/netbsd-current/external/apache2/llvm/dist/libcxx/include/__support/ibm/
H A Dxlocale.h200 size_t strxfrm_l(char *__s1, const char *__s2, size_t __n, locale_t locale) argument
202 return __xstrxfrm(locale, __s1, __s2, __n);
206 size_t wcsxfrm_l(wchar_t *__ws1, const wchar_t *__ws2, size_t __n, argument
209 return __xwcsxfrm(locale, __ws1, __ws2, __n);
/netbsd-current/external/apache2/llvm/dist/libcxx/include/__support/solaris/
H A Dxlocale.h23 int snprintf_l(char *__s, size_t __n, locale_t __l, const char *__format, ...);
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
H A Dropeimpl.h254 _M_incr(std::size_t __n) argument
256 _M_current_pos += __n;
260 if (__chars_left > __n)
261 _M_buf_ptr += __n;
262 else if (__chars_left == __n)
264 _M_buf_ptr += __n;
275 _M_decr(std::size_t __n) argument
280 if (__chars_left >= __n)
281 _M_buf_ptr -= __n;
285 _M_current_pos -= __n;
350 _S_free_string(_CharT* __s, std::size_t __n, allocator_type& __a) argument
855 operator ()(const _CharT* __leaf, std::size_t __n) argument
878 operator ()(const _CharT* __leaf, std::size_t __n) argument
913 operator ()(const _CharT* __leaf, std::size_t __n) argument
988 _Rope_fill(std::basic_ostream<_CharT, _Traits>& __o, std::size_t __n) argument
1533 rope(std::size_t __n, _CharT __c, const allocator_type& __a) argument
[all...]
H A Dmt_allocator.h669 allocate(size_type __n, const void* = 0);
672 deallocate(pointer __p, size_type __n);
689 allocate(size_type __n, const void*) argument
691 if (__n > this->max_size())
699 return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp), __al));
708 const size_type __bytes = __n * sizeof(_Tp);
745 deallocate(pointer __p, size_type __n) argument
761 const size_type __bytes = __n * sizeof(_Tp);
H A Dbitmap_allocator.h91 allocate(size_type __n) argument
92 { return static_cast<pointer>(::operator new(__n * sizeof(_Tp))); }
1014 allocate(size_type __n) argument
1016 if (__n > this->max_size())
1022 const size_type __b = __n * sizeof(value_type);
1028 if (__builtin_expect(__n == 1, true))
1032 const size_type __b = __n * sizeof(value_type);
1038 allocate(size_type __n, typename bitmap_allocator<void>::const_pointer) argument
1039 { return allocate(__n); }
1042 deallocate(pointer __p, size_type __n) thro argument
[all...]
H A Dthrow_allocator.h852 allocate(size_type __n, const void* hint = 0)
854 if (__n > this->max_size())
858 pointer const a = traits::allocate(_M_allocator, __n, hint);
859 insert(a, sizeof(value_type) * __n);
890 deallocate(pointer __p, size_type __n) argument
892 erase(__p, sizeof(value_type) * __n);
893 _M_allocator.deallocate(__p, __n);
897 check_allocated(pointer __p, size_type __n) argument
899 size_type __t = sizeof(value_type) * __n;
904 check(size_type __n) argument
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
H A Dropeimpl.h254 _M_incr(std::size_t __n) argument
256 _M_current_pos += __n;
260 if (__chars_left > __n)
261 _M_buf_ptr += __n;
262 else if (__chars_left == __n)
264 _M_buf_ptr += __n;
275 _M_decr(std::size_t __n) argument
280 if (__chars_left >= __n)
281 _M_buf_ptr -= __n;
285 _M_current_pos -= __n;
350 _S_free_string(_CharT* __s, std::size_t __n, allocator_type& __a) argument
852 operator ()(const _CharT* __leaf, std::size_t __n) argument
875 operator ()(const _CharT* __leaf, std::size_t __n) argument
910 operator ()(const _CharT* __leaf, std::size_t __n) argument
985 _Rope_fill(std::basic_ostream<_CharT, _Traits>& __o, std::size_t __n) argument
1532 rope(std::size_t __n, _CharT __c, const allocator_type& __a) argument
[all...]
H A Dmt_allocator.h669 allocate(size_type __n, const void* = 0);
672 deallocate(pointer __p, size_type __n);
689 allocate(size_type __n, const void*) argument
691 if (__n > this->max_size())
699 return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp), __al));
708 const size_type __bytes = __n * sizeof(_Tp);
745 deallocate(pointer __p, size_type __n) argument
761 const size_type __bytes = __n * sizeof(_Tp);
H A Dbitmap_allocator.h91 allocate(size_type __n) argument
92 { return static_cast<pointer>(::operator new(__n * sizeof(_Tp))); }
1013 allocate(size_type __n) argument
1015 if (__n > this->max_size())
1021 const size_type __b = __n * sizeof(value_type);
1027 if (__builtin_expect(__n == 1, true))
1031 const size_type __b = __n * sizeof(value_type);
1037 allocate(size_type __n, typename bitmap_allocator<void>::const_pointer) argument
1038 { return allocate(__n); }
1041 deallocate(pointer __p, size_type __n) thro argument
[all...]
H A Dthrow_allocator.h852 allocate(size_type __n, const void* __hint = 0)
854 if (__n > this->max_size())
858 pointer const a = traits::allocate(_M_allocator, __n, __hint);
859 insert(a, sizeof(value_type) * __n);
890 deallocate(pointer __p, size_type __n) argument
892 erase(__p, sizeof(value_type) * __n);
893 _M_allocator.deallocate(__p, __n);
897 check_allocated(pointer __p, size_type __n) argument
899 size_type __t = sizeof(value_type) * __n;
904 check(size_type __n) argument
[all...]
/netbsd-current/sys/dev/ic/
H A Datwvar.h372 int __x, __n; \
375 __n = (n); \
378 if ((__x + __n) > ATW_NTXDESC) { \
382 __n -= (ATW_NTXDESC - __x); \
388 ATW_CDTXOFF(__x), sizeof(struct atw_txdesc) * __n, (ops)); \
H A Dtulipvar.h492 int __x, __n; \
495 __n = (n); \
498 if ((__x + __n) > TULIP_NTXDESC) { \
502 __n -= (TULIP_NTXDESC - __x); \
508 TULIP_CDTXOFF(__x), sizeof(struct tulip_desc) * __n, (ops)); \
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/
H A Dmultiway_mergesort.h405 _DifferenceType __n = __end - __begin; local
407 if (__n <= 1)
411 if (__num_threads > __n)
412 __num_threads = static_cast<_ThreadIndex>(__n);
448 _DifferenceType __chunk_length = __n / __num_threads;
449 _DifferenceType __split = __n % __num_threads;
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
H A Dmultiway_mergesort.h405 _DifferenceType __n = __end - __begin; local
407 if (__n <= 1)
411 if (__num_threads > __n)
412 __num_threads = static_cast<_ThreadIndex>(__n);
448 _DifferenceType __chunk_length = __n / __num_threads;
449 _DifferenceType __split = __n % __num_threads;
/netbsd-current/external/apache2/llvm/dist/libcxx/include/__iterator/
H A Diterator_traits.h198 requires(_Ip __i, typename incrementable_traits<_Ip>::difference_type __n) {
199 { __i += __n } -> same_as<_Ip&>;
200 { __i -= __n } -> same_as<_Ip&>;
201 { __i + __n } -> same_as<_Ip>;
202 { __n + __i } -> same_as<_Ip>;
203 { __i - __n } -> same_as<_Ip>;
204 { __i - __i } -> same_as<decltype(__n)>;
205 { __i[__n] } -> convertible_to<iter_reference_t<_Ip>>;
/netbsd-current/external/apache2/llvm/dist/libcxx/include/__memory/
H A Dallocator_traits.h260 static pointer allocate(allocator_type& __a, size_type __n) { argument
261 return __a.allocate(__n);
267 static pointer allocate(allocator_type& __a, size_type __n, const_void_pointer __hint) { argument
269 return __a.allocate(__n, __hint);
275 static pointer allocate(allocator_type& __a, size_type __n, const_void_pointer) { argument
276 return __a.allocate(__n);
280 static void deallocate(allocator_type& __a, pointer __p, size_type __n) _NOEXCEPT {
281 __a.deallocate(__p, __n);
/netbsd-current/external/apache2/llvm/dist/libcxx/src/
H A Dthread.cpp129 T* allocate(size_t __n) argument
130 {return static_cast<T*>(::operator new(__n * sizeof(T)));}
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
H A Dregex_executor.h194 _State_info(_StateIdT __start, size_t __n) argument
195 : _M_visited_states(new bool[__n]()), _M_start(__start)
H A Diterator_concepts.h339 typename incrementable_traits<_Iter>::difference_type __n)
341 { __it += __n } -> same_as<_Iter&>;
342 { __it -= __n } -> same_as<_Iter&>;
343 { __it + __n } -> same_as<_Iter>;
344 { __n + __it } -> same_as<_Iter>;
345 { __it - __n } -> same_as<_Iter>;
346 { __it - __it } -> same_as<decltype(__n)>;
347 { __it[__n] } -> convertible_to<iter_reference_t<_Iter>>;
643 const iter_difference_t<_Iter> __n)
645 { __i += __n }
[all...]
H A Dstl_algo.h202 __n = __count; local
205 while (__i != __last && __n != 1 && __unary_pred(__i))
208 --__n;
210 if (__n == 1)
711 __copy_n_a(_InputIterator __first, _Size __n, _OutputIterator __result) argument
713 if (__n > 0)
719 if (--__n > 0)
736 __copy_n(_InputIterator __first, _Size __n, argument
740 __copy_n_a(__first, __n,
748 __copy_n(_RandomAccessIterator __first, _Size __n, argument
768 copy_n(_InputIterator __first, _Size __n, _OutputIterator __result) argument
1224 __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) argument
1342 _Distance __n = __last - __first; local
3864 for_each_n(_InputIterator __first, _Size __n, _Function __f) argument
4480 generate_n(_OutputIterator __first, _Size __n, _Generator __gen) argument
5767 __sample(_InputIterator __first, _InputIterator __last, input_iterator_tag, _RandomAccessIterator __out, random_access_iterator_tag, _Size __n, _UniformRandomBitGenerator&& __g) argument
5794 __sample(_ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag, _OutputIterator __out, _Cat, _Size __n, _UniformRandomBitGenerator&& __g) argument
5864 sample(_PopulationIterator __first, _PopulationIterator __last, _SampleIterator __out, _Distance __n, _UniformRandomBitGenerator&& __g) argument
[all...]
/netbsd-current/sys/arch/hpc/stand/hpcboot/sh3/dev/
H A Dsh.h367 int __n =(__h >> 28) & 0xf; \
368 char __c = __n > 9 ? 'A' + __n - 10 : '0' + __n; \

Completed in 325 milliseconds

<<1112131415