/macosx-10.10.1/libstdcxx-104.1/src/ |
H A D | numeric_members.cc | 55 for (size_t __i = 0; __i < __num_base::_S_oend; ++__i) 56 _M_data->_M_atoms_out[__i] = __num_base::_S_atoms_out[__i]; 58 for (size_t __i = 0; __i < __num_base::_S_iend; ++__i) 59 _M_data->_M_atoms_in[__i] = __num_base::_S_atoms_in[__i]; [all...] |
H A D | monetary_members.cc | 68 for (size_t __i = 0; __i < money_base::_S_end; ++__i) 69 _M_data->_M_atoms[__i] = money_base::_S_atoms[__i]; 94 for (size_t __i = 0; __i < money_base::_S_end; ++__i) 95 _M_data->_M_atoms[__i] = money_base::_S_atoms[__i]; [all...] |
H A D | ctype_members.cc | 153 wint_t __i; local 154 for (__i = 0; __i < 128; ++__i) 156 const int __c = wctob(__i); 160 _M_narrow[__i] = static_cast<char>(__c); 162 if (__i == 128) 166 for (size_t __i = 0; 167 __i < sizeof(_M_widen) / sizeof(wint_t); ++__i) [all...] |
H A D | localename.cc | 73 size_t __i = 0; local 75 for (; __i < _S_categories_size; ++__i) 77 __env = std::getenv(_S_categories[__i]); 84 for (; __i < _S_categories_size; ++__i) 86 __env = std::getenv(_S_categories[__i]); 94 if (__i < _S_categories_size) 98 for (size_t __j = 0; __j < __i; ++__j) 105 __str += _S_categories[__i]; [all...] |
H A D | locale.cc | 134 for (size_t __i = 1; __i < _S_categories_size; ++__i) 137 __ret += _S_categories[__i]; 139 __ret += _M_impl->_M_names[__i]; 230 for (size_t __i = 0; __i < _M_facets_size; ++__i) 231 if (_M_facets[__i]) 232 _M_facets[__i] [all...] |
H A D | pool_allocator.cc | 49 size_t __i = ((__bytes + (size_t)_S_align - 1) / (size_t)_S_align - 1); local 50 return _S_free_list + __i; 102 size_t __i = __n; 103 for (; __i <= (size_t) _S_max_bytes; __i += (size_t) _S_align) 105 _Obj* volatile* __free_list = _M_get_free_list(__i); 111 _S_end_free = _S_start_free + __i; 147 for (int __i = 1; ; __i++) 151 if (__nobjs - 1 == __i) [all...] |
H A D | ctype.cc | 57 size_t __i = ctype<char>::id._M_id(); local 59 return static_cast<const ctype<char>&>(*(__tmp->_M_facets[__i])); 67 size_t __i = ctype<wchar_t>::id._M_id(); local 69 return static_cast<const ctype<wchar_t>&>(*(__tmp->_M_facets[__i]));
|
H A D | valarray-inst.cc | 69 const valarray<size_t>& __s, valarray<size_t>& __i) 83 const size_t __z = __i.size(); 94 __i[__j] = __a; 68 __gslice_to_index(size_t __o, const valarray<size_t>& __l, const valarray<size_t>& __s, valarray<size_t>& __i) argument
|
H A D | ios.cc | 142 for (int __i = 0; __i < _M_word_size; __i++) 143 __words[__i] = _M_word[__i];
|
H A D | mt_allocator.cc | 512 size_t __i; local 513 for (__i = 1; __i < _M_options._M_max_threads; ++__i) 515 _Thread_record& __tr = _M_thread_freelist[__i - 1]; 516 __tr._M_next = &_M_thread_freelist[__i]; 517 __tr._M_id = __i; 521 _M_thread_freelist[__i - 1]._M_next = NULL; 522 _M_thread_freelist[__i - 1]._M_id = __i; 705 size_t __i; local [all...] |
/macosx-10.10.1/bind9-45.101/bind9/lib/lwres/win32/include/lwres/ |
H A D | net.h | 79 u_int __i; \ 80 for (__i = 0; __i < ((fd_set FAR *)(set))->fd_count; __i++) { \ 81 if (((fd_set FAR *)(set))->fd_array[__i] == (SOCKET) fd) { \ 82 while (__i < ((fd_set FAR *)(set))->fd_count-1) { \ 83 ((fd_set FAR *)(set))->fd_array[__i] = \ 84 ((fd_set FAR *)(set))->fd_array[__i+1]; \ 85 __i++; \ 95 u_int __i; \ [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/bits/ |
H A D | stl_iterator_base_funcs.h | 124 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag) argument 129 ++__i; 134 __advance(_BidirectionalIterator& __i, _Distance __n, argument 142 ++__i; 145 --__i; 150 __advance(_RandomAccessIterator& __i, _Distance __n, argument 156 __i += __n; 173 advance(_InputIterator& __i, _Distance __n) argument 177 std::__advance(__i, __d, std::__iterator_category(__i)); [all...] |
H A D | valarray_array.h | 195 // copy-construct raw array [__o, *) from indexed array __a[__i[<__n>]] 199 const size_t* __restrict__ __i, 204 *__o++ = __a[*__i++]; 207 new (__o++) _Tp(__a[*__i++]); 238 for (size_t __i = 0; __i < __n; ++__i, __a += __s) 242 // fill indir ect array __a[__i[<__n>]] with __i 245 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, argument 198 __valarray_copy_construct(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __o, size_t __n) argument 316 __valarray_copy(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) argument 327 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) argument 338 __valarray_copy(const _Tp* __restrict__ __src, size_t __n, const size_t* __restrict__ __i, _Tp* __restrict__ __dst, const size_t* __restrict__ __j) argument 431 __valarray_copy_construct(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument 455 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument 488 __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument 495 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<size_t> __i) argument 503 __valarray_copy(_Array<_Tp> __src, size_t __n, _Array<size_t> __i, _Array<_Tp> __dst, _Array<size_t> __j) argument [all...] |
H A D | boost_concept_check.h | 430 (void)*__i; // require dereference operator 432 _Tp __i; 440 *__i = *__j; // require dereference and assignment 442 _Tp __i, __j; 459 ++__i; // require preincrement operator 460 __i++; // require postincrement operator 462 _Tp __i; 470 ++__i; // require preincrement operator 471 __i++; // require postincrement operator 472 *__i [all...] |
H A D | char_traits.h | 151 for (std::size_t __i = 0; __i < __n; ++__i) 152 if (lt(__s1[__i], __s2[__i])) 154 else if (lt(__s2[__i], __s1[__i])) 164 std::size_t __i = 0; local 165 while (!eq(__p[__i], char_type())) 166 ++__i; [all...] |
H A D | stl_bvector.h | 140 _M_incr(ptrdiff_t __i) argument 142 difference_type __n = __i + _M_offset; 154 operator==(const _Bit_iterator_base& __i) const 155 { return _M_p == __i._M_p && _M_offset == __i._M_offset; } 158 operator<(const _Bit_iterator_base& __i) const 160 return _M_p < __i._M_p 161 || (_M_p == __i._M_p && _M_offset < __i._M_offset); 165 operator!=(const _Bit_iterator_base& __i) cons 234 operator +=(difference_type __i) argument 241 operator -=(difference_type __i) argument 320 operator +=(difference_type __i) argument 327 operator -=(difference_type __i) argument 918 iterator __i = _M_copy_aligned(begin(), __position, local 963 iterator __i = _M_copy_aligned(begin(), __position, local 992 iterator __i = _M_copy_aligned(begin(), __position, local [all...] |
H A D | stl_map.h | 347 iterator __i = lower_bound(__k); local 348 // __i->first is greater than or equivalent to __k. 349 if (__i == end() || key_comp()(__k, (*__i).first)) 350 __i = insert(__i, value_type(__k, mapped_type())); 351 return (*__i).second; 366 iterator __i = lower_bound(__k); local 367 if (__i == end() || key_comp()(__k, (*__i) 375 const_iterator __i = lower_bound(__k); local [all...] |
H A D | stl_algo.h | 639 _ForwardIterator __i = __first; local 640 ++__i; 641 while (__i != __last && __n != 1 && *__i == __val) 643 ++__i; 648 if (__i == __last) 650 __first = std::find(++__i, __last, __val); 761 _ForwardIterator __i = __first; local 762 ++__i; 763 while (__i ! 1264 _ForwardIterator __i = __first; local 1299 _ForwardIterator __i = __first; local 4239 _ForwardIterator __i = std::lower_bound(__first, __last, __val); local 4272 _ForwardIterator __i = std::lower_bound(__first, __last, __val, __comp); local [all...] |
H A D | valarray_after.h | 54 _GBase (const _Dom& __e, const valarray<size_t>& __i) argument 55 : _M_expr (__e), _M_index(__i) {} 58 operator[] (size_t __i) const 59 { return _M_expr[_M_index[__i]]; } 76 _GBase (_Array<_Tp> __a, const valarray<size_t>& __i) argument 77 : _M_array (__a), _M_index(__i) {} 80 operator[] (size_t __i) const 81 { return _M_array._M_data[_M_index[__i]]; } 99 _GClos (const _Dom& __e, const valarray<size_t>& __i) argument 100 : _Base (__e, __i) {} 110 _GClos(_Array<_Tp> __a, const valarray<size_t>& __i) argument 123 _IBase(const _Dom& __e, const valarray<size_t>& __i) argument 146 _IClos(const _Dom& __e, const valarray<size_t>& __i) argument 157 _IClos(const valarray<_Tp>& __a, const valarray<size_t>& __i) argument [all...] |
/macosx-10.10.1/bind9-45.101/bind9/lib/isc/win32/include/isc/ |
H A D | net.h | 156 u_int __i; \ 157 for (__i = 0; __i < ((fd_set FAR *)(set))->fd_count; __i++) { \ 158 if (((fd_set FAR *)(set))->fd_array[__i] == (SOCKET) fd) { \ 159 while (__i < ((fd_set FAR *)(set))->fd_count-1) { \ 160 ((fd_set FAR *)(set))->fd_array[__i] = \ 161 ((fd_set FAR *)(set))->fd_array[__i+1]; \ 162 __i++; \ 172 u_int __i; \ [all...] |
/macosx-10.10.1/ntp-92/lib/isc/win32/include/isc/ |
H A D | net.h | 156 u_int __i; \ 157 for (__i = 0; __i < ((fd_set FAR *)(set))->fd_count; __i++) { \ 158 if (((fd_set FAR *)(set))->fd_array[__i] == (SOCKET) fd) { \ 159 while (__i < ((fd_set FAR *)(set))->fd_count-1) { \ 160 ((fd_set FAR *)(set))->fd_array[__i] = \ 161 ((fd_set FAR *)(set))->fd_array[__i+1]; \ 162 __i++; \ 172 u_int __i; \ [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/ext/ |
H A D | pod_char_traits.h | 116 for (size_t __i = 0; __i < __n; ++__i) 117 if (!eq(__s1[__i], __s2[__i])) 118 return lt(__s1[__i], __s2[__i]) ? -1 : 1; 162 to_char_type(const int_type& __i) argument 163 { return char_type::template from(__i); }
|
H A D | ropeimpl.h | 178 int __i = -1; local 183 __x._M_path_end[++__i] = __path[__j++]; 184 __x._M_leaf_index = __i; 242 int __i; local 243 for (__i = 0; __i < int(_S_path_cache_len) - 1; __i++) 244 __x._M_path_end[__i] = __x._M_path_end[__i+1]; 881 size_t __i; local 916 size_t __i; local 991 size_t __i; local 1210 int __i; local 1274 int __i; // forest[0..__i-1] is empty local 1323 _S_fetch(_RopeRep* __r, size_type __i) argument 1372 _S_fetch_ptr(_RopeRep* __r, size_type __i) argument [all...] |
/macosx-10.10.1/libstdcxx-104.1/include/c++/4.2.1/tr1/ |
H A D | tuple_defs.h | 47 template<int __i, _GLIBCXX_TEMPLATE_PARAMS> 48 typename __add_ref<typename tuple_element<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::type>::type 51 return __get_helper<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::get_value(__t); 54 template<int __i, _GLIBCXX_TEMPLATE_PARAMS> 55 typename __add_c_ref<typename tuple_element<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::type>::type 58 return __get_helper<__i, tuple<_GLIBCXX_TEMPLATE_ARGS> >::get_value(__t);
|
/macosx-10.10.1/xnu-2782.1.97/bsd/nfs/ |
H A D | xdr_subs.h | 438 uint32_t __i; \ 440 for (__i=0; __i < (uint32_t)(LEN); __i++) \ 441 xb_add_32((E), (XB), (A)[__i]); \ 496 uint32_t __len = 0, __i; \ 499 for (__i=0; __i < MIN(__len, (uint32_t)(LEN)); __i++) \ 500 xb_get_32((E), (XB), (A)[__i]); \ [all...] |