Lines Matching defs:__r
88 for (rank_type __r = 1; __r < __rank_; __r++) {
89 bool __overflowed = __builtin_mul_overflow(__prod, __ext.extent(__r), &__prod);
103 for (rank_type __r = 0; __r < __rank_; __r++) {
107 if (static_cast<_CommonType>(__strides[__r]) > static_cast<_CommonType>(numeric_limits<index_type>::max()))
110 if (__ext.extent(__r) == static_cast<index_type>(0))
112 index_type __prod = (__ext.extent(__r) - 1);
113 bool __overflowed_mul = __builtin_mul_overflow(__prod, static_cast<index_type>(__strides[__r]), &__prod);
141 for (rank_type __r = 0; __r < __i; __r++) {
142 if (__strides_[__permute[__r]] > __strides_[__permute[__r + 1]]) {
143 swap(__permute[__r], __permute[__r + 1]);
147 if ((__strides_[__permute[__r]] == __strides_[__permute[__r + 1]]) &&
148 (__extents_.extent(__permute[__r]) > static_cast<index_type>(1)))
149 swap(__permute[__r], __permute[__r + 1]);
165 for (rank_type __r = __rank_ - 1; __r > static_cast<rank_type>(0); __r--) {
166 __strides_[__r] = __stride;
167 __stride *= __extents_.extent(__r);
316 for (rank_type __r = 1; __r < __rank_; __r++)
317 if (__strides_[__r] > __strides_[__r_largest])
318 __r_largest = __r;
319 for (rank_type __r = 0; __r < __rank_; __r++)
320 if (__extents_.extent(__r) == 0 && __r != __r_largest)
335 _LIBCPP_HIDE_FROM_ABI constexpr index_type stride(rank_type __r) const noexcept {
336 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__r < __rank_, "layout_stride::mapping::stride(): invalid rank index");
337 return __strides_[__r];