| /freebsd-11.0-release/contrib/libc++/src/ |
| H A D | valarray.cpp | 39 for (size_t __j = __i + 1; __j != __indices.size(); ++__j)
40 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);
|
| H A D | debug.cpp | 415 __libcpp_db::__less_than_comparable(const void* __i, const void* __j) const
421 __i_node* j = __find_iterator(__j);
|
| /freebsd-11.0-release/contrib/libstdc++/config/locale/gnu/ |
| H A D | numeric_members.cc | 61 for (size_t __j = 0; __j < __num_base::_S_iend; ++__j)
62 _M_data->_M_atoms_in[__j] = __num_base::_S_atoms_in[__j];
116 for (size_t __j = 0; __j < __num_base::_S_iend; ++__j)
117 _M_data->_M_atoms_in[__j] =
118 static_cast<wchar_t>(__num_base::_S_atoms_in[__j]);
[all...] |
| H A D | ctype_members.cc | 289 for (size_t __j = 0;
290 __j < sizeof(_M_widen) / sizeof(wint_t); ++__j)
291 _M_widen[__j] = btowc(__j);
|
| /freebsd-11.0-release/contrib/libstdc++/src/ |
| H A D | valarray-inst.cc | 85 for (size_t __j = 0; __j < __z; ++__j)
94 __i[__j] = __a;
|
| H A D | locale.cc | 263 for (size_t __j = 0; __j < _M_facets_size; ++__j)
265 _M_caches[__j] = __imp._M_caches[__j];
266 if (_M_caches[__j])
267 _M_caches[__j]->_M_add_reference();
343 for (size_t __j = 0; __j < _M_facets_size; ++__j)
[all...] |
| H A D | localename.cc | 98 for (size_t __j = 0; __j < __i; ++__j)
100 __str += _S_categories[__j];
193 for (size_t __j = 0; __j < _M_facets_size; ++__j)
194 _M_caches[__j] = 0;
|
| H A D | mt_allocator.cc | 178 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
179 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
475 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
476 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
668 const size_t __j = (_M_options._M_max_bytes + 1) * sizeof(_Binmap_type); local
669 _M_binmap = static_cast<_Binmap_type*>(::operator new(__j));
|
| H A D | locale_init.cc | 376 for (size_t __j = 1; __j < _S_categories_size; ++__j)
377 _M_names[__j] = 0;
|
| /freebsd-11.0-release/contrib/libstdc++/include/bits/ |
| H A D | valarray_array.h | 248 for (size_t __j = 0; __j < __n; ++__j, ++__i)
320 for (size_t __j = 0; __j < __n; ++__j, ++__b, ++__i)
330 for (size_t __j = 0; __j < __n; ++__j, ++__a, ++__i)
335 // another indexed array __dst[<__j>]
338 __valarray_copy(const _Tp* __restrict__ __src, size_t __n, const size_t* __restrict__ __i, _Tp* __restrict__ __dst, const size_t* __restrict__ __j) 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 | stl_tree.h | 1000 iterator __j = iterator(__y); local
1003 if (__j == begin())
1006 --__j;
1008 if (_M_impl._M_key_compare(_S_key(__j._M_node), _KeyOfValue()(__v)))
1010 return pair<iterator, bool>(__j, false);
1400 iterator __j = iterator(__y); local
1401 return (__j == end()
1403 _S_key(__j._M_node))) ? end() : __j;
1422 const_iterator __j local
[all...] |
| H A D | stl_list.h | 959 iterator __j = __i; local
960 ++__j;
961 if (__position == __i || __position == __j)
967 this->_M_transfer(__position, __i, __j);
|
| H A D | stl_algo.h | 1866 for (_Distance __j = 0; __j < __l / __d; __j++)
1880 for (_Distance __j = 0; __j < __k / __d - 1; __j ++)
5020 _BidirectionalIterator __j = __last; local
5021 while (!(*__i < *--__j))
5023 std::iter_swap(__i, __j);
5077 _BidirectionalIterator __j local
5131 _BidirectionalIterator __j = __last; local
5188 _BidirectionalIterator __j = __last; local
[all...] |
| H A D | boost_concept_check.h | 436 *__i = *__j; // require dereference and assignment
438 _Tp __i, __j;
542 __n = __i - __j; // require difference operator
546 _Tp __i, __j;
|
| H A D | locale_facets.h | 126 for (int __j = 0; __j < __len; __j++, ++__s)
127 *__s = __ws[__j];
|
| /freebsd-11.0-release/sys/ofed/drivers/infiniband/ulp/sdp/ |
| H A D | sdp_proc.c | 247 unsigned int __j; \
249 for (__j = 0; __j < hist_len; __j++) { \
250 sum[__j] += h[__j]; \
|
| /freebsd-11.0-release/contrib/libstdc++/include/c_std/ |
| H A D | std_cstdlib.h | 146 div(long __i, long __j) { return ldiv(__i, __j); }
|
| /freebsd-11.0-release/contrib/libstdc++/include/std/ |
| H A D | std_bitset.h | 704 // For b[i] = b[__j];
706 operator=(const reference& __j) argument
708 if ((*(__j._M_wp) & _Base::_S_maskbit(__j._M_bpos)))
|
| /freebsd-11.0-release/contrib/libstdc++/include/ext/ |
| H A D | ropeimpl.h | 179 int __j = __curr_depth + 1 - int(_S_path_cache_len); local
181 if (__j < 0) __j = 0;
182 while (__j <= __curr_depth)
183 __x._M_path_end[++__i] = __path[__j++];
|