Commit | Line | Data |
---|---|---|
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> | |
14adc892 CK |
30 | * |
31 | * ------------------------ This file is DEPRECATED! ------------------------- | |
1da177e4 LT |
32 | */ |
33 | ||
760285e7 DH |
34 | #include <drm/drmP.h> |
35 | #include <drm/radeon_drm.h> | |
1da177e4 LT |
36 | #include "radeon_drv.h" |
37 | ||
38 | /* Very simple allocator for GART memory, working on a static range | |
b5e89ed5 | 39 | * already mapped into each client's address space. |
1da177e4 LT |
40 | */ |
41 | ||
42 | static struct mem_block *split_block(struct mem_block *p, int start, int size, | |
6c340eac | 43 | struct drm_file *file_priv) |
1da177e4 LT |
44 | { |
45 | /* Maybe cut off the start of an existing block */ | |
46 | if (start > p->start) { | |
9a298b2a EA |
47 | struct mem_block *newblock = kmalloc(sizeof(*newblock), |
48 | GFP_KERNEL); | |
b5e89ed5 | 49 | if (!newblock) |
1da177e4 LT |
50 | goto out; |
51 | newblock->start = start; | |
52 | newblock->size = p->size - (start - p->start); | |
6c340eac | 53 | newblock->file_priv = NULL; |
1da177e4 LT |
54 | newblock->next = p->next; |
55 | newblock->prev = p; | |
56 | p->next->prev = newblock; | |
57 | p->next = newblock; | |
58 | p->size -= newblock->size; | |
59 | p = newblock; | |
60 | } | |
b5e89ed5 | 61 | |
1da177e4 LT |
62 | /* Maybe cut off the end of an existing block */ |
63 | if (size < p->size) { | |
9a298b2a EA |
64 | struct mem_block *newblock = kmalloc(sizeof(*newblock), |
65 | GFP_KERNEL); | |
1da177e4 LT |
66 | if (!newblock) |
67 | goto out; | |
68 | newblock->start = start + size; | |
69 | newblock->size = p->size - size; | |
6c340eac | 70 | newblock->file_priv = NULL; |
1da177e4 LT |
71 | newblock->next = p->next; |
72 | newblock->prev = p; | |
73 | p->next->prev = newblock; | |
74 | p->next = newblock; | |
75 | p->size = size; | |
76 | } | |
77 | ||
b5e89ed5 | 78 | out: |
1da177e4 | 79 | /* Our block is in the middle */ |
6c340eac | 80 | p->file_priv = file_priv; |
1da177e4 LT |
81 | return p; |
82 | } | |
83 | ||
b5e89ed5 | 84 | static struct mem_block *alloc_block(struct mem_block *heap, int size, |
6c340eac | 85 | int align2, struct drm_file *file_priv) |
1da177e4 LT |
86 | { |
87 | struct mem_block *p; | |
b5e89ed5 | 88 | int mask = (1 << align2) - 1; |
1da177e4 LT |
89 | |
90 | list_for_each(p, heap) { | |
91 | int start = (p->start + mask) & ~mask; | |
2b46278b | 92 | if (p->file_priv == NULL && start + size <= p->start + p->size) |
6c340eac | 93 | return split_block(p, start, size, file_priv); |
1da177e4 LT |
94 | } |
95 | ||
96 | return NULL; | |
97 | } | |
98 | ||
b5e89ed5 | 99 | static struct mem_block *find_block(struct mem_block *heap, int start) |
1da177e4 LT |
100 | { |
101 | struct mem_block *p; | |
102 | ||
103 | list_for_each(p, heap) | |
b5e89ed5 DA |
104 | if (p->start == start) |
105 | return p; | |
1da177e4 LT |
106 | |
107 | return NULL; | |
108 | } | |
109 | ||
b5e89ed5 | 110 | static void free_block(struct mem_block *p) |
1da177e4 | 111 | { |
6c340eac | 112 | p->file_priv = NULL; |
1da177e4 | 113 | |
6c340eac | 114 | /* Assumes a single contiguous range. Needs a special file_priv in |
1da177e4 LT |
115 | * 'heap' to stop it being subsumed. |
116 | */ | |
2b46278b | 117 | if (p->next->file_priv == NULL) { |
1da177e4 LT |
118 | struct mem_block *q = p->next; |
119 | p->size += q->size; | |
120 | p->next = q->next; | |
121 | p->next->prev = p; | |
9a298b2a | 122 | kfree(q); |
1da177e4 LT |
123 | } |
124 | ||
2b46278b | 125 | if (p->prev->file_priv == NULL) { |
1da177e4 LT |
126 | struct mem_block *q = p->prev; |
127 | q->size += p->size; | |
128 | q->next = p->next; | |
129 | q->next->prev = q; | |
9a298b2a | 130 | kfree(p); |
1da177e4 LT |
131 | } |
132 | } | |
133 | ||
134 | /* Initialize. How to check for an uninitialized heap? | |
135 | */ | |
136 | static int init_heap(struct mem_block **heap, int start, int size) | |
137 | { | |
9a298b2a | 138 | struct mem_block *blocks = kmalloc(sizeof(*blocks), GFP_KERNEL); |
1da177e4 | 139 | |
b5e89ed5 | 140 | if (!blocks) |
20caafa6 | 141 | return -ENOMEM; |
b5e89ed5 | 142 | |
f35119d6 | 143 | *heap = kzalloc(sizeof(**heap), GFP_KERNEL); |
1da177e4 | 144 | if (!*heap) { |
9a298b2a | 145 | kfree(blocks); |
20caafa6 | 146 | return -ENOMEM; |
1da177e4 LT |
147 | } |
148 | ||
149 | blocks->start = start; | |
150 | blocks->size = size; | |
6c340eac | 151 | blocks->file_priv = NULL; |
1da177e4 LT |
152 | blocks->next = blocks->prev = *heap; |
153 | ||
6c340eac | 154 | (*heap)->file_priv = (struct drm_file *) - 1; |
1da177e4 LT |
155 | (*heap)->next = (*heap)->prev = blocks; |
156 | return 0; | |
157 | } | |
158 | ||
1da177e4 LT |
159 | /* Free all blocks associated with the releasing file. |
160 | */ | |
6c340eac | 161 | void radeon_mem_release(struct drm_file *file_priv, struct mem_block *heap) |
1da177e4 LT |
162 | { |
163 | struct mem_block *p; | |
164 | ||
165 | if (!heap || !heap->next) | |
166 | return; | |
167 | ||
168 | list_for_each(p, heap) { | |
6c340eac EA |
169 | if (p->file_priv == file_priv) |
170 | p->file_priv = NULL; | |
1da177e4 LT |
171 | } |
172 | ||
6c340eac | 173 | /* Assumes a single contiguous range. Needs a special file_priv in |
1da177e4 LT |
174 | * 'heap' to stop it being subsumed. |
175 | */ | |
176 | list_for_each(p, heap) { | |
2b46278b | 177 | while (p->file_priv == NULL && p->next->file_priv == NULL) { |
1da177e4 LT |
178 | struct mem_block *q = p->next; |
179 | p->size += q->size; | |
180 | p->next = q->next; | |
181 | p->next->prev = p; | |
9a298b2a | 182 | kfree(q); |
1da177e4 LT |
183 | } |
184 | } | |
185 | } | |
186 | ||
187 | /* Shutdown. | |
188 | */ | |
b5e89ed5 | 189 | void radeon_mem_takedown(struct mem_block **heap) |
1da177e4 LT |
190 | { |
191 | struct mem_block *p; | |
b5e89ed5 | 192 | |
1da177e4 LT |
193 | if (!*heap) |
194 | return; | |
195 | ||
b5e89ed5 | 196 | for (p = (*heap)->next; p != *heap;) { |
1da177e4 LT |
197 | struct mem_block *q = p; |
198 | p = p->next; | |
9a298b2a | 199 | kfree(q); |
1da177e4 LT |
200 | } |
201 | ||
9a298b2a | 202 | kfree(*heap); |
1da177e4 LT |
203 | *heap = NULL; |
204 | } | |
205 | ||
1da177e4 LT |
206 | /* IOCTL HANDLERS */ |
207 | ||
b5e89ed5 | 208 | static struct mem_block **get_heap(drm_radeon_private_t * dev_priv, int region) |
1da177e4 | 209 | { |
b5e89ed5 | 210 | switch (region) { |
1da177e4 | 211 | case RADEON_MEM_REGION_GART: |
b5e89ed5 | 212 | return &dev_priv->gart_heap; |
1da177e4 LT |
213 | case RADEON_MEM_REGION_FB: |
214 | return &dev_priv->fb_heap; | |
215 | default: | |
216 | return NULL; | |
217 | } | |
218 | } | |
219 | ||
c153f45f | 220 | int radeon_mem_alloc(struct drm_device *dev, void *data, struct drm_file *file_priv) |
1da177e4 | 221 | { |
1da177e4 | 222 | drm_radeon_private_t *dev_priv = dev->dev_private; |
c153f45f | 223 | drm_radeon_mem_alloc_t *alloc = data; |
1da177e4 LT |
224 | struct mem_block *block, **heap; |
225 | ||
b5e89ed5 | 226 | if (!dev_priv) { |
3e684eae | 227 | DRM_ERROR("called with no initialization\n"); |
20caafa6 | 228 | return -EINVAL; |
1da177e4 LT |
229 | } |
230 | ||
c153f45f | 231 | heap = get_heap(dev_priv, alloc->region); |
1da177e4 | 232 | if (!heap || !*heap) |
20caafa6 | 233 | return -EFAULT; |
b5e89ed5 | 234 | |
1da177e4 LT |
235 | /* Make things easier on ourselves: all allocations at least |
236 | * 4k aligned. | |
237 | */ | |
c153f45f EA |
238 | if (alloc->alignment < 12) |
239 | alloc->alignment = 12; | |
1da177e4 | 240 | |
c153f45f | 241 | block = alloc_block(*heap, alloc->size, alloc->alignment, file_priv); |
1da177e4 | 242 | |
b5e89ed5 | 243 | if (!block) |
20caafa6 | 244 | return -ENOMEM; |
1da177e4 | 245 | |
c153f45f EA |
246 | if (DRM_COPY_TO_USER(alloc->region_offset, &block->start, |
247 | sizeof(int))) { | |
b5e89ed5 | 248 | DRM_ERROR("copy_to_user\n"); |
20caafa6 | 249 | return -EFAULT; |
1da177e4 | 250 | } |
b5e89ed5 | 251 | |
1da177e4 LT |
252 | return 0; |
253 | } | |
254 | ||
c153f45f | 255 | int radeon_mem_free(struct drm_device *dev, void *data, struct drm_file *file_priv) |
1da177e4 | 256 | { |
1da177e4 | 257 | drm_radeon_private_t *dev_priv = dev->dev_private; |
c153f45f | 258 | drm_radeon_mem_free_t *memfree = data; |
1da177e4 LT |
259 | struct mem_block *block, **heap; |
260 | ||
b5e89ed5 | 261 | if (!dev_priv) { |
3e684eae | 262 | DRM_ERROR("called with no initialization\n"); |
20caafa6 | 263 | return -EINVAL; |
1da177e4 LT |
264 | } |
265 | ||
c153f45f | 266 | heap = get_heap(dev_priv, memfree->region); |
1da177e4 | 267 | if (!heap || !*heap) |
20caafa6 | 268 | return -EFAULT; |
b5e89ed5 | 269 | |
c153f45f | 270 | block = find_block(*heap, memfree->region_offset); |
1da177e4 | 271 | if (!block) |
20caafa6 | 272 | return -EFAULT; |
1da177e4 | 273 | |
6c340eac | 274 | if (block->file_priv != file_priv) |
20caafa6 | 275 | return -EPERM; |
1da177e4 | 276 | |
b5e89ed5 | 277 | free_block(block); |
1da177e4 LT |
278 | return 0; |
279 | } | |
280 | ||
c153f45f | 281 | int radeon_mem_init_heap(struct drm_device *dev, void *data, struct drm_file *file_priv) |
1da177e4 | 282 | { |
1da177e4 | 283 | drm_radeon_private_t *dev_priv = dev->dev_private; |
c153f45f | 284 | drm_radeon_mem_init_heap_t *initheap = data; |
1da177e4 LT |
285 | struct mem_block **heap; |
286 | ||
b5e89ed5 | 287 | if (!dev_priv) { |
3e684eae | 288 | DRM_ERROR("called with no initialization\n"); |
20caafa6 | 289 | return -EINVAL; |
1da177e4 LT |
290 | } |
291 | ||
c153f45f | 292 | heap = get_heap(dev_priv, initheap->region); |
b5e89ed5 | 293 | if (!heap) |
20caafa6 | 294 | return -EFAULT; |
b5e89ed5 | 295 | |
1da177e4 LT |
296 | if (*heap) { |
297 | DRM_ERROR("heap already initialized?"); | |
20caafa6 | 298 | return -EFAULT; |
1da177e4 | 299 | } |
1da177e4 | 300 | |
c153f45f | 301 | return init_heap(heap, initheap->start, initheap->size); |
b5e89ed5 | 302 | } |