/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/headers/cpp/std/ |
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 | 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...] |
/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 | stl_hashtable.h | 91 _Hashtable_iterator(_Node* __n, _Hashtable* __tab) argument 92 : _M_cur(__n), _M_ht(__tab) {} 130 _Hashtable_const_iterator(const _Node* __n, const _Hashtable* __tab) argument 131 : _M_cur(__n), _M_ht(__tab) {} 159 inline unsigned long __stl_next_prime(unsigned long __n) argument 163 const unsigned long* pos = lower_bound(__first, __last, __n); 247 hashtable(size_type __n, 259 _M_initialize_buckets(__n); variable 262 hashtable(size_type __n, 273 _M_initialize_buckets(__n); variable 402 size_type __n = 0; local 413 size_type __n = 0; local 423 size_type __n = __l - __f; local 431 size_type __n = __l - __f; local 439 size_type __n = 0; local 448 size_type __n = 0; local 460 size_type __n = _M_bkt_num_key(__key); local 471 size_type __n = _M_bkt_num_key(__key); local 482 const size_type __n = _M_bkt_num_key(__key); local 511 _M_initialize_buckets(size_type __n) argument 541 _Node* __n = _M_get_node(); local 550 _M_delete_node(_Node* __n) argument 702 const size_type __n = _M_bkt_num(__obj); local 721 const size_type __n = _M_bkt_num(__obj); local 746 size_type __n = _M_bkt_num(__obj); local 766 const size_type __n = _M_bkt_num_key(__key); local 789 const size_type __n = _M_bkt_num_key(__key); local 815 const size_type __n = _M_bkt_num_key(__key); local 849 const size_type __n = _M_bkt_num(__p->_M_val); local 922 const size_type __n = _M_next_size(__num_elements_hint); local 957 _M_erase_bucket(const size_type __n, _Node* __first, _Node* __last) argument 979 _M_erase_bucket(const size_type __n, _Node* __last) 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_hash_map.h | 83 explicit hash_map(size_type __n) argument 84 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} 85 hash_map(size_type __n, const hasher& __hf) argument 86 : _M_ht(__n, __hf, key_equal(), allocator_type()) {} 87 hash_map(size_type __n, const hasher& __hf, const key_equal& __eql, argument 89 : _M_ht(__n, __hf, __eql, __a) {} 97 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) argument 98 : _M_ht(__n, hasher(), key_equal(), allocator_type()) 101 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, argument 103 : _M_ht(__n, __h 106 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 116 hash_map(const value_type* __f, const value_type* __l, size_type __n) argument 119 hash_map(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 123 hash_map(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 132 hash_map(const_iterator __f, const_iterator __l, size_type __n) argument 135 hash_map(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 139 hash_map(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 266 hash_multimap(size_type __n) argument 268 hash_multimap(size_type __n, const hasher& __hf) argument 270 hash_multimap(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 280 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n) argument 284 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument 289 hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 299 hash_multimap(const value_type* __f, const value_type* __l, size_type __n) argument 302 hash_multimap(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 306 hash_multimap(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 315 hash_multimap(const_iterator __f, const_iterator __l, size_type __n) argument 318 hash_multimap(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 322 hash_multimap(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 | stl_hash_set.h | 81 explicit hash_set(size_type __n) argument 82 : _M_ht(__n, hasher(), key_equal(), allocator_type()) {} 83 hash_set(size_type __n, const hasher& __hf) argument 84 : _M_ht(__n, __hf, key_equal(), allocator_type()) {} 85 hash_set(size_type __n, const hasher& __hf, const key_equal& __eql, argument 87 : _M_ht(__n, __hf, __eql, __a) {} 95 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) argument 96 : _M_ht(__n, hasher(), key_equal(), allocator_type()) 99 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, argument 101 : _M_ht(__n, __h 104 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 114 hash_set(const value_type* __f, const value_type* __l, size_type __n) argument 117 hash_set(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 121 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 130 hash_set(const_iterator __f, const_iterator __l, size_type __n) argument 133 hash_set(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 137 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 260 hash_multiset(size_type __n) argument 262 hash_multiset(size_type __n, const hasher& __hf) argument 264 hash_multiset(size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 274 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n) argument 278 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf) argument 283 hash_multiset(_InputIterator __f, _InputIterator __l, size_type __n, const hasher& __hf, const key_equal& __eql, const allocator_type& __a = allocator_type()) argument 293 hash_multiset(const value_type* __f, const value_type* __l, size_type __n) argument 296 hash_multiset(const value_type* __f, const value_type* __l, size_type __n, const hasher& __hf) argument 300 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 309 hash_multiset(const_iterator __f, const_iterator __l, size_type __n) argument 312 hash_multiset(const_iterator __f, const_iterator __l, size_type __n, const hasher& __hf) argument 316 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 | 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...] |
H A D | stl_numeric.h | 175 // Returns __x ** __n, where __n >= 0. _Note that "multiplication" 180 _Tp __power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument 182 if (__n == 0) 185 while ((__n & 1) == 0) { 186 __n >>= 1; 191 __n >>= 1; 192 while (__n != 0) { 194 if ((__n & 1) != 0) 196 __n >> 203 __power(_Tp __x, _Integer __n) argument 212 power(_Tp __x, _Integer __n, _MonoidOperation __oper) argument 218 power(_Tp __x, _Integer __n) argument [all...] |
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_rope.h | 296 /*static*/ _Tp * __name##_allocate(size_t __n) \ 297 { return __name##Allocator(_M_data_allocator).allocate(__n); } \ 298 void __name##_deallocate(_Tp* __p, size_t __n) \ 299 { __name##Allocator(_M_data_allocator).deallocate(__p, __n); } 323 static _Tp* __name##_allocate(size_t __n) \ 324 { return __name##Alloc::allocate(__n); } \ 325 void __name##_deallocate(_Tp *__p, size_t __n) \ 326 { __name##Alloc::deallocate(__p, __n); } 360 static _Tp* __name##_allocate(size_t __n) \ 361 { return __name##Alloc::allocate(__n); } \ 542 _S_rounded_up_size(size_t __n) argument 975 operator +=(ptrdiff_t __n) argument 987 operator -=(ptrdiff_t __n) argument 1017 operator [](size_t __n) argument 1097 operator +=(difference_type __n) argument 1109 operator -=(difference_type __n) argument 1127 operator [](ptrdiff_t __n) argument 1413 _S_rounded_up_size(size_t __n) argument 1417 _S_allocated_capacity(size_t __n) argument 1756 copy(size_type __pos, size_type __n, _CharT* __buffer) const argument 1879 append(const _CharT* __iter, size_t __n) argument 1935 append(size_t __n, _CharT __c) argument 1984 insert(size_t __p, size_t __n, _CharT __c) argument 1989 insert(size_t __p, const _CharT* __i, size_t __n) argument 2031 replace(size_t __p, size_t __n, const rope& __r) argument 2038 replace(size_t __p, size_t __n, const _CharT* __i, size_t __i_len) argument 2044 replace(size_t __p, size_t __n, _CharT __c) argument 2049 replace(size_t __p, size_t __n, const _CharT* __c_string) argument 2054 replace(size_t __p, size_t __n, const _CharT* __i, const _CharT* __j) argument 2060 replace(size_t __p, size_t __n, const const_iterator& __i, const const_iterator& __j) argument 2066 replace(size_t __p, size_t __n, const iterator& __i, const iterator& __j) argument 2105 erase(size_t __p, size_t __n) argument 2119 insert(const iterator& __p, size_t __n, _CharT __c) argument 2127 insert(const iterator& __p, const _CharT* __i, size_t __n) argument 2148 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument 2168 replace(const iterator& __p, const _CharT* __i, size_t __n) argument 2270 resize(size_type __n, _CharT __c) argument 2271 resize(size_type __n) argument 2280 copy(_CharT* __buffer, size_type __n, size_type __pos = 0) const argument 2332 operator -(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2339 operator +(const _Rope_const_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2346 operator +(ptrdiff_t __n, const _Rope_const_iterator<_CharT,_Alloc>& __x) argument 2372 operator -(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2380 operator +(const _Rope_iterator<_CharT,_Alloc>& __x, ptrdiff_t __n) argument 2388 operator +(ptrdiff_t __n, const _Rope_iterator<_CharT,_Alloc>& __x) argument [all...] |
H A D | stl_iterator.h | 263 _Distance& __n, input_iterator_tag) 265 while (__first != __last) { ++__first; ++__n; } 271 _Distance& __n, random_access_iterator_tag) 273 __n += __last - __first; 278 _InputIterator __last, _Distance& __n) 280 __distance(__first, __last, __n, iterator_category(__first)); 289 typename iterator_traits<_InputIterator>::difference_type __n = 0; local 291 ++__first; ++__n; 293 return __n; 314 inline void __advance(_InputIter& __i, _Distance __n, input_iterator_ta argument 262 __distance(_InputIterator __first, _InputIterator __last, _Distance& __n, input_iterator_tag) argument 269 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last, _Distance& __n, random_access_iterator_tag) argument 277 distance(_InputIterator __first, _InputIterator __last, _Distance& __n) argument 323 __advance(_BidirectionalIterator& __i, _Distance __n, bidirectional_iterator_tag) argument 336 __advance(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) argument 342 advance(_InputIterator& __i, _Distance __n) argument 631 operator +=(difference_type __n) argument 638 operator -=(difference_type __n) argument 666 operator +(typename reverse_iterator<_Iterator>::difference_type __n, const reverse_iterator<_Iterator>& __x) argument 723 operator +=(_Distance __n) argument 730 operator -=(_Distance __n) argument 799 operator +(_Dist __n, const reverse_iterator<_RandAccIter, _Tp, _Ref, _Dist>& __x) argument [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 | 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 | stl_uninitialized.h | 185 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, argument 188 return fill_n(__first, __n, __x); 193 __uninitialized_fill_n_aux(_ForwardIter __first, _Size __n, argument 198 for ( ; __n > 0; --__n, ++__cur) 207 __uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x, _Tp1*) argument 210 return __uninitialized_fill_n_aux(__first, __n, __x, _Is_POD()); 215 uninitialized_fill_n(_ForwardIter __first, _Size __n, const _Tp& __x) argument 217 return __uninitialized_fill_n(__first, __n, __x, __VALUE_TYPE(__first));
|
H A D | stl_slist.h | 355 slist(size_type __n, const value_type& __x, argument 357 { _M_insert_after_fill(&_M_head, __n, __x); } 359 explicit slist(size_type __n) : _Base(allocator_type()) argument 360 { _M_insert_after_fill(&_M_head, __n, value_type()); } 392 void assign(size_type __n, const _Tp& __val); 403 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 404 { assign((size_type) __n, (_Tp) __val); } 466 size_type __n, const value_type& __x) { 467 for (size_type __i = 0; __i < __n; ++__i) 482 void _M_insert_after_range(_Node_base* __pos, _Integer __n, _Intege argument 465 _M_insert_after_fill(_Node_base* __pos, size_type __n, const value_type& __x) argument 527 insert_after(iterator __pos, size_type __n, const value_type& __x) argument 563 insert(iterator __pos, size_type __n, const value_type& __x) argument 564 _M_insert_after_fill(__slist_previous(&_M_head, __pos._M_node), __n, __x); local 707 assign(size_type __n, const _Tp& __val) argument [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_list.h | 356 void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, argument 358 insert(__pos, (size_type) __n, (_Tp) __x); 377 void insert(iterator __pos, size_type __n, const _Tp& __x); 404 list(size_type __n, const _Tp& __value, argument 407 { insert(begin(), __n, __value); } local 408 explicit list(size_type __n) argument 410 { insert(begin(), __n, _Tp()); } local 447 void assign(size_type __n, const _Tp& __val); 458 void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type) argument 459 { assign((size_type) __n, (_T 586 insert(iterator __position, size_type __n, const _Tp& __x) argument 633 assign(size_type __n, const _Tp& __val) argument 638 insert(end(), __n, __val); local [all...] |
/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/src/system/libroot/posix/glibc/include/ |
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/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/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/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/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);
|