Searched refs:__n (Results 51 - 75 of 368) sorted by relevance

1234567891011>>

/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/
H A Dpartial_sum.h82 * @param __n Length of sequence.
92 typename std::iterator_traits<_IIter>::difference_type __n)
102 std::min<_DifferenceType>(__get_max_threads(), __n - 1);
126 __equally_split(__n, __num_threads + 1, __borders);
131 __n / (1.0f + __s.partial_sum_dilation * __num_threads));
133 (__n - __first_part_length) / __num_threads;
135 __n - __num_threads * __chunk_length;
142 __borders[__num_threads + 1] = __n;
192 return __result + __n;
214 _DifferenceType __n local
89 __parallel_partial_sum_linear(_IIter __begin, _IIter __end, _OutputIterator __result, _BinaryOperation __bin_op, typename std::iterator_traits<_IIter>::difference_type __n) argument
[all...]
H A Dmultiseq_selection.h146 __nmax, __n, __r; local
195 __n = __l / 2;
206 if (__n < __ns[__i]) //__sequence long enough
207 __sample.push_back(std::make_pair(__S(__i)[__n], __i));
211 if (__n >= __ns[__i]) //__sequence too short, conceptual infinity
219 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
221 __a[__sample[__j].second] += __n + 1;
223 __b[__sample[__j].second] -= __n + 1;
226 while (__n > 0)
228 __n /
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
H A Dpartial_sum.h82 * @param __n Length of sequence.
92 typename std::iterator_traits<_IIter>::difference_type __n)
102 std::min<_DifferenceType>(__get_max_threads(), __n - 1);
126 __equally_split(__n, __num_threads + 1, __borders);
131 __n / (1.0f + __s.partial_sum_dilation * __num_threads));
133 (__n - __first_part_length) / __num_threads;
135 __n - __num_threads * __chunk_length;
142 __borders[__num_threads + 1] = __n;
192 return __result + __n;
214 _DifferenceType __n local
89 __parallel_partial_sum_linear(_IIter __begin, _IIter __end, _OutputIterator __result, _BinaryOperation __bin_op, typename std::iterator_traits<_IIter>::difference_type __n) argument
[all...]
H A Dmultiseq_selection.h146 __nmax, __n, __r; local
195 __n = __l / 2;
206 if (__n < __ns[__i]) //__sequence long enough
207 __sample.push_back(std::make_pair(__S(__i)[__n], __i));
211 if (__n >= __ns[__i]) //__sequence too short, conceptual infinity
219 __j < __localrank && ((__n + 1) <= __ns[__sample[__j].second]);
221 __a[__sample[__j].second] += __n + 1;
223 __b[__sample[__j].second] -= __n + 1;
226 while (__n > 0)
228 __n /
[all...]
/netbsd-current/sys/sys/
H A Dbitops.h297 #define __BITMAP_TYPE(__s, __t, __n) struct __s { \
298 __t _b[__BITMAP_SIZE(__t, __n)]; \
304 #define __BITMAP_SIZE(__t, __n) \
305 (((__n) + (__BITMAP_BITS(__t) - 1)) / __BITMAP_BITS(__t))
306 #define __BITMAP_BIT(__n, __v) \
307 ((__typeof__((__v)->_b[0]))1 << ((__n) & __BITMAP_MASK(*(__v)->_b)))
308 #define __BITMAP_WORD(__n, __v) \
309 ((__n) >> __BITMAP_SHIFT(*(__v)->_b))
311 #define __BITMAP_SET(__n, __v) \
312 ((__v)->_b[__BITMAP_WORD(__n, __
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
H A Dstl_bvector.h198 difference_type __n = __i + _M_offset; local
199 _M_p += __n / int(_S_word_bit);
200 __n = __n % int(_S_word_bit);
201 if (__n < 0)
203 __n += int(_S_word_bit);
206 _M_offset = static_cast<unsigned int>(__n);
347 operator+(const iterator& __x, difference_type __n) argument
350 __tmp += __n;
356 operator+(difference_type __n, cons argument
361 operator -(const iterator& __x, difference_type __n) argument
458 operator +(const const_iterator& __x, difference_type __n) argument
467 operator -(const const_iterator& __x, difference_type __n) argument
476 operator +(difference_type __n, const const_iterator& __x) argument
629 _M_allocate(size_t __n) argument
649 const size_t __n = _M_impl._M_end_addr() - _M_impl._M_start._M_p; local
666 _S_nword(size_t __n) argument
740 vector(size_type __n, const allocator_type& __a = allocator_type()) argument
749 vector(size_type __n, const bool& __value = bool(), const allocator_type& __a = allocator_type()) argument
914 assign(size_type __n, const bool& __x) argument
1035 operator [](size_type __n) argument
1058 at(size_type __n) argument
1074 reserve(size_type __n) argument
1143 const difference_type __n = __position - begin(); local
1188 insert(const_iterator __position, size_type __n, const bool& __x) argument
1196 insert(iterator __position, size_type __n, const bool& __x) argument
1298 _M_initialize(size_type __n) argument
1333 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument
1363 const size_type __n = std::distance(__first, __last); local
1373 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
1385 _M_fill_assign(size_t __n, bool __x) argument
1437 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument
1479 _M_check_len(size_type __n, const char* __s) const argument
[all...]
H A Dstl_vector.h208 _S_grow(_Vector_impl& __impl, size_type __n) argument
209 { _S_adjust(__impl, __impl._M_finish, __impl._M_finish + __n); }
212 _S_shrink(_Vector_impl& __impl, size_type __n) argument
213 { _S_adjust(__impl, __impl._M_finish + __n, __impl._M_finish); }
253 _Grow(_Vector_impl& __impl, size_type __n) argument
254 : _M_impl(__impl), _M_n(__n)
255 { _S_grow(_M_impl, __n); }
261 void _M_grew(size_type __n) { _M_n -= __n; } argument
324 _Vector_base(size_t __n)
330 _Vector_base(size_t __n, const allocator_type& __a) argument
351 size_t __n = __x._M_impl._M_finish - __x._M_impl._M_start; local
375 _M_allocate(size_t __n) argument
383 _M_deallocate(pointer __p, size_t __n) argument
393 _M_create_storage(size_t __n) argument
551 vector(size_type __n, const allocator_type& __a = allocator_type()) argument
564 vector(size_type __n, const value_type& __value, const allocator_type& __a = allocator_type()) argument
578 vector(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) argument
803 assign(size_type __n, const value_type& __val) argument
1123 __glibcxx_requires_subscript(__n); variable
1142 __glibcxx_requires_subscript(__n); variable
1173 at(size_type __n) argument
1432 insert(const_iterator __position, size_type __n, const value_type& __x) argument
1453 insert(iterator __position, size_type __n, const value_type& __x) argument
1611 _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last) argument
1638 _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type) argument
1685 const size_type __n = std::distance(__first, __last); local
1699 _M_fill_initialize(size_type __n, const value_type& __value) argument
1710 _M_default_initialize(size_type __n) argument
1728 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
1768 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, __true_type) argument
1891 _M_check_len(size_type __n, const char* __s) const argument
1902 _S_check_init_len(size_type __n, const allocator_type& __a) argument
1935 _GLIBCXX_ASAN_ANNOTATE_SHRINK(__n); variable
[all...]
H A Dunordered_set.h139 * @param __n Minimal initial number of buckets.
145 unordered_set(size_type __n, argument
149 : _M_h(__n, __hf, __eql, __a)
156 * @param __n Minimal initial number of buckets.
167 size_type __n = 0,
171 : _M_h(__first, __last, __n, __hf, __eql, __a)
213 * @param __n Minimal initial number of buckets.
222 size_type __n = 0,
226 : _M_h(__l, __n, __hf, __eql, __a)
229 unordered_set(size_type __n, cons argument
233 unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a) argument
239 unordered_set(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& __a) argument
246 unordered_set(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const allocator_type& __a) argument
252 unordered_set(initializer_list<value_type> __l, size_type __n, const allocator_type& __a) argument
258 unordered_set(initializer_list<value_type> __l, size_type __n, const hasher& __hf, const allocator_type& __a) argument
788 begin(size_type __n) argument
808 end(size_type __n) argument
849 rehash(size_type __n) argument
860 reserve(size_type __n) argument
1010 unordered_multiset(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
1102 unordered_multiset(size_type __n, const allocator_type& __a) argument
1106 unordered_multiset(size_type __n, const hasher& __hf, const allocator_type& __a) argument
1112 unordered_multiset(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& __a) argument
1119 unordered_multiset(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const allocator_type& __a) argument
1125 unordered_multiset(initializer_list<value_type> __l, size_type __n, const allocator_type& __a) argument
1131 unordered_multiset(initializer_list<value_type> __l, size_type __n, const hasher& __hf, const allocator_type& __a) argument
1631 begin(size_type __n) argument
1651 end(size_type __n) argument
1692 rehash(size_type __n) argument
1703 reserve(size_type __n) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/impl/
H A Dprofiler_algos.h43 typename _Container::size_type __n)
52 if (__count >= __n)
73 typename _Container::size_type __n)
78 __insert_top_n(__output, *__it, __n);
41 __insert_top_n(_Container& __output, const typename _Container::value_type& __value, typename _Container::size_type __n) argument
72 __top_n(const _Container& __input, _Container& __output, typename _Container::size_type __n) argument
/netbsd-current/external/apache2/llvm/dist/libcxx/include/__memory/
H A Dallocator.h75 _Tp* allocate(size_t __n) { argument
76 if (__n > allocator_traits<allocator>::max_size(*this))
80 return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
82 return static_cast<_Tp*>(_VSTD::__libcpp_allocate(__n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp)));
87 void deallocate(_Tp* __p, size_t __n) _NOEXCEPT {
91 _VSTD::__libcpp_deallocate((void*)__p, __n * sizeof(_Tp), _LIBCPP_ALIGNOF(_Tp));
117 _Tp* allocate(size_t __n, const void*) { argument
118 return allocate(__n);
156 const _Tp* allocate(size_t __n) { argument
157 if (__n > allocator_trait
168 deallocate(const _Tp* __p, size_t __n) argument
194 allocate(size_t __n, const void*) argument
[all...]
/netbsd-current/external/apache2/llvm/dist/libcxx/src/support/solaris/
H A Dxlocale.cpp27 #define vsnprintf_l(__s, __n, __l, __format, __va) \
28 vsnprintf(__s, __n, __format, __va)
30 int snprintf_l(char *__s, size_t __n, locale_t __l, const char *__format, ...) argument
34 int __res = vsnprintf_l(__s, __n , __l, __format, __va);
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
H A Dstl_vector.h192 _S_grow(_Vector_impl& __impl, size_type __n) argument
193 { _S_adjust(__impl, __impl._M_finish, __impl._M_finish + __n); }
196 _S_shrink(_Vector_impl& __impl, size_type __n) argument
197 { _S_adjust(__impl, __impl._M_finish + __n, __impl._M_finish); }
234 _Grow(_Vector_impl& __impl, size_type __n) argument
235 : _M_impl(__impl), _M_n(__n)
236 { _S_grow(_M_impl, __n); }
240 void _M_grew(size_type __n) { _M_n -= __n; } argument
298 _Vector_base(size_t __n)
303 _Vector_base(size_t __n, const allocator_type& __a) argument
322 size_t __n = __x._M_impl._M_finish - __x._M_impl._M_start; local
343 _M_allocate(size_t __n) argument
350 _M_deallocate(pointer __p, size_t __n) argument
359 _M_create_storage(size_t __n) argument
510 vector(size_type __n, const allocator_type& __a = allocator_type()) argument
522 vector(size_type __n, const value_type& __value, const allocator_type& __a = allocator_type()) argument
536 vector(size_type __n, const value_type& __value = value_type(), const allocator_type& __a = allocator_type()) argument
749 assign(size_type __n, const value_type& __val) argument
1045 __glibcxx_requires_subscript(__n); variable
1063 __glibcxx_requires_subscript(__n); variable
1092 at(size_type __n) argument
1335 insert(const_iterator __position, size_type __n, const value_type& __x) argument
1356 insert(iterator __position, size_type __n, const value_type& __x) argument
1508 _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last) argument
1535 _M_initialize_dispatch(_Integer __n, _Integer __value, __true_type) argument
1580 const size_type __n = std::distance(__first, __last); local
1593 _M_fill_initialize(size_type __n, const value_type& __value) argument
1603 _M_default_initialize(size_type __n) argument
1620 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
1655 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, __true_type) argument
1756 _M_check_len(size_type __n, const char* __s) const argument
1767 _S_check_init_len(size_type __n, const allocator_type& __a) argument
1799 _GLIBCXX_ASAN_ANNOTATE_SHRINK(__n); variable
[all...]
H A Dstl_bvector.h174 difference_type __n = __i + _M_offset; local
175 _M_p += __n / int(_S_word_bit);
176 __n = __n % int(_S_word_bit);
177 if (__n < 0)
179 __n += int(_S_word_bit);
182 _M_offset = static_cast<unsigned int>(__n);
303 operator+(const iterator& __x, difference_type __n) argument
306 __tmp += __n;
311 operator+(difference_type __n, cons argument
315 operator -(const iterator& __x, difference_type __n) argument
399 operator +(const const_iterator& __x, difference_type __n) argument
407 operator -(const const_iterator& __x, difference_type __n) argument
415 operator +(difference_type __n, const const_iterator& __x) argument
556 _M_allocate(size_t __n) argument
564 const size_t __n = _M_impl._M_end_addr() - _M_impl._M_start._M_p; local
579 _S_nword(size_t __n) argument
662 vector(size_type __n, const allocator_type& __a = allocator_type()) argument
666 vector(size_type __n, const bool& __value, const allocator_type& __a = allocator_type()) argument
808 assign(size_type __n, const bool& __x) argument
909 operator [](size_type __n) argument
935 at(size_type __n) argument
943 reserve(size_type __n) argument
1011 const difference_type __n = __position - begin(); local
1045 insert(const_iterator __position, size_type __n, const bool& __x) argument
1053 insert(iterator __position, size_type __n, const bool& __x) argument
1143 _M_initialize(size_type __n) argument
1183 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument
1210 const size_type __n = std::distance(__first, __last); local
1220 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument
1231 _M_fill_assign(size_t __n, bool __x) argument
1282 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument
1318 _M_check_len(size_type __n, const char* __s) const argument
[all...]
H A Dunordered_set.h139 * @param __n Minimal initial number of buckets.
145 unordered_set(size_type __n, argument
149 : _M_h(__n, __hf, __eql, __a)
156 * @param __n Minimal initial number of buckets.
167 size_type __n = 0,
171 : _M_h(__first, __last, __n, __hf, __eql, __a)
213 * @param __n Minimal initial number of buckets.
222 size_type __n = 0,
226 : _M_h(__l, __n, __hf, __eql, __a)
229 unordered_set(size_type __n, cons argument
233 unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a) argument
239 unordered_set(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& __a) argument
246 unordered_set(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const allocator_type& __a) argument
252 unordered_set(initializer_list<value_type> __l, size_type __n, const allocator_type& __a) argument
258 unordered_set(initializer_list<value_type> __l, size_type __n, const hasher& __hf, const allocator_type& __a) argument
738 begin(size_type __n) argument
758 end(size_type __n) argument
799 rehash(size_type __n) argument
810 reserve(size_type __n) argument
960 unordered_multiset(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equal(), const allocator_type& __a = allocator_type()) argument
1052 unordered_multiset(size_type __n, const allocator_type& __a) argument
1056 unordered_multiset(size_type __n, const hasher& __hf, const allocator_type& __a) argument
1062 unordered_multiset(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type& __a) argument
1069 unordered_multiset(_InputIterator __first, _InputIterator __last, size_type __n, const hasher& __hf, const allocator_type& __a) argument
1075 unordered_multiset(initializer_list<value_type> __l, size_type __n, const allocator_type& __a) argument
1081 unordered_multiset(initializer_list<value_type> __l, size_type __n, const hasher& __hf, const allocator_type& __a) argument
1532 begin(size_type __n) argument
1552 end(size_type __n) argument
1593 rehash(size_type __n) argument
1604 reserve(size_type __n) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/pstl/
H A Dparallel_backend_serial.h35 __buffer(std::size_t __n) : __allocator_(), __ptr_(__allocator_.allocate(__n)), __buf_size_(__n) {} argument
83 __parallel_strict_scan(_ExecutionPolicy&&, _Index __n, _Tp __initial, _Rp __reduce, _Cp __combine, _Sp __scan, argument
87 if (__n)
88 __sum = __combine(__sum, __reduce(_Index(0), __n));
90 if (__n)
91 __scan(_Index(0), __n, __initial);
96 __parallel_transform_scan(_ExecutionPolicy&&, _Index __n, _UnaryOp, _Tp __init, _BinaryOp, _Reduce, _Scan __scan) argument
98 return __scan(_Index(0), __n, __ini
[all...]
/netbsd-current/external/gpl3/gdb.old/dist/gdb/unittests/basic_string_view/capacity/
H A D1.cc69 compare(const char_type* __s1, const char_type* __s2, size_t __n)
71 for (size_t __i = 0; __i < __n; ++__i)
87 find(const char_type* __s, size_t __n, const char_type& __a)
89 for (const char_type* __p = __s; size_t(__p - __s) < __n; ++__p)
95 move(char_type* __s1, const char_type* __s2, size_t __n)
96 { return (char_type*) memmove(__s1, __s2, __n * sizeof(char_type)); }
99 copy(char_type* __s1, const char_type* __s2, size_t __n)
100 { return (char_type*) memcpy(__s1, __s2, __n * sizeof(char_type)); }
103 assign(char_type* __s, size_t __n, char_type __a)
105 for (char_type* __p = __s; __p < __s + __n;
[all...]
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/pstl/
H A Dparallel_backend_serial.h35 __buffer(std::size_t __n) : __allocator_(), __ptr_(__allocator_.allocate(__n)), __buf_size_(__n) {} argument
83 __parallel_strict_scan(_ExecutionPolicy&&, _Index __n, _Tp __initial, _Rp __reduce, _Cp __combine, _Sp __scan, argument
87 if (__n)
88 __sum = __combine(__sum, __reduce(_Index(0), __n));
90 if (__n)
91 __scan(_Index(0), __n, __initial);
96 __parallel_transform_scan(_ExecutionPolicy&&, _Index __n, _UnaryOp, _Tp __init, _BinaryOp, _Reduce, _Scan __scan) argument
98 return __scan(_Index(0), __n, __ini
[all...]
/netbsd-current/external/gpl3/gdb/dist/gdb/unittests/basic_string_view/capacity/
H A D1.cc69 compare(const char_type* __s1, const char_type* __s2, size_t __n)
71 for (size_t __i = 0; __i < __n; ++__i)
87 find(const char_type* __s, size_t __n, const char_type& __a)
89 for (const char_type* __p = __s; size_t(__p - __s) < __n; ++__p)
95 move(char_type* __s1, const char_type* __s2, size_t __n)
96 { return (char_type*) memmove(__s1, __s2, __n * sizeof(char_type)); }
99 copy(char_type* __s1, const char_type* __s2, size_t __n)
100 { return (char_type*) memcpy(__s1, __s2, __n * sizeof(char_type)); }
103 assign(char_type* __s, size_t __n, char_type __a)
105 for (char_type* __p = __s; __p < __s + __n;
[all...]
/netbsd-current/external/apache2/llvm/dist/libcxx/src/include/
H A Dsso_allocator.h51 _LIBCPP_INLINE_VISIBILITY pointer allocate(size_type __n, typename __sso_allocator<void, _Np>::const_pointer = nullptr) argument
53 if (!__allocated_ && __n <= _Np)
58 return allocator<_Tp>().allocate(__n);
60 _LIBCPP_INLINE_VISIBILITY void deallocate(pointer __p, size_type __n) argument
65 allocator<_Tp>().deallocate(__p, __n);
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/src/c++98/
H A Distream.cc38 getline(char_type* __s, streamsize __n, char_type __delim) argument
52 while (_M_gcount + 1 < __n
58 streamsize(__n - _M_gcount
101 if (__n > 0)
113 ignore(streamsize __n, int_type __delim) argument
117 return ignore(__n);
122 if (__n > 0 && __cerb)
135 while (_M_gcount < __n
141 streamsize(__n - _M_gcount));
159 if (__n
293 getline(char_type* __s, streamsize __n, char_type __delim) argument
368 ignore(streamsize __n, int_type __delim) argument
[all...]
/netbsd-current/external/apache2/llvm/dist/libcxx/src/
H A Dstrstream.cpp36 strstreambuf::__init(char* __gnext, streamsize __n, char* __pbeg) argument
38 if (__n == 0)
39 __n = static_cast<streamsize>(strlen(__gnext));
40 else if (__n < 0)
41 __n = INT_MAX;
43 setg(__gnext, __gnext, __gnext + __n);
47 setp(__pbeg, __pbeg + __n);
51 strstreambuf::strstreambuf(char* __gnext, streamsize __n, char* __pbeg) argument
57 __init(__gnext, __n, __pbeg);
60 strstreambuf::strstreambuf(const char* __gnext, streamsize __n) argument
66 __init(const_cast<char *>(__gnext), __n, nullptr); local
69 strstreambuf(signed char* __gnext, streamsize __n, signed char* __pbeg) argument
78 strstreambuf(const signed char* __gnext, streamsize __n) argument
87 strstreambuf(unsigned char* __gnext, streamsize __n, unsigned char* __pbeg) argument
96 strstreambuf(const unsigned char* __gnext, streamsize __n) argument
[all...]
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/
H A Dvstring_util.h104 // When __n = 1 way faster than the general multichar
107 _S_copy(_CharT* __d, const _CharT* __s, size_type __n) argument
109 if (__n == 1)
112 traits_type::copy(__d, __s, __n);
116 _S_move(_CharT* __d, const _CharT* __s, size_type __n) argument
118 if (__n == 1)
121 traits_type::move(__d, __s, __n);
125 _S_assign(_CharT* __d, size_type __n, _CharT __c) argument
127 if (__n == 1)
130 traits_type::assign(__d, __n, __
[all...]
H A Ddebug_allocator.h121 allocate(size_type __n) argument
123 pointer __res = _M_allocator.allocate(__n + _M_extra);
125 *__ps = __n;
130 allocate(size_type __n, const void* __hint) argument
132 pointer __res = _M_allocator.allocate(__n + _M_extra, __hint);
134 *__ps = __n;
139 deallocate(pointer __p, size_type __n) argument
145 if (*reinterpret_cast<size_type*>(__real_p) != __n)
147 _M_allocator.deallocate(__real_p, __n + _M_extra);
/netbsd-current/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
H A Ddebug_allocator.h121 allocate(size_type __n) argument
123 pointer __res = _M_allocator.allocate(__n + _M_extra);
125 *__ps = __n;
130 allocate(size_type __n, const void* __hint) argument
132 pointer __res = _M_allocator.allocate(__n + _M_extra, __hint);
134 *__ps = __n;
139 deallocate(pointer __p, size_type __n) argument
145 if (*reinterpret_cast<size_type*>(__real_p) != __n)
147 _M_allocator.deallocate(__real_p, __n + _M_extra);
H A Dvstring_util.h104 // When __n = 1 way faster than the general multichar
107 _S_copy(_CharT* __d, const _CharT* __s, size_type __n) argument
109 if (__n == 1)
112 traits_type::copy(__d, __s, __n);
116 _S_move(_CharT* __d, const _CharT* __s, size_type __n) argument
118 if (__n == 1)
121 traits_type::move(__d, __s, __n);
125 _S_assign(_CharT* __d, size_type __n, _CharT __c) argument
127 if (__n == 1)
130 traits_type::assign(__d, __n, __
[all...]

Completed in 380 milliseconds

1234567891011>>