1 /* -*- mode: C; c-file-style: "k&r"; tab-width 4; indent-tabs-mode: t; -*- */ 2 3 /* 4 * Copyright (C) 2013 Rob Clark <robclark@freedesktop.org> 5 * 6 * Permission is hereby granted, free of charge, to any person obtaining a 7 * copy of this software and associated documentation files (the "Software"), 8 * to deal in the Software without restriction, including without limitation 9 * the rights to use, copy, modify, merge, publish, distribute, sublicense, 10 * and/or sell copies of the Software, and to permit persons to whom the 11 * Software is furnished to do so, subject to the following conditions: 12 * 13 * The above copyright notice and this permission notice (including the next 14 * paragraph) shall be included in all copies or substantial portions of the 15 * Software. 16 * 17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL 20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 23 * SOFTWARE. 24 * 25 * Authors: 26 * Rob Clark <robclark@freedesktop.org> 27 */ 28 29 #ifndef MSM_PRIV_H_ 30 #define MSM_PRIV_H_ 31 32 #include "freedreno_priv.h" 33 34 #ifndef __user 35 # define __user 36 #endif 37 38 #include "msm_drm.h" 39 40 struct msm_device { 41 struct fd_device base; 42 struct fd_bo_cache ring_cache; 43 unsigned ring_cnt; 44 }; 45 46 static inline struct msm_device * to_msm_device(struct fd_device *x) 47 { 48 return (struct msm_device *)x; 49 } 50 51 drm_private struct fd_device * msm_device_new(int fd); 52 53 struct msm_pipe { 54 struct fd_pipe base; 55 uint32_t pipe; 56 uint32_t gpu_id; 57 uint32_t gmem; 58 uint32_t chip_id; 59 uint32_t queue_id; 60 61 /* Allow for sub-allocation of stateobj ring buffers (ie. sharing 62 * the same underlying bo).. 63 * 64 * This takes advantage of each context having it's own fd_pipe, 65 * so we don't have to worry about access from multiple threads. 66 * 67 * We also rely on previous stateobj having been fully constructed 68 * so we can reclaim extra space at it's end. 69 */ 70 struct fd_ringbuffer *suballoc_ring; 71 }; 72 73 static inline struct msm_pipe * to_msm_pipe(struct fd_pipe *x) 74 { 75 return (struct msm_pipe *)x; 76 } 77 78 drm_private struct fd_pipe * msm_pipe_new(struct fd_device *dev, 79 enum fd_pipe_id id, uint32_t prio); 80 81 drm_private struct fd_ringbuffer * msm_ringbuffer_new(struct fd_pipe *pipe, 82 uint32_t size, enum fd_ringbuffer_flags flags); 83 84 struct msm_bo { 85 struct fd_bo base; 86 uint64_t offset; 87 uint64_t presumed; 88 /* to avoid excess hashtable lookups, cache the ring this bo was 89 * last emitted on (since that will probably also be the next ring 90 * it is emitted on) 91 */ 92 unsigned current_ring_seqno; 93 uint32_t idx; 94 }; 95 96 static inline struct msm_bo * to_msm_bo(struct fd_bo *x) 97 { 98 return (struct msm_bo *)x; 99 } 100 101 drm_private int msm_bo_new_handle(struct fd_device *dev, 102 uint32_t size, uint32_t flags, uint32_t *handle); 103 drm_private struct fd_bo * msm_bo_from_handle(struct fd_device *dev, 104 uint32_t size, uint32_t handle); 105 106 static inline void get_abs_timeout(struct drm_msm_timespec *tv, uint64_t ns) 107 { 108 struct timespec t; 109 uint32_t s = ns / 1000000000; 110 clock_gettime(CLOCK_MONOTONIC, &t); 111 tv->tv_sec = t.tv_sec + s; 112 tv->tv_nsec = t.tv_nsec + ns - (s * 1000000000); 113 } 114 115 /* 116 * Stupid/simple growable array implementation: 117 */ 118 119 static inline void * 120 grow(void *ptr, uint32_t nr, uint32_t *max, uint32_t sz) 121 { 122 if ((nr + 1) > *max) { 123 if ((*max * 2) < (nr + 1)) 124 *max = nr + 5; 125 else 126 *max = *max * 2; 127 ptr = realloc(ptr, *max * sz); 128 } 129 return ptr; 130 } 131 132 #define DECLARE_ARRAY(type, name) \ 133 unsigned nr_ ## name, max_ ## name; \ 134 type * name; 135 136 #define APPEND(x, name) ({ \ 137 (x)->name = grow((x)->name, (x)->nr_ ## name, &(x)->max_ ## name, sizeof((x)->name[0])); \ 138 (x)->nr_ ## name ++; \ 139 }) 140 141 #endif /* MSM_PRIV_H_ */ 142