/**************************************************************************
*
* Copyright 2018-2019 Alyssa Rosenzweig
* Copyright 2018-2019 Collabora, Ltd.
* Copyright © 2015 Intel Corporation
* All Rights Reserved.
*
* 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, sub license, 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 NON-INFRINGEMENT.
* IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS 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.
*
**************************************************************************/
#ifndef PAN_DEVICE_H
#define PAN_DEVICE_H
#include <xf86drm.h>
#include "renderonly/renderonly.h"
#include "util/u_dynarray.h"
#include "util/bitset.h"
#include "util/list.h"
#include "util/sparse_array.h"
#include "panfrost/util/pan_ir.h"
#include "pan_pool.h"
#include "pan_util.h"
#include <genxml/gen_macros.h>
#if defined(__cplusplus)
extern "C" {
#endif
/* Driver limits */
#define PAN_MAX_CONST_BUFFERS 16
/* How many power-of-two levels in the BO cache do we want? 2^12
* minimum chosen as it is the page size that all allocations are
* rounded to */
#define MIN_BO_CACHE_BUCKET (12) /* 2^12 = 4KB */
#define MAX_BO_CACHE_BUCKET (22) /* 2^22 = 4MB */
/* Fencepost problem, hence the off-by-one */
#define NR_BO_CACHE_BUCKETS (MAX_BO_CACHE_BUCKET - MIN_BO_CACHE_BUCKET + 1)
struct pan_blitter {
struct {
struct pan_pool *pool;
struct hash_table *blit;
struct hash_table *blend;
pthread_mutex_t lock;
} shaders;
struct {
struct pan_pool *pool;
struct hash_table *rsds;
pthread_mutex_t lock;
} rsds;
};
struct pan_blend_shaders {
struct hash_table *shaders;
pthread_mutex_t lock;
};
enum pan_indirect_draw_flags {
PAN_INDIRECT_DRAW_NO_INDEX = 0 << 0,
PAN_INDIRECT_DRAW_1B_INDEX = 1 << 0,
PAN_INDIRECT_DRAW_2B_INDEX = 2 << 0,
PAN_INDIRECT_DRAW_4B_INDEX = 3 << 0,
PAN_INDIRECT_DRAW_INDEX_SIZE_MASK = 3 << 0,
PAN_INDIRECT_DRAW_HAS_PSIZ = 1 << 2,
PAN_INDIRECT_DRAW_PRIMITIVE_RESTART = 1 << 3,
PAN_INDIRECT_DRAW_UPDATE_PRIM_SIZE = 1 << 4,
PAN_INDIRECT_DRAW_LAST_FLAG = PAN_INDIRECT_DRAW_UPDATE_PRIM_SIZE,
PAN_INDIRECT_DRAW_FLAGS_MASK = (PAN_INDIRECT_DRAW_LAST_FLAG << 1) - 1,
PAN_INDIRECT_DRAW_MIN_MAX_SEARCH_1B_INDEX = PAN_INDIRECT_DRAW_LAST_FLAG << 1,
PAN_INDIRECT_DRAW_MIN_MAX_SEARCH_2B_INDEX,
PAN_INDIRECT_DRAW_MIN_MAX_SEARCH_4B_INDEX,
PAN_INDIRECT_DRAW_MIN_MAX_SEARCH_1B_INDEX_PRIM_RESTART,
PAN_INDIRECT_DRAW_MIN_MAX_SEARCH_2B_INDEX_PRIM_RESTART,
PAN_INDIRECT_DRAW_MIN_MAX_SEARCH_3B_INDEX_PRIM_RESTART,
PAN_INDIRECT_DRAW_NUM_SHADERS,
};
struct pan_indirect_draw_shader {
struct panfrost_ubo_push push;
mali_ptr rsd;
};
struct pan_indirect_draw_shaders {
struct pan_indirect_draw_shader shaders[PAN_INDIRECT_DRAW_NUM_SHADERS];
/* Take the lock when initializing the draw shaders context or when
* allocating from the binary pool.
*/
pthread_mutex_t lock;
/* A memory pool for shader binaries. We currently don't allocate a
* single BO for all shaders up-front because estimating shader size
* is not trivial, and changes to the compiler might influence this
* estimation.
*/
struct pan_pool *bin_pool;
/* BO containing all renderer states attached to the compute shaders.
* Those are built at shader compilation time and re-used every time
* panfrost_emit_indirect_draw() is called.
*/
struct panfrost_bo *states;
/* Varying memory is allocated dynamically by compute jobs from this
* heap.
*/
struct panfrost_bo *varying_heap;
};
struct pan_indirect_dispatch {
struct panfrost_ubo_push push;
struct panfrost_bo *bin;
struct panfrost_bo *descs;
};
/** Implementation-defined tiler features */
struct panfrost_tiler_features {
/** Number of bytes per tiler bin */
unsigned bin_size;
/** Maximum number of levels that may be simultaneously enabled.
* Invariant: bitcount(hierarchy_mask) <= max_levels */
unsigned max_levels;
};
struct panfrost_device {
/* For ralloc */
void *memctx;
int fd;
/* Properties of the GPU in use */
unsigned arch;
unsigned gpu_id;
unsigned core_count;
unsigned thread_tls_alloc;
struct panfrost_tiler_features tiler_features;
unsigned quirks;
bool has_afbc;
/* Table of formats, indexed by a PIPE format */
const struct panfrost_format *formats;
/* Bitmask of supported compressed texture formats */
uint32_t compressed_formats;
/* debug flags, see pan_util.h how to interpret */
unsigned debug;
drmVersionPtr kernel_version;
struct renderonly *ro;
pthread_mutex_t bo_map_lock;
struct util_sparse_array bo_map;
struct {
pthread_mutex_t lock;
/* List containing all cached BOs sorted in LRU (Least
* Recently Used) order. This allows us to quickly evict BOs
* that are more than 1 second old.
*/
struct list_head lru;
/* The BO cache is a set of buckets with power-of-two sizes
* ranging from 2^12 (4096, the page size) to
* 2^(12 + MAX_BO_CACHE_BUCKETS).
* Each bucket is a linked list of free panfrost_bo objects. */
struct list_head buckets[NR_BO_CACHE_BUCKETS];
} bo_cache;
struct pan_blitter blitter;
struct pan_blend_shaders blend_shaders;
struct pan_indirect_draw_shaders indirect_draw_shaders;
struct pan_indirect_dispatch indirect_dispatch;
/* Tiler heap shared across all tiler jobs, allocated against the
* device since there's only a single tiler. Since this is invisible to
* the CPU, it's okay for multiple contexts to reference it
* simultaneously; by keeping on the device struct, we eliminate a
* costly per-context allocation. */
struct panfrost_bo *tiler_heap;
/* The tiler heap is shared by all contexts, and is written by tiler
* jobs and read by fragment job. We need to ensure that a
* vertex/tiler job chain from one context is not inserted between
* the vertex/tiler and fragment job of another context, otherwise
* we end up with tiler heap corruption.
*/
pthread_mutex_t submit_lock;
/* Sample positions are preloaded into a write-once constant buffer,
* such that they can be referenced fore free later. Needed
* unconditionally on Bifrost, and useful for sharing with Midgard */
struct panfrost_bo *sample_positions;
};
void
panfrost_open_device(void *memctx, int fd, struct panfrost_device *dev);
void
panfrost_close_device(struct panfrost_device *dev);
bool
panfrost_supports_compressed_format(struct panfrost_device *dev, unsigned fmt);
void
panfrost_upload_sample_positions(struct panfrost_device *dev);
mali_ptr
panfrost_sample_positions(const struct panfrost_device *dev,
enum mali_sample_pattern pattern);
void
panfrost_query_sample_position(
enum mali_sample_pattern pattern,
unsigned sample_idx,
float *out);
static inline struct panfrost_bo *
pan_lookup_bo(struct panfrost_device *dev, uint32_t gem_handle)
{
return (struct panfrost_bo *)util_sparse_array_get(&dev->bo_map, gem_handle);
}
static inline bool
pan_is_bifrost(const struct panfrost_device *dev)
{
return dev->arch >= 6 && dev->arch <= 7;
}
#if defined(__cplusplus)
} // extern "C"
#endif
#endif