Loading...
1/*
2 * Copyright © 2008-2010 Intel Corporation
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
13 * Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
21 * IN THE SOFTWARE.
22 *
23 * Authors:
24 * Eric Anholt <eric@anholt.net>
25 * Chris Wilson <chris@chris-wilson.co.uuk>
26 *
27 */
28
29#include <drm/drmP.h>
30#include <drm/i915_drm.h>
31
32#include "i915_drv.h"
33#include "intel_drv.h"
34#include "i915_trace.h"
35
36static bool
37mark_free(struct i915_vma *vma, struct list_head *unwind)
38{
39 if (vma->pin_count)
40 return false;
41
42 if (WARN_ON(!list_empty(&vma->exec_list)))
43 return false;
44
45 list_add(&vma->exec_list, unwind);
46 return drm_mm_scan_add_block(&vma->node);
47}
48
49/**
50 * i915_gem_evict_something - Evict vmas to make room for binding a new one
51 * @dev: drm_device
52 * @vm: address space to evict from
53 * @min_size: size of the desired free space
54 * @alignment: alignment constraint of the desired free space
55 * @cache_level: cache_level for the desired space
56 * @start: start (inclusive) of the range from which to evict objects
57 * @end: end (exclusive) of the range from which to evict objects
58 * @flags: additional flags to control the eviction algorithm
59 *
60 * This function will try to evict vmas until a free space satisfying the
61 * requirements is found. Callers must check first whether any such hole exists
62 * already before calling this function.
63 *
64 * This function is used by the object/vma binding code.
65 *
66 * Since this function is only used to free up virtual address space it only
67 * ignores pinned vmas, and not object where the backing storage itself is
68 * pinned. Hence obj->pages_pin_count does not protect against eviction.
69 *
70 * To clarify: This is for freeing up virtual address space, not for freeing
71 * memory in e.g. the shrinker.
72 */
73int
74i915_gem_evict_something(struct drm_device *dev, struct i915_address_space *vm,
75 int min_size, unsigned alignment, unsigned cache_level,
76 unsigned long start, unsigned long end,
77 unsigned flags)
78{
79 struct list_head eviction_list, unwind_list;
80 struct i915_vma *vma;
81 int ret = 0;
82 int pass = 0;
83
84 trace_i915_gem_evict(dev, min_size, alignment, flags);
85
86 /*
87 * The goal is to evict objects and amalgamate space in LRU order.
88 * The oldest idle objects reside on the inactive list, which is in
89 * retirement order. The next objects to retire are those on the (per
90 * ring) active list that do not have an outstanding flush. Once the
91 * hardware reports completion (the seqno is updated after the
92 * batchbuffer has been finished) the clean buffer objects would
93 * be retired to the inactive list. Any dirty objects would be added
94 * to the tail of the flushing list. So after processing the clean
95 * active objects we need to emit a MI_FLUSH to retire the flushing
96 * list, hence the retirement order of the flushing list is in
97 * advance of the dirty objects on the active lists.
98 *
99 * The retirement sequence is thus:
100 * 1. Inactive objects (already retired)
101 * 2. Clean active objects
102 * 3. Flushing list
103 * 4. Dirty active objects.
104 *
105 * On each list, the oldest objects lie at the HEAD with the freshest
106 * object on the TAIL.
107 */
108
109 INIT_LIST_HEAD(&unwind_list);
110 if (start != 0 || end != vm->total) {
111 drm_mm_init_scan_with_range(&vm->mm, min_size,
112 alignment, cache_level,
113 start, end);
114 } else
115 drm_mm_init_scan(&vm->mm, min_size, alignment, cache_level);
116
117search_again:
118 /* First see if there is a large enough contiguous idle region... */
119 list_for_each_entry(vma, &vm->inactive_list, vm_link) {
120 if (mark_free(vma, &unwind_list))
121 goto found;
122 }
123
124 if (flags & PIN_NONBLOCK)
125 goto none;
126
127 /* Now merge in the soon-to-be-expired objects... */
128 list_for_each_entry(vma, &vm->active_list, vm_link) {
129 if (mark_free(vma, &unwind_list))
130 goto found;
131 }
132
133none:
134 /* Nothing found, clean up and bail out! */
135 while (!list_empty(&unwind_list)) {
136 vma = list_first_entry(&unwind_list,
137 struct i915_vma,
138 exec_list);
139 ret = drm_mm_scan_remove_block(&vma->node);
140 BUG_ON(ret);
141
142 list_del_init(&vma->exec_list);
143 }
144
145 /* Can we unpin some objects such as idle hw contents,
146 * or pending flips?
147 */
148 if (flags & PIN_NONBLOCK)
149 return -ENOSPC;
150
151 /* Only idle the GPU and repeat the search once */
152 if (pass++ == 0) {
153 ret = i915_gpu_idle(dev);
154 if (ret)
155 return ret;
156
157 i915_gem_retire_requests(dev);
158 goto search_again;
159 }
160
161 /* If we still have pending pageflip completions, drop
162 * back to userspace to give our workqueues time to
163 * acquire our locks and unpin the old scanouts.
164 */
165 return intel_has_pending_fb_unpin(dev) ? -EAGAIN : -ENOSPC;
166
167found:
168 /* drm_mm doesn't allow any other other operations while
169 * scanning, therefore store to be evicted objects on a
170 * temporary list. */
171 INIT_LIST_HEAD(&eviction_list);
172 while (!list_empty(&unwind_list)) {
173 vma = list_first_entry(&unwind_list,
174 struct i915_vma,
175 exec_list);
176 if (drm_mm_scan_remove_block(&vma->node)) {
177 list_move(&vma->exec_list, &eviction_list);
178 drm_gem_object_reference(&vma->obj->base);
179 continue;
180 }
181 list_del_init(&vma->exec_list);
182 }
183
184 /* Unbinding will emit any required flushes */
185 while (!list_empty(&eviction_list)) {
186 struct drm_gem_object *obj;
187 vma = list_first_entry(&eviction_list,
188 struct i915_vma,
189 exec_list);
190
191 obj = &vma->obj->base;
192 list_del_init(&vma->exec_list);
193 if (ret == 0)
194 ret = i915_vma_unbind(vma);
195
196 drm_gem_object_unreference(obj);
197 }
198
199 return ret;
200}
201
202int
203i915_gem_evict_for_vma(struct i915_vma *target)
204{
205 struct drm_mm_node *node, *next;
206
207 list_for_each_entry_safe(node, next,
208 &target->vm->mm.head_node.node_list,
209 node_list) {
210 struct i915_vma *vma;
211 int ret;
212
213 if (node->start + node->size <= target->node.start)
214 continue;
215 if (node->start >= target->node.start + target->node.size)
216 break;
217
218 vma = container_of(node, typeof(*vma), node);
219
220 if (vma->pin_count) {
221 if (!vma->exec_entry || (vma->pin_count > 1))
222 /* Object is pinned for some other use */
223 return -EBUSY;
224
225 /* We need to evict a buffer in the same batch */
226 if (vma->exec_entry->flags & EXEC_OBJECT_PINNED)
227 /* Overlapping fixed objects in the same batch */
228 return -EINVAL;
229
230 return -ENOSPC;
231 }
232
233 ret = i915_vma_unbind(vma);
234 if (ret)
235 return ret;
236 }
237
238 return 0;
239}
240
241/**
242 * i915_gem_evict_vm - Evict all idle vmas from a vm
243 * @vm: Address space to cleanse
244 * @do_idle: Boolean directing whether to idle first.
245 *
246 * This function evicts all idles vmas from a vm. If all unpinned vmas should be
247 * evicted the @do_idle needs to be set to true.
248 *
249 * This is used by the execbuf code as a last-ditch effort to defragment the
250 * address space.
251 *
252 * To clarify: This is for freeing up virtual address space, not for freeing
253 * memory in e.g. the shrinker.
254 */
255int i915_gem_evict_vm(struct i915_address_space *vm, bool do_idle)
256{
257 struct i915_vma *vma, *next;
258 int ret;
259
260 WARN_ON(!mutex_is_locked(&vm->dev->struct_mutex));
261 trace_i915_gem_evict_vm(vm);
262
263 if (do_idle) {
264 ret = i915_gpu_idle(vm->dev);
265 if (ret)
266 return ret;
267
268 i915_gem_retire_requests(vm->dev);
269
270 WARN_ON(!list_empty(&vm->active_list));
271 }
272
273 list_for_each_entry_safe(vma, next, &vm->inactive_list, vm_link)
274 if (vma->pin_count == 0)
275 WARN_ON(i915_vma_unbind(vma));
276
277 return 0;
278}
1/*
2 * Copyright © 2008-2010 Intel Corporation
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice (including the next
12 * paragraph) shall be included in all copies or substantial portions of the
13 * Software.
14 *
15 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
21 * IN THE SOFTWARE.
22 *
23 * Authors:
24 * Eric Anholt <eric@anholt.net>
25 * Chris Wilson <chris@chris-wilson.co.uuk>
26 *
27 */
28
29#include "drmP.h"
30#include "drm.h"
31#include "i915_drv.h"
32#include "i915_drm.h"
33#include "i915_trace.h"
34
35static bool
36mark_free(struct drm_i915_gem_object *obj, struct list_head *unwind)
37{
38 list_add(&obj->exec_list, unwind);
39 drm_gem_object_reference(&obj->base);
40 return drm_mm_scan_add_block(obj->gtt_space);
41}
42
43int
44i915_gem_evict_something(struct drm_device *dev, int min_size,
45 unsigned alignment, bool mappable)
46{
47 drm_i915_private_t *dev_priv = dev->dev_private;
48 struct list_head eviction_list, unwind_list;
49 struct drm_i915_gem_object *obj;
50 int ret = 0;
51
52 i915_gem_retire_requests(dev);
53
54 /* Re-check for free space after retiring requests */
55 if (mappable) {
56 if (drm_mm_search_free_in_range(&dev_priv->mm.gtt_space,
57 min_size, alignment, 0,
58 dev_priv->mm.gtt_mappable_end,
59 0))
60 return 0;
61 } else {
62 if (drm_mm_search_free(&dev_priv->mm.gtt_space,
63 min_size, alignment, 0))
64 return 0;
65 }
66
67 trace_i915_gem_evict(dev, min_size, alignment, mappable);
68
69 /*
70 * The goal is to evict objects and amalgamate space in LRU order.
71 * The oldest idle objects reside on the inactive list, which is in
72 * retirement order. The next objects to retire are those on the (per
73 * ring) active list that do not have an outstanding flush. Once the
74 * hardware reports completion (the seqno is updated after the
75 * batchbuffer has been finished) the clean buffer objects would
76 * be retired to the inactive list. Any dirty objects would be added
77 * to the tail of the flushing list. So after processing the clean
78 * active objects we need to emit a MI_FLUSH to retire the flushing
79 * list, hence the retirement order of the flushing list is in
80 * advance of the dirty objects on the active lists.
81 *
82 * The retirement sequence is thus:
83 * 1. Inactive objects (already retired)
84 * 2. Clean active objects
85 * 3. Flushing list
86 * 4. Dirty active objects.
87 *
88 * On each list, the oldest objects lie at the HEAD with the freshest
89 * object on the TAIL.
90 */
91
92 INIT_LIST_HEAD(&unwind_list);
93 if (mappable)
94 drm_mm_init_scan_with_range(&dev_priv->mm.gtt_space, min_size,
95 alignment, 0,
96 dev_priv->mm.gtt_mappable_end);
97 else
98 drm_mm_init_scan(&dev_priv->mm.gtt_space, min_size, alignment);
99
100 /* First see if there is a large enough contiguous idle region... */
101 list_for_each_entry(obj, &dev_priv->mm.inactive_list, mm_list) {
102 if (mark_free(obj, &unwind_list))
103 goto found;
104 }
105
106 /* Now merge in the soon-to-be-expired objects... */
107 list_for_each_entry(obj, &dev_priv->mm.active_list, mm_list) {
108 /* Does the object require an outstanding flush? */
109 if (obj->base.write_domain || obj->pin_count)
110 continue;
111
112 if (mark_free(obj, &unwind_list))
113 goto found;
114 }
115
116 /* Finally add anything with a pending flush (in order of retirement) */
117 list_for_each_entry(obj, &dev_priv->mm.flushing_list, mm_list) {
118 if (obj->pin_count)
119 continue;
120
121 if (mark_free(obj, &unwind_list))
122 goto found;
123 }
124 list_for_each_entry(obj, &dev_priv->mm.active_list, mm_list) {
125 if (! obj->base.write_domain || obj->pin_count)
126 continue;
127
128 if (mark_free(obj, &unwind_list))
129 goto found;
130 }
131
132 /* Nothing found, clean up and bail out! */
133 while (!list_empty(&unwind_list)) {
134 obj = list_first_entry(&unwind_list,
135 struct drm_i915_gem_object,
136 exec_list);
137
138 ret = drm_mm_scan_remove_block(obj->gtt_space);
139 BUG_ON(ret);
140
141 list_del_init(&obj->exec_list);
142 drm_gem_object_unreference(&obj->base);
143 }
144
145 /* We expect the caller to unpin, evict all and try again, or give up.
146 * So calling i915_gem_evict_everything() is unnecessary.
147 */
148 return -ENOSPC;
149
150found:
151 /* drm_mm doesn't allow any other other operations while
152 * scanning, therefore store to be evicted objects on a
153 * temporary list. */
154 INIT_LIST_HEAD(&eviction_list);
155 while (!list_empty(&unwind_list)) {
156 obj = list_first_entry(&unwind_list,
157 struct drm_i915_gem_object,
158 exec_list);
159 if (drm_mm_scan_remove_block(obj->gtt_space)) {
160 list_move(&obj->exec_list, &eviction_list);
161 continue;
162 }
163 list_del_init(&obj->exec_list);
164 drm_gem_object_unreference(&obj->base);
165 }
166
167 /* Unbinding will emit any required flushes */
168 while (!list_empty(&eviction_list)) {
169 obj = list_first_entry(&eviction_list,
170 struct drm_i915_gem_object,
171 exec_list);
172 if (ret == 0)
173 ret = i915_gem_object_unbind(obj);
174
175 list_del_init(&obj->exec_list);
176 drm_gem_object_unreference(&obj->base);
177 }
178
179 return ret;
180}
181
182int
183i915_gem_evict_everything(struct drm_device *dev, bool purgeable_only)
184{
185 drm_i915_private_t *dev_priv = dev->dev_private;
186 int ret;
187 bool lists_empty;
188
189 lists_empty = (list_empty(&dev_priv->mm.inactive_list) &&
190 list_empty(&dev_priv->mm.flushing_list) &&
191 list_empty(&dev_priv->mm.active_list));
192 if (lists_empty)
193 return -ENOSPC;
194
195 trace_i915_gem_evict_everything(dev, purgeable_only);
196
197 /* Flush everything (on to the inactive lists) and evict */
198 ret = i915_gpu_idle(dev);
199 if (ret)
200 return ret;
201
202 BUG_ON(!list_empty(&dev_priv->mm.flushing_list));
203
204 return i915_gem_evict_inactive(dev, purgeable_only);
205}
206
207/** Unbinds all inactive objects. */
208int
209i915_gem_evict_inactive(struct drm_device *dev, bool purgeable_only)
210{
211 drm_i915_private_t *dev_priv = dev->dev_private;
212 struct drm_i915_gem_object *obj, *next;
213
214 list_for_each_entry_safe(obj, next,
215 &dev_priv->mm.inactive_list, mm_list) {
216 if (!purgeable_only || obj->madv != I915_MADV_WILLNEED) {
217 int ret = i915_gem_object_unbind(obj);
218 if (ret)
219 return ret;
220 }
221 }
222
223 return 0;
224}