/haiku/headers/build/gcc-2.95.3/ |
H A D | va-sparc.h | 152 ? ({ union {char __d[sizeof (TYPE)]; int __i[2];} __u; \ 153 __u.__i[0] = ((int *) (void *) (pvar))[0]; \ 154 __u.__i[1] = ((int *) (void *) (pvar))[1]; \
|
/haiku/headers/cpp/ |
H A D | bitset | 99 for ( size_t __i = 0; __i < _Nw; __i++ ) { 100 _M_w[__i] &= __x._M_w[__i]; 105 for ( size_t __i = 0; __i < _Nw; __i++ ) { 106 _M_w[__i] |= __x._M_w[__i]; [all...] |
H A D | pthread_alloc | 296 int __i; 307 for (__i = 1; ; __i++) { 310 if (__nobjs - 1 == __i) {
|
H A D | ropeimpl.h | 136 int __i = -1; local 141 __x._M_path_end[++__i] = __path[__j++]; 143 __x._M_leaf_index = __i; 197 int __i; local 198 for (__i = 0; __i < _S_path_cache_len-1; __i++) { 199 __x._M_path_end[__i] = __x._M_path_end[__i+1]; 776 size_t __i; local 805 size_t __i; local 814 size_t __i; local 894 size_t __i; local 1084 int __i; local 1138 int __i; // forest[0..__i-1] is empty local 1184 _S_fetch(_RopeRep* __r, size_type __i) argument 1229 _S_fetch_ptr(_RopeRep* __r, size_type __i) argument [all...] |
H A D | stl_algo.h | 385 _ForwardIter __i = __first; local 386 ++__i; 387 while (__i != __last && __n != 0 && *__i == __val) { 388 ++__i; 394 __first = find(__i, __last, __val); 414 _ForwardIter __i = __first; local 415 ++__i; 416 while (__i != __last && __n != 0 && __binary_pred(*__i, __va 544 _ForwardIter __i = __first; local 553 _ForwardIter __i = __first; local 1926 _ForwardIter __i = lower_bound(__first, __last, __val); local 1934 _ForwardIter __i = lower_bound(__first, __last, __val, __comp); local [all...] |
H A D | stl_alloc.h | 496 size_t __i; local 502 for (__i = __size; __i <= _MAX_BYTES; __i += _ALIGN) { 503 __my_free_list = _S_free_list + _S_freelist_index(__i); 508 _S_end_free = _S_start_free + __i; 540 int __i; local 548 for (__i = 1; ; __i++) { 551 if (__nobjs - 1 == __i) { 638 int __i; local [all...] |
H A D | stl_bvector.h | 117 iterator& operator+=(difference_type __i) { argument 118 difference_type __n = __i + _M_offset; 128 iterator& operator-=(difference_type __i) { argument 129 *this += -__i; 132 iterator operator+(difference_type __i) const { 134 return __tmp += __i; 136 iterator operator-(difference_type __i) const { 138 return __tmp -= __i; 143 reference operator[](difference_type __i) { return *(*this + __i); } argument 204 operator +=(difference_type __i) argument 215 operator -=(difference_type __i) argument 230 operator [](difference_type __i) argument 429 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 483 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 732 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 753 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 773 iterator __i = copy(begin(), __position, iterator(__q, 0)); local [all...] |
H A D | stl_deque.h | 1581 size_type __i; local 1583 for (__i = 1; __i <= __new_nodes; ++__i) 1584 *(_M_start._M_node - __i) = _M_allocate_node(); 1588 for (size_type __j = 1; __j < __i; ++__j) 1602 size_type __i; local 1604 for (__i = 1; __i <= __new_nodes; ++__i) [all...] |
H A D | stl_function.h | 443 size_t __i; local 444 for (__i = 0; __i < 54; __i++) { 445 size_t __ii = (21 * (__i + 1) % 55) - 1; 451 for (__i = 0; __i < 55; __i++) 452 _M_table[__i] = _M_table[__i] [all...] |
H A D | stl_hashtable.h | 994 for (size_type __i = 0; __i < _M_buckets.size(); ++__i) { 995 _Node* __cur = _M_buckets[__i]; 1001 _M_buckets[__i] = 0; 1015 for (size_type __i = 0; __i < __ht._M_buckets.size(); ++__i) { 1016 if (const _Node* __cur = __ht._M_buckets[__i]) { 1018 _M_buckets[__i] [all...] |
H A D | stl_iterator.h | 160 iterator_category(const _Iter& __i) { return __iterator_category(__i); } argument 165 distance_type(const _Iter& __i) { return __distance_type(__i); } argument 169 value_type(const _Iter& __i) { return __value_type(__i); } argument 171 #define __ITERATOR_CATEGORY(__i) __iterator_category(__i) 172 #define __DISTANCE_TYPE(__i) __distance_type(__i) 314 __advance(_InputIter& __i, _Distance __n, input_iterator_tag) 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 437 insert_iterator(_Container& __x, typename _Container::iterator __i) argument 463 inserter(_Container& __x, _Iterator __i) argument [all...] |
H A D | stl_list.h | 488 void splice(iterator __position, list&, iterator __i) { argument 489 iterator __j = __i; 491 if (__position == __i || __position == __j) return; 492 transfer(__position, __i, __j); 604 iterator __i = begin(); local 606 for ( ; __i != end() && __len < __new_size; ++__i, ++__len) 609 erase(__i, end()); 610 else // __i == end() 634 iterator __i local 736 int __i = 0; local 812 int __i = 0; local [all...] |
H A D | stl_map.h | 151 iterator __i = lower_bound(__k); local 152 // __i->first is greater than or equivalent to __k. 153 if (__i == end() || key_comp()(__k, (*__i).first)) 154 __i = insert(__i, value_type(__k, _Tp())); 155 return (*__i).second;
|
H A D | stl_rope.h | 161 size_t __i = _M_buf_count; local 163 for (; __j < __len; __i++, __j++) { 164 _M_buffer[__i] = __s[__j]; 888 // (path_directions >> __i) & 1 is 1 889 // iff we got from _M_path_end[leaf_index - __i - 1] 890 // to _M_path_end[leaf_index - __i] by going to the 1989 void insert(size_t __p, const _CharT* __i, size_t __n) { argument 1993 _S_concat_char_iter(__left, __i, __n)); 2012 void insert(size_t __p, const _CharT* __i, const _CharT* __j) { argument 2013 rope __r(__i, __ 2017 insert(size_t __p, const const_iterator& __i, const const_iterator& __j) argument 2023 insert(size_t __p, const iterator& __i, const iterator& __j) argument 2038 replace(size_t __p, size_t __n, const _CharT* __i, size_t __i_len) 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 2082 replace(size_t __p, const _CharT* __i, size_t __i_len) argument 2090 replace(size_t __p, const _CharT* __i, const _CharT* __j) argument 2094 replace(size_t __p, const const_iterator& __i, const const_iterator& __j) argument 2099 replace(size_t __p, const iterator& __i, const iterator& __j) argument 2127 insert(const iterator& __p, const _CharT* __i, size_t __n) argument 2129 insert(const iterator& __p, const _CharT* __i, const _CharT* __j) argument 2132 insert(const iterator& __p, const const_iterator& __i, const const_iterator& __j) argument 2135 insert(const iterator& __p, const iterator& __i, const iterator& __j) argument 2148 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument 2151 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument 2154 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument 2157 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument 2168 replace(const iterator& __p, const _CharT* __i, size_t __n) argument 2170 replace(const iterator& __p, const _CharT* __i, const _CharT* __j) argument 2172 replace(const iterator& __p, const_iterator __i, const_iterator __j) argument 2175 replace(const iterator& __p, iterator __i, iterator __j) argument 2481 __mutable_reference_at(crope& __c, size_t __i) argument 2486 __mutable_reference_at(wrope& __c, size_t __i) argument [all...] |
H A D | stl_slist.h | 467 for (size_type __i = 0; __i < __n; ++__i) 641 // Linear in distance(begin(), __pos), and in distance(__x.begin(), __i). 642 void splice(iterator __pos, slist& __x, iterator __i) { argument 644 __slist_previous(&__x._M_head, __i._M_node), 645 __i._M_node); 842 int __i = 0; local 843 while (__i < __fill && !__counter[__i] 915 int __i = 0; local [all...] |
H A D | stl_vector.h | 414 iterator __i = copy(__last, _M_finish, __first); local 415 destroy(__i, _M_finish); 531 iterator __i = copy(__x.begin(), __x.end(), begin()); local 532 destroy(__i, _M_finish);
|
/haiku/headers/cpp/std/ |
H A D | gslice_array.h | 97 const valarray<size_t>& __i) 98 : _M_array (__a), _M_index (__i) {} 96 gslice_array(_Array<_Tp> __a, const valarray<size_t>& __i) argument
|
H A D | indirect_array.h | 102 _Array<size_t> __i) 103 : _M_sz (__s), _M_index (__i), _M_array (__a) {} 101 indirect_array(_Array<_Tp> __a, size_t __s, _Array<size_t> __i) argument
|
H A D | std_valarray.h | 265 valarray<_Tp>::operator[] (size_t __i) const 266 { return _M_data[__i]; } 270 valarray<_Tp>::operator[] (size_t __i) argument 271 { return _M_data[__i]; } 436 for (size_t __i=0; __i<__e; ++__i) 437 if (__m[__i]) ++__s; 448 for (size_t __i=0; __i<__ 463 operator [](const valarray<size_t>& __i) argument [all...] |
H A D | valarray_array.h | 55 { for (size_t __i=0; __i<__n; ++__i, __a+=__s) *__a = __t; } 57 // fill indirect array __a[__i[<__n>]] with __i 60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, argument 62 { for (size_t __j=0; __j<__n; ++__j, ++__i) __a[*__i] = __t; } 76 { for (size_t __i=0; __i<__ 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 131 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) 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 [all...] |
H A D | valarray_meta.h | 59 _Vt operator[] (size_t __i) const { return _M_func(_M_expr[__i]); } 103 value_type operator[] (size_t __i) const 104 { return _M_func (_M_expr1[__i], _M_expr2[__i]); } 121 value_type operator[] (size_t __i) const 122 { return _M_func (_M_expr1, _M_expr2[__i]); } 139 value_type operator[] (size_t __i) const 140 { return _M_func (_M_expr1[__i], _M_expr2); } 250 value_type operator[] (size_t __i) cons 554 _GBase(const _Dom& __e, const valarray<size_t>& __i) argument 569 _GBase(_Array<_Tp> __a, const valarray<size_t>& __i) argument 584 _GClos(const _Dom& __e, const valarray<size_t>& __i) argument 593 _GClos(_Array<_Tp> __a, const valarray<size_t>& __i) argument 605 _IBase(const _Dom& __e, const valarray<size_t>& __i) argument 620 _IClos(const _Dom& __e, const valarray<size_t>& __i) argument 629 _IClos(const valarray<_Tp>& __a, const valarray<size_t>& __i) argument [all...] |
/haiku/src/libs/stdc++/legacy/ |
H A D | valarray.cc | 23 valarray<size_t>& __i) 28 const size_t __z = __i.size(); 29 __valarray_fill(&__i[0], __z, __o); 32 __i[__j] += __s[__k]*__t[__k]; 21 __gslice_to_index(size_t __o, const valarray<size_t>& __l, const valarray<size_t>& __s, valarray<size_t>& __i) argument
|
/haiku/src/system/libroot/posix/glibc/stdlib/ |
H A D | gmp-impl.h | 121 mp_size_t __i; \ 122 for (__i = 0; __i < (NLIMBS); __i++) \ 123 (DST)[__i] = (SRC)[__i]; \ 127 mp_size_t __i; \ 128 for (__i = (NLIMBS) - 1; __i >= 0; __i [all...] |
H A D | longlong.h | 316 struct {USItype __h, __l;} __i; \ 320 : "=r" (__xx.__i.__h), \ 321 "=r" (__xx.__i.__l) \ 324 (xh) = __xx.__i.__h; (xl) = __xx.__i.__l; \ 331 struct {USItype __h, __l;} __i; \ 334 : "=r" (__xx.__i.__h), \ 335 "=r" (__xx.__i.__l) \ 338 (xh) = __xx.__i.__h; (xl) = __xx.__i [all...] |
H A D | stdlib.h | 53 (__extension__ ({ union { __typeof(status) __in; int __i; } __u; \ 54 __u.__in = (status); __u.__i; }))
|