2 * SPDX-License-Identifier: MIT
4 * Copyright © 2014-2016 Intel Corporation
8 #include "i915_gem_object.h"
9 #include "i915_scatterlist.h"
11 void __i915_gem_object_set_pages(struct drm_i915_gem_object *obj,
12 struct sg_table *pages,
13 unsigned int sg_page_sizes)
15 struct drm_i915_private *i915 = to_i915(obj->base.dev);
16 unsigned long supported = INTEL_INFO(i915)->page_sizes;
19 lockdep_assert_held(&obj->mm.lock);
21 /* Make the pages coherent with the GPU (flushing any swapin). */
22 if (obj->cache_dirty) {
23 obj->write_domain = 0;
24 if (i915_gem_object_has_struct_page(obj))
25 drm_clflush_sg(pages);
26 obj->cache_dirty = false;
29 obj->mm.get_page.sg_pos = pages->sgl;
30 obj->mm.get_page.sg_idx = 0;
32 obj->mm.pages = pages;
34 if (i915_gem_object_is_tiled(obj) &&
35 i915->quirks & QUIRK_PIN_SWIZZLED_PAGES) {
36 GEM_BUG_ON(obj->mm.quirked);
37 __i915_gem_object_pin_pages(obj);
38 obj->mm.quirked = true;
41 GEM_BUG_ON(!sg_page_sizes);
42 obj->mm.page_sizes.phys = sg_page_sizes;
45 * Calculate the supported page-sizes which fit into the given
46 * sg_page_sizes. This will give us the page-sizes which we may be able
47 * to use opportunistically when later inserting into the GTT. For
48 * example if phys=2G, then in theory we should be able to use 1G, 2M,
49 * 64K or 4K pages, although in practice this will depend on a number of
52 obj->mm.page_sizes.sg = 0;
53 for_each_set_bit(i, &supported, ilog2(I915_GTT_MAX_PAGE_SIZE) + 1) {
54 if (obj->mm.page_sizes.phys & ~0u << i)
55 obj->mm.page_sizes.sg |= BIT(i);
57 GEM_BUG_ON(!HAS_PAGE_SIZES(i915, obj->mm.page_sizes.sg));
59 if (i915_gem_object_is_shrinkable(obj)) {
60 struct list_head *list;
63 spin_lock_irqsave(&i915->mm.obj_lock, flags);
65 i915->mm.shrink_count++;
66 i915->mm.shrink_memory += obj->base.size;
68 if (obj->mm.madv != I915_MADV_WILLNEED)
69 list = &i915->mm.purge_list;
71 list = &i915->mm.shrink_list;
72 list_add_tail(&obj->mm.link, list);
74 atomic_set(&obj->mm.shrink_pin, 0);
75 spin_unlock_irqrestore(&i915->mm.obj_lock, flags);
79 int ____i915_gem_object_get_pages(struct drm_i915_gem_object *obj)
83 if (unlikely(obj->mm.madv != I915_MADV_WILLNEED)) {
84 DRM_DEBUG("Attempting to obtain a purgeable object\n");
88 err = obj->ops->get_pages(obj);
89 GEM_BUG_ON(!err && !i915_gem_object_has_pages(obj));
94 /* Ensure that the associated pages are gathered from the backing storage
95 * and pinned into our object. i915_gem_object_pin_pages() may be called
96 * multiple times before they are released by a single call to
97 * i915_gem_object_unpin_pages() - once the pages are no longer referenced
98 * either as a result of memory pressure (reaping pages under the shrinker)
99 * or as the object is itself released.
101 int __i915_gem_object_get_pages(struct drm_i915_gem_object *obj)
105 err = mutex_lock_interruptible(&obj->mm.lock);
109 if (unlikely(!i915_gem_object_has_pages(obj))) {
110 GEM_BUG_ON(i915_gem_object_has_pinned_pages(obj));
112 err = ____i915_gem_object_get_pages(obj);
116 smp_mb__before_atomic();
118 atomic_inc(&obj->mm.pages_pin_count);
121 mutex_unlock(&obj->mm.lock);
125 /* Immediately discard the backing storage */
126 void i915_gem_object_truncate(struct drm_i915_gem_object *obj)
128 drm_gem_free_mmap_offset(&obj->base);
129 if (obj->ops->truncate)
130 obj->ops->truncate(obj);
133 /* Try to discard unwanted pages */
134 void i915_gem_object_writeback(struct drm_i915_gem_object *obj)
136 lockdep_assert_held(&obj->mm.lock);
137 GEM_BUG_ON(i915_gem_object_has_pages(obj));
139 if (obj->ops->writeback)
140 obj->ops->writeback(obj);
143 static void __i915_gem_object_reset_page_iter(struct drm_i915_gem_object *obj)
145 struct radix_tree_iter iter;
149 radix_tree_for_each_slot(slot, &obj->mm.get_page.radix, &iter, 0)
150 radix_tree_delete(&obj->mm.get_page.radix, iter.index);
155 __i915_gem_object_unset_pages(struct drm_i915_gem_object *obj)
157 struct sg_table *pages;
159 pages = fetch_and_zero(&obj->mm.pages);
160 if (IS_ERR_OR_NULL(pages))
163 i915_gem_object_make_unshrinkable(obj);
165 if (obj->mm.mapping) {
168 ptr = page_mask_bits(obj->mm.mapping);
169 if (is_vmalloc_addr(ptr))
172 kunmap(kmap_to_page(ptr));
174 obj->mm.mapping = NULL;
177 __i915_gem_object_reset_page_iter(obj);
178 obj->mm.page_sizes.phys = obj->mm.page_sizes.sg = 0;
183 int __i915_gem_object_put_pages(struct drm_i915_gem_object *obj,
184 enum i915_mm_subclass subclass)
186 struct sg_table *pages;
189 if (i915_gem_object_has_pinned_pages(obj))
192 GEM_BUG_ON(atomic_read(&obj->bind_count));
194 /* May be called by shrinker from within get_pages() (on another bo) */
195 mutex_lock_nested(&obj->mm.lock, subclass);
196 if (unlikely(atomic_read(&obj->mm.pages_pin_count))) {
202 * ->put_pages might need to allocate memory for the bit17 swizzle
203 * array, hence protect them from being reaped by removing them from gtt
206 pages = __i915_gem_object_unset_pages(obj);
209 * XXX Temporary hijinx to avoid updating all backends to handle
210 * NULL pages. In the future, when we have more asynchronous
211 * get_pages backends we should be better able to handle the
212 * cancellation of the async task in a more uniform manner.
214 if (!pages && !i915_gem_object_needs_async_cancel(obj))
215 pages = ERR_PTR(-EINVAL);
218 obj->ops->put_pages(obj, pages);
222 mutex_unlock(&obj->mm.lock);
227 /* The 'mapping' part of i915_gem_object_pin_map() below */
228 static void *i915_gem_object_map(const struct drm_i915_gem_object *obj,
229 enum i915_map_type type)
231 unsigned long n_pages = obj->base.size >> PAGE_SHIFT;
232 struct sg_table *sgt = obj->mm.pages;
233 struct sgt_iter sgt_iter;
235 struct page *stack_pages[32];
236 struct page **pages = stack_pages;
241 /* A single page can always be kmapped */
242 if (n_pages == 1 && type == I915_MAP_WB)
243 return kmap(sg_page(sgt->sgl));
245 if (n_pages > ARRAY_SIZE(stack_pages)) {
246 /* Too big for stack -- allocate temporary array instead */
247 pages = kvmalloc_array(n_pages, sizeof(*pages), GFP_KERNEL);
252 for_each_sgt_page(page, sgt_iter, sgt)
255 /* Check that we have the expected number of pages */
256 GEM_BUG_ON(i != n_pages);
261 /* fallthrough - to use PAGE_KERNEL anyway */
263 pgprot = PAGE_KERNEL;
266 pgprot = pgprot_writecombine(PAGE_KERNEL_IO);
269 addr = vmap(pages, n_pages, 0, pgprot);
271 if (pages != stack_pages)
277 /* get, pin, and map the pages of the object into kernel space */
278 void *i915_gem_object_pin_map(struct drm_i915_gem_object *obj,
279 enum i915_map_type type)
281 enum i915_map_type has_type;
286 if (unlikely(!i915_gem_object_has_struct_page(obj)))
287 return ERR_PTR(-ENXIO);
289 err = mutex_lock_interruptible(&obj->mm.lock);
293 pinned = !(type & I915_MAP_OVERRIDE);
294 type &= ~I915_MAP_OVERRIDE;
296 if (!atomic_inc_not_zero(&obj->mm.pages_pin_count)) {
297 if (unlikely(!i915_gem_object_has_pages(obj))) {
298 GEM_BUG_ON(i915_gem_object_has_pinned_pages(obj));
300 err = ____i915_gem_object_get_pages(obj);
304 smp_mb__before_atomic();
306 atomic_inc(&obj->mm.pages_pin_count);
309 GEM_BUG_ON(!i915_gem_object_has_pages(obj));
311 ptr = page_unpack_bits(obj->mm.mapping, &has_type);
312 if (ptr && has_type != type) {
318 if (is_vmalloc_addr(ptr))
321 kunmap(kmap_to_page(ptr));
323 ptr = obj->mm.mapping = NULL;
327 ptr = i915_gem_object_map(obj, type);
333 obj->mm.mapping = page_pack_bits(ptr, type);
337 mutex_unlock(&obj->mm.lock);
341 atomic_dec(&obj->mm.pages_pin_count);
347 void __i915_gem_object_flush_map(struct drm_i915_gem_object *obj,
348 unsigned long offset,
351 enum i915_map_type has_type;
354 GEM_BUG_ON(!i915_gem_object_has_pinned_pages(obj));
355 GEM_BUG_ON(range_overflows_t(typeof(obj->base.size),
356 offset, size, obj->base.size));
358 obj->mm.dirty = true;
360 if (obj->cache_coherent & I915_BO_CACHE_COHERENT_FOR_WRITE)
363 ptr = page_unpack_bits(obj->mm.mapping, &has_type);
364 if (has_type == I915_MAP_WC)
367 drm_clflush_virt_range(ptr + offset, size);
368 if (size == obj->base.size) {
369 obj->write_domain &= ~I915_GEM_DOMAIN_CPU;
370 obj->cache_dirty = false;
375 i915_gem_object_get_sg(struct drm_i915_gem_object *obj,
377 unsigned int *offset)
379 struct i915_gem_object_page_iter *iter = &obj->mm.get_page;
380 struct scatterlist *sg;
381 unsigned int idx, count;
384 GEM_BUG_ON(n >= obj->base.size >> PAGE_SHIFT);
385 GEM_BUG_ON(!i915_gem_object_has_pinned_pages(obj));
387 /* As we iterate forward through the sg, we record each entry in a
388 * radixtree for quick repeated (backwards) lookups. If we have seen
389 * this index previously, we will have an entry for it.
391 * Initial lookup is O(N), but this is amortized to O(1) for
392 * sequential page access (where each new request is consecutive
393 * to the previous one). Repeated lookups are O(lg(obj->base.size)),
394 * i.e. O(1) with a large constant!
396 if (n < READ_ONCE(iter->sg_idx))
399 mutex_lock(&iter->lock);
401 /* We prefer to reuse the last sg so that repeated lookup of this
402 * (or the subsequent) sg are fast - comparing against the last
403 * sg is faster than going through the radixtree.
408 count = __sg_page_count(sg);
410 while (idx + count <= n) {
415 /* If we cannot allocate and insert this entry, or the
416 * individual pages from this range, cancel updating the
417 * sg_idx so that on this lookup we are forced to linearly
418 * scan onwards, but on future lookups we will try the
419 * insertion again (in which case we need to be careful of
420 * the error return reporting that we have already inserted
423 ret = radix_tree_insert(&iter->radix, idx, sg);
424 if (ret && ret != -EEXIST)
427 entry = xa_mk_value(idx);
428 for (i = 1; i < count; i++) {
429 ret = radix_tree_insert(&iter->radix, idx + i, entry);
430 if (ret && ret != -EEXIST)
435 sg = ____sg_next(sg);
436 count = __sg_page_count(sg);
443 mutex_unlock(&iter->lock);
445 if (unlikely(n < idx)) /* insertion completed by another thread */
448 /* In case we failed to insert the entry into the radixtree, we need
449 * to look beyond the current sg.
451 while (idx + count <= n) {
453 sg = ____sg_next(sg);
454 count = __sg_page_count(sg);
463 sg = radix_tree_lookup(&iter->radix, n);
466 /* If this index is in the middle of multi-page sg entry,
467 * the radix tree will contain a value entry that points
468 * to the start of that range. We will return the pointer to
469 * the base page and the offset of this page within the
473 if (unlikely(xa_is_value(sg))) {
474 unsigned long base = xa_to_value(sg);
476 sg = radix_tree_lookup(&iter->radix, base);
488 i915_gem_object_get_page(struct drm_i915_gem_object *obj, unsigned int n)
490 struct scatterlist *sg;
493 GEM_BUG_ON(!i915_gem_object_has_struct_page(obj));
495 sg = i915_gem_object_get_sg(obj, n, &offset);
496 return nth_page(sg_page(sg), offset);
499 /* Like i915_gem_object_get_page(), but mark the returned page dirty */
501 i915_gem_object_get_dirty_page(struct drm_i915_gem_object *obj,
506 page = i915_gem_object_get_page(obj, n);
508 set_page_dirty(page);
514 i915_gem_object_get_dma_address_len(struct drm_i915_gem_object *obj,
518 struct scatterlist *sg;
521 sg = i915_gem_object_get_sg(obj, n, &offset);
524 *len = sg_dma_len(sg) - (offset << PAGE_SHIFT);
526 return sg_dma_address(sg) + (offset << PAGE_SHIFT);
530 i915_gem_object_get_dma_address(struct drm_i915_gem_object *obj,
533 return i915_gem_object_get_dma_address_len(obj, n, NULL);