/* * Copyright (C) 2012-2018 Rob Clark * * 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 (including the next * paragraph) 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. * * Authors: * Rob Clark */ #ifndef FREEDRENO_PRIV_H_ #define FREEDRENO_PRIV_H_ #include #include #include #include #include #include #include #include #include #include #include #include "util/hash_table.h" #include "util/list.h" #include "util/u_debug.h" #include "util/u_atomic.h" #include "util/u_math.h" #include "util/u_debug.h" #include "freedreno_drmif.h" #include "freedreno_ringbuffer.h" #define atomic_dec_and_test(x) (__sync_add_and_fetch (x, -1) == 0) struct fd_device_funcs { int (*bo_new_handle)(struct fd_device *dev, uint32_t size, uint32_t flags, uint32_t *handle); struct fd_bo * (*bo_from_handle)(struct fd_device *dev, uint32_t size, uint32_t handle); struct fd_pipe * (*pipe_new)(struct fd_device *dev, enum fd_pipe_id id, unsigned prio); void (*destroy)(struct fd_device *dev); }; struct fd_bo_bucket { uint32_t size; struct list_head list; }; struct fd_bo_cache { struct fd_bo_bucket cache_bucket[14 * 4]; int num_buckets; time_t time; }; struct fd_device { int fd; enum fd_version version; int32_t refcnt; /* tables to keep track of bo's, to avoid "evil-twin" fd_bo objects: * * handle_table: maps handle to fd_bo * name_table: maps flink name to fd_bo * * We end up needing two tables, because DRM_IOCTL_GEM_OPEN always * returns a new handle. So we need to figure out if the bo is already * open in the process first, before calling gem-open. */ struct hash_table *handle_table, *name_table; const struct fd_device_funcs *funcs; struct fd_bo_cache bo_cache; struct fd_bo_cache ring_cache; int closefd; /* call close(fd) upon destruction */ /* just for valgrind: */ int bo_size; }; void fd_bo_cache_init(struct fd_bo_cache *cache, int coarse); void fd_bo_cache_cleanup(struct fd_bo_cache *cache, time_t time); struct fd_bo * fd_bo_cache_alloc(struct fd_bo_cache *cache, uint32_t *size, uint32_t flags); int fd_bo_cache_free(struct fd_bo_cache *cache, struct fd_bo *bo); /* for where @table_lock is already held: */ void fd_device_del_locked(struct fd_device *dev); struct fd_pipe_funcs { struct fd_ringbuffer * (*ringbuffer_new_object)(struct fd_pipe *pipe, uint32_t size); struct fd_submit * (*submit_new)(struct fd_pipe *pipe); int (*get_param)(struct fd_pipe *pipe, enum fd_param_id param, uint64_t *value); int (*wait)(struct fd_pipe *pipe, uint32_t timestamp, uint64_t timeout); void (*destroy)(struct fd_pipe *pipe); }; struct fd_pipe { struct fd_device *dev; enum fd_pipe_id id; uint32_t gpu_id; int32_t refcnt; const struct fd_pipe_funcs *funcs; }; struct fd_submit_funcs { struct fd_ringbuffer * (*new_ringbuffer)(struct fd_submit *submit, uint32_t size, enum fd_ringbuffer_flags flags); int (*flush)(struct fd_submit *submit, int in_fence_fd, int *out_fence_fd, uint32_t *out_fence); void (*destroy)(struct fd_submit *submit); }; struct fd_submit { struct fd_pipe *pipe; const struct fd_submit_funcs *funcs; }; struct fd_bo_funcs { int (*offset)(struct fd_bo *bo, uint64_t *offset); int (*cpu_prep)(struct fd_bo *bo, struct fd_pipe *pipe, uint32_t op); void (*cpu_fini)(struct fd_bo *bo); int (*madvise)(struct fd_bo *bo, int willneed); uint64_t (*iova)(struct fd_bo *bo); void (*set_name)(struct fd_bo *bo, const char *fmt, va_list ap); void (*destroy)(struct fd_bo *bo); }; struct fd_bo { struct fd_device *dev; uint32_t size; uint32_t handle; uint32_t name; int32_t refcnt; uint32_t flags; /* flags like FD_RELOC_DUMP to use for relocs to this BO */ uint64_t iova; void *map; const struct fd_bo_funcs *funcs; enum { NO_CACHE = 0, BO_CACHE = 1, RING_CACHE = 2, } bo_reuse; struct list_head list; /* bucket-list entry */ time_t free_time; /* time when added to bucket-list */ }; struct fd_bo *fd_bo_new_ring(struct fd_device *dev, uint32_t size); #define enable_debug 0 /* TODO make dynamic */ bool fd_dbg(void); #define INFO_MSG(fmt, ...) \ do { if (fd_dbg()) debug_printf("[I] "fmt " (%s:%d)\n", \ ##__VA_ARGS__, __FUNCTION__, __LINE__); } while (0) #define DEBUG_MSG(fmt, ...) \ do if (enable_debug) { debug_printf("[D] "fmt " (%s:%d)\n", \ ##__VA_ARGS__, __FUNCTION__, __LINE__); } while (0) #define WARN_MSG(fmt, ...) \ do { debug_printf("[W] "fmt " (%s:%d)\n", \ ##__VA_ARGS__, __FUNCTION__, __LINE__); } while (0) #define ERROR_MSG(fmt, ...) \ do { debug_printf("[E] " fmt " (%s:%d)\n", \ ##__VA_ARGS__, __FUNCTION__, __LINE__); } while (0) #define U642VOID(x) ((void *)(unsigned long)(x)) #define VOID2U64(x) ((uint64_t)(unsigned long)(x)) #if HAVE_VALGRIND # include /* * For tracking the backing memory (if valgrind enabled, we force a mmap * for the purposes of tracking) */ static inline void VG_BO_ALLOC(struct fd_bo *bo) { if (bo && RUNNING_ON_VALGRIND) { VALGRIND_MALLOCLIKE_BLOCK(fd_bo_map(bo), bo->size, 0, 1); } } static inline void VG_BO_FREE(struct fd_bo *bo) { VALGRIND_FREELIKE_BLOCK(bo->map, 0); } /* * For tracking bo structs that are in the buffer-cache, so that valgrind * doesn't attribute ownership to the first one to allocate the recycled * bo. * * Note that the list_head in fd_bo is used to track the buffers in cache * so disable error reporting on the range while they are in cache so * valgrind doesn't squawk about list traversal. * */ static inline void VG_BO_RELEASE(struct fd_bo *bo) { if (RUNNING_ON_VALGRIND) { VALGRIND_DISABLE_ADDR_ERROR_REPORTING_IN_RANGE(bo, bo->dev->bo_size); VALGRIND_MAKE_MEM_NOACCESS(bo, bo->dev->bo_size); VALGRIND_FREELIKE_BLOCK(bo->map, 0); } } static inline void VG_BO_OBTAIN(struct fd_bo *bo) { if (RUNNING_ON_VALGRIND) { VALGRIND_MAKE_MEM_DEFINED(bo, bo->dev->bo_size); VALGRIND_ENABLE_ADDR_ERROR_REPORTING_IN_RANGE(bo, bo->dev->bo_size); VALGRIND_MALLOCLIKE_BLOCK(bo->map, bo->size, 0, 1); } } #else static inline void VG_BO_ALLOC(struct fd_bo *bo) {} static inline void VG_BO_FREE(struct fd_bo *bo) {} static inline void VG_BO_RELEASE(struct fd_bo *bo) {} static inline void VG_BO_OBTAIN(struct fd_bo *bo) {} #endif #define FD_DEFINE_CAST(parent, child) \ static inline struct child * to_ ## child (struct parent *x) \ { return (struct child *)x; } #endif /* FREEDRENO_PRIV_H_ */