/haiku/src/system/libroot/posix/glibc/wcsmbs/ |
H A D | wchar.h | 118 extern wchar_t *wmemchr (__const wchar_t *__s, wchar_t __c, size_t __n) 122 extern int wmemcmp (__const wchar_t *__s1, __const wchar_t *__s2, size_t __n) 126 __const wchar_t *__restrict __s2, size_t __n) __THROW; 130 extern wchar_t *wmemmove (wchar_t *__s1, __const wchar_t *__s2, size_t __n) 134 extern wchar_t *wmemset (wchar_t *__s, wchar_t __c, size_t __n) __THROW; 140 __const wchar_t *__restrict __s2, size_t __n) 160 __const char *__restrict __s, size_t __n, 168 extern size_t __mbrlen (__const char *__restrict __s, size_t __n, 170 extern size_t mbrlen (__const char *__restrict __s, size_t __n, 344 extern int swprintf (wchar_t *__restrict __s, size_t __n, [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/broadcom43xx/dev/bwi/ |
H A D | bitops.h | 70 #define __BIT(__n) (((__n) == 32) ? 0 : ((uint32_t)1 << (__n))) 73 #define __BITS(__m, __n) \ 74 ((__BIT(MAX((__m), (__n)) + 1) - 1) ^ (__BIT(MIN((__m), (__n))) - 1))
|
/haiku/src/system/libroot/posix/glibc/include/bits/ |
H A D | stdio.h | 102 getline (char **__lineptr, size_t *__n, FILE *__stream) __THROW 104 return __getdelim (__lineptr, __n, '\n', __stream);
|
/haiku/src/system/libroot/posix/glibc/stdlib/ |
H A D | stdlib.h | 409 extern char *l64a (long int __n) __THROW; 825 extern int mblen (__const char *__s, size_t __n) __THROW; 829 __const char *__restrict __s, size_t __n) __THROW; 837 __const char *__restrict __s, size_t __n) __THROW; 840 __const wchar_t *__restrict __pwcs, size_t __n)
|
/haiku/src/system/libroot/posix/glibc/math/bits/ |
H A D | mathcalls.h | 271 __MATHCALL (scalb,, (_Mdouble_ __x, _Mdouble_ __n)); 276 __MATHCALL (scalbn,, (_Mdouble_ __x, int __n)); 285 __MATHCALL (scalbln,, (_Mdouble_ __x, long int __n));
|
/haiku/headers/cpp/ |
H A D | stl_vector.h | 69 _Tp* _M_allocate(size_t __n) argument 70 { return _M_data_allocator.allocate(__n); } 71 void _M_deallocate(_Tp* __p, size_t __n) argument 72 { if (__p) _M_data_allocator.deallocate(__p, __n); } 94 _Tp* _M_allocate(size_t __n) argument 95 { return _Alloc_type::allocate(__n); } 96 void _M_deallocate(_Tp* __p, size_t __n) argument 97 { _Alloc_type::deallocate(__p, __n);} 111 _Vector_base(size_t __n, const allocator_type& __a) : _Base(__a) { argument 112 _M_start = _M_allocate(__n); 220 operator [](size_type __n) argument 223 at(size_type __n) argument 238 vector(size_type __n, const _Tp& __value, const allocator_type& __a = allocator_type()) argument 243 vector(size_type __n) argument 261 _M_initialize_aux(_Integer __n, _Integer __value, __true_type) argument 283 reserve(size_type __n) argument 311 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 356 size_type __n = __position - begin(); local 366 size_type __n = __position - begin(); local 384 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, __true_type) argument 433 _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last) argument 444 _M_allocate_and_copy(size_type __n, const_iterator __first, const_iterator __last) argument 471 size_type __n = 0; local 544 assign(size_t __n, const value_type& __val) argument 664 insert(iterator __position, size_type __n, const _Tp& __x) argument 731 size_type __n = 0; local 783 size_type __n = 0; local [all...] |
H A D | bitset | 45 #define __BITSET_WORDS(__n,__wt) \ 46 ((__n) < 1 ? 1 : ((__n) + __BITS_PER_WORDT(__wt) - 1)/__BITS_PER_WORDT(__wt)) 183 const size_t __n = min(sizeof(unsigned long)*CHAR_BIT, 185 for(size_t __i = 0; __i < __n; ++__i, __val >>= 1) 197 size_t __n = _Nw - 1; 198 for ( ; __n > __wshift; --__n) 199 _M_w[__n] = (_M_w[__n [all...] |
H A D | pthread_alloc | 65 // Returns an object of size __n, and possibly adds to size n free list. 66 void *_M_refill(size_t __n); 123 static void * allocate(size_t __n) 129 if (__n > _Max_size) { 130 return(malloc_alloc::allocate(__n)); 137 __my_free_list = __a -> __free_list + _S_freelist_index(__n); 140 void *__r = __a -> _M_refill(_S_round_up(__n)); 148 static void deallocate(void *__p, size_t __n) 154 if (__n > _Max_size) { 155 malloc_alloc::deallocate(__p, __n); [all...] |
H A D | ropeimpl.h | 216 void _Rope_iterator_base<_CharT,_Alloc>::_M_incr(size_t __n) { argument 217 _M_current_pos += __n; 220 if (__chars_left > __n) { 221 _M_buf_ptr += __n; 222 } else if (__chars_left == __n) { 223 _M_buf_ptr += __n; 232 void _Rope_iterator_base<_CharT,_Alloc>::_M_decr(size_t __n) { argument 235 if (__chars_left >= __n) { 236 _M_buf_ptr -= __n; 241 _M_current_pos -= __n; 298 _S_free_string(_CharT* __s, size_t __n, allocator_type __a) argument 759 operator ()(const _CharT* __leaf, size_t __n) argument 775 operator ()(const _CharT* __leaf, size_t __n) argument 802 operator ()(const _CharT* __leaf, size_t __n) argument 811 operator ()(const char* __leaf, size_t __n) argument 891 _Rope_fill(ostream& __o, size_t __n) argument 1371 rope(size_t __n, _CharT __c, const allocator_type& __a) argument [all...] |
H A D | stl_algo.h | 239 _Size& __n) { 242 ++__n; 247 _Size& __n) { 250 ++__n; 258 typename iterator_traits<_InputIter>::difference_type __n = 0; local 261 ++__n; 262 return __n; 268 typename iterator_traits<_InputIter>::difference_type __n = 0; local 271 ++__n; 272 return __n; 238 count(_InputIter __first, _InputIter __last, const _Tp& __value, _Size& __n) argument 246 count_if(_InputIter __first, _InputIter __last, _Predicate __pred, _Size& __n) argument 384 _Integer __n = __count - 1; local 413 _Integer __n = __count - 1; local 510 generate_n(_OutputIter __first, _Size __n, _Generator __gen) argument 693 __gcd(_EuclideanRingElement __m, _EuclideanRingElement __n) argument 771 _Distance __n = __last - __first; local 837 __random_number(_Distance __n) argument 866 random_sample_n(_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n) argument 888 random_sample_n(_ForwardIter __first, _ForwardIter __last, _OutputIter __out, const _Distance __n, _RandomNumberGenerator& __rand) argument 910 __random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out, const _Distance __n) argument 932 __random_sample(_InputIter __first, _InputIter __last, _RandomAccessIter __out, _RandomNumberGenerator& __rand, const _Distance __n) argument 1266 __lg(_Size __n) argument 2809 __is_heap(_RandomAccessIter __first, _Distance __n) argument 2822 __is_heap(_RandomAccessIter __first, _StrictWeakOrdering __comp, _Distance __n) argument [all...] |
H A D | stl_algobase.h | 138 for (_Distance __n = __last - __first; __n > 0; --__n) { 238 for (_Distance __n = __last - __first; __n > 0; --__n) 353 _OutputIter fill_n(_OutputIter __first, _Size __n, const _Tp& __value) { argument 354 for ( ; __n > 0; --__n, ++__first)
|
H A D | stl_alloc.h | 159 static void* allocate(size_t __n) argument 161 void* __result = malloc(__n); 162 if (0 == __result) __result = _S_oom_malloc(__n); 166 static void deallocate(void* __p, size_t /* __n */) 196 __malloc_alloc_template<__inst>::_S_oom_malloc(size_t __n) argument 205 __result = malloc(__n); 211 void* __malloc_alloc_template<__inst>::_S_oom_realloc(void* __p, size_t __n) argument 220 __result = realloc(__p, __n); 231 static _Tp* allocate(size_t __n) argument 232 { return 0 == __n 235 deallocate(_Tp* __p, size_t __n) argument 257 allocate(size_t __n) argument 264 deallocate(void* __p, size_t __n) argument 405 allocate(size_t __n) argument 431 deallocate(void* __p, size_t __n) argument 532 _S_refill(size_t __n) argument 758 allocate(size_type __n, const void* = 0) argument 764 deallocate(pointer __p, size_type __n) argument 835 allocate(size_type __n, const void* = 0) argument 842 deallocate(pointer __p, size_type __n) argument [all...] |
H A D | stl_bvector.h | 118 difference_type __n = __i + _M_offset; local 119 _M_p += __n / __WORD_BIT; 120 __n = __n % __WORD_BIT; 121 if (__n < 0) { 122 _M_offset = (unsigned int) __n + __WORD_BIT; 125 _M_offset = (unsigned int) __n; 205 difference_type __n = __i + _M_offset; local 206 _M_p += __n / __WORD_BIT; 207 __n 261 _M_bit_alloc(size_t __n) argument 291 _M_bit_alloc(size_t __n) argument 335 _M_bit_alloc(size_t __n) argument 414 _M_initialize(size_type __n) argument 452 size_type __n = 0; local 473 size_type __n = 0; local 516 operator [](size_type __n) argument 526 __BVECTOR(size_type __n, bool __value, const allocator_type& __a = allocator_type()) argument 534 __BVECTOR(size_type __n) argument 558 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 573 size_type __n = 0; local 582 size_type __n = 0; local 607 assign(size_t __n, bool __x) argument 627 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 663 reserve(size_type __n) argument 689 difference_type __n = __position - begin(); local 707 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 763 insert(iterator __position, size_type __n, bool __x) argument [all...] |
H A D | stl_deque.h | 92 __deque_buf_size(size_t __n, size_t __size) argument 94 return __n != 0 ? __n : (__size < 512 ? size_t(512 / __size) : size_t(1)); 174 _Self& operator+=(difference_type __n) argument 176 difference_type __offset = __n + (_M_cur - _M_first); 178 _M_cur += __n; 190 _Self operator+(difference_type __n) const 193 return __tmp += __n; 196 _Self& operator-=(difference_type __n) { return *this += -__n; } argument 296 _M_allocate_map(size_t __n) argument 298 _M_deallocate_map(_Tp** __p, size_t __n) argument 325 _M_allocate_map(size_t __n) argument 327 _M_deallocate_map(_Tp** __p, size_t __n) argument 410 _M_allocate_map(size_t __n) argument 412 _M_deallocate_map(_Tp** __p, size_t __n) argument 543 operator [](size_type __n) argument 570 deque(size_type __n, const value_type& __value, const allocator_type& __a = allocator_type()) argument 573 deque(size_type __n) argument 587 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) argument 640 assign(size_type __n, const _Tp& __val) argument 662 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 782 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, __true_type) argument 895 _M_reserve_elements_at_front(size_type __n) argument 902 _M_reserve_elements_at_back(size_type __n) argument 966 insert(iterator __pos, size_type __n, const value_type& __x) argument 989 size_type __n = __last - __first; local 1016 size_type __n = __last - __first; local 1049 difference_type __n = __last - __first; local 1125 size_type __n = 0; local 1253 size_type __n = 0; local 1340 _M_insert_aux(iterator __pos, size_type __n, const value_type& __x) argument 1399 _M_insert_aux(iterator __pos, _ForwardIterator __first, _ForwardIterator __last, size_type __n) argument 1460 _M_insert_aux(iterator __pos, const value_type* __first, const value_type* __last, size_type __n) argument 1518 _M_insert_aux(iterator __pos, const_iterator __first, const_iterator __last, size_type __n) argument [all...] |
/haiku/headers/glibc/ |
H A D | printf.h | 73 size_t __n, int *__argtypes); 95 extern size_t parse_printf_format (__const char *__restrict __fmt, size_t __n, 139 __info, size_t __n, int *__restrict __argtypes);
|
/haiku/src/system/libroot/posix/glibc/include/ |
H A D | stdio_private.h | 23 extern _IO_ssize_t __getline (char **__lineptr, size_t *__n,
|
H A D | wchar.h | 9 size_t __n) 19 __const char *__restrict __s, size_t __n, 38 size_t __n); 40 size_t __n); 43 size_t __n); 45 size_t __n); 53 extern int __vswprintf (wchar_t *__restrict __s, size_t __n,
|
/haiku/src/system/libroot/posix/glibc/libio/ |
H A D | libio.h | 366 size_t __n);
|
H A D | libioP.h | 379 #define _IO_sputn(__fp, __s, __n) _IO_XSPUTN (__fp, __s, __n)
|
H A D | stdio.h | 291 int __modes, size_t __n) __THROW; 452 extern char *fgets (char *__restrict __s, int __n, FILE *__restrict __stream) 462 extern char *fgets_unlocked (char *__restrict __s, int __n, 474 size_t *__restrict __n, int __delimiter, 477 size_t *__restrict __n, int __delimiter, 482 size_t *__restrict __n, 502 size_t __n, FILE *__restrict __stream) __THROW; 505 size_t __n, FILE *__restrict __s) __THROW; 517 size_t __n, FILE *__restrict __stream) __THROW; 519 size_t __n, FIL [all...] |
/haiku/src/system/libroot/posix/glibc/stdio-common/ |
H A D | printf.h | 73 size_t __n, int *__argtypes); 95 extern size_t parse_printf_format (__const char *__restrict __fmt, size_t __n, 139 __info, size_t __n, int *__restrict __argtypes)
|
/haiku/src/libs/stdc++/legacy/ |
H A D | valarray.cc | 25 const size_t __n = __l.size(); local 26 size_t* const __t = static_cast<size_t*>(alloca(__n*sizeof(size_t))); 27 __valarray_fill(__t, __n, size_t(0)); 31 for (size_t __k=0; __k<__n; ++__k) 33 ++__t[__n-1]; 34 for (size_t __k=__n-1; __k; --__k) {
|
/haiku/headers/cpp/std/ |
H A D | std_valarray.h | 288 inline valarray<_Tp>::valarray (size_t __n) argument 289 : _M_size (__n), _M_data (new _Tp[__n]) {} 292 inline valarray<_Tp>::valarray (const _Tp& __t, size_t __n) argument 293 : _M_size (__n), _M_data (new _Tp[__n]) 297 inline valarray<_Tp>::valarray (const _Tp* __restrict__ __pT, size_t __n) argument 298 : _M_size (__n), _M_data (new _Tp[__n]) 299 { __valarray_copy (__pT, __n, _M_dat 528 resize(size_t __n, _Tp __c) argument [all...] |
H A D | valarray_array.h | 44 // fill plain array __a[<__n>] with __t 47 __valarray_fill (_Tp* __restrict__ __a, size_t __n, const _Tp& __t) argument 48 { while (__n--) *__a++ = __t; } 50 // fill strided array __a[<__n-1 : __s>] with __t 53 __valarray_fill (_Tp* __restrict__ __a, size_t __n, argument 55 { for (size_t __i=0; __i<__n; ++__i, __a+=__s) *__a = __t; } 57 // fill indirect array __a[__i[<__n>]] with __i 61 size_t __n, const _Tp& __t) 62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; } 64 // copy plain array __a[<__n>] i 60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, size_t __n, const _Tp& __t) argument 67 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b) argument 74 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, size_t __s, _Tp* __restrict__ __b) argument 81 __valarray_copy(const _Tp* __restrict__ __a, _Tp* __restrict__ __b, size_t __n, size_t __s) argument 88 __valarray_copy(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) argument 96 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) argument 121 __valarray_fill(_Array<_Tp> __a, size_t __n, const _Tp& __t) argument 126 __valarray_fill(_Array<_Tp> __a, size_t __n, size_t __s, const _Tp& __t) argument 131 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument 137 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b) argument 142 __valarray_copy(_Array<_Tp> __a, size_t __n, size_t __s, _Array<_Tp> __b) argument 147 __valarray_copy(_Array<_Tp> __a, _Array<_Tp> __b, size_t __n, size_t __s) argument 152 __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument 158 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<size_t> __i) argument 164 _Array(size_t __n) argument [all...] |
H A D | valarray_meta.h | 720 size_t __n (_M_closure.size ()); 721 for (size_t __i=0; __i<__n; ++__i) __s += _M_closure[__i];
|