2 * Copyright © 2007 Red Hat Inc.
3 * Copyright © 2007-2017 Intel Corporation
4 * Copyright © 2006 VMware, Inc.
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the "Software"),
9 * to deal in the Software without restriction, including without limitation
10 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
11 * and/or sell copies of the Software, and to permit persons to whom the
12 * Software is furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice (including the next
15 * paragraph) shall be included in all copies or substantial portions of the
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
19 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
21 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
22 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
23 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
28 * Authors: Thomas Hellström <thellstrom@vmware.com>
29 * Keith Whitwell <keithw@vmware.com>
30 * Eric Anholt <eric@anholt.net>
31 * Dave Airlie <airlied@linux.ie>
39 #include <util/u_atomic.h>
46 #include <sys/ioctl.h>
48 #include <sys/types.h>
53 #define ETIME ETIMEDOUT
55 #include "common/gen_clflush.h"
56 #include "common/gen_debug.h"
57 #include "dev/gen_device_info.h"
58 #include "libdrm_macros.h"
59 #include "main/macros.h"
60 #include "util/macros.h"
61 #include "util/hash_table.h"
62 #include "util/list.h"
63 #include "brw_bufmgr.h"
64 #include "brw_context.h"
77 /* VALGRIND_FREELIKE_BLOCK unfortunately does not actually undo the earlier
78 * VALGRIND_MALLOCLIKE_BLOCK but instead leaves vg convinced the memory is
79 * leaked. All because it does not call VG(cli_free) from its
80 * VG_USERREQ__FREELIKE_BLOCK handler. Instead of treating the memory like
81 * and allocation, we mark it available for use upon mmapping and remove
84 #define VG_DEFINED(ptr, size) VG(VALGRIND_MAKE_MEM_DEFINED(ptr, size))
85 #define VG_NOACCESS(ptr, size) VG(VALGRIND_MAKE_MEM_NOACCESS(ptr, size))
87 #define PAGE_SIZE 4096
89 #define FILE_DEBUG_FLAG DEBUG_BUFMGR
92 atomic_add_unless(int *v
, int add
, int unless
)
96 while (c
!= unless
&& (old
= p_atomic_cmpxchg(v
, c
, c
+ add
)) != c
)
101 struct bo_cache_bucket
{
102 struct list_head head
;
111 /** Array of lists of cached gem objects of power-of-two sizes */
112 struct bo_cache_bucket cache_bucket
[14 * 4];
116 struct hash_table
*name_table
;
117 struct hash_table
*handle_table
;
122 bool supports_48b_addresses
:1;
125 static int bo_set_tiling_internal(struct brw_bo
*bo
, uint32_t tiling_mode
,
128 static void bo_free(struct brw_bo
*bo
);
131 key_hash_uint(const void *key
)
133 return _mesa_hash_data(key
, 4);
137 key_uint_equal(const void *a
, const void *b
)
139 return *((unsigned *) a
) == *((unsigned *) b
);
142 static struct brw_bo
*
143 hash_find_bo(struct hash_table
*ht
, unsigned int key
)
145 struct hash_entry
*entry
= _mesa_hash_table_search(ht
, &key
);
146 return entry
? (struct brw_bo
*) entry
->data
: NULL
;
150 bo_tile_size(struct brw_bufmgr
*bufmgr
, uint64_t size
, uint32_t tiling
)
152 if (tiling
== I915_TILING_NONE
)
155 /* 965+ just need multiples of page size for tiling */
156 return ALIGN(size
, 4096);
160 * Round a given pitch up to the minimum required for X tiling on a
161 * given chip. We use 512 as the minimum to allow for a later tiling
165 bo_tile_pitch(struct brw_bufmgr
*bufmgr
, uint32_t pitch
, uint32_t tiling
)
167 unsigned long tile_width
;
169 /* If untiled, then just align it so that we can do rendering
170 * to it with the 3D engine.
172 if (tiling
== I915_TILING_NONE
)
173 return ALIGN(pitch
, 64);
175 if (tiling
== I915_TILING_X
)
180 /* 965 is flexible */
181 return ALIGN(pitch
, tile_width
);
185 * This function finds the correct bucket fit for the input size.
186 * The function works with O(1) complexity when the requested size
187 * was queried instead of iterating the size through all the buckets.
189 static struct bo_cache_bucket
*
190 bucket_for_size(struct brw_bufmgr
*bufmgr
, uint64_t size
)
192 /* Calculating the pages and rounding up to the page size. */
193 const unsigned pages
= (size
+ PAGE_SIZE
- 1) / PAGE_SIZE
;
195 /* Row Bucket sizes clz((x-1) | 3) Row Column
196 * in pages stride size
197 * 0: 1 2 3 4 -> 30 30 30 30 4 1
198 * 1: 5 6 7 8 -> 29 29 29 29 4 1
199 * 2: 10 12 14 16 -> 28 28 28 28 8 2
200 * 3: 20 24 28 32 -> 27 27 27 27 16 4
202 const unsigned row
= 30 - __builtin_clz((pages
- 1) | 3);
203 const unsigned row_max_pages
= 4 << row
;
205 /* The '& ~2' is the special case for row 1. In row 1, max pages /
206 * 2 is 2, but the previous row maximum is zero (because there is
207 * no previous row). All row maximum sizes are power of 2, so that
208 * is the only case where that bit will be set.
210 const unsigned prev_row_max_pages
= (row_max_pages
/ 2) & ~2;
211 int col_size_log2
= row
- 1;
212 col_size_log2
+= (col_size_log2
< 0);
214 const unsigned col
= (pages
- prev_row_max_pages
+
215 ((1 << col_size_log2
) - 1)) >> col_size_log2
;
217 /* Calculating the index based on the row and column. */
218 const unsigned index
= (row
* 4) + (col
- 1);
220 return (index
< bufmgr
->num_buckets
) ?
221 &bufmgr
->cache_bucket
[index
] : NULL
;
225 brw_bo_busy(struct brw_bo
*bo
)
227 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
228 struct drm_i915_gem_busy busy
= { .handle
= bo
->gem_handle
};
230 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_BUSY
, &busy
);
232 bo
->idle
= !busy
.busy
;
239 brw_bo_madvise(struct brw_bo
*bo
, int state
)
241 struct drm_i915_gem_madvise madv
= {
242 .handle
= bo
->gem_handle
,
247 drmIoctl(bo
->bufmgr
->fd
, DRM_IOCTL_I915_GEM_MADVISE
, &madv
);
249 return madv
.retained
;
252 /* drop the oldest entries that have been purged by the kernel */
254 brw_bo_cache_purge_bucket(struct brw_bufmgr
*bufmgr
,
255 struct bo_cache_bucket
*bucket
)
257 list_for_each_entry_safe(struct brw_bo
, bo
, &bucket
->head
, head
) {
258 if (brw_bo_madvise(bo
, I915_MADV_DONTNEED
))
266 static struct brw_bo
*
267 bo_alloc_internal(struct brw_bufmgr
*bufmgr
,
271 uint32_t tiling_mode
,
275 unsigned int page_size
= getpagesize();
277 struct bo_cache_bucket
*bucket
;
278 bool alloc_from_cache
;
283 if (flags
& BO_ALLOC_BUSY
)
286 if (flags
& BO_ALLOC_ZEROED
)
289 /* BUSY does doesn't really jive with ZEROED as we have to wait for it to
290 * be idle before we can memset. Just disallow that combination.
292 assert(!(busy
&& zeroed
));
294 /* Round the allocated size up to a power of two number of pages. */
295 bucket
= bucket_for_size(bufmgr
, size
);
297 /* If we don't have caching at this size, don't actually round the
300 if (bucket
== NULL
) {
302 if (bo_size
< page_size
)
305 bo_size
= bucket
->size
;
308 mtx_lock(&bufmgr
->lock
);
309 /* Get a buffer out of the cache if available */
311 alloc_from_cache
= false;
312 if (bucket
!= NULL
&& !list_empty(&bucket
->head
)) {
313 if (busy
&& !zeroed
) {
314 /* Allocate new render-target BOs from the tail (MRU)
315 * of the list, as it will likely be hot in the GPU
316 * cache and in the aperture for us. If the caller
317 * asked us to zero the buffer, we don't want this
318 * because we are going to mmap it.
320 bo
= LIST_ENTRY(struct brw_bo
, bucket
->head
.prev
, head
);
322 alloc_from_cache
= true;
325 /* For non-render-target BOs (where we're probably
326 * going to map it first thing in order to fill it
327 * with data), check if the last BO in the cache is
328 * unbusy, and only reuse in that case. Otherwise,
329 * allocating a new buffer is probably faster than
330 * waiting for the GPU to finish.
332 bo
= LIST_ENTRY(struct brw_bo
, bucket
->head
.next
, head
);
333 if (!brw_bo_busy(bo
)) {
334 alloc_from_cache
= true;
339 if (alloc_from_cache
) {
340 if (!brw_bo_madvise(bo
, I915_MADV_WILLNEED
)) {
342 brw_bo_cache_purge_bucket(bufmgr
, bucket
);
346 if (bo_set_tiling_internal(bo
, tiling_mode
, stride
)) {
352 void *map
= brw_bo_map(NULL
, bo
, MAP_WRITE
| MAP_RAW
);
357 memset(map
, 0, bo_size
);
362 if (!alloc_from_cache
) {
363 bo
= calloc(1, sizeof(*bo
));
370 struct drm_i915_gem_create create
= { .size
= bo_size
};
372 /* All new BOs we get from the kernel are zeroed, so we don't need to
373 * worry about that here.
375 ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_CREATE
, &create
);
381 bo
->gem_handle
= create
.handle
;
386 bo
->tiling_mode
= I915_TILING_NONE
;
387 bo
->swizzle_mode
= I915_BIT_6_SWIZZLE_NONE
;
390 if (bo_set_tiling_internal(bo
, tiling_mode
, stride
))
393 /* Calling set_domain() will allocate pages for the BO outside of the
394 * struct mutex lock in the kernel, which is more efficient than waiting
395 * to create them during the first execbuf that uses the BO.
397 struct drm_i915_gem_set_domain sd
= {
398 .handle
= bo
->gem_handle
,
399 .read_domains
= I915_GEM_DOMAIN_CPU
,
403 if (drmIoctl(bo
->bufmgr
->fd
, DRM_IOCTL_I915_GEM_SET_DOMAIN
, &sd
) != 0)
408 p_atomic_set(&bo
->refcount
, 1);
410 bo
->cache_coherent
= bufmgr
->has_llc
;
412 if (bufmgr
->supports_48b_addresses
)
413 bo
->kflags
= EXEC_OBJECT_SUPPORTS_48B_ADDRESS
;
415 mtx_unlock(&bufmgr
->lock
);
417 DBG("bo_create: buf %d (%s) %llub\n", bo
->gem_handle
, bo
->name
,
418 (unsigned long long) size
);
425 mtx_unlock(&bufmgr
->lock
);
430 brw_bo_alloc(struct brw_bufmgr
*bufmgr
,
431 const char *name
, uint64_t size
, uint64_t alignment
)
433 return bo_alloc_internal(bufmgr
, name
, size
, 0, I915_TILING_NONE
, 0);
437 brw_bo_alloc_tiled(struct brw_bufmgr
*bufmgr
, const char *name
,
438 uint64_t size
, uint32_t tiling_mode
, uint32_t pitch
,
441 return bo_alloc_internal(bufmgr
, name
, size
, flags
, tiling_mode
, pitch
);
445 brw_bo_alloc_tiled_2d(struct brw_bufmgr
*bufmgr
, const char *name
,
446 int x
, int y
, int cpp
, uint32_t tiling
,
447 uint32_t *pitch
, unsigned flags
)
451 unsigned long aligned_y
, height_alignment
;
453 /* If we're tiled, our allocations are in 8 or 32-row blocks,
454 * so failure to align our height means that we won't allocate
457 * If we're untiled, we still have to align to 2 rows high
458 * because the data port accesses 2x2 blocks even if the
459 * bottom row isn't to be rendered, so failure to align means
460 * we could walk off the end of the GTT and fault. This is
461 * documented on 965, and may be the case on older chipsets
462 * too so we try to be careful.
465 height_alignment
= 2;
467 if (tiling
== I915_TILING_X
)
468 height_alignment
= 8;
469 else if (tiling
== I915_TILING_Y
)
470 height_alignment
= 32;
471 aligned_y
= ALIGN(y
, height_alignment
);
474 stride
= bo_tile_pitch(bufmgr
, stride
, tiling
);
475 size
= stride
* aligned_y
;
476 size
= bo_tile_size(bufmgr
, size
, tiling
);
479 if (tiling
== I915_TILING_NONE
)
482 return bo_alloc_internal(bufmgr
, name
, size
, flags
, tiling
, stride
);
486 * Returns a brw_bo wrapping the given buffer object handle.
488 * This can be used when one application needs to pass a buffer object
492 brw_bo_gem_create_from_name(struct brw_bufmgr
*bufmgr
,
493 const char *name
, unsigned int handle
)
497 /* At the moment most applications only have a few named bo.
498 * For instance, in a DRI client only the render buffers passed
499 * between X and the client are named. And since X returns the
500 * alternating names for the front/back buffer a linear search
501 * provides a sufficiently fast match.
503 mtx_lock(&bufmgr
->lock
);
504 bo
= hash_find_bo(bufmgr
->name_table
, handle
);
506 brw_bo_reference(bo
);
510 struct drm_gem_open open_arg
= { .name
= handle
};
511 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_GEM_OPEN
, &open_arg
);
513 DBG("Couldn't reference %s handle 0x%08x: %s\n",
514 name
, handle
, strerror(errno
));
518 /* Now see if someone has used a prime handle to get this
519 * object from the kernel before by looking through the list
520 * again for a matching gem_handle
522 bo
= hash_find_bo(bufmgr
->handle_table
, open_arg
.handle
);
524 brw_bo_reference(bo
);
528 bo
= calloc(1, sizeof(*bo
));
532 p_atomic_set(&bo
->refcount
, 1);
534 bo
->size
= open_arg
.size
;
537 bo
->gem_handle
= open_arg
.handle
;
539 bo
->global_name
= handle
;
540 bo
->reusable
= false;
543 _mesa_hash_table_insert(bufmgr
->handle_table
, &bo
->gem_handle
, bo
);
544 _mesa_hash_table_insert(bufmgr
->name_table
, &bo
->global_name
, bo
);
546 struct drm_i915_gem_get_tiling get_tiling
= { .handle
= bo
->gem_handle
};
547 ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_GET_TILING
, &get_tiling
);
551 bo
->tiling_mode
= get_tiling
.tiling_mode
;
552 bo
->swizzle_mode
= get_tiling
.swizzle_mode
;
553 /* XXX stride is unknown */
554 DBG("bo_create_from_handle: %d (%s)\n", handle
, bo
->name
);
557 mtx_unlock(&bufmgr
->lock
);
562 mtx_unlock(&bufmgr
->lock
);
567 bo_free(struct brw_bo
*bo
)
569 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
572 VG_NOACCESS(bo
->map_cpu
, bo
->size
);
573 drm_munmap(bo
->map_cpu
, bo
->size
);
576 VG_NOACCESS(bo
->map_wc
, bo
->size
);
577 drm_munmap(bo
->map_wc
, bo
->size
);
580 VG_NOACCESS(bo
->map_gtt
, bo
->size
);
581 drm_munmap(bo
->map_gtt
, bo
->size
);
585 struct hash_entry
*entry
;
587 if (bo
->global_name
) {
588 entry
= _mesa_hash_table_search(bufmgr
->name_table
, &bo
->global_name
);
589 _mesa_hash_table_remove(bufmgr
->name_table
, entry
);
592 entry
= _mesa_hash_table_search(bufmgr
->handle_table
, &bo
->gem_handle
);
593 _mesa_hash_table_remove(bufmgr
->handle_table
, entry
);
596 /* Close this object */
597 struct drm_gem_close close
= { .handle
= bo
->gem_handle
};
598 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_GEM_CLOSE
, &close
);
600 DBG("DRM_IOCTL_GEM_CLOSE %d failed (%s): %s\n",
601 bo
->gem_handle
, bo
->name
, strerror(errno
));
606 /** Frees all cached buffers significantly older than @time. */
608 cleanup_bo_cache(struct brw_bufmgr
*bufmgr
, time_t time
)
612 if (bufmgr
->time
== time
)
615 for (i
= 0; i
< bufmgr
->num_buckets
; i
++) {
616 struct bo_cache_bucket
*bucket
= &bufmgr
->cache_bucket
[i
];
618 list_for_each_entry_safe(struct brw_bo
, bo
, &bucket
->head
, head
) {
619 if (time
- bo
->free_time
<= 1)
632 bo_unreference_final(struct brw_bo
*bo
, time_t time
)
634 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
635 struct bo_cache_bucket
*bucket
;
637 DBG("bo_unreference final: %d (%s)\n", bo
->gem_handle
, bo
->name
);
639 bucket
= bucket_for_size(bufmgr
, bo
->size
);
640 /* Put the buffer into our internal cache for reuse if we can. */
641 if (bufmgr
->bo_reuse
&& bo
->reusable
&& bucket
!= NULL
&&
642 brw_bo_madvise(bo
, I915_MADV_DONTNEED
)) {
643 bo
->free_time
= time
;
648 list_addtail(&bo
->head
, &bucket
->head
);
655 brw_bo_unreference(struct brw_bo
*bo
)
660 assert(p_atomic_read(&bo
->refcount
) > 0);
662 if (atomic_add_unless(&bo
->refcount
, -1, 1)) {
663 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
664 struct timespec time
;
666 clock_gettime(CLOCK_MONOTONIC
, &time
);
668 mtx_lock(&bufmgr
->lock
);
670 if (p_atomic_dec_zero(&bo
->refcount
)) {
671 bo_unreference_final(bo
, time
.tv_sec
);
672 cleanup_bo_cache(bufmgr
, time
.tv_sec
);
675 mtx_unlock(&bufmgr
->lock
);
680 bo_wait_with_stall_warning(struct brw_context
*brw
,
684 bool busy
= brw
&& brw
->perf_debug
&& !bo
->idle
;
685 double elapsed
= unlikely(busy
) ? -get_time() : 0.0;
687 brw_bo_wait_rendering(bo
);
689 if (unlikely(busy
)) {
690 elapsed
+= get_time();
691 if (elapsed
> 1e-5) /* 0.01ms */
692 perf_debug("%s a busy \"%s\" BO stalled and took %.03f ms.\n",
693 action
, bo
->name
, elapsed
* 1000);
698 print_flags(unsigned flags
)
700 if (flags
& MAP_READ
)
702 if (flags
& MAP_WRITE
)
704 if (flags
& MAP_ASYNC
)
706 if (flags
& MAP_PERSISTENT
)
708 if (flags
& MAP_COHERENT
)
716 brw_bo_map_cpu(struct brw_context
*brw
, struct brw_bo
*bo
, unsigned flags
)
718 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
720 /* We disallow CPU maps for writing to non-coherent buffers, as the
721 * CPU map can become invalidated when a batch is flushed out, which
722 * can happen at unpredictable times. You should use WC maps instead.
724 assert(bo
->cache_coherent
|| !(flags
& MAP_WRITE
));
727 DBG("brw_bo_map_cpu: %d (%s)\n", bo
->gem_handle
, bo
->name
);
729 struct drm_i915_gem_mmap mmap_arg
= {
730 .handle
= bo
->gem_handle
,
733 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_MMAP
, &mmap_arg
);
736 DBG("%s:%d: Error mapping buffer %d (%s): %s .\n",
737 __FILE__
, __LINE__
, bo
->gem_handle
, bo
->name
, strerror(errno
));
740 void *map
= (void *) (uintptr_t) mmap_arg
.addr_ptr
;
741 VG_DEFINED(map
, bo
->size
);
743 if (p_atomic_cmpxchg(&bo
->map_cpu
, NULL
, map
)) {
744 VG_NOACCESS(map
, bo
->size
);
745 drm_munmap(map
, bo
->size
);
750 DBG("brw_bo_map_cpu: %d (%s) -> %p, ", bo
->gem_handle
, bo
->name
,
754 if (!(flags
& MAP_ASYNC
)) {
755 bo_wait_with_stall_warning(brw
, bo
, "CPU mapping");
758 if (!bo
->cache_coherent
&& !bo
->bufmgr
->has_llc
) {
759 /* If we're reusing an existing CPU mapping, the CPU caches may
760 * contain stale data from the last time we read from that mapping.
761 * (With the BO cache, it might even be data from a previous buffer!)
762 * Even if it's a brand new mapping, the kernel may have zeroed the
763 * buffer via CPU writes.
765 * We need to invalidate those cachelines so that we see the latest
766 * contents, and so long as we only read from the CPU mmap we do not
767 * need to write those cachelines back afterwards.
769 * On LLC, the emprical evidence suggests that writes from the GPU
770 * that bypass the LLC (i.e. for scanout) do *invalidate* the CPU
771 * cachelines. (Other reads, such as the display engine, bypass the
772 * LLC entirely requiring us to keep dirty pixels for the scanout
775 gen_invalidate_range(bo
->map_cpu
, bo
->size
);
782 brw_bo_map_wc(struct brw_context
*brw
, struct brw_bo
*bo
, unsigned flags
)
784 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
786 if (!bufmgr
->has_mmap_wc
)
790 DBG("brw_bo_map_wc: %d (%s)\n", bo
->gem_handle
, bo
->name
);
792 struct drm_i915_gem_mmap mmap_arg
= {
793 .handle
= bo
->gem_handle
,
795 .flags
= I915_MMAP_WC
,
797 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_MMAP
, &mmap_arg
);
800 DBG("%s:%d: Error mapping buffer %d (%s): %s .\n",
801 __FILE__
, __LINE__
, bo
->gem_handle
, bo
->name
, strerror(errno
));
805 void *map
= (void *) (uintptr_t) mmap_arg
.addr_ptr
;
806 VG_DEFINED(map
, bo
->size
);
808 if (p_atomic_cmpxchg(&bo
->map_wc
, NULL
, map
)) {
809 VG_NOACCESS(map
, bo
->size
);
810 drm_munmap(map
, bo
->size
);
815 DBG("brw_bo_map_wc: %d (%s) -> %p\n", bo
->gem_handle
, bo
->name
, bo
->map_wc
);
818 if (!(flags
& MAP_ASYNC
)) {
819 bo_wait_with_stall_warning(brw
, bo
, "WC mapping");
826 * Perform an uncached mapping via the GTT.
828 * Write access through the GTT is not quite fully coherent. On low power
829 * systems especially, like modern Atoms, we can observe reads from RAM before
830 * the write via GTT has landed. A write memory barrier that flushes the Write
831 * Combining Buffer (i.e. sfence/mfence) is not sufficient to order the later
832 * read after the write as the GTT write suffers a small delay through the GTT
833 * indirection. The kernel uses an uncached mmio read to ensure the GTT write
834 * is ordered with reads (either by the GPU, WB or WC) and unconditionally
835 * flushes prior to execbuf submission. However, if we are not informing the
836 * kernel about our GTT writes, it will not flush before earlier access, such
837 * as when using the cmdparser. Similarly, we need to be careful if we should
838 * ever issue a CPU read immediately following a GTT write.
840 * Telling the kernel about write access also has one more important
841 * side-effect. Upon receiving notification about the write, it cancels any
842 * scanout buffering for FBC/PSR and friends. Later FBC/PSR is then flushed by
843 * either SW_FINISH or DIRTYFB. The presumption is that we never write to the
844 * actual scanout via a mmaping, only to a backbuffer and so all the FBC/PSR
845 * tracking is handled on the buffer exchange instead.
848 brw_bo_map_gtt(struct brw_context
*brw
, struct brw_bo
*bo
, unsigned flags
)
850 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
852 /* Get a mapping of the buffer if we haven't before. */
853 if (bo
->map_gtt
== NULL
) {
854 DBG("bo_map_gtt: mmap %d (%s)\n", bo
->gem_handle
, bo
->name
);
856 struct drm_i915_gem_mmap_gtt mmap_arg
= { .handle
= bo
->gem_handle
};
858 /* Get the fake offset back... */
859 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_MMAP_GTT
, &mmap_arg
);
861 DBG("%s:%d: Error preparing buffer map %d (%s): %s .\n",
862 __FILE__
, __LINE__
, bo
->gem_handle
, bo
->name
, strerror(errno
));
867 void *map
= drm_mmap(0, bo
->size
, PROT_READ
| PROT_WRITE
,
868 MAP_SHARED
, bufmgr
->fd
, mmap_arg
.offset
);
869 if (map
== MAP_FAILED
) {
870 DBG("%s:%d: Error mapping buffer %d (%s): %s .\n",
871 __FILE__
, __LINE__
, bo
->gem_handle
, bo
->name
, strerror(errno
));
875 /* We don't need to use VALGRIND_MALLOCLIKE_BLOCK because Valgrind will
876 * already intercept this mmap call. However, for consistency between
877 * all the mmap paths, we mark the pointer as defined now and mark it
878 * as inaccessible afterwards.
880 VG_DEFINED(map
, bo
->size
);
882 if (p_atomic_cmpxchg(&bo
->map_gtt
, NULL
, map
)) {
883 VG_NOACCESS(map
, bo
->size
);
884 drm_munmap(map
, bo
->size
);
889 DBG("bo_map_gtt: %d (%s) -> %p, ", bo
->gem_handle
, bo
->name
, bo
->map_gtt
);
892 if (!(flags
& MAP_ASYNC
)) {
893 bo_wait_with_stall_warning(brw
, bo
, "GTT mapping");
900 can_map_cpu(struct brw_bo
*bo
, unsigned flags
)
902 if (bo
->cache_coherent
)
905 /* Even if the buffer itself is not cache-coherent (such as a scanout), on
906 * an LLC platform reads always are coherent (as they are performed via the
907 * central system agent). It is just the writes that we need to take special
908 * care to ensure that land in main memory and not stick in the CPU cache.
910 if (!(flags
& MAP_WRITE
) && bo
->bufmgr
->has_llc
)
913 /* If PERSISTENT or COHERENT are set, the mmapping needs to remain valid
914 * across batch flushes where the kernel will change cache domains of the
915 * bo, invalidating continued access to the CPU mmap on non-LLC device.
917 * Similarly, ASYNC typically means that the buffer will be accessed via
918 * both the CPU and the GPU simultaneously. Batches may be executed that
919 * use the BO even while it is mapped. While OpenGL technically disallows
920 * most drawing while non-persistent mappings are active, we may still use
921 * the GPU for blits or other operations, causing batches to happen at
922 * inconvenient times.
924 if (flags
& (MAP_PERSISTENT
| MAP_COHERENT
| MAP_ASYNC
))
927 return !(flags
& MAP_WRITE
);
931 brw_bo_map(struct brw_context
*brw
, struct brw_bo
*bo
, unsigned flags
)
933 if (bo
->tiling_mode
!= I915_TILING_NONE
&& !(flags
& MAP_RAW
))
934 return brw_bo_map_gtt(brw
, bo
, flags
);
938 if (can_map_cpu(bo
, flags
))
939 map
= brw_bo_map_cpu(brw
, bo
, flags
);
941 map
= brw_bo_map_wc(brw
, bo
, flags
);
943 /* Allow the attempt to fail by falling back to the GTT where necessary.
945 * Not every buffer can be mmaped directly using the CPU (or WC), for
946 * example buffers that wrap stolen memory or are imported from other
947 * devices. For those, we have little choice but to use a GTT mmapping.
948 * However, if we use a slow GTT mmapping for reads where we expected fast
949 * access, that order of magnitude difference in throughput will be clearly
950 * expressed by angry users.
952 * We skip MAP_RAW because we want to avoid map_gtt's fence detiling.
954 if (!map
&& !(flags
& MAP_RAW
)) {
956 perf_debug("Fallback GTT mapping for %s with access flags %x\n",
959 map
= brw_bo_map_gtt(brw
, bo
, flags
);
966 brw_bo_subdata(struct brw_bo
*bo
, uint64_t offset
,
967 uint64_t size
, const void *data
)
969 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
971 struct drm_i915_gem_pwrite pwrite
= {
972 .handle
= bo
->gem_handle
,
975 .data_ptr
= (uint64_t) (uintptr_t) data
,
978 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_PWRITE
, &pwrite
);
981 DBG("%s:%d: Error writing data to buffer %d: "
982 "(%"PRIu64
" %"PRIu64
") %s .\n",
983 __FILE__
, __LINE__
, bo
->gem_handle
, offset
, size
, strerror(errno
));
989 /** Waits for all GPU rendering with the object to have completed. */
991 brw_bo_wait_rendering(struct brw_bo
*bo
)
993 /* We require a kernel recent enough for WAIT_IOCTL support.
994 * See intel_init_bufmgr()
1000 * Waits on a BO for the given amount of time.
1002 * @bo: buffer object to wait for
1003 * @timeout_ns: amount of time to wait in nanoseconds.
1004 * If value is less than 0, an infinite wait will occur.
1006 * Returns 0 if the wait was successful ie. the last batch referencing the
1007 * object has completed within the allotted time. Otherwise some negative return
1008 * value describes the error. Of particular interest is -ETIME when the wait has
1009 * failed to yield the desired result.
1011 * Similar to brw_bo_wait_rendering except a timeout parameter allows
1012 * the operation to give up after a certain amount of time. Another subtle
1013 * difference is the internal locking semantics are different (this variant does
1014 * not hold the lock for the duration of the wait). This makes the wait subject
1015 * to a larger userspace race window.
1017 * The implementation shall wait until the object is no longer actively
1018 * referenced within a batch buffer at the time of the call. The wait will
1019 * not guarantee that the buffer is re-issued via another thread, or an flinked
1020 * handle. Userspace must make sure this race does not occur if such precision
1023 * Note that some kernels have broken the inifite wait for negative values
1024 * promise, upgrade to latest stable kernels if this is the case.
1027 brw_bo_wait(struct brw_bo
*bo
, int64_t timeout_ns
)
1029 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
1031 /* If we know it's idle, don't bother with the kernel round trip */
1032 if (bo
->idle
&& !bo
->external
)
1035 struct drm_i915_gem_wait wait
= {
1036 .bo_handle
= bo
->gem_handle
,
1037 .timeout_ns
= timeout_ns
,
1039 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_WAIT
, &wait
);
1049 brw_bufmgr_destroy(struct brw_bufmgr
*bufmgr
)
1051 mtx_destroy(&bufmgr
->lock
);
1053 /* Free any cached buffer objects we were going to reuse */
1054 for (int i
= 0; i
< bufmgr
->num_buckets
; i
++) {
1055 struct bo_cache_bucket
*bucket
= &bufmgr
->cache_bucket
[i
];
1057 list_for_each_entry_safe(struct brw_bo
, bo
, &bucket
->head
, head
) {
1058 list_del(&bo
->head
);
1064 _mesa_hash_table_destroy(bufmgr
->name_table
, NULL
);
1065 _mesa_hash_table_destroy(bufmgr
->handle_table
, NULL
);
1071 bo_set_tiling_internal(struct brw_bo
*bo
, uint32_t tiling_mode
,
1074 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
1075 struct drm_i915_gem_set_tiling set_tiling
;
1078 if (bo
->global_name
== 0 &&
1079 tiling_mode
== bo
->tiling_mode
&& stride
== bo
->stride
)
1082 memset(&set_tiling
, 0, sizeof(set_tiling
));
1084 /* set_tiling is slightly broken and overwrites the
1085 * input on the error path, so we have to open code
1088 set_tiling
.handle
= bo
->gem_handle
;
1089 set_tiling
.tiling_mode
= tiling_mode
;
1090 set_tiling
.stride
= stride
;
1092 ret
= ioctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_SET_TILING
, &set_tiling
);
1093 } while (ret
== -1 && (errno
== EINTR
|| errno
== EAGAIN
));
1097 bo
->tiling_mode
= set_tiling
.tiling_mode
;
1098 bo
->swizzle_mode
= set_tiling
.swizzle_mode
;
1099 bo
->stride
= set_tiling
.stride
;
1104 brw_bo_get_tiling(struct brw_bo
*bo
, uint32_t *tiling_mode
,
1105 uint32_t *swizzle_mode
)
1107 *tiling_mode
= bo
->tiling_mode
;
1108 *swizzle_mode
= bo
->swizzle_mode
;
1112 static struct brw_bo
*
1113 brw_bo_gem_create_from_prime_internal(struct brw_bufmgr
*bufmgr
, int prime_fd
,
1114 int tiling_mode
, uint32_t stride
)
1119 mtx_lock(&bufmgr
->lock
);
1120 int ret
= drmPrimeFDToHandle(bufmgr
->fd
, prime_fd
, &handle
);
1122 DBG("create_from_prime: failed to obtain handle from fd: %s\n",
1124 mtx_unlock(&bufmgr
->lock
);
1129 * See if the kernel has already returned this buffer to us. Just as
1130 * for named buffers, we must not create two bo's pointing at the same
1133 bo
= hash_find_bo(bufmgr
->handle_table
, handle
);
1135 brw_bo_reference(bo
);
1139 bo
= calloc(1, sizeof(*bo
));
1143 p_atomic_set(&bo
->refcount
, 1);
1145 /* Determine size of bo. The fd-to-handle ioctl really should
1146 * return the size, but it doesn't. If we have kernel 3.12 or
1147 * later, we can lseek on the prime fd to get the size. Older
1148 * kernels will just fail, in which case we fall back to the
1149 * provided (estimated or guess size). */
1150 ret
= lseek(prime_fd
, 0, SEEK_END
);
1154 bo
->bufmgr
= bufmgr
;
1156 bo
->gem_handle
= handle
;
1157 _mesa_hash_table_insert(bufmgr
->handle_table
, &bo
->gem_handle
, bo
);
1160 bo
->reusable
= false;
1161 bo
->external
= true;
1163 if (tiling_mode
< 0) {
1164 struct drm_i915_gem_get_tiling get_tiling
= { .handle
= bo
->gem_handle
};
1165 if (drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_GET_TILING
, &get_tiling
))
1168 bo
->tiling_mode
= get_tiling
.tiling_mode
;
1169 bo
->swizzle_mode
= get_tiling
.swizzle_mode
;
1170 /* XXX stride is unknown */
1172 bo_set_tiling_internal(bo
, tiling_mode
, stride
);
1176 mtx_unlock(&bufmgr
->lock
);
1181 mtx_unlock(&bufmgr
->lock
);
1186 brw_bo_gem_create_from_prime(struct brw_bufmgr
*bufmgr
, int prime_fd
)
1188 return brw_bo_gem_create_from_prime_internal(bufmgr
, prime_fd
, -1, 0);
1192 brw_bo_gem_create_from_prime_tiled(struct brw_bufmgr
*bufmgr
, int prime_fd
,
1193 uint32_t tiling_mode
, uint32_t stride
)
1195 assert(tiling_mode
== I915_TILING_NONE
||
1196 tiling_mode
== I915_TILING_X
||
1197 tiling_mode
== I915_TILING_Y
);
1199 return brw_bo_gem_create_from_prime_internal(bufmgr
, prime_fd
,
1200 tiling_mode
, stride
);
1204 brw_bo_make_external(struct brw_bo
*bo
)
1206 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
1208 if (!bo
->external
) {
1209 mtx_lock(&bufmgr
->lock
);
1210 if (!bo
->external
) {
1211 _mesa_hash_table_insert(bufmgr
->handle_table
, &bo
->gem_handle
, bo
);
1212 bo
->external
= true;
1214 mtx_unlock(&bufmgr
->lock
);
1219 brw_bo_gem_export_to_prime(struct brw_bo
*bo
, int *prime_fd
)
1221 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
1223 brw_bo_make_external(bo
);
1225 if (drmPrimeHandleToFD(bufmgr
->fd
, bo
->gem_handle
,
1226 DRM_CLOEXEC
, prime_fd
) != 0)
1229 bo
->reusable
= false;
1235 brw_bo_export_gem_handle(struct brw_bo
*bo
)
1237 brw_bo_make_external(bo
);
1239 return bo
->gem_handle
;
1243 brw_bo_flink(struct brw_bo
*bo
, uint32_t *name
)
1245 struct brw_bufmgr
*bufmgr
= bo
->bufmgr
;
1247 if (!bo
->global_name
) {
1248 struct drm_gem_flink flink
= { .handle
= bo
->gem_handle
};
1250 if (drmIoctl(bufmgr
->fd
, DRM_IOCTL_GEM_FLINK
, &flink
))
1253 brw_bo_make_external(bo
);
1254 mtx_lock(&bufmgr
->lock
);
1255 if (!bo
->global_name
) {
1256 bo
->global_name
= flink
.name
;
1257 _mesa_hash_table_insert(bufmgr
->name_table
, &bo
->global_name
, bo
);
1259 mtx_unlock(&bufmgr
->lock
);
1261 bo
->reusable
= false;
1264 *name
= bo
->global_name
;
1269 * Enables unlimited caching of buffer objects for reuse.
1271 * This is potentially very memory expensive, as the cache at each bucket
1272 * size is only bounded by how many buffers of that size we've managed to have
1273 * in flight at once.
1276 brw_bufmgr_enable_reuse(struct brw_bufmgr
*bufmgr
)
1278 bufmgr
->bo_reuse
= true;
1282 add_bucket(struct brw_bufmgr
*bufmgr
, int size
)
1284 unsigned int i
= bufmgr
->num_buckets
;
1286 assert(i
< ARRAY_SIZE(bufmgr
->cache_bucket
));
1288 list_inithead(&bufmgr
->cache_bucket
[i
].head
);
1289 bufmgr
->cache_bucket
[i
].size
= size
;
1290 bufmgr
->num_buckets
++;
1292 assert(bucket_for_size(bufmgr
, size
) == &bufmgr
->cache_bucket
[i
]);
1293 assert(bucket_for_size(bufmgr
, size
- 2048) == &bufmgr
->cache_bucket
[i
]);
1294 assert(bucket_for_size(bufmgr
, size
+ 1) != &bufmgr
->cache_bucket
[i
]);
1298 init_cache_buckets(struct brw_bufmgr
*bufmgr
)
1300 uint64_t size
, cache_max_size
= 64 * 1024 * 1024;
1302 /* OK, so power of two buckets was too wasteful of memory.
1303 * Give 3 other sizes between each power of two, to hopefully
1304 * cover things accurately enough. (The alternative is
1305 * probably to just go for exact matching of sizes, and assume
1306 * that for things like composited window resize the tiled
1307 * width/height alignment and rounding of sizes to pages will
1308 * get us useful cache hit rates anyway)
1310 add_bucket(bufmgr
, 4096);
1311 add_bucket(bufmgr
, 4096 * 2);
1312 add_bucket(bufmgr
, 4096 * 3);
1314 /* Initialize the linked lists for BO reuse cache. */
1315 for (size
= 4 * 4096; size
<= cache_max_size
; size
*= 2) {
1316 add_bucket(bufmgr
, size
);
1318 add_bucket(bufmgr
, size
+ size
* 1 / 4);
1319 add_bucket(bufmgr
, size
+ size
* 2 / 4);
1320 add_bucket(bufmgr
, size
+ size
* 3 / 4);
1325 brw_create_hw_context(struct brw_bufmgr
*bufmgr
)
1327 struct drm_i915_gem_context_create create
= { };
1328 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_CONTEXT_CREATE
, &create
);
1330 DBG("DRM_IOCTL_I915_GEM_CONTEXT_CREATE failed: %s\n", strerror(errno
));
1334 return create
.ctx_id
;
1338 brw_hw_context_set_priority(struct brw_bufmgr
*bufmgr
,
1342 struct drm_i915_gem_context_param p
= {
1344 .param
= I915_CONTEXT_PARAM_PRIORITY
,
1350 if (drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_CONTEXT_SETPARAM
, &p
))
1357 brw_destroy_hw_context(struct brw_bufmgr
*bufmgr
, uint32_t ctx_id
)
1359 struct drm_i915_gem_context_destroy d
= { .ctx_id
= ctx_id
};
1362 drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_GEM_CONTEXT_DESTROY
, &d
) != 0) {
1363 fprintf(stderr
, "DRM_IOCTL_I915_GEM_CONTEXT_DESTROY failed: %s\n",
1369 brw_reg_read(struct brw_bufmgr
*bufmgr
, uint32_t offset
, uint64_t *result
)
1371 struct drm_i915_reg_read reg_read
= { .offset
= offset
};
1372 int ret
= drmIoctl(bufmgr
->fd
, DRM_IOCTL_I915_REG_READ
, ®_read
);
1374 *result
= reg_read
.val
;
1379 gem_param(int fd
, int name
)
1381 int v
= -1; /* No param uses (yet) the sign bit, reserve it for errors */
1383 struct drm_i915_getparam gp
= { .param
= name
, .value
= &v
};
1384 if (drmIoctl(fd
, DRM_IOCTL_I915_GETPARAM
, &gp
))
1391 gem_supports_48b_addresses(int fd
)
1393 struct drm_i915_gem_exec_object2 obj
= {
1394 .flags
= EXEC_OBJECT_SUPPORTS_48B_ADDRESS
,
1397 struct drm_i915_gem_execbuffer2 execbuf
= {
1398 .buffers_ptr
= (uintptr_t)&obj
,
1403 int ret
= drmIoctl(fd
, DRM_IOCTL_I915_GEM_EXECBUFFER2
, &execbuf
);
1405 return ret
== -1 && errno
== ENOENT
;
1409 * Initializes the GEM buffer manager, which uses the kernel to allocate, map,
1410 * and manage map buffer objections.
1412 * \param fd File descriptor of the opened DRM device.
1415 brw_bufmgr_init(struct gen_device_info
*devinfo
, int fd
)
1417 struct brw_bufmgr
*bufmgr
;
1419 bufmgr
= calloc(1, sizeof(*bufmgr
));
1423 /* Handles to buffer objects belong to the device fd and are not
1424 * reference counted by the kernel. If the same fd is used by
1425 * multiple parties (threads sharing the same screen bufmgr, or
1426 * even worse the same device fd passed to multiple libraries)
1427 * ownership of those handles is shared by those independent parties.
1429 * Don't do this! Ensure that each library/bufmgr has its own device
1430 * fd so that its namespace does not clash with another.
1434 if (mtx_init(&bufmgr
->lock
, mtx_plain
) != 0) {
1439 bufmgr
->has_llc
= devinfo
->has_llc
;
1440 bufmgr
->has_mmap_wc
= gem_param(fd
, I915_PARAM_MMAP_VERSION
) > 0;
1441 bufmgr
->supports_48b_addresses
=
1442 devinfo
->gen
>= 8 && gem_supports_48b_addresses(fd
);
1444 init_cache_buckets(bufmgr
);
1446 bufmgr
->name_table
=
1447 _mesa_hash_table_create(NULL
, key_hash_uint
, key_uint_equal
);
1448 bufmgr
->handle_table
=
1449 _mesa_hash_table_create(NULL
, key_hash_uint
, key_uint_equal
);