Lines Matching defs:size
132 fatal_if(!masks.empty() && _intlv_match >= ULL(1) << masks.size(),
134 _intlv_match, masks.size());
220 if (ranges.size() > 1) {
222 if (ranges.size() != (ULL(1) << masks.size()))
224 ranges.size(), masks.size());
248 bool interleaved() const { return masks.size() > 0; }
253 * @return The size of the regions created by the interleaving bits
265 return size();
275 uint32_t stripes() const { return ULL(1) << masks.size(); }
278 * Get the size of the address range. For a case where
280 * the size is a divisible by the size of the interleaving slice.
282 Addr size() const
284 return (_end - _start + 1) >> masks.size();
311 for (int i = 0; i < masks.size(); i++) {
360 if (r.size() == 1)
392 size() <= r.granularity();
412 for (int i = 0; i < masks.size(); i++) {
429 * start, start + size / intlv_bits). We can achieve this by
450 int masks_lsb[masks.size()];
451 for (int i = 0; i < masks.size(); i++) {
457 std::sort(masks_lsb, masks_lsb + masks.size());
459 for (int i = 0; i < masks.size(); i++) {
544 RangeSize(Addr start, Addr size)
545 { return AddrRange(start, start + size - 1); }