[Intel-gfx] [PATCH 29/34] drm: Compute tight evictions for drm_mm_scan
Chris Wilson
chris at chris-wilson.co.uk
Mon Dec 12 11:53:45 UTC 2016
Compute the minimal required hole during scan and only evict those nodes
that overlap. This enables us to reduce the number of nodes we need to
evict to the bare minimum.
Signed-off-by: Chris Wilson <chris at chris-wilson.co.uk>
---
drivers/gpu/drm/drm_mm.c | 60 +++++++++++++++++++++++++++------
drivers/gpu/drm/etnaviv/etnaviv_mmu.c | 2 +-
drivers/gpu/drm/i915/i915_gem_evict.c | 3 +-
drivers/gpu/drm/selftests/test-drm_mm.c | 22 +++++++-----
include/drm/drm_mm.h | 22 ++++++------
5 files changed, 78 insertions(+), 31 deletions(-)
diff --git a/drivers/gpu/drm/drm_mm.c b/drivers/gpu/drm/drm_mm.c
index a1467a43eda2..eec0a46f5b38 100644
--- a/drivers/gpu/drm/drm_mm.c
+++ b/drivers/gpu/drm/drm_mm.c
@@ -718,10 +718,10 @@ EXPORT_SYMBOL(drm_mm_replace_node);
* @color: opaque tag value to use for the allocation
* @start: start of the allowed range for the allocation
* @end: end of the allowed range for the allocation
+ * @flags: flags to specify how the allocation will be performed afterwards
*
* This simply sets up the scanning routines with the parameters for the desired
- * hole. Note that there's no need to specify allocation flags, since they only
- * change the place a node is allocated from within a suitable hole.
+ * hole.
*
* Warning:
* As long as the scan list is non-empty, no other operations than
@@ -733,7 +733,8 @@ void drm_mm_scan_init_with_range(struct drm_mm_scan *scan,
u64 alignment,
unsigned long color,
u64 start,
- u64 end)
+ u64 end,
+ unsigned int flags)
{
DRM_MM_BUG_ON(size == 0);
DRM_MM_BUG_ON(mm->scan_active);
@@ -743,6 +744,7 @@ void drm_mm_scan_init_with_range(struct drm_mm_scan *scan,
scan->color = color;
scan->alignment = alignment;
scan->size = size;
+ scan->flags = flags;
DRM_MM_BUG_ON(end <= start);
scan->range_start = start;
@@ -777,7 +779,7 @@ bool drm_mm_scan_add_block(struct drm_mm_scan *scan,
DRM_MM_BUG_ON(node->mm != mm);
DRM_MM_BUG_ON(!node->allocated);
DRM_MM_BUG_ON(node->scanned_block);
- node->scanned_block = 1;
+ node->scanned_block = true;
mm->scan_active++;
hole = list_prev_entry(node, node_list);
@@ -799,15 +801,53 @@ bool drm_mm_scan_add_block(struct drm_mm_scan *scan,
adj_start = max(col_start, scan->range_start);
adj_end = min(col_end, scan->range_end);
+ if (adj_end <= adj_start || adj_end - adj_start < scan->size)
+ return false;
+
+ if (scan->flags == DRM_MM_CREATE_TOP)
+ adj_start = adj_end - scan->size;
+
+ if (scan->alignment) {
+ u64 rem;
+
+ div64_u64_rem(adj_start, scan->alignment, &rem);
+ if (rem) {
+ adj_start -= rem;
+ if (scan->flags != DRM_MM_CREATE_TOP)
+ adj_start += scan->alignment;
+ if (adj_start < max(col_start, scan->range_start) ||
+ max(col_end, scan->range_end) - adj_start < scan->size)
+ return false;
+
+ if (adj_end <= adj_start ||
+ adj_end - adj_start < scan->size)
+ return false;
+ }
+ }
- if (check_free_hole(adj_start, adj_end,
- scan->size, scan->alignment)) {
+ if (mm->color_adjust) {
+ /* If allocations need adjusting due to neighbouring colours,
+ * we do not have enough information to decide if we need
+ * to evict nodes on either side of [adj_start, adj_end].
+ * What almost works is
+ * hit_start = adj_start + (hole_start - col_start);
+ * hit_end = adj_start + scan->size + (hole_end - col_end);
+ * but because the decision is only made on the final hole,
+ * we may underestimate the required adjustments for an
+ * interior allocation.
+ */
scan->hit_start = hole_start;
scan->hit_end = hole_end;
- return true;
+ } else {
+ scan->hit_start = adj_start;
+ scan->hit_end = adj_start + scan->size;
}
- return false;
+ DRM_MM_BUG_ON(scan->hit_start >= scan->hit_end);
+ DRM_MM_BUG_ON(scan->hit_start < hole_start);
+ DRM_MM_BUG_ON(scan->hit_end > hole_end);
+
+ return true;
}
EXPORT_SYMBOL(drm_mm_scan_add_block);
@@ -834,7 +874,7 @@ bool drm_mm_scan_remove_block(struct drm_mm_scan *scan,
DRM_MM_BUG_ON(node->mm != scan->mm);
DRM_MM_BUG_ON(!node->scanned_block);
- node->scanned_block = 0;
+ node->scanned_block = false;
DRM_MM_BUG_ON(!node->mm->scan_active);
node->mm->scan_active--;
@@ -844,7 +884,7 @@ bool drm_mm_scan_remove_block(struct drm_mm_scan *scan,
prev_node->hole_follows = node->scanned_preceeds_hole;
list_add(&node->node_list, &prev_node->node_list);
- return (drm_mm_hole_node_end(node) > scan->hit_start &&
+ return (node->start + node->size > scan->hit_start &&
node->start < scan->hit_end);
}
EXPORT_SYMBOL(drm_mm_scan_remove_block);
diff --git a/drivers/gpu/drm/etnaviv/etnaviv_mmu.c b/drivers/gpu/drm/etnaviv/etnaviv_mmu.c
index fe1e886dcabb..2dae3169ce48 100644
--- a/drivers/gpu/drm/etnaviv/etnaviv_mmu.c
+++ b/drivers/gpu/drm/etnaviv/etnaviv_mmu.c
@@ -135,7 +135,7 @@ static int etnaviv_iommu_find_iova(struct etnaviv_iommu *mmu,
}
/* Try to retire some entries */
- drm_mm_scan_init(&scan, &mmu->mm, size, 0, 0);
+ drm_mm_scan_init(&scan, &mmu->mm, size, 0, 0, 0);
found = 0;
INIT_LIST_HEAD(&list);
diff --git a/drivers/gpu/drm/i915/i915_gem_evict.c b/drivers/gpu/drm/i915/i915_gem_evict.c
index 5415f888c63f..89da9225043f 100644
--- a/drivers/gpu/drm/i915/i915_gem_evict.c
+++ b/drivers/gpu/drm/i915/i915_gem_evict.c
@@ -128,7 +128,8 @@ i915_gem_evict_something(struct i915_address_space *vm,
*/
drm_mm_scan_init_with_range(&scan, &vm->mm,
min_size, alignment, cache_level,
- start, end);
+ start, end,
+ flags & PIN_HIGH ? DRM_MM_CREATE_TOP : 0);
if (flags & PIN_NONBLOCK)
phases[1] = NULL;
diff --git a/drivers/gpu/drm/selftests/test-drm_mm.c b/drivers/gpu/drm/selftests/test-drm_mm.c
index 1180033f8a65..09ead31a094d 100644
--- a/drivers/gpu/drm/selftests/test-drm_mm.c
+++ b/drivers/gpu/drm/selftests/test-drm_mm.c
@@ -854,7 +854,7 @@ static int igt_evict(void *ignored)
struct evict_node *e;
struct drm_mm_scan scan;
- drm_mm_scan_init(&scan, &mm, 1, 0, 0);
+ drm_mm_scan_init(&scan, &mm, 1, 0, 0, 0);
for (m = 0; m < size; m++) {
e = &nodes[m];
list_add(&e->link, &evict_list);
@@ -902,7 +902,7 @@ static int igt_evict(void *ignored)
struct drm_mm_node tmp;
int err;
- drm_mm_scan_init(&scan, &mm, nsize, n, 0);
+ drm_mm_scan_init(&scan, &mm, nsize, n, 0, 0);
drm_random_reorder(order, size, &lcg_state);
for (m = 0; m < size; m++) {
e = &nodes[order[m]];
@@ -963,7 +963,7 @@ static int igt_evict(void *ignored)
int nsize = (size - n + 1) / 2;
int err;
- drm_mm_scan_init(&scan, &mm, nsize, n, 0);
+ drm_mm_scan_init(&scan, &mm, nsize, n, 0, 0);
drm_random_reorder(order, size, &lcg_state);
for (m = 0; m < size; m++) {
e = &nodes[order[m]];
@@ -1076,7 +1076,8 @@ static int igt_evict_range(void *ignored)
int err;
drm_mm_scan_init_with_range(&scan, &mm, nsize, n, 0,
- range_start, range_end);
+ range_start, range_end,
+ 0);
drm_random_reorder(order, size, &lcg_state);
for (m = 0; m < size; m++) {
e = &nodes[order[m]];
@@ -1146,7 +1147,8 @@ static int igt_evict_range(void *ignored)
int err;
drm_mm_scan_init_with_range(&scan, &mm, nsize, n, 0,
- range_start, range_end);
+ range_start, range_end,
+ 0);
drm_random_reorder(order, size, &lcg_state);
for (m = 0; m < size; m++) {
e = &nodes[order[m]];
@@ -1640,7 +1642,7 @@ static int igt_color_evict(void *ignored)
struct drm_mm_node tmp;
int err;
- drm_mm_scan_init(&scan, &mm, nsize, n, c);
+ drm_mm_scan_init(&scan, &mm, nsize, n, c, 0);
drm_random_reorder(order, total_size, &lcg_state);
for (m = 0; m < total_size; m++) {
e = &nodes[order[m]];
@@ -1713,7 +1715,7 @@ static int igt_color_evict(void *ignored)
int nsize = (total_size - n + 1) / 2;
int err;
- drm_mm_scan_init(&scan, &mm, nsize, n, c);
+ drm_mm_scan_init(&scan, &mm, nsize, n, c, 0);
drm_random_reorder(order, total_size, &lcg_state);
for (m = 0; m < total_size; m++) {
e = &nodes[order[m]];
@@ -1844,7 +1846,8 @@ static int igt_color_evict_range(void *ignored)
int err;
drm_mm_scan_init_with_range(&scan, &mm, nsize, n, c,
- range_start, range_end);
+ range_start, range_end,
+ 0);
drm_random_reorder(order, total_size, &lcg_state);
for (m = 0; m < total_size; m++) {
e = &nodes[order[m]];
@@ -1919,7 +1922,8 @@ static int igt_color_evict_range(void *ignored)
int err;
drm_mm_scan_init_with_range(&scan, &mm, nsize, n, c,
- range_start, range_end);
+ range_start, range_end,
+ 0);
drm_random_reorder(order, total_size, &lcg_state);
for (m = 0; m < total_size; m++) {
e = &nodes[order[m]];
diff --git a/include/drm/drm_mm.h b/include/drm/drm_mm.h
index 22d00515fc57..5e8350b91fcf 100644
--- a/include/drm/drm_mm.h
+++ b/include/drm/drm_mm.h
@@ -119,6 +119,7 @@ struct drm_mm_scan {
struct drm_mm_node *prev_scanned_node;
unsigned long color;
+ unsigned int flags;
};
/**
@@ -369,11 +370,9 @@ __drm_mm_interval_first(struct drm_mm *mm, u64 start, u64 last);
void drm_mm_scan_init_with_range(struct drm_mm_scan *scan,
struct drm_mm *mm,
- u64 size,
- u64 alignment,
- unsigned long color,
- u64 start,
- u64 end);
+ u64 size, u64 alignment, unsigned long color,
+ u64 start, u64 end,
+ unsigned int flags);
/**
* drm_mm_scan_init - initialize lru scanning
@@ -382,10 +381,10 @@ void drm_mm_scan_init_with_range(struct drm_mm_scan *scan,
* @size: size of the allocation
* @alignment: alignment of the allocation
* @color: opaque tag value to use for the allocation
+ * @flags: flags to specify how the allocation will be performed afterwards
*
* This simply sets up the scanning routines with the parameters for the desired
- * hole. Note that there's no need to specify allocation flags, since they only
- * change the place a node is allocated from within a suitable hole.
+ * hole.
*
* Warning:
* As long as the scan list is non-empty, no other operations than
@@ -395,10 +394,13 @@ static inline void drm_mm_scan_init(struct drm_mm_scan *scan,
struct drm_mm *mm,
u64 size,
u64 alignment,
- unsigned long color)
+ unsigned long color,
+ unsigned int flags)
{
- drm_mm_scan_init_with_range(scan, mm, size, alignment, color,
- 0, U64_MAX);
+ drm_mm_scan_init_with_range(scan, mm,
+ size, alignment, color,
+ 0, U64_MAX,
+ flags);
}
bool drm_mm_scan_add_block(struct drm_mm_scan *scan,
--
2.11.0
More information about the Intel-gfx
mailing list