Lines Matching defs:__r
85 for (rank_type __r = 1; __r < __rank_; __r++) {
86 bool __overflowed = __builtin_mul_overflow(__prod, __ext.extent(__r), &__prod);
100 for (rank_type __r = 0; __r < __rank_; __r++) {
104 if (static_cast<_CommonType>(__strides[__r]) > static_cast<_CommonType>(numeric_limits<index_type>::max()))
107 if (__ext.extent(__r) == static_cast<index_type>(0))
109 index_type __prod = (__ext.extent(__r) - 1);
110 bool __overflowed_mul = __builtin_mul_overflow(__prod, static_cast<index_type>(__strides[__r]), &__prod);
138 for (rank_type __r = 0; __r < __i; __r++) {
139 if (__strides_[__permute[__r]] > __strides_[__permute[__r + 1]]) {
140 swap(__permute[__r], __permute[__r + 1]);
144 if ((__strides_[__permute[__r]] == __strides_[__permute[__r + 1]]) &&
145 (__extents_.extent(__permute[__r]) > static_cast<index_type>(1)))
146 swap(__permute[__r], __permute[__r + 1]);
162 for (rank_type __r = __rank_ - 1; __r > static_cast<rank_type>(0); __r--) {
163 __strides_[__r] = __stride;
164 __stride *= __extents_.extent(__r);
313 for (rank_type __r = 1; __r < __rank_; __r++)
314 if (__strides_[__r] > __strides_[__r_largest])
315 __r_largest = __r;
316 for (rank_type __r = 0; __r < __rank_; __r++)
317 if (__extents_.extent(__r) == 0 && __r != __r_largest)
332 _LIBCPP_HIDE_FROM_ABI constexpr index_type stride(rank_type __r) const noexcept {
333 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__r < __rank_, "layout_stride::mapping::stride(): invalid rank index");
334 return __strides_[__r];