Searched refs:__n (Results 1 - 25 of 103) sorted by relevance

12345

/external/clang/test/SemaCXX/
H A DPR12778.cpp4 void* allocate(int __n) { argument
5 return ::operator new(__n);
/external/qemu/android/utils/
H A Dduff.h24 int __n = (_count); \
27 } while (--__n > 0); \
33 int __n = (__count +1)/2; \
37 } while (--__n > 0); \
44 int __n = (__count +3)/4; \
50 } while (--__n > 0); \
57 int __n = (__count+7)/8; \
67 } while (--__n > 0); \
/external/stlport/stlport/stl/
H A D_alloc.c38 void * _STLP_CALL __debug_alloc<_Alloc>::allocate(size_t __n) { argument
40 size_t __real_n = __n + __total_extra;
41 if (__real_n < __n) {
42 //It means that we rolled on size_t, __n must be very large:
49 __result->_M_size = (_STLP_UINT32_T)__n;
55 __debug_alloc<_Alloc>::deallocate(void *__p, size_t __n) { argument
61 _STLP_VERBOSE_ASSERT(__real_p->_M_size == __n, _StlMsg_DBA_SIZE_MISMATCH)
68 size_t __real_n = __n + __extra_before_chunk() + __extra_after_chunk();
70 for (__tmp= ((unsigned char*)__p) + __n * sizeof(value_type);
77 memset((char*)__p, __shred_byte, __n * sizeo
[all...]
H A D_vector.c62 void vector<_Tp, _Alloc>::reserve(size_type __n) { argument
63 if (capacity() < __n) {
64 if (max_size() < __n) {
71 __tmp = _M_allocate_and_copy(__n, this->_M_start, this->_M_finish);
74 __tmp = this->_M_end_of_storage.allocate(__n, __n);
76 _M_set(__tmp, __tmp + __old_size, __tmp + __n);
122 void vector<_Tp, _Alloc>::_M_fill_insert_aux(iterator __pos, size_type __n, argument
126 _M_fill_insert_aux(__pos, __n, __x_copy, __true_type());
130 iterator __dst = __src + __n;
140 _M_fill_insert_aux(iterator __pos, size_type __n, const _Tp& __x, const __false_type& ) argument
166 _M_fill_insert(iterator __pos, size_type __n, const _Tp& __x) argument
210 _M_fill_assign(size_t __n, const _Tp& __val) argument
224 size_type __n = __pos - begin(); local
[all...]
H A D_numeric.c74 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __opr) { argument
76 if (__n == 0)
79 while ((__n & 1) == 0) {
80 __n >>= 1;
85 __n >>= 1; local
86 while (__n != 0) {
88 if ((__n & 1) != 0)
90 __n >>= 1;
H A D_string.c162 size_type __n = (max)(__res_arg, size()) + 1; local
163 if (__n < this->_M_capacity())
166 _M_reserve(__n);
170 void basic_string<_CharT,_Traits,_Alloc>::_M_reserve(size_type __n) { argument
171 pointer __new_start = this->_M_start_of_storage.allocate(__n, __n);
175 this->_M_reset(__new_start, __new_finish, __new_start + __n);
180 basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { argument
181 if (__n > 0) {
182 if (__n > max_siz
198 size_type __n = __STATIC_CAST(size_type, __last - __first); local
222 assign(size_type __n, _CharT __c) argument
243 ptrdiff_t __n = __l - __f; local
280 insert(iterator __pos, size_t __n, _CharT __c) argument
319 const size_t __n = __last - __first; local
372 replace(iterator __first, iterator __last, size_type __n, _CharT __c) argument
392 const ptrdiff_t __n = __l - __f; local
578 _S_string_copy(const basic_string<_CharT,_Traits,_Alloc>& __s, _CharT* __buf, size_t __n) argument
607 _M_allocate_block(size_t __n) argument
[all...]
H A D_hashtable.h303 hashtable(size_type __n, argument
308 hashtable(size_type __n,
317 { _M_initialize_buckets(__n); }
319 hashtable(size_type __n,
330 { _M_initialize_buckets(__n); }
378 local_iterator begin(size_type __n) { return _ElemsIte(_M_buckets[__n]); } argument
379 local_iterator end(size_type __n) { return _ElemsIte(_M_buckets[__n + 1]); } argument
383 const_local_iterator begin(size_type __n) cons
449 size_type __n = _STLP_STD::distance(__f, __l); local
458 size_type __n = _STLP_STD::distance(__f, __l); local
466 size_type __n = __l - __f; local
473 size_type __n = __l - __f; local
480 size_type __n = _STLP_STD::distance(__f, __l); local
487 size_type __n = _STLP_STD::distance(__f, __l); local
499 size_type __n = _M_bkt_num_key(__key); local
517 const size_type __n = _M_bkt_num_key(__key); local
536 const size_type __n = _M_bkt_num_key(__key); local
552 const size_type __n = _M_bkt_num_key(__key); local
595 _M_initialize_buckets(size_type __n) argument
[all...]
H A D_alloc.h67 static void* _STLP_CALL allocate(size_t __n)
72 void *__result = malloc(__n);
80 static void _STLP_CALL deallocate(void* __p, size_t /* __n */) { free((char*)__p); }
92 static void* _STLP_CALL allocate(size_t __n) { return __stl_new(__n); } argument
149 static void * _STLP_CALL _M_allocate(size_t& __n);
151 static void _STLP_CALL _M_deallocate(void *__p, size_t __n);
156 /* __n must be > 0 */
157 static void* _STLP_CALL allocate(size_t& __n) argument
158 { return (__n > (size_
160 deallocate(void *__p, size_t __n) argument
301 allocate(size_type __n, const void* = 0) argument
317 deallocate(pointer __p, size_type __n) argument
341 _M_allocate(size_type __n, size_type& __allocated_n) argument
525 allocate(size_type __n, size_type& __allocated_n) argument
538 allocate(size_type __n) argument
540 deallocate(_Tp* __p, size_type __n) argument
543 allocate(size_type __n, size_type& __allocated_n, const __true_type& ) argument
547 allocate(size_type __n) argument
550 allocate(size_type __n, size_type& __allocated_n, const __true_type& ) argument
554 allocate(size_type __n, size_type& __allocated_n, const __false_type& ) argument
[all...]
H A D_bitset.c41 for (size_t __n = _Nw - 1; __n >= __wshift; --__n)
42 _M_w[__n] = _M_w[__n - __wshift];
46 for (size_t __n = _Nw - 1; __n > __wshift; --__n)
47 _M_w[__n] = (_M_w[__n
[all...]
H A Dchar_traits.h146 static int _STLP_CALL compare(const char_type* __s1, const char_type* __s2, size_t __n) { argument
147 for (size_t __i = 0; __i < __n; ++__i)
160 static const char_type* _STLP_CALL find(const char_type* __s, size_t __n, const char_type& __c) { argument
161 for ( ; __n > 0 ; ++__s, --__n)
170 static char_type* _STLP_CALL copy(char_type* __s1, const char_type* __s2, size_t __n) { argument
171 return (__n == 0 ? __s1 :
172 (char_type*)memcpy(__s1, __s2, __n * sizeof(char_type)));
175 static char_type* _STLP_CALL assign(char_type* __s, size_t __n, char_type __c) { argument
176 for (size_t __i = 0; __i < __n;
225 compare(const char* __s1, const char* __s2, size_t __n) argument
234 assign(char* __s, size_t __n, char __c) argument
248 move(wchar_t* __dest, const wchar_t* __src, size_t __n) argument
252 copy(wchar_t* __dest, const wchar_t* __src, size_t __n) argument
256 compare(const wchar_t* __s1, const wchar_t* __s2, size_t __n) argument
260 assign(wchar_t* __s, size_t __n, wchar_t __c) argument
[all...]
H A D_bvector.h132 difference_type __n = __i + _M_offset; local
133 _M_p += __n / _STLP_WORD_BIT;
134 __n = __n % _STLP_WORD_BIT;
135 if (__n < 0) {
136 _M_offset = (unsigned int) __n + _STLP_WORD_BIT;
139 _M_offset = (unsigned int) __n;
232 operator+(ptrdiff_t __n, const _Bit_iter<_Ref, _Ptr>& __x) { argument
233 return __x + __n;
300 __chunk_type* _M_bit_alloc(size_t __n) argument
390 _M_initialize(size_type __n) argument
429 size_type __n = _STLP_STD::distance(__first, __last); local
449 size_type __n = _STLP_STD::distance(__first, __last); local
492 operator [](size_type __n) argument
502 at(size_type __n) argument
510 __BVECTOR(size_type __n, bool __val, const allocator_type& __a = allocator_type()) argument
517 __BVECTOR(size_type __n) argument
531 _M_initialize_dispatch(_Integer __n, _Integer __x, const __true_type&) argument
561 size_type __n = _STLP_STD::distance(__first, __last); local
568 size_type __n = _STLP_STD::distance(__first, __last); local
597 _M_fill_assign(size_t __n, bool __x) argument
607 assign(size_t __n, bool __x) argument
617 _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&) argument
651 reserve(size_type __n) argument
686 difference_type __n = __position - begin(); local
699 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, const __true_type&) argument
763 _M_fill_insert(iterator __position, size_type __n, bool __x) argument
783 insert(iterator __position, size_type __n, bool __x) argument
[all...]
H A D_string_sum_methods.h30 size_type __pos, size_type __n = npos,
32 : _STLP_STRING_SUM_BASE(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : 0, __a) {
37 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos));
59 _CharT* _M_append_fast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _CharT *__buf, size_type /*__pos*/, size_type __n) { argument
60 if (__n == 0)
66 size_type __pos, size_type __n)
67 { return uninitialized_copy(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos), __buf); }
69 size_type __pos, size_type __n)
70 { return _M_append_fast_pos(__s.c_str(), __s.size(), __buf, __pos, __n); }
72 size_type __pos, size_type __n)
65 _M_append_fast_pos(_CharT const* __s, size_type __s_size, _CharT *__buf, size_type __pos, size_type __n) argument
68 _M_append_fast_pos(_STLP_PRIV __cstr_wrapper<_CharT> const& __s, _CharT *__buf, size_type __pos, size_type __n) argument
71 _M_append_fast_pos(_STLP_PRIV __bstr_wrapper<_CharT, _Traits, _Alloc> __s, _CharT *__buf, size_type __pos, size_type __n) argument
74 _M_append_fast_pos(_Self const& __s, _CharT *__buf, size_type __pos, size_type __n) argument
82 _M_append_fast_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, _CharT *__buf, size_type __pos, size_type __n) argument
124 _M_append_sum_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n) argument
148 _M_append_sum_no_overflow(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n) argument
[all...]
H A D_vector.h69 _Vector_base(size_t __n, const _Alloc& __a) argument
71 _M_start = _M_end_of_storage.allocate(__n, __n);
73 _M_end_of_storage._M_data = _M_start + __n;
166 void _M_range_check(size_type __n) const {
167 if (__n >= size_type(this->_M_finish - this->_M_start))
171 size_type _M_compute_next_size(size_type __n) { argument
173 if (__n > max_size() - __size)
175 size_type __len = __size + (max)(__n, __size);
202 reference operator[](size_type __n) { retur argument
210 at(size_type __n) argument
227 _M_initialize(size_type __n, const _Tp& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp)) argument
230 vector(size_type __n) argument
233 vector(size_type __n, const _Tp& __val, const allocator_type& __a = allocator_type()) argument
261 _M_initialize_aux(_Integer __n, _Integer __val, const __true_type& ) argument
315 assign(size_type __n, const _Tp& __val) argument
327 size_type __n = __len; local
359 _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type& ) argument
421 _M_range_insert_realloc(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) argument
448 _M_range_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __true_type& ) argument
467 _M_range_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __false_type& ) argument
502 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, const __true_type&) argument
547 size_type __n = _STLP_STD::distance(__first, __last); local
559 insert(iterator __pos, size_type __n, const _Tp& __x) argument
673 _M_allocate_and_copy(size_type& __n, _ForwardIterator __first, _ForwardIterator __last) argument
701 size_type __n = _STLP_STD::distance(__first, __last); local
[all...]
H A D_streambuf.h91 void gbump(int __n) { _M_gnext += __n; } argument
105 void _M_gbump(int __n) { gbump(__n); } argument
115 void pbump(int __n) { _M_pnext += __n; } argument
142 basic_streambuf<_CharT, _Traits>* pubsetbuf(char_type* __s, streamsize __n) argument
143 { return this->setbuf(__s, __n); }
163 // Reads up to __n characters. Return value is the number of
165 virtual streamsize xsgetn(char_type* __s, streamsize __n);
204 sputn(const char_type* __s, streamsize __n) argument
208 _M_sputnc(char_type __c, streamsize __n) argument
238 sgetn(char_type* __s, streamsize __n) argument
[all...]
H A D_string_workaround.h51 basic_string(_Reserve_t __r, size_t __n, argument
53 : _STLP_NO_MEM_T_STRING_BASE(__r, __n, __a) {}
58 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
60 : _STLP_NO_MEM_T_STRING_BASE(__s, __pos, __n, __a) {}
62 basic_string(const _CharT* __s, size_type __n, argument
64 : _STLP_NO_MEM_T_STRING_BASE(__s, __n, __a) {}
70 basic_string(size_type __n, _CharT __c, argument
72 : _STLP_NO_MEM_T_STRING_BASE(__n, __c, __a) {}
124 difference_type __n = _STLP_STD::distance(__f, __l); local
125 this->_M_allocate_block(__n
136 _M_initialize_dispatch(_Integer __n, _Integer __x, const __true_type& ) argument
167 append(const _Self& __s, size_type __pos, size_type __n) argument
173 append(const _CharT* __s, size_type __n) argument
183 append(size_type __n, _CharT __c) argument
219 const size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last)); local
240 _M_append_dispatch(_Integer __n, _Integer __x, const __true_type& ) argument
253 assign(const _Self& __s, size_type __pos, size_type __n) argument
259 assign(const _CharT* __s, size_type __n) argument
271 assign(size_type __n, _CharT __c) argument
279 _M_assign_dispatch(_Integer __n, _Integer __x, const __true_type& ) argument
324 insert(size_type __pos, const _Self& __s, size_type __beg, size_type __n) argument
329 insert(size_type __pos, const _CharT* __s, size_type __n) argument
341 insert(size_type __pos, size_type __n, _CharT __c) argument
349 insert(iterator __p, size_t __n, _CharT __c) argument
375 _M_insert_overflow(iterator __pos, _ForwardIter __first, _ForwardIter __last, size_type __n) argument
400 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last)); local
427 _M_insert_dispatch(iterator __p, _Integer __n, _Integer __x, const __true_type& ) argument
472 replace(size_type __pos, size_type __n, const _Self& __s) argument
508 replace(iterator __first, iterator __last, const _CharT* __s, size_type __n) argument
524 replace(iterator __first, iterator __last, size_type __n, _CharT __c) argument
560 _M_replace_dispatch(iterator __first, iterator __last, _Integer __n, _Integer __x, const __true_type& ) argument
[all...]
H A D_deque.h139 void _M_advance(difference_type __n) { argument
141 difference_type __offset = __n + (_M_cur - _M_first);
143 _M_cur += __n;
208 _Self& operator+=(difference_type __n) { this->_M_advance(__n); return *this; } argument
209 _Self operator+(difference_type __n) const {
211 return __tmp += __n;
214 _Self& operator-=(difference_type __n) { return *this += -__n; } argument
215 _Self operator-(difference_type __n) cons
226 operator +(ptrdiff_t __n, const _Deque_iterator<_Tp, _Traits>& __x) argument
444 operator [](size_type __n) argument
453 at(size_type __n) argument
492 _M_initialize(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp)) argument
497 deque(size_type __n) argument
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type()) argument
518 _M_initialize_dispatch(_Integer __n, _Integer __x, const __true_type&) argument
587 _M_fill_assign(size_type __n, const _Tp& __val) argument
598 assign(size_type __n, const _Tp& __val) argument
612 _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type& ) argument
757 insert(iterator __pos, size_type __n, const value_type& __x) argument
768 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, const __true_type& ) argument
877 size_type __n = _STLP_STD::distance(__first, __last); local
923 size_type __n = _STLP_STD::distance(__first, __last); local
945 _M_insert_range_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __true_type& ) argument
984 _M_insert_range_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n, const __false_type& ) argument
1037 _M_reserve_elements_at_front(size_type __n) argument
1044 _M_reserve_elements_at_back(size_type __n) argument
[all...]
H A D_pthread_alloc.h76 static void * _STLP_CALL allocate(size_t& __n);
79 static void _STLP_CALL deallocate(void *__p, size_t __n);
83 static void * _STLP_CALL allocate(size_t& __n, __state_type* __a);
86 static void _STLP_CALL deallocate(void *__p, size_t __n, __state_type* __a);
127 // __n is permitted to be 0. The C++ standard says nothing about what
128 // the return value is when __n == 0.
129 _Tp* allocate(size_type __n, const void* = 0) { argument
130 if (__n > max_size()) {
133 if (__n != 0) {
134 size_type __buf_size = __n * sizeo
145 deallocate(pointer __p, size_type __n) argument
168 allocate(size_type __n, size_type& __allocated_n) argument
312 allocate(size_type __n, const void* = 0) argument
328 deallocate(pointer __p, size_type __n) argument
354 allocate(size_type __n, size_type& __allocated_n) argument
[all...]
H A D_string.h169 basic_string(_Reserve_t, size_t __n, argument
172 basic_string(_Reserve_t, size_t __n)
173 : _STLP_PRIV _String_base<_CharT,_Alloc>(allocator_type(), __n + 1)
175 basic_string(_Reserve_t, size_t __n, const allocator_type& __a)
177 : _STLP_PRIV _String_base<_CharT,_Alloc>(__a, __n + 1)
183 basic_string(const _Self& __s, size_type __pos, size_type __n = npos,
193 basic_string(const _Self& __s, size_type __pos, size_type __n)
199 __s._M_Start() + __pos + (min) (__n, __s.size() - __pos));
201 basic_string(const _Self& __s, size_type __pos, size_type __n,
209 __s._M_Start() + __pos + (min) (__n, __
213 basic_string(const _CharT* __s, size_type __n, const allocator_type& __a = allocator_type()) argument
237 basic_string(size_type __n, _CharT __c, const allocator_type& __a = allocator_type()) argument
302 _M_compute_next_size(size_type __n) argument
323 difference_type __n = _STLP_STD::distance(__f, __l); local
335 _M_initialize_dispatch(_Integer __n, _Integer __x, const __true_type& ) argument
378 ptrdiff_t __n = __l - __f; local
404 resize(size_type __n, _CharT __c) argument
411 resize(size_type __n) argument
434 operator [](size_type __n) argument
443 at(size_type __n) argument
471 size_type __n = __STATIC_CAST(size_type, _STLP_STD::distance(__first, __last)); local
492 _M_append_dispatch(_Integer __n, _Integer __x, const __true_type& ) argument
519 append(const _Self& __s, size_type __pos, size_type __n) argument
527 append(const _CharT* __s, size_type __n) argument
551 assign(const _Self& __s, size_type __pos, size_type __n) argument
559 assign(const _CharT* __s, size_type __n) argument
573 _M_assign_dispatch(_Integer __n, _Integer __x, const __true_type& ) argument
617 insert(size_type __pos, const _Self& __s, size_type __beg, size_type __n) argument
628 insert(size_type __pos, const _CharT* __s, size_type __n) argument
634 _M_insert(begin() + __pos, __s, __s + __n, _M_inside(__s)); local
649 insert(size_type __pos, size_type __n, _CharT __c) argument
689 _M_insert_overflow(iterator __pos, _ForwardIter __first, _ForwardIter __last, size_type __n) argument
714 size_type __n = _STLP_STD::distance(__first, __last); local
741 _M_insert_dispatch(iterator __p, _Integer __n, _Integer __x, const __true_type& ) argument
813 replace(size_type __pos, size_type __n, const _Self& __s) argument
872 replace(iterator __first, iterator __last, const _CharT* __s, size_type __n) argument
894 _M_replace_dispatch(iterator __first, iterator __last, _Integer __n, _Integer __x, const __true_type& ) argument
933 copy(_CharT* __s, size_type __n, size_type __pos = 0) const argument
[all...]
H A D_hash_set.h85 explicit hash_set(size_type __n) argument
86 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
87 hash_set(size_type __n, const hasher& __hf) argument
88 : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
90 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, argument
93 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql)
94 : _M_ht(__n, __hf, __eql, allocator_type()) {}
95 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql,
98 : _M_ht(__n, __hf, __eql, __a) {}
111 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) argument
115 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument
120 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument
127 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql) argument
136 hash_set(const value_type* __f, const value_type* __l, size_type __n) argument
139 hash_set(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument
143 hash_set(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
152 hash_set(const_iterator __f, const_iterator __l, size_type __n) argument
155 hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument
159 hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
271 hash_multiset(size_type __n) argument
273 hash_multiset(size_type __n, const hasher& __hf) argument
275 hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql) argument
277 hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a) argument
292 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n) argument
296 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument
302 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) argument
309 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql) argument
318 hash_multiset(const value_type* __f, const value_type* __l, size_type __n) argument
321 hash_multiset(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument
325 hash_multiset(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
334 hash_multiset(const_iterator __f, const_iterator __l, size_type __n) argument
337 hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument
341 hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument
[all...]
H A D_sstream.c171 streamsize __n) {
174 if ((_M_mode & ios_base::out) && __n > 0) {
179 if (__avail > __n) {
180 _Traits::copy(this->pptr(), __s, __STATIC_CAST(size_t, __n));
181 this->pbump((int)__n);
182 return __n;
186 __n -= __avail;
195 _M_str.append(__s, __s + __STATIC_CAST(ptrdiff_t, __n));
199 _M_str.append(__s, __s + __STATIC_CAST(ptrdiff_t, __n));
205 __nwritten += __n;
170 xsputn(const char_type* __s, streamsize __n) argument
213 _M_xsputnc(char_type __c, streamsize __n) argument
262 setbuf(_CharT*, streamsize __n) argument
335 ptrdiff_t __n = this->egptr() - this->eback(); local
344 ptrdiff_t __n = this->epptr() - this->pbase(); local
370 const off_type __n = __pos - pos_type(off_type(0)); local
[all...]
H A D_unordered_map.h83 explicit unordered_map(size_type __n = 0, const hasher& __hf = hasher(),
86 : _M_ht(__n, __hf, __eql, __a) {}
96 size_type __n = 0, const hasher& __hf = hasher(),
99 : _M_ht(__n, __hf, __eql, __a)
103 size_type __n = 0, const hasher& __hf = hasher(),
106 : _M_ht(__n, __hf, __eql, __a)
110 size_type __n = 0, const hasher& __hf = hasher(),
113 : _M_ht(__n, __hf, __eql, __a)
177 size_type bucket_size(size_type __n) const { return _M_ht.elems_in_bucket(__n); }
180 begin(size_type __n) argument
181 end(size_type __n) argument
340 begin(size_type __n) argument
341 end(size_type __n) argument
[all...]
/external/stlport/stlport/stl/debug/
H A D_string_sum_methods.h30 size_type __pos, size_type __n = npos,
32 : _M_non_dbg_impl(_Reserve_t(), (__pos <= __s.size()) ? ((min) (__n, __s.size() - __pos)) : 0, __a),
39 _M_append_sum_pos(__s, __pos, (min) (__n, __size - __pos), _M_non_dbg_impl);
59 _Base& _M_append_fast_pos(_STLP_PRIV __char_wrapper<_CharT> __c, _Base &__str, size_type /*__pos*/, size_type __n) { argument
60 if (__n == 0)
65 size_type __pos, size_type __n)
66 { return __str.append(__s + __pos, __s + __pos + (min)(__n, __s_size - __pos)); }
68 size_type __pos, size_type __n)
69 { return _M_append_fast_pos(__s.c_str(), __s.size(), __str, __pos, __n); }
71 size_type __pos, size_type __n)
64 _M_append_fast_pos(_CharT const* __s, size_type __s_size, _Base &__str, size_type __pos, size_type __n) argument
67 _M_append_fast_pos(_STLP_PRIV __cstr_wrapper<_CharT> const& __s, _Base &__str, size_type __pos, size_type __n) argument
70 _M_append_fast_pos(_STLP_PRIV __bstr_wrapper<_CharT, _Traits, _Alloc> __s, _Base &__str, size_type __pos, size_type __n) argument
73 _M_append_fast_pos(_Self const& __s, _Base &__str, size_type __pos, size_type __n) argument
80 _M_append_fast_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, _Base &__str, size_type __pos, size_type __n) argument
106 _M_append_sum_pos(_STLP_PRIV __bstr_sum<_CharT, _Traits, _Alloc, _Left, _Right, _StorageDir> const& __s, size_type __pos, size_type __n, _Base &__impl) argument
[all...]
/external/stlport/src/
H A Dallocators.cpp131 void* _STLP_CALL __malloc_alloc::allocate(size_t __n) argument
133 void *__result = malloc(__n);
148 __result = malloc(__n);
267 // Returns an object of size __n, and optionally adds to size __n free list.
268 static _Obj* _S_refill(size_t __n);
311 /* __n must be > 0 */
312 static void* _M_allocate(size_t& __n);
314 static void _M_deallocate(void *__p, size_t __n);
318 void* __node_alloc_impl::_M_allocate(size_t& __n) { argument
340 _M_deallocate(void *__p, size_t __n) argument
434 _S_refill(size_t __n) argument
484 _M_allocate(size_t& __n) argument
496 _M_deallocate(void *__p, size_t __n) argument
507 _S_refill(size_t __n) argument
742 _M_allocate(size_t& __n) argument
745 _M_deallocate(void *__p, size_t __n) argument
853 _M_refill(size_t __n) argument
990 allocate(size_t& __n) argument
1014 deallocate(void *__p, size_t __n) argument
1034 allocate(size_t& __n, __state_type* __a) argument
1059 deallocate(void *__p, size_t __n, __state_type* __a) argument
1102 allocate(size_t& __n) argument
1104 deallocate(void *__p, size_t __n) argument
1106 allocate(size_t& __n, __state_type* __a) argument
1108 deallocate(void *__p, size_t __n, __state_type* __a) argument
[all...]
/external/libcxx/src/
H A Dstrstream.cpp34 strstreambuf::__init(char* __gnext, streamsize __n, char* __pbeg) argument
36 if (__n == 0)
37 __n = static_cast<streamsize>(strlen(__gnext));
38 else if (__n < 0)
39 __n = INT_MAX;
41 setg(__gnext, __gnext, __gnext + __n);
45 setp(__pbeg, __pbeg + __n);
49 strstreambuf::strstreambuf(char* __gnext, streamsize __n, char* __pbeg) argument
55 __init(__gnext, __n, __pbeg);
58 strstreambuf::strstreambuf(const char* __gnext, streamsize __n) argument
64 __init(const_cast<char *>(__gnext), __n, nullptr); local
67 strstreambuf(signed char* __gnext, streamsize __n, signed char* __pbeg) argument
76 strstreambuf(const signed char* __gnext, streamsize __n) argument
85 strstreambuf(unsigned char* __gnext, streamsize __n, unsigned char* __pbeg) argument
94 strstreambuf(const unsigned char* __gnext, streamsize __n) argument
[all...]
/external/stlport/stlport/stl/pointers/
H A D_vector.h95 reference operator[](size_type __n) { return cast_traits::to_value_type_ref(_M_impl[__n]); } argument
96 const_reference operator[](size_type __n) const { return cast_traits::to_value_type_cref(_M_impl[__n]); }
103 reference at(size_type __n) { return cast_traits::to_value_type_ref(_M_impl.at(__n)); } argument
104 const_reference at(size_type __n) const { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
110 explicit vector(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type), argument
112 vector(size_type __n, cons
119 vector(size_type __n) argument
153 reserve(size_type __n) argument
154 assign(size_type __n, const value_type& __val) argument
205 insert(iterator __pos, size_type __n, const value_type& __x) argument
206 _M_impl.insert(cast_traits::to_storage_type_ptr(__pos), __n, cast_traits::to_storage_type_cref(__x)); local
[all...]

Completed in 511 milliseconds

12345