fdo-mirrors/mesa
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/mesa/mesa.git synced 2026-05-24 19:18:11 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions 1
mesa/src/gallium/drivers/iris/iris_bufmgr.c
Jianxun Zhang 31b48fd041 iris: Workaround: Don't allocate compressed bo from cache (xe2) 
There should be some deeper causes to dig out. The bo-caching
system shouldn't affect the compression by design.

Fixes:
dEQP-GLES3.functional.texture.filtering.3d.formats.rgb9_e5_linear
dEQP-GLES3.functional.texture.filtering.3d.formats.rgb9_e5_linear_mipmap_linear

The two cases can pass if we run them respectively. But once they
are fed to glcts in a test case list file (test.list) to run together,
the second test case hangs for a while and eventually fails, regardless
which of them is the second.

./glcts --deqp-caselist-file=test.list

Signed-off-by: Jianxun Zhang <jianxun.zhang@intel.com>
Reviewed-by: Tapani Pälli <tapani.palli@intel.com>
Reviewed-by: Nanley Chery <nanley.g.chery@intel.com>
Part-of: <https://gitlab.freedesktop.org/mesa/mesa/-/merge_requests/29906>
2024-06-26 05:25:43 +00:00

2674 lines
76 KiB
C
Raw Blame History

/*
* Copyright © 2017 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
*/
/**
* @file iris_bufmgr.c
*
* The Iris buffer manager.
*
* XXX: write better comments
* - BOs
* - Explain BO cache
* - main interface to GEM in the kernel
*/
#include <util/u_atomic.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <assert.h>
#include <sys/ioctl.h>
#include <sys/mman.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <stdbool.h>
#include <time.h>
#include <unistd.h>
#include "errno.h"
#include "common/intel_aux_map.h"
#include "common/intel_mem.h"
#include "c99_alloca.h"
#include "dev/intel_debug.h"
#include "common/intel_common.h"
#include "common/intel_gem.h"
#include "dev/intel_device_info.h"
#include "drm-uapi/dma-buf.h"
#include "isl/isl.h"
#include "util/os_mman.h"
#include "util/u_debug.h"
#include "util/macros.h"
#include "util/hash_table.h"
#include "util/list.h"
#include "util/os_file.h"
#include "util/u_dynarray.h"
#include "util/vma.h"
#include "iris_bufmgr.h"
#include "iris_context.h"
#include "string.h"
#include "iris_kmd_backend.h"
#include "i915/iris_bufmgr.h"
#include "xe/iris_bufmgr.h"
#include <xf86drm.h>
#ifdef HAVE_VALGRIND
#include <valgrind.h>
#include <memcheck.h>
#define VG(x) x
#else
#define VG(x)
#endif
/* VALGRIND_FREELIKE_BLOCK unfortunately does not actually undo the earlier
* VALGRIND_MALLOCLIKE_BLOCK but instead leaves vg convinced the memory is
* leaked. All because it does not call VG(cli_free) from its
* VG_USERREQ__FREELIKE_BLOCK handler. Instead of treating the memory like
* and allocation, we mark it available for use upon mmapping and remove
* it upon unmapping.
*/
#define VG_DEFINED(ptr, size) VG(VALGRIND_MAKE_MEM_DEFINED(ptr, size))
#define VG_NOACCESS(ptr, size) VG(VALGRIND_MAKE_MEM_NOACCESS(ptr, size))
/* On FreeBSD PAGE_SIZE is already defined in
* /usr/include/machine/param.h that is indirectly
* included here.
*/
#ifndef PAGE_SIZE
#define PAGE_SIZE 4096
#endif
#define WARN_ONCE(cond, fmt...) do { \
if (unlikely(cond)) { \
static bool _warned = false; \
if (!_warned) { \
fprintf(stderr, "WARNING: "); \
fprintf(stderr, fmt); \
_warned = true; \
} \
} \
} while (0)
#define FILE_DEBUG_FLAG DEBUG_BUFMGR
/**
* For debugging purposes, this returns a time in seconds.
*/
static double
get_time(void)
{
struct timespec tp;
clock_gettime(CLOCK_MONOTONIC, &tp);
return tp.tv_sec + tp.tv_nsec / 1000000000.0;
}
static inline int
atomic_add_unless(int *v, int add, int unless)
{
int c, old;
c = p_atomic_read(v);
while (c != unless && (old = p_atomic_cmpxchg(v, c, c + add)) != c)
c = old;
return c == unless;
}
static const char *
memzone_name(enum iris_memory_zone memzone)
{
const char *names[] = {
[IRIS_MEMZONE_SHADER] = "shader",
[IRIS_MEMZONE_BINDER] = "binder",
[IRIS_MEMZONE_SCRATCH] = "scratchsurf",
[IRIS_MEMZONE_SURFACE] = "surface",
[IRIS_MEMZONE_DYNAMIC] = "dynamic",
[IRIS_MEMZONE_OTHER] = "other",
[IRIS_MEMZONE_BORDER_COLOR_POOL] = "bordercolor",
};
assert(memzone < ARRAY_SIZE(names));
return names[memzone];
}
struct bo_cache_bucket {
/** List of cached BOs. */
struct list_head head;
/** Size of this bucket, in bytes. */
uint64_t size;
};
struct bo_export {
/** File descriptor associated with a handle export. */
int drm_fd;
/** GEM handle in drm_fd */
uint32_t gem_handle;
struct list_head link;
};
struct iris_memregion {
struct intel_memory_class_instance *region;
uint64_t size;
};
#define NUM_SLAB_ALLOCATORS 3
struct iris_slab {
struct pb_slab base;
/** The BO representing the entire slab */
struct iris_bo *bo;
/** Array of iris_bo structs representing BOs allocated out of this slab */
struct iris_bo *entries;
};
#define BUCKET_ARRAY_SIZE (14 * 4)
struct iris_bucket_cache {
struct bo_cache_bucket bucket[BUCKET_ARRAY_SIZE];
int num_buckets;
};
struct iris_bufmgr {
/**
* List into the list of bufmgr.
*/
struct list_head link;
uint32_t refcount;
int fd;
simple_mtx_t lock;
simple_mtx_t bo_deps_lock;
/** Array of lists of cached gem objects of power-of-two sizes */
struct iris_bucket_cache *bucket_cache;
time_t time;
struct hash_table *name_table;
struct hash_table *handle_table;
/**
* List of BOs which we've effectively freed, but are hanging on to
* until they're idle before closing and returning the VMA.
*/
struct list_head zombie_list;
struct util_vma_heap vma_allocator[IRIS_MEMZONE_COUNT];
struct iris_memregion vram, sys;
/* Used only when use_global_vm is true. */
uint32_t global_vm_id;
int next_screen_id;
struct intel_device_info devinfo;
const struct iris_kmd_backend *kmd_backend;
struct intel_bind_timeline bind_timeline; /* Xe only */
bool bo_reuse:1;
bool use_global_vm:1;
struct intel_aux_map_context *aux_map_ctx;
struct pb_slabs bo_slabs[NUM_SLAB_ALLOCATORS];
struct iris_border_color_pool border_color_pool;
struct iris_bo *dummy_aux_bo;
};
static simple_mtx_t global_bufmgr_list_mutex = SIMPLE_MTX_INITIALIZER;
static struct list_head global_bufmgr_list = {
.next = &global_bufmgr_list,
.prev = &global_bufmgr_list,
};
static void bo_free(struct iris_bo *bo);
static struct iris_bo *
find_and_ref_external_bo(struct hash_table *ht, unsigned int key)
{
struct hash_entry *entry = _mesa_hash_table_search(ht, &key);
struct iris_bo *bo = entry ? entry->data : NULL;
if (bo) {
assert(iris_bo_is_external(bo));
assert(iris_bo_is_real(bo));
assert(!bo->real.reusable);
/* Being non-reusable, the BO cannot be in the cache lists, but it
* may be in the zombie list if it had reached zero references, but
* we hadn't yet closed it...and then reimported the same BO. If it
* is, then remove it since it's now been resurrected.
*/
if (list_is_linked(&bo->head))
list_del(&bo->head);
iris_bo_reference(bo);
}
return bo;
}
/**
* This function finds the correct bucket fit for the input size.
* The function works with O(1) complexity when the requested size
* was queried instead of iterating the size through all the buckets.
*/
static struct bo_cache_bucket *
bucket_for_size(struct iris_bufmgr *bufmgr, uint64_t size,
enum iris_heap heap, unsigned flags)
{
if (flags & BO_ALLOC_PROTECTED)
return NULL;
/* TODO: Enable bo cache for compressed bos
* https://gitlab.freedesktop.org/mesa/mesa/-/issues/11362
*/
if (bufmgr->devinfo.verx10 == 200 && (flags & BO_ALLOC_COMPRESSED))
return NULL;
const struct intel_device_info *devinfo = &bufmgr->devinfo;
struct iris_bucket_cache *cache = &bufmgr->bucket_cache[heap];
if (devinfo->kmd_type == INTEL_KMD_TYPE_XE &&
(flags & (BO_ALLOC_SHARED | BO_ALLOC_SCANOUT)))
return NULL;
/* Calculating the pages and rounding up to the page size. */
const unsigned pages = (size + PAGE_SIZE - 1) / PAGE_SIZE;
/* Row Bucket sizes clz((x-1) | 3) Row Column
* in pages stride size
* 0: 1 2 3 4 -> 30 30 30 30 4 1
* 1: 5 6 7 8 -> 29 29 29 29 4 1
* 2: 10 12 14 16 -> 28 28 28 28 8 2
* 3: 20 24 28 32 -> 27 27 27 27 16 4
*/
const unsigned row = 30 - __builtin_clz((pages - 1) | 3);
const unsigned row_max_pages = 4 << row;
/* The '& ~2' is the special case for row 1. In row 1, max pages /
* 2 is 2, but the previous row maximum is zero (because there is
* no previous row). All row maximum sizes are power of 2, so that
* is the only case where that bit will be set.
*/
const unsigned prev_row_max_pages = (row_max_pages / 2) & ~2;
int col_size_log2 = row - 1;
col_size_log2 += (col_size_log2 < 0);
const unsigned col = (pages - prev_row_max_pages +
((1 << col_size_log2) - 1)) >> col_size_log2;
/* Calculating the index based on the row and column. */
const unsigned index = (row * 4) + (col - 1);
return (index < cache->num_buckets) ? &cache->bucket[index] : NULL;
}
enum iris_memory_zone
iris_memzone_for_address(uint64_t address)
{
STATIC_ASSERT(IRIS_MEMZONE_OTHER_START > IRIS_MEMZONE_DYNAMIC_START);
STATIC_ASSERT(IRIS_MEMZONE_SURFACE_START > IRIS_MEMZONE_SCRATCH_START);
STATIC_ASSERT(IRIS_MEMZONE_SCRATCH_START == IRIS_MEMZONE_BINDER_START);
STATIC_ASSERT(IRIS_MEMZONE_BINDER_START > IRIS_MEMZONE_SHADER_START);
STATIC_ASSERT(IRIS_MEMZONE_DYNAMIC_START > IRIS_MEMZONE_SURFACE_START);
STATIC_ASSERT(IRIS_BORDER_COLOR_POOL_ADDRESS == IRIS_MEMZONE_DYNAMIC_START);
if (address >= IRIS_MEMZONE_OTHER_START)
return IRIS_MEMZONE_OTHER;
if (address == IRIS_BORDER_COLOR_POOL_ADDRESS)
return IRIS_MEMZONE_BORDER_COLOR_POOL;
if (address > IRIS_MEMZONE_DYNAMIC_START)
return IRIS_MEMZONE_DYNAMIC;
if (address >= IRIS_MEMZONE_SURFACE_START)
return IRIS_MEMZONE_SURFACE;
if (address >= (IRIS_MEMZONE_BINDER_START + IRIS_SCRATCH_ZONE_SIZE))
return IRIS_MEMZONE_BINDER;
if (address >= IRIS_MEMZONE_SCRATCH_START)
return IRIS_MEMZONE_SCRATCH;
return IRIS_MEMZONE_SHADER;
}
/**
* Allocate a section of virtual memory for a buffer, assigning an address.
*
* This uses either the bucket allocator for the given size, or the large
* object allocator (util_vma).
*/
static uint64_t
vma_alloc(struct iris_bufmgr *bufmgr,
enum iris_memory_zone memzone,
uint64_t size,
uint64_t alignment)
{
simple_mtx_assert_locked(&bufmgr->lock);
const unsigned _2mb = 2 * 1024 * 1024;
/* Force minimum alignment based on device requirements */
assert((alignment & (alignment - 1)) == 0);
alignment = MAX2(alignment, bufmgr->devinfo.mem_alignment);
/* If the allocation is a multiple of 2MB, ensure the virtual address is
* aligned to 2MB, so that it's possible for the kernel to use 64K pages.
*/
if (size % _2mb == 0)
alignment = MAX2(alignment, _2mb);
if (memzone == IRIS_MEMZONE_BORDER_COLOR_POOL)
return IRIS_BORDER_COLOR_POOL_ADDRESS;
uint64_t addr =
util_vma_heap_alloc(&bufmgr->vma_allocator[memzone], size, alignment);
assert((addr >> 48ull) == 0);
assert((addr % alignment) == 0);
return intel_canonical_address(addr);
}
static void
vma_free(struct iris_bufmgr *bufmgr,
uint64_t address,
uint64_t size)
{
simple_mtx_assert_locked(&bufmgr->lock);
if (address == IRIS_BORDER_COLOR_POOL_ADDRESS)
return;
/* Un-canonicalize the address. */
address = intel_48b_address(address);
if (address == 0ull)
return;
enum iris_memory_zone memzone = iris_memzone_for_address(address);
assert(memzone < ARRAY_SIZE(bufmgr->vma_allocator));
util_vma_heap_free(&bufmgr->vma_allocator[memzone], address, size);
}
/* Exports a BO's implicit synchronization state to a drm_syncobj, returning
* its wrapping iris_syncobj. The drm_syncobj is created new and has to be
* destroyed by the caller after the execbuf ioctl.
*/
struct iris_syncobj *
iris_bo_export_sync_state(struct iris_bo *bo)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
int drm_fd = iris_bufmgr_get_fd(bufmgr);
struct iris_syncobj *iris_syncobj = iris_create_syncobj(bufmgr);
struct dma_buf_export_sync_file export_sync_file_ioctl = {
.flags = DMA_BUF_SYNC_RW, /* TODO */
.fd = -1,
};
if (intel_ioctl(bo->real.prime_fd, DMA_BUF_IOCTL_EXPORT_SYNC_FILE,
&export_sync_file_ioctl)) {
fprintf(stderr, "DMA_BUF_IOCTL_EXPORT_SYNC_FILE ioctl failed (%d)\n",
errno);
goto error_export;
}
int sync_file_fd = export_sync_file_ioctl.fd;
assert(sync_file_fd >= 0);
struct drm_syncobj_handle syncobj_import_ioctl = {
.handle = iris_syncobj->handle,
.flags = DRM_SYNCOBJ_FD_TO_HANDLE_FLAGS_IMPORT_SYNC_FILE,
.fd = sync_file_fd,
};
if (intel_ioctl(drm_fd, DRM_IOCTL_SYNCOBJ_FD_TO_HANDLE,
&syncobj_import_ioctl)) {
fprintf(stderr, "DRM_IOCTL_SYNCOBJ_FD_TO_HANDLE ioctl failed (%d)\n",
errno);
}
close(sync_file_fd);
return iris_syncobj;
error_export:
iris_syncobj_destroy(bufmgr, iris_syncobj);
return NULL;
}
/* Import the state of a sync_file_fd (which we should have gotten from
* batch_syncobj_to_sync_file_fd) into a BO as its implicit synchronization
* state.
*/
void
iris_bo_import_sync_state(struct iris_bo *bo, int sync_file_fd)
{
struct dma_buf_import_sync_file import_sync_file_ioctl = {
.flags = DMA_BUF_SYNC_WRITE,
.fd = sync_file_fd,
};
if (intel_ioctl(bo->real.prime_fd, DMA_BUF_IOCTL_IMPORT_SYNC_FILE,
&import_sync_file_ioctl))
fprintf(stderr, "DMA_BUF_IOCTL_IMPORT_SYNC_FILE ioctl failed (%d)\n",
errno);
}
/* A timeout of 0 just checks for busyness. */
static int
iris_bo_wait_syncobj(struct iris_bo *bo, int64_t timeout_ns)
{
int ret = 0;
struct iris_bufmgr *bufmgr = bo->bufmgr;
const bool is_external = iris_bo_is_real(bo) && bo->real.prime_fd != -1;
struct iris_syncobj *external_implicit_syncobj = NULL;
/* If we know it's idle, don't bother with the kernel round trip.
* Can't do that for Xe KMD with external BOs since we have to check the
* implicit synchronization information.
*/
if (!is_external && bo->idle)
return 0;
simple_mtx_lock(&bufmgr->bo_deps_lock);
const int handles_len = bo->deps_size * IRIS_BATCH_COUNT * 2 + is_external;
uint32_t *handles = handles_len <= 32 ?
(uint32_t *)alloca(handles_len * sizeof(*handles)) :
(uint32_t *)malloc(handles_len * sizeof(*handles));
int handle_count = 0;
if (is_external) {
external_implicit_syncobj = iris_bo_export_sync_state(bo);
if (external_implicit_syncobj)
handles[handle_count++] = external_implicit_syncobj->handle;
}
for (int d = 0; d < bo->deps_size; d++) {
for (int b = 0; b < IRIS_BATCH_COUNT; b++) {
struct iris_syncobj *r = bo->deps[d].read_syncobjs[b];
struct iris_syncobj *w = bo->deps[d].write_syncobjs[b];
if (r)
handles[handle_count++] = r->handle;
if (w)
handles[handle_count++] = w->handle;
}
}
if (handle_count == 0)
goto out;
/* Unlike the gem wait, negative values are not infinite here. */
int64_t timeout_abs = os_time_get_absolute_timeout(timeout_ns);
if (timeout_abs < 0)
timeout_abs = INT64_MAX;
struct drm_syncobj_wait args = {
.handles = (uintptr_t) handles,
.timeout_nsec = timeout_abs,
.count_handles = handle_count,
.flags = DRM_SYNCOBJ_WAIT_FLAGS_WAIT_ALL,
};
ret = intel_ioctl(bufmgr->fd, DRM_IOCTL_SYNCOBJ_WAIT, &args);
if (ret != 0) {
ret = -errno;
goto out;
}
/* We just waited everything, so clean all the deps. */
for (int d = 0; d < bo->deps_size; d++) {
for (int b = 0; b < IRIS_BATCH_COUNT; b++) {
iris_syncobj_reference(bufmgr, &bo->deps[d].write_syncobjs[b], NULL);
iris_syncobj_reference(bufmgr, &bo->deps[d].read_syncobjs[b], NULL);
}
}
out:
if (handles_len > 32)
free(handles);
if (external_implicit_syncobj)
iris_syncobj_reference(bufmgr, &external_implicit_syncobj, NULL);
simple_mtx_unlock(&bufmgr->bo_deps_lock);
return ret;
}
static bool
iris_bo_busy_syncobj(struct iris_bo *bo)
{
return iris_bo_wait_syncobj(bo, 0) == -ETIME;
}
bool
iris_bo_busy(struct iris_bo *bo)
{
bool busy;
switch (iris_bufmgr_get_device_info(bo->bufmgr)->kmd_type) {
case INTEL_KMD_TYPE_I915:
if (iris_bo_is_external(bo))
busy = iris_i915_bo_busy_gem(bo);
else
busy = iris_bo_busy_syncobj(bo);
break;
case INTEL_KMD_TYPE_XE:
busy = iris_bo_busy_syncobj(bo);
break;
default:
unreachable("missing");
busy = true;
}
bo->idle = !busy;
return busy;
}
/**
* Specify the volatility of the buffer.
* \param bo Buffer to create a name for
* \param state The purgeable status
*
* Use IRIS_MADVICE_DONT_NEED to mark the buffer as purgeable, and it will be
* reclaimed under memory pressure. If you subsequently require the buffer,
* then you must pass IRIS_MADVICE_WILL_NEED to mark the buffer as required.
*
* Returns true if the buffer was retained, or false if it was discarded
* whilst marked as IRIS_MADVICE_DONT_NEED.
*/
static inline bool
iris_bo_madvise(struct iris_bo *bo, enum iris_madvice state)
{
/* We can't madvise suballocated BOs. */
assert(iris_bo_is_real(bo));
return bo->bufmgr->kmd_backend->bo_madvise(bo, state);
}
static struct iris_bo *
bo_calloc(void)
{
struct iris_bo *bo = calloc(1, sizeof(*bo));
if (!bo)
return NULL;
list_inithead(&bo->real.exports);
bo->hash = _mesa_hash_pointer(bo);
return bo;
}
static void
bo_unmap(struct iris_bo *bo)
{
assert(iris_bo_is_real(bo));
VG_NOACCESS(bo->real.map, bo->size);
os_munmap(bo->real.map, bo->size);
bo->real.map = NULL;
}
static struct pb_slabs *
get_slabs(struct iris_bufmgr *bufmgr, uint64_t size)
{
for (unsigned i = 0; i < NUM_SLAB_ALLOCATORS; i++) {
struct pb_slabs *slabs = &bufmgr->bo_slabs[i];
if (size <= 1ull << (slabs->min_order + slabs->num_orders - 1))
return slabs;
}
unreachable("should have found a valid slab for this size");
}
/* Return the power of two size of a slab entry matching the input size. */
static unsigned
get_slab_pot_entry_size(struct iris_bufmgr *bufmgr, unsigned size)
{
unsigned entry_size = util_next_power_of_two(size);
unsigned min_entry_size = 1 << bufmgr->bo_slabs[0].min_order;
return MAX2(entry_size, min_entry_size);
}
/* Return the slab entry alignment. */
static unsigned
get_slab_entry_alignment(struct iris_bufmgr *bufmgr, unsigned size)
{
unsigned entry_size = get_slab_pot_entry_size(bufmgr, size);
if (size <= entry_size * 3 / 4)
return entry_size / 4;
return entry_size;
}
static bool
iris_can_reclaim_slab(void *priv, struct pb_slab_entry *entry)
{
struct iris_bo *bo = container_of(entry, struct iris_bo, slab.entry);
return !iris_bo_busy(bo);
}
static void
iris_slab_free(void *priv, struct pb_slab *pslab)
{
struct iris_bufmgr *bufmgr = priv;
struct iris_slab *slab = (void *) pslab;
struct intel_aux_map_context *aux_map_ctx = bufmgr->aux_map_ctx;
assert(!slab->bo->aux_map_address);
/* Since we're freeing the whole slab, all buffers allocated out of it
* must be reclaimable. We require buffers to be idle to be reclaimed
* (see iris_can_reclaim_slab()), so we know all entries must be idle.
* Therefore, we can safely unmap their aux table entries.
*/
for (unsigned i = 0; i < pslab->num_entries; i++) {
struct iris_bo *bo = &slab->entries[i];
if (aux_map_ctx && bo->aux_map_address) {
intel_aux_map_unmap_range(aux_map_ctx, bo->address, bo->size);
bo->aux_map_address = 0;
}
/* Unref read/write dependency syncobjs and free the array. */
for (int d = 0; d < bo->deps_size; d++) {
for (int b = 0; b < IRIS_BATCH_COUNT; b++) {
iris_syncobj_reference(bufmgr, &bo->deps[d].write_syncobjs[b], NULL);
iris_syncobj_reference(bufmgr, &bo->deps[d].read_syncobjs[b], NULL);
}
}
free(bo->deps);
}
iris_bo_unreference(slab->bo);
free(slab->entries);
free(slab);
}
static struct pb_slab *
iris_slab_alloc(void *priv,
unsigned heap,
unsigned entry_size,
unsigned group_index)
{
struct iris_bufmgr *bufmgr = priv;
struct iris_slab *slab = calloc(1, sizeof(struct iris_slab));
uint32_t flags = BO_ALLOC_NO_SUBALLOC;
unsigned slab_size = 0;
/* We only support slab allocation for IRIS_MEMZONE_OTHER */
enum iris_memory_zone memzone = IRIS_MEMZONE_OTHER;
if (!slab)
return NULL;
struct pb_slabs *slabs = bufmgr->bo_slabs;
/* Determine the slab buffer size. */
for (unsigned i = 0; i < NUM_SLAB_ALLOCATORS; i++) {
unsigned max_entry_size =
1 << (slabs[i].min_order + slabs[i].num_orders - 1);
if (entry_size <= max_entry_size) {
/* The slab size is twice the size of the largest possible entry. */
slab_size = max_entry_size * 2;
if (!util_is_power_of_two_nonzero(entry_size)) {
assert(util_is_power_of_two_nonzero(entry_size * 4 / 3));
/* If the entry size is 3/4 of a power of two, we would waste
* space and not gain anything if we allocated only twice the
* power of two for the backing buffer:
*
* 2 * 3/4 = 1.5 usable with buffer size 2
*
* Allocating 5 times the entry size leads us to the next power
* of two and results in a much better memory utilization:
*
* 5 * 3/4 = 3.75 usable with buffer size 4
*/
if (entry_size * 5 > slab_size)
slab_size = util_next_power_of_two(entry_size * 5);
}
/* The largest slab should have the same size as the PTE fragment
* size to get faster address translation.
*
* TODO: move this to intel_device_info?
*/
const unsigned pte_size = 2 * 1024 * 1024;
if (i == NUM_SLAB_ALLOCATORS - 1 && slab_size < pte_size)
slab_size = pte_size;
break;
}
}
assert(slab_size != 0);
switch (heap) {
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED_COMPRESSED:
case IRIS_HEAP_DEVICE_LOCAL_COMPRESSED:
flags |= BO_ALLOC_COMPRESSED;
break;
case IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT:
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED:
flags |= BO_ALLOC_SMEM;
break;
case IRIS_HEAP_DEVICE_LOCAL:
flags |= BO_ALLOC_LMEM;
break;
case IRIS_HEAP_DEVICE_LOCAL_CPU_VISIBLE_SMALL_BAR:
flags |= BO_ALLOC_LMEM | BO_ALLOC_CPU_VISIBLE;
break;
default:
flags |= BO_ALLOC_PLAIN;
}
slab->bo =
iris_bo_alloc(bufmgr, "slab", slab_size, slab_size, memzone, flags);
if (!slab->bo)
goto fail;
slab_size = slab->bo->size;
slab->base.num_entries = slab_size / entry_size;
slab->base.num_free = slab->base.num_entries;
slab->base.group_index = group_index;
slab->base.entry_size = entry_size;
slab->entries = calloc(slab->base.num_entries, sizeof(*slab->entries));
if (!slab->entries)
goto fail_bo;
list_inithead(&slab->base.free);
for (unsigned i = 0; i < slab->base.num_entries; i++) {
struct iris_bo *bo = &slab->entries[i];
bo->size = entry_size;
bo->bufmgr = bufmgr;
bo->hash = _mesa_hash_pointer(bo);
bo->gem_handle = 0;
bo->address = intel_canonical_address(slab->bo->address + i * entry_size);
bo->aux_map_address = 0;
bo->index = -1;
bo->refcount = 0;
bo->idle = true;
bo->zeroed = slab->bo->zeroed;
bo->slab.entry.slab = &slab->base;
bo->slab.real = iris_get_backing_bo(slab->bo);
list_addtail(&bo->slab.entry.head, &slab->base.free);
}
return &slab->base;
fail_bo:
iris_bo_unreference(slab->bo);
fail:
free(slab);
return NULL;
}
/**
* Selects a heap for the given buffer allocation flags.
*
* This determines the cacheability, coherency, and mmap mode settings.
*/
static enum iris_heap
flags_to_heap(struct iris_bufmgr *bufmgr, unsigned flags)
{
const struct intel_device_info *devinfo = &bufmgr->devinfo;
if (bufmgr->vram.size > 0) {
if (flags & BO_ALLOC_COMPRESSED)
return IRIS_HEAP_DEVICE_LOCAL_COMPRESSED;
/* Discrete GPUs currently always snoop CPU caches. */
if ((flags & BO_ALLOC_SMEM) || (flags & BO_ALLOC_COHERENT))
return IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT;
if ((flags & BO_ALLOC_LMEM) ||
((flags & BO_ALLOC_SCANOUT) && !(flags & BO_ALLOC_SHARED))) {
if ((flags & BO_ALLOC_CPU_VISIBLE) && !intel_vram_all_mappable(devinfo))
return IRIS_HEAP_DEVICE_LOCAL_CPU_VISIBLE_SMALL_BAR;
return IRIS_HEAP_DEVICE_LOCAL;
}
return IRIS_HEAP_DEVICE_LOCAL_PREFERRED;
} else if (devinfo->has_llc) {
assert(!(flags & BO_ALLOC_LMEM));
if (flags & (BO_ALLOC_SCANOUT | BO_ALLOC_SHARED))
return IRIS_HEAP_SYSTEM_MEMORY_UNCACHED;
return IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT;
} else {
assert(!devinfo->has_llc);
assert(!(flags & BO_ALLOC_LMEM));
if (flags & BO_ALLOC_COMPRESSED)
return IRIS_HEAP_SYSTEM_MEMORY_UNCACHED_COMPRESSED;
if (flags & BO_ALLOC_COHERENT)
return IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT;
return IRIS_HEAP_SYSTEM_MEMORY_UNCACHED;
}
}
static bool
zero_bo(struct iris_bufmgr *bufmgr,
unsigned flags,
struct iris_bo *bo)
{
assert(flags & BO_ALLOC_ZEROED);
if (bo->zeroed)
return true;
if (bufmgr->devinfo.has_flat_ccs && (flags & BO_ALLOC_LMEM)) {
/* With flat CCS, all allocations in LMEM have memory ranges with
* corresponding CCS elements. These elements are only accessible
* through GPU commands, but we don't issue GPU commands here.
*/
return false;
}
void *map = iris_bo_map(NULL, bo, MAP_WRITE | MAP_RAW);
if (!map)
return false;
memset(map, 0, bo->size);
bo->zeroed = true;
return true;
}
static struct iris_bo *
alloc_bo_from_slabs(struct iris_bufmgr *bufmgr,
const char *name,
uint64_t size,
uint32_t alignment,
unsigned flags)
{
if (flags & BO_ALLOC_NO_SUBALLOC)
return NULL;
struct pb_slabs *last_slab = &bufmgr->bo_slabs[NUM_SLAB_ALLOCATORS - 1];
unsigned max_slab_entry_size =
1 << (last_slab->min_order + last_slab->num_orders - 1);
if (size > max_slab_entry_size)
return NULL;
struct pb_slab_entry *entry;
enum iris_heap heap = flags_to_heap(bufmgr, flags);
unsigned alloc_size = size;
/* Always use slabs for sizes less than 4 KB because the kernel aligns
* everything to 4 KB.
*/
if (size < alignment && alignment <= 4 * 1024)
alloc_size = alignment;
if (alignment > get_slab_entry_alignment(bufmgr, alloc_size)) {
/* 3/4 allocations can return too small alignment.
* Try again with a power of two allocation size.
*/
unsigned pot_size = get_slab_pot_entry_size(bufmgr, alloc_size);
if (alignment <= pot_size) {
/* This size works but wastes some memory to fulfill the alignment. */
alloc_size = pot_size;
} else {
/* can't fulfill alignment requirements */
return NULL;
}
}
struct pb_slabs *slabs = get_slabs(bufmgr, alloc_size);
entry = pb_slab_alloc(slabs, alloc_size, heap);
if (!entry) {
/* Clean up and try again... */
pb_slabs_reclaim(slabs);
entry = pb_slab_alloc(slabs, alloc_size, heap);
}
if (!entry)
return NULL;
struct iris_bo *bo = container_of(entry, struct iris_bo, slab.entry);
if (bo->aux_map_address && bo->bufmgr->aux_map_ctx) {
/* This buffer was associated with an aux-buffer range. We only allow
* slab allocated buffers to be reclaimed when idle (not in use by an
* executing batch). (See iris_can_reclaim_slab().) So we know that
* our previous aux mapping is no longer in use, and we can safely
* remove it.
*/
intel_aux_map_unmap_range(bo->bufmgr->aux_map_ctx, bo->address,
bo->size);
bo->aux_map_address = 0;
}
p_atomic_set(&bo->refcount, 1);
bo->name = name;
bo->size = size;
/* Zero the contents if necessary. If this fails, fall back to
* allocating a fresh BO, which will always be zeroed by the kernel.
*/
if ((flags & BO_ALLOC_ZEROED) && !zero_bo(bufmgr, flags, bo)) {
pb_slab_free(slabs, &bo->slab.entry);
return NULL;
}
return bo;
}
static struct iris_bo *
alloc_bo_from_cache(struct iris_bufmgr *bufmgr,
struct bo_cache_bucket *bucket,
uint32_t alignment,
enum iris_memory_zone memzone,
enum iris_mmap_mode mmap_mode,
unsigned flags,
bool match_zone)
{
if (!bucket)
return NULL;
struct iris_bo *bo = NULL;
simple_mtx_assert_locked(&bufmgr->lock);
list_for_each_entry_safe(struct iris_bo, cur, &bucket->head, head) {
assert(iris_bo_is_real(cur));
/* Find one that's got the right mapping type. We used to swap maps
* around but the kernel doesn't allow this on discrete GPUs.
*/
if (mmap_mode != cur->real.mmap_mode)
continue;
/* Try a little harder to find one that's already in the right memzone */
if (match_zone && memzone != iris_memzone_for_address(cur->address))
continue;
if (cur->real.capture != !!(flags & BO_ALLOC_CAPTURE))
continue;
/* If the last BO in the cache is busy, there are no idle BOs. Bail,
* either falling back to a non-matching memzone, or if that fails,
* allocating a fresh buffer.
*/
if (iris_bo_busy(cur))
return NULL;
list_del(&cur->head);
/* Tell the kernel we need this BO and check if it still exist */
if (!iris_bo_madvise(cur, IRIS_MADVICE_WILL_NEED)) {
/* This BO was purged, throw it out and keep looking. */
bo_free(cur);
continue;
}
if (cur->aux_map_address) {
/* This buffer was associated with an aux-buffer range. We make sure
* that buffers are not reused from the cache while the buffer is (busy)
* being used by an executing batch. Since we are here, the buffer is no
* longer being used by a batch and the buffer was deleted (in order to
* end up in the cache). Therefore its old aux-buffer range can be
* removed from the aux-map.
*/
if (cur->bufmgr->aux_map_ctx)
intel_aux_map_unmap_range(cur->bufmgr->aux_map_ctx, cur->address,
cur->size);
cur->aux_map_address = 0;
}
/* If the cached BO isn't in the right memory zone, or the alignment
* isn't sufficient, free the old memory and assign it a new address.
*/
if (memzone != iris_memzone_for_address(cur->address) ||
cur->address % alignment != 0) {
if (!bufmgr->kmd_backend->gem_vm_unbind(cur)) {
DBG("Unable to unbind vm of buf %u\n", cur->gem_handle);
bo_free(cur);
continue;
}
vma_free(bufmgr, cur->address, cur->size);
cur->address = 0ull;
}
bo = cur;
break;
}
if (!bo)
return NULL;
/* Zero the contents if necessary. If this fails, fall back to
* allocating a fresh BO, which will always be zeroed by the kernel.
*/
assert(bo->zeroed == false);
if ((flags & BO_ALLOC_ZEROED) && !zero_bo(bufmgr, flags, bo)) {
bo_free(bo);
return NULL;
}
return bo;
}
static struct iris_bo *
alloc_fresh_bo(struct iris_bufmgr *bufmgr, uint64_t bo_size, unsigned flags)
{
struct iris_bo *bo = bo_calloc();
if (!bo)
return NULL;
/* Try to allocate memory in multiples of 2MB, as this allows us to use
* 64K pages rather than the less-efficient 4K pages. Most BOs smaller
* than 64MB should hit the BO cache or slab allocations anyway, so this
* shouldn't waste too much memory. We do exclude small (< 1MB) sizes to
* be defensive in case any of those bypass the caches and end up here.
*/
if (bo_size >= 1024 * 1024)
bo_size = align64(bo_size, 2 * 1024 * 1024);
bo->real.heap = flags_to_heap(bufmgr, flags);
const struct intel_memory_class_instance *regions[2];
uint16_t num_regions = 0;
if (bufmgr->vram.size > 0) {
switch (bo->real.heap) {
case IRIS_HEAP_DEVICE_LOCAL_PREFERRED:
/* For vram allocations, still use system memory as a fallback. */
regions[num_regions++] = bufmgr->vram.region;
regions[num_regions++] = bufmgr->sys.region;
break;
case IRIS_HEAP_DEVICE_LOCAL:
case IRIS_HEAP_DEVICE_LOCAL_CPU_VISIBLE_SMALL_BAR:
case IRIS_HEAP_DEVICE_LOCAL_COMPRESSED:
regions[num_regions++] = bufmgr->vram.region;
break;
case IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT:
regions[num_regions++] = bufmgr->sys.region;
break;
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED_COMPRESSED:
/* not valid, compressed in discrete is always created with
* IRIS_HEAP_DEVICE_LOCAL_PREFERRED_COMPRESSED
*/
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED:
/* not valid; discrete cards always enable snooping */
case IRIS_HEAP_MAX:
unreachable("invalid heap for BO");
}
} else {
regions[num_regions++] = bufmgr->sys.region;
}
bo->gem_handle = bufmgr->kmd_backend->gem_create(bufmgr, regions,
num_regions, bo_size,
bo->real.heap, flags);
if (bo->gem_handle == 0) {
free(bo);
return NULL;
}
bo->bufmgr = bufmgr;
bo->size = bo_size;
bo->idle = true;
bo->zeroed = true;
bo->real.capture = (flags & BO_ALLOC_CAPTURE) != 0;
return bo;
}
const char *
iris_heap_to_string[IRIS_HEAP_MAX] = {
[IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT] = "system-cached-coherent",
[IRIS_HEAP_SYSTEM_MEMORY_UNCACHED] = "system-uncached",
[IRIS_HEAP_SYSTEM_MEMORY_UNCACHED_COMPRESSED] = "system-uncached-compressed",
[IRIS_HEAP_DEVICE_LOCAL] = "local",
[IRIS_HEAP_DEVICE_LOCAL_COMPRESSED] = "local-compressed",
[IRIS_HEAP_DEVICE_LOCAL_PREFERRED] = "local-preferred",
[IRIS_HEAP_DEVICE_LOCAL_CPU_VISIBLE_SMALL_BAR] = "local-cpu-visible-small-bar",
};
static enum iris_mmap_mode
heap_to_mmap_mode(struct iris_bufmgr *bufmgr, enum iris_heap heap)
{
const struct intel_device_info *devinfo = &bufmgr->devinfo;
switch (heap) {
case IRIS_HEAP_DEVICE_LOCAL:
return intel_vram_all_mappable(devinfo) ? IRIS_MMAP_WC : IRIS_MMAP_NONE;
case IRIS_HEAP_DEVICE_LOCAL_CPU_VISIBLE_SMALL_BAR:
case IRIS_HEAP_DEVICE_LOCAL_PREFERRED:
return IRIS_MMAP_WC;
case IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT:
return IRIS_MMAP_WB;
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED:
return IRIS_MMAP_WC;
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED_COMPRESSED:
case IRIS_HEAP_DEVICE_LOCAL_COMPRESSED:
/* compressed bos are not mmaped */
return IRIS_MMAP_NONE;
default:
unreachable("invalid heap");
}
}
struct iris_bo *
iris_bo_alloc(struct iris_bufmgr *bufmgr,
const char *name,
uint64_t size,
uint32_t alignment,
enum iris_memory_zone memzone,
unsigned flags)
{
struct iris_bo *bo;
unsigned int page_size = getpagesize();
enum iris_heap heap = flags_to_heap(bufmgr, flags);
struct bo_cache_bucket *bucket =
bucket_for_size(bufmgr, size, heap, flags);
if (memzone != IRIS_MEMZONE_OTHER || (flags & BO_ALLOC_COHERENT))
flags |= BO_ALLOC_NO_SUBALLOC;
/* By default, capture all driver-internal buffers like shader kernels,
* surface states, dynamic states, border colors, and so on.
*/
if (memzone < IRIS_MEMZONE_OTHER || INTEL_DEBUG(DEBUG_CAPTURE_ALL))
flags |= BO_ALLOC_CAPTURE;
bo = alloc_bo_from_slabs(bufmgr, name, size, alignment, flags);
if (bo)
return bo;
/* Round the size up to the bucket size, or if we don't have caching
* at this size, a multiple of the page size.
*/
uint64_t bo_size =
bucket ? bucket->size : MAX2(align64(size, page_size), page_size);
enum iris_mmap_mode mmap_mode = heap_to_mmap_mode(bufmgr, heap);
simple_mtx_lock(&bufmgr->lock);
/* Get a buffer out of the cache if available. First, we try to find
* one with a matching memory zone so we can avoid reallocating VMA.
*/
bo = alloc_bo_from_cache(bufmgr, bucket, alignment, memzone, mmap_mode,
flags, true);
/* If that fails, we try for any cached BO, without matching memzone. */
if (!bo) {
bo = alloc_bo_from_cache(bufmgr, bucket, alignment, memzone, mmap_mode,
flags, false);
}
simple_mtx_unlock(&bufmgr->lock);
if (!bo) {
bo = alloc_fresh_bo(bufmgr, bo_size, flags);
if (!bo)
return NULL;
}
if (bo->address == 0ull) {
simple_mtx_lock(&bufmgr->lock);
bo->address = vma_alloc(bufmgr, memzone, bo->size, alignment);
simple_mtx_unlock(&bufmgr->lock);
if (bo->address == 0ull)
goto err_free;
if (!bufmgr->kmd_backend->gem_vm_bind(bo))
goto err_vm_alloc;
}
bo->name = name;
p_atomic_set(&bo->refcount, 1);
bo->real.reusable = bucket && bufmgr->bo_reuse;
bo->real.protected = flags & BO_ALLOC_PROTECTED;
bo->index = -1;
bo->real.prime_fd = -1;
assert(bo->real.map == NULL || bo->real.mmap_mode == mmap_mode);
bo->real.mmap_mode = mmap_mode;
/* On integrated GPUs, enable snooping to ensure coherency if needed.
* For discrete, we instead use SMEM and avoid WB maps for coherency.
*/
if ((flags & BO_ALLOC_COHERENT) &&
!bufmgr->devinfo.has_llc && bufmgr->devinfo.has_caching_uapi) {
if (bufmgr->kmd_backend->bo_set_caching(bo, true) != 0)
goto err_free;
}
DBG("bo_create: buf %d (%s) (%s memzone) (%s) %llub\n", bo->gem_handle,
bo->name, memzone_name(memzone), iris_heap_to_string[bo->real.heap],
(unsigned long long) size);
return bo;
err_vm_alloc:
simple_mtx_lock(&bufmgr->lock);
vma_free(bufmgr, bo->address, bo->size);
simple_mtx_unlock(&bufmgr->lock);
err_free:
simple_mtx_lock(&bufmgr->lock);
bo_free(bo);
simple_mtx_unlock(&bufmgr->lock);
return NULL;
}
static int
iris_bo_close(int fd, uint32_t gem_handle)
{
struct drm_gem_close close = {
.handle = gem_handle,
};
return intel_ioctl(fd, DRM_IOCTL_GEM_CLOSE, &close);
}
struct iris_bo *
iris_bo_create_userptr(struct iris_bufmgr *bufmgr, const char *name,
void *ptr, size_t size,
enum iris_memory_zone memzone)
{
struct iris_bo *bo;
bo = bo_calloc();
if (!bo)
return NULL;
bo->gem_handle = bufmgr->kmd_backend->gem_create_userptr(bufmgr, ptr, size);
if (bo->gem_handle == 0)
goto err_free;
bo->name = name;
bo->size = size;
bo->real.map = ptr;
bo->real.userptr = true;
bo->bufmgr = bufmgr;
if (INTEL_DEBUG(DEBUG_CAPTURE_ALL))
bo->real.capture = true;
simple_mtx_lock(&bufmgr->lock);
bo->address = vma_alloc(bufmgr, memzone, size, 1);
simple_mtx_unlock(&bufmgr->lock);
if (bo->address == 0ull)
goto err_close;
p_atomic_set(&bo->refcount, 1);
bo->index = -1;
bo->idle = true;
bo->real.heap = IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT;
bo->real.mmap_mode = heap_to_mmap_mode(bufmgr, bo->real.heap);
bo->real.prime_fd = -1;
if (!bufmgr->kmd_backend->gem_vm_bind(bo))
goto err_vma_free;
return bo;
err_vma_free:
simple_mtx_lock(&bufmgr->lock);
vma_free(bufmgr, bo->address, bo->size);
simple_mtx_unlock(&bufmgr->lock);
err_close:
bufmgr->kmd_backend->gem_close(bufmgr, bo);
err_free:
free(bo);
return NULL;
}
static bool
needs_prime_fd(struct iris_bufmgr *bufmgr)
{
return bufmgr->devinfo.kmd_type == INTEL_KMD_TYPE_XE;
}
static bool
iris_bo_set_prime_fd(struct iris_bo *bo)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
if (needs_prime_fd(bufmgr) && bo->real.prime_fd == -1) {
if (drmPrimeHandleToFD(bufmgr->fd, bo->gem_handle,
DRM_CLOEXEC | DRM_RDWR, &bo->real.prime_fd)) {
fprintf(stderr, "Failed to get prime fd for bo %s/%u\n",
bo->name, bo->gem_handle);
return false;
}
}
return true;
}
/**
* Returns a iris_bo wrapping the given buffer object handle.
*
* This can be used when one application needs to pass a buffer object
* to another.
*/
struct iris_bo *
iris_bo_gem_create_from_name(struct iris_bufmgr *bufmgr,
const char *name, unsigned int handle)
{
struct iris_bo *bo;
/* At the moment most applications only have a few named bo.
* For instance, in a DRI client only the render buffers passed
* between X and the client are named. And since X returns the
* alternating names for the front/back buffer a linear search
* provides a sufficiently fast match.
*/
simple_mtx_lock(&bufmgr->lock);
bo = find_and_ref_external_bo(bufmgr->name_table, handle);
if (bo)
goto out;
struct drm_gem_open open_arg = { .name = handle };
int ret = intel_ioctl(bufmgr->fd, DRM_IOCTL_GEM_OPEN, &open_arg);
if (ret != 0) {
DBG("Couldn't reference %s handle 0x%08x: %s\n",
name, handle, strerror(errno));
bo = NULL;
goto out;
}
/* Now see if someone has used a prime handle to get this
* object from the kernel before by looking through the list
* again for a matching gem_handle
*/
bo = find_and_ref_external_bo(bufmgr->handle_table, open_arg.handle);
if (bo)
goto out;
bo = bo_calloc();
if (!bo) {
struct iris_bo close_bo = {
.gem_handle = open_arg.handle,
};
bufmgr->kmd_backend->gem_close(bufmgr, &close_bo);
goto out;
}
p_atomic_set(&bo->refcount, 1);
bo->size = open_arg.size;
bo->bufmgr = bufmgr;
bo->gem_handle = open_arg.handle;
bo->name = name;
bo->index = -1;
bo->real.global_name = handle;
bo->real.prime_fd = -1;
bo->real.reusable = false;
bo->real.imported = true;
/* Xe KMD expects at least 1-way coherency for imports */
bo->real.heap = IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT;
bo->real.mmap_mode = IRIS_MMAP_NONE;
if (INTEL_DEBUG(DEBUG_CAPTURE_ALL))
bo->real.capture = true;
bo->address = vma_alloc(bufmgr, IRIS_MEMZONE_OTHER, bo->size, 1);
if (bo->address == 0ull)
goto err_free;
if (!iris_bo_set_prime_fd(bo))
goto err_vm_alloc;
if (!bufmgr->kmd_backend->gem_vm_bind(bo))
goto err_vm_alloc;
_mesa_hash_table_insert(bufmgr->handle_table, &bo->gem_handle, bo);
_mesa_hash_table_insert(bufmgr->name_table, &bo->real.global_name, bo);
DBG("bo_create_from_handle: %d (%s)\n", handle, bo->name);
out:
simple_mtx_unlock(&bufmgr->lock);
return bo;
err_vm_alloc:
vma_free(bufmgr, bo->address, bo->size);
err_free:
bo_free(bo);
simple_mtx_unlock(&bufmgr->lock);
return NULL;
}
static void
bo_close(struct iris_bo *bo)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
simple_mtx_assert_locked(&bufmgr->lock);
assert(iris_bo_is_real(bo));
if (iris_bo_is_external(bo)) {
struct hash_entry *entry;
if (bo->real.global_name) {
entry = _mesa_hash_table_search(bufmgr->name_table,
&bo->real.global_name);
_mesa_hash_table_remove(bufmgr->name_table, entry);
}
entry = _mesa_hash_table_search(bufmgr->handle_table, &bo->gem_handle);
_mesa_hash_table_remove(bufmgr->handle_table, entry);
list_for_each_entry_safe(struct bo_export, export, &bo->real.exports, link) {
iris_bo_close(export->drm_fd, export->gem_handle);
list_del(&export->link);
free(export);
}
} else {
assert(list_is_empty(&bo->real.exports));
}
/* Unbind and return the VMA for reuse */
if (bufmgr->kmd_backend->gem_vm_unbind(bo))
vma_free(bo->bufmgr, bo->address, bo->size);
else
DBG("Unable to unbind vm of buf %u\n", bo->gem_handle);
if (bo->real.prime_fd != -1)
close(bo->real.prime_fd);
/* Close this object */
if (bufmgr->kmd_backend->gem_close(bufmgr, bo) != 0) {
DBG("DRM_IOCTL_GEM_CLOSE %d failed (%s): %s\n",
bo->gem_handle, bo->name, strerror(errno));
}
if (bo->aux_map_address && bo->bufmgr->aux_map_ctx) {
intel_aux_map_unmap_range(bo->bufmgr->aux_map_ctx, bo->address,
bo->size);
}
for (int d = 0; d < bo->deps_size; d++) {
for (int b = 0; b < IRIS_BATCH_COUNT; b++) {
iris_syncobj_reference(bufmgr, &bo->deps[d].write_syncobjs[b], NULL);
iris_syncobj_reference(bufmgr, &bo->deps[d].read_syncobjs[b], NULL);
}
}
free(bo->deps);
free(bo);
}
static void
bo_free(struct iris_bo *bo)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
simple_mtx_assert_locked(&bufmgr->lock);
assert(iris_bo_is_real(bo));
if (!bo->real.userptr && bo->real.map)
bo_unmap(bo);
if (bo->idle || !iris_bo_busy(bo)) {
bo_close(bo);
} else {
/* Defer closing the GEM BO and returning the VMA for reuse until the
* BO is idle. Just move it to the dead list for now.
*/
list_addtail(&bo->head, &bufmgr->zombie_list);
}
}
static enum iris_heap
iris_get_heap_max(struct iris_bufmgr *bufmgr)
{
if (bufmgr->vram.size) {
return intel_vram_all_mappable(&bufmgr->devinfo) ?
IRIS_HEAP_MAX_LARGE_BAR : IRIS_HEAP_MAX;
}
return bufmgr->devinfo.ver >= 20 ? IRIS_HEAP_MAX_NO_VRAM :
IRIS_HEAP_SYSTEM_MEMORY_UNCACHED_COMPRESSED;
}
/** Frees all cached buffers significantly older than @time. */
static void
cleanup_bo_cache(struct iris_bufmgr *bufmgr, time_t time)
{
simple_mtx_assert_locked(&bufmgr->lock);
if (bufmgr->time == time)
return;
for (int h = 0; h < iris_get_heap_max(bufmgr); h++) {
struct iris_bucket_cache *cache = &bufmgr->bucket_cache[h];
for (int i = 0; i < cache->num_buckets; i++) {
struct bo_cache_bucket *bucket = &cache->bucket[i];
list_for_each_entry_safe(struct iris_bo, bo, &bucket->head, head) {
if (time - bo->real.free_time <= 1)
break;
list_del(&bo->head);
bo_free(bo);
}
}
}
list_for_each_entry_safe(struct iris_bo, bo, &bufmgr->zombie_list, head) {
/* Stop once we reach a busy BO - all others past this point were
* freed more recently so are likely also busy.
*/
if (!bo->idle && iris_bo_busy(bo))
break;
list_del(&bo->head);
bo_close(bo);
}
bufmgr->time = time;
}
static void
bo_unreference_final(struct iris_bo *bo, time_t time)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
DBG("bo_unreference final: %d (%s)\n", bo->gem_handle, bo->name);
assert(iris_bo_is_real(bo));
struct bo_cache_bucket *bucket = !bo->real.reusable ? NULL :
bucket_for_size(bufmgr, bo->size, bo->real.heap, 0);
/* Put the buffer into our internal cache for reuse if we can. */
if (bucket && iris_bo_madvise(bo, IRIS_MADVICE_DONT_NEED)) {
bo->real.free_time = time;
bo->name = NULL;
list_addtail(&bo->head, &bucket->head);
} else {
bo_free(bo);
}
}
void
iris_bo_unreference(struct iris_bo *bo)
{
if (bo == NULL)
return;
assert(p_atomic_read(&bo->refcount) > 0);
if (atomic_add_unless(&bo->refcount, -1, 1)) {
struct iris_bufmgr *bufmgr = bo->bufmgr;
struct timespec time;
clock_gettime(CLOCK_MONOTONIC, &time);
bo->zeroed = false;
if (bo->gem_handle == 0) {
pb_slab_free(get_slabs(bufmgr, bo->size), &bo->slab.entry);
} else {
simple_mtx_lock(&bufmgr->lock);
if (p_atomic_dec_zero(&bo->refcount)) {
bo_unreference_final(bo, time.tv_sec);
cleanup_bo_cache(bufmgr, time.tv_sec);
}
simple_mtx_unlock(&bufmgr->lock);
}
}
}
static void
bo_wait_with_stall_warning(struct util_debug_callback *dbg,
struct iris_bo *bo,
const char *action)
{
bool busy = dbg && !bo->idle;
double elapsed = unlikely(busy) ? -get_time() : 0.0;
iris_bo_wait_rendering(bo);
if (unlikely(busy)) {
elapsed += get_time();
if (elapsed > 1e-5) /* 0.01ms */ {
perf_debug(dbg, "%s a busy \"%s\" BO stalled and took %.03f ms.\n",
action, bo->name, elapsed * 1000);
}
}
}
static void
print_flags(unsigned flags)
{
if (flags & MAP_READ)
DBG("READ ");
if (flags & MAP_WRITE)
DBG("WRITE ");
if (flags & MAP_ASYNC)
DBG("ASYNC ");
if (flags & MAP_PERSISTENT)
DBG("PERSISTENT ");
if (flags & MAP_COHERENT)
DBG("COHERENT ");
if (flags & MAP_RAW)
DBG("RAW ");
DBG("\n");
}
void *
iris_bo_map(struct util_debug_callback *dbg,
struct iris_bo *bo, unsigned flags)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
void *map = NULL;
if (bo->gem_handle == 0) {
struct iris_bo *real = iris_get_backing_bo(bo);
uint64_t offset = bo->address - real->address;
map = iris_bo_map(dbg, real, flags | MAP_ASYNC) + offset;
} else {
assert(bo->real.mmap_mode != IRIS_MMAP_NONE);
if (bo->real.mmap_mode == IRIS_MMAP_NONE)
return NULL;
if (!bo->real.map) {
DBG("iris_bo_map: %d (%s)\n", bo->gem_handle, bo->name);
map = bufmgr->kmd_backend->gem_mmap(bufmgr, bo);
if (!map) {
return NULL;
}
VG_DEFINED(map, bo->size);
if (p_atomic_cmpxchg(&bo->real.map, NULL, map)) {
VG_NOACCESS(map, bo->size);
os_munmap(map, bo->size);
}
}
assert(bo->real.map);
map = bo->real.map;
}
DBG("iris_bo_map: %d (%s) -> %p\n",
bo->gem_handle, bo->name, bo->real.map);
print_flags(flags);
if (!(flags & MAP_ASYNC)) {
bo_wait_with_stall_warning(dbg, bo, "memory mapping");
}
return map;
}
/**
* Waits on a BO for the given amount of time.
*
* @bo: buffer object to wait for
* @timeout_ns: amount of time to wait in nanoseconds.
* If value is less than 0, an infinite wait will occur.
*
* Returns 0 if the wait was successful ie. the last batch referencing the
* object has completed within the allotted time. Otherwise some negative return
* value describes the error. Of particular interest is -ETIME when the wait has
* failed to yield the desired result.
*
* Similar to iris_bo_wait_rendering except a timeout parameter allows
* the operation to give up after a certain amount of time. Another subtle
* difference is the internal locking semantics are different (this variant does
* not hold the lock for the duration of the wait). This makes the wait subject
* to a larger userspace race window.
*
* The implementation shall wait until the object is no longer actively
* referenced within a batch buffer at the time of the call. The wait will
* not guarantee that the buffer is re-issued via another thread, or an flinked
* handle. Userspace must make sure this race does not occur if such precision
* is important.
*
* Note that some kernels have broken the infinite wait for negative values
* promise, upgrade to latest stable kernels if this is the case.
*/
static inline int
iris_bo_wait(struct iris_bo *bo, int64_t timeout_ns)
{
int ret;
switch (iris_bufmgr_get_device_info(bo->bufmgr)->kmd_type) {
case INTEL_KMD_TYPE_I915:
if (iris_bo_is_external(bo))
ret = iris_i915_bo_wait_gem(bo, timeout_ns);
else
ret = iris_bo_wait_syncobj(bo, timeout_ns);
break;
case INTEL_KMD_TYPE_XE:
ret = iris_bo_wait_syncobj(bo, timeout_ns);
break;
default:
unreachable("missing");
ret = -1;
}
bo->idle = ret == 0;
return ret;
}
/** Waits for all GPU rendering with the object to have completed. */
void
iris_bo_wait_rendering(struct iris_bo *bo)
{
/* We require a kernel recent enough for WAIT_IOCTL support.
* See intel_init_bufmgr()
*/
iris_bo_wait(bo, -1);
}
static void
iris_bufmgr_destroy_global_vm(struct iris_bufmgr *bufmgr)
{
switch (bufmgr->devinfo.kmd_type) {
case INTEL_KMD_TYPE_I915:
/* Nothing to do in i915 */
break;
case INTEL_KMD_TYPE_XE:
intel_bind_timeline_finish(&bufmgr->bind_timeline, bufmgr->fd);
iris_xe_destroy_global_vm(bufmgr);
break;
default:
unreachable("missing");
}
}
static void
iris_bufmgr_destroy(struct iris_bufmgr *bufmgr)
{
iris_bo_unreference(bufmgr->dummy_aux_bo);
iris_destroy_border_color_pool(&bufmgr->border_color_pool);
/* Free aux-map buffers */
intel_aux_map_finish(bufmgr->aux_map_ctx);
/* bufmgr will no longer try to free VMA entries in the aux-map */
bufmgr->aux_map_ctx = NULL;
for (int i = 0; i < NUM_SLAB_ALLOCATORS; i++) {
if (bufmgr->bo_slabs[i].groups)
pb_slabs_deinit(&bufmgr->bo_slabs[i]);
}
simple_mtx_lock(&bufmgr->lock);
/* Free any cached buffer objects we were going to reuse */
for (int h = 0; h < iris_get_heap_max(bufmgr); h++) {
struct iris_bucket_cache *cache = &bufmgr->bucket_cache[h];
for (int i = 0; i < cache->num_buckets; i++) {
struct bo_cache_bucket *bucket = &cache->bucket[i];
list_for_each_entry_safe(struct iris_bo, bo, &bucket->head, head) {
list_del(&bo->head);
bo_free(bo);
}
}
}
free(bufmgr->bucket_cache);
/* Close any buffer objects on the dead list. */
list_for_each_entry_safe(struct iris_bo, bo, &bufmgr->zombie_list, head) {
list_del(&bo->head);
bo_close(bo);
}
_mesa_hash_table_destroy(bufmgr->name_table, NULL);
_mesa_hash_table_destroy(bufmgr->handle_table, NULL);
for (int z = 0; z < IRIS_MEMZONE_COUNT; z++)
util_vma_heap_finish(&bufmgr->vma_allocator[z]);
iris_bufmgr_destroy_global_vm(bufmgr);
close(bufmgr->fd);
simple_mtx_unlock(&bufmgr->lock);
simple_mtx_destroy(&bufmgr->lock);
simple_mtx_destroy(&bufmgr->bo_deps_lock);
free(bufmgr);
}
int
iris_gem_get_tiling(struct iris_bo *bo, uint32_t *tiling)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
if (!bufmgr->devinfo.has_tiling_uapi) {
*tiling = 0;
return 0;
}
assert(iris_bufmgr_get_device_info(bo->bufmgr)->kmd_type == INTEL_KMD_TYPE_I915);
return iris_i915_bo_get_tiling(bo, tiling);
}
int
iris_gem_set_tiling(struct iris_bo *bo, const struct isl_surf *surf)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
/* If we can't do map_gtt, the set/get_tiling API isn't useful. And it's
* actually not supported by the kernel in those cases.
*/
if (!bufmgr->devinfo.has_tiling_uapi)
return 0;
assert(iris_bufmgr_get_device_info(bo->bufmgr)->kmd_type == INTEL_KMD_TYPE_I915);
return iris_i915_bo_set_tiling(bo, surf);
}
struct iris_bo *
iris_bo_import_dmabuf(struct iris_bufmgr *bufmgr, int prime_fd,
const uint64_t modifier)
{
uint32_t handle;
struct iris_bo *bo;
simple_mtx_lock(&bufmgr->lock);
int ret = drmPrimeFDToHandle(bufmgr->fd, prime_fd, &handle);
if (ret) {
DBG("import_dmabuf: failed to obtain handle from fd: %s\n",
strerror(errno));
simple_mtx_unlock(&bufmgr->lock);
return NULL;
}
/*
* See if the kernel has already returned this buffer to us. Just as
* for named buffers, we must not create two bo's pointing at the same
* kernel object
*/
bo = find_and_ref_external_bo(bufmgr->handle_table, handle);
if (bo)
goto out;
bo = bo_calloc();
if (!bo)
goto out;
p_atomic_set(&bo->refcount, 1);
/* Determine size of bo. The fd-to-handle ioctl really should
* return the size, but it doesn't. If we have kernel 3.12 or
* later, we can lseek on the prime fd to get the size. Older
* kernels will just fail, in which case we fall back to the
* provided (estimated or guess size). */
ret = lseek(prime_fd, 0, SEEK_END);
if (ret != -1)
bo->size = ret;
bo->bufmgr = bufmgr;
bo->name = "prime";
bo->index = -1;
bo->real.reusable = false;
bo->real.imported = true;
/* Xe KMD expects at least 1-way coherency for imports */
bo->real.heap = IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT;
bo->real.mmap_mode = IRIS_MMAP_NONE;
if (INTEL_DEBUG(DEBUG_CAPTURE_ALL))
bo->real.capture = true;
bo->gem_handle = handle;
bo->real.prime_fd = needs_prime_fd(bufmgr) ? dup(prime_fd) : -1;
uint64_t alignment = 1;
/* When an aux map will be used, there is an alignment requirement on the
* main surface from the mapping granularity. Some planes of the image may
* have smaller alignment requirements, but this one should work for all.
*/
if (bufmgr->devinfo.has_aux_map && isl_drm_modifier_has_aux(modifier))
alignment = intel_aux_map_get_alignment(bufmgr->aux_map_ctx);
bo->address = vma_alloc(bufmgr, IRIS_MEMZONE_OTHER, bo->size, alignment);
if (bo->address == 0ull)
goto err_free;
if (!bufmgr->kmd_backend->gem_vm_bind(bo))
goto err_vm_alloc;
_mesa_hash_table_insert(bufmgr->handle_table, &bo->gem_handle, bo);
out:
simple_mtx_unlock(&bufmgr->lock);
return bo;
err_vm_alloc:
vma_free(bufmgr, bo->address, bo->size);
err_free:
bo_free(bo);
simple_mtx_unlock(&bufmgr->lock);
return NULL;
}
static void
iris_bo_mark_exported_locked(struct iris_bo *bo)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
/* We cannot export suballocated BOs. */
assert(iris_bo_is_real(bo));
simple_mtx_assert_locked(&bufmgr->lock);
if (!iris_bo_is_external(bo))
_mesa_hash_table_insert(bufmgr->handle_table, &bo->gem_handle, bo);
if (!bo->real.exported) {
/* If a BO is going to be used externally, it could be sent to the
* display HW. So make sure our CPU mappings don't assume cache
* coherency since display is outside that cache.
*/
bo->real.exported = true;
bo->real.reusable = false;
}
}
void
iris_bo_mark_exported(struct iris_bo *bo)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
/* We cannot export suballocated BOs. */
assert(iris_bo_is_real(bo));
if (bo->real.exported) {
assert(!bo->real.reusable);
return;
}
simple_mtx_lock(&bufmgr->lock);
iris_bo_mark_exported_locked(bo);
simple_mtx_unlock(&bufmgr->lock);
iris_bo_set_prime_fd(bo);
}
int
iris_bo_export_dmabuf(struct iris_bo *bo, int *prime_fd)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
/* We cannot export suballocated BOs. */
assert(iris_bo_is_real(bo));
if (drmPrimeHandleToFD(bufmgr->fd, bo->gem_handle,
DRM_CLOEXEC | DRM_RDWR, prime_fd) != 0)
return -errno;
iris_bo_mark_exported(bo);
return 0;
}
static uint32_t
iris_bo_export_gem_handle(struct iris_bo *bo)
{
/* We cannot export suballocated BOs. */
assert(iris_bo_is_real(bo));
iris_bo_mark_exported(bo);
return bo->gem_handle;
}
int
iris_bo_flink(struct iris_bo *bo, uint32_t *name)
{
struct iris_bufmgr *bufmgr = bo->bufmgr;
/* We cannot export suballocated BOs. */
assert(iris_bo_is_real(bo));
if (!bo->real.global_name) {
struct drm_gem_flink flink = { .handle = bo->gem_handle };
if (intel_ioctl(bufmgr->fd, DRM_IOCTL_GEM_FLINK, &flink))
return -errno;
simple_mtx_lock(&bufmgr->lock);
if (!bo->real.global_name) {
iris_bo_mark_exported_locked(bo);
bo->real.global_name = flink.name;
_mesa_hash_table_insert(bufmgr->name_table, &bo->real.global_name, bo);
}
simple_mtx_unlock(&bufmgr->lock);
iris_bo_set_prime_fd(bo);
}
*name = bo->real.global_name;
return 0;
}
int
iris_bo_export_gem_handle_for_device(struct iris_bo *bo, int drm_fd,
uint32_t *out_handle)
{
/* We cannot export suballocated BOs. */
assert(iris_bo_is_real(bo));
/* Only add the new GEM handle to the list of export if it belongs to a
* different GEM device. Otherwise we might close the same buffer multiple
* times.
*/
struct iris_bufmgr *bufmgr = bo->bufmgr;
int ret = os_same_file_description(drm_fd, bufmgr->fd);
WARN_ONCE(ret < 0,
"Kernel has no file descriptor comparison support: %s\n",
strerror(errno));
if (ret == 0) {
*out_handle = iris_bo_export_gem_handle(bo);
return 0;
}
struct bo_export *export = calloc(1, sizeof(*export));
if (!export)
return -ENOMEM;
export->drm_fd = drm_fd;
int dmabuf_fd = -1;
int err = iris_bo_export_dmabuf(bo, &dmabuf_fd);
if (err) {
free(export);
return err;
}
simple_mtx_lock(&bufmgr->lock);
err = drmPrimeFDToHandle(drm_fd, dmabuf_fd, &export->gem_handle);
close(dmabuf_fd);
if (err) {
simple_mtx_unlock(&bufmgr->lock);
free(export);
return err;
}
bool found = false;
list_for_each_entry(struct bo_export, iter, &bo->real.exports, link) {
if (iter->drm_fd != drm_fd)
continue;
/* Here we assume that for a given DRM fd, we'll always get back the
* same GEM handle for a given buffer.
*/
assert(iter->gem_handle == export->gem_handle);
free(export);
export = iter;
found = true;
break;
}
if (!found)
list_addtail(&export->link, &bo->real.exports);
simple_mtx_unlock(&bufmgr->lock);
*out_handle = export->gem_handle;
return 0;
}
static void
add_bucket(struct iris_bufmgr *bufmgr, int size, enum iris_heap heap)
{
struct iris_bucket_cache *cache = &bufmgr->bucket_cache[heap];
unsigned int i = cache->num_buckets++;
list_inithead(&cache->bucket[i].head);
cache->bucket[i].size = size;
assert(bucket_for_size(bufmgr, size, heap, 0) == &cache->bucket[i]);
assert(bucket_for_size(bufmgr, size - 2048, heap, 0) == &cache->bucket[i]);
assert(bucket_for_size(bufmgr, size + 1, heap, 0) != &cache->bucket[i]);
}
static void
init_cache_buckets(struct iris_bufmgr *bufmgr, enum iris_heap heap)
{
uint64_t size, cache_max_size = 64 * 1024 * 1024;
/* OK, so power of two buckets was too wasteful of memory.
* Give 3 other sizes between each power of two, to hopefully
* cover things accurately enough. (The alternative is
* probably to just go for exact matching of sizes, and assume
* that for things like composited window resize the tiled
* width/height alignment and rounding of sizes to pages will
* get us useful cache hit rates anyway)
*/
add_bucket(bufmgr, PAGE_SIZE, heap);
add_bucket(bufmgr, PAGE_SIZE * 2, heap);
add_bucket(bufmgr, PAGE_SIZE * 3, heap);
/* Initialize the linked lists for BO reuse cache. */
for (size = 4 * PAGE_SIZE; size <= cache_max_size; size *= 2) {
add_bucket(bufmgr, size, heap);
add_bucket(bufmgr, size + size * 1 / 4, heap);
add_bucket(bufmgr, size + size * 2 / 4, heap);
add_bucket(bufmgr, size + size * 3 / 4, heap);
}
}
static struct intel_buffer *
intel_aux_map_buffer_alloc(void *driver_ctx, uint32_t size)
{
struct intel_buffer *buf = malloc(sizeof(struct intel_buffer));
if (!buf)
return NULL;
struct iris_bufmgr *bufmgr = (struct iris_bufmgr *)driver_ctx;
unsigned int page_size = getpagesize();
size = MAX2(ALIGN(size, page_size), page_size);
struct iris_bo *bo = alloc_fresh_bo(bufmgr, size, BO_ALLOC_CAPTURE);
if (!bo) {
free(buf);
return NULL;
}
simple_mtx_lock(&bufmgr->lock);
bo->address = vma_alloc(bufmgr, IRIS_MEMZONE_OTHER, bo->size, 64 * 1024);
if (bo->address == 0ull)
goto err_free;
if (!bufmgr->kmd_backend->gem_vm_bind(bo))
goto err_vm_alloc;
simple_mtx_unlock(&bufmgr->lock);
bo->name = "aux-map";
p_atomic_set(&bo->refcount, 1);
bo->index = -1;
bo->real.mmap_mode = heap_to_mmap_mode(bufmgr, bo->real.heap);
bo->real.prime_fd = -1;
buf->driver_bo = bo;
buf->gpu = bo->address;
buf->gpu_end = buf->gpu + bo->size;
buf->map = iris_bo_map(NULL, bo, MAP_WRITE | MAP_RAW);
return buf;
err_vm_alloc:
vma_free(bufmgr, bo->address, bo->size);
err_free:
free(buf);
bo_free(bo);
simple_mtx_unlock(&bufmgr->lock);
return NULL;
}
static void
intel_aux_map_buffer_free(void *driver_ctx, struct intel_buffer *buffer)
{
iris_bo_unreference((struct iris_bo*)buffer->driver_bo);
free(buffer);
}
static struct intel_mapped_pinned_buffer_alloc aux_map_allocator = {
.alloc = intel_aux_map_buffer_alloc,
.free = intel_aux_map_buffer_free,
};
static bool
iris_bufmgr_get_meminfo(struct iris_bufmgr *bufmgr,
struct intel_device_info *devinfo)
{
bufmgr->sys.region = &devinfo->mem.sram.mem;
bufmgr->sys.size = devinfo->mem.sram.mappable.size;
/* When the resizable bar feature is disabled,
* then vram.mappable.size is only 256MB.
* The second half of the total size is in the vram.unmappable.size
* variable.
*/
bufmgr->vram.region = &devinfo->mem.vram.mem;
bufmgr->vram.size = devinfo->mem.vram.mappable.size +
devinfo->mem.vram.unmappable.size;
return true;
}
static bool
iris_bufmgr_init_global_vm(struct iris_bufmgr *bufmgr)
{
switch (bufmgr->devinfo.kmd_type) {
case INTEL_KMD_TYPE_I915:
bufmgr->use_global_vm = iris_i915_init_global_vm(bufmgr, &bufmgr->global_vm_id);
/* i915 don't require VM, so returning true even if use_global_vm is false */
return true;
case INTEL_KMD_TYPE_XE:
if (!intel_bind_timeline_init(&bufmgr->bind_timeline, bufmgr->fd))
return false;
bufmgr->use_global_vm = iris_xe_init_global_vm(bufmgr, &bufmgr->global_vm_id);
/* Xe requires VM */
return bufmgr->use_global_vm;
default:
unreachable("missing");
return false;
}
}
/**
* Initializes the GEM buffer manager, which uses the kernel to allocate, map,
* and manage map buffer objections.
*
* \param fd File descriptor of the opened DRM device.
*/
static struct iris_bufmgr *
iris_bufmgr_create(struct intel_device_info *devinfo, int fd, bool bo_reuse)
{
if (devinfo->gtt_size <= IRIS_MEMZONE_OTHER_START)
return NULL;
struct iris_bufmgr *bufmgr = calloc(1, sizeof(*bufmgr));
if (bufmgr == NULL)
return NULL;
/* Handles to buffer objects belong to the device fd and are not
* reference counted by the kernel. If the same fd is used by
* multiple parties (threads sharing the same screen bufmgr, or
* even worse the same device fd passed to multiple libraries)
* ownership of those handles is shared by those independent parties.
*
* Don't do this! Ensure that each library/bufmgr has its own device
* fd so that its namespace does not clash with another.
*/
bufmgr->fd = os_dupfd_cloexec(fd);
if (bufmgr->fd == -1)
goto error_dup;
p_atomic_set(&bufmgr->refcount, 1);
simple_mtx_init(&bufmgr->lock, mtx_plain);
simple_mtx_init(&bufmgr->bo_deps_lock, mtx_plain);
list_inithead(&bufmgr->zombie_list);
bufmgr->devinfo = *devinfo;
devinfo = &bufmgr->devinfo;
bufmgr->bo_reuse = bo_reuse;
iris_bufmgr_get_meminfo(bufmgr, devinfo);
bufmgr->kmd_backend = iris_kmd_backend_get(devinfo->kmd_type);
intel_common_update_device_info(bufmgr->fd, devinfo);
if (!iris_bufmgr_init_global_vm(bufmgr))
goto error_init_vm;
STATIC_ASSERT(IRIS_MEMZONE_SHADER_START == 0ull);
const uint64_t _4GB = 1ull << 32;
const uint64_t _2GB = 1ul << 31;
/* The STATE_BASE_ADDRESS size field can only hold 1 page shy of 4GB */
const uint64_t _4GB_minus_1 = _4GB - PAGE_SIZE;
const struct {
uint64_t start;
uint64_t size;
} vma[IRIS_MEMZONE_COUNT] = {
[IRIS_MEMZONE_SHADER] = {
.start = PAGE_SIZE,
.size = _4GB_minus_1 - PAGE_SIZE
},
[IRIS_MEMZONE_BINDER] = {
.start = IRIS_MEMZONE_BINDER_START + IRIS_SCRATCH_ZONE_SIZE,
.size = IRIS_BINDER_ZONE_SIZE - IRIS_SCRATCH_ZONE_SIZE
},
[IRIS_MEMZONE_SCRATCH] = {
.start = IRIS_MEMZONE_SCRATCH_START,
.size = IRIS_SCRATCH_ZONE_SIZE
},
[IRIS_MEMZONE_SURFACE] = {
.start = IRIS_MEMZONE_SURFACE_START,
.size = _4GB_minus_1 - IRIS_BINDER_ZONE_SIZE - IRIS_SCRATCH_ZONE_SIZE
},
[IRIS_MEMZONE_DYNAMIC] = {
.start = IRIS_MEMZONE_DYNAMIC_START + IRIS_BORDER_COLOR_POOL_SIZE,
/* Wa_2209859288: the Tigerlake PRM's workarounds volume says:
*
* "PSDunit is dropping MSB of the blend state pointer from SD
* FIFO [...] Limit the Blend State Pointer to < 2G"
*
* We restrict the dynamic state pool to 2GB so that we don't ever
* get a BLEND_STATE pointer with the MSB set. We aren't likely to
* need the full 4GB for dynamic state anyway.
*/
.size = (devinfo->ver >= 12 ? _2GB : _4GB_minus_1)
- IRIS_BORDER_COLOR_POOL_SIZE
},
[IRIS_MEMZONE_OTHER] = {
.start = IRIS_MEMZONE_OTHER_START,
/* Leave the last 4GB out of the high vma range, so that no state
* base address + size can overflow 48 bits.
*/
.size = (devinfo->gtt_size - _4GB) - IRIS_MEMZONE_OTHER_START,
},
};
for (unsigned i = 0; i < IRIS_MEMZONE_COUNT; i++) {
util_vma_heap_init(&bufmgr->vma_allocator[i],
vma[i].start, vma[i].size);
}
if (INTEL_DEBUG(DEBUG_HEAPS)) {
for (unsigned i = 0; i < IRIS_MEMZONE_COUNT; i++) {
fprintf(stderr, "%-11s | 0x%016" PRIx64 "-0x%016" PRIx64 "\n",
memzone_name(i), vma[i].start,
vma[i].start + vma[i].size - 1);
}
}
bufmgr->bucket_cache = calloc(iris_get_heap_max(bufmgr),
sizeof(*bufmgr->bucket_cache));
if (!bufmgr->bucket_cache)
goto error_bucket_cache;
for (int h = 0; h < iris_get_heap_max(bufmgr); h++)
init_cache_buckets(bufmgr, h);
unsigned min_slab_order = 8; /* 256 bytes */
unsigned max_slab_order = 20; /* 1 MB (slab size = 2 MB) */
unsigned num_slab_orders_per_allocator =
(max_slab_order - min_slab_order) / NUM_SLAB_ALLOCATORS;
/* Divide the size order range among slab managers. */
for (unsigned i = 0; i < NUM_SLAB_ALLOCATORS; i++) {
unsigned min_order = min_slab_order;
unsigned max_order =
MIN2(min_order + num_slab_orders_per_allocator, max_slab_order);
if (!pb_slabs_init(&bufmgr->bo_slabs[i], min_order, max_order,
iris_get_heap_max(bufmgr), true, bufmgr,
iris_can_reclaim_slab,
iris_slab_alloc,
(void *) iris_slab_free)) {
goto error_slabs_init;
}
min_slab_order = max_order + 1;
}
bufmgr->name_table =
_mesa_hash_table_create(NULL, _mesa_hash_uint, _mesa_key_uint_equal);
bufmgr->handle_table =
_mesa_hash_table_create(NULL, _mesa_hash_uint, _mesa_key_uint_equal);
if (devinfo->has_aux_map) {
bufmgr->aux_map_ctx = intel_aux_map_init(bufmgr, &aux_map_allocator,
devinfo);
assert(bufmgr->aux_map_ctx);
}
iris_init_border_color_pool(bufmgr, &bufmgr->border_color_pool);
if (intel_needs_workaround(devinfo, 14019708328)) {
bufmgr->dummy_aux_bo = iris_bo_alloc(bufmgr, "dummy_aux", 4096, 4096,
IRIS_MEMZONE_OTHER, BO_ALLOC_PLAIN);
if (!bufmgr->dummy_aux_bo)
goto error_dummy_aux;
}
return bufmgr;
error_dummy_aux:
iris_destroy_border_color_pool(&bufmgr->border_color_pool);
intel_aux_map_finish(bufmgr->aux_map_ctx);
_mesa_hash_table_destroy(bufmgr->handle_table, NULL);
_mesa_hash_table_destroy(bufmgr->name_table, NULL);
error_slabs_init:
for (unsigned i = 0; i < NUM_SLAB_ALLOCATORS; i++) {
if (!bufmgr->bo_slabs[i].groups)
break;
pb_slabs_deinit(&bufmgr->bo_slabs[i]);
}
free(bufmgr->bucket_cache);
error_bucket_cache:
for (unsigned i = 0; i < IRIS_MEMZONE_COUNT; i++)
util_vma_heap_finish(&bufmgr->vma_allocator[i]);
iris_bufmgr_destroy_global_vm(bufmgr);
error_init_vm:
close(bufmgr->fd);
error_dup:
free(bufmgr);
return NULL;
}
static struct iris_bufmgr *
iris_bufmgr_ref(struct iris_bufmgr *bufmgr)
{
p_atomic_inc(&bufmgr->refcount);
return bufmgr;
}
void
iris_bufmgr_unref(struct iris_bufmgr *bufmgr)
{
simple_mtx_lock(&global_bufmgr_list_mutex);
if (p_atomic_dec_zero(&bufmgr->refcount)) {
list_del(&bufmgr->link);
iris_bufmgr_destroy(bufmgr);
}
simple_mtx_unlock(&global_bufmgr_list_mutex);
}
/** Returns a new unique id, to be used by screens. */
int
iris_bufmgr_create_screen_id(struct iris_bufmgr *bufmgr)
{
return p_atomic_inc_return(&bufmgr->next_screen_id) - 1;
}
/**
* Gets an already existing GEM buffer manager or create a new one.
*
* \param fd File descriptor of the opened DRM device.
*/
struct iris_bufmgr *
iris_bufmgr_get_for_fd(int fd, bool bo_reuse)
{
struct intel_device_info devinfo;
struct stat st;
if (fstat(fd, &st))
return NULL;
struct iris_bufmgr *bufmgr = NULL;
simple_mtx_lock(&global_bufmgr_list_mutex);
list_for_each_entry(struct iris_bufmgr, iter_bufmgr, &global_bufmgr_list, link) {
struct stat iter_st;
if (fstat(iter_bufmgr->fd, &iter_st))
continue;
if (st.st_rdev == iter_st.st_rdev) {
assert(iter_bufmgr->bo_reuse == bo_reuse);
bufmgr = iris_bufmgr_ref(iter_bufmgr);
goto unlock;
}
}
if (!intel_get_device_info_from_fd(fd, &devinfo, 8, -1))
return NULL;
if (devinfo.ver < 8 || devinfo.platform == INTEL_PLATFORM_CHV)
return NULL;
bufmgr = iris_bufmgr_create(&devinfo, fd, bo_reuse);
if (bufmgr)
list_addtail(&bufmgr->link, &global_bufmgr_list);
unlock:
simple_mtx_unlock(&global_bufmgr_list_mutex);
return bufmgr;
}
int
iris_bufmgr_get_fd(struct iris_bufmgr *bufmgr)
{
return bufmgr->fd;
}
void*
iris_bufmgr_get_aux_map_context(struct iris_bufmgr *bufmgr)
{
return bufmgr->aux_map_ctx;
}
simple_mtx_t *
iris_bufmgr_get_bo_deps_lock(struct iris_bufmgr *bufmgr)
{
return &bufmgr->bo_deps_lock;
}
struct iris_border_color_pool *
iris_bufmgr_get_border_color_pool(struct iris_bufmgr *bufmgr)
{
return &bufmgr->border_color_pool;
}
uint64_t
iris_bufmgr_vram_size(struct iris_bufmgr *bufmgr)
{
return bufmgr->vram.size;
}
uint64_t
iris_bufmgr_sram_size(struct iris_bufmgr *bufmgr)
{
return bufmgr->sys.size;
}
const struct intel_device_info *
iris_bufmgr_get_device_info(struct iris_bufmgr *bufmgr)
{
return &bufmgr->devinfo;
}
const struct iris_kmd_backend *
iris_bufmgr_get_kernel_driver_backend(struct iris_bufmgr *bufmgr)
{
return bufmgr->kmd_backend;
}
uint32_t
iris_bufmgr_get_global_vm_id(struct iris_bufmgr *bufmgr)
{
return bufmgr->global_vm_id;
}
bool
iris_bufmgr_use_global_vm_id(struct iris_bufmgr *bufmgr)
{
return bufmgr->use_global_vm;
}
bool
iris_bufmgr_compute_engine_supported(struct iris_bufmgr *bufmgr)
{
return bufmgr->devinfo.engine_class_supported_count[INTEL_ENGINE_CLASS_COMPUTE];
}
/**
* Return the pat entry based on the bo heap and allocation flags.
*/
const struct intel_device_info_pat_entry *
iris_heap_to_pat_entry(const struct intel_device_info *devinfo,
enum iris_heap heap)
{
switch (heap) {
case IRIS_HEAP_SYSTEM_MEMORY_CACHED_COHERENT:
return &devinfo->pat.cached_coherent;
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED:
return &devinfo->pat.writecombining;
case IRIS_HEAP_DEVICE_LOCAL:
case IRIS_HEAP_DEVICE_LOCAL_CPU_VISIBLE_SMALL_BAR:
case IRIS_HEAP_DEVICE_LOCAL_PREFERRED:
return &devinfo->pat.writecombining;
case IRIS_HEAP_SYSTEM_MEMORY_UNCACHED_COMPRESSED:
case IRIS_HEAP_DEVICE_LOCAL_COMPRESSED:
return &devinfo->pat.compressed;
default:
unreachable("invalid heap for platforms using PAT entries");
}
}
struct intel_bind_timeline *
iris_bufmgr_get_bind_timeline(struct iris_bufmgr *bufmgr)
{
return &bufmgr->bind_timeline;
}
uint64_t
iris_bufmgr_get_dummy_aux_address(struct iris_bufmgr *bufmgr)
{
return bufmgr->dummy_aux_bo ? bufmgr->dummy_aux_bo->address : 0;
}
Reference in a new issue View git blame Copy permalink