Lines Matching refs:ranges
147 size += range_len(&dev_dax->ranges[i].range);
373 struct range *range = &dev_dax->ranges[i].range;
383 kfree(dev_dax->ranges);
384 dev_dax->ranges = NULL;
630 dev_dax->ranges[mapping->range_id].mapping = NULL;
649 return &dev_dax->ranges[mapping->range_id];
752 dev_dax->ranges[range_id].mapping = mapping;
778 struct dev_dax_range *ranges;
794 ranges = krealloc(dev_dax->ranges, sizeof(*ranges)
796 if (!ranges)
802 * If this was an empty set of ranges nothing else
803 * will release @ranges, so do it now.
806 kfree(ranges);
807 ranges = NULL;
809 dev_dax->ranges = ranges;
814 pgoff += PHYS_PFN(range_len(&ranges[i].range));
815 dev_dax->ranges = ranges;
816 ranges[dev_dax->nr_range++] = (struct dev_dax_range) {
844 struct dev_dax_range *dax_range = &dev_dax->ranges[last_range];
902 struct range *range = &dev_dax->ranges[i].range;
903 struct dax_mapping *mapping = dev_dax->ranges[i].mapping;
936 * allocations. I.e. the dev_dax->ranges array is ordered by increasing pgoff.
947 last = &dev_dax->ranges[dev_dax->nr_range - 1];
951 struct dev_dax_range *dax_range = &dev_dax->ranges[i];
1146 size_t len = range_len(&dev_dax->ranges[i].range);
1223 start = dev_dax->ranges[0].range.start;
1396 if (dev_dax->nr_range && range_len(&dev_dax->ranges[0].range)) {