UAPI: (Scripted) Convert #include "..." to #include <path/...> in drivers/gpu/
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / drivers / gpu / drm / radeon / radeon_mem.c
CommitLineData
94bb598e
DA
1/* radeon_mem.c -- Simple GART/fb memory manager for radeon -*- linux-c -*- */
2/*
1da177e4 3 * Copyright (C) The Weather Channel, Inc. 2002. All Rights Reserved.
b5e89ed5 4 *
1da177e4
LT
5 * The Weather Channel (TM) funded Tungsten Graphics to develop the
6 * initial release of the Radeon 8500 driver under the XFree86 license.
7 * This notice must be preserved.
8 *
9 * Permission is hereby granted, free of charge, to any person obtaining a
10 * copy of this software and associated documentation files (the "Software"),
11 * to deal in the Software without restriction, including without limitation
12 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
13 * and/or sell copies of the Software, and to permit persons to whom the
14 * Software is furnished to do so, subject to the following conditions:
15 *
16 * The above copyright notice and this permission notice (including the next
17 * paragraph) shall be included in all copies or substantial portions of the
18 * Software.
19 *
20 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
21 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
22 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
23 * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
24 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
25 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
26 * DEALINGS IN THE SOFTWARE.
27 *
28 * Authors:
29 * Keith Whitwell <keith@tungstengraphics.com>
30 */
31
760285e7
DH
32#include <drm/drmP.h>
33#include <drm/radeon_drm.h>
1da177e4
LT
34#include "radeon_drv.h"
35
36/* Very simple allocator for GART memory, working on a static range
b5e89ed5 37 * already mapped into each client's address space.
1da177e4
LT
38 */
39
40static struct mem_block *split_block(struct mem_block *p, int start, int size,
6c340eac 41 struct drm_file *file_priv)
1da177e4
LT
42{
43 /* Maybe cut off the start of an existing block */
44 if (start > p->start) {
9a298b2a
EA
45 struct mem_block *newblock = kmalloc(sizeof(*newblock),
46 GFP_KERNEL);
b5e89ed5 47 if (!newblock)
1da177e4
LT
48 goto out;
49 newblock->start = start;
50 newblock->size = p->size - (start - p->start);
6c340eac 51 newblock->file_priv = NULL;
1da177e4
LT
52 newblock->next = p->next;
53 newblock->prev = p;
54 p->next->prev = newblock;
55 p->next = newblock;
56 p->size -= newblock->size;
57 p = newblock;
58 }
b5e89ed5 59
1da177e4
LT
60 /* Maybe cut off the end of an existing block */
61 if (size < p->size) {
9a298b2a
EA
62 struct mem_block *newblock = kmalloc(sizeof(*newblock),
63 GFP_KERNEL);
1da177e4
LT
64 if (!newblock)
65 goto out;
66 newblock->start = start + size;
67 newblock->size = p->size - size;
6c340eac 68 newblock->file_priv = NULL;
1da177e4
LT
69 newblock->next = p->next;
70 newblock->prev = p;
71 p->next->prev = newblock;
72 p->next = newblock;
73 p->size = size;
74 }
75
b5e89ed5 76 out:
1da177e4 77 /* Our block is in the middle */
6c340eac 78 p->file_priv = file_priv;
1da177e4
LT
79 return p;
80}
81
b5e89ed5 82static struct mem_block *alloc_block(struct mem_block *heap, int size,
6c340eac 83 int align2, struct drm_file *file_priv)
1da177e4
LT
84{
85 struct mem_block *p;
b5e89ed5 86 int mask = (1 << align2) - 1;
1da177e4
LT
87
88 list_for_each(p, heap) {
89 int start = (p->start + mask) & ~mask;
2b46278b 90 if (p->file_priv == NULL && start + size <= p->start + p->size)
6c340eac 91 return split_block(p, start, size, file_priv);
1da177e4
LT
92 }
93
94 return NULL;
95}
96
b5e89ed5 97static struct mem_block *find_block(struct mem_block *heap, int start)
1da177e4
LT
98{
99 struct mem_block *p;
100
101 list_for_each(p, heap)
b5e89ed5
DA
102 if (p->start == start)
103 return p;
1da177e4
LT
104
105 return NULL;
106}
107
b5e89ed5 108static void free_block(struct mem_block *p)
1da177e4 109{
6c340eac 110 p->file_priv = NULL;
1da177e4 111
6c340eac 112 /* Assumes a single contiguous range. Needs a special file_priv in
1da177e4
LT
113 * 'heap' to stop it being subsumed.
114 */
2b46278b 115 if (p->next->file_priv == NULL) {
1da177e4
LT
116 struct mem_block *q = p->next;
117 p->size += q->size;
118 p->next = q->next;
119 p->next->prev = p;
9a298b2a 120 kfree(q);
1da177e4
LT
121 }
122
2b46278b 123 if (p->prev->file_priv == NULL) {
1da177e4
LT
124 struct mem_block *q = p->prev;
125 q->size += p->size;
126 q->next = p->next;
127 q->next->prev = q;
9a298b2a 128 kfree(p);
1da177e4
LT
129 }
130}
131
132/* Initialize. How to check for an uninitialized heap?
133 */
134static int init_heap(struct mem_block **heap, int start, int size)
135{
9a298b2a 136 struct mem_block *blocks = kmalloc(sizeof(*blocks), GFP_KERNEL);
1da177e4 137
b5e89ed5 138 if (!blocks)
20caafa6 139 return -ENOMEM;
b5e89ed5 140
f35119d6 141 *heap = kzalloc(sizeof(**heap), GFP_KERNEL);
1da177e4 142 if (!*heap) {
9a298b2a 143 kfree(blocks);
20caafa6 144 return -ENOMEM;
1da177e4
LT
145 }
146
147 blocks->start = start;
148 blocks->size = size;
6c340eac 149 blocks->file_priv = NULL;
1da177e4
LT
150 blocks->next = blocks->prev = *heap;
151
6c340eac 152 (*heap)->file_priv = (struct drm_file *) - 1;
1da177e4
LT
153 (*heap)->next = (*heap)->prev = blocks;
154 return 0;
155}
156
1da177e4
LT
157/* Free all blocks associated with the releasing file.
158 */
6c340eac 159void radeon_mem_release(struct drm_file *file_priv, struct mem_block *heap)
1da177e4
LT
160{
161 struct mem_block *p;
162
163 if (!heap || !heap->next)
164 return;
165
166 list_for_each(p, heap) {
6c340eac
EA
167 if (p->file_priv == file_priv)
168 p->file_priv = NULL;
1da177e4
LT
169 }
170
6c340eac 171 /* Assumes a single contiguous range. Needs a special file_priv in
1da177e4
LT
172 * 'heap' to stop it being subsumed.
173 */
174 list_for_each(p, heap) {
2b46278b 175 while (p->file_priv == NULL && p->next->file_priv == NULL) {
1da177e4
LT
176 struct mem_block *q = p->next;
177 p->size += q->size;
178 p->next = q->next;
179 p->next->prev = p;
9a298b2a 180 kfree(q);
1da177e4
LT
181 }
182 }
183}
184
185/* Shutdown.
186 */
b5e89ed5 187void radeon_mem_takedown(struct mem_block **heap)
1da177e4
LT
188{
189 struct mem_block *p;
b5e89ed5 190
1da177e4
LT
191 if (!*heap)
192 return;
193
b5e89ed5 194 for (p = (*heap)->next; p != *heap;) {
1da177e4
LT
195 struct mem_block *q = p;
196 p = p->next;
9a298b2a 197 kfree(q);
1da177e4
LT
198 }
199
9a298b2a 200 kfree(*heap);
1da177e4
LT
201 *heap = NULL;
202}
203
1da177e4
LT
204/* IOCTL HANDLERS */
205
b5e89ed5 206static struct mem_block **get_heap(drm_radeon_private_t * dev_priv, int region)
1da177e4 207{
b5e89ed5 208 switch (region) {
1da177e4 209 case RADEON_MEM_REGION_GART:
b5e89ed5 210 return &dev_priv->gart_heap;
1da177e4
LT
211 case RADEON_MEM_REGION_FB:
212 return &dev_priv->fb_heap;
213 default:
214 return NULL;
215 }
216}
217
c153f45f 218int radeon_mem_alloc(struct drm_device *dev, void *data, struct drm_file *file_priv)
1da177e4 219{
1da177e4 220 drm_radeon_private_t *dev_priv = dev->dev_private;
c153f45f 221 drm_radeon_mem_alloc_t *alloc = data;
1da177e4
LT
222 struct mem_block *block, **heap;
223
b5e89ed5 224 if (!dev_priv) {
3e684eae 225 DRM_ERROR("called with no initialization\n");
20caafa6 226 return -EINVAL;
1da177e4
LT
227 }
228
c153f45f 229 heap = get_heap(dev_priv, alloc->region);
1da177e4 230 if (!heap || !*heap)
20caafa6 231 return -EFAULT;
b5e89ed5 232
1da177e4
LT
233 /* Make things easier on ourselves: all allocations at least
234 * 4k aligned.
235 */
c153f45f
EA
236 if (alloc->alignment < 12)
237 alloc->alignment = 12;
1da177e4 238
c153f45f 239 block = alloc_block(*heap, alloc->size, alloc->alignment, file_priv);
1da177e4 240
b5e89ed5 241 if (!block)
20caafa6 242 return -ENOMEM;
1da177e4 243
c153f45f
EA
244 if (DRM_COPY_TO_USER(alloc->region_offset, &block->start,
245 sizeof(int))) {
b5e89ed5 246 DRM_ERROR("copy_to_user\n");
20caafa6 247 return -EFAULT;
1da177e4 248 }
b5e89ed5 249
1da177e4
LT
250 return 0;
251}
252
c153f45f 253int radeon_mem_free(struct drm_device *dev, void *data, struct drm_file *file_priv)
1da177e4 254{
1da177e4 255 drm_radeon_private_t *dev_priv = dev->dev_private;
c153f45f 256 drm_radeon_mem_free_t *memfree = data;
1da177e4
LT
257 struct mem_block *block, **heap;
258
b5e89ed5 259 if (!dev_priv) {
3e684eae 260 DRM_ERROR("called with no initialization\n");
20caafa6 261 return -EINVAL;
1da177e4
LT
262 }
263
c153f45f 264 heap = get_heap(dev_priv, memfree->region);
1da177e4 265 if (!heap || !*heap)
20caafa6 266 return -EFAULT;
b5e89ed5 267
c153f45f 268 block = find_block(*heap, memfree->region_offset);
1da177e4 269 if (!block)
20caafa6 270 return -EFAULT;
1da177e4 271
6c340eac 272 if (block->file_priv != file_priv)
20caafa6 273 return -EPERM;
1da177e4 274
b5e89ed5 275 free_block(block);
1da177e4
LT
276 return 0;
277}
278
c153f45f 279int radeon_mem_init_heap(struct drm_device *dev, void *data, struct drm_file *file_priv)
1da177e4 280{
1da177e4 281 drm_radeon_private_t *dev_priv = dev->dev_private;
c153f45f 282 drm_radeon_mem_init_heap_t *initheap = data;
1da177e4
LT
283 struct mem_block **heap;
284
b5e89ed5 285 if (!dev_priv) {
3e684eae 286 DRM_ERROR("called with no initialization\n");
20caafa6 287 return -EINVAL;
1da177e4
LT
288 }
289
c153f45f 290 heap = get_heap(dev_priv, initheap->region);
b5e89ed5 291 if (!heap)
20caafa6 292 return -EFAULT;
b5e89ed5 293
1da177e4
LT
294 if (*heap) {
295 DRM_ERROR("heap already initialized?");
20caafa6 296 return -EFAULT;
1da177e4 297 }
1da177e4 298
c153f45f 299 return init_heap(heap, initheap->start, initheap->size);
b5e89ed5 300}