| /haiku/src/system/libroot/posix/glibc/include/ |
| H A D | argz.h | 7 extern size_t __argz_count_internal (__const char *__argz, size_t __len)
9 extern void __argz_stringify_internal (char *__argz, size_t __len, int __sep)
|
| H A D | string.h | 37 size_t __len = strlen (__old) + 1; \
38 char *__new = (char *) __builtin_alloca (__len); \
39 (char *) memcpy (__new, __old, __len); \
48 size_t __len = __strnlen (__old, (n)); \
49 char *__new = (char *) __builtin_alloca (__len + 1); \
50 __new[__len] = '\0'; \
51 (char *) memcpy (__new, __old, __len); \
|
| H A D | wchar.h | 25 size_t __len, __mbstate_t *__restrict __ps);
28 size_t __len, __mbstate_t *__restrict __ps);
31 size_t __len, __mbstate_t *__restrict __ps);
34 size_t __nwc, size_t __len,
|
| /haiku/headers/cpp/ |
| H A D | stl_tempbuf.h | 39 __get_temporary_buffer(ptrdiff_t __len, _Tp*) argument
41 if (__len > ptrdiff_t(INT_MAX / sizeof(_Tp)))
42 __len = INT_MAX / sizeof(_Tp);
44 while (__len > 0) {
45 _Tp* __tmp = (_Tp*) malloc((size_t)__len * sizeof(_Tp));
47 return pair<_Tp*, ptrdiff_t>(__tmp, __len);
48 __len /= 2;
57 inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len) { argument
58 return __get_temporary_buffer(__len, (_Tp*) 0);
69 inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len, _T argument
[all...] |
| H A D | stl_heap.h | 110 _Distance __len, _Tp __value)
114 while (__secondChild < __len) {
121 if (__secondChild == __len) {
157 _Distance __len, _Tp __value, _Compare __comp)
161 while (__secondChild < __len) {
168 if (__secondChild == __len) {
210 _Distance __len = __last - __first;
211 _Distance __parent = (__len - 2)/2;
214 __adjust_heap(__first, __parent, __len, _Tp(*(__first + __parent)));
235 _Distance __len
109 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) argument
156 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument
[all...] |
| H A D | stl_vector.h | 575 size_type __len = 0; local
576 distance(__first, __last, __len);
578 if (__len > capacity()) {
579 iterator __tmp = _M_allocate_and_copy(__len, __first, __last);
583 _M_end_of_storage = _M_finish = _M_start + __len;
585 else if (size() >= __len) {
613 const size_type __len = __old_size != 0 ? 2 * __old_size : 1; local
614 iterator __new_start = _M_allocate(__len);
623 _M_deallocate(__new_start,__len)));
628 _M_end_of_storage = __new_start + __len;
644 const size_type __len = __old_size != 0 ? 2 * __old_size : 1; local
688 const size_type __len = __old_size + max(__old_size, __n); local
754 const size_type __len = __old_size + max(__old_size, __n); local
804 const size_type __len = __old_size + max(__old_size, __n); local
[all...] |
| H A D | ropeimpl.h | 49 size_t __len = _S_iterator_buf_len; local
55 if (__buf_start_pos + __len <= __pos) {
56 __buf_start_pos = __pos - __len/4;
57 if (__buf_start_pos + __len > __leaf_end) {
58 __buf_start_pos = __leaf_end - __len;
61 if (__buf_start_pos + __len > __leaf_end) {
62 __len = __leaf_end - __buf_start_pos;
64 (*__fn)(__buf_start_pos - __leaf_pos, __len, __x._M_tmp_buf);
67 __x._M_buf_end = __x._M_tmp_buf + __len;
157 size_t __len local
385 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len) argument
409 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len) argument
871 size_t __len = __end - __begin; local
938 _S_flatten(_RopeRep* __r, size_t __start, size_t __len, _CharT* __buffer) argument
[all...] |
| H A D | stl_bvector.h | 427 size_type __len = size() ? 2 * size() : __WORD_BIT; local
428 unsigned int* __q = _M_bit_alloc(__len);
433 _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
481 size_type __len = size() + max(size(), __n); local
482 unsigned int* __q = _M_bit_alloc(__len);
487 _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
649 size_type __len = 0; local
650 distance(__first, __last, __len);
651 if (__len < size())
730 size_type __len local
751 size_type __len = size() + max(size(), __n); local
771 size_type __len = size() + max(size(), __n); local
[all...] |
| H A D | stl_algo.h | 1035 _Predicate __pred, _Distance __len) {
1036 if (__len == 1)
1039 advance(__middle, __len / 2);
1041 __len / 2),
1044 __len - __len / 2));
1051 _Predicate __pred, _Distance __len,
1055 if (__len <= __buffer_size) {
1072 advance(__middle, __len / 2);
1075 __len /
1033 __inplace_stable_partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len) argument
1049 __stable_partition_adaptive(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) argument
1441 _Distance __len = __last - __first; local
1460 _Distance __len = __last - __first; local
1478 _Distance __len = (__last - __first + 1) / 2; local
1497 _Distance __len = (__last - __first + 1) / 2; local
1726 _Distance __len = 0; local
1757 _Distance __len = 0; local
1788 _Distance __len = 0; local
1819 _Distance __len = 0; local
1851 _Distance __len = 0; local
1889 _Distance __len = 0; local
[all...] |
| H A D | stl_rope.h | 77 virtual void operator()(size_t __start_pos, size_t __len,
158 void append(value_type* __s, size_t __len) argument
160 if (__len + _M_buf_count <= _Buf_sz) {
163 for (; __j < __len; __i++, __j++) {
166 _M_buf_count += __len;
168 _M_prefix->append(__s, __s + __len);
171 append(__s, __len);
174 sequence_buffer& write(value_type* __s, size_t __len) argument
176 append(__s, __len);
204 virtual bool operator()(const _CharT* __buffer, size_t __len)
1619 rope(const _CharT* __s, size_t __len, const allocator_type& __a = allocator_type()) argument
1663 rope(char_producer<_CharT> *__fn, size_t __len, bool __delete_fn, const allocator_type& __a = allocator_type()) argument
1759 size_t __len = (__pos + __n > __size? __size - __pos : __n); local
1888 size_t __len = _S_char_ptr_len(__c_string); local
[all...] |
| H A D | stl_deque.h | 614 const size_type __len = size(); local
616 if (__len >= __x.size())
619 const_iterator __mid = __x.begin() + difference_type(__len);
678 size_type __len = 0; local
679 distance(__first, __last, __len);
680 if (__len > size()) {
804 const size_type __len = size(); local
805 if (__new_size < __len)
808 insert(_M_finish, __new_size - __len, __x);
|
| H A D | stl_list.h | 605 size_type __len = 0; local
606 for ( ; __i != end() && __len < __new_size; ++__i, ++__len)
608 if (__len == __new_size)
611 insert(end(), __new_size - __len, __x);
|
| H A D | stl_slist.h | 777 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) argument
780 while (__cur->_M_next != 0 && __len > 0) {
781 --__len;
787 _M_insert_after_fill(__cur, __len, __x);
|
| H A D | stl_tree.h | 1278 int __len = __black_count(_M_leftmost(), _M_root()); local
1294 if (!__L && !__R && __black_count(__x, _M_root()) != __len)
|
| /haiku/src/system/libroot/posix/glibc/extensions/ |
| H A D | obstack.h | 386 int __len = (length); \
387 if (__o->chunk_limit - __o->next_free < __len) \
388 _obstack_newchunk (__o, __len); \
399 int __len = (length); \
400 if (__o->next_free + __len > __o->chunk_limit) \
401 _obstack_newchunk (__o, __len); \
402 _obstack_memcpy (__o->next_free, (where), __len); \
403 __o->next_free += __len; \
409 int __len = (length); \
410 if (__o->next_free + __len
[all...] |
| /haiku/src/system/libroot/posix/glibc/stdlib/ |
| H A D | stdlib.h | 807 size_t __len) __THROW;
810 size_t __len) __THROW;
814 char *__restrict __buf, size_t __len) __THROW;
817 char *__restrict __buf, size_t __len) __THROW;
|
| /haiku/src/system/libroot/posix/glibc/wcsmbs/ |
| H A D | wchar.h | 178 __const char **__restrict __src, size_t __len,
184 __const wchar_t **__restrict __src, size_t __len,
|
| /haiku/src/system/libroot/posix/glibc/libio/ |
| H A D | stdio.h | 273 extern FILE *fmemopen (void *__s, size_t __len, __const char *__modes) __THROW;
|