| /external/stlport/stlport/stl/ |
| _tempbuf.c | 37 __get_temporary_buffer(ptrdiff_t __len, _Tp*)
39 if (__len > ptrdiff_t(INT_MAX / sizeof(_Tp)))
40 __len = INT_MAX / sizeof(_Tp);
42 while (__len > 0) {
43 _Tp* __tmp = (_Tp*) malloc((size_t)__len * sizeof(_Tp));
45 return pair<_Tp*, ptrdiff_t>(__tmp, __len);
46 __len /= 2;
|
| _heap.c | 112 _Distance __len, _Tp __val) {
115 while (__secondChild < __len) {
122 if (__secondChild == __len) {
147 _Distance __len, _Tp __val, _Compare __comp)
151 while (__secondChild < __len) {
161 if (__secondChild == __len) {
194 _Distance __len = __last - __first;
195 _Distance __parent = (__len - 2)/2;
198 __adjust_heap(__first, __parent, __len, _Tp(*(__first + __parent)));
220 _Distance __len = __last - __first
[all...] |
| _string.c | 200 size_type __len = _M_compute_next_size(__n); local
201 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len);
206 this->_M_reset(__new_start, __new_finish, __new_start + __len);
266 size_type __len = _M_compute_next_size(1); local
267 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len);
274 this->_M_reset(__new_start, __new_finish, __new_start + __len);
301 size_type __len = _M_compute_next_size(__n); local
302 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len)
358 size_type __len = _M_compute_next_size(__n); local
374 size_type __len = (size_type)(__last - __first); local
393 const difference_type __len = __last - __first; local
423 const size_t __len = size(); local
454 const size_type __len = size(); local
470 const size_type __len = size(); local
499 const size_type __len = size(); local
543 const size_type __len = size(); local
561 const size_type __len = size(); local
[all...] |
| _vector.c | 87 size_type __len = _M_compute_next_size(__fill_len); local
88 pointer __new_start = this->_M_end_of_storage.allocate(__len, __len);
102 this->_M_end_of_storage.deallocate(__new_start,__len)))
104 _M_set(__new_start, __new_finish, __new_start + __len);
110 size_type __len = _M_compute_next_size(__fill_len); local
111 pointer __new_start = this->_M_end_of_storage.allocate(__len, __len);
118 _M_set(__new_start, __new_finish, __new_start + __len);
188 size_type __len = __xlen
[all...] |
| _string_hash.h | 36 size_t __len = __s.size(); local
38 for ( size_t __i = 0; __i < __len; ++__i)
|
| _tempbuf.h | 49 __get_temporary_buffer(ptrdiff_t __len, _Tp*);
54 inline pair<_Tp*, ptrdiff_t> _STLP_CALL get_temporary_buffer(ptrdiff_t __len) {
55 return __get_temporary_buffer(__len, (_Tp*) 0);
66 get_temporary_buffer(ptrdiff_t __len, _Tp*) {
67 return __get_temporary_buffer(__len, (_Tp*) 0);
|
| _num_put.c | 148 __copy_integer_and_fill(const _CharT* __buf, ptrdiff_t __len,
152 if (__len >= __wid)
153 return _STLP_STD::copy(__buf, __buf + __len, __oi);
160 __STATIC_CAST(streamsize, __wid - __len)));
164 __oi = _STLP_STD::copy(__buf, __buf + __len, __oi);
167 else if (__dir == ios_base::internal && __len != 0 &&
171 return _STLP_STD::copy(__buf + 1, __buf + __len, __oi);
173 else if (__dir == ios_base::internal && __len >= 2 &&
179 return _STLP_STD::copy(__buf + 2, __buf + __len, __oi);
183 return _STLP_STD::copy(__buf, __buf + __len, __oi)
203 ptrdiff_t __len = __iend - __buf; local
235 ptrdiff_t __len = __iend - __buf; local
[all...] |
| _string_sum_methods.h | 109 const size_type __len = __old_size + (max)(__old_size, __s_size) + 1; local
110 pointer __new_start = this->_M_start_of_storage.allocate(__len);
115 this->_M_reset(__new_start, __new_finish, __new_start + __len);
133 const size_type __len = __old_size + (max)(__old_size, __s_size) + 1; local
134 pointer __new_start = this->_M_start_of_storage.allocate(__len);
139 this->_M_reset(__new_start, __new_finish, __new_start + __len);
|
| _string.h | 306 size_type __len = __size + (max)(__n, __size) + 1; local
307 if (__len > max_size() || __len < __size)
308 __len = max_size(); // overflow
309 return __len;
473 size_type __len = _M_compute_next_size(__n); local
474 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len);
479 this->_M_reset(__new_start, __new_finish, __new_start + __len);
621 size_type __len = (min) (__n, __s.size() - __beg) local
625 __s._M_Start() + __beg, __s._M_Start() + __beg + __len, &__s == this); local
642 size_type __len = _Traits::length(__s); local
691 size_type __len = _M_compute_next_size(__n); local
817 const size_type __len = (min) (__n, __size - __pos); local
844 const size_type __len = (min) (__n1, __size - __pos); local
861 const size_type __len = (min) (__n1, __size - __pos); local
937 const size_type __len = (min) (__n, size() - __pos); local
[all...] |
| _rope.c | 106 size_t __len = _S_iterator_buf_len; local
112 if (__buf_start_pos + __len <= __pos) {
113 __buf_start_pos = __pos - __len/4;
114 if (__buf_start_pos + __len > __leaf_end) {
115 __buf_start_pos = __leaf_end - __len;
118 if (__buf_start_pos + __len > __leaf_end) {
119 __len = __leaf_end - __buf_start_pos;
121 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf._M_data);
124 __x._M_buf_end = __x._M_tmp_buf._M_data + __len;
212 size_t __len = __current_node->_M_size._M_data local
825 size_t __len = __end - __begin; local
[all...] |
| _heap.h | 50 _Distance __len, _Tp __val);
69 _Distance __len, _Tp __val, _Compare __comp);
|
| _algo.c | 754 _Predicate __pred, _Distance __len,
756 if (__len == 1)
759 _Distance __half_len = __len / 2;
763 _STLP_PRIV __inplace_stable_partition(__middle, __last, __pred, __len - __half_len, true, __pred_of_before_last));
770 _Predicate __pred, _Distance __len,
773 if (__len <= __buffer_size) {
778 ++__result2; ++__first; --__len;
780 for (; __first != __last ; ++__first, --__len) {
781 if (((__len == 1) && (__pred_of_before_last || __pred(*__first))) ||
782 ((__len != 1) && __pred(*__first)))
1077 _Distance __len = __last - __first; local
1162 _Distance __len = (__last - __first + 1) \/ 2; local
1358 _Distance __len = _STLP_STD::distance(__first, __last); local
1383 _Distance __len = _STLP_STD::distance(__first, __last); local
[all...] |
| _bvector.h | 404 size_type __len = size() ? 2 * size() : _STLP_WORD_BIT; local
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); local
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); local
640 if (__len < size())
730 size_type __len = size() + (max)(size(), __n); local
731 __chunk_type* __q = this->_M_bit_alloc(__len);
751 size_type __len = size() + (max)(size(), __n); local
772 size_type __len = size() + (max)(size(), __n); local
[all...] |
| _slist.c | 106 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) {
108 while (__cur->_M_next != 0 && __len > 0) {
109 --__len;
115 _M_insert_after_fill(__cur, __len, __x);
|
| _list.c | 97 size_type __len = 0; local
98 for ( ; __i != end() && __len < __new_size; ++__i, ++__len);
100 if (__len == __new_size)
103 insert(end(), __new_size - __len, __x);
|
| _vector.h | 175 size_type __len = __size + (max)(__n, __size); local
176 if (__len > max_size() || __len < __size)
177 __len = max_size(); // overflow
178 return __len;
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); local
[all...] |
| _algobase.c | 455 _Distance __len = _STLP_STD::distance(__first, __last); local
459 while (__len > 0) {
460 __half = __len >> 1;
467 __len = __len - __half - 1;
470 __len = __half;
|
| _string_workaround.h | 221 size_type __len = this->_M_compute_next_size(__n); local
222 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len);
227 this->_M_reset(__new_start, __new_finish, __new_start + __len);
377 size_type __len = this->_M_compute_next_size(__n); local
378 pointer __new_start = this->_M_start_of_storage.allocate(__len, __len);
384 this->_M_reset(__new_start, __new_finish, __new_start + __len);
|
| _rope.h | 161 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
1559 size_t __len = (__pos + __n > _p_size? _p_size - __pos : __n); local
1665 size_t __len = _S_char_ptr_len(__c_string); local
[all...] |
| /external/opencore/doc/oscl_html/ |
| classOsclNameString.html | 3 <title> TemplateOsclNameString< __len > class Reference</title>
9 <hr><h1>OsclNameString< __len > Class Template Reference<br>
26 <h3>template<int __len><br>
27 class OsclNameString< __len ></h3>
39 template<int __len> </td>
42 <td class="md" nowrap valign="top"> OsclNameString< __len >::OsclNameString </td>
71 template<int __len> </td>
74 <td class="md" nowrap valign="top"> OsclNameString< __len >::OsclNameString </td>
104 template<int __len> </td>
107 <td class="md" nowrap valign="top"> OsclNameString< __len >::OsclNameString </td
[all...] |
| oscl__namestring_8h-source.html | 23 00031 <span class="keyword">template</span><<span class="keywordtype">int</span> __len>
44 00060 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0;i < __len;i++)
48 00064 <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0;i < __len - 1;i++)
69 00085 <span class="keywordflow">return</span> __len;
73 00089 uint8 iStr[__len];
|
| /external/opencore/oscl/oscl/osclerror/src/ |
| oscl_namestring.h | 48 template<int __len>
77 for (int i = 0; i < __len; i++)
81 for (int i = 0; i < __len - 1; i++)
102 return __len;
106 uint8 iStr[__len];
|
| /external/bison/lib/ |
| obstack.h | 282 int __len = (length); \
283 if (__o->chunk_limit - __o->next_free < __len) \
284 _obstack_newchunk (__o, __len); \
298 int __len = (length); \
299 if (__o->next_free + __len > __o->chunk_limit) \
300 _obstack_newchunk (__o, __len); \
301 memcpy (__o->next_free, where, __len); \
302 __o->next_free += __len; \
308 int __len = (length); \
309 if (__o->next_free + __len + 1 > __o->chunk_limit)
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
| obstack.h | 325 int __len = (length); \
326 if (__o->chunk_limit - __o->next_free < __len) \
327 _obstack_newchunk (__o, __len); \
338 int __len = (length); \
339 if (__o->next_free + __len > __o->chunk_limit) \
340 _obstack_newchunk (__o, __len); \
341 _obstack_memcpy (__o->next_free, (where), __len); \
342 __o->next_free += __len; \
348 int __len = (length); \
349 if (__o->next_free + __len + 1 > __o->chunk_limit)
[all...] |
| /external/stlport/stlport/stl/debug/ |
| _list.h | 294 size_type __len = 0; local
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);
|
