Home
last modified time | relevance | path

Searched refs:__len (Results 1 – 25 of 34) sorted by relevance

12

/ndk/sources/cxx-stl/stlport/stlport/stl/
D_tempbuf.c37 __get_temporary_buffer(ptrdiff_t __len, _Tp*) in __get_temporary_buffer() argument
39 if (__len > ptrdiff_t(INT_MAX / sizeof(_Tp))) in __get_temporary_buffer()
40 __len = INT_MAX / sizeof(_Tp); in __get_temporary_buffer()
42 while (__len > 0) { in __get_temporary_buffer()
43 _Tp* __tmp = (_Tp*) malloc((size_t)__len * sizeof(_Tp)); in __get_temporary_buffer()
45 return pair<_Tp*, ptrdiff_t>(__tmp, __len); in __get_temporary_buffer()
46 __len /= 2; in __get_temporary_buffer()
D_string.c200 size_type __len = _M_compute_next_size(__n); in _M_append() local
201 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len); in _M_append()
206 this->_M_reset(__new_start, __new_finish, __new_start + __len); in _M_append()
266 size_type __len = _M_compute_next_size(1); in _M_insert_aux() local
267 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len); in _M_insert_aux()
274 this->_M_reset(__new_start, __new_finish, __new_start + __len); in _M_insert_aux()
301 size_type __len = _M_compute_next_size(__n); in insert() local
302 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len); in insert()
308 this->_M_reset(__new_start, __new_finish, __new_start + __len); in insert()
358 size_type __len = _M_compute_next_size(__n); in _M_insert() local
[all …]
D_heap.c112 _Distance __len, _Tp __val) { in __adjust_heap() argument
115 while (__secondChild < __len) { in __adjust_heap()
122 if (__secondChild == __len) { in __adjust_heap()
147 _Distance __len, _Tp __val, _Compare __comp) in __adjust_heap() argument
151 while (__secondChild < __len) { in __adjust_heap()
161 if (__secondChild == __len) { in __adjust_heap()
194 _Distance __len = __last - __first; in __make_heap() local
195 _Distance __parent = (__len - 2)/2; in __make_heap()
198 __adjust_heap(__first, __parent, __len, _Tp(*(__first + __parent))); in __make_heap()
220 _Distance __len = __last - __first; in __make_heap() local
[all …]
D_tempbuf.h49 __get_temporary_buffer(ptrdiff_t __len, _Tp*);
54 inline pair<_Tp*, ptrdiff_t> _STLP_CALL get_temporary_buffer(ptrdiff_t __len) { in get_temporary_buffer() argument
55 return __get_temporary_buffer(__len, (_Tp*) 0); in get_temporary_buffer()
66 get_temporary_buffer(ptrdiff_t __len, _Tp*) { in get_temporary_buffer() argument
67 return __get_temporary_buffer(__len, (_Tp*) 0); in get_temporary_buffer()
D_vector.c87 size_type __len = _M_compute_next_size(__fill_len); in _M_insert_overflow_aux() local
88 pointer __new_start = this->_M_end_of_storage.allocate(__len, __len); in _M_insert_overflow_aux()
102 this->_M_end_of_storage.deallocate(__new_start,__len))) in _M_insert_overflow_aux()
104 _M_set(__new_start, __new_finish, __new_start + __len); in _M_insert_overflow_aux()
110 size_type __len = _M_compute_next_size(__fill_len); in _M_insert_overflow() local
111 pointer __new_start = this->_M_end_of_storage.allocate(__len, __len); in _M_insert_overflow()
118 _M_set(__new_start, __new_finish, __new_start + __len); in _M_insert_overflow()
188 size_type __len = __xlen; variable
189 pointer __tmp = _M_allocate_and_copy(__len, __CONST_CAST(const_pointer, __x._M_start) + 0,
193 this->_M_end_of_storage._M_data = this->_M_start + __len;
D_num_put.c148 __copy_integer_and_fill(const _CharT* __buf, ptrdiff_t __len, in __copy_integer_and_fill() argument
152 if (__len >= __wid) in __copy_integer_and_fill()
153 return _STLP_STD::copy(__buf, __buf + __len, __oi); in __copy_integer_and_fill()
160 __STATIC_CAST(streamsize, __wid - __len))); in __copy_integer_and_fill()
164 __oi = _STLP_STD::copy(__buf, __buf + __len, __oi); in __copy_integer_and_fill()
167 else if (__dir == ios_base::internal && __len != 0 && in __copy_integer_and_fill()
171 return _STLP_STD::copy(__buf + 1, __buf + __len, __oi); in __copy_integer_and_fill()
173 else if (__dir == ios_base::internal && __len >= 2 && in __copy_integer_and_fill()
179 return _STLP_STD::copy(__buf + 2, __buf + __len, __oi); in __copy_integer_and_fill()
183 return _STLP_STD::copy(__buf, __buf + __len, __oi); in __copy_integer_and_fill()
[all …]
D_rope.c106 size_t __len = _S_iterator_buf_len; in _S_setbuf() local
112 if (__buf_start_pos + __len <= __pos) { in _S_setbuf()
113 __buf_start_pos = __pos - __len/4; in _S_setbuf()
114 if (__buf_start_pos + __len > __leaf_end) { in _S_setbuf()
115 __buf_start_pos = __leaf_end - __len; in _S_setbuf()
118 if (__buf_start_pos + __len > __leaf_end) { in _S_setbuf()
119 __len = __leaf_end - __buf_start_pos; in _S_setbuf()
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data); in _S_setbuf()
124 __x._M_buf_end = __x._M_tmp_buf._M_data + __len; in _S_setbuf()
212 size_t __len = __current_node->_M_size._M_data; in _S_setcache_for_incr() local
[all …]
D_string_hash.h36 size_t __len = __s.size(); in __stl_string_hash() local
38 for ( size_t __i = 0; __i < __len; ++__i) in __stl_string_hash()
D_string.h306 size_type __len = __size + (max)(__n, __size) + 1; in _M_compute_next_size() local
307 if (__len > max_size() || __len < __size) in _M_compute_next_size()
308 __len = max_size(); // overflow in _M_compute_next_size()
309 return __len; in _M_compute_next_size()
473 size_type __len = _M_compute_next_size(__n); in _M_appendT() local
474 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len); in _M_appendT()
479 this->_M_reset(__new_start, __new_finish, __new_start + __len); in _M_appendT()
621 size_type __len = (min) (__n, __s.size() - __beg); in insert() local
622 if (__len > max_size() - size()) in insert()
625 __s._M_Start() + __beg, __s._M_Start() + __beg + __len, &__s == this); in insert()
[all …]
D_string_sum_methods.h109 const size_type __len = __old_size + (max)(__old_size, __s_size) + 1; in _M_append_sum() local
110 pointer __new_start = this->_M_start_of_storage.allocate(__len); in _M_append_sum()
115 this->_M_reset(__new_start, __new_finish, __new_start + __len); in _M_append_sum()
133 const size_type __len = __old_size + (max)(__old_size, __s_size) + 1; in _M_append_sum_pos() local
134 pointer __new_start = this->_M_start_of_storage.allocate(__len); in _M_append_sum_pos()
139 this->_M_reset(__new_start, __new_finish, __new_start + __len); in _M_append_sum_pos()
D_bvector.h404 size_type __len = size() ? 2 * size() : _STLP_WORD_BIT;
405 __chunk_type* __q = this->_M_bit_alloc(__len);
410 this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__len);
457 size_type __len = size() + (max)(size(), __n);
458 __chunk_type* __q = this->_M_bit_alloc(__len);
463 this->_M_end_of_storage._M_data = __q + _Base::_M_bits_to_chunks(__len);
639 size_type __len = _STLP_STD::distance(__first, __last);
640 if (__len < size())
730 size_type __len = size() + (max)(size(), __n);
731 __chunk_type* __q = this->_M_bit_alloc(__len);
[all …]
D_vector.h175 size_type __len = __size + (max)(__n, __size); in _M_compute_next_size() local
176 if (__len > max_size() || __len < __size) in _M_compute_next_size()
177 __len = max_size(); // overflow in _M_compute_next_size()
178 return __len; in _M_compute_next_size()
325 const size_type __len = _STLP_STD::distance(__first, __last); local
326 if (__len > capacity()) {
327 size_type __n = __len;
330 _M_set(__tmp, __tmp + __len, __tmp + __n);
332 else if (size() >= __len) {
432 size_type __len = _M_compute_next_size(__n);
[all …]
D_list.c97 size_type __len = 0; in resize() local
98 for ( ; __i != end() && __len < __new_size; ++__i, ++__len); in resize()
100 if (__len == __new_size) in resize()
103 insert(end(), __new_size - __len, __x); in resize()
D_heap.h50 _Distance __len, _Tp __val);
69 _Distance __len, _Tp __val, _Compare __comp);
D_slist.c106 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) { in resize() argument
108 while (__cur->_M_next != 0 && __len > 0) { in resize()
109 --__len; in resize()
115 _M_insert_after_fill(__cur, __len, __x); in resize()
D_algo.c754 _Predicate __pred, _Distance __len, in __inplace_stable_partition() argument
756 if (__len == 1) in __inplace_stable_partition()
759 _Distance __half_len = __len / 2; in __inplace_stable_partition()
763 …_STLP_PRIV __inplace_stable_partition(__middle, __last, __pred, __len - __half_len, true, __pred_o… in __inplace_stable_partition()
770 _Predicate __pred, _Distance __len, in __stable_partition_adaptive() argument
773 if (__len <= __buffer_size) { in __stable_partition_adaptive()
778 ++__result2; ++__first; --__len; in __stable_partition_adaptive()
780 for (; __first != __last ; ++__first, --__len) { in __stable_partition_adaptive()
781 if (((__len == 1) && (__pred_of_before_last || __pred(*__first))) || in __stable_partition_adaptive()
782 ((__len != 1) && __pred(*__first))){ in __stable_partition_adaptive()
[all …]
D_rope.h161 virtual void operator()(size_t __start_pos, size_t __len,
256 void append(const value_type *__s, size_t __len) {
257 if (__len + _M_buf_count <= _Buf_sz) {
260 for (; __j < __len; __i++, __j++) {
263 _M_buf_count += __len;
265 _M_prefix->append(__s, __s + __len);
268 append(__s, __len);
271 _Self& write(const value_type *__s, size_t __len) {
272 append(__s, __len);
296 virtual bool operator()(const _CharT* __buffer, size_t __len) = 0;
[all …]
D_algobase.c455 _Distance __len = _STLP_STD::distance(__first, __last);
459 while (__len > 0) {
460 __half = __len >> 1;
467 __len = __len - __half - 1;
470 __len = __half;
D_string_workaround.h221 size_type __len = this->_M_compute_next_size(__n); in _M_appendT() local
222 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len); in _M_appendT()
227 this->_M_reset(__new_start, __new_finish, __new_start + __len); in _M_appendT()
377 size_type __len = this->_M_compute_next_size(__n); in _M_insert_overflow() local
378 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len); in _M_insert_overflow()
384 this->_M_reset(__new_start, __new_finish, __new_start + __len); in _M_insert_overflow()
D_deque.h639 size_type __len = __last - __first;
640 if (__len > __size) {
652 size_type __len = _STLP_STD::distance(__first, __last);
653 if (__len > size()) {
816 const size_type __len = size();
817 if (__new_size < __len)
820 insert(this->_M_finish, __new_size - __len, __x);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dalgorithm1623 _Size __len = static_cast<_Size>(__last - __first);
1624 if (__len < __count)
3236 difference_type __len = _VSTD::distance(__first, __last);
3237 while (__len != 0)
3239 difference_type __l2 = __len / 2;
3245 __len -= __l2 + 1;
3248 __len = __l2;
3258 _Distance __len, _Pair __p, forward_iterator_tag __fit)
3261 // __len >= 1
3262 if (__len == 1)
[all …]
Dmemory3086 _Size operator()(const void* __key, _Size __len);
3092 __murmur2_or_cityhash<_Size, 32>::operator()(const void* __key, _Size __len)
3096 _Size __h = __len;
3098 for (; __len >= 4; __data += 4, __len -= 4)
3107 switch (__len)
3126 _Size operator()(const void* __key, _Size __len);
3157 static _Size __hash_len_0_to_16(const char* __s, _Size __len) {
3158 if (__len > 8) {
3160 const _Size __b = __loadword<_Size>(__s + __len - 8);
3161 return __hash_len_16(__a, __rotate_by_at_least_1(__b + __len, __len)) ^ __b;
[all …]
Dostream733 const _CharT* __str, size_t __len)
746 __str + __len :
748 __str + __len,
844 size_t __len = char_traits<char>::length(__strn);
849 if (__len > __bs)
851 __wb = (_CharT*)malloc(__len*sizeof(_CharT));
861 __wb + __len :
863 __wb + __len,
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/
D_list.h294 size_type __len = 0; variable
295 for ( ; __i != _M_non_dbg_impl.end() && __len < __new_size; ++__i, ++__len);
297 if (__len == __new_size)
300 _M_non_dbg_impl.insert(_M_non_dbg_impl.end(), __new_size - __len, __x);
/ndk/sources/cxx-stl/llvm-libc++/libcxx/src/support/solaris/
Dxlocale.c74 size_t mbsrtowcs_l(wchar_t *__dest, const char **__src, size_t __len, in mbsrtowcs_l() argument
78 __dest, __src, __len, __ps); in mbsrtowcs_l()

12